src/share/vm/compiler/oopMap.cpp

Fri, 11 Jul 2008 12:19:29 -0700

author
kvn
date
Fri, 11 Jul 2008 12:19:29 -0700
changeset 680
4a4c365f777d
parent 631
d1605aabd0a1
parent 679
524eca34ea76
child 1293
5314d85ffd54
permissions
-rw-r--r--

Merge

duke@435 1 /*
xdono@631 2 * Copyright 1998-2008 Sun Microsystems, Inc. All Rights Reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
duke@435 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435 21 * have any questions.
duke@435 22 *
duke@435 23 */
duke@435 24
duke@435 25 # include "incls/_precompiled.incl"
duke@435 26 # include "incls/_oopMap.cpp.incl"
duke@435 27
duke@435 28 // OopMapStream
duke@435 29
duke@435 30 OopMapStream::OopMapStream(OopMap* oop_map) {
duke@435 31 if(oop_map->omv_data() == NULL) {
duke@435 32 _stream = new CompressedReadStream(oop_map->write_stream()->buffer());
duke@435 33 } else {
duke@435 34 _stream = new CompressedReadStream(oop_map->omv_data());
duke@435 35 }
duke@435 36 _mask = OopMapValue::type_mask_in_place;
duke@435 37 _size = oop_map->omv_count();
duke@435 38 _position = 0;
duke@435 39 _valid_omv = false;
duke@435 40 }
duke@435 41
duke@435 42
duke@435 43 OopMapStream::OopMapStream(OopMap* oop_map, int oop_types_mask) {
duke@435 44 if(oop_map->omv_data() == NULL) {
duke@435 45 _stream = new CompressedReadStream(oop_map->write_stream()->buffer());
duke@435 46 } else {
duke@435 47 _stream = new CompressedReadStream(oop_map->omv_data());
duke@435 48 }
duke@435 49 _mask = oop_types_mask;
duke@435 50 _size = oop_map->omv_count();
duke@435 51 _position = 0;
duke@435 52 _valid_omv = false;
duke@435 53 }
duke@435 54
duke@435 55
duke@435 56 void OopMapStream::find_next() {
duke@435 57 while(_position++ < _size) {
duke@435 58 _omv.read_from(_stream);
duke@435 59 if(((int)_omv.type() & _mask) > 0) {
duke@435 60 _valid_omv = true;
duke@435 61 return;
duke@435 62 }
duke@435 63 }
duke@435 64 _valid_omv = false;
duke@435 65 }
duke@435 66
duke@435 67
duke@435 68 // OopMap
duke@435 69
duke@435 70 // frame_size units are stack-slots (4 bytes) NOT intptr_t; we can name odd
duke@435 71 // slots to hold 4-byte values like ints and floats in the LP64 build.
duke@435 72 OopMap::OopMap(int frame_size, int arg_count) {
duke@435 73 // OopMaps are usually quite so small, so pick a small initial size
duke@435 74 set_write_stream(new CompressedWriteStream(32));
duke@435 75 set_omv_data(NULL);
duke@435 76 set_omv_count(0);
duke@435 77
duke@435 78 #ifdef ASSERT
duke@435 79 _locs_length = VMRegImpl::stack2reg(0)->value() + frame_size + arg_count;
duke@435 80 _locs_used = NEW_RESOURCE_ARRAY(OopMapValue::oop_types, _locs_length);
duke@435 81 for(int i = 0; i < _locs_length; i++) _locs_used[i] = OopMapValue::unused_value;
duke@435 82 #endif
duke@435 83 }
duke@435 84
duke@435 85
duke@435 86 OopMap::OopMap(OopMap::DeepCopyToken, OopMap* source) {
duke@435 87 // This constructor does a deep copy
duke@435 88 // of the source OopMap.
duke@435 89 set_write_stream(new CompressedWriteStream(source->omv_count() * 2));
duke@435 90 set_omv_data(NULL);
duke@435 91 set_omv_count(0);
duke@435 92 set_offset(source->offset());
duke@435 93
duke@435 94 #ifdef ASSERT
duke@435 95 _locs_length = source->_locs_length;
duke@435 96 _locs_used = NEW_RESOURCE_ARRAY(OopMapValue::oop_types, _locs_length);
duke@435 97 for(int i = 0; i < _locs_length; i++) _locs_used[i] = OopMapValue::unused_value;
duke@435 98 #endif
duke@435 99
duke@435 100 // We need to copy the entries too.
duke@435 101 for (OopMapStream oms(source); !oms.is_done(); oms.next()) {
duke@435 102 OopMapValue omv = oms.current();
duke@435 103 omv.write_on(write_stream());
duke@435 104 increment_count();
duke@435 105 }
duke@435 106 }
duke@435 107
duke@435 108
duke@435 109 OopMap* OopMap::deep_copy() {
duke@435 110 return new OopMap(_deep_copy_token, this);
duke@435 111 }
duke@435 112
duke@435 113
duke@435 114 void OopMap::copy_to(address addr) {
duke@435 115 memcpy(addr,this,sizeof(OopMap));
duke@435 116 memcpy(addr + sizeof(OopMap),write_stream()->buffer(),write_stream()->position());
duke@435 117 OopMap* new_oop = (OopMap*)addr;
duke@435 118 new_oop->set_omv_data_size(write_stream()->position());
duke@435 119 new_oop->set_omv_data((unsigned char *)(addr + sizeof(OopMap)));
duke@435 120 new_oop->set_write_stream(NULL);
duke@435 121 }
duke@435 122
duke@435 123
duke@435 124 int OopMap::heap_size() const {
duke@435 125 int size = sizeof(OopMap);
duke@435 126 int align = sizeof(void *) - 1;
duke@435 127 if(write_stream() != NULL) {
duke@435 128 size += write_stream()->position();
duke@435 129 } else {
duke@435 130 size += omv_data_size();
duke@435 131 }
duke@435 132 // Align to a reasonable ending point
duke@435 133 size = ((size+align) & ~align);
duke@435 134 return size;
duke@435 135 }
duke@435 136
duke@435 137 // frame_size units are stack-slots (4 bytes) NOT intptr_t; we can name odd
duke@435 138 // slots to hold 4-byte values like ints and floats in the LP64 build.
duke@435 139 void OopMap::set_xxx(VMReg reg, OopMapValue::oop_types x, VMReg optional) {
duke@435 140
duke@435 141 assert(reg->value() < _locs_length, "too big reg value for stack size");
duke@435 142 assert( _locs_used[reg->value()] == OopMapValue::unused_value, "cannot insert twice" );
duke@435 143 debug_only( _locs_used[reg->value()] = x; )
duke@435 144
duke@435 145 OopMapValue o(reg, x);
duke@435 146
duke@435 147 if(x == OopMapValue::callee_saved_value) {
duke@435 148 // This can never be a stack location, so we don't need to transform it.
duke@435 149 assert(optional->is_reg(), "Trying to callee save a stack location");
duke@435 150 o.set_content_reg(optional);
duke@435 151 } else if(x == OopMapValue::derived_oop_value) {
duke@435 152 o.set_content_reg(optional);
duke@435 153 }
duke@435 154
duke@435 155 o.write_on(write_stream());
duke@435 156 increment_count();
duke@435 157 }
duke@435 158
duke@435 159
duke@435 160 void OopMap::set_oop(VMReg reg) {
duke@435 161 set_xxx(reg, OopMapValue::oop_value, VMRegImpl::Bad());
duke@435 162 }
duke@435 163
duke@435 164
duke@435 165 void OopMap::set_value(VMReg reg) {
duke@435 166 // At this time, we only need value entries in our OopMap when ZapDeadCompiledLocals is active.
duke@435 167 if (ZapDeadCompiledLocals)
duke@435 168 set_xxx(reg, OopMapValue::value_value, VMRegImpl::Bad());
duke@435 169 }
duke@435 170
duke@435 171
coleenp@548 172 void OopMap::set_narrowoop(VMReg reg) {
coleenp@548 173 set_xxx(reg, OopMapValue::narrowoop_value, VMRegImpl::Bad());
duke@435 174 }
duke@435 175
duke@435 176
duke@435 177 void OopMap::set_callee_saved(VMReg reg, VMReg caller_machine_register ) {
duke@435 178 set_xxx(reg, OopMapValue::callee_saved_value, caller_machine_register);
duke@435 179 }
duke@435 180
duke@435 181
duke@435 182 void OopMap::set_derived_oop(VMReg reg, VMReg derived_from_local_register ) {
duke@435 183 if( reg == derived_from_local_register ) {
duke@435 184 // Actually an oop, derived shares storage with base,
duke@435 185 set_oop(reg);
duke@435 186 } else {
duke@435 187 set_xxx(reg, OopMapValue::derived_oop_value, derived_from_local_register);
duke@435 188 }
duke@435 189 }
duke@435 190
duke@435 191 // OopMapSet
duke@435 192
duke@435 193 OopMapSet::OopMapSet() {
duke@435 194 set_om_size(MinOopMapAllocation);
duke@435 195 set_om_count(0);
duke@435 196 OopMap** temp = NEW_RESOURCE_ARRAY(OopMap*, om_size());
duke@435 197 set_om_data(temp);
duke@435 198 }
duke@435 199
duke@435 200
duke@435 201 void OopMapSet::grow_om_data() {
duke@435 202 int new_size = om_size() * 2;
duke@435 203 OopMap** new_data = NEW_RESOURCE_ARRAY(OopMap*, new_size);
duke@435 204 memcpy(new_data,om_data(),om_size() * sizeof(OopMap*));
duke@435 205 set_om_size(new_size);
duke@435 206 set_om_data(new_data);
duke@435 207 }
duke@435 208
duke@435 209
duke@435 210 void OopMapSet::copy_to(address addr) {
duke@435 211 address temp = addr;
duke@435 212 int align = sizeof(void *) - 1;
duke@435 213 // Copy this
duke@435 214 memcpy(addr,this,sizeof(OopMapSet));
duke@435 215 temp += sizeof(OopMapSet);
duke@435 216 temp = (address)((intptr_t)(temp + align) & ~align);
duke@435 217 // Do the needed fixups to the new OopMapSet
duke@435 218 OopMapSet* new_set = (OopMapSet*)addr;
duke@435 219 new_set->set_om_data((OopMap**)temp);
duke@435 220 // Allow enough space for the OopMap pointers
duke@435 221 temp += (om_count() * sizeof(OopMap*));
duke@435 222
duke@435 223 for(int i=0; i < om_count(); i++) {
duke@435 224 OopMap* map = at(i);
duke@435 225 map->copy_to((address)temp);
duke@435 226 new_set->set(i,(OopMap*)temp);
duke@435 227 temp += map->heap_size();
duke@435 228 }
duke@435 229 // This "locks" the OopMapSet
duke@435 230 new_set->set_om_size(-1);
duke@435 231 }
duke@435 232
duke@435 233
duke@435 234 void OopMapSet::add_gc_map(int pc_offset, OopMap *map ) {
duke@435 235 assert(om_size() != -1,"Cannot grow a fixed OopMapSet");
duke@435 236
duke@435 237 if(om_count() >= om_size()) {
duke@435 238 grow_om_data();
duke@435 239 }
duke@435 240 map->set_offset(pc_offset);
duke@435 241
duke@435 242 #ifdef ASSERT
duke@435 243 if(om_count() > 0) {
duke@435 244 OopMap* last = at(om_count()-1);
duke@435 245 if (last->offset() == map->offset() ) {
duke@435 246 fatal("OopMap inserted twice");
duke@435 247 }
duke@435 248 if(last->offset() > map->offset()) {
duke@435 249 tty->print_cr( "WARNING, maps not sorted: pc[%d]=%d, pc[%d]=%d",
duke@435 250 om_count(),last->offset(),om_count()+1,map->offset());
duke@435 251 }
duke@435 252 }
duke@435 253 #endif // ASSERT
duke@435 254
duke@435 255 set(om_count(),map);
duke@435 256 increment_count();
duke@435 257 }
duke@435 258
duke@435 259
duke@435 260 int OopMapSet::heap_size() const {
duke@435 261 // The space we use
duke@435 262 int size = sizeof(OopMap);
duke@435 263 int align = sizeof(void *) - 1;
duke@435 264 size = ((size+align) & ~align);
duke@435 265 size += om_count() * sizeof(OopMap*);
duke@435 266
duke@435 267 // Now add in the space needed for the indivdiual OopMaps
duke@435 268 for(int i=0; i < om_count(); i++) {
duke@435 269 size += at(i)->heap_size();
duke@435 270 }
duke@435 271 // We don't need to align this, it will be naturally pointer aligned
duke@435 272 return size;
duke@435 273 }
duke@435 274
duke@435 275
duke@435 276 OopMap* OopMapSet::singular_oop_map() {
duke@435 277 guarantee(om_count() == 1, "Make sure we only have a single gc point");
duke@435 278 return at(0);
duke@435 279 }
duke@435 280
duke@435 281
duke@435 282 OopMap* OopMapSet::find_map_at_offset(int pc_offset) const {
duke@435 283 int i, len = om_count();
duke@435 284 assert( len > 0, "must have pointer maps" );
duke@435 285
duke@435 286 // Scan through oopmaps. Stop when current offset is either equal or greater
duke@435 287 // than the one we are looking for.
duke@435 288 for( i = 0; i < len; i++) {
duke@435 289 if( at(i)->offset() >= pc_offset )
duke@435 290 break;
duke@435 291 }
duke@435 292
duke@435 293 assert( i < len, "oopmap not found" );
duke@435 294
duke@435 295 OopMap* m = at(i);
duke@435 296 assert( m->offset() == pc_offset, "oopmap not found" );
duke@435 297 return m;
duke@435 298 }
duke@435 299
duke@435 300 class DoNothingClosure: public OopClosure {
coleenp@548 301 public:
coleenp@548 302 void do_oop(oop* p) {}
coleenp@548 303 void do_oop(narrowOop* p) {}
duke@435 304 };
duke@435 305 static DoNothingClosure do_nothing;
duke@435 306
duke@435 307 static void add_derived_oop(oop* base, oop* derived) {
duke@435 308 #ifndef TIERED
duke@435 309 COMPILER1_PRESENT(ShouldNotReachHere();)
duke@435 310 #endif // TIERED
duke@435 311 #ifdef COMPILER2
duke@435 312 DerivedPointerTable::add(derived, base);
duke@435 313 #endif // COMPILER2
duke@435 314 }
duke@435 315
duke@435 316
duke@435 317 #ifndef PRODUCT
duke@435 318 static void trace_codeblob_maps(const frame *fr, const RegisterMap *reg_map) {
duke@435 319 // Print oopmap and regmap
duke@435 320 tty->print_cr("------ ");
duke@435 321 CodeBlob* cb = fr->cb();
duke@435 322 OopMapSet* maps = cb->oop_maps();
duke@435 323 OopMap* map = cb->oop_map_for_return_address(fr->pc());
duke@435 324 map->print();
duke@435 325 if( cb->is_nmethod() ) {
duke@435 326 nmethod* nm = (nmethod*)cb;
duke@435 327 // native wrappers have no scope data, it is implied
duke@435 328 if (nm->is_native_method()) {
duke@435 329 tty->print("bci: 0 (native)");
duke@435 330 } else {
duke@435 331 ScopeDesc* scope = nm->scope_desc_at(fr->pc());
duke@435 332 tty->print("bci: %d ",scope->bci());
duke@435 333 }
duke@435 334 }
duke@435 335 tty->cr();
duke@435 336 fr->print_on(tty);
duke@435 337 tty->print(" ");
duke@435 338 cb->print_value_on(tty); tty->cr();
duke@435 339 reg_map->print();
duke@435 340 tty->print_cr("------ ");
duke@435 341
duke@435 342 }
duke@435 343 #endif // PRODUCT
duke@435 344
duke@435 345 void OopMapSet::oops_do(const frame *fr, const RegisterMap* reg_map, OopClosure* f) {
duke@435 346 // add derived oops to a table
coleenp@548 347 all_do(fr, reg_map, f, add_derived_oop, &do_nothing);
duke@435 348 }
duke@435 349
duke@435 350
duke@435 351 void OopMapSet::all_do(const frame *fr, const RegisterMap *reg_map,
duke@435 352 OopClosure* oop_fn, void derived_oop_fn(oop*, oop*),
coleenp@548 353 OopClosure* value_fn) {
duke@435 354 CodeBlob* cb = fr->cb();
coleenp@548 355 assert(cb != NULL, "no codeblob");
duke@435 356
duke@435 357 NOT_PRODUCT(if (TraceCodeBlobStacks) trace_codeblob_maps(fr, reg_map);)
duke@435 358
duke@435 359 OopMapSet* maps = cb->oop_maps();
coleenp@548 360 OopMap* map = cb->oop_map_for_return_address(fr->pc());
coleenp@548 361 assert(map != NULL, "no ptr map found");
duke@435 362
duke@435 363 // handle derived pointers first (otherwise base pointer may be
duke@435 364 // changed before derived pointer offset has been collected)
duke@435 365 OopMapValue omv;
duke@435 366 {
duke@435 367 OopMapStream oms(map,OopMapValue::derived_oop_value);
duke@435 368 if (!oms.is_done()) {
duke@435 369 #ifndef TIERED
duke@435 370 COMPILER1_PRESENT(ShouldNotReachHere();)
duke@435 371 #endif // !TIERED
duke@435 372 // Protect the operation on the derived pointers. This
duke@435 373 // protects the addition of derived pointers to the shared
duke@435 374 // derived pointer table in DerivedPointerTable::add().
duke@435 375 MutexLockerEx x(DerivedPointerTableGC_lock, Mutex::_no_safepoint_check_flag);
duke@435 376 do {
duke@435 377 omv = oms.current();
duke@435 378 oop* loc = fr->oopmapreg_to_location(omv.reg(),reg_map);
duke@435 379 if ( loc != NULL ) {
duke@435 380 oop *base_loc = fr->oopmapreg_to_location(omv.content_reg(), reg_map);
duke@435 381 oop *derived_loc = loc;
duke@435 382 derived_oop_fn(base_loc, derived_loc);
duke@435 383 }
duke@435 384 oms.next();
duke@435 385 } while (!oms.is_done());
duke@435 386 }
duke@435 387 }
duke@435 388
coleenp@548 389 // We want coop, value and oop oop_types
coleenp@548 390 int mask = OopMapValue::oop_value | OopMapValue::value_value | OopMapValue::narrowoop_value;
duke@435 391 {
duke@435 392 for (OopMapStream oms(map,mask); !oms.is_done(); oms.next()) {
duke@435 393 omv = oms.current();
duke@435 394 oop* loc = fr->oopmapreg_to_location(omv.reg(),reg_map);
duke@435 395 if ( loc != NULL ) {
duke@435 396 if ( omv.type() == OopMapValue::oop_value ) {
duke@435 397 #ifdef ASSERT
kvn@679 398 if ((((uintptr_t)loc & (sizeof(*loc)-1)) != 0) ||
coleenp@548 399 !Universe::heap()->is_in_or_null(*loc)) {
duke@435 400 tty->print_cr("# Found non oop pointer. Dumping state at failure");
duke@435 401 // try to dump out some helpful debugging information
duke@435 402 trace_codeblob_maps(fr, reg_map);
duke@435 403 omv.print();
coleenp@548 404 tty->print_cr("register r");
coleenp@548 405 omv.reg()->print();
duke@435 406 tty->print_cr("loc = %p *loc = %p\n", loc, (address)*loc);
duke@435 407 // do the real assert.
duke@435 408 assert(Universe::heap()->is_in_or_null(*loc), "found non oop pointer");
duke@435 409 }
duke@435 410 #endif // ASSERT
duke@435 411 oop_fn->do_oop(loc);
duke@435 412 } else if ( omv.type() == OopMapValue::value_value ) {
duke@435 413 value_fn->do_oop(loc);
coleenp@548 414 } else if ( omv.type() == OopMapValue::narrowoop_value ) {
coleenp@548 415 narrowOop *nl = (narrowOop*)loc;
coleenp@548 416 #ifndef VM_LITTLE_ENDIAN
coleenp@548 417 if (!omv.reg()->is_stack()) {
coleenp@548 418 // compressed oops in registers only take up 4 bytes of an
coleenp@548 419 // 8 byte register but they are in the wrong part of the
coleenp@548 420 // word so adjust loc to point at the right place.
coleenp@548 421 nl = (narrowOop*)((address)nl + 4);
coleenp@548 422 }
coleenp@548 423 #endif
coleenp@548 424 oop_fn->do_oop(nl);
duke@435 425 }
duke@435 426 }
duke@435 427 }
duke@435 428 }
duke@435 429 }
duke@435 430
duke@435 431
duke@435 432 // Update callee-saved register info for the following frame
duke@435 433 void OopMapSet::update_register_map(const frame *fr, RegisterMap *reg_map) {
duke@435 434 ResourceMark rm;
duke@435 435 CodeBlob* cb = fr->cb();
duke@435 436 assert(cb != NULL, "no codeblob");
duke@435 437
duke@435 438 // Any reg might be saved by a safepoint handler (see generate_handler_blob).
duke@435 439 const int max_saved_on_entry_reg_count = ConcreteRegisterImpl::number_of_registers;
duke@435 440 assert( reg_map->_update_for_id == NULL || fr->is_older(reg_map->_update_for_id),
duke@435 441 "already updated this map; do not 'update' it twice!" );
duke@435 442 debug_only(reg_map->_update_for_id = fr->id());
duke@435 443
duke@435 444 // Check if caller must update oop argument
duke@435 445 assert((reg_map->include_argument_oops() ||
duke@435 446 !cb->caller_must_gc_arguments(reg_map->thread())),
duke@435 447 "include_argument_oops should already be set");
duke@435 448
duke@435 449 int nof_callee = 0;
duke@435 450 oop* locs[2*max_saved_on_entry_reg_count+1];
duke@435 451 VMReg regs[2*max_saved_on_entry_reg_count+1];
duke@435 452 // ("+1" because max_saved_on_entry_reg_count might be zero)
duke@435 453
duke@435 454 // Scan through oopmap and find location of all callee-saved registers
duke@435 455 // (we do not do update in place, since info could be overwritten)
duke@435 456
duke@435 457 address pc = fr->pc();
duke@435 458
duke@435 459 OopMap* map = cb->oop_map_for_return_address(pc);
duke@435 460
duke@435 461 assert(map != NULL, " no ptr map found");
duke@435 462
duke@435 463 OopMapValue omv;
duke@435 464 for(OopMapStream oms(map,OopMapValue::callee_saved_value); !oms.is_done(); oms.next()) {
duke@435 465 omv = oms.current();
duke@435 466 assert(nof_callee < 2*max_saved_on_entry_reg_count, "overflow");
duke@435 467 regs[nof_callee] = omv.content_reg();
duke@435 468 locs[nof_callee] = fr->oopmapreg_to_location(omv.reg(),reg_map);
duke@435 469 nof_callee++;
duke@435 470 }
duke@435 471
duke@435 472 // Check that runtime stubs save all callee-saved registers
duke@435 473 #ifdef COMPILER2
duke@435 474 assert(cb->is_compiled_by_c1() || !cb->is_runtime_stub() ||
duke@435 475 (nof_callee >= SAVED_ON_ENTRY_REG_COUNT || nof_callee >= C_SAVED_ON_ENTRY_REG_COUNT),
duke@435 476 "must save all");
duke@435 477 #endif // COMPILER2
duke@435 478
duke@435 479 // Copy found callee-saved register to reg_map
duke@435 480 for(int i = 0; i < nof_callee; i++) {
duke@435 481 reg_map->set_location(regs[i], (address)locs[i]);
duke@435 482 }
duke@435 483 }
duke@435 484
duke@435 485 //=============================================================================
duke@435 486 // Non-Product code
duke@435 487
duke@435 488 #ifndef PRODUCT
duke@435 489
duke@435 490 bool OopMap::has_derived_pointer() const {
duke@435 491 #ifndef TIERED
duke@435 492 COMPILER1_PRESENT(return false);
duke@435 493 #endif // !TIERED
duke@435 494 #ifdef COMPILER2
duke@435 495 OopMapStream oms((OopMap*)this,OopMapValue::derived_oop_value);
duke@435 496 return oms.is_done();
duke@435 497 #else
duke@435 498 return false;
duke@435 499 #endif // COMPILER2
duke@435 500 }
duke@435 501
jrose@535 502 #endif //PRODUCT
duke@435 503
jrose@535 504 // Printing code is present in product build for -XX:+PrintAssembly.
jrose@535 505
jrose@535 506 static
jrose@535 507 void print_register_type(OopMapValue::oop_types x, VMReg optional,
jrose@535 508 outputStream* st) {
duke@435 509 switch( x ) {
duke@435 510 case OopMapValue::oop_value:
kvn@460 511 st->print("Oop");
duke@435 512 break;
duke@435 513 case OopMapValue::value_value:
kvn@460 514 st->print("Value" );
duke@435 515 break;
coleenp@548 516 case OopMapValue::narrowoop_value:
coleenp@548 517 tty->print("NarrowOop" );
duke@435 518 break;
duke@435 519 case OopMapValue::callee_saved_value:
kvn@460 520 st->print("Callers_" );
kvn@460 521 optional->print_on(st);
duke@435 522 break;
duke@435 523 case OopMapValue::derived_oop_value:
kvn@460 524 st->print("Derived_oop_" );
kvn@460 525 optional->print_on(st);
duke@435 526 break;
duke@435 527 default:
duke@435 528 ShouldNotReachHere();
duke@435 529 }
duke@435 530 }
duke@435 531
duke@435 532
kvn@460 533 void OopMapValue::print_on(outputStream* st) const {
kvn@460 534 reg()->print_on(st);
kvn@460 535 st->print("=");
kvn@460 536 print_register_type(type(),content_reg(),st);
kvn@460 537 st->print(" ");
duke@435 538 }
duke@435 539
duke@435 540
duke@435 541 void OopMap::print_on(outputStream* st) const {
duke@435 542 OopMapValue omv;
jrose@535 543 st->print("OopMap{");
duke@435 544 for(OopMapStream oms((OopMap*)this); !oms.is_done(); oms.next()) {
duke@435 545 omv = oms.current();
duke@435 546 omv.print_on(st);
duke@435 547 }
jrose@535 548 st->print("off=%d}", (int) offset());
duke@435 549 }
duke@435 550
duke@435 551
duke@435 552 void OopMapSet::print_on(outputStream* st) const {
duke@435 553 int i, len = om_count();
duke@435 554
duke@435 555 st->print_cr("OopMapSet contains %d OopMaps\n",len);
duke@435 556
duke@435 557 for( i = 0; i < len; i++) {
duke@435 558 OopMap* m = at(i);
jrose@535 559 st->print_cr("#%d ",i);
duke@435 560 m->print_on(st);
jrose@535 561 st->cr();
duke@435 562 }
duke@435 563 }
jrose@535 564
duke@435 565
duke@435 566
duke@435 567 //------------------------------DerivedPointerTable---------------------------
duke@435 568
duke@435 569 #ifdef COMPILER2
duke@435 570
duke@435 571 class DerivedPointerEntry : public CHeapObj {
duke@435 572 private:
duke@435 573 oop* _location; // Location of derived pointer (also pointing to the base)
duke@435 574 intptr_t _offset; // Offset from base pointer
duke@435 575 public:
duke@435 576 DerivedPointerEntry(oop* location, intptr_t offset) { _location = location; _offset = offset; }
duke@435 577 oop* location() { return _location; }
duke@435 578 intptr_t offset() { return _offset; }
duke@435 579 };
duke@435 580
duke@435 581
duke@435 582 GrowableArray<DerivedPointerEntry*>* DerivedPointerTable::_list = NULL;
duke@435 583 bool DerivedPointerTable::_active = false;
duke@435 584
duke@435 585
duke@435 586 void DerivedPointerTable::clear() {
duke@435 587 // The first time, we create the list. Otherwise it should be
duke@435 588 // empty. If not, then we have probably forgotton to call
duke@435 589 // update_pointers after last GC/Scavenge.
duke@435 590 assert (!_active, "should not be active");
duke@435 591 assert(_list == NULL || _list->length() == 0, "table not empty");
duke@435 592 if (_list == NULL) {
duke@435 593 _list = new (ResourceObj::C_HEAP) GrowableArray<DerivedPointerEntry*>(10, true); // Allocated on C heap
duke@435 594 }
duke@435 595 _active = true;
duke@435 596 }
duke@435 597
duke@435 598
duke@435 599 // Returns value of location as an int
duke@435 600 intptr_t value_of_loc(oop *pointer) { return (intptr_t)(*pointer); }
duke@435 601
duke@435 602
duke@435 603 void DerivedPointerTable::add(oop *derived_loc, oop *base_loc) {
duke@435 604 assert(Universe::heap()->is_in_or_null(*base_loc), "not an oop");
duke@435 605 assert(derived_loc != base_loc, "Base and derived in same location");
duke@435 606 if (_active) {
duke@435 607 assert(*derived_loc != (oop)base_loc, "location already added");
duke@435 608 assert(_list != NULL, "list must exist");
duke@435 609 intptr_t offset = value_of_loc(derived_loc) - value_of_loc(base_loc);
duke@435 610 assert(offset >= -1000000, "wrong derived pointer info");
duke@435 611
duke@435 612 if (TraceDerivedPointers) {
duke@435 613 tty->print_cr(
duke@435 614 "Add derived pointer@" INTPTR_FORMAT
duke@435 615 " - Derived: " INTPTR_FORMAT
duke@435 616 " Base: " INTPTR_FORMAT " (@" INTPTR_FORMAT ") (Offset: %d)",
duke@435 617 derived_loc, (address)*derived_loc, (address)*base_loc, base_loc, offset
duke@435 618 );
duke@435 619 }
duke@435 620 // Set derived oop location to point to base.
duke@435 621 *derived_loc = (oop)base_loc;
duke@435 622 assert_lock_strong(DerivedPointerTableGC_lock);
duke@435 623 DerivedPointerEntry *entry = new DerivedPointerEntry(derived_loc, offset);
duke@435 624 _list->append(entry);
duke@435 625 }
duke@435 626 }
duke@435 627
duke@435 628
duke@435 629 void DerivedPointerTable::update_pointers() {
duke@435 630 assert(_list != NULL, "list must exist");
duke@435 631 for(int i = 0; i < _list->length(); i++) {
duke@435 632 DerivedPointerEntry* entry = _list->at(i);
duke@435 633 oop* derived_loc = entry->location();
duke@435 634 intptr_t offset = entry->offset();
duke@435 635 // The derived oop was setup to point to location of base
duke@435 636 oop base = **(oop**)derived_loc;
duke@435 637 assert(Universe::heap()->is_in_or_null(base), "must be an oop");
duke@435 638
duke@435 639 *derived_loc = (oop)(((address)base) + offset);
duke@435 640 assert(value_of_loc(derived_loc) - value_of_loc(&base) == offset, "sanity check");
duke@435 641
duke@435 642 if (TraceDerivedPointers) {
duke@435 643 tty->print_cr("Updating derived pointer@" INTPTR_FORMAT
duke@435 644 " - Derived: " INTPTR_FORMAT " Base: " INTPTR_FORMAT " (Offset: %d)",
duke@435 645 derived_loc, (address)*derived_loc, (address)base, offset);
duke@435 646 }
duke@435 647
duke@435 648 // Delete entry
duke@435 649 delete entry;
duke@435 650 _list->at_put(i, NULL);
duke@435 651 }
duke@435 652 // Clear list, so it is ready for next traversal (this is an invariant)
duke@435 653 if (TraceDerivedPointers && !_list->is_empty()) {
duke@435 654 tty->print_cr("--------------------------");
duke@435 655 }
duke@435 656 _list->clear();
duke@435 657 _active = false;
duke@435 658 }
duke@435 659
duke@435 660 #endif // COMPILER2

mercurial