annotate src/share/vm/oops/methodData.hpp @ 5987:018b357638aa

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