annotate src/share/vm/oops/methodData.hpp @ 7615:ada93fe622d1

8067713: Move clean_weak_method_links for redefinition out of class unloading Summary: Do this work during class redefinition, only verify clean during class unloading in debug mode. Reviewed-by: sspitsyn, roland, kbarrett
author coleenp
date Thu, 18 Dec 2014 16:15:21 -0500
parents 0d599246de33
children cbd0cbb0deed
rev   line source
duke@0 1 /*
coleenp@6759 2 * Copyright (c) 2000, 2014, Oracle and/or its affiliates. All rights reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
trims@1472 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1472 20 * or visit www.oracle.com if you need additional information or have any
trims@1472 21 * questions.
duke@0 22 *
duke@0 23 */
duke@0 24
stefank@1879 25 #ifndef SHARE_VM_OOPS_METHODDATAOOP_HPP
stefank@1879 26 #define SHARE_VM_OOPS_METHODDATAOOP_HPP
stefank@1879 27
stefank@1879 28 #include "interpreter/bytecodes.hpp"
stefank@1879 29 #include "memory/universe.hpp"
coleenp@3602 30 #include "oops/method.hpp"
stefank@1879 31 #include "oops/oop.hpp"
stefank@1879 32 #include "runtime/orderAccess.hpp"
stefank@1879 33
duke@0 34 class BytecodeStream;
acorn@4062 35 class KlassSizeStats;
duke@0 36
duke@0 37 // The MethodData object collects counts and other profile information
duke@0 38 // during zeroth-tier (interpretive) and first-tier execution.
duke@0 39 // The profile is used later by compilation heuristics. Some heuristics
duke@0 40 // enable use of aggressive (or "heroic") optimizations. An aggressive
duke@0 41 // optimization often has a down-side, a corner case that it handles
duke@0 42 // poorly, but which is thought to be rare. The profile provides
duke@0 43 // evidence of this rarity for a given method or even BCI. It allows
duke@0 44 // the compiler to back out of the optimization at places where it
duke@0 45 // has historically been a poor choice. Other heuristics try to use
duke@0 46 // specific information gathered about types observed at a given site.
duke@0 47 //
duke@0 48 // All data in the profile is approximate. It is expected to be accurate
duke@0 49 // on the whole, but the system expects occasional inaccuraces, due to
duke@0 50 // counter overflow, multiprocessor races during data collection, space
duke@0 51 // limitations, missing MDO blocks, etc. Bad or missing data will degrade
duke@0 52 // optimization quality but will not affect correctness. Also, each MDO
duke@0 53 // is marked with its birth-date ("creation_mileage") which can be used
duke@0 54 // to assess the quality ("maturity") of its data.
duke@0 55 //
duke@0 56 // Short (<32-bit) counters are designed to overflow to a known "saturated"
duke@0 57 // state. Also, certain recorded per-BCI events are given one-bit counters
duke@0 58 // which overflow to a saturated state which applied to all counters at
duke@0 59 // that BCI. In other words, there is a small lattice which approximates
duke@0 60 // the ideal of an infinite-precision counter for each event at each BCI,
duke@0 61 // and the lattice quickly "bottoms out" in a state where all counters
duke@0 62 // are taken to be indefinitely large.
duke@0 63 //
duke@0 64 // The reader will find many data races in profile gathering code, starting
duke@0 65 // with invocation counter incrementation. None of these races harm correct
duke@0 66 // execution of the compiled code.
duke@0 67
ysr@941 68 // forward decl
ysr@941 69 class ProfileData;
ysr@941 70
duke@0 71 // DataLayout
duke@0 72 //
duke@0 73 // Overlay for generic profiling data.
duke@0 74 class DataLayout VALUE_OBJ_CLASS_SPEC {
twisti@5291 75 friend class VMStructs;
twisti@5291 76
duke@0 77 private:
duke@0 78 // Every data layout begins with a header. This header
duke@0 79 // contains a tag, which is used to indicate the size/layout
duke@0 80 // of the data, 4 bits of flags, which can be used in any way,
duke@0 81 // 4 bits of trap history (none/one reason/many reasons),
duke@0 82 // and a bci, which is used to tie this piece of data to a
duke@0 83 // specific bci in the bytecodes.
duke@0 84 union {
duke@0 85 intptr_t _bits;
duke@0 86 struct {
duke@0 87 u1 _tag;
duke@0 88 u1 _flags;
duke@0 89 u2 _bci;
duke@0 90 } _struct;
duke@0 91 } _header;
duke@0 92
duke@0 93 // The data layout has an arbitrary number of cells, each sized
duke@0 94 // to accomodate a pointer or an integer.
duke@0 95 intptr_t _cells[1];
duke@0 96
duke@0 97 // Some types of data layouts need a length field.
duke@0 98 static bool needs_array_len(u1 tag);
duke@0 99
duke@0 100 public:
duke@0 101 enum {
duke@0 102 counter_increment = 1
duke@0 103 };
duke@0 104
duke@0 105 enum {
duke@0 106 cell_size = sizeof(intptr_t)
duke@0 107 };
duke@0 108
duke@0 109 // Tag values
duke@0 110 enum {
duke@0 111 no_tag,
duke@0 112 bit_data_tag,
duke@0 113 counter_data_tag,
duke@0 114 jump_data_tag,
duke@0 115 receiver_type_data_tag,
duke@0 116 virtual_call_data_tag,
duke@0 117 ret_data_tag,
duke@0 118 branch_data_tag,
kvn@45 119 multi_branch_data_tag,
roland@5479 120 arg_info_data_tag,
roland@5479 121 call_type_data_tag,
roland@5552 122 virtual_call_type_data_tag,
roland@6054 123 parameters_type_data_tag,
roland@6054 124 speculative_trap_data_tag
duke@0 125 };
duke@0 126
duke@0 127 enum {
duke@0 128 // The _struct._flags word is formatted as [trap_state:4 | flags:4].
duke@0 129 // The trap state breaks down further as [recompile:1 | reason:3].
duke@0 130 // This further breakdown is defined in deoptimization.cpp.
duke@0 131 // See Deoptimization::trap_state_reason for an assert that
duke@0 132 // trap_bits is big enough to hold reasons < Reason_RECORDED_LIMIT.
duke@0 133 //
duke@0 134 // The trap_state is collected only if ProfileTraps is true.
duke@0 135 trap_bits = 1+3, // 3: enough to distinguish [0..Reason_RECORDED_LIMIT].
duke@0 136 trap_shift = BitsPerByte - trap_bits,
duke@0 137 trap_mask = right_n_bits(trap_bits),
duke@0 138 trap_mask_in_place = (trap_mask << trap_shift),
duke@0 139 flag_limit = trap_shift,
duke@0 140 flag_mask = right_n_bits(flag_limit),
duke@0 141 first_flag = 0
duke@0 142 };
duke@0 143
duke@0 144 // Size computation
duke@0 145 static int header_size_in_bytes() {
duke@0 146 return cell_size;
duke@0 147 }
duke@0 148 static int header_size_in_cells() {
duke@0 149 return 1;
duke@0 150 }
duke@0 151
duke@0 152 static int compute_size_in_bytes(int cell_count) {
duke@0 153 return header_size_in_bytes() + cell_count * cell_size;
duke@0 154 }
duke@0 155
duke@0 156 // Initialization
duke@0 157 void initialize(u1 tag, u2 bci, int cell_count);
duke@0 158
duke@0 159 // Accessors
duke@0 160 u1 tag() {
duke@0 161 return _header._struct._tag;
duke@0 162 }
duke@0 163
duke@0 164 // Return a few bits of trap state. Range is [0..trap_mask].
duke@0 165 // The state tells if traps with zero, one, or many reasons have occurred.
duke@0 166 // It also tells whether zero or many recompilations have occurred.
duke@0 167 // The associated trap histogram in the MDO itself tells whether
duke@0 168 // traps are common or not. If a BCI shows that a trap X has
duke@0 169 // occurred, and the MDO shows N occurrences of X, we make the
duke@0 170 // simplifying assumption that all N occurrences can be blamed
duke@0 171 // on that BCI.
roland@5479 172 int trap_state() const {
duke@0 173 return ((_header._struct._flags >> trap_shift) & trap_mask);
duke@0 174 }
duke@0 175
duke@0 176 void set_trap_state(int new_state) {
duke@0 177 assert(ProfileTraps, "used only under +ProfileTraps");
duke@0 178 uint old_flags = (_header._struct._flags & flag_mask);
duke@0 179 _header._struct._flags = (new_state << trap_shift) | old_flags;
duke@0 180 }
duke@0 181
roland@5479 182 u1 flags() const {
duke@0 183 return _header._struct._flags;
duke@0 184 }
duke@0 185
roland@5479 186 u2 bci() const {
duke@0 187 return _header._struct._bci;
duke@0 188 }
duke@0 189
duke@0 190 void set_header(intptr_t value) {
duke@0 191 _header._bits = value;
duke@0 192 }
duke@0 193 intptr_t header() {
duke@0 194 return _header._bits;
duke@0 195 }
duke@0 196 void set_cell_at(int index, intptr_t value) {
duke@0 197 _cells[index] = value;
duke@0 198 }
duke@0 199 void release_set_cell_at(int index, intptr_t value) {
duke@0 200 OrderAccess::release_store_ptr(&_cells[index], value);
duke@0 201 }
roland@5479 202 intptr_t cell_at(int index) const {
duke@0 203 return _cells[index];
duke@0 204 }
duke@0 205
duke@0 206 void set_flag_at(int flag_number) {
duke@0 207 assert(flag_number < flag_limit, "oob");
duke@0 208 _header._struct._flags |= (0x1 << flag_number);
duke@0 209 }
roland@5479 210 bool flag_at(int flag_number) const {
duke@0 211 assert(flag_number < flag_limit, "oob");
duke@0 212 return (_header._struct._flags & (0x1 << flag_number)) != 0;
duke@0 213 }
duke@0 214
duke@0 215 // Low-level support for code generation.
duke@0 216 static ByteSize header_offset() {
duke@0 217 return byte_offset_of(DataLayout, _header);
duke@0 218 }
duke@0 219 static ByteSize tag_offset() {
duke@0 220 return byte_offset_of(DataLayout, _header._struct._tag);
duke@0 221 }
duke@0 222 static ByteSize flags_offset() {
duke@0 223 return byte_offset_of(DataLayout, _header._struct._flags);
duke@0 224 }
duke@0 225 static ByteSize bci_offset() {
duke@0 226 return byte_offset_of(DataLayout, _header._struct._bci);
duke@0 227 }
duke@0 228 static ByteSize cell_offset(int index) {
coleenp@2180 229 return byte_offset_of(DataLayout, _cells) + in_ByteSize(index * cell_size);
duke@0 230 }
goetz@5974 231 #ifdef CC_INTERP
goetz@5974 232 static int cell_offset_in_bytes(int index) {
goetz@5974 233 return (int)offset_of(DataLayout, _cells[index]);
goetz@5974 234 }
goetz@5974 235 #endif // CC_INTERP
duke@0 236 // Return a value which, when or-ed as a byte into _flags, sets the flag.
duke@0 237 static int flag_number_to_byte_constant(int flag_number) {
duke@0 238 assert(0 <= flag_number && flag_number < flag_limit, "oob");
duke@0 239 DataLayout temp; temp.set_header(0);
duke@0 240 temp.set_flag_at(flag_number);
duke@0 241 return temp._header._struct._flags;
duke@0 242 }
duke@0 243 // Return a value which, when or-ed as a word into _header, sets the flag.
duke@0 244 static intptr_t flag_mask_to_header_mask(int byte_constant) {
duke@0 245 DataLayout temp; temp.set_header(0);
duke@0 246 temp._header._struct._flags = byte_constant;
duke@0 247 return temp._header._bits;
duke@0 248 }
ysr@941 249
coleenp@3602 250 ProfileData* data_in();
coleenp@3602 251
ysr@941 252 // GC support
coleenp@3602 253 void clean_weak_klass_links(BoolObjectClosure* cl);
roland@6247 254
roland@6247 255 // Redefinition support
roland@6247 256 void clean_weak_method_links();
coleenp@7615 257 DEBUG_ONLY(void verify_clean_weak_method_links();)
duke@0 258 };
duke@0 259
duke@0 260
duke@0 261 // ProfileData class hierarchy
duke@0 262 class ProfileData;
duke@0 263 class BitData;
duke@0 264 class CounterData;
duke@0 265 class ReceiverTypeData;
duke@0 266 class VirtualCallData;
roland@5479 267 class VirtualCallTypeData;
duke@0 268 class RetData;
roland@5479 269 class CallTypeData;
duke@0 270 class JumpData;
duke@0 271 class BranchData;
duke@0 272 class ArrayData;
duke@0 273 class MultiBranchData;
kvn@45 274 class ArgInfoData;
roland@5552 275 class ParametersTypeData;
roland@6054 276 class SpeculativeTrapData;
duke@0 277
duke@0 278 // ProfileData
duke@0 279 //
duke@0 280 // A ProfileData object is created to refer to a section of profiling
duke@0 281 // data in a structured way.
duke@0 282 class ProfileData : public ResourceObj {
roland@5479 283 friend class TypeEntries;
roland@5486 284 friend class ReturnTypeEntry;
roland@5479 285 friend class TypeStackSlotEntries;
duke@0 286 private:
duke@0 287 enum {
duke@0 288 tab_width_one = 16,
duke@0 289 tab_width_two = 36
duke@0 290 };
duke@0 291
duke@0 292 // This is a pointer to a section of profiling data.
duke@0 293 DataLayout* _data;
duke@0 294
roland@6054 295 char* print_data_on_helper(const MethodData* md) const;
roland@6054 296
duke@0 297 protected:
duke@0 298 DataLayout* data() { return _data; }
roland@5479 299 const DataLayout* data() const { return _data; }
duke@0 300
duke@0 301 enum {
duke@0 302 cell_size = DataLayout::cell_size
duke@0 303 };
duke@0 304
duke@0 305 public:
duke@0 306 // How many cells are in this?
roland@5479 307 virtual int cell_count() const {
duke@0 308 ShouldNotReachHere();
duke@0 309 return -1;
duke@0 310 }
duke@0 311
duke@0 312 // Return the size of this data.
duke@0 313 int size_in_bytes() {
duke@0 314 return DataLayout::compute_size_in_bytes(cell_count());
duke@0 315 }
duke@0 316
duke@0 317 protected:
duke@0 318 // Low-level accessors for underlying data
duke@0 319 void set_intptr_at(int index, intptr_t value) {
duke@0 320 assert(0 <= index && index < cell_count(), "oob");
duke@0 321 data()->set_cell_at(index, value);
duke@0 322 }
duke@0 323 void release_set_intptr_at(int index, intptr_t value) {
duke@0 324 assert(0 <= index && index < cell_count(), "oob");
duke@0 325 data()->release_set_cell_at(index, value);
duke@0 326 }
roland@5479 327 intptr_t intptr_at(int index) const {
duke@0 328 assert(0 <= index && index < cell_count(), "oob");
duke@0 329 return data()->cell_at(index);
duke@0 330 }
duke@0 331 void set_uint_at(int index, uint value) {
duke@0 332 set_intptr_at(index, (intptr_t) value);
duke@0 333 }
duke@0 334 void release_set_uint_at(int index, uint value) {
duke@0 335 release_set_intptr_at(index, (intptr_t) value);
duke@0 336 }
roland@5479 337 uint uint_at(int index) const {
duke@0 338 return (uint)intptr_at(index);
duke@0 339 }
duke@0 340 void set_int_at(int index, int value) {
duke@0 341 set_intptr_at(index, (intptr_t) value);
duke@0 342 }
duke@0 343 void release_set_int_at(int index, int value) {
duke@0 344 release_set_intptr_at(index, (intptr_t) value);
duke@0 345 }
roland@5479 346 int int_at(int index) const {
duke@0 347 return (int)intptr_at(index);
duke@0 348 }
roland@5479 349 int int_at_unchecked(int index) const {
duke@0 350 return (int)data()->cell_at(index);
duke@0 351 }
duke@0 352 void set_oop_at(int index, oop value) {
hseigel@5349 353 set_intptr_at(index, cast_from_oop<intptr_t>(value));
duke@0 354 }
roland@5479 355 oop oop_at(int index) const {
hseigel@5349 356 return cast_to_oop(intptr_at(index));
duke@0 357 }
duke@0 358
duke@0 359 void set_flag_at(int flag_number) {
duke@0 360 data()->set_flag_at(flag_number);
duke@0 361 }
roland@5479 362 bool flag_at(int flag_number) const {
duke@0 363 return data()->flag_at(flag_number);
duke@0 364 }
duke@0 365
duke@0 366 // two convenient imports for use by subclasses:
duke@0 367 static ByteSize cell_offset(int index) {
duke@0 368 return DataLayout::cell_offset(index);
duke@0 369 }
duke@0 370 static int flag_number_to_byte_constant(int flag_number) {
duke@0 371 return DataLayout::flag_number_to_byte_constant(flag_number);
duke@0 372 }
duke@0 373
duke@0 374 ProfileData(DataLayout* data) {
duke@0 375 _data = data;
duke@0 376 }
duke@0 377
goetz@5974 378 #ifdef CC_INTERP
goetz@5974 379 // Static low level accessors for DataLayout with ProfileData's semantics.
goetz@5974 380
goetz@5974 381 static int cell_offset_in_bytes(int index) {
goetz@5974 382 return DataLayout::cell_offset_in_bytes(index);
goetz@5974 383 }
goetz@5974 384
goetz@5974 385 static void increment_uint_at_no_overflow(DataLayout* layout, int index,
goetz@5974 386 int inc = DataLayout::counter_increment) {
goetz@5974 387 uint count = ((uint)layout->cell_at(index)) + inc;
goetz@5974 388 if (count == 0) return;
goetz@5974 389 layout->set_cell_at(index, (intptr_t) count);
goetz@5974 390 }
goetz@5974 391
goetz@5974 392 static int int_at(DataLayout* layout, int index) {
goetz@5974 393 return (int)layout->cell_at(index);
goetz@5974 394 }
goetz@5974 395
goetz@5974 396 static int uint_at(DataLayout* layout, int index) {
goetz@5974 397 return (uint)layout->cell_at(index);
goetz@5974 398 }
goetz@5974 399
goetz@5974 400 static oop oop_at(DataLayout* layout, int index) {
simonis@5987 401 return cast_to_oop(layout->cell_at(index));
goetz@5974 402 }
goetz@5974 403
goetz@5974 404 static void set_intptr_at(DataLayout* layout, int index, intptr_t value) {
goetz@5974 405 layout->set_cell_at(index, (intptr_t) value);
goetz@5974 406 }
goetz@5974 407
goetz@5974 408 static void set_flag_at(DataLayout* layout, int flag_number) {
goetz@5974 409 layout->set_flag_at(flag_number);
goetz@5974 410 }
goetz@5974 411 #endif // CC_INTERP
goetz@5974 412
duke@0 413 public:
duke@0 414 // Constructor for invalid ProfileData.
duke@0 415 ProfileData();
duke@0 416
roland@5479 417 u2 bci() const {
duke@0 418 return data()->bci();
duke@0 419 }
duke@0 420
duke@0 421 address dp() {
duke@0 422 return (address)_data;
duke@0 423 }
duke@0 424
roland@5479 425 int trap_state() const {
duke@0 426 return data()->trap_state();
duke@0 427 }
duke@0 428 void set_trap_state(int new_state) {
duke@0 429 data()->set_trap_state(new_state);
duke@0 430 }
duke@0 431
duke@0 432 // Type checking
roland@5479 433 virtual bool is_BitData() const { return false; }
roland@5479 434 virtual bool is_CounterData() const { return false; }
roland@5479 435 virtual bool is_JumpData() const { return false; }
roland@5479 436 virtual bool is_ReceiverTypeData()const { return false; }
roland@5479 437 virtual bool is_VirtualCallData() const { return false; }
roland@5479 438 virtual bool is_RetData() const { return false; }
roland@5479 439 virtual bool is_BranchData() const { return false; }
roland@5479 440 virtual bool is_ArrayData() const { return false; }
roland@5479 441 virtual bool is_MultiBranchData() const { return false; }
roland@5479 442 virtual bool is_ArgInfoData() const { return false; }
roland@5479 443 virtual bool is_CallTypeData() const { return false; }
roland@5479 444 virtual bool is_VirtualCallTypeData()const { return false; }
roland@5552 445 virtual bool is_ParametersTypeData() const { return false; }
roland@6054 446 virtual bool is_SpeculativeTrapData()const { return false; }
kvn@45 447
duke@0 448
roland@5479 449 BitData* as_BitData() const {
duke@0 450 assert(is_BitData(), "wrong type");
duke@0 451 return is_BitData() ? (BitData*) this : NULL;
duke@0 452 }
roland@5479 453 CounterData* as_CounterData() const {
duke@0 454 assert(is_CounterData(), "wrong type");
duke@0 455 return is_CounterData() ? (CounterData*) this : NULL;
duke@0 456 }
roland@5479 457 JumpData* as_JumpData() const {
duke@0 458 assert(is_JumpData(), "wrong type");
duke@0 459 return is_JumpData() ? (JumpData*) this : NULL;
duke@0 460 }
roland@5479 461 ReceiverTypeData* as_ReceiverTypeData() const {
duke@0 462 assert(is_ReceiverTypeData(), "wrong type");
duke@0 463 return is_ReceiverTypeData() ? (ReceiverTypeData*)this : NULL;
duke@0 464 }
roland@5479 465 VirtualCallData* as_VirtualCallData() const {
duke@0 466 assert(is_VirtualCallData(), "wrong type");
duke@0 467 return is_VirtualCallData() ? (VirtualCallData*)this : NULL;
duke@0 468 }
roland@5479 469 RetData* as_RetData() const {
duke@0 470 assert(is_RetData(), "wrong type");
duke@0 471 return is_RetData() ? (RetData*) this : NULL;
duke@0 472 }
roland@5479 473 BranchData* as_BranchData() const {
duke@0 474 assert(is_BranchData(), "wrong type");
duke@0 475 return is_BranchData() ? (BranchData*) this : NULL;
duke@0 476 }
roland@5479 477 ArrayData* as_ArrayData() const {
duke@0 478 assert(is_ArrayData(), "wrong type");
duke@0 479 return is_ArrayData() ? (ArrayData*) this : NULL;
duke@0 480 }
roland@5479 481 MultiBranchData* as_MultiBranchData() const {
duke@0 482 assert(is_MultiBranchData(), "wrong type");
duke@0 483 return is_MultiBranchData() ? (MultiBranchData*)this : NULL;
duke@0 484 }
roland@5479 485 ArgInfoData* as_ArgInfoData() const {
kvn@45 486 assert(is_ArgInfoData(), "wrong type");
kvn@45 487 return is_ArgInfoData() ? (ArgInfoData*)this : NULL;
kvn@45 488 }
roland@5479 489 CallTypeData* as_CallTypeData() const {
roland@5479 490 assert(is_CallTypeData(), "wrong type");
roland@5479 491 return is_CallTypeData() ? (CallTypeData*)this : NULL;
roland@5479 492 }
roland@5479 493 VirtualCallTypeData* as_VirtualCallTypeData() const {
roland@5479 494 assert(is_VirtualCallTypeData(), "wrong type");
roland@5479 495 return is_VirtualCallTypeData() ? (VirtualCallTypeData*)this : NULL;
roland@5479 496 }
roland@5552 497 ParametersTypeData* as_ParametersTypeData() const {
roland@5552 498 assert(is_ParametersTypeData(), "wrong type");
roland@5552 499 return is_ParametersTypeData() ? (ParametersTypeData*)this : NULL;
roland@5552 500 }
roland@6054 501 SpeculativeTrapData* as_SpeculativeTrapData() const {
roland@6054 502 assert(is_SpeculativeTrapData(), "wrong type");
roland@6054 503 return is_SpeculativeTrapData() ? (SpeculativeTrapData*)this : NULL;
roland@6054 504 }
duke@0 505
duke@0 506
duke@0 507 // Subclass specific initialization
coleenp@3602 508 virtual void post_initialize(BytecodeStream* stream, MethodData* mdo) {}
duke@0 509
duke@0 510 // GC support
coleenp@3602 511 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure) {}
duke@0 512
roland@6247 513 // Redefinition support
roland@6247 514 virtual void clean_weak_method_links() {}
coleenp@7615 515 DEBUG_ONLY(virtual void verify_clean_weak_method_links() {})
roland@6247 516
duke@0 517 // CI translation: ProfileData can represent both MethodDataOop data
duke@0 518 // as well as CIMethodData data. This function is provided for translating
duke@0 519 // an oop in a ProfileData to the ci equivalent. Generally speaking,
duke@0 520 // most ProfileData don't require any translation, so we provide the null
duke@0 521 // translation here, and the required translators are in the ci subclasses.
roland@5479 522 virtual void translate_from(const ProfileData* data) {}
duke@0 523
roland@6054 524 virtual void print_data_on(outputStream* st, const char* extra = NULL) const {
duke@0 525 ShouldNotReachHere();
duke@0 526 }
duke@0 527
roland@6054 528 void print_data_on(outputStream* st, const MethodData* md) const;
roland@6054 529
roland@6054 530 void print_shared(outputStream* st, const char* name, const char* extra) const;
roland@5479 531 void tab(outputStream* st, bool first = false) const;
duke@0 532 };
duke@0 533
duke@0 534 // BitData
duke@0 535 //
duke@0 536 // A BitData holds a flag or two in its header.
duke@0 537 class BitData : public ProfileData {
duke@0 538 protected:
duke@0 539 enum {
duke@0 540 // null_seen:
duke@0 541 // saw a null operand (cast/aastore/instanceof)
duke@0 542 null_seen_flag = DataLayout::first_flag + 0
duke@0 543 };
duke@0 544 enum { bit_cell_count = 0 }; // no additional data fields needed.
duke@0 545 public:
duke@0 546 BitData(DataLayout* layout) : ProfileData(layout) {
duke@0 547 }
duke@0 548
roland@5479 549 virtual bool is_BitData() const { return true; }
duke@0 550
duke@0 551 static int static_cell_count() {
duke@0 552 return bit_cell_count;
duke@0 553 }
duke@0 554
roland@5479 555 virtual int cell_count() const {
duke@0 556 return static_cell_count();
duke@0 557 }
duke@0 558
duke@0 559 // Accessor
duke@0 560
duke@0 561 // The null_seen flag bit is specially known to the interpreter.
duke@0 562 // Consulting it allows the compiler to avoid setting up null_check traps.
duke@0 563 bool null_seen() { return flag_at(null_seen_flag); }
duke@0 564 void set_null_seen() { set_flag_at(null_seen_flag); }
duke@0 565
duke@0 566
duke@0 567 // Code generation support
duke@0 568 static int null_seen_byte_constant() {
duke@0 569 return flag_number_to_byte_constant(null_seen_flag);
duke@0 570 }
duke@0 571
duke@0 572 static ByteSize bit_data_size() {
duke@0 573 return cell_offset(bit_cell_count);
duke@0 574 }
duke@0 575
goetz@5974 576 #ifdef CC_INTERP
goetz@5974 577 static int bit_data_size_in_bytes() {
goetz@5974 578 return cell_offset_in_bytes(bit_cell_count);
goetz@5974 579 }
goetz@5974 580
goetz@5974 581 static void set_null_seen(DataLayout* layout) {
goetz@5974 582 set_flag_at(layout, null_seen_flag);
goetz@5974 583 }
goetz@5974 584
goetz@5974 585 static DataLayout* advance(DataLayout* layout) {
goetz@5974 586 return (DataLayout*) (((address)layout) + (ssize_t)BitData::bit_data_size_in_bytes());
goetz@5974 587 }
goetz@5974 588 #endif // CC_INTERP
goetz@5974 589
roland@6054 590 void print_data_on(outputStream* st, const char* extra = NULL) const;
duke@0 591 };
duke@0 592
duke@0 593 // CounterData
duke@0 594 //
duke@0 595 // A CounterData corresponds to a simple counter.
duke@0 596 class CounterData : public BitData {
duke@0 597 protected:
duke@0 598 enum {
duke@0 599 count_off,
duke@0 600 counter_cell_count
duke@0 601 };
duke@0 602 public:
duke@0 603 CounterData(DataLayout* layout) : BitData(layout) {}
duke@0 604
roland@5479 605 virtual bool is_CounterData() const { return true; }
duke@0 606
duke@0 607 static int static_cell_count() {
duke@0 608 return counter_cell_count;
duke@0 609 }
duke@0 610
roland@5479 611 virtual int cell_count() const {
duke@0 612 return static_cell_count();
duke@0 613 }
duke@0 614
duke@0 615 // Direct accessor
roland@5479 616 uint count() const {
duke@0 617 return uint_at(count_off);
duke@0 618 }
duke@0 619
duke@0 620 // Code generation support
duke@0 621 static ByteSize count_offset() {
duke@0 622 return cell_offset(count_off);
duke@0 623 }
duke@0 624 static ByteSize counter_data_size() {
duke@0 625 return cell_offset(counter_cell_count);
duke@0 626 }
duke@0 627
kvn@1251 628 void set_count(uint count) {
kvn@1251 629 set_uint_at(count_off, count);
kvn@1251 630 }
kvn@1251 631
goetz@5974 632 #ifdef CC_INTERP
goetz@5974 633 static int counter_data_size_in_bytes() {
goetz@5974 634 return cell_offset_in_bytes(counter_cell_count);
goetz@5974 635 }
goetz@5974 636
goetz@5974 637 static void increment_count_no_overflow(DataLayout* layout) {
goetz@5974 638 increment_uint_at_no_overflow(layout, count_off);
goetz@5974 639 }
goetz@5974 640
goetz@5974 641 // Support counter decrementation at checkcast / subtype check failed.
goetz@5974 642 static void decrement_count(DataLayout* layout) {
goetz@5974 643 increment_uint_at_no_overflow(layout, count_off, -1);
goetz@5974 644 }
goetz@5974 645
goetz@5974 646 static DataLayout* advance(DataLayout* layout) {
goetz@5974 647 return (DataLayout*) (((address)layout) + (ssize_t)CounterData::counter_data_size_in_bytes());
goetz@5974 648 }
goetz@5974 649 #endif // CC_INTERP
goetz@5974 650
roland@6054 651 void print_data_on(outputStream* st, const char* extra = NULL) const;
duke@0 652 };
duke@0 653
duke@0 654 // JumpData
duke@0 655 //
duke@0 656 // A JumpData is used to access profiling information for a direct
duke@0 657 // branch. It is a counter, used for counting the number of branches,
duke@0 658 // plus a data displacement, used for realigning the data pointer to
duke@0 659 // the corresponding target bci.
duke@0 660 class JumpData : public ProfileData {
duke@0 661 protected:
duke@0 662 enum {
duke@0 663 taken_off_set,
duke@0 664 displacement_off_set,
duke@0 665 jump_cell_count
duke@0 666 };
duke@0 667
duke@0 668 void set_displacement(int displacement) {
duke@0 669 set_int_at(displacement_off_set, displacement);
duke@0 670 }
duke@0 671
duke@0 672 public:
duke@0 673 JumpData(DataLayout* layout) : ProfileData(layout) {
duke@0 674 assert(layout->tag() == DataLayout::jump_data_tag ||
duke@0 675 layout->tag() == DataLayout::branch_data_tag, "wrong type");
duke@0 676 }
duke@0 677
roland@5479 678 virtual bool is_JumpData() const { return true; }
duke@0 679
duke@0 680 static int static_cell_count() {
duke@0 681 return jump_cell_count;
duke@0 682 }
duke@0 683
roland@5479 684 virtual int cell_count() const {
duke@0 685 return static_cell_count();
duke@0 686 }
duke@0 687
duke@0 688 // Direct accessor
roland@5479 689 uint taken() const {
duke@0 690 return uint_at(taken_off_set);
duke@0 691 }
never@2670 692
never@2670 693 void set_taken(uint cnt) {
never@2670 694 set_uint_at(taken_off_set, cnt);
never@2670 695 }
never@2670 696
duke@0 697 // Saturating counter
duke@0 698 uint inc_taken() {
duke@0 699 uint cnt = taken() + 1;
duke@0 700 // Did we wrap? Will compiler screw us??
duke@0 701 if (cnt == 0) cnt--;
duke@0 702 set_uint_at(taken_off_set, cnt);
duke@0 703 return cnt;
duke@0 704 }
duke@0 705
roland@5479 706 int displacement() const {
duke@0 707 return int_at(displacement_off_set);
duke@0 708 }
duke@0 709
duke@0 710 // Code generation support
duke@0 711 static ByteSize taken_offset() {
duke@0 712 return cell_offset(taken_off_set);
duke@0 713 }
duke@0 714
duke@0 715 static ByteSize displacement_offset() {
duke@0 716 return cell_offset(displacement_off_set);
duke@0 717 }
duke@0 718
goetz@5974 719 #ifdef CC_INTERP
goetz@5974 720 static void increment_taken_count_no_overflow(DataLayout* layout) {
goetz@5974 721 increment_uint_at_no_overflow(layout, taken_off_set);
goetz@5974 722 }
goetz@5974 723
goetz@5974 724 static DataLayout* advance_taken(DataLayout* layout) {
goetz@5974 725 return (DataLayout*) (((address)layout) + (ssize_t)int_at(layout, displacement_off_set));
goetz@5974 726 }
goetz@5974 727
goetz@5974 728 static uint taken_count(DataLayout* layout) {
goetz@5974 729 return (uint) uint_at(layout, taken_off_set);
goetz@5974 730 }
goetz@5974 731 #endif // CC_INTERP
goetz@5974 732
duke@0 733 // Specific initialization.
coleenp@3602 734 void post_initialize(BytecodeStream* stream, MethodData* mdo);
duke@0 735
roland@6054 736 void print_data_on(outputStream* st, const char* extra = NULL) const;
roland@5479 737 };
roland@5479 738
roland@5479 739 // Entries in a ProfileData object to record types: it can either be
roland@5479 740 // none (no profile), unknown (conflicting profile data) or a klass if
roland@5479 741 // a single one is seen. Whether a null reference was seen is also
roland@5479 742 // recorded. No counter is associated with the type and a single type
roland@5479 743 // is tracked (unlike VirtualCallData).
roland@5479 744 class TypeEntries {
roland@5479 745
roland@5479 746 public:
roland@5479 747
roland@5479 748 // A single cell is used to record information for a type:
roland@5479 749 // - the cell is initialized to 0
roland@5479 750 // - when a type is discovered it is stored in the cell
roland@5479 751 // - bit zero of the cell is used to record whether a null reference
roland@5479 752 // was encountered or not
roland@5479 753 // - bit 1 is set to record a conflict in the type information
roland@5479 754
roland@5479 755 enum {
roland@5479 756 null_seen = 1,
roland@5479 757 type_mask = ~null_seen,
roland@5479 758 type_unknown = 2,
roland@5479 759 status_bits = null_seen | type_unknown,
roland@5479 760 type_klass_mask = ~status_bits
roland@5479 761 };
roland@5479 762
roland@5479 763 // what to initialize a cell to
roland@5479 764 static intptr_t type_none() {
roland@5479 765 return 0;
roland@5479 766 }
roland@5479 767
roland@5479 768 // null seen = bit 0 set?
roland@5479 769 static bool was_null_seen(intptr_t v) {
roland@5479 770 return (v & null_seen) != 0;
roland@5479 771 }
roland@5479 772
roland@5479 773 // conflicting type information = bit 1 set?
roland@5479 774 static bool is_type_unknown(intptr_t v) {
roland@5479 775 return (v & type_unknown) != 0;
roland@5479 776 }
roland@5479 777
roland@5479 778 // not type information yet = all bits cleared, ignoring bit 0?
roland@5479 779 static bool is_type_none(intptr_t v) {
roland@5479 780 return (v & type_mask) == 0;
roland@5479 781 }
roland@5479 782
roland@5479 783 // recorded type: cell without bit 0 and 1
roland@5479 784 static intptr_t klass_part(intptr_t v) {
roland@5479 785 intptr_t r = v & type_klass_mask;
roland@5479 786 return r;
roland@5479 787 }
roland@5479 788
roland@5479 789 // type recorded
roland@5479 790 static Klass* valid_klass(intptr_t k) {
roland@5479 791 if (!is_type_none(k) &&
roland@5479 792 !is_type_unknown(k)) {
roland@5670 793 Klass* res = (Klass*)klass_part(k);
roland@5670 794 assert(res != NULL, "invalid");
roland@5670 795 return res;
roland@5479 796 } else {
roland@5479 797 return NULL;
roland@5479 798 }
roland@5479 799 }
roland@5479 800
roland@5479 801 static intptr_t with_status(intptr_t k, intptr_t in) {
roland@5479 802 return k | (in & status_bits);
roland@5479 803 }
roland@5479 804
roland@5479 805 static intptr_t with_status(Klass* k, intptr_t in) {
roland@5479 806 return with_status((intptr_t)k, in);
roland@5479 807 }
roland@5479 808
roland@5479 809 static void print_klass(outputStream* st, intptr_t k);
roland@5479 810
roland@5479 811 // GC support
roland@5479 812 static bool is_loader_alive(BoolObjectClosure* is_alive_cl, intptr_t p);
roland@5479 813
roland@5479 814 protected:
roland@5479 815 // ProfileData object these entries are part of
roland@5479 816 ProfileData* _pd;
roland@5479 817 // offset within the ProfileData object where the entries start
roland@5479 818 const int _base_off;
roland@5479 819
roland@5479 820 TypeEntries(int base_off)
roland@5479 821 : _base_off(base_off), _pd(NULL) {}
roland@5479 822
roland@5479 823 void set_intptr_at(int index, intptr_t value) {
roland@5479 824 _pd->set_intptr_at(index, value);
roland@5479 825 }
roland@5479 826
roland@5479 827 intptr_t intptr_at(int index) const {
roland@5479 828 return _pd->intptr_at(index);
roland@5479 829 }
roland@5479 830
roland@5479 831 public:
roland@5479 832 void set_profile_data(ProfileData* pd) {
roland@5479 833 _pd = pd;
roland@5479 834 }
roland@5479 835 };
roland@5479 836
roland@5479 837 // Type entries used for arguments passed at a call and parameters on
roland@5479 838 // method entry. 2 cells per entry: one for the type encoded as in
roland@5479 839 // TypeEntries and one initialized with the stack slot where the
roland@5479 840 // profiled object is to be found so that the interpreter can locate
roland@5479 841 // it quickly.
roland@5479 842 class TypeStackSlotEntries : public TypeEntries {
roland@5479 843
roland@5479 844 private:
roland@5479 845 enum {
roland@5479 846 stack_slot_entry,
roland@5479 847 type_entry,
roland@5479 848 per_arg_cell_count
roland@5479 849 };
roland@5479 850
roland@5479 851 // offset of cell for stack slot for entry i within ProfileData object
roland@5486 852 int stack_slot_offset(int i) const {
roland@5479 853 return _base_off + stack_slot_local_offset(i);
roland@5479 854 }
roland@5479 855
roland@5486 856 const int _number_of_entries;
roland@5479 857
roland@5479 858 // offset of cell for type for entry i within ProfileData object
roland@6464 859 int type_offset_in_cells(int i) const {
roland@5479 860 return _base_off + type_local_offset(i);
roland@5479 861 }
roland@5479 862
roland@5479 863 public:
roland@5479 864
roland@5486 865 TypeStackSlotEntries(int base_off, int nb_entries)
roland@5486 866 : TypeEntries(base_off), _number_of_entries(nb_entries) {}
roland@5479 867
roland@5552 868 static int compute_cell_count(Symbol* signature, bool include_receiver, int max);
roland@5479 869
roland@5552 870 void post_initialize(Symbol* signature, bool has_receiver, bool include_receiver);
roland@5479 871
roland@6464 872 int number_of_entries() const { return _number_of_entries; }
roland@6464 873
roland@5479 874 // offset of cell for stack slot for entry i within this block of cells for a TypeStackSlotEntries
roland@5479 875 static int stack_slot_local_offset(int i) {
roland@5486 876 return i * per_arg_cell_count + stack_slot_entry;
roland@5479 877 }
roland@5479 878
roland@5479 879 // offset of cell for type for entry i within this block of cells for a TypeStackSlotEntries
roland@5479 880 static int type_local_offset(int i) {
roland@5486 881 return i * per_arg_cell_count + type_entry;
roland@5479 882 }
roland@5479 883
roland@5479 884 // stack slot for entry i
roland@5479 885 uint stack_slot(int i) const {
roland@5486 886 assert(i >= 0 && i < _number_of_entries, "oob");
roland@5486 887 return _pd->uint_at(stack_slot_offset(i));
roland@5479 888 }
roland@5479 889
roland@5479 890 // set stack slot for entry i
roland@5479 891 void set_stack_slot(int i, uint num) {
roland@5486 892 assert(i >= 0 && i < _number_of_entries, "oob");
roland@5486 893 _pd->set_uint_at(stack_slot_offset(i), num);
roland@5479 894 }
roland@5479 895
roland@5479 896 // type for entry i
roland@5479 897 intptr_t type(int i) const {
roland@5486 898 assert(i >= 0 && i < _number_of_entries, "oob");
roland@6464 899 return _pd->intptr_at(type_offset_in_cells(i));
roland@5479 900 }
roland@5479 901
roland@5479 902 // set type for entry i
roland@5479 903 void set_type(int i, intptr_t k) {
roland@5486 904 assert(i >= 0 && i < _number_of_entries, "oob");
roland@6464 905 _pd->set_intptr_at(type_offset_in_cells(i), k);
roland@5479 906 }
roland@5479 907
roland@5479 908 static ByteSize per_arg_size() {
roland@5479 909 return in_ByteSize(per_arg_cell_count * DataLayout::cell_size);
roland@5479 910 }
roland@5479 911
roland@5479 912 static int per_arg_count() {
roland@6464 913 return per_arg_cell_count;
roland@6464 914 }
roland@6464 915
roland@6464 916 ByteSize type_offset(int i) const {
roland@6464 917 return DataLayout::cell_offset(type_offset_in_cells(i));
roland@5479 918 }
roland@5479 919
roland@5486 920 // GC support
roland@5486 921 void clean_weak_klass_links(BoolObjectClosure* is_alive_closure);
roland@5479 922
roland@5486 923 void print_data_on(outputStream* st) const;
roland@5486 924 };
roland@5479 925
roland@5486 926 // Type entry used for return from a call. A single cell to record the
roland@5486 927 // type.
roland@5486 928 class ReturnTypeEntry : public TypeEntries {
roland@5479 929
roland@5486 930 private:
roland@5486 931 enum {
roland@5486 932 cell_count = 1
roland@5486 933 };
roland@5486 934
roland@5486 935 public:
roland@5486 936 ReturnTypeEntry(int base_off)
roland@5486 937 : TypeEntries(base_off) {}
roland@5486 938
roland@5486 939 void post_initialize() {
roland@5486 940 set_type(type_none());
roland@5486 941 }
roland@5486 942
roland@5486 943 intptr_t type() const {
roland@5486 944 return _pd->intptr_at(_base_off);
roland@5486 945 }
roland@5486 946
roland@5486 947 void set_type(intptr_t k) {
roland@5486 948 _pd->set_intptr_at(_base_off, k);
roland@5486 949 }
roland@5486 950
roland@5486 951 static int static_cell_count() {
roland@5486 952 return cell_count;
roland@5486 953 }
roland@5486 954
roland@5486 955 static ByteSize size() {
roland@5486 956 return in_ByteSize(cell_count * DataLayout::cell_size);
roland@5486 957 }
roland@5486 958
roland@5486 959 ByteSize type_offset() {
roland@5486 960 return DataLayout::cell_offset(_base_off);
roland@5486 961 }
roland@5479 962
roland@5479 963 // GC support
roland@5479 964 void clean_weak_klass_links(BoolObjectClosure* is_alive_closure);
roland@5479 965
roland@5479 966 void print_data_on(outputStream* st) const;
roland@5479 967 };
roland@5479 968
roland@5486 969 // Entries to collect type information at a call: contains arguments
roland@5486 970 // (TypeStackSlotEntries), a return type (ReturnTypeEntry) and a
roland@5486 971 // number of cells. Because the number of cells for the return type is
roland@5486 972 // smaller than the number of cells for the type of an arguments, the
roland@5486 973 // number of cells is used to tell how many arguments are profiled and
roland@5486 974 // whether a return value is profiled. See has_arguments() and
roland@5486 975 // has_return().
roland@5486 976 class TypeEntriesAtCall {
roland@5486 977 private:
roland@5486 978 static int stack_slot_local_offset(int i) {
roland@5486 979 return header_cell_count() + TypeStackSlotEntries::stack_slot_local_offset(i);
roland@5486 980 }
roland@5486 981
roland@5486 982 static int argument_type_local_offset(int i) {
roland@6464 983 return header_cell_count() + TypeStackSlotEntries::type_local_offset(i);
roland@5486 984 }
roland@5486 985
roland@5486 986 public:
roland@5486 987
roland@5486 988 static int header_cell_count() {
roland@5486 989 return 1;
roland@5486 990 }
roland@5486 991
roland@5486 992 static int cell_count_local_offset() {
roland@5486 993 return 0;
roland@5486 994 }
roland@5486 995
roland@5486 996 static int compute_cell_count(BytecodeStream* stream);
roland@5486 997
roland@5486 998 static void initialize(DataLayout* dl, int base, int cell_count) {
roland@5486 999 int off = base + cell_count_local_offset();
roland@5486 1000 dl->set_cell_at(off, cell_count - base - header_cell_count());
roland@5486 1001 }
roland@5486 1002
roland@5486 1003 static bool arguments_profiling_enabled();
roland@5486 1004 static bool return_profiling_enabled();
roland@5486 1005
roland@5486 1006 // Code generation support
roland@5486 1007 static ByteSize cell_count_offset() {
roland@5486 1008 return in_ByteSize(cell_count_local_offset() * DataLayout::cell_size);
roland@5486 1009 }
roland@5486 1010
roland@5486 1011 static ByteSize args_data_offset() {
roland@5486 1012 return in_ByteSize(header_cell_count() * DataLayout::cell_size);
roland@5486 1013 }
roland@5486 1014
roland@5486 1015 static ByteSize stack_slot_offset(int i) {
roland@5486 1016 return in_ByteSize(stack_slot_local_offset(i) * DataLayout::cell_size);
roland@5486 1017 }
roland@5486 1018
roland@5486 1019 static ByteSize argument_type_offset(int i) {
roland@5486 1020 return in_ByteSize(argument_type_local_offset(i) * DataLayout::cell_size);
roland@5486 1021 }
roland@6320 1022
roland@6320 1023 static ByteSize return_only_size() {
roland@6320 1024 return ReturnTypeEntry::size() + in_ByteSize(header_cell_count() * DataLayout::cell_size);
roland@6320 1025 }
roland@6320 1026
roland@5486 1027 };
roland@5486 1028
roland@5479 1029 // CallTypeData
roland@5479 1030 //
roland@5479 1031 // A CallTypeData is used to access profiling information about a non
roland@5486 1032 // virtual call for which we collect type information about arguments
roland@5486 1033 // and return value.
roland@5479 1034 class CallTypeData : public CounterData {
roland@5479 1035 private:
roland@5486 1036 // entries for arguments if any
roland@5479 1037 TypeStackSlotEntries _args;
roland@5486 1038 // entry for return type if any
roland@5486 1039 ReturnTypeEntry _ret;
roland@5486 1040
roland@5486 1041 int cell_count_global_offset() const {
roland@5486 1042 return CounterData::static_cell_count() + TypeEntriesAtCall::cell_count_local_offset();
roland@5486 1043 }
roland@5486 1044
roland@5486 1045 // number of cells not counting the header
roland@5486 1046 int cell_count_no_header() const {
roland@5486 1047 return uint_at(cell_count_global_offset());
roland@5486 1048 }
roland@5486 1049
roland@5486 1050 void check_number_of_arguments(int total) {
roland@5486 1051 assert(number_of_arguments() == total, "should be set in DataLayout::initialize");
roland@5486 1052 }
roland@5486 1053
roland@5479 1054 public:
roland@5479 1055 CallTypeData(DataLayout* layout) :
roland@5486 1056 CounterData(layout),
roland@5486 1057 _args(CounterData::static_cell_count()+TypeEntriesAtCall::header_cell_count(), number_of_arguments()),
roland@5486 1058 _ret(cell_count() - ReturnTypeEntry::static_cell_count())
roland@5486 1059 {
roland@5479 1060 assert(layout->tag() == DataLayout::call_type_data_tag, "wrong type");
roland@5479 1061 // Some compilers (VC++) don't want this passed in member initialization list
roland@5479 1062 _args.set_profile_data(this);
roland@5486 1063 _ret.set_profile_data(this);
roland@5479 1064 }
roland@5479 1065
roland@5486 1066 const TypeStackSlotEntries* args() const {
roland@5486 1067 assert(has_arguments(), "no profiling of arguments");
roland@5486 1068 return &_args;
roland@5486 1069 }
roland@5486 1070
roland@5486 1071 const ReturnTypeEntry* ret() const {
roland@5486 1072 assert(has_return(), "no profiling of return value");
roland@5486 1073 return &_ret;
roland@5486 1074 }
roland@5479 1075
roland@5479 1076 virtual bool is_CallTypeData() const { return true; }
roland@5479 1077
roland@5479 1078 static int static_cell_count() {
roland@5479 1079 return -1;
roland@5479 1080 }
roland@5479 1081
roland@5479 1082 static int compute_cell_count(BytecodeStream* stream) {
roland@5486 1083 return CounterData::static_cell_count() + TypeEntriesAtCall::compute_cell_count(stream);
roland@5479 1084 }
roland@5479 1085
roland@5479 1086 static void initialize(DataLayout* dl, int cell_count) {
roland@5486 1087 TypeEntriesAtCall::initialize(dl, CounterData::static_cell_count(), cell_count);
roland@5479 1088 }
roland@5479 1089
roland@5486 1090 virtual void post_initialize(BytecodeStream* stream, MethodData* mdo);
roland@5486 1091
roland@5486 1092 virtual int cell_count() const {
roland@5486 1093 return CounterData::static_cell_count() +
roland@5486 1094 TypeEntriesAtCall::header_cell_count() +
roland@5486 1095 int_at_unchecked(cell_count_global_offset());
roland@5479 1096 }
roland@5479 1097
roland@5486 1098 int number_of_arguments() const {
roland@5486 1099 return cell_count_no_header() / TypeStackSlotEntries::per_arg_count();
roland@5479 1100 }
roland@5479 1101
roland@5479 1102 void set_argument_type(int i, Klass* k) {
roland@5486 1103 assert(has_arguments(), "no arguments!");
roland@5479 1104 intptr_t current = _args.type(i);
roland@5479 1105 _args.set_type(i, TypeEntries::with_status(k, current));
roland@5479 1106 }
roland@5479 1107
roland@5486 1108 void set_return_type(Klass* k) {
roland@5486 1109 assert(has_return(), "no return!");
roland@5486 1110 intptr_t current = _ret.type();
roland@5486 1111 _ret.set_type(TypeEntries::with_status(k, current));
roland@5486 1112 }
roland@5486 1113
roland@5486 1114 // An entry for a return value takes less space than an entry for an
roland@5552 1115 // argument so if the number of cells exceeds the number of cells
roland@5552 1116 // needed for an argument, this object contains type information for
roland@5552 1117 // at least one argument.
roland@5552 1118 bool has_arguments() const {
roland@5552 1119 bool res = cell_count_no_header() >= TypeStackSlotEntries::per_arg_count();
roland@5552 1120 assert (!res || TypeEntriesAtCall::arguments_profiling_enabled(), "no profiling of arguments");
roland@5552 1121 return res;
roland@5552 1122 }
roland@5552 1123
roland@5552 1124 // An entry for a return value takes less space than an entry for an
roland@5486 1125 // argument, so if the remainder of the number of cells divided by
roland@5486 1126 // the number of cells for an argument is not null, a return value
roland@5486 1127 // is profiled in this object.
roland@5486 1128 bool has_return() const {
roland@5486 1129 bool res = (cell_count_no_header() % TypeStackSlotEntries::per_arg_count()) != 0;
roland@5486 1130 assert (!res || TypeEntriesAtCall::return_profiling_enabled(), "no profiling of return values");
roland@5486 1131 return res;
roland@5486 1132 }
roland@5486 1133
roland@5479 1134 // Code generation support
roland@5479 1135 static ByteSize args_data_offset() {
roland@5486 1136 return cell_offset(CounterData::static_cell_count()) + TypeEntriesAtCall::args_data_offset();
roland@5479 1137 }
roland@5479 1138
roland@6464 1139 ByteSize argument_type_offset(int i) {
roland@6464 1140 return _args.type_offset(i);
roland@6464 1141 }
roland@6464 1142
roland@6464 1143 ByteSize return_type_offset() {
roland@6464 1144 return _ret.type_offset();
roland@6464 1145 }
roland@6464 1146
roland@5479 1147 // GC support
roland@5479 1148 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure) {
roland@5486 1149 if (has_arguments()) {
roland@5486 1150 _args.clean_weak_klass_links(is_alive_closure);
roland@5486 1151 }
roland@5486 1152 if (has_return()) {
roland@5486 1153 _ret.clean_weak_klass_links(is_alive_closure);
roland@5486 1154 }
roland@5479 1155 }
roland@5479 1156
roland@6054 1157 virtual void print_data_on(outputStream* st, const char* extra = NULL) const;
duke@0 1158 };
duke@0 1159
duke@0 1160 // ReceiverTypeData
duke@0 1161 //
duke@0 1162 // A ReceiverTypeData is used to access profiling information about a
duke@0 1163 // dynamic type check. It consists of a counter which counts the total times
coleenp@3602 1164 // that the check is reached, and a series of (Klass*, count) pairs
duke@0 1165 // which are used to store a type profile for the receiver of the check.
duke@0 1166 class ReceiverTypeData : public CounterData {
duke@0 1167 protected:
duke@0 1168 enum {
duke@0 1169 receiver0_offset = counter_cell_count,
duke@0 1170 count0_offset,
duke@0 1171 receiver_type_row_cell_count = (count0_offset + 1) - receiver0_offset
duke@0 1172 };
duke@0 1173
duke@0 1174 public:
duke@0 1175 ReceiverTypeData(DataLayout* layout) : CounterData(layout) {
duke@0 1176 assert(layout->tag() == DataLayout::receiver_type_data_tag ||
roland@5479 1177 layout->tag() == DataLayout::virtual_call_data_tag ||
roland@5479 1178 layout->tag() == DataLayout::virtual_call_type_data_tag, "wrong type");
duke@0 1179 }
duke@0 1180
roland@5479 1181 virtual bool is_ReceiverTypeData() const { return true; }
duke@0 1182
duke@0 1183 static int static_cell_count() {
duke@0 1184 return counter_cell_count + (uint) TypeProfileWidth * receiver_type_row_cell_count;
duke@0 1185 }
duke@0 1186
roland@5479 1187 virtual int cell_count() const {
duke@0 1188 return static_cell_count();
duke@0 1189 }
duke@0 1190
duke@0 1191 // Direct accessors
duke@0 1192 static uint row_limit() {
duke@0 1193 return TypeProfileWidth;
duke@0 1194 }
duke@0 1195 static int receiver_cell_index(uint row) {
duke@0 1196 return receiver0_offset + row * receiver_type_row_cell_count;
duke@0 1197 }
duke@0 1198 static int receiver_count_cell_index(uint row) {
duke@0 1199 return count0_offset + row * receiver_type_row_cell_count;
duke@0 1200 }
duke@0 1201
roland@5479 1202 Klass* receiver(uint row) const {
duke@0 1203 assert(row < row_limit(), "oob");
duke@0 1204
coleenp@3602 1205 Klass* recv = (Klass*)intptr_at(receiver_cell_index(row));
coleenp@3602 1206 assert(recv == NULL || recv->is_klass(), "wrong type");
duke@0 1207 return recv;
duke@0 1208 }
duke@0 1209
coleenp@3602 1210 void set_receiver(uint row, Klass* k) {
ysr@941 1211 assert((uint)row < row_limit(), "oob");
coleenp@3602 1212 set_intptr_at(receiver_cell_index(row), (uintptr_t)k);
ysr@941 1213 }
ysr@941 1214
roland@5479 1215 uint receiver_count(uint row) const {
duke@0 1216 assert(row < row_limit(), "oob");
duke@0 1217 return uint_at(receiver_count_cell_index(row));
duke@0 1218 }
duke@0 1219
ysr@941 1220 void set_receiver_count(uint row, uint count) {
ysr@941 1221 assert(row < row_limit(), "oob");
ysr@941 1222 set_uint_at(receiver_count_cell_index(row), count);
ysr@941 1223 }
ysr@941 1224
ysr@941 1225 void clear_row(uint row) {
ysr@941 1226 assert(row < row_limit(), "oob");
kvn@1251 1227 // Clear total count - indicator of polymorphic call site.
kvn@1251 1228 // The site may look like as monomorphic after that but
kvn@1251 1229 // it allow to have more accurate profiling information because
kvn@1251 1230 // there was execution phase change since klasses were unloaded.
kvn@1251 1231 // If the site is still polymorphic then MDO will be updated
kvn@1251 1232 // to reflect it. But it could be the case that the site becomes
kvn@1251 1233 // only bimorphic. Then keeping total count not 0 will be wrong.
kvn@1251 1234 // Even if we use monomorphic (when it is not) for compilation
kvn@1251 1235 // we will only have trap, deoptimization and recompile again
kvn@1251 1236 // with updated MDO after executing method in Interpreter.
kvn@1251 1237 // An additional receiver will be recorded in the cleaned row
kvn@1251 1238 // during next call execution.
kvn@1251 1239 //
kvn@1251 1240 // Note: our profiling logic works with empty rows in any slot.
kvn@1251 1241 // We do sorting a profiling info (ciCallProfile) for compilation.
kvn@1251 1242 //
kvn@1251 1243 set_count(0);
ysr@941 1244 set_receiver(row, NULL);
ysr@941 1245 set_receiver_count(row, 0);
ysr@941 1246 }
ysr@941 1247
duke@0 1248 // Code generation support
duke@0 1249 static ByteSize receiver_offset(uint row) {
duke@0 1250 return cell_offset(receiver_cell_index(row));
duke@0 1251 }
duke@0 1252 static ByteSize receiver_count_offset(uint row) {
duke@0 1253 return cell_offset(receiver_count_cell_index(row));
duke@0 1254 }
duke@0 1255 static ByteSize receiver_type_data_size() {
duke@0 1256 return cell_offset(static_cell_count());
duke@0 1257 }
duke@0 1258
duke@0 1259 // GC support
coleenp@3602 1260 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure);
duke@0 1261
goetz@5974 1262 #ifdef CC_INTERP
goetz@5974 1263 static int receiver_type_data_size_in_bytes() {
goetz@5974 1264 return cell_offset_in_bytes(static_cell_count());
goetz@5974 1265 }
goetz@5974 1266
goetz@5974 1267 static Klass *receiver_unchecked(DataLayout* layout, uint row) {
simonis@5987 1268 Klass* recv = (Klass*)layout->cell_at(receiver_cell_index(row));
simonis@5987 1269 return recv;
goetz@5974 1270 }
goetz@5974 1271
goetz@5974 1272 static void increment_receiver_count_no_overflow(DataLayout* layout, Klass *rcvr) {
goetz@5974 1273 const int num_rows = row_limit();
goetz@5974 1274 // Receiver already exists?
goetz@5974 1275 for (int row = 0; row < num_rows; row++) {
goetz@5974 1276 if (receiver_unchecked(layout, row) == rcvr) {
goetz@5974 1277 increment_uint_at_no_overflow(layout, receiver_count_cell_index(row));
goetz@5974 1278 return;
goetz@5974 1279 }
goetz@5974 1280 }
goetz@5974 1281 // New receiver, find a free slot.
goetz@5974 1282 for (int row = 0; row < num_rows; row++) {
goetz@5974 1283 if (receiver_unchecked(layout, row) == NULL) {
goetz@5974 1284 set_intptr_at(layout, receiver_cell_index(row), (intptr_t)rcvr);
goetz@5974 1285 increment_uint_at_no_overflow(layout, receiver_count_cell_index(row));
goetz@5974 1286 return;
goetz@5974 1287 }
goetz@5974 1288 }
goetz@5974 1289 // Receiver did not match any saved receiver and there is no empty row for it.
goetz@5974 1290 // Increment total counter to indicate polymorphic case.
goetz@5974 1291 increment_count_no_overflow(layout);
goetz@5974 1292 }
goetz@5974 1293
goetz@5974 1294 static DataLayout* advance(DataLayout* layout) {
goetz@5974 1295 return (DataLayout*) (((address)layout) + (ssize_t)ReceiverTypeData::receiver_type_data_size_in_bytes());
goetz@5974 1296 }
goetz@5974 1297 #endif // CC_INTERP
goetz@5974 1298
roland@5479 1299 void print_receiver_data_on(outputStream* st) const;
roland@6054 1300 void print_data_on(outputStream* st, const char* extra = NULL) const;
duke@0 1301 };
duke@0 1302
duke@0 1303 // VirtualCallData
duke@0 1304 //
duke@0 1305 // A VirtualCallData is used to access profiling information about a
duke@0 1306 // virtual call. For now, it has nothing more than a ReceiverTypeData.
duke@0 1307 class VirtualCallData : public ReceiverTypeData {
duke@0 1308 public:
duke@0 1309 VirtualCallData(DataLayout* layout) : ReceiverTypeData(layout) {
roland@5479 1310 assert(layout->tag() == DataLayout::virtual_call_data_tag ||
roland@5479 1311 layout->tag() == DataLayout::virtual_call_type_data_tag, "wrong type");
duke@0 1312 }
duke@0 1313
roland@5479 1314 virtual bool is_VirtualCallData() const { return true; }
duke@0 1315
duke@0 1316 static int static_cell_count() {
duke@0 1317 // At this point we could add more profile state, e.g., for arguments.
duke@0 1318 // But for now it's the same size as the base record type.
duke@0 1319 return ReceiverTypeData::static_cell_count();
duke@0 1320 }
duke@0 1321
roland@5479 1322 virtual int cell_count() const {
duke@0 1323 return static_cell_count();
duke@0 1324 }
duke@0 1325
duke@0 1326 // Direct accessors
duke@0 1327 static ByteSize virtual_call_data_size() {
duke@0 1328 return cell_offset(static_cell_count());
duke@0 1329 }
duke@0 1330
goetz@5974 1331 #ifdef CC_INTERP
goetz@5974 1332 static int virtual_call_data_size_in_bytes() {
goetz@5974 1333 return cell_offset_in_bytes(static_cell_count());
goetz@5974 1334 }
goetz@5974 1335
goetz@5974 1336 static DataLayout* advance(DataLayout* layout) {
goetz@5974 1337 return (DataLayout*) (((address)layout) + (ssize_t)VirtualCallData::virtual_call_data_size_in_bytes());
goetz@5974 1338 }
goetz@5974 1339 #endif // CC_INTERP
goetz@5974 1340
roland@6054 1341 void print_data_on(outputStream* st, const char* extra = NULL) const;
roland@5479 1342 };
roland@5479 1343
roland@5479 1344 // VirtualCallTypeData
roland@5479 1345 //
roland@5479 1346 // A VirtualCallTypeData is used to access profiling information about
roland@5479 1347 // a virtual call for which we collect type information about
roland@5486 1348 // arguments and return value.
roland@5479 1349 class VirtualCallTypeData : public VirtualCallData {
roland@5479 1350 private:
roland@5486 1351 // entries for arguments if any
roland@5479 1352 TypeStackSlotEntries _args;
roland@5486 1353 // entry for return type if any
roland@5486 1354 ReturnTypeEntry _ret;
roland@5486 1355
roland@5486 1356 int cell_count_global_offset() const {
roland@5486 1357 return VirtualCallData::static_cell_count() + TypeEntriesAtCall::cell_count_local_offset();
roland@5486 1358 }
roland@5486 1359
roland@5486 1360 // number of cells not counting the header
roland@5486 1361 int cell_count_no_header() const {
roland@5486 1362 return uint_at(cell_count_global_offset());
roland@5486 1363 }
roland@5486 1364
roland@5486 1365 void check_number_of_arguments(int total) {
roland@5486 1366 assert(number_of_arguments() == total, "should be set in DataLayout::initialize");
roland@5486 1367 }
roland@5486 1368
roland@5479 1369 public:
roland@5479 1370 VirtualCallTypeData(DataLayout* layout) :
roland@5486 1371 VirtualCallData(layout),
roland@5486 1372 _args(VirtualCallData::static_cell_count()+TypeEntriesAtCall::header_cell_count(), number_of_arguments()),
roland@5486 1373 _ret(cell_count() - ReturnTypeEntry::static_cell_count())
roland@5486 1374 {
roland@5479 1375 assert(layout->tag() == DataLayout::virtual_call_type_data_tag, "wrong type");
roland@5479 1376 // Some compilers (VC++) don't want this passed in member initialization list
roland@5479 1377 _args.set_profile_data(this);
roland@5486 1378 _ret.set_profile_data(this);
roland@5479 1379 }
roland@5479 1380
roland@5486 1381 const TypeStackSlotEntries* args() const {
roland@5486 1382 assert(has_arguments(), "no profiling of arguments");
roland@5486 1383 return &_args;
roland@5486 1384 }
roland@5486 1385
roland@5486 1386 const ReturnTypeEntry* ret() const {
roland@5486 1387 assert(has_return(), "no profiling of return value");
roland@5486 1388 return &_ret;
roland@5486 1389 }
roland@5479 1390
roland@5479 1391 virtual bool is_VirtualCallTypeData() const { return true; }
roland@5479 1392
roland@5479 1393 static int static_cell_count() {
roland@5479 1394 return -1;
roland@5479 1395 }
roland@5479 1396
roland@5479 1397 static int compute_cell_count(BytecodeStream* stream) {
roland@5486 1398 return VirtualCallData::static_cell_count() + TypeEntriesAtCall::compute_cell_count(stream);
roland@5479 1399 }
roland@5479 1400
roland@5479 1401 static void initialize(DataLayout* dl, int cell_count) {
roland@5486 1402 TypeEntriesAtCall::initialize(dl, VirtualCallData::static_cell_count(), cell_count);
roland@5479 1403 }
roland@5479 1404
roland@5486 1405 virtual void post_initialize(BytecodeStream* stream, MethodData* mdo);
roland@5486 1406
roland@5486 1407 virtual int cell_count() const {
roland@5486 1408 return VirtualCallData::static_cell_count() +
roland@5486 1409 TypeEntriesAtCall::header_cell_count() +
roland@5486 1410 int_at_unchecked(cell_count_global_offset());
roland@5479 1411 }
roland@5479 1412
roland@5486 1413 int number_of_arguments() const {
roland@5486 1414 return cell_count_no_header() / TypeStackSlotEntries::per_arg_count();
roland@5479 1415 }
roland@5479 1416
roland@5479 1417 void set_argument_type(int i, Klass* k) {
roland@5486 1418 assert(has_arguments(), "no arguments!");
roland@5479 1419 intptr_t current = _args.type(i);
roland@5479 1420 _args.set_type(i, TypeEntries::with_status(k, current));
roland@5479 1421 }
roland@5479 1422
roland@5486 1423 void set_return_type(Klass* k) {
roland@5486 1424 assert(has_return(), "no return!");
roland@5486 1425 intptr_t current = _ret.type();
roland@5486 1426 _ret.set_type(TypeEntries::with_status(k, current));
roland@5486 1427 }
roland@5486 1428
roland@5486 1429 // An entry for a return value takes less space than an entry for an
roland@5486 1430 // argument, so if the remainder of the number of cells divided by
roland@5486 1431 // the number of cells for an argument is not null, a return value
roland@5486 1432 // is profiled in this object.
roland@5486 1433 bool has_return() const {
roland@5486 1434 bool res = (cell_count_no_header() % TypeStackSlotEntries::per_arg_count()) != 0;
roland@5486 1435 assert (!res || TypeEntriesAtCall::return_profiling_enabled(), "no profiling of return values");
roland@5486 1436 return res;
roland@5486 1437 }
roland@5486 1438
roland@5552 1439 // An entry for a return value takes less space than an entry for an
roland@5552 1440 // argument so if the number of cells exceeds the number of cells
roland@5552 1441 // needed for an argument, this object contains type information for
roland@5552 1442 // at least one argument.
roland@5552 1443 bool has_arguments() const {
roland@5552 1444 bool res = cell_count_no_header() >= TypeStackSlotEntries::per_arg_count();
roland@5552 1445 assert (!res || TypeEntriesAtCall::arguments_profiling_enabled(), "no profiling of arguments");
roland@5552 1446 return res;
roland@5552 1447 }
roland@5552 1448
roland@5479 1449 // Code generation support
roland@5479 1450 static ByteSize args_data_offset() {
roland@5486 1451 return cell_offset(VirtualCallData::static_cell_count()) + TypeEntriesAtCall::args_data_offset();
roland@5479 1452 }
roland@5479 1453
roland@6464 1454 ByteSize argument_type_offset(int i) {
roland@6464 1455 return _args.type_offset(i);
roland@6464 1456 }
roland@6464 1457
roland@6464 1458 ByteSize return_type_offset() {
roland@6464 1459 return _ret.type_offset();
roland@6464 1460 }
roland@6464 1461
roland@5479 1462 // GC support
roland@5479 1463 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure) {
roland@5479 1464 ReceiverTypeData::clean_weak_klass_links(is_alive_closure);
roland@5486 1465 if (has_arguments()) {
roland@5486 1466 _args.clean_weak_klass_links(is_alive_closure);
roland@5486 1467 }
roland@5486 1468 if (has_return()) {
roland@5486 1469 _ret.clean_weak_klass_links(is_alive_closure);
roland@5486 1470 }
roland@5479 1471 }
roland@5479 1472
roland@6054 1473 virtual void print_data_on(outputStream* st, const char* extra = NULL) const;
duke@0 1474 };
duke@0 1475
duke@0 1476 // RetData
duke@0 1477 //
duke@0 1478 // A RetData is used to access profiling information for a ret bytecode.
duke@0 1479 // It is composed of a count of the number of times that the ret has
duke@0 1480 // been executed, followed by a series of triples of the form
duke@0 1481 // (bci, count, di) which count the number of times that some bci was the
duke@0 1482 // target of the ret and cache a corresponding data displacement.
duke@0 1483 class RetData : public CounterData {
duke@0 1484 protected:
duke@0 1485 enum {
duke@0 1486 bci0_offset = counter_cell_count,
duke@0 1487 count0_offset,
duke@0 1488 displacement0_offset,
duke@0 1489 ret_row_cell_count = (displacement0_offset + 1) - bci0_offset
duke@0 1490 };
duke@0 1491
duke@0 1492 void set_bci(uint row, int bci) {
duke@0 1493 assert((uint)row < row_limit(), "oob");
duke@0 1494 set_int_at(bci0_offset + row * ret_row_cell_count, bci);
duke@0 1495 }
duke@0 1496 void release_set_bci(uint row, int bci) {
duke@0 1497 assert((uint)row < row_limit(), "oob");
duke@0 1498 // 'release' when setting the bci acts as a valid flag for other
duke@0 1499 // threads wrt bci_count and bci_displacement.
duke@0 1500 release_set_int_at(bci0_offset + row * ret_row_cell_count, bci);
duke@0 1501 }
duke@0 1502 void set_bci_count(uint row, uint count) {
duke@0 1503 assert((uint)row < row_limit(), "oob");
duke@0 1504 set_uint_at(count0_offset + row * ret_row_cell_count, count);
duke@0 1505 }
duke@0 1506 void set_bci_displacement(uint row, int disp) {
duke@0 1507 set_int_at(displacement0_offset + row * ret_row_cell_count, disp);
duke@0 1508 }
duke@0 1509
duke@0 1510 public:
duke@0 1511 RetData(DataLayout* layout) : CounterData(layout) {
duke@0 1512 assert(layout->tag() == DataLayout::ret_data_tag, "wrong type");
duke@0 1513 }
duke@0 1514
roland@5479 1515 virtual bool is_RetData() const { return true; }
duke@0 1516
duke@0 1517 enum {
duke@0 1518 no_bci = -1 // value of bci when bci1/2 are not in use.
duke@0 1519 };
duke@0 1520
duke@0 1521 static int static_cell_count() {
duke@0 1522 return counter_cell_count + (uint) BciProfileWidth * ret_row_cell_count;
duke@0 1523 }
duke@0 1524
roland@5479 1525 virtual int cell_count() const {
duke@0 1526 return static_cell_count();
duke@0 1527 }
duke@0 1528
duke@0 1529 static uint row_limit() {
duke@0 1530 return BciProfileWidth;
duke@0 1531 }
duke@0 1532 static int bci_cell_index(uint row) {
duke@0 1533 return bci0_offset + row * ret_row_cell_count;
duke@0 1534 }
duke@0 1535 static int bci_count_cell_index(uint row) {
duke@0 1536 return count0_offset + row * ret_row_cell_count;
duke@0 1537 }
duke@0 1538 static int bci_displacement_cell_index(uint row) {
duke@0 1539 return displacement0_offset + row * ret_row_cell_count;
duke@0 1540 }
duke@0 1541
duke@0 1542 // Direct accessors
roland@5479 1543 int bci(uint row) const {
duke@0 1544 return int_at(bci_cell_index(row));
duke@0 1545 }
roland@5479 1546 uint bci_count(uint row) const {
duke@0 1547 return uint_at(bci_count_cell_index(row));
duke@0 1548 }
roland@5479 1549 int bci_displacement(uint row) const {
duke@0 1550 return int_at(bci_displacement_cell_index(row));
duke@0 1551 }
duke@0 1552
duke@0 1553 // Interpreter Runtime support
coleenp@3602 1554 address fixup_ret(int return_bci, MethodData* mdo);
duke@0 1555
duke@0 1556 // Code generation support
duke@0 1557 static ByteSize bci_offset(uint row) {
duke@0 1558 return cell_offset(bci_cell_index(row));
duke@0 1559 }
duke@0 1560 static ByteSize bci_count_offset(uint row) {
duke@0 1561 return cell_offset(bci_count_cell_index(row));
duke@0 1562 }
duke@0 1563 static ByteSize bci_displacement_offset(uint row) {
duke@0 1564 return cell_offset(bci_displacement_cell_index(row));
duke@0 1565 }
duke@0 1566
goetz@5974 1567 #ifdef CC_INTERP
goetz@5974 1568 static DataLayout* advance(MethodData *md, int bci);
goetz@5974 1569 #endif // CC_INTERP
goetz@5974 1570
duke@0 1571 // Specific initialization.
coleenp@3602 1572 void post_initialize(BytecodeStream* stream, MethodData* mdo);
duke@0 1573
roland@6054 1574 void print_data_on(outputStream* st, const char* extra = NULL) const;
duke@0 1575 };
duke@0 1576
duke@0 1577 // BranchData
duke@0 1578 //
duke@0 1579 // A BranchData is used to access profiling data for a two-way branch.
duke@0 1580 // It consists of taken and not_taken counts as well as a data displacement
duke@0 1581 // for the taken case.
duke@0 1582 class BranchData : public JumpData {
duke@0 1583 protected:
duke@0 1584 enum {
duke@0 1585 not_taken_off_set = jump_cell_count,
duke@0 1586 branch_cell_count
duke@0 1587 };
duke@0 1588
duke@0 1589 void set_displacement(int displacement) {
duke@0 1590 set_int_at(displacement_off_set, displacement);
duke@0 1591 }
duke@0 1592
duke@0 1593 public:
duke@0 1594 BranchData(DataLayout* layout) : JumpData(layout) {
duke@0 1595 assert(layout->tag() == DataLayout::branch_data_tag, "wrong type");
duke@0 1596 }
duke@0 1597
roland@5479 1598 virtual bool is_BranchData() const { return true; }
duke@0 1599
duke@0 1600 static int static_cell_count() {
duke@0 1601 return branch_cell_count;
duke@0 1602 }
duke@0 1603
roland@5479 1604 virtual int cell_count() const {
duke@0 1605 return static_cell_count();
duke@0 1606 }
duke@0 1607
duke@0 1608 // Direct accessor
roland@5479 1609 uint not_taken() const {
duke@0 1610 return uint_at(not_taken_off_set);
duke@0 1611 }
duke@0 1612
never@2670 1613 void set_not_taken(uint cnt) {
never@2670 1614 set_uint_at(not_taken_off_set, cnt);
never@2670 1615 }
never@2670 1616
duke@0 1617 uint inc_not_taken() {
duke@0 1618 uint cnt = not_taken() + 1;
duke@0 1619 // Did we wrap? Will compiler screw us??
duke@0 1620 if (cnt == 0) cnt--;
duke@0 1621 set_uint_at(not_taken_off_set, cnt);
duke@0 1622 return cnt;
duke@0 1623 }
duke@0 1624
duke@0 1625 // Code generation support
duke@0 1626 static ByteSize not_taken_offset() {
duke@0 1627 return cell_offset(not_taken_off_set);
duke@0 1628 }
duke@0 1629 static ByteSize branch_data_size() {
duke@0 1630 return cell_offset(branch_cell_count);
duke@0 1631 }
duke@0 1632
goetz@5974 1633 #ifdef CC_INTERP
goetz@5974 1634 static int branch_data_size_in_bytes() {
goetz@5974 1635 return cell_offset_in_bytes(branch_cell_count);
goetz@5974 1636 }
goetz@5974 1637
goetz@5974 1638 static void increment_not_taken_count_no_overflow(DataLayout* layout) {
goetz@5974 1639 increment_uint_at_no_overflow(layout, not_taken_off_set);
goetz@5974 1640 }
goetz@5974 1641
goetz@5974 1642 static DataLayout* advance_not_taken(DataLayout* layout) {
goetz@5974 1643 return (DataLayout*) (((address)layout) + (ssize_t)BranchData::branch_data_size_in_bytes());
goetz@5974 1644 }
goetz@5974 1645 #endif // CC_INTERP
goetz@5974 1646
duke@0 1647 // Specific initialization.
coleenp@3602 1648 void post_initialize(BytecodeStream* stream, MethodData* mdo);
duke@0 1649
roland@6054 1650 void print_data_on(outputStream* st, const char* extra = NULL) const;
duke@0 1651 };
duke@0 1652
duke@0 1653 // ArrayData
duke@0 1654 //
duke@0 1655 // A ArrayData is a base class for accessing profiling data which does
duke@0 1656 // not have a statically known size. It consists of an array length
duke@0 1657 // and an array start.
duke@0 1658 class ArrayData : public ProfileData {
duke@0 1659 protected:
duke@0 1660 friend class DataLayout;
duke@0 1661
duke@0 1662 enum {
duke@0 1663 array_len_off_set,
duke@0 1664 array_start_off_set
duke@0 1665 };
duke@0 1666
roland@5479 1667 uint array_uint_at(int index) const {
duke@0 1668 int aindex = index + array_start_off_set;
duke@0 1669 return uint_at(aindex);
duke@0 1670 }
roland@5479 1671 int array_int_at(int index) const {
duke@0 1672 int aindex = index + array_start_off_set;
duke@0 1673 return int_at(aindex);
duke@0 1674 }
roland@5479 1675 oop array_oop_at(int index) const {
duke@0 1676 int aindex = index + array_start_off_set;
duke@0 1677 return oop_at(aindex);
duke@0 1678 }
duke@0 1679 void array_set_int_at(int index, int value) {
duke@0 1680 int aindex = index + array_start_off_set;
duke@0 1681 set_int_at(aindex, value);
duke@0 1682 }
duke@0 1683
goetz@5974 1684 #ifdef CC_INTERP
goetz@5974 1685 // Static low level accessors for DataLayout with ArrayData's semantics.
goetz@5974 1686
goetz@5974 1687 static void increment_array_uint_at_no_overflow(DataLayout* layout, int index) {
goetz@5974 1688 int aindex = index + array_start_off_set;
goetz@5974 1689 increment_uint_at_no_overflow(layout, aindex);
goetz@5974 1690 }
goetz@5974 1691
goetz@5974 1692 static int array_int_at(DataLayout* layout, int index) {
goetz@5974 1693 int aindex = index + array_start_off_set;
goetz@5974 1694 return int_at(layout, aindex);
goetz@5974 1695 }
goetz@5974 1696 #endif // CC_INTERP
goetz@5974 1697
duke@0 1698 // Code generation support for subclasses.
duke@0 1699 static ByteSize array_element_offset(int index) {
duke@0 1700 return cell_offset(array_start_off_set + index);
duke@0 1701 }
duke@0 1702
duke@0 1703 public:
duke@0 1704 ArrayData(DataLayout* layout) : ProfileData(layout) {}
duke@0 1705
roland@5479 1706 virtual bool is_ArrayData() const { return true; }
duke@0 1707
duke@0 1708 static int static_cell_count() {
duke@0 1709 return -1;
duke@0 1710 }
duke@0 1711
roland@5479 1712 int array_len() const {
duke@0 1713 return int_at_unchecked(array_len_off_set);
duke@0 1714 }
duke@0 1715
roland@5479 1716 virtual int cell_count() const {
duke@0 1717 return array_len() + 1;
duke@0 1718 }
duke@0 1719
duke@0 1720 // Code generation support
duke@0 1721 static ByteSize array_len_offset() {
duke@0 1722 return cell_offset(array_len_off_set);
duke@0 1723 }
duke@0 1724 static ByteSize array_start_offset() {
duke@0 1725 return cell_offset(array_start_off_set);
duke@0 1726 }
duke@0 1727 };
duke@0 1728
duke@0 1729 // MultiBranchData
duke@0 1730 //
duke@0 1731 // A MultiBranchData is used to access profiling information for
duke@0 1732 // a multi-way branch (*switch bytecodes). It consists of a series
duke@0 1733 // of (count, displacement) pairs, which count the number of times each
duke@0 1734 // case was taken and specify the data displacment for each branch target.
duke@0 1735 class MultiBranchData : public ArrayData {
duke@0 1736 protected:
duke@0 1737 enum {
duke@0 1738 default_count_off_set,
duke@0 1739 default_disaplacement_off_set,
duke@0 1740 case_array_start
duke@0 1741 };
duke@0 1742 enum {
duke@0 1743 relative_count_off_set,
duke@0 1744 relative_displacement_off_set,
duke@0 1745 per_case_cell_count
duke@0 1746 };
duke@0 1747
duke@0 1748 void set_default_displacement(int displacement) {
duke@0 1749 array_set_int_at(default_disaplacement_off_set, displacement);
duke@0 1750 }
duke@0 1751 void set_displacement_at(int index, int displacement) {
duke@0 1752 array_set_int_at(case_array_start +
duke@0 1753 index * per_case_cell_count +
duke@0 1754 relative_displacement_off_set,
duke@0 1755 displacement);
duke@0 1756 }
duke@0 1757
duke@0 1758 public:
duke@0 1759 MultiBranchData(DataLayout* layout) : ArrayData(layout) {
duke@0 1760 assert(layout->tag() == DataLayout::multi_branch_data_tag, "wrong type");
duke@0 1761 }
duke@0 1762
roland@5479 1763 virtual bool is_MultiBranchData() const { return true; }
duke@0 1764
duke@0 1765 static int compute_cell_count(BytecodeStream* stream);
duke@0 1766
roland@5479 1767 int number_of_cases() const {
duke@0 1768 int alen = array_len() - 2; // get rid of default case here.
duke@0 1769 assert(alen % per_case_cell_count == 0, "must be even");
duke@0 1770 return (alen / per_case_cell_count);
duke@0 1771 }
duke@0 1772
roland@5479 1773 uint default_count() const {
duke@0 1774 return array_uint_at(default_count_off_set);
duke@0 1775 }
roland@5479 1776 int default_displacement() const {
duke@0 1777 return array_int_at(default_disaplacement_off_set);
duke@0 1778 }
duke@0 1779
roland@5479 1780 uint count_at(int index) const {
duke@0 1781 return array_uint_at(case_array_start +
duke@0 1782 index * per_case_cell_count +
duke@0 1783 relative_count_off_set);
duke@0 1784 }
roland@5479 1785 int displacement_at(int index) const {
duke@0 1786 return array_int_at(case_array_start +
duke@0 1787 index * per_case_cell_count +
duke@0 1788 relative_displacement_off_set);
duke@0 1789 }
duke@0 1790
duke@0 1791 // Code generation support
duke@0 1792 static ByteSize default_count_offset() {
duke@0 1793 return array_element_offset(default_count_off_set);
duke@0 1794 }
duke@0 1795 static ByteSize default_displacement_offset() {
duke@0 1796 return array_element_offset(default_disaplacement_off_set);
duke@0 1797 }
duke@0 1798 static ByteSize case_count_offset(int index) {
duke@0 1799 return case_array_offset() +
duke@0 1800 (per_case_size() * index) +
duke@0 1801 relative_count_offset();
duke@0 1802 }
duke@0 1803 static ByteSize case_array_offset() {
duke@0 1804 return array_element_offset(case_array_start);
duke@0 1805 }
duke@0 1806 static ByteSize per_case_size() {
duke@0 1807 return in_ByteSize(per_case_cell_count) * cell_size;
duke@0 1808 }
duke@0 1809 static ByteSize relative_count_offset() {
duke@0 1810 return in_ByteSize(relative_count_off_set) * cell_size;
duke@0 1811 }
duke@0 1812 static ByteSize relative_displacement_offset() {
duke@0 1813 return in_ByteSize(relative_displacement_off_set) * cell_size;
duke@0 1814 }
duke@0 1815
goetz@5974 1816 #ifdef CC_INTERP
goetz@5974 1817 static void increment_count_no_overflow(DataLayout* layout, int index) {
goetz@5974 1818 if (index == -1) {
goetz@5974 1819 increment_array_uint_at_no_overflow(layout, default_count_off_set);
goetz@5974 1820 } else {
goetz@5974 1821 increment_array_uint_at_no_overflow(layout, case_array_start +
goetz@5974 1822 index * per_case_cell_count +
goetz@5974 1823 relative_count_off_set);
goetz@5974 1824 }
goetz@5974 1825 }
goetz@5974 1826
goetz@5974 1827 static DataLayout* advance(DataLayout* layout, int index) {
goetz@5974 1828 if (index == -1) {
goetz@5974 1829 return (DataLayout*) (((address)layout) + (ssize_t)array_int_at(layout, default_disaplacement_off_set));
goetz@5974 1830 } else {
goetz@5974 1831 return (DataLayout*) (((address)layout) + (ssize_t)array_int_at(layout, case_array_start +
goetz@5974 1832 index * per_case_cell_count +
goetz@5974 1833 relative_displacement_off_set));
goetz@5974 1834 }
goetz@5974 1835 }
goetz@5974 1836 #endif // CC_INTERP
goetz@5974 1837
duke@0 1838 // Specific initialization.
coleenp@3602 1839 void post_initialize(BytecodeStream* stream, MethodData* mdo);
duke@0 1840
roland@6054 1841 void print_data_on(outputStream* st, const char* extra = NULL) const;
duke@0 1842 };
duke@0 1843
kvn@45 1844 class ArgInfoData : public ArrayData {
kvn@45 1845
kvn@45 1846 public:
kvn@45 1847 ArgInfoData(DataLayout* layout) : ArrayData(layout) {
kvn@45 1848 assert(layout->tag() == DataLayout::arg_info_data_tag, "wrong type");
kvn@45 1849 }
kvn@45 1850
roland@5479 1851 virtual bool is_ArgInfoData() const { return true; }
kvn@45 1852
kvn@45 1853
roland@5479 1854 int number_of_args() const {
kvn@45 1855 return array_len();
kvn@45 1856 }
kvn@45 1857
roland@5479 1858 uint arg_modified(int arg) const {
kvn@45 1859 return array_uint_at(arg);
kvn@45 1860 }
kvn@45 1861
kvn@45 1862 void set_arg_modified(int arg, uint val) {
kvn@45 1863 array_set_int_at(arg, val);
kvn@45 1864 }
kvn@45 1865
roland@6054 1866 void print_data_on(outputStream* st, const char* extra = NULL) const;
kvn@45 1867 };
kvn@45 1868
roland@5552 1869 // ParametersTypeData
roland@5552 1870 //
roland@5552 1871 // A ParametersTypeData is used to access profiling information about
roland@5552 1872 // types of parameters to a method
roland@5552 1873 class ParametersTypeData : public ArrayData {
roland@5552 1874
roland@5552 1875 private:
roland@5552 1876 TypeStackSlotEntries _parameters;
roland@5552 1877
roland@5552 1878 static int stack_slot_local_offset(int i) {
roland@5552 1879 assert_profiling_enabled();
roland@5552 1880 return array_start_off_set + TypeStackSlotEntries::stack_slot_local_offset(i);
roland@5552 1881 }
roland@5552 1882
roland@5552 1883 static int type_local_offset(int i) {
roland@5552 1884 assert_profiling_enabled();
roland@5552 1885 return array_start_off_set + TypeStackSlotEntries::type_local_offset(i);
roland@5552 1886 }
roland@5552 1887
roland@5552 1888 static bool profiling_enabled();
roland@5552 1889 static void assert_profiling_enabled() {
roland@5552 1890 assert(profiling_enabled(), "method parameters profiling should be on");
roland@5552 1891 }
roland@5552 1892
roland@5552 1893 public:
roland@5552 1894 ParametersTypeData(DataLayout* layout) : ArrayData(layout), _parameters(1, number_of_parameters()) {
roland@5552 1895 assert(layout->tag() == DataLayout::parameters_type_data_tag, "wrong type");
roland@5552 1896 // Some compilers (VC++) don't want this passed in member initialization list
roland@5552 1897 _parameters.set_profile_data(this);
roland@5552 1898 }
roland@5552 1899
roland@5552 1900 static int compute_cell_count(Method* m);
roland@5552 1901
roland@5552 1902 virtual bool is_ParametersTypeData() const { return true; }
roland@5552 1903
roland@5552 1904 virtual void post_initialize(BytecodeStream* stream, MethodData* mdo);
roland@5552 1905
roland@5552 1906 int number_of_parameters() const {
roland@5552 1907 return array_len() / TypeStackSlotEntries::per_arg_count();
roland@5552 1908 }
roland@5552 1909
roland@5552 1910 const TypeStackSlotEntries* parameters() const { return &_parameters; }
roland@5552 1911
roland@5552 1912 uint stack_slot(int i) const {
roland@5552 1913 return _parameters.stack_slot(i);
roland@5552 1914 }
roland@5552 1915
roland@5552 1916 void set_type(int i, Klass* k) {
roland@5552 1917 intptr_t current = _parameters.type(i);
roland@5552 1918 _parameters.set_type(i, TypeEntries::with_status((intptr_t)k, current));
roland@5552 1919 }
roland@5552 1920
roland@5552 1921 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure) {
roland@5552 1922 _parameters.clean_weak_klass_links(is_alive_closure);
roland@5552 1923 }
roland@5552 1924
roland@6054 1925 virtual void print_data_on(outputStream* st, const char* extra = NULL) const;
roland@5552 1926
roland@5552 1927 static ByteSize stack_slot_offset(int i) {
roland@5552 1928 return cell_offset(stack_slot_local_offset(i));
roland@5552 1929 }
roland@5552 1930
roland@5552 1931 static ByteSize type_offset(int i) {
roland@5552 1932 return cell_offset(type_local_offset(i));
roland@5552 1933 }
roland@5552 1934 };
roland@5552 1935
roland@6054 1936 // SpeculativeTrapData
roland@6054 1937 //
roland@6054 1938 // A SpeculativeTrapData is used to record traps due to type
roland@6054 1939 // speculation. It records the root of the compilation: that type
roland@6054 1940 // speculation is wrong in the context of one compilation (for
roland@6054 1941 // method1) doesn't mean it's wrong in the context of another one (for
roland@6054 1942 // method2). Type speculation could have more/different data in the
roland@6054 1943 // context of the compilation of method2 and it's worthwhile to try an
roland@6054 1944 // optimization that failed for compilation of method1 in the context
roland@6054 1945 // of compilation of method2.
roland@6054 1946 // Space for SpeculativeTrapData entries is allocated from the extra
roland@6054 1947 // data space in the MDO. If we run out of space, the trap data for
roland@6054 1948 // the ProfileData at that bci is updated.
roland@6054 1949 class SpeculativeTrapData : public ProfileData {
roland@6054 1950 protected:
roland@6054 1951 enum {
roland@6464 1952 speculative_trap_method,
roland@6054 1953 speculative_trap_cell_count
roland@6054 1954 };
roland@6054 1955 public:
roland@6054 1956 SpeculativeTrapData(DataLayout* layout) : ProfileData(layout) {
roland@6054 1957 assert(layout->tag() == DataLayout::speculative_trap_data_tag, "wrong type");
roland@6054 1958 }
roland@6054 1959
roland@6054 1960 virtual bool is_SpeculativeTrapData() const { return true; }
roland@6054 1961
roland@6054 1962 static int static_cell_count() {
roland@6054 1963 return speculative_trap_cell_count;
roland@6054 1964 }
roland@6054 1965
roland@6054 1966 virtual int cell_count() const {
roland@6054 1967 return static_cell_count();
roland@6054 1968 }
roland@6054 1969
roland@6054 1970 // Direct accessor
roland@6054 1971 Method* method() const {
roland@6464 1972 return (Method*)intptr_at(speculative_trap_method);
roland@6054 1973 }
roland@6054 1974
roland@6054 1975 void set_method(Method* m) {
coleenp@7615 1976 assert(!m->is_old(), "cannot add old methods");
roland@6464 1977 set_intptr_at(speculative_trap_method, (intptr_t)m);
roland@6464 1978 }
roland@6464 1979
roland@6464 1980 static ByteSize method_offset() {
roland@6464 1981 return cell_offset(speculative_trap_method);
roland@6054 1982 }
roland@6054 1983
roland@6054 1984 virtual void print_data_on(outputStream* st, const char* extra = NULL) const;
roland@6054 1985 };
roland@6054 1986
coleenp@3602 1987 // MethodData*
duke@0 1988 //
coleenp@3602 1989 // A MethodData* holds information which has been collected about
duke@0 1990 // a method. Its layout looks like this:
duke@0 1991 //
duke@0 1992 // -----------------------------
duke@0 1993 // | header |
duke@0 1994 // | klass |
duke@0 1995 // -----------------------------
duke@0 1996 // | method |
coleenp@3602 1997 // | size of the MethodData* |
duke@0 1998 // -----------------------------
duke@0 1999 // | Data entries... |
duke@0 2000 // | (variable size) |
duke@0 2001 // | |
duke@0 2002 // . .
duke@0 2003 // . .
duke@0 2004 // . .
duke@0 2005 // | |
duke@0 2006 // -----------------------------
duke@0 2007 //
duke@0 2008 // The data entry area is a heterogeneous array of DataLayouts. Each
duke@0 2009 // DataLayout in the array corresponds to a specific bytecode in the
duke@0 2010 // method. The entries in the array are sorted by the corresponding
duke@0 2011 // bytecode. Access to the data is via resource-allocated ProfileData,
duke@0 2012 // which point to the underlying blocks of DataLayout structures.
duke@0 2013 //
duke@0 2014 // During interpretation, if profiling in enabled, the interpreter
duke@0 2015 // maintains a method data pointer (mdp), which points at the entry
duke@0 2016 // in the array corresponding to the current bci. In the course of
duke@0 2017 // intepretation, when a bytecode is encountered that has profile data
duke@0 2018 // associated with it, the entry pointed to by mdp is updated, then the
duke@0 2019 // mdp is adjusted to point to the next appropriate DataLayout. If mdp
duke@0 2020 // is NULL to begin with, the interpreter assumes that the current method
duke@0 2021 // is not (yet) being profiled.
duke@0 2022 //
coleenp@3602 2023 // In MethodData* parlance, "dp" is a "data pointer", the actual address
duke@0 2024 // of a DataLayout element. A "di" is a "data index", the offset in bytes
duke@0 2025 // from the base of the data entry array. A "displacement" is the byte offset
duke@0 2026 // in certain ProfileData objects that indicate the amount the mdp must be
duke@0 2027 // adjusted in the event of a change in control flow.
duke@0 2028 //
duke@0 2029
goetz@5974 2030 CC_INTERP_ONLY(class BytecodeInterpreter;)
roland@6247 2031 class CleanExtraDataClosure;
goetz@5974 2032
coleenp@3602 2033 class MethodData : public Metadata {
duke@0 2034 friend class VMStructs;
goetz@5974 2035 CC_INTERP_ONLY(friend class BytecodeInterpreter;)
duke@0 2036 private:
duke@0 2037 friend class ProfileData;
duke@0 2038
coleenp@3602 2039 // Back pointer to the Method*
coleenp@3602 2040 Method* _method;
duke@0 2041
duke@0 2042 // Size of this oop in bytes
duke@0 2043 int _size;
duke@0 2044
duke@0 2045 // Cached hint for bci_to_dp and bci_to_data
duke@0 2046 int _hint_di;
duke@0 2047
roland@6098 2048 Mutex _extra_data_lock;
roland@6098 2049
coleenp@3602 2050 MethodData(methodHandle method, int size, TRAPS);
coleenp@3602 2051 public:
coleenp@3602 2052 static MethodData* allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS);
roland@6098 2053 MethodData() : _extra_data_lock(Monitor::leaf, "MDO extra data lock") {}; // For ciMethodData
coleenp@3602 2054
coleenp@3602 2055 bool is_methodData() const volatile { return true; }
coleenp@3602 2056
duke@0 2057 // Whole-method sticky bits and flags
duke@0 2058 enum {
rbackman@6557 2059 _trap_hist_limit = 21, // decoupled from Deoptimization::Reason_LIMIT
duke@0 2060 _trap_hist_mask = max_jubyte,
duke@0 2061 _extra_data_count = 4 // extra DataLayout headers, for trap history
duke@0 2062 }; // Public flag values
duke@0 2063 private:
duke@0 2064 uint _nof_decompiles; // count of all nmethod removals
duke@0 2065 uint _nof_overflow_recompiles; // recompile count, excluding recomp. bits
duke@0 2066 uint _nof_overflow_traps; // trap count, excluding _trap_hist
duke@0 2067 union {
duke@0 2068 intptr_t _align;
duke@0 2069 u1 _array[_trap_hist_limit];
duke@0 2070 } _trap_hist;
duke@0 2071
duke@0 2072 // Support for interprocedural escape analysis, from Thomas Kotzmann.
duke@0 2073 intx _eflags; // flags on escape information
duke@0 2074 intx _arg_local; // bit set of non-escaping arguments
duke@0 2075 intx _arg_stack; // bit set of stack-allocatable arguments
duke@0 2076 intx _arg_returned; // bit set of returned arguments
duke@0 2077
iveresov@1703 2078 int _creation_mileage; // method mileage at MDO creation
iveresov@1703 2079
iveresov@1703 2080 // How many invocations has this MDO seen?
iveresov@1703 2081 // These counters are used to determine the exact age of MDO.
iveresov@1703 2082 // We need those because in tiered a method can be concurrently
iveresov@1703 2083 // executed at different levels.
iveresov@1703 2084 InvocationCounter _invocation_counter;
iveresov@1703 2085 // Same for backedges.
iveresov@1703 2086 InvocationCounter _backedge_counter;
iveresov@2124 2087 // Counter values at the time profiling started.
iveresov@2124 2088 int _invocation_counter_start;
iveresov@2124 2089 int _backedge_counter_start;
iveresov@6430 2090 uint _tenure_traps;
kvn@6182 2091
kvn@6182 2092 #if INCLUDE_RTM_OPT
kvn@6182 2093 // State of RTM code generation during compilation of the method
kvn@6182 2094 int _rtm_state;
kvn@6182 2095 #endif
kvn@6182 2096
iveresov@1703 2097 // Number of loops and blocks is computed when compiling the first
iveresov@1703 2098 // time with C1. It is used to determine if method is trivial.
iveresov@1703 2099 short _num_loops;
iveresov@1703 2100 short _num_blocks;
iveresov@1703 2101 // Does this method contain anything worth profiling?
thartmann@7384 2102 enum WouldProfile {unknown, no_profile, profile};
thartmann@7384 2103 WouldProfile _would_profile;
duke@0 2104
duke@0 2105 // Size of _data array in bytes. (Excludes header and extra_data fields.)
duke@0 2106 int _data_size;
duke@0 2107
roland@5552 2108 // data index for the area dedicated to parameters. -1 if no
roland@5552 2109 // parameter profiling.
roland@7003 2110 enum { no_parameters = -2, parameters_uninitialized = -1 };
roland@5552 2111 int _parameters_type_data_di;
roland@7003 2112 int parameters_size_in_bytes() const {
roland@7003 2113 ParametersTypeData* param = parameters_type_data();
roland@7003 2114 return param == NULL ? 0 : param->size_in_bytes();
roland@7003 2115 }
roland@5552 2116
duke@0 2117 // Beginning of the data entries
duke@0 2118 intptr_t _data[1];
duke@0 2119
duke@0 2120 // Helper for size computation
duke@0 2121 static int compute_data_size(BytecodeStream* stream);
duke@0 2122 static int bytecode_cell_count(Bytecodes::Code code);
roland@6054 2123 static bool is_speculative_trap_bytecode(Bytecodes::Code code);
duke@0 2124 enum { no_profile_data = -1, variable_cell_count = -2 };
duke@0 2125
duke@0 2126 // Helper for initialization
coleenp@3602 2127 DataLayout* data_layout_at(int data_index) const {
duke@0 2128 assert(data_index % sizeof(intptr_t) == 0, "unaligned");
duke@0 2129 return (DataLayout*) (((address)_data) + data_index);
duke@0 2130 }
duke@0 2131
duke@0 2132 // Initialize an individual data segment. Returns the size of
duke@0 2133 // the segment in bytes.
duke@0 2134 int initialize_data(BytecodeStream* stream, int data_index);
duke@0 2135
duke@0 2136 // Helper for data_at
coleenp@3602 2137 DataLayout* limit_data_position() const {
roland@7003 2138 return data_layout_at(_data_size);
duke@0 2139 }
coleenp@3602 2140 bool out_of_bounds(int data_index) const {
duke@0 2141 return data_index >= data_size();
duke@0 2142 }
duke@0 2143
duke@0 2144 // Give each of the data entries a chance to perform specific
duke@0 2145 // data initialization.
duke@0 2146 void post_initialize(BytecodeStream* stream);
duke@0 2147
duke@0 2148 // hint accessors
duke@0 2149 int hint_di() const { return _hint_di; }
duke@0 2150 void set_hint_di(int di) {
duke@0 2151 assert(!out_of_bounds(di), "hint_di out of bounds");
duke@0 2152 _hint_di = di;
duke@0 2153 }
duke@0 2154 ProfileData* data_before(int bci) {
duke@0 2155 // avoid SEGV on this edge case
duke@0 2156 if (data_size() == 0)
duke@0 2157 return NULL;
duke@0 2158 int hint = hint_di();
duke@0 2159 if (data_layout_at(hint)->bci() <= bci)
duke@0 2160 return data_at(hint);
duke@0 2161 return first_data();
duke@0 2162 }
duke@0 2163
duke@0 2164 // What is the index of the first data entry?
coleenp@3602 2165 int first_di() const { return 0; }
duke@0 2166
roland@6098 2167 ProfileData* bci_to_extra_data_helper(int bci, Method* m, DataLayout*& dp, bool concurrent);
duke@0 2168 // Find or create an extra ProfileData:
roland@6054 2169 ProfileData* bci_to_extra_data(int bci, Method* m, bool create_if_missing);
duke@0 2170
kvn@45 2171 // return the argument info cell
kvn@45 2172 ArgInfoData *arg_info();
kvn@45 2173
roland@5479 2174 enum {
roland@5479 2175 no_type_profile = 0,
roland@5479 2176 type_profile_jsr292 = 1,
roland@5479 2177 type_profile_all = 2
roland@5479 2178 };
roland@5479 2179
roland@5479 2180 static bool profile_jsr292(methodHandle m, int bci);
roland@5479 2181 static int profile_arguments_flag();
roland@5479 2182 static bool profile_all_arguments();
roland@5479 2183 static bool profile_arguments_for_invoke(methodHandle m, int bci);
roland@5486 2184 static int profile_return_flag();
roland@5486 2185 static bool profile_all_return();
roland@5486 2186 static bool profile_return_for_invoke(methodHandle m, int bci);
roland@5552 2187 static int profile_parameters_flag();
roland@5552 2188 static bool profile_parameters_jsr292_only();
roland@5552 2189 static bool profile_all_parameters();
roland@5479 2190
roland@6247 2191 void clean_extra_data(CleanExtraDataClosure* cl);
roland@6054 2192 void clean_extra_data_helper(DataLayout* dp, int shift, bool reset = false);
roland@6247 2193 void verify_extra_data_clean(CleanExtraDataClosure* cl);
roland@6054 2194
duke@0 2195 public:
duke@0 2196 static int header_size() {
coleenp@3602 2197 return sizeof(MethodData)/wordSize;
duke@0 2198 }
duke@0 2199
coleenp@3602 2200 // Compute the size of a MethodData* before it is created.
duke@0 2201 static int compute_allocation_size_in_bytes(methodHandle method);
duke@0 2202 static int compute_allocation_size_in_words(methodHandle method);
roland@6054 2203 static int compute_extra_data_count(int data_size, int empty_bc_count, bool needs_speculative_traps);
duke@0 2204
duke@0 2205 // Determine if a given bytecode can have profile information.
duke@0 2206 static bool bytecode_has_profile(Bytecodes::Code code) {
duke@0 2207 return bytecode_cell_count(code) != no_profile_data;
duke@0 2208 }
duke@0 2209
iignatyev@4473 2210 // reset into original state
iignatyev@4473 2211 void init();
duke@0 2212
duke@0 2213 // My size
coleenp@3602 2214 int size_in_bytes() const { return _size; }
coleenp@3602 2215 int size() const { return align_object_size(align_size_up(_size, BytesPerWord)/BytesPerWord); }
acorn@4062 2216 #if INCLUDE_SERVICES
acorn@4062 2217 void collect_statistics(KlassSizeStats *sz) const;
acorn@4062 2218 #endif
duke@0 2219
duke@0 2220 int creation_mileage() const { return _creation_mileage; }
duke@0 2221 void set_creation_mileage(int x) { _creation_mileage = x; }
iveresov@1703 2222
iveresov@1703 2223 int invocation_count() {
iveresov@1703 2224 if (invocation_counter()->carry()) {
iveresov@1703 2225 return InvocationCounter::count_limit;
iveresov@1703 2226 }
iveresov@1703 2227 return invocation_counter()->count();
iveresov@1703 2228 }
iveresov@1703 2229 int backedge_count() {
iveresov@1703 2230 if (backedge_counter()->carry()) {
iveresov@1703 2231 return InvocationCounter::count_limit;
iveresov@1703 2232 }
iveresov@1703 2233 return backedge_counter()->count();
iveresov@1703 2234 }
iveresov@1703 2235
iveresov@2124 2236 int invocation_count_start() {
iveresov@2124 2237 if (invocation_counter()->carry()) {
iveresov@2124 2238 return 0;
iveresov@2124 2239 }
iveresov@2124 2240 return _invocation_counter_start;
iveresov@2124 2241 }
iveresov@2124 2242
iveresov@2124 2243 int backedge_count_start() {
iveresov@2124 2244 if (backedge_counter()->carry()) {
iveresov@2124 2245 return 0;
iveresov@2124 2246 }
iveresov@2124 2247 return _backedge_counter_start;
iveresov@2124 2248 }
iveresov@2124 2249
iveresov@2124 2250 int invocation_count_delta() { return invocation_count() - invocation_count_start(); }
iveresov@2124 2251 int backedge_count_delta() { return backedge_count() - backedge_count_start(); }
iveresov@2124 2252
iveresov@2124 2253 void reset_start_counters() {
iveresov@2124 2254 _invocation_counter_start = invocation_count();
iveresov@2124 2255 _backedge_counter_start = backedge_count();
iveresov@2124 2256 }
iveresov@2124 2257
iveresov@1703 2258 InvocationCounter* invocation_counter() { return &_invocation_counter; }
iveresov@1703 2259 InvocationCounter* backedge_counter() { return &_backedge_counter; }
iveresov@1703 2260
kvn@6182 2261 #if INCLUDE_RTM_OPT
kvn@6182 2262 int rtm_state() const {
kvn@6182 2263 return _rtm_state;
kvn@6182 2264 }
kvn@6182 2265 void set_rtm_state(RTMState rstate) {
kvn@6182 2266 _rtm_state = (int)rstate;
kvn@6182 2267 }
kvn@6182 2268 void atomic_set_rtm_state(RTMState rstate) {
kvn@6182 2269 Atomic::store((int)rstate, &_rtm_state);
kvn@6182 2270 }
kvn@6182 2271
kvn@6182 2272 static int rtm_state_offset_in_bytes() {
kvn@6182 2273 return offset_of(MethodData, _rtm_state);
kvn@6182 2274 }
kvn@6182 2275 #endif
kvn@6182 2276
thartmann@7384 2277 void set_would_profile(bool p) { _would_profile = p ? profile : no_profile; }
thartmann@7384 2278 bool would_profile() const { return _would_profile != no_profile; }
iveresov@1703 2279
iveresov@1703 2280 int num_loops() const { return _num_loops; }
iveresov@1703 2281 void set_num_loops(int n) { _num_loops = n; }
iveresov@1703 2282 int num_blocks() const { return _num_blocks; }
iveresov@1703 2283 void set_num_blocks(int n) { _num_blocks = n; }
iveresov@1703 2284
duke@0 2285 bool is_mature() const; // consult mileage and ProfileMaturityPercentage
coleenp@3602 2286 static int mileage_of(Method* m);
duke@0 2287
duke@0 2288 // Support for interprocedural escape analysis, from Thomas Kotzmann.
duke@0 2289 enum EscapeFlag {
duke@0 2290 estimated = 1 << 0,
kvn@78 2291 return_local = 1 << 1,
kvn@78 2292 return_allocated = 1 << 2,
kvn@78 2293 allocated_escapes = 1 << 3,
kvn@78 2294 unknown_modified = 1 << 4
duke@0 2295 };
duke@0 2296
duke@0 2297 intx eflags() { return _eflags; }
duke@0 2298 intx arg_local() { return _arg_local; }
duke@0 2299 intx arg_stack() { return _arg_stack; }
duke@0 2300 intx arg_returned() { return _arg_returned; }
kvn@45 2301 uint arg_modified(int a) { ArgInfoData *aid = arg_info();
iignatyev@4473 2302 assert(aid != NULL, "arg_info must be not null");
kvn@45 2303 assert(a >= 0 && a < aid->number_of_args(), "valid argument number");
kvn@45 2304 return aid->arg_modified(a); }
duke@0 2305
duke@0 2306 void set_eflags(intx v) { _eflags = v; }
duke@0 2307 void set_arg_local(intx v) { _arg_local = v; }
duke@0 2308 void set_arg_stack(intx v) { _arg_stack = v; }
duke@0 2309 void set_arg_returned(intx v) { _arg_returned = v; }
kvn@45 2310 void set_arg_modified(int a, uint v) { ArgInfoData *aid = arg_info();
iignatyev@4473 2311 assert(aid != NULL, "arg_info must be not null");
kvn@45 2312 assert(a >= 0 && a < aid->number_of_args(), "valid argument number");
kvn@45 2313 aid->set_arg_modified(a, v); }
duke@0 2314
duke@0 2315 void clear_escape_info() { _eflags = _arg_local = _arg_stack = _arg_returned = 0; }
duke@0 2316
duke@0 2317 // Location and size of data area
duke@0 2318 address data_base() const {
duke@0 2319 return (address) _data;
duke@0 2320 }
coleenp@3602 2321 int data_size() const {
duke@0 2322 return _data_size;
duke@0 2323 }
duke@0 2324
duke@0 2325 // Accessors
coleenp@3602 2326 Method* method() const { return _method; }
duke@0 2327
duke@0 2328 // Get the data at an arbitrary (sort of) data index.
coleenp@3602 2329 ProfileData* data_at(int data_index) const;
duke@0 2330
duke@0 2331 // Walk through the data in order.
coleenp@3602 2332 ProfileData* first_data() const { return data_at(first_di()); }
coleenp@3602 2333 ProfileData* next_data(ProfileData* current) const;
coleenp@3602 2334 bool is_valid(ProfileData* current) const { return current != NULL; }
duke@0 2335
duke@0 2336 // Convert a dp (data pointer) to a di (data index).
coleenp@3602 2337 int dp_to_di(address dp) const {
duke@0 2338 return dp - ((address)_data);
duke@0 2339 }
duke@0 2340
duke@0 2341 // bci to di/dp conversion.
duke@0 2342 address bci_to_dp(int bci);
duke@0 2343 int bci_to_di(int bci) {
duke@0 2344 return dp_to_di(bci_to_dp(bci));
duke@0 2345 }
duke@0 2346
duke@0 2347 // Get the data at an arbitrary bci, or NULL if there is none.
duke@0 2348 ProfileData* bci_to_data(int bci);
duke@0 2349
duke@0 2350 // Same, but try to create an extra_data record if one is needed:
roland@6054 2351 ProfileData* allocate_bci_to_data(int bci, Method* m) {
roland@6054 2352 ProfileData* data = NULL;
roland@6054 2353 // If m not NULL, try to allocate a SpeculativeTrapData entry
roland@6054 2354 if (m == NULL) {
roland@6054 2355 data = bci_to_data(bci);
roland@6054 2356 }
roland@6054 2357 if (data != NULL) {
roland@6054 2358 return data;
roland@6054 2359 }
roland@6054 2360 data = bci_to_extra_data(bci, m, true);
roland@6054 2361 if (data != NULL) {
roland@6054 2362 return data;
roland@6054 2363 }
roland@6054 2364 // If SpeculativeTrapData allocation fails try to allocate a
roland@6054 2365 // regular entry
roland@6054 2366 data = bci_to_data(bci);
roland@6054 2367 if (data != NULL) {
roland@6054 2368 return data;
roland@6054 2369 }
roland@6054 2370 return bci_to_extra_data(bci, NULL, true);
duke@0 2371 }
duke@0 2372
duke@0 2373 // Add a handful of extra data records, for trap tracking.
roland@7003 2374 DataLayout* extra_data_base() const { return limit_data_position(); }
coleenp@3602 2375 DataLayout* extra_data_limit() const { return (DataLayout*)((address)this + size_in_bytes()); }
roland@7003 2376 DataLayout* args_data_limit() const { return (DataLayout*)((address)this + size_in_bytes() -
roland@7003 2377 parameters_size_in_bytes()); }
roland@7003 2378 int extra_data_size() const { return (address)extra_data_limit() - (address)extra_data_base(); }
roland@6054 2379 static DataLayout* next_extra(DataLayout* dp);
duke@0 2380
duke@0 2381 // Return (uint)-1 for overflow.
duke@0 2382 uint trap_count(int reason) const {
duke@0 2383 assert((uint)reason < _trap_hist_limit, "oob");
duke@0 2384 return (int)((_trap_hist._array[reason]+1) & _trap_hist_mask) - 1;
duke@0 2385 }
duke@0 2386 // For loops:
duke@0 2387 static uint trap_reason_limit() { return _trap_hist_limit; }
duke@0 2388 static uint trap_count_limit() { return _trap_hist_mask; }
duke@0 2389 uint inc_trap_count(int reason) {
duke@0 2390 // Count another trap, anywhere in this method.
duke@0 2391 assert(reason >= 0, "must be single trap");
duke@0 2392 if ((uint)reason < _trap_hist_limit) {
duke@0 2393 uint cnt1 = 1 + _trap_hist._array[reason];
duke@0 2394 if ((cnt1 & _trap_hist_mask) != 0) { // if no counter overflow...
duke@0 2395 _trap_hist._array[reason] = cnt1;
duke@0 2396 return cnt1;
duke@0 2397 } else {
duke@0 2398 return _trap_hist_mask + (++_nof_overflow_traps);
duke@0 2399 }
duke@0 2400 } else {
duke@0 2401 // Could not represent the count in the histogram.
duke@0 2402 return (++_nof_overflow_traps);
duke@0 2403 }
duke@0 2404 }
duke@0 2405
duke@0 2406 uint overflow_trap_count() const {
duke@0 2407 return _nof_overflow_traps;
duke@0 2408 }
duke@0 2409 uint overflow_recompile_count() const {
duke@0 2410 return _nof_overflow_recompiles;
duke@0 2411 }
duke@0 2412 void inc_overflow_recompile_count() {
duke@0 2413 _nof_overflow_recompiles += 1;
duke@0 2414 }
duke@0 2415 uint decompile_count() const {
duke@0 2416 return _nof_decompiles;
duke@0 2417 }
duke@0 2418 void inc_decompile_count() {
duke@0 2419 _nof_decompiles += 1;
kvn@1206 2420 if (decompile_count() > (uint)PerMethodRecompilationCutoff) {
vlivanov@4104 2421 method()->set_not_compilable(CompLevel_full_optimization, true, "decompile_count > PerMethodRecompilationCutoff");
kvn@1206 2422 }
duke@0 2423 }
iveresov@6430 2424 uint tenure_traps() const {
iveresov@6430 2425 return _tenure_traps;
iveresov@6430 2426 }
iveresov@6430 2427 void inc_tenure_traps() {
iveresov@6430 2428 _tenure_traps += 1;
iveresov@6430 2429 }
duke@0 2430
roland@5552 2431 // Return pointer to area dedicated to parameters in MDO
roland@5552 2432 ParametersTypeData* parameters_type_data() const {
roland@7003 2433 assert(_parameters_type_data_di != parameters_uninitialized, "called too early");
roland@7003 2434 return _parameters_type_data_di != no_parameters ? data_layout_at(_parameters_type_data_di)->data_in()->as_ParametersTypeData() : NULL;
roland@5552 2435 }
roland@5552 2436
roland@5552 2437 int parameters_type_data_di() const {
roland@7003 2438 assert(_parameters_type_data_di != parameters_uninitialized && _parameters_type_data_di != no_parameters, "no args type data");
roland@5552 2439 return _parameters_type_data_di;
roland@5552 2440 }
roland@5552 2441
duke@0 2442 // Support for code generation
duke@0 2443 static ByteSize data_offset() {
coleenp@3602 2444 return byte_offset_of(MethodData, _data[0]);
duke@0 2445 }
duke@0 2446
iveresov@1703 2447 static ByteSize invocation_counter_offset() {
coleenp@3602 2448 return byte_offset_of(MethodData, _invocation_counter);
iveresov@1703 2449 }
iveresov@1703 2450 static ByteSize backedge_counter_offset() {
coleenp@3602 2451 return byte_offset_of(MethodData, _backedge_counter);
iveresov@1703 2452 }
iveresov@1703 2453
roland@5552 2454 static ByteSize parameters_type_data_di_offset() {
roland@5552 2455 return byte_offset_of(MethodData, _parameters_type_data_di);
roland@5552 2456 }
roland@5552 2457
coleenp@3602 2458 // Deallocation support - no pointer fields to deallocate
coleenp@3602 2459 void deallocate_contents(ClassLoaderData* loader_data) {}
coleenp@3602 2460
duke@0 2461 // GC support
coleenp@3602 2462 void set_size(int object_size_in_bytes) { _size = object_size_in_bytes; }
coleenp@3602 2463
coleenp@3602 2464 // Printing
coleenp@3602 2465 void print_on (outputStream* st) const;
coleenp@3602 2466 void print_value_on(outputStream* st) const;
duke@0 2467
duke@0 2468 // printing support for method data
coleenp@3602 2469 void print_data_on(outputStream* st) const;
duke@0 2470
coleenp@3602 2471 const char* internal_name() const { return "{method data}"; }
coleenp@3602 2472
duke@0 2473 // verification
coleenp@3602 2474 void verify_on(outputStream* st);
duke@0 2475 void verify_data_on(outputStream* st);
roland@5479 2476
roland@5552 2477 static bool profile_parameters_for_method(methodHandle m);
roland@5479 2478 static bool profile_arguments();
roland@6320 2479 static bool profile_arguments_jsr292_only();
roland@5486 2480 static bool profile_return();
roland@5552 2481 static bool profile_parameters();
roland@5486 2482 static bool profile_return_jsr292_only();
roland@6054 2483
roland@6054 2484 void clean_method_data(BoolObjectClosure* is_alive);
roland@6247 2485 void clean_weak_method_links();
coleenp@7615 2486 DEBUG_ONLY(void verify_clean_weak_method_links();)
roland@7003 2487 Mutex* extra_data_lock() { return &_extra_data_lock; }
duke@0 2488 };
stefank@1879 2489
stefank@1879 2490 #endif // SHARE_VM_OOPS_METHODDATAOOP_HPP