Wed, 01 May 2013 08:07:59 -0700
8013418: assert(i == total_args_passed) in AdapterHandlerLibrary::get_adapter since 8-b87
Summary: Do not treat static methods as miranda methods.
Reviewed-by: dholmes, acorn
duke@435 | 1 | /* |
acorn@4497 | 2 | * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #ifndef SHARE_VM_OOPS_METHODDATAOOP_HPP |
stefank@2314 | 26 | #define SHARE_VM_OOPS_METHODDATAOOP_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "interpreter/bytecodes.hpp" |
stefank@2314 | 29 | #include "memory/universe.hpp" |
coleenp@4037 | 30 | #include "oops/method.hpp" |
stefank@2314 | 31 | #include "oops/oop.hpp" |
stefank@2314 | 32 | #include "runtime/orderAccess.hpp" |
stefank@2314 | 33 | |
duke@435 | 34 | class BytecodeStream; |
acorn@4497 | 35 | class KlassSizeStats; |
duke@435 | 36 | |
duke@435 | 37 | // The MethodData object collects counts and other profile information |
duke@435 | 38 | // during zeroth-tier (interpretive) and first-tier execution. |
duke@435 | 39 | // The profile is used later by compilation heuristics. Some heuristics |
duke@435 | 40 | // enable use of aggressive (or "heroic") optimizations. An aggressive |
duke@435 | 41 | // optimization often has a down-side, a corner case that it handles |
duke@435 | 42 | // poorly, but which is thought to be rare. The profile provides |
duke@435 | 43 | // evidence of this rarity for a given method or even BCI. It allows |
duke@435 | 44 | // the compiler to back out of the optimization at places where it |
duke@435 | 45 | // has historically been a poor choice. Other heuristics try to use |
duke@435 | 46 | // specific information gathered about types observed at a given site. |
duke@435 | 47 | // |
duke@435 | 48 | // All data in the profile is approximate. It is expected to be accurate |
duke@435 | 49 | // on the whole, but the system expects occasional inaccuraces, due to |
duke@435 | 50 | // counter overflow, multiprocessor races during data collection, space |
duke@435 | 51 | // limitations, missing MDO blocks, etc. Bad or missing data will degrade |
duke@435 | 52 | // optimization quality but will not affect correctness. Also, each MDO |
duke@435 | 53 | // is marked with its birth-date ("creation_mileage") which can be used |
duke@435 | 54 | // to assess the quality ("maturity") of its data. |
duke@435 | 55 | // |
duke@435 | 56 | // Short (<32-bit) counters are designed to overflow to a known "saturated" |
duke@435 | 57 | // state. Also, certain recorded per-BCI events are given one-bit counters |
duke@435 | 58 | // which overflow to a saturated state which applied to all counters at |
duke@435 | 59 | // that BCI. In other words, there is a small lattice which approximates |
duke@435 | 60 | // the ideal of an infinite-precision counter for each event at each BCI, |
duke@435 | 61 | // and the lattice quickly "bottoms out" in a state where all counters |
duke@435 | 62 | // are taken to be indefinitely large. |
duke@435 | 63 | // |
duke@435 | 64 | // The reader will find many data races in profile gathering code, starting |
duke@435 | 65 | // with invocation counter incrementation. None of these races harm correct |
duke@435 | 66 | // execution of the compiled code. |
duke@435 | 67 | |
ysr@1376 | 68 | // forward decl |
ysr@1376 | 69 | class ProfileData; |
ysr@1376 | 70 | |
duke@435 | 71 | // DataLayout |
duke@435 | 72 | // |
duke@435 | 73 | // Overlay for generic profiling data. |
duke@435 | 74 | class DataLayout VALUE_OBJ_CLASS_SPEC { |
duke@435 | 75 | private: |
duke@435 | 76 | // Every data layout begins with a header. This header |
duke@435 | 77 | // contains a tag, which is used to indicate the size/layout |
duke@435 | 78 | // of the data, 4 bits of flags, which can be used in any way, |
duke@435 | 79 | // 4 bits of trap history (none/one reason/many reasons), |
duke@435 | 80 | // and a bci, which is used to tie this piece of data to a |
duke@435 | 81 | // specific bci in the bytecodes. |
duke@435 | 82 | union { |
duke@435 | 83 | intptr_t _bits; |
duke@435 | 84 | struct { |
duke@435 | 85 | u1 _tag; |
duke@435 | 86 | u1 _flags; |
duke@435 | 87 | u2 _bci; |
duke@435 | 88 | } _struct; |
duke@435 | 89 | } _header; |
duke@435 | 90 | |
duke@435 | 91 | // The data layout has an arbitrary number of cells, each sized |
duke@435 | 92 | // to accomodate a pointer or an integer. |
duke@435 | 93 | intptr_t _cells[1]; |
duke@435 | 94 | |
duke@435 | 95 | // Some types of data layouts need a length field. |
duke@435 | 96 | static bool needs_array_len(u1 tag); |
duke@435 | 97 | |
duke@435 | 98 | public: |
duke@435 | 99 | enum { |
duke@435 | 100 | counter_increment = 1 |
duke@435 | 101 | }; |
duke@435 | 102 | |
duke@435 | 103 | enum { |
duke@435 | 104 | cell_size = sizeof(intptr_t) |
duke@435 | 105 | }; |
duke@435 | 106 | |
duke@435 | 107 | // Tag values |
duke@435 | 108 | enum { |
duke@435 | 109 | no_tag, |
duke@435 | 110 | bit_data_tag, |
duke@435 | 111 | counter_data_tag, |
duke@435 | 112 | jump_data_tag, |
duke@435 | 113 | receiver_type_data_tag, |
duke@435 | 114 | virtual_call_data_tag, |
duke@435 | 115 | ret_data_tag, |
duke@435 | 116 | branch_data_tag, |
kvn@480 | 117 | multi_branch_data_tag, |
kvn@480 | 118 | arg_info_data_tag |
duke@435 | 119 | }; |
duke@435 | 120 | |
duke@435 | 121 | enum { |
duke@435 | 122 | // The _struct._flags word is formatted as [trap_state:4 | flags:4]. |
duke@435 | 123 | // The trap state breaks down further as [recompile:1 | reason:3]. |
duke@435 | 124 | // This further breakdown is defined in deoptimization.cpp. |
duke@435 | 125 | // See Deoptimization::trap_state_reason for an assert that |
duke@435 | 126 | // trap_bits is big enough to hold reasons < Reason_RECORDED_LIMIT. |
duke@435 | 127 | // |
duke@435 | 128 | // The trap_state is collected only if ProfileTraps is true. |
duke@435 | 129 | trap_bits = 1+3, // 3: enough to distinguish [0..Reason_RECORDED_LIMIT]. |
duke@435 | 130 | trap_shift = BitsPerByte - trap_bits, |
duke@435 | 131 | trap_mask = right_n_bits(trap_bits), |
duke@435 | 132 | trap_mask_in_place = (trap_mask << trap_shift), |
duke@435 | 133 | flag_limit = trap_shift, |
duke@435 | 134 | flag_mask = right_n_bits(flag_limit), |
duke@435 | 135 | first_flag = 0 |
duke@435 | 136 | }; |
duke@435 | 137 | |
duke@435 | 138 | // Size computation |
duke@435 | 139 | static int header_size_in_bytes() { |
duke@435 | 140 | return cell_size; |
duke@435 | 141 | } |
duke@435 | 142 | static int header_size_in_cells() { |
duke@435 | 143 | return 1; |
duke@435 | 144 | } |
duke@435 | 145 | |
duke@435 | 146 | static int compute_size_in_bytes(int cell_count) { |
duke@435 | 147 | return header_size_in_bytes() + cell_count * cell_size; |
duke@435 | 148 | } |
duke@435 | 149 | |
duke@435 | 150 | // Initialization |
duke@435 | 151 | void initialize(u1 tag, u2 bci, int cell_count); |
duke@435 | 152 | |
duke@435 | 153 | // Accessors |
duke@435 | 154 | u1 tag() { |
duke@435 | 155 | return _header._struct._tag; |
duke@435 | 156 | } |
duke@435 | 157 | |
duke@435 | 158 | // Return a few bits of trap state. Range is [0..trap_mask]. |
duke@435 | 159 | // The state tells if traps with zero, one, or many reasons have occurred. |
duke@435 | 160 | // It also tells whether zero or many recompilations have occurred. |
duke@435 | 161 | // The associated trap histogram in the MDO itself tells whether |
duke@435 | 162 | // traps are common or not. If a BCI shows that a trap X has |
duke@435 | 163 | // occurred, and the MDO shows N occurrences of X, we make the |
duke@435 | 164 | // simplifying assumption that all N occurrences can be blamed |
duke@435 | 165 | // on that BCI. |
duke@435 | 166 | int trap_state() { |
duke@435 | 167 | return ((_header._struct._flags >> trap_shift) & trap_mask); |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | void set_trap_state(int new_state) { |
duke@435 | 171 | assert(ProfileTraps, "used only under +ProfileTraps"); |
duke@435 | 172 | uint old_flags = (_header._struct._flags & flag_mask); |
duke@435 | 173 | _header._struct._flags = (new_state << trap_shift) | old_flags; |
duke@435 | 174 | } |
duke@435 | 175 | |
duke@435 | 176 | u1 flags() { |
duke@435 | 177 | return _header._struct._flags; |
duke@435 | 178 | } |
duke@435 | 179 | |
duke@435 | 180 | u2 bci() { |
duke@435 | 181 | return _header._struct._bci; |
duke@435 | 182 | } |
duke@435 | 183 | |
duke@435 | 184 | void set_header(intptr_t value) { |
duke@435 | 185 | _header._bits = value; |
duke@435 | 186 | } |
duke@435 | 187 | void release_set_header(intptr_t value) { |
duke@435 | 188 | OrderAccess::release_store_ptr(&_header._bits, value); |
duke@435 | 189 | } |
duke@435 | 190 | intptr_t header() { |
duke@435 | 191 | return _header._bits; |
duke@435 | 192 | } |
duke@435 | 193 | void set_cell_at(int index, intptr_t value) { |
duke@435 | 194 | _cells[index] = value; |
duke@435 | 195 | } |
duke@435 | 196 | void release_set_cell_at(int index, intptr_t value) { |
duke@435 | 197 | OrderAccess::release_store_ptr(&_cells[index], value); |
duke@435 | 198 | } |
duke@435 | 199 | intptr_t cell_at(int index) { |
duke@435 | 200 | return _cells[index]; |
duke@435 | 201 | } |
duke@435 | 202 | |
duke@435 | 203 | void set_flag_at(int flag_number) { |
duke@435 | 204 | assert(flag_number < flag_limit, "oob"); |
duke@435 | 205 | _header._struct._flags |= (0x1 << flag_number); |
duke@435 | 206 | } |
duke@435 | 207 | bool flag_at(int flag_number) { |
duke@435 | 208 | assert(flag_number < flag_limit, "oob"); |
duke@435 | 209 | return (_header._struct._flags & (0x1 << flag_number)) != 0; |
duke@435 | 210 | } |
duke@435 | 211 | |
duke@435 | 212 | // Low-level support for code generation. |
duke@435 | 213 | static ByteSize header_offset() { |
duke@435 | 214 | return byte_offset_of(DataLayout, _header); |
duke@435 | 215 | } |
duke@435 | 216 | static ByteSize tag_offset() { |
duke@435 | 217 | return byte_offset_of(DataLayout, _header._struct._tag); |
duke@435 | 218 | } |
duke@435 | 219 | static ByteSize flags_offset() { |
duke@435 | 220 | return byte_offset_of(DataLayout, _header._struct._flags); |
duke@435 | 221 | } |
duke@435 | 222 | static ByteSize bci_offset() { |
duke@435 | 223 | return byte_offset_of(DataLayout, _header._struct._bci); |
duke@435 | 224 | } |
duke@435 | 225 | static ByteSize cell_offset(int index) { |
coleenp@2615 | 226 | return byte_offset_of(DataLayout, _cells) + in_ByteSize(index * cell_size); |
duke@435 | 227 | } |
duke@435 | 228 | // Return a value which, when or-ed as a byte into _flags, sets the flag. |
duke@435 | 229 | static int flag_number_to_byte_constant(int flag_number) { |
duke@435 | 230 | assert(0 <= flag_number && flag_number < flag_limit, "oob"); |
duke@435 | 231 | DataLayout temp; temp.set_header(0); |
duke@435 | 232 | temp.set_flag_at(flag_number); |
duke@435 | 233 | return temp._header._struct._flags; |
duke@435 | 234 | } |
duke@435 | 235 | // Return a value which, when or-ed as a word into _header, sets the flag. |
duke@435 | 236 | static intptr_t flag_mask_to_header_mask(int byte_constant) { |
duke@435 | 237 | DataLayout temp; temp.set_header(0); |
duke@435 | 238 | temp._header._struct._flags = byte_constant; |
duke@435 | 239 | return temp._header._bits; |
duke@435 | 240 | } |
ysr@1376 | 241 | |
coleenp@4037 | 242 | ProfileData* data_in(); |
coleenp@4037 | 243 | |
ysr@1376 | 244 | // GC support |
coleenp@4037 | 245 | void clean_weak_klass_links(BoolObjectClosure* cl); |
duke@435 | 246 | }; |
duke@435 | 247 | |
duke@435 | 248 | |
duke@435 | 249 | // ProfileData class hierarchy |
duke@435 | 250 | class ProfileData; |
duke@435 | 251 | class BitData; |
duke@435 | 252 | class CounterData; |
duke@435 | 253 | class ReceiverTypeData; |
duke@435 | 254 | class VirtualCallData; |
duke@435 | 255 | class RetData; |
duke@435 | 256 | class JumpData; |
duke@435 | 257 | class BranchData; |
duke@435 | 258 | class ArrayData; |
duke@435 | 259 | class MultiBranchData; |
kvn@480 | 260 | class ArgInfoData; |
duke@435 | 261 | |
duke@435 | 262 | |
duke@435 | 263 | // ProfileData |
duke@435 | 264 | // |
duke@435 | 265 | // A ProfileData object is created to refer to a section of profiling |
duke@435 | 266 | // data in a structured way. |
duke@435 | 267 | class ProfileData : public ResourceObj { |
duke@435 | 268 | private: |
duke@435 | 269 | #ifndef PRODUCT |
duke@435 | 270 | enum { |
duke@435 | 271 | tab_width_one = 16, |
duke@435 | 272 | tab_width_two = 36 |
duke@435 | 273 | }; |
duke@435 | 274 | #endif // !PRODUCT |
duke@435 | 275 | |
duke@435 | 276 | // This is a pointer to a section of profiling data. |
duke@435 | 277 | DataLayout* _data; |
duke@435 | 278 | |
duke@435 | 279 | protected: |
duke@435 | 280 | DataLayout* data() { return _data; } |
duke@435 | 281 | |
duke@435 | 282 | enum { |
duke@435 | 283 | cell_size = DataLayout::cell_size |
duke@435 | 284 | }; |
duke@435 | 285 | |
duke@435 | 286 | public: |
duke@435 | 287 | // How many cells are in this? |
duke@435 | 288 | virtual int cell_count() { |
duke@435 | 289 | ShouldNotReachHere(); |
duke@435 | 290 | return -1; |
duke@435 | 291 | } |
duke@435 | 292 | |
duke@435 | 293 | // Return the size of this data. |
duke@435 | 294 | int size_in_bytes() { |
duke@435 | 295 | return DataLayout::compute_size_in_bytes(cell_count()); |
duke@435 | 296 | } |
duke@435 | 297 | |
duke@435 | 298 | protected: |
duke@435 | 299 | // Low-level accessors for underlying data |
duke@435 | 300 | void set_intptr_at(int index, intptr_t value) { |
duke@435 | 301 | assert(0 <= index && index < cell_count(), "oob"); |
duke@435 | 302 | data()->set_cell_at(index, value); |
duke@435 | 303 | } |
duke@435 | 304 | void release_set_intptr_at(int index, intptr_t value) { |
duke@435 | 305 | assert(0 <= index && index < cell_count(), "oob"); |
duke@435 | 306 | data()->release_set_cell_at(index, value); |
duke@435 | 307 | } |
duke@435 | 308 | intptr_t intptr_at(int index) { |
duke@435 | 309 | assert(0 <= index && index < cell_count(), "oob"); |
duke@435 | 310 | return data()->cell_at(index); |
duke@435 | 311 | } |
duke@435 | 312 | void set_uint_at(int index, uint value) { |
duke@435 | 313 | set_intptr_at(index, (intptr_t) value); |
duke@435 | 314 | } |
duke@435 | 315 | void release_set_uint_at(int index, uint value) { |
duke@435 | 316 | release_set_intptr_at(index, (intptr_t) value); |
duke@435 | 317 | } |
duke@435 | 318 | uint uint_at(int index) { |
duke@435 | 319 | return (uint)intptr_at(index); |
duke@435 | 320 | } |
duke@435 | 321 | void set_int_at(int index, int value) { |
duke@435 | 322 | set_intptr_at(index, (intptr_t) value); |
duke@435 | 323 | } |
duke@435 | 324 | void release_set_int_at(int index, int value) { |
duke@435 | 325 | release_set_intptr_at(index, (intptr_t) value); |
duke@435 | 326 | } |
duke@435 | 327 | int int_at(int index) { |
duke@435 | 328 | return (int)intptr_at(index); |
duke@435 | 329 | } |
duke@435 | 330 | int int_at_unchecked(int index) { |
duke@435 | 331 | return (int)data()->cell_at(index); |
duke@435 | 332 | } |
duke@435 | 333 | void set_oop_at(int index, oop value) { |
duke@435 | 334 | set_intptr_at(index, (intptr_t) value); |
duke@435 | 335 | } |
duke@435 | 336 | oop oop_at(int index) { |
duke@435 | 337 | return (oop)intptr_at(index); |
duke@435 | 338 | } |
duke@435 | 339 | |
duke@435 | 340 | void set_flag_at(int flag_number) { |
duke@435 | 341 | data()->set_flag_at(flag_number); |
duke@435 | 342 | } |
duke@435 | 343 | bool flag_at(int flag_number) { |
duke@435 | 344 | return data()->flag_at(flag_number); |
duke@435 | 345 | } |
duke@435 | 346 | |
duke@435 | 347 | // two convenient imports for use by subclasses: |
duke@435 | 348 | static ByteSize cell_offset(int index) { |
duke@435 | 349 | return DataLayout::cell_offset(index); |
duke@435 | 350 | } |
duke@435 | 351 | static int flag_number_to_byte_constant(int flag_number) { |
duke@435 | 352 | return DataLayout::flag_number_to_byte_constant(flag_number); |
duke@435 | 353 | } |
duke@435 | 354 | |
duke@435 | 355 | ProfileData(DataLayout* data) { |
duke@435 | 356 | _data = data; |
duke@435 | 357 | } |
duke@435 | 358 | |
duke@435 | 359 | public: |
duke@435 | 360 | // Constructor for invalid ProfileData. |
duke@435 | 361 | ProfileData(); |
duke@435 | 362 | |
duke@435 | 363 | u2 bci() { |
duke@435 | 364 | return data()->bci(); |
duke@435 | 365 | } |
duke@435 | 366 | |
duke@435 | 367 | address dp() { |
duke@435 | 368 | return (address)_data; |
duke@435 | 369 | } |
duke@435 | 370 | |
duke@435 | 371 | int trap_state() { |
duke@435 | 372 | return data()->trap_state(); |
duke@435 | 373 | } |
duke@435 | 374 | void set_trap_state(int new_state) { |
duke@435 | 375 | data()->set_trap_state(new_state); |
duke@435 | 376 | } |
duke@435 | 377 | |
duke@435 | 378 | // Type checking |
duke@435 | 379 | virtual bool is_BitData() { return false; } |
duke@435 | 380 | virtual bool is_CounterData() { return false; } |
duke@435 | 381 | virtual bool is_JumpData() { return false; } |
duke@435 | 382 | virtual bool is_ReceiverTypeData(){ return false; } |
duke@435 | 383 | virtual bool is_VirtualCallData() { return false; } |
duke@435 | 384 | virtual bool is_RetData() { return false; } |
duke@435 | 385 | virtual bool is_BranchData() { return false; } |
duke@435 | 386 | virtual bool is_ArrayData() { return false; } |
duke@435 | 387 | virtual bool is_MultiBranchData() { return false; } |
kvn@480 | 388 | virtual bool is_ArgInfoData() { return false; } |
kvn@480 | 389 | |
duke@435 | 390 | |
duke@435 | 391 | BitData* as_BitData() { |
duke@435 | 392 | assert(is_BitData(), "wrong type"); |
duke@435 | 393 | return is_BitData() ? (BitData*) this : NULL; |
duke@435 | 394 | } |
duke@435 | 395 | CounterData* as_CounterData() { |
duke@435 | 396 | assert(is_CounterData(), "wrong type"); |
duke@435 | 397 | return is_CounterData() ? (CounterData*) this : NULL; |
duke@435 | 398 | } |
duke@435 | 399 | JumpData* as_JumpData() { |
duke@435 | 400 | assert(is_JumpData(), "wrong type"); |
duke@435 | 401 | return is_JumpData() ? (JumpData*) this : NULL; |
duke@435 | 402 | } |
duke@435 | 403 | ReceiverTypeData* as_ReceiverTypeData() { |
duke@435 | 404 | assert(is_ReceiverTypeData(), "wrong type"); |
duke@435 | 405 | return is_ReceiverTypeData() ? (ReceiverTypeData*)this : NULL; |
duke@435 | 406 | } |
duke@435 | 407 | VirtualCallData* as_VirtualCallData() { |
duke@435 | 408 | assert(is_VirtualCallData(), "wrong type"); |
duke@435 | 409 | return is_VirtualCallData() ? (VirtualCallData*)this : NULL; |
duke@435 | 410 | } |
duke@435 | 411 | RetData* as_RetData() { |
duke@435 | 412 | assert(is_RetData(), "wrong type"); |
duke@435 | 413 | return is_RetData() ? (RetData*) this : NULL; |
duke@435 | 414 | } |
duke@435 | 415 | BranchData* as_BranchData() { |
duke@435 | 416 | assert(is_BranchData(), "wrong type"); |
duke@435 | 417 | return is_BranchData() ? (BranchData*) this : NULL; |
duke@435 | 418 | } |
duke@435 | 419 | ArrayData* as_ArrayData() { |
duke@435 | 420 | assert(is_ArrayData(), "wrong type"); |
duke@435 | 421 | return is_ArrayData() ? (ArrayData*) this : NULL; |
duke@435 | 422 | } |
duke@435 | 423 | MultiBranchData* as_MultiBranchData() { |
duke@435 | 424 | assert(is_MultiBranchData(), "wrong type"); |
duke@435 | 425 | return is_MultiBranchData() ? (MultiBranchData*)this : NULL; |
duke@435 | 426 | } |
kvn@480 | 427 | ArgInfoData* as_ArgInfoData() { |
kvn@480 | 428 | assert(is_ArgInfoData(), "wrong type"); |
kvn@480 | 429 | return is_ArgInfoData() ? (ArgInfoData*)this : NULL; |
kvn@480 | 430 | } |
duke@435 | 431 | |
duke@435 | 432 | |
duke@435 | 433 | // Subclass specific initialization |
coleenp@4037 | 434 | virtual void post_initialize(BytecodeStream* stream, MethodData* mdo) {} |
duke@435 | 435 | |
duke@435 | 436 | // GC support |
coleenp@4037 | 437 | virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure) {} |
duke@435 | 438 | |
duke@435 | 439 | // CI translation: ProfileData can represent both MethodDataOop data |
duke@435 | 440 | // as well as CIMethodData data. This function is provided for translating |
duke@435 | 441 | // an oop in a ProfileData to the ci equivalent. Generally speaking, |
duke@435 | 442 | // most ProfileData don't require any translation, so we provide the null |
duke@435 | 443 | // translation here, and the required translators are in the ci subclasses. |
duke@435 | 444 | virtual void translate_from(ProfileData* data) {} |
duke@435 | 445 | |
duke@435 | 446 | virtual void print_data_on(outputStream* st) { |
duke@435 | 447 | ShouldNotReachHere(); |
duke@435 | 448 | } |
duke@435 | 449 | |
duke@435 | 450 | #ifndef PRODUCT |
duke@435 | 451 | void print_shared(outputStream* st, const char* name); |
duke@435 | 452 | void tab(outputStream* st); |
duke@435 | 453 | #endif |
duke@435 | 454 | }; |
duke@435 | 455 | |
duke@435 | 456 | // BitData |
duke@435 | 457 | // |
duke@435 | 458 | // A BitData holds a flag or two in its header. |
duke@435 | 459 | class BitData : public ProfileData { |
duke@435 | 460 | protected: |
duke@435 | 461 | enum { |
duke@435 | 462 | // null_seen: |
duke@435 | 463 | // saw a null operand (cast/aastore/instanceof) |
duke@435 | 464 | null_seen_flag = DataLayout::first_flag + 0 |
duke@435 | 465 | }; |
duke@435 | 466 | enum { bit_cell_count = 0 }; // no additional data fields needed. |
duke@435 | 467 | public: |
duke@435 | 468 | BitData(DataLayout* layout) : ProfileData(layout) { |
duke@435 | 469 | } |
duke@435 | 470 | |
duke@435 | 471 | virtual bool is_BitData() { return true; } |
duke@435 | 472 | |
duke@435 | 473 | static int static_cell_count() { |
duke@435 | 474 | return bit_cell_count; |
duke@435 | 475 | } |
duke@435 | 476 | |
duke@435 | 477 | virtual int cell_count() { |
duke@435 | 478 | return static_cell_count(); |
duke@435 | 479 | } |
duke@435 | 480 | |
duke@435 | 481 | // Accessor |
duke@435 | 482 | |
duke@435 | 483 | // The null_seen flag bit is specially known to the interpreter. |
duke@435 | 484 | // Consulting it allows the compiler to avoid setting up null_check traps. |
duke@435 | 485 | bool null_seen() { return flag_at(null_seen_flag); } |
duke@435 | 486 | void set_null_seen() { set_flag_at(null_seen_flag); } |
duke@435 | 487 | |
duke@435 | 488 | |
duke@435 | 489 | // Code generation support |
duke@435 | 490 | static int null_seen_byte_constant() { |
duke@435 | 491 | return flag_number_to_byte_constant(null_seen_flag); |
duke@435 | 492 | } |
duke@435 | 493 | |
duke@435 | 494 | static ByteSize bit_data_size() { |
duke@435 | 495 | return cell_offset(bit_cell_count); |
duke@435 | 496 | } |
duke@435 | 497 | |
duke@435 | 498 | #ifndef PRODUCT |
duke@435 | 499 | void print_data_on(outputStream* st); |
duke@435 | 500 | #endif |
duke@435 | 501 | }; |
duke@435 | 502 | |
duke@435 | 503 | // CounterData |
duke@435 | 504 | // |
duke@435 | 505 | // A CounterData corresponds to a simple counter. |
duke@435 | 506 | class CounterData : public BitData { |
duke@435 | 507 | protected: |
duke@435 | 508 | enum { |
duke@435 | 509 | count_off, |
duke@435 | 510 | counter_cell_count |
duke@435 | 511 | }; |
duke@435 | 512 | public: |
duke@435 | 513 | CounterData(DataLayout* layout) : BitData(layout) {} |
duke@435 | 514 | |
duke@435 | 515 | virtual bool is_CounterData() { return true; } |
duke@435 | 516 | |
duke@435 | 517 | static int static_cell_count() { |
duke@435 | 518 | return counter_cell_count; |
duke@435 | 519 | } |
duke@435 | 520 | |
duke@435 | 521 | virtual int cell_count() { |
duke@435 | 522 | return static_cell_count(); |
duke@435 | 523 | } |
duke@435 | 524 | |
duke@435 | 525 | // Direct accessor |
duke@435 | 526 | uint count() { |
duke@435 | 527 | return uint_at(count_off); |
duke@435 | 528 | } |
duke@435 | 529 | |
duke@435 | 530 | // Code generation support |
duke@435 | 531 | static ByteSize count_offset() { |
duke@435 | 532 | return cell_offset(count_off); |
duke@435 | 533 | } |
duke@435 | 534 | static ByteSize counter_data_size() { |
duke@435 | 535 | return cell_offset(counter_cell_count); |
duke@435 | 536 | } |
duke@435 | 537 | |
kvn@1686 | 538 | void set_count(uint count) { |
kvn@1686 | 539 | set_uint_at(count_off, count); |
kvn@1686 | 540 | } |
kvn@1686 | 541 | |
duke@435 | 542 | #ifndef PRODUCT |
duke@435 | 543 | void print_data_on(outputStream* st); |
duke@435 | 544 | #endif |
duke@435 | 545 | }; |
duke@435 | 546 | |
duke@435 | 547 | // JumpData |
duke@435 | 548 | // |
duke@435 | 549 | // A JumpData is used to access profiling information for a direct |
duke@435 | 550 | // branch. It is a counter, used for counting the number of branches, |
duke@435 | 551 | // plus a data displacement, used for realigning the data pointer to |
duke@435 | 552 | // the corresponding target bci. |
duke@435 | 553 | class JumpData : public ProfileData { |
duke@435 | 554 | protected: |
duke@435 | 555 | enum { |
duke@435 | 556 | taken_off_set, |
duke@435 | 557 | displacement_off_set, |
duke@435 | 558 | jump_cell_count |
duke@435 | 559 | }; |
duke@435 | 560 | |
duke@435 | 561 | void set_displacement(int displacement) { |
duke@435 | 562 | set_int_at(displacement_off_set, displacement); |
duke@435 | 563 | } |
duke@435 | 564 | |
duke@435 | 565 | public: |
duke@435 | 566 | JumpData(DataLayout* layout) : ProfileData(layout) { |
duke@435 | 567 | assert(layout->tag() == DataLayout::jump_data_tag || |
duke@435 | 568 | layout->tag() == DataLayout::branch_data_tag, "wrong type"); |
duke@435 | 569 | } |
duke@435 | 570 | |
duke@435 | 571 | virtual bool is_JumpData() { return true; } |
duke@435 | 572 | |
duke@435 | 573 | static int static_cell_count() { |
duke@435 | 574 | return jump_cell_count; |
duke@435 | 575 | } |
duke@435 | 576 | |
duke@435 | 577 | virtual int cell_count() { |
duke@435 | 578 | return static_cell_count(); |
duke@435 | 579 | } |
duke@435 | 580 | |
duke@435 | 581 | // Direct accessor |
duke@435 | 582 | uint taken() { |
duke@435 | 583 | return uint_at(taken_off_set); |
duke@435 | 584 | } |
never@3105 | 585 | |
never@3105 | 586 | void set_taken(uint cnt) { |
never@3105 | 587 | set_uint_at(taken_off_set, cnt); |
never@3105 | 588 | } |
never@3105 | 589 | |
duke@435 | 590 | // Saturating counter |
duke@435 | 591 | uint inc_taken() { |
duke@435 | 592 | uint cnt = taken() + 1; |
duke@435 | 593 | // Did we wrap? Will compiler screw us?? |
duke@435 | 594 | if (cnt == 0) cnt--; |
duke@435 | 595 | set_uint_at(taken_off_set, cnt); |
duke@435 | 596 | return cnt; |
duke@435 | 597 | } |
duke@435 | 598 | |
duke@435 | 599 | int displacement() { |
duke@435 | 600 | return int_at(displacement_off_set); |
duke@435 | 601 | } |
duke@435 | 602 | |
duke@435 | 603 | // Code generation support |
duke@435 | 604 | static ByteSize taken_offset() { |
duke@435 | 605 | return cell_offset(taken_off_set); |
duke@435 | 606 | } |
duke@435 | 607 | |
duke@435 | 608 | static ByteSize displacement_offset() { |
duke@435 | 609 | return cell_offset(displacement_off_set); |
duke@435 | 610 | } |
duke@435 | 611 | |
duke@435 | 612 | // Specific initialization. |
coleenp@4037 | 613 | void post_initialize(BytecodeStream* stream, MethodData* mdo); |
duke@435 | 614 | |
duke@435 | 615 | #ifndef PRODUCT |
duke@435 | 616 | void print_data_on(outputStream* st); |
duke@435 | 617 | #endif |
duke@435 | 618 | }; |
duke@435 | 619 | |
duke@435 | 620 | // ReceiverTypeData |
duke@435 | 621 | // |
duke@435 | 622 | // A ReceiverTypeData is used to access profiling information about a |
duke@435 | 623 | // dynamic type check. It consists of a counter which counts the total times |
coleenp@4037 | 624 | // that the check is reached, and a series of (Klass*, count) pairs |
duke@435 | 625 | // which are used to store a type profile for the receiver of the check. |
duke@435 | 626 | class ReceiverTypeData : public CounterData { |
duke@435 | 627 | protected: |
duke@435 | 628 | enum { |
duke@435 | 629 | receiver0_offset = counter_cell_count, |
duke@435 | 630 | count0_offset, |
duke@435 | 631 | receiver_type_row_cell_count = (count0_offset + 1) - receiver0_offset |
duke@435 | 632 | }; |
duke@435 | 633 | |
duke@435 | 634 | public: |
duke@435 | 635 | ReceiverTypeData(DataLayout* layout) : CounterData(layout) { |
duke@435 | 636 | assert(layout->tag() == DataLayout::receiver_type_data_tag || |
duke@435 | 637 | layout->tag() == DataLayout::virtual_call_data_tag, "wrong type"); |
duke@435 | 638 | } |
duke@435 | 639 | |
duke@435 | 640 | virtual bool is_ReceiverTypeData() { return true; } |
duke@435 | 641 | |
duke@435 | 642 | static int static_cell_count() { |
duke@435 | 643 | return counter_cell_count + (uint) TypeProfileWidth * receiver_type_row_cell_count; |
duke@435 | 644 | } |
duke@435 | 645 | |
duke@435 | 646 | virtual int cell_count() { |
duke@435 | 647 | return static_cell_count(); |
duke@435 | 648 | } |
duke@435 | 649 | |
duke@435 | 650 | // Direct accessors |
duke@435 | 651 | static uint row_limit() { |
duke@435 | 652 | return TypeProfileWidth; |
duke@435 | 653 | } |
duke@435 | 654 | static int receiver_cell_index(uint row) { |
duke@435 | 655 | return receiver0_offset + row * receiver_type_row_cell_count; |
duke@435 | 656 | } |
duke@435 | 657 | static int receiver_count_cell_index(uint row) { |
duke@435 | 658 | return count0_offset + row * receiver_type_row_cell_count; |
duke@435 | 659 | } |
duke@435 | 660 | |
coleenp@4037 | 661 | Klass* receiver(uint row) { |
duke@435 | 662 | assert(row < row_limit(), "oob"); |
duke@435 | 663 | |
coleenp@4037 | 664 | Klass* recv = (Klass*)intptr_at(receiver_cell_index(row)); |
coleenp@4037 | 665 | assert(recv == NULL || recv->is_klass(), "wrong type"); |
duke@435 | 666 | return recv; |
duke@435 | 667 | } |
duke@435 | 668 | |
coleenp@4037 | 669 | void set_receiver(uint row, Klass* k) { |
ysr@1376 | 670 | assert((uint)row < row_limit(), "oob"); |
coleenp@4037 | 671 | set_intptr_at(receiver_cell_index(row), (uintptr_t)k); |
ysr@1376 | 672 | } |
ysr@1376 | 673 | |
duke@435 | 674 | uint receiver_count(uint row) { |
duke@435 | 675 | assert(row < row_limit(), "oob"); |
duke@435 | 676 | return uint_at(receiver_count_cell_index(row)); |
duke@435 | 677 | } |
duke@435 | 678 | |
ysr@1376 | 679 | void set_receiver_count(uint row, uint count) { |
ysr@1376 | 680 | assert(row < row_limit(), "oob"); |
ysr@1376 | 681 | set_uint_at(receiver_count_cell_index(row), count); |
ysr@1376 | 682 | } |
ysr@1376 | 683 | |
ysr@1376 | 684 | void clear_row(uint row) { |
ysr@1376 | 685 | assert(row < row_limit(), "oob"); |
kvn@1686 | 686 | // Clear total count - indicator of polymorphic call site. |
kvn@1686 | 687 | // The site may look like as monomorphic after that but |
kvn@1686 | 688 | // it allow to have more accurate profiling information because |
kvn@1686 | 689 | // there was execution phase change since klasses were unloaded. |
kvn@1686 | 690 | // If the site is still polymorphic then MDO will be updated |
kvn@1686 | 691 | // to reflect it. But it could be the case that the site becomes |
kvn@1686 | 692 | // only bimorphic. Then keeping total count not 0 will be wrong. |
kvn@1686 | 693 | // Even if we use monomorphic (when it is not) for compilation |
kvn@1686 | 694 | // we will only have trap, deoptimization and recompile again |
kvn@1686 | 695 | // with updated MDO after executing method in Interpreter. |
kvn@1686 | 696 | // An additional receiver will be recorded in the cleaned row |
kvn@1686 | 697 | // during next call execution. |
kvn@1686 | 698 | // |
kvn@1686 | 699 | // Note: our profiling logic works with empty rows in any slot. |
kvn@1686 | 700 | // We do sorting a profiling info (ciCallProfile) for compilation. |
kvn@1686 | 701 | // |
kvn@1686 | 702 | set_count(0); |
ysr@1376 | 703 | set_receiver(row, NULL); |
ysr@1376 | 704 | set_receiver_count(row, 0); |
ysr@1376 | 705 | } |
ysr@1376 | 706 | |
duke@435 | 707 | // Code generation support |
duke@435 | 708 | static ByteSize receiver_offset(uint row) { |
duke@435 | 709 | return cell_offset(receiver_cell_index(row)); |
duke@435 | 710 | } |
duke@435 | 711 | static ByteSize receiver_count_offset(uint row) { |
duke@435 | 712 | return cell_offset(receiver_count_cell_index(row)); |
duke@435 | 713 | } |
duke@435 | 714 | static ByteSize receiver_type_data_size() { |
duke@435 | 715 | return cell_offset(static_cell_count()); |
duke@435 | 716 | } |
duke@435 | 717 | |
duke@435 | 718 | // GC support |
coleenp@4037 | 719 | virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure); |
duke@435 | 720 | |
duke@435 | 721 | #ifndef PRODUCT |
duke@435 | 722 | void print_receiver_data_on(outputStream* st); |
duke@435 | 723 | void print_data_on(outputStream* st); |
duke@435 | 724 | #endif |
duke@435 | 725 | }; |
duke@435 | 726 | |
duke@435 | 727 | // VirtualCallData |
duke@435 | 728 | // |
duke@435 | 729 | // A VirtualCallData is used to access profiling information about a |
duke@435 | 730 | // virtual call. For now, it has nothing more than a ReceiverTypeData. |
duke@435 | 731 | class VirtualCallData : public ReceiverTypeData { |
duke@435 | 732 | public: |
duke@435 | 733 | VirtualCallData(DataLayout* layout) : ReceiverTypeData(layout) { |
duke@435 | 734 | assert(layout->tag() == DataLayout::virtual_call_data_tag, "wrong type"); |
duke@435 | 735 | } |
duke@435 | 736 | |
duke@435 | 737 | virtual bool is_VirtualCallData() { return true; } |
duke@435 | 738 | |
duke@435 | 739 | static int static_cell_count() { |
duke@435 | 740 | // At this point we could add more profile state, e.g., for arguments. |
duke@435 | 741 | // But for now it's the same size as the base record type. |
duke@435 | 742 | return ReceiverTypeData::static_cell_count(); |
duke@435 | 743 | } |
duke@435 | 744 | |
duke@435 | 745 | virtual int cell_count() { |
duke@435 | 746 | return static_cell_count(); |
duke@435 | 747 | } |
duke@435 | 748 | |
duke@435 | 749 | // Direct accessors |
duke@435 | 750 | static ByteSize virtual_call_data_size() { |
duke@435 | 751 | return cell_offset(static_cell_count()); |
duke@435 | 752 | } |
duke@435 | 753 | |
duke@435 | 754 | #ifndef PRODUCT |
duke@435 | 755 | void print_data_on(outputStream* st); |
duke@435 | 756 | #endif |
duke@435 | 757 | }; |
duke@435 | 758 | |
duke@435 | 759 | // RetData |
duke@435 | 760 | // |
duke@435 | 761 | // A RetData is used to access profiling information for a ret bytecode. |
duke@435 | 762 | // It is composed of a count of the number of times that the ret has |
duke@435 | 763 | // been executed, followed by a series of triples of the form |
duke@435 | 764 | // (bci, count, di) which count the number of times that some bci was the |
duke@435 | 765 | // target of the ret and cache a corresponding data displacement. |
duke@435 | 766 | class RetData : public CounterData { |
duke@435 | 767 | protected: |
duke@435 | 768 | enum { |
duke@435 | 769 | bci0_offset = counter_cell_count, |
duke@435 | 770 | count0_offset, |
duke@435 | 771 | displacement0_offset, |
duke@435 | 772 | ret_row_cell_count = (displacement0_offset + 1) - bci0_offset |
duke@435 | 773 | }; |
duke@435 | 774 | |
duke@435 | 775 | void set_bci(uint row, int bci) { |
duke@435 | 776 | assert((uint)row < row_limit(), "oob"); |
duke@435 | 777 | set_int_at(bci0_offset + row * ret_row_cell_count, bci); |
duke@435 | 778 | } |
duke@435 | 779 | void release_set_bci(uint row, int bci) { |
duke@435 | 780 | assert((uint)row < row_limit(), "oob"); |
duke@435 | 781 | // 'release' when setting the bci acts as a valid flag for other |
duke@435 | 782 | // threads wrt bci_count and bci_displacement. |
duke@435 | 783 | release_set_int_at(bci0_offset + row * ret_row_cell_count, bci); |
duke@435 | 784 | } |
duke@435 | 785 | void set_bci_count(uint row, uint count) { |
duke@435 | 786 | assert((uint)row < row_limit(), "oob"); |
duke@435 | 787 | set_uint_at(count0_offset + row * ret_row_cell_count, count); |
duke@435 | 788 | } |
duke@435 | 789 | void set_bci_displacement(uint row, int disp) { |
duke@435 | 790 | set_int_at(displacement0_offset + row * ret_row_cell_count, disp); |
duke@435 | 791 | } |
duke@435 | 792 | |
duke@435 | 793 | public: |
duke@435 | 794 | RetData(DataLayout* layout) : CounterData(layout) { |
duke@435 | 795 | assert(layout->tag() == DataLayout::ret_data_tag, "wrong type"); |
duke@435 | 796 | } |
duke@435 | 797 | |
duke@435 | 798 | virtual bool is_RetData() { return true; } |
duke@435 | 799 | |
duke@435 | 800 | enum { |
duke@435 | 801 | no_bci = -1 // value of bci when bci1/2 are not in use. |
duke@435 | 802 | }; |
duke@435 | 803 | |
duke@435 | 804 | static int static_cell_count() { |
duke@435 | 805 | return counter_cell_count + (uint) BciProfileWidth * ret_row_cell_count; |
duke@435 | 806 | } |
duke@435 | 807 | |
duke@435 | 808 | virtual int cell_count() { |
duke@435 | 809 | return static_cell_count(); |
duke@435 | 810 | } |
duke@435 | 811 | |
duke@435 | 812 | static uint row_limit() { |
duke@435 | 813 | return BciProfileWidth; |
duke@435 | 814 | } |
duke@435 | 815 | static int bci_cell_index(uint row) { |
duke@435 | 816 | return bci0_offset + row * ret_row_cell_count; |
duke@435 | 817 | } |
duke@435 | 818 | static int bci_count_cell_index(uint row) { |
duke@435 | 819 | return count0_offset + row * ret_row_cell_count; |
duke@435 | 820 | } |
duke@435 | 821 | static int bci_displacement_cell_index(uint row) { |
duke@435 | 822 | return displacement0_offset + row * ret_row_cell_count; |
duke@435 | 823 | } |
duke@435 | 824 | |
duke@435 | 825 | // Direct accessors |
duke@435 | 826 | int bci(uint row) { |
duke@435 | 827 | return int_at(bci_cell_index(row)); |
duke@435 | 828 | } |
duke@435 | 829 | uint bci_count(uint row) { |
duke@435 | 830 | return uint_at(bci_count_cell_index(row)); |
duke@435 | 831 | } |
duke@435 | 832 | int bci_displacement(uint row) { |
duke@435 | 833 | return int_at(bci_displacement_cell_index(row)); |
duke@435 | 834 | } |
duke@435 | 835 | |
duke@435 | 836 | // Interpreter Runtime support |
coleenp@4037 | 837 | address fixup_ret(int return_bci, MethodData* mdo); |
duke@435 | 838 | |
duke@435 | 839 | // Code generation support |
duke@435 | 840 | static ByteSize bci_offset(uint row) { |
duke@435 | 841 | return cell_offset(bci_cell_index(row)); |
duke@435 | 842 | } |
duke@435 | 843 | static ByteSize bci_count_offset(uint row) { |
duke@435 | 844 | return cell_offset(bci_count_cell_index(row)); |
duke@435 | 845 | } |
duke@435 | 846 | static ByteSize bci_displacement_offset(uint row) { |
duke@435 | 847 | return cell_offset(bci_displacement_cell_index(row)); |
duke@435 | 848 | } |
duke@435 | 849 | |
duke@435 | 850 | // Specific initialization. |
coleenp@4037 | 851 | void post_initialize(BytecodeStream* stream, MethodData* mdo); |
duke@435 | 852 | |
duke@435 | 853 | #ifndef PRODUCT |
duke@435 | 854 | void print_data_on(outputStream* st); |
duke@435 | 855 | #endif |
duke@435 | 856 | }; |
duke@435 | 857 | |
duke@435 | 858 | // BranchData |
duke@435 | 859 | // |
duke@435 | 860 | // A BranchData is used to access profiling data for a two-way branch. |
duke@435 | 861 | // It consists of taken and not_taken counts as well as a data displacement |
duke@435 | 862 | // for the taken case. |
duke@435 | 863 | class BranchData : public JumpData { |
duke@435 | 864 | protected: |
duke@435 | 865 | enum { |
duke@435 | 866 | not_taken_off_set = jump_cell_count, |
duke@435 | 867 | branch_cell_count |
duke@435 | 868 | }; |
duke@435 | 869 | |
duke@435 | 870 | void set_displacement(int displacement) { |
duke@435 | 871 | set_int_at(displacement_off_set, displacement); |
duke@435 | 872 | } |
duke@435 | 873 | |
duke@435 | 874 | public: |
duke@435 | 875 | BranchData(DataLayout* layout) : JumpData(layout) { |
duke@435 | 876 | assert(layout->tag() == DataLayout::branch_data_tag, "wrong type"); |
duke@435 | 877 | } |
duke@435 | 878 | |
duke@435 | 879 | virtual bool is_BranchData() { return true; } |
duke@435 | 880 | |
duke@435 | 881 | static int static_cell_count() { |
duke@435 | 882 | return branch_cell_count; |
duke@435 | 883 | } |
duke@435 | 884 | |
duke@435 | 885 | virtual int cell_count() { |
duke@435 | 886 | return static_cell_count(); |
duke@435 | 887 | } |
duke@435 | 888 | |
duke@435 | 889 | // Direct accessor |
duke@435 | 890 | uint not_taken() { |
duke@435 | 891 | return uint_at(not_taken_off_set); |
duke@435 | 892 | } |
duke@435 | 893 | |
never@3105 | 894 | void set_not_taken(uint cnt) { |
never@3105 | 895 | set_uint_at(not_taken_off_set, cnt); |
never@3105 | 896 | } |
never@3105 | 897 | |
duke@435 | 898 | uint inc_not_taken() { |
duke@435 | 899 | uint cnt = not_taken() + 1; |
duke@435 | 900 | // Did we wrap? Will compiler screw us?? |
duke@435 | 901 | if (cnt == 0) cnt--; |
duke@435 | 902 | set_uint_at(not_taken_off_set, cnt); |
duke@435 | 903 | return cnt; |
duke@435 | 904 | } |
duke@435 | 905 | |
duke@435 | 906 | // Code generation support |
duke@435 | 907 | static ByteSize not_taken_offset() { |
duke@435 | 908 | return cell_offset(not_taken_off_set); |
duke@435 | 909 | } |
duke@435 | 910 | static ByteSize branch_data_size() { |
duke@435 | 911 | return cell_offset(branch_cell_count); |
duke@435 | 912 | } |
duke@435 | 913 | |
duke@435 | 914 | // Specific initialization. |
coleenp@4037 | 915 | void post_initialize(BytecodeStream* stream, MethodData* mdo); |
duke@435 | 916 | |
duke@435 | 917 | #ifndef PRODUCT |
duke@435 | 918 | void print_data_on(outputStream* st); |
duke@435 | 919 | #endif |
duke@435 | 920 | }; |
duke@435 | 921 | |
duke@435 | 922 | // ArrayData |
duke@435 | 923 | // |
duke@435 | 924 | // A ArrayData is a base class for accessing profiling data which does |
duke@435 | 925 | // not have a statically known size. It consists of an array length |
duke@435 | 926 | // and an array start. |
duke@435 | 927 | class ArrayData : public ProfileData { |
duke@435 | 928 | protected: |
duke@435 | 929 | friend class DataLayout; |
duke@435 | 930 | |
duke@435 | 931 | enum { |
duke@435 | 932 | array_len_off_set, |
duke@435 | 933 | array_start_off_set |
duke@435 | 934 | }; |
duke@435 | 935 | |
duke@435 | 936 | uint array_uint_at(int index) { |
duke@435 | 937 | int aindex = index + array_start_off_set; |
duke@435 | 938 | return uint_at(aindex); |
duke@435 | 939 | } |
duke@435 | 940 | int array_int_at(int index) { |
duke@435 | 941 | int aindex = index + array_start_off_set; |
duke@435 | 942 | return int_at(aindex); |
duke@435 | 943 | } |
duke@435 | 944 | oop array_oop_at(int index) { |
duke@435 | 945 | int aindex = index + array_start_off_set; |
duke@435 | 946 | return oop_at(aindex); |
duke@435 | 947 | } |
duke@435 | 948 | void array_set_int_at(int index, int value) { |
duke@435 | 949 | int aindex = index + array_start_off_set; |
duke@435 | 950 | set_int_at(aindex, value); |
duke@435 | 951 | } |
duke@435 | 952 | |
duke@435 | 953 | // Code generation support for subclasses. |
duke@435 | 954 | static ByteSize array_element_offset(int index) { |
duke@435 | 955 | return cell_offset(array_start_off_set + index); |
duke@435 | 956 | } |
duke@435 | 957 | |
duke@435 | 958 | public: |
duke@435 | 959 | ArrayData(DataLayout* layout) : ProfileData(layout) {} |
duke@435 | 960 | |
duke@435 | 961 | virtual bool is_ArrayData() { return true; } |
duke@435 | 962 | |
duke@435 | 963 | static int static_cell_count() { |
duke@435 | 964 | return -1; |
duke@435 | 965 | } |
duke@435 | 966 | |
duke@435 | 967 | int array_len() { |
duke@435 | 968 | return int_at_unchecked(array_len_off_set); |
duke@435 | 969 | } |
duke@435 | 970 | |
duke@435 | 971 | virtual int cell_count() { |
duke@435 | 972 | return array_len() + 1; |
duke@435 | 973 | } |
duke@435 | 974 | |
duke@435 | 975 | // Code generation support |
duke@435 | 976 | static ByteSize array_len_offset() { |
duke@435 | 977 | return cell_offset(array_len_off_set); |
duke@435 | 978 | } |
duke@435 | 979 | static ByteSize array_start_offset() { |
duke@435 | 980 | return cell_offset(array_start_off_set); |
duke@435 | 981 | } |
duke@435 | 982 | }; |
duke@435 | 983 | |
duke@435 | 984 | // MultiBranchData |
duke@435 | 985 | // |
duke@435 | 986 | // A MultiBranchData is used to access profiling information for |
duke@435 | 987 | // a multi-way branch (*switch bytecodes). It consists of a series |
duke@435 | 988 | // of (count, displacement) pairs, which count the number of times each |
duke@435 | 989 | // case was taken and specify the data displacment for each branch target. |
duke@435 | 990 | class MultiBranchData : public ArrayData { |
duke@435 | 991 | protected: |
duke@435 | 992 | enum { |
duke@435 | 993 | default_count_off_set, |
duke@435 | 994 | default_disaplacement_off_set, |
duke@435 | 995 | case_array_start |
duke@435 | 996 | }; |
duke@435 | 997 | enum { |
duke@435 | 998 | relative_count_off_set, |
duke@435 | 999 | relative_displacement_off_set, |
duke@435 | 1000 | per_case_cell_count |
duke@435 | 1001 | }; |
duke@435 | 1002 | |
duke@435 | 1003 | void set_default_displacement(int displacement) { |
duke@435 | 1004 | array_set_int_at(default_disaplacement_off_set, displacement); |
duke@435 | 1005 | } |
duke@435 | 1006 | void set_displacement_at(int index, int displacement) { |
duke@435 | 1007 | array_set_int_at(case_array_start + |
duke@435 | 1008 | index * per_case_cell_count + |
duke@435 | 1009 | relative_displacement_off_set, |
duke@435 | 1010 | displacement); |
duke@435 | 1011 | } |
duke@435 | 1012 | |
duke@435 | 1013 | public: |
duke@435 | 1014 | MultiBranchData(DataLayout* layout) : ArrayData(layout) { |
duke@435 | 1015 | assert(layout->tag() == DataLayout::multi_branch_data_tag, "wrong type"); |
duke@435 | 1016 | } |
duke@435 | 1017 | |
duke@435 | 1018 | virtual bool is_MultiBranchData() { return true; } |
duke@435 | 1019 | |
duke@435 | 1020 | static int compute_cell_count(BytecodeStream* stream); |
duke@435 | 1021 | |
duke@435 | 1022 | int number_of_cases() { |
duke@435 | 1023 | int alen = array_len() - 2; // get rid of default case here. |
duke@435 | 1024 | assert(alen % per_case_cell_count == 0, "must be even"); |
duke@435 | 1025 | return (alen / per_case_cell_count); |
duke@435 | 1026 | } |
duke@435 | 1027 | |
duke@435 | 1028 | uint default_count() { |
duke@435 | 1029 | return array_uint_at(default_count_off_set); |
duke@435 | 1030 | } |
duke@435 | 1031 | int default_displacement() { |
duke@435 | 1032 | return array_int_at(default_disaplacement_off_set); |
duke@435 | 1033 | } |
duke@435 | 1034 | |
duke@435 | 1035 | uint count_at(int index) { |
duke@435 | 1036 | return array_uint_at(case_array_start + |
duke@435 | 1037 | index * per_case_cell_count + |
duke@435 | 1038 | relative_count_off_set); |
duke@435 | 1039 | } |
duke@435 | 1040 | int displacement_at(int index) { |
duke@435 | 1041 | return array_int_at(case_array_start + |
duke@435 | 1042 | index * per_case_cell_count + |
duke@435 | 1043 | relative_displacement_off_set); |
duke@435 | 1044 | } |
duke@435 | 1045 | |
duke@435 | 1046 | // Code generation support |
duke@435 | 1047 | static ByteSize default_count_offset() { |
duke@435 | 1048 | return array_element_offset(default_count_off_set); |
duke@435 | 1049 | } |
duke@435 | 1050 | static ByteSize default_displacement_offset() { |
duke@435 | 1051 | return array_element_offset(default_disaplacement_off_set); |
duke@435 | 1052 | } |
duke@435 | 1053 | static ByteSize case_count_offset(int index) { |
duke@435 | 1054 | return case_array_offset() + |
duke@435 | 1055 | (per_case_size() * index) + |
duke@435 | 1056 | relative_count_offset(); |
duke@435 | 1057 | } |
duke@435 | 1058 | static ByteSize case_array_offset() { |
duke@435 | 1059 | return array_element_offset(case_array_start); |
duke@435 | 1060 | } |
duke@435 | 1061 | static ByteSize per_case_size() { |
duke@435 | 1062 | return in_ByteSize(per_case_cell_count) * cell_size; |
duke@435 | 1063 | } |
duke@435 | 1064 | static ByteSize relative_count_offset() { |
duke@435 | 1065 | return in_ByteSize(relative_count_off_set) * cell_size; |
duke@435 | 1066 | } |
duke@435 | 1067 | static ByteSize relative_displacement_offset() { |
duke@435 | 1068 | return in_ByteSize(relative_displacement_off_set) * cell_size; |
duke@435 | 1069 | } |
duke@435 | 1070 | |
duke@435 | 1071 | // Specific initialization. |
coleenp@4037 | 1072 | void post_initialize(BytecodeStream* stream, MethodData* mdo); |
duke@435 | 1073 | |
duke@435 | 1074 | #ifndef PRODUCT |
duke@435 | 1075 | void print_data_on(outputStream* st); |
duke@435 | 1076 | #endif |
duke@435 | 1077 | }; |
duke@435 | 1078 | |
kvn@480 | 1079 | class ArgInfoData : public ArrayData { |
kvn@480 | 1080 | |
kvn@480 | 1081 | public: |
kvn@480 | 1082 | ArgInfoData(DataLayout* layout) : ArrayData(layout) { |
kvn@480 | 1083 | assert(layout->tag() == DataLayout::arg_info_data_tag, "wrong type"); |
kvn@480 | 1084 | } |
kvn@480 | 1085 | |
kvn@480 | 1086 | virtual bool is_ArgInfoData() { return true; } |
kvn@480 | 1087 | |
kvn@480 | 1088 | |
kvn@480 | 1089 | int number_of_args() { |
kvn@480 | 1090 | return array_len(); |
kvn@480 | 1091 | } |
kvn@480 | 1092 | |
kvn@480 | 1093 | uint arg_modified(int arg) { |
kvn@480 | 1094 | return array_uint_at(arg); |
kvn@480 | 1095 | } |
kvn@480 | 1096 | |
kvn@480 | 1097 | void set_arg_modified(int arg, uint val) { |
kvn@480 | 1098 | array_set_int_at(arg, val); |
kvn@480 | 1099 | } |
kvn@480 | 1100 | |
kvn@480 | 1101 | #ifndef PRODUCT |
kvn@480 | 1102 | void print_data_on(outputStream* st); |
kvn@480 | 1103 | #endif |
kvn@480 | 1104 | }; |
kvn@480 | 1105 | |
coleenp@4037 | 1106 | // MethodData* |
duke@435 | 1107 | // |
coleenp@4037 | 1108 | // A MethodData* holds information which has been collected about |
duke@435 | 1109 | // a method. Its layout looks like this: |
duke@435 | 1110 | // |
duke@435 | 1111 | // ----------------------------- |
duke@435 | 1112 | // | header | |
duke@435 | 1113 | // | klass | |
duke@435 | 1114 | // ----------------------------- |
duke@435 | 1115 | // | method | |
coleenp@4037 | 1116 | // | size of the MethodData* | |
duke@435 | 1117 | // ----------------------------- |
duke@435 | 1118 | // | Data entries... | |
duke@435 | 1119 | // | (variable size) | |
duke@435 | 1120 | // | | |
duke@435 | 1121 | // . . |
duke@435 | 1122 | // . . |
duke@435 | 1123 | // . . |
duke@435 | 1124 | // | | |
duke@435 | 1125 | // ----------------------------- |
duke@435 | 1126 | // |
duke@435 | 1127 | // The data entry area is a heterogeneous array of DataLayouts. Each |
duke@435 | 1128 | // DataLayout in the array corresponds to a specific bytecode in the |
duke@435 | 1129 | // method. The entries in the array are sorted by the corresponding |
duke@435 | 1130 | // bytecode. Access to the data is via resource-allocated ProfileData, |
duke@435 | 1131 | // which point to the underlying blocks of DataLayout structures. |
duke@435 | 1132 | // |
duke@435 | 1133 | // During interpretation, if profiling in enabled, the interpreter |
duke@435 | 1134 | // maintains a method data pointer (mdp), which points at the entry |
duke@435 | 1135 | // in the array corresponding to the current bci. In the course of |
duke@435 | 1136 | // intepretation, when a bytecode is encountered that has profile data |
duke@435 | 1137 | // associated with it, the entry pointed to by mdp is updated, then the |
duke@435 | 1138 | // mdp is adjusted to point to the next appropriate DataLayout. If mdp |
duke@435 | 1139 | // is NULL to begin with, the interpreter assumes that the current method |
duke@435 | 1140 | // is not (yet) being profiled. |
duke@435 | 1141 | // |
coleenp@4037 | 1142 | // In MethodData* parlance, "dp" is a "data pointer", the actual address |
duke@435 | 1143 | // of a DataLayout element. A "di" is a "data index", the offset in bytes |
duke@435 | 1144 | // from the base of the data entry array. A "displacement" is the byte offset |
duke@435 | 1145 | // in certain ProfileData objects that indicate the amount the mdp must be |
duke@435 | 1146 | // adjusted in the event of a change in control flow. |
duke@435 | 1147 | // |
duke@435 | 1148 | |
coleenp@4037 | 1149 | class MethodData : public Metadata { |
duke@435 | 1150 | friend class VMStructs; |
duke@435 | 1151 | private: |
duke@435 | 1152 | friend class ProfileData; |
duke@435 | 1153 | |
coleenp@4037 | 1154 | // Back pointer to the Method* |
coleenp@4037 | 1155 | Method* _method; |
duke@435 | 1156 | |
duke@435 | 1157 | // Size of this oop in bytes |
duke@435 | 1158 | int _size; |
duke@435 | 1159 | |
duke@435 | 1160 | // Cached hint for bci_to_dp and bci_to_data |
duke@435 | 1161 | int _hint_di; |
duke@435 | 1162 | |
coleenp@4037 | 1163 | MethodData(methodHandle method, int size, TRAPS); |
coleenp@4037 | 1164 | public: |
coleenp@4037 | 1165 | static MethodData* allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS); |
coleenp@4037 | 1166 | MethodData() {}; // For ciMethodData |
coleenp@4037 | 1167 | |
coleenp@4037 | 1168 | bool is_methodData() const volatile { return true; } |
coleenp@4037 | 1169 | |
duke@435 | 1170 | // Whole-method sticky bits and flags |
duke@435 | 1171 | enum { |
kvn@2877 | 1172 | _trap_hist_limit = 17, // decoupled from Deoptimization::Reason_LIMIT |
duke@435 | 1173 | _trap_hist_mask = max_jubyte, |
duke@435 | 1174 | _extra_data_count = 4 // extra DataLayout headers, for trap history |
duke@435 | 1175 | }; // Public flag values |
duke@435 | 1176 | private: |
duke@435 | 1177 | uint _nof_decompiles; // count of all nmethod removals |
duke@435 | 1178 | uint _nof_overflow_recompiles; // recompile count, excluding recomp. bits |
duke@435 | 1179 | uint _nof_overflow_traps; // trap count, excluding _trap_hist |
duke@435 | 1180 | union { |
duke@435 | 1181 | intptr_t _align; |
duke@435 | 1182 | u1 _array[_trap_hist_limit]; |
duke@435 | 1183 | } _trap_hist; |
duke@435 | 1184 | |
duke@435 | 1185 | // Support for interprocedural escape analysis, from Thomas Kotzmann. |
duke@435 | 1186 | intx _eflags; // flags on escape information |
duke@435 | 1187 | intx _arg_local; // bit set of non-escaping arguments |
duke@435 | 1188 | intx _arg_stack; // bit set of stack-allocatable arguments |
duke@435 | 1189 | intx _arg_returned; // bit set of returned arguments |
duke@435 | 1190 | |
iveresov@2138 | 1191 | int _creation_mileage; // method mileage at MDO creation |
iveresov@2138 | 1192 | |
iveresov@2138 | 1193 | // How many invocations has this MDO seen? |
iveresov@2138 | 1194 | // These counters are used to determine the exact age of MDO. |
iveresov@2138 | 1195 | // We need those because in tiered a method can be concurrently |
iveresov@2138 | 1196 | // executed at different levels. |
iveresov@2138 | 1197 | InvocationCounter _invocation_counter; |
iveresov@2138 | 1198 | // Same for backedges. |
iveresov@2138 | 1199 | InvocationCounter _backedge_counter; |
iveresov@2559 | 1200 | // Counter values at the time profiling started. |
iveresov@2559 | 1201 | int _invocation_counter_start; |
iveresov@2559 | 1202 | int _backedge_counter_start; |
iveresov@2138 | 1203 | // Number of loops and blocks is computed when compiling the first |
iveresov@2138 | 1204 | // time with C1. It is used to determine if method is trivial. |
iveresov@2138 | 1205 | short _num_loops; |
iveresov@2138 | 1206 | short _num_blocks; |
iveresov@2138 | 1207 | // Highest compile level this method has ever seen. |
iveresov@2138 | 1208 | u1 _highest_comp_level; |
iveresov@2138 | 1209 | // Same for OSR level |
iveresov@2138 | 1210 | u1 _highest_osr_comp_level; |
iveresov@2138 | 1211 | // Does this method contain anything worth profiling? |
iveresov@2138 | 1212 | bool _would_profile; |
duke@435 | 1213 | |
duke@435 | 1214 | // Size of _data array in bytes. (Excludes header and extra_data fields.) |
duke@435 | 1215 | int _data_size; |
duke@435 | 1216 | |
duke@435 | 1217 | // Beginning of the data entries |
duke@435 | 1218 | intptr_t _data[1]; |
duke@435 | 1219 | |
duke@435 | 1220 | // Helper for size computation |
duke@435 | 1221 | static int compute_data_size(BytecodeStream* stream); |
duke@435 | 1222 | static int bytecode_cell_count(Bytecodes::Code code); |
duke@435 | 1223 | enum { no_profile_data = -1, variable_cell_count = -2 }; |
duke@435 | 1224 | |
duke@435 | 1225 | // Helper for initialization |
coleenp@4037 | 1226 | DataLayout* data_layout_at(int data_index) const { |
duke@435 | 1227 | assert(data_index % sizeof(intptr_t) == 0, "unaligned"); |
duke@435 | 1228 | return (DataLayout*) (((address)_data) + data_index); |
duke@435 | 1229 | } |
duke@435 | 1230 | |
duke@435 | 1231 | // Initialize an individual data segment. Returns the size of |
duke@435 | 1232 | // the segment in bytes. |
duke@435 | 1233 | int initialize_data(BytecodeStream* stream, int data_index); |
duke@435 | 1234 | |
duke@435 | 1235 | // Helper for data_at |
coleenp@4037 | 1236 | DataLayout* limit_data_position() const { |
duke@435 | 1237 | return (DataLayout*)((address)data_base() + _data_size); |
duke@435 | 1238 | } |
coleenp@4037 | 1239 | bool out_of_bounds(int data_index) const { |
duke@435 | 1240 | return data_index >= data_size(); |
duke@435 | 1241 | } |
duke@435 | 1242 | |
duke@435 | 1243 | // Give each of the data entries a chance to perform specific |
duke@435 | 1244 | // data initialization. |
duke@435 | 1245 | void post_initialize(BytecodeStream* stream); |
duke@435 | 1246 | |
duke@435 | 1247 | // hint accessors |
duke@435 | 1248 | int hint_di() const { return _hint_di; } |
duke@435 | 1249 | void set_hint_di(int di) { |
duke@435 | 1250 | assert(!out_of_bounds(di), "hint_di out of bounds"); |
duke@435 | 1251 | _hint_di = di; |
duke@435 | 1252 | } |
duke@435 | 1253 | ProfileData* data_before(int bci) { |
duke@435 | 1254 | // avoid SEGV on this edge case |
duke@435 | 1255 | if (data_size() == 0) |
duke@435 | 1256 | return NULL; |
duke@435 | 1257 | int hint = hint_di(); |
duke@435 | 1258 | if (data_layout_at(hint)->bci() <= bci) |
duke@435 | 1259 | return data_at(hint); |
duke@435 | 1260 | return first_data(); |
duke@435 | 1261 | } |
duke@435 | 1262 | |
duke@435 | 1263 | // What is the index of the first data entry? |
coleenp@4037 | 1264 | int first_di() const { return 0; } |
duke@435 | 1265 | |
duke@435 | 1266 | // Find or create an extra ProfileData: |
duke@435 | 1267 | ProfileData* bci_to_extra_data(int bci, bool create_if_missing); |
duke@435 | 1268 | |
kvn@480 | 1269 | // return the argument info cell |
kvn@480 | 1270 | ArgInfoData *arg_info(); |
kvn@480 | 1271 | |
duke@435 | 1272 | public: |
duke@435 | 1273 | static int header_size() { |
coleenp@4037 | 1274 | return sizeof(MethodData)/wordSize; |
duke@435 | 1275 | } |
duke@435 | 1276 | |
coleenp@4037 | 1277 | // Compute the size of a MethodData* before it is created. |
duke@435 | 1278 | static int compute_allocation_size_in_bytes(methodHandle method); |
duke@435 | 1279 | static int compute_allocation_size_in_words(methodHandle method); |
duke@435 | 1280 | static int compute_extra_data_count(int data_size, int empty_bc_count); |
duke@435 | 1281 | |
duke@435 | 1282 | // Determine if a given bytecode can have profile information. |
duke@435 | 1283 | static bool bytecode_has_profile(Bytecodes::Code code) { |
duke@435 | 1284 | return bytecode_cell_count(code) != no_profile_data; |
duke@435 | 1285 | } |
duke@435 | 1286 | |
iignatyev@4908 | 1287 | // reset into original state |
iignatyev@4908 | 1288 | void init(); |
duke@435 | 1289 | |
duke@435 | 1290 | // My size |
coleenp@4037 | 1291 | int size_in_bytes() const { return _size; } |
coleenp@4037 | 1292 | int size() const { return align_object_size(align_size_up(_size, BytesPerWord)/BytesPerWord); } |
acorn@4497 | 1293 | #if INCLUDE_SERVICES |
acorn@4497 | 1294 | void collect_statistics(KlassSizeStats *sz) const; |
acorn@4497 | 1295 | #endif |
duke@435 | 1296 | |
duke@435 | 1297 | int creation_mileage() const { return _creation_mileage; } |
duke@435 | 1298 | void set_creation_mileage(int x) { _creation_mileage = x; } |
iveresov@2138 | 1299 | |
iveresov@2138 | 1300 | int invocation_count() { |
iveresov@2138 | 1301 | if (invocation_counter()->carry()) { |
iveresov@2138 | 1302 | return InvocationCounter::count_limit; |
iveresov@2138 | 1303 | } |
iveresov@2138 | 1304 | return invocation_counter()->count(); |
iveresov@2138 | 1305 | } |
iveresov@2138 | 1306 | int backedge_count() { |
iveresov@2138 | 1307 | if (backedge_counter()->carry()) { |
iveresov@2138 | 1308 | return InvocationCounter::count_limit; |
iveresov@2138 | 1309 | } |
iveresov@2138 | 1310 | return backedge_counter()->count(); |
iveresov@2138 | 1311 | } |
iveresov@2138 | 1312 | |
iveresov@2559 | 1313 | int invocation_count_start() { |
iveresov@2559 | 1314 | if (invocation_counter()->carry()) { |
iveresov@2559 | 1315 | return 0; |
iveresov@2559 | 1316 | } |
iveresov@2559 | 1317 | return _invocation_counter_start; |
iveresov@2559 | 1318 | } |
iveresov@2559 | 1319 | |
iveresov@2559 | 1320 | int backedge_count_start() { |
iveresov@2559 | 1321 | if (backedge_counter()->carry()) { |
iveresov@2559 | 1322 | return 0; |
iveresov@2559 | 1323 | } |
iveresov@2559 | 1324 | return _backedge_counter_start; |
iveresov@2559 | 1325 | } |
iveresov@2559 | 1326 | |
iveresov@2559 | 1327 | int invocation_count_delta() { return invocation_count() - invocation_count_start(); } |
iveresov@2559 | 1328 | int backedge_count_delta() { return backedge_count() - backedge_count_start(); } |
iveresov@2559 | 1329 | |
iveresov@2559 | 1330 | void reset_start_counters() { |
iveresov@2559 | 1331 | _invocation_counter_start = invocation_count(); |
iveresov@2559 | 1332 | _backedge_counter_start = backedge_count(); |
iveresov@2559 | 1333 | } |
iveresov@2559 | 1334 | |
iveresov@2138 | 1335 | InvocationCounter* invocation_counter() { return &_invocation_counter; } |
iveresov@2138 | 1336 | InvocationCounter* backedge_counter() { return &_backedge_counter; } |
iveresov@2138 | 1337 | |
iveresov@2138 | 1338 | void set_would_profile(bool p) { _would_profile = p; } |
iveresov@2138 | 1339 | bool would_profile() const { return _would_profile; } |
iveresov@2138 | 1340 | |
iveresov@2138 | 1341 | int highest_comp_level() { return _highest_comp_level; } |
iveresov@2138 | 1342 | void set_highest_comp_level(int level) { _highest_comp_level = level; } |
iveresov@2138 | 1343 | int highest_osr_comp_level() { return _highest_osr_comp_level; } |
iveresov@2138 | 1344 | void set_highest_osr_comp_level(int level) { _highest_osr_comp_level = level; } |
iveresov@2138 | 1345 | |
iveresov@2138 | 1346 | int num_loops() const { return _num_loops; } |
iveresov@2138 | 1347 | void set_num_loops(int n) { _num_loops = n; } |
iveresov@2138 | 1348 | int num_blocks() const { return _num_blocks; } |
iveresov@2138 | 1349 | void set_num_blocks(int n) { _num_blocks = n; } |
iveresov@2138 | 1350 | |
duke@435 | 1351 | bool is_mature() const; // consult mileage and ProfileMaturityPercentage |
coleenp@4037 | 1352 | static int mileage_of(Method* m); |
duke@435 | 1353 | |
duke@435 | 1354 | // Support for interprocedural escape analysis, from Thomas Kotzmann. |
duke@435 | 1355 | enum EscapeFlag { |
duke@435 | 1356 | estimated = 1 << 0, |
kvn@513 | 1357 | return_local = 1 << 1, |
kvn@513 | 1358 | return_allocated = 1 << 2, |
kvn@513 | 1359 | allocated_escapes = 1 << 3, |
kvn@513 | 1360 | unknown_modified = 1 << 4 |
duke@435 | 1361 | }; |
duke@435 | 1362 | |
duke@435 | 1363 | intx eflags() { return _eflags; } |
duke@435 | 1364 | intx arg_local() { return _arg_local; } |
duke@435 | 1365 | intx arg_stack() { return _arg_stack; } |
duke@435 | 1366 | intx arg_returned() { return _arg_returned; } |
kvn@480 | 1367 | uint arg_modified(int a) { ArgInfoData *aid = arg_info(); |
iignatyev@4908 | 1368 | assert(aid != NULL, "arg_info must be not null"); |
kvn@480 | 1369 | assert(a >= 0 && a < aid->number_of_args(), "valid argument number"); |
kvn@480 | 1370 | return aid->arg_modified(a); } |
duke@435 | 1371 | |
duke@435 | 1372 | void set_eflags(intx v) { _eflags = v; } |
duke@435 | 1373 | void set_arg_local(intx v) { _arg_local = v; } |
duke@435 | 1374 | void set_arg_stack(intx v) { _arg_stack = v; } |
duke@435 | 1375 | void set_arg_returned(intx v) { _arg_returned = v; } |
kvn@480 | 1376 | void set_arg_modified(int a, uint v) { ArgInfoData *aid = arg_info(); |
iignatyev@4908 | 1377 | assert(aid != NULL, "arg_info must be not null"); |
kvn@480 | 1378 | assert(a >= 0 && a < aid->number_of_args(), "valid argument number"); |
kvn@480 | 1379 | aid->set_arg_modified(a, v); } |
duke@435 | 1380 | |
duke@435 | 1381 | void clear_escape_info() { _eflags = _arg_local = _arg_stack = _arg_returned = 0; } |
duke@435 | 1382 | |
duke@435 | 1383 | // Location and size of data area |
duke@435 | 1384 | address data_base() const { |
duke@435 | 1385 | return (address) _data; |
duke@435 | 1386 | } |
coleenp@4037 | 1387 | int data_size() const { |
duke@435 | 1388 | return _data_size; |
duke@435 | 1389 | } |
duke@435 | 1390 | |
duke@435 | 1391 | // Accessors |
coleenp@4037 | 1392 | Method* method() const { return _method; } |
duke@435 | 1393 | |
duke@435 | 1394 | // Get the data at an arbitrary (sort of) data index. |
coleenp@4037 | 1395 | ProfileData* data_at(int data_index) const; |
duke@435 | 1396 | |
duke@435 | 1397 | // Walk through the data in order. |
coleenp@4037 | 1398 | ProfileData* first_data() const { return data_at(first_di()); } |
coleenp@4037 | 1399 | ProfileData* next_data(ProfileData* current) const; |
coleenp@4037 | 1400 | bool is_valid(ProfileData* current) const { return current != NULL; } |
duke@435 | 1401 | |
duke@435 | 1402 | // Convert a dp (data pointer) to a di (data index). |
coleenp@4037 | 1403 | int dp_to_di(address dp) const { |
duke@435 | 1404 | return dp - ((address)_data); |
duke@435 | 1405 | } |
duke@435 | 1406 | |
duke@435 | 1407 | address di_to_dp(int di) { |
duke@435 | 1408 | return (address)data_layout_at(di); |
duke@435 | 1409 | } |
duke@435 | 1410 | |
duke@435 | 1411 | // bci to di/dp conversion. |
duke@435 | 1412 | address bci_to_dp(int bci); |
duke@435 | 1413 | int bci_to_di(int bci) { |
duke@435 | 1414 | return dp_to_di(bci_to_dp(bci)); |
duke@435 | 1415 | } |
duke@435 | 1416 | |
duke@435 | 1417 | // Get the data at an arbitrary bci, or NULL if there is none. |
duke@435 | 1418 | ProfileData* bci_to_data(int bci); |
duke@435 | 1419 | |
duke@435 | 1420 | // Same, but try to create an extra_data record if one is needed: |
duke@435 | 1421 | ProfileData* allocate_bci_to_data(int bci) { |
duke@435 | 1422 | ProfileData* data = bci_to_data(bci); |
duke@435 | 1423 | return (data != NULL) ? data : bci_to_extra_data(bci, true); |
duke@435 | 1424 | } |
duke@435 | 1425 | |
duke@435 | 1426 | // Add a handful of extra data records, for trap tracking. |
coleenp@4037 | 1427 | DataLayout* extra_data_base() const { return limit_data_position(); } |
coleenp@4037 | 1428 | DataLayout* extra_data_limit() const { return (DataLayout*)((address)this + size_in_bytes()); } |
coleenp@4037 | 1429 | int extra_data_size() const { return (address)extra_data_limit() |
duke@435 | 1430 | - (address)extra_data_base(); } |
duke@435 | 1431 | static DataLayout* next_extra(DataLayout* dp) { return (DataLayout*)((address)dp + in_bytes(DataLayout::cell_offset(0))); } |
duke@435 | 1432 | |
duke@435 | 1433 | // Return (uint)-1 for overflow. |
duke@435 | 1434 | uint trap_count(int reason) const { |
duke@435 | 1435 | assert((uint)reason < _trap_hist_limit, "oob"); |
duke@435 | 1436 | return (int)((_trap_hist._array[reason]+1) & _trap_hist_mask) - 1; |
duke@435 | 1437 | } |
duke@435 | 1438 | // For loops: |
duke@435 | 1439 | static uint trap_reason_limit() { return _trap_hist_limit; } |
duke@435 | 1440 | static uint trap_count_limit() { return _trap_hist_mask; } |
duke@435 | 1441 | uint inc_trap_count(int reason) { |
duke@435 | 1442 | // Count another trap, anywhere in this method. |
duke@435 | 1443 | assert(reason >= 0, "must be single trap"); |
duke@435 | 1444 | if ((uint)reason < _trap_hist_limit) { |
duke@435 | 1445 | uint cnt1 = 1 + _trap_hist._array[reason]; |
duke@435 | 1446 | if ((cnt1 & _trap_hist_mask) != 0) { // if no counter overflow... |
duke@435 | 1447 | _trap_hist._array[reason] = cnt1; |
duke@435 | 1448 | return cnt1; |
duke@435 | 1449 | } else { |
duke@435 | 1450 | return _trap_hist_mask + (++_nof_overflow_traps); |
duke@435 | 1451 | } |
duke@435 | 1452 | } else { |
duke@435 | 1453 | // Could not represent the count in the histogram. |
duke@435 | 1454 | return (++_nof_overflow_traps); |
duke@435 | 1455 | } |
duke@435 | 1456 | } |
duke@435 | 1457 | |
duke@435 | 1458 | uint overflow_trap_count() const { |
duke@435 | 1459 | return _nof_overflow_traps; |
duke@435 | 1460 | } |
duke@435 | 1461 | uint overflow_recompile_count() const { |
duke@435 | 1462 | return _nof_overflow_recompiles; |
duke@435 | 1463 | } |
duke@435 | 1464 | void inc_overflow_recompile_count() { |
duke@435 | 1465 | _nof_overflow_recompiles += 1; |
duke@435 | 1466 | } |
duke@435 | 1467 | uint decompile_count() const { |
duke@435 | 1468 | return _nof_decompiles; |
duke@435 | 1469 | } |
duke@435 | 1470 | void inc_decompile_count() { |
duke@435 | 1471 | _nof_decompiles += 1; |
kvn@1641 | 1472 | if (decompile_count() > (uint)PerMethodRecompilationCutoff) { |
vlivanov@4539 | 1473 | method()->set_not_compilable(CompLevel_full_optimization, true, "decompile_count > PerMethodRecompilationCutoff"); |
kvn@1641 | 1474 | } |
duke@435 | 1475 | } |
duke@435 | 1476 | |
duke@435 | 1477 | // Support for code generation |
duke@435 | 1478 | static ByteSize data_offset() { |
coleenp@4037 | 1479 | return byte_offset_of(MethodData, _data[0]); |
duke@435 | 1480 | } |
duke@435 | 1481 | |
iveresov@2138 | 1482 | static ByteSize invocation_counter_offset() { |
coleenp@4037 | 1483 | return byte_offset_of(MethodData, _invocation_counter); |
iveresov@2138 | 1484 | } |
iveresov@2138 | 1485 | static ByteSize backedge_counter_offset() { |
coleenp@4037 | 1486 | return byte_offset_of(MethodData, _backedge_counter); |
iveresov@2138 | 1487 | } |
iveresov@2138 | 1488 | |
coleenp@4037 | 1489 | // Deallocation support - no pointer fields to deallocate |
coleenp@4037 | 1490 | void deallocate_contents(ClassLoaderData* loader_data) {} |
coleenp@4037 | 1491 | |
duke@435 | 1492 | // GC support |
coleenp@4037 | 1493 | void set_size(int object_size_in_bytes) { _size = object_size_in_bytes; } |
coleenp@4037 | 1494 | |
coleenp@4037 | 1495 | // Printing |
coleenp@4037 | 1496 | #ifndef PRODUCT |
coleenp@4037 | 1497 | void print_on (outputStream* st) const; |
coleenp@4037 | 1498 | #endif |
coleenp@4037 | 1499 | void print_value_on(outputStream* st) const; |
duke@435 | 1500 | |
duke@435 | 1501 | #ifndef PRODUCT |
duke@435 | 1502 | // printing support for method data |
coleenp@4037 | 1503 | void print_data_on(outputStream* st) const; |
duke@435 | 1504 | #endif |
duke@435 | 1505 | |
coleenp@4037 | 1506 | const char* internal_name() const { return "{method data}"; } |
coleenp@4037 | 1507 | |
duke@435 | 1508 | // verification |
coleenp@4037 | 1509 | void verify_on(outputStream* st); |
duke@435 | 1510 | void verify_data_on(outputStream* st); |
duke@435 | 1511 | }; |
stefank@2314 | 1512 | |
stefank@2314 | 1513 | #endif // SHARE_VM_OOPS_METHODDATAOOP_HPP |