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