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