annotate src/share/vm/code/relocInfo.cpp @ 9449:a41fe5ffa839

8136421: JEP 243: Java-Level JVM Compiler Interface Reviewed-by: ihse, alanb, roland, coleenp, iveresov, kvn, kbarrett
author twisti
date Thu, 08 Oct 2015 12:49:30 -1000
parents f3624d042de0
children a8a8604f890f
rev   line source
duke@0 1 /*
drchase@6433 2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
trims@1472 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1472 20 * or visit www.oracle.com if you need additional information or have any
trims@1472 21 * questions.
duke@0 22 *
duke@0 23 */
duke@0 24
stefank@1879 25 #include "precompiled.hpp"
twisti@3883 26 #include "code/codeCache.hpp"
stefank@1879 27 #include "code/compiledIC.hpp"
stefank@1879 28 #include "code/nmethod.hpp"
stefank@1879 29 #include "code/relocInfo.hpp"
stefank@1879 30 #include "memory/resourceArea.hpp"
stefank@1879 31 #include "runtime/stubCodeGenerator.hpp"
stefank@1879 32 #include "utilities/copy.hpp"
twisti@9449 33 #include "oops/oop.inline.hpp"
duke@0 34
drchase@6433 35 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
duke@0 36
duke@0 37 const RelocationHolder RelocationHolder::none; // its type is relocInfo::none
duke@0 38
duke@0 39
duke@0 40 // Implementation of relocInfo
duke@0 41
duke@0 42 #ifdef ASSERT
duke@0 43 relocInfo::relocInfo(relocType t, int off, int f) {
duke@0 44 assert(t != data_prefix_tag, "cannot build a prefix this way");
duke@0 45 assert((t & type_mask) == t, "wrong type");
duke@0 46 assert((f & format_mask) == f, "wrong format");
duke@0 47 assert(off >= 0 && off < offset_limit(), "offset out off bounds");
duke@0 48 assert((off & (offset_unit-1)) == 0, "misaligned offset");
duke@0 49 (*this) = relocInfo(t, RAW_BITS, off, f);
duke@0 50 }
duke@0 51 #endif
duke@0 52
duke@0 53 void relocInfo::initialize(CodeSection* dest, Relocation* reloc) {
duke@0 54 relocInfo* data = this+1; // here's where the data might go
duke@0 55 dest->set_locs_end(data); // sync end: the next call may read dest.locs_end
duke@0 56 reloc->pack_data_to(dest); // maybe write data into locs, advancing locs_end
duke@0 57 relocInfo* data_limit = dest->locs_end();
duke@0 58 if (data_limit > data) {
duke@0 59 relocInfo suffix = (*this);
duke@0 60 data_limit = this->finish_prefix((short*) data_limit);
duke@0 61 // Finish up with the suffix. (Hack note: pack_data_to might edit this.)
duke@0 62 *data_limit = suffix;
duke@0 63 dest->set_locs_end(data_limit+1);
duke@0 64 }
duke@0 65 }
duke@0 66
duke@0 67 relocInfo* relocInfo::finish_prefix(short* prefix_limit) {
duke@0 68 assert(sizeof(relocInfo) == sizeof(short), "change this code");
duke@0 69 short* p = (short*)(this+1);
duke@0 70 assert(prefix_limit >= p, "must be a valid span of data");
duke@0 71 int plen = prefix_limit - p;
duke@0 72 if (plen == 0) {
duke@0 73 debug_only(_value = 0xFFFF);
duke@0 74 return this; // no data: remove self completely
duke@0 75 }
duke@0 76 if (plen == 1 && fits_into_immediate(p[0])) {
duke@0 77 (*this) = immediate_relocInfo(p[0]); // move data inside self
duke@0 78 return this+1;
duke@0 79 }
duke@0 80 // cannot compact, so just update the count and return the limit pointer
duke@0 81 (*this) = prefix_relocInfo(plen); // write new datalen
duke@0 82 assert(data() + datalen() == prefix_limit, "pointers must line up");
duke@0 83 return (relocInfo*)prefix_limit;
duke@0 84 }
duke@0 85
duke@0 86
duke@0 87 void relocInfo::set_type(relocType t) {
duke@0 88 int old_offset = addr_offset();
duke@0 89 int old_format = format();
duke@0 90 (*this) = relocInfo(t, old_offset, old_format);
duke@0 91 assert(type()==(int)t, "sanity check");
duke@0 92 assert(addr_offset()==old_offset, "sanity check");
duke@0 93 assert(format()==old_format, "sanity check");
duke@0 94 }
duke@0 95
duke@0 96
duke@0 97 void relocInfo::set_format(int f) {
duke@0 98 int old_offset = addr_offset();
duke@0 99 assert((f & format_mask) == f, "wrong format");
duke@0 100 _value = (_value & ~(format_mask << offset_width)) | (f << offset_width);
duke@0 101 assert(addr_offset()==old_offset, "sanity check");
duke@0 102 }
duke@0 103
duke@0 104
duke@0 105 void relocInfo::change_reloc_info_for_address(RelocIterator *itr, address pc, relocType old_type, relocType new_type) {
duke@0 106 bool found = false;
duke@0 107 while (itr->next() && !found) {
duke@0 108 if (itr->addr() == pc) {
duke@0 109 assert(itr->type()==old_type, "wrong relocInfo type found");
duke@0 110 itr->current()->set_type(new_type);
duke@0 111 found=true;
duke@0 112 }
duke@0 113 }
duke@0 114 assert(found, "no relocInfo found for pc");
duke@0 115 }
duke@0 116
duke@0 117
duke@0 118 void relocInfo::remove_reloc_info_for_address(RelocIterator *itr, address pc, relocType old_type) {
duke@0 119 change_reloc_info_for_address(itr, pc, old_type, none);
duke@0 120 }
duke@0 121
duke@0 122
duke@0 123 // ----------------------------------------------------------------------------------------------------
duke@0 124 // Implementation of RelocIterator
duke@0 125
twisti@1483 126 void RelocIterator::initialize(nmethod* nm, address begin, address limit) {
duke@0 127 initialize_misc();
duke@0 128
twisti@1483 129 if (nm == NULL && begin != NULL) {
twisti@1483 130 // allow nmethod to be deduced from beginning address
twisti@1483 131 CodeBlob* cb = CodeCache::find_blob(begin);
twisti@1483 132 nm = cb->as_nmethod_or_null();
duke@0 133 }
twisti@1483 134 assert(nm != NULL, "must be able to deduce nmethod from other arguments");
duke@0 135
twisti@1483 136 _code = nm;
twisti@1483 137 _current = nm->relocation_begin() - 1;
twisti@1483 138 _end = nm->relocation_end();
twisti@1682 139 _addr = nm->content_begin();
twisti@1682 140
twisti@1682 141 // Initialize code sections.
twisti@1682 142 _section_start[CodeBuffer::SECT_CONSTS] = nm->consts_begin();
twisti@1682 143 _section_start[CodeBuffer::SECT_INSTS ] = nm->insts_begin() ;
twisti@1682 144 _section_start[CodeBuffer::SECT_STUBS ] = nm->stub_begin() ;
twisti@1682 145
twisti@1682 146 _section_end [CodeBuffer::SECT_CONSTS] = nm->consts_end() ;
twisti@1682 147 _section_end [CodeBuffer::SECT_INSTS ] = nm->insts_end() ;
twisti@1682 148 _section_end [CodeBuffer::SECT_STUBS ] = nm->stub_end() ;
duke@0 149
duke@0 150 assert(!has_current(), "just checking");
twisti@1668 151 assert(begin == NULL || begin >= nm->code_begin(), "in bounds");
twisti@1668 152 assert(limit == NULL || limit <= nm->code_end(), "in bounds");
duke@0 153 set_limits(begin, limit);
duke@0 154 }
duke@0 155
duke@0 156
duke@0 157 RelocIterator::RelocIterator(CodeSection* cs, address begin, address limit) {
duke@0 158 initialize_misc();
duke@0 159
duke@0 160 _current = cs->locs_start()-1;
duke@0 161 _end = cs->locs_end();
duke@0 162 _addr = cs->start();
duke@0 163 _code = NULL; // Not cb->blob();
duke@0 164
duke@0 165 CodeBuffer* cb = cs->outer();
twisti@1682 166 assert((int) SECT_LIMIT == CodeBuffer::SECT_LIMIT, "my copy must be equal");
twisti@1682 167 for (int n = (int) CodeBuffer::SECT_FIRST; n < (int) CodeBuffer::SECT_LIMIT; n++) {
twisti@1682 168 CodeSection* cs = cb->code_section(n);
twisti@1682 169 _section_start[n] = cs->start();
twisti@1682 170 _section_end [n] = cs->end();
duke@0 171 }
duke@0 172
duke@0 173 assert(!has_current(), "just checking");
duke@0 174
duke@0 175 assert(begin == NULL || begin >= cs->start(), "in bounds");
duke@0 176 assert(limit == NULL || limit <= cs->end(), "in bounds");
duke@0 177 set_limits(begin, limit);
duke@0 178 }
duke@0 179
duke@0 180
duke@0 181 enum { indexCardSize = 128 };
duke@0 182 struct RelocIndexEntry {
duke@0 183 jint addr_offset; // offset from header_end of an addr()
duke@0 184 jint reloc_offset; // offset from header_end of a relocInfo (prefix)
duke@0 185 };
duke@0 186
duke@0 187
twisti@1682 188 bool RelocIterator::addr_in_const() const {
twisti@1682 189 const int n = CodeBuffer::SECT_CONSTS;
twisti@1682 190 return section_start(n) <= addr() && addr() < section_end(n);
twisti@1682 191 }
twisti@1682 192
twisti@1682 193
duke@0 194 static inline int num_cards(int code_size) {
duke@0 195 return (code_size-1) / indexCardSize;
duke@0 196 }
duke@0 197
duke@0 198
duke@0 199 int RelocIterator::locs_and_index_size(int code_size, int locs_size) {
duke@0 200 if (!UseRelocIndex) return locs_size; // no index
duke@0 201 code_size = round_to(code_size, oopSize);
duke@0 202 locs_size = round_to(locs_size, oopSize);
duke@0 203 int index_size = num_cards(code_size) * sizeof(RelocIndexEntry);
duke@0 204 // format of indexed relocs:
duke@0 205 // relocation_begin: relocInfo ...
duke@0 206 // index: (addr,reloc#) ...
duke@0 207 // indexSize :relocation_end
duke@0 208 return locs_size + index_size + BytesPerInt;
duke@0 209 }
duke@0 210
duke@0 211
duke@0 212 void RelocIterator::create_index(relocInfo* dest_begin, int dest_count, relocInfo* dest_end) {
duke@0 213 address relocation_begin = (address)dest_begin;
duke@0 214 address relocation_end = (address)dest_end;
duke@0 215 int total_size = relocation_end - relocation_begin;
duke@0 216 int locs_size = dest_count * sizeof(relocInfo);
duke@0 217 if (!UseRelocIndex) {
duke@0 218 Copy::fill_to_bytes(relocation_begin + locs_size, total_size-locs_size, 0);
duke@0 219 return;
duke@0 220 }
duke@0 221 int index_size = total_size - locs_size - BytesPerInt; // find out how much space is left
duke@0 222 int ncards = index_size / sizeof(RelocIndexEntry);
duke@0 223 assert(total_size == locs_size + index_size + BytesPerInt, "checkin'");
duke@0 224 assert(index_size >= 0 && index_size % sizeof(RelocIndexEntry) == 0, "checkin'");
duke@0 225 jint* index_size_addr = (jint*)relocation_end - 1;
duke@0 226
duke@0 227 assert(sizeof(jint) == BytesPerInt, "change this code");
duke@0 228
duke@0 229 *index_size_addr = index_size;
duke@0 230 if (index_size != 0) {
duke@0 231 assert(index_size > 0, "checkin'");
duke@0 232
duke@0 233 RelocIndexEntry* index = (RelocIndexEntry *)(relocation_begin + locs_size);
duke@0 234 assert(index == (RelocIndexEntry*)index_size_addr - ncards, "checkin'");
duke@0 235
duke@0 236 // walk over the relocations, and fill in index entries as we go
duke@0 237 RelocIterator iter;
duke@0 238 const address initial_addr = NULL;
duke@0 239 relocInfo* const initial_current = dest_begin - 1; // biased by -1 like elsewhere
duke@0 240
duke@0 241 iter._code = NULL;
duke@0 242 iter._addr = initial_addr;
duke@0 243 iter._limit = (address)(intptr_t)(ncards * indexCardSize);
duke@0 244 iter._current = initial_current;
duke@0 245 iter._end = dest_begin + dest_count;
duke@0 246
duke@0 247 int i = 0;
duke@0 248 address next_card_addr = (address)indexCardSize;
duke@0 249 int addr_offset = 0;
duke@0 250 int reloc_offset = 0;
duke@0 251 while (true) {
duke@0 252 // Checkpoint the iterator before advancing it.
duke@0 253 addr_offset = iter._addr - initial_addr;
duke@0 254 reloc_offset = iter._current - initial_current;
duke@0 255 if (!iter.next()) break;
duke@0 256 while (iter.addr() >= next_card_addr) {
duke@0 257 index[i].addr_offset = addr_offset;
duke@0 258 index[i].reloc_offset = reloc_offset;
duke@0 259 i++;
duke@0 260 next_card_addr += indexCardSize;
duke@0 261 }
duke@0 262 }
duke@0 263 while (i < ncards) {
duke@0 264 index[i].addr_offset = addr_offset;
duke@0 265 index[i].reloc_offset = reloc_offset;
duke@0 266 i++;
duke@0 267 }
duke@0 268 }
duke@0 269 }
duke@0 270
duke@0 271
duke@0 272 void RelocIterator::set_limits(address begin, address limit) {
duke@0 273 int index_size = 0;
duke@0 274 if (UseRelocIndex && _code != NULL) {
duke@0 275 index_size = ((jint*)_end)[-1];
duke@0 276 _end = (relocInfo*)( (address)_end - index_size - BytesPerInt );
duke@0 277 }
duke@0 278
duke@0 279 _limit = limit;
duke@0 280
duke@0 281 // the limit affects this next stuff:
duke@0 282 if (begin != NULL) {
duke@0 283 #ifdef ASSERT
duke@0 284 // In ASSERT mode we do not actually use the index, but simply
duke@0 285 // check that its contents would have led us to the right answer.
duke@0 286 address addrCheck = _addr;
duke@0 287 relocInfo* infoCheck = _current;
duke@0 288 #endif // ASSERT
duke@0 289 if (index_size > 0) {
duke@0 290 // skip ahead
duke@0 291 RelocIndexEntry* index = (RelocIndexEntry*)_end;
duke@0 292 RelocIndexEntry* index_limit = (RelocIndexEntry*)((address)index + index_size);
twisti@1668 293 assert(_addr == _code->code_begin(), "_addr must be unadjusted");
duke@0 294 int card = (begin - _addr) / indexCardSize;
duke@0 295 if (card > 0) {
duke@0 296 if (index+card-1 < index_limit) index += card-1;
duke@0 297 else index = index_limit - 1;
duke@0 298 #ifdef ASSERT
duke@0 299 addrCheck = _addr + index->addr_offset;
duke@0 300 infoCheck = _current + index->reloc_offset;
duke@0 301 #else
duke@0 302 // Advance the iterator immediately to the last valid state
duke@0 303 // for the previous card. Calling "next" will then advance
duke@0 304 // it to the first item on the required card.
duke@0 305 _addr += index->addr_offset;
duke@0 306 _current += index->reloc_offset;
duke@0 307 #endif // ASSERT
duke@0 308 }
duke@0 309 }
duke@0 310
duke@0 311 relocInfo* backup;
duke@0 312 address backup_addr;
duke@0 313 while (true) {
duke@0 314 backup = _current;
duke@0 315 backup_addr = _addr;
duke@0 316 #ifdef ASSERT
duke@0 317 if (backup == infoCheck) {
duke@0 318 assert(backup_addr == addrCheck, "must match"); addrCheck = NULL; infoCheck = NULL;
duke@0 319 } else {
duke@0 320 assert(addrCheck == NULL || backup_addr <= addrCheck, "must not pass addrCheck");
duke@0 321 }
duke@0 322 #endif // ASSERT
duke@0 323 if (!next() || addr() >= begin) break;
duke@0 324 }
duke@0 325 assert(addrCheck == NULL || addrCheck == backup_addr, "must have matched addrCheck");
duke@0 326 assert(infoCheck == NULL || infoCheck == backup, "must have matched infoCheck");
duke@0 327 // At this point, either we are at the first matching record,
duke@0 328 // or else there is no such record, and !has_current().
duke@0 329 // In either case, revert to the immediatly preceding state.
duke@0 330 _current = backup;
duke@0 331 _addr = backup_addr;
duke@0 332 set_has_current(false);
duke@0 333 }
duke@0 334 }
duke@0 335
duke@0 336
duke@0 337 void RelocIterator::set_limit(address limit) {
duke@0 338 address code_end = (address)code() + code()->size();
duke@0 339 assert(limit == NULL || limit <= code_end, "in bounds");
duke@0 340 _limit = limit;
duke@0 341 }
duke@0 342
duke@0 343 // All the strange bit-encodings are in here.
duke@0 344 // The idea is to encode relocation data which are small integers
duke@0 345 // very efficiently (a single extra halfword). Larger chunks of
duke@0 346 // relocation data need a halfword header to hold their size.
duke@0 347 void RelocIterator::advance_over_prefix() {
duke@0 348 if (_current->is_datalen()) {
duke@0 349 _data = (short*) _current->data();
duke@0 350 _datalen = _current->datalen();
duke@0 351 _current += _datalen + 1; // skip the embedded data & header
duke@0 352 } else {
duke@0 353 _databuf = _current->immediate();
duke@0 354 _data = &_databuf;
duke@0 355 _datalen = 1;
duke@0 356 _current++; // skip the header
duke@0 357 }
duke@0 358 // The client will see the following relocInfo, whatever that is.
duke@0 359 // It is the reloc to which the preceding data applies.
duke@0 360 }
duke@0 361
duke@0 362
twisti@1682 363 void RelocIterator::initialize_misc() {
twisti@1682 364 set_has_current(false);
twisti@1682 365 for (int i = (int) CodeBuffer::SECT_FIRST; i < (int) CodeBuffer::SECT_LIMIT; i++) {
twisti@1682 366 _section_start[i] = NULL; // these will be lazily computed, if needed
twisti@1682 367 _section_end [i] = NULL;
duke@0 368 }
duke@0 369 }
duke@0 370
duke@0 371
duke@0 372 Relocation* RelocIterator::reloc() {
duke@0 373 // (take the "switch" out-of-line)
duke@0 374 relocInfo::relocType t = type();
duke@0 375 if (false) {}
duke@0 376 #define EACH_TYPE(name) \
duke@0 377 else if (t == relocInfo::name##_type) { \
duke@0 378 return name##_reloc(); \
duke@0 379 }
duke@0 380 APPLY_TO_RELOCATIONS(EACH_TYPE);
duke@0 381 #undef EACH_TYPE
duke@0 382 assert(t == relocInfo::none, "must be padding");
duke@0 383 return new(_rh) Relocation();
duke@0 384 }
duke@0 385
duke@0 386
duke@0 387 //////// Methods for flyweight Relocation types
duke@0 388
duke@0 389
duke@0 390 RelocationHolder RelocationHolder::plus(int offset) const {
duke@0 391 if (offset != 0) {
duke@0 392 switch (type()) {
duke@0 393 case relocInfo::none:
duke@0 394 break;
duke@0 395 case relocInfo::oop_type:
duke@0 396 {
duke@0 397 oop_Relocation* r = (oop_Relocation*)reloc();
duke@0 398 return oop_Relocation::spec(r->oop_index(), r->offset() + offset);
duke@0 399 }
coleenp@3602 400 case relocInfo::metadata_type:
coleenp@3602 401 {
coleenp@3602 402 metadata_Relocation* r = (metadata_Relocation*)reloc();
coleenp@3602 403 return metadata_Relocation::spec(r->metadata_index(), r->offset() + offset);
coleenp@3602 404 }
duke@0 405 default:
duke@0 406 ShouldNotReachHere();
duke@0 407 }
duke@0 408 }
duke@0 409 return (*this);
duke@0 410 }
duke@0 411
duke@0 412
duke@0 413 void Relocation::guarantee_size() {
duke@0 414 guarantee(false, "Make _relocbuf bigger!");
duke@0 415 }
duke@0 416
duke@0 417 // some relocations can compute their own values
duke@0 418 address Relocation::value() {
duke@0 419 ShouldNotReachHere();
duke@0 420 return NULL;
duke@0 421 }
duke@0 422
duke@0 423
duke@0 424 void Relocation::set_value(address x) {
duke@0 425 ShouldNotReachHere();
duke@0 426 }
duke@0 427
twisti@9449 428 void Relocation::const_set_data_value(address x) {
twisti@9449 429 #ifdef _LP64
twisti@9449 430 if (format() == relocInfo::narrow_oop_in_const) {
twisti@9449 431 *(narrowOop*)addr() = oopDesc::encode_heap_oop((oop) x);
twisti@9449 432 } else {
twisti@9449 433 #endif
twisti@9449 434 *(address*)addr() = x;
twisti@9449 435 #ifdef _LP64
twisti@9449 436 }
twisti@9449 437 #endif
twisti@9449 438 }
twisti@9449 439
twisti@9449 440 void Relocation::const_verify_data_value(address x) {
twisti@9449 441 #ifdef _LP64
twisti@9449 442 if (format() == relocInfo::narrow_oop_in_const) {
twisti@9449 443 assert(*(narrowOop*)addr() == oopDesc::encode_heap_oop((oop) x), "must agree");
twisti@9449 444 } else {
twisti@9449 445 #endif
twisti@9449 446 assert(*(address*)addr() == x, "must agree");
twisti@9449 447 #ifdef _LP64
twisti@9449 448 }
twisti@9449 449 #endif
twisti@9449 450 }
twisti@9449 451
duke@0 452
duke@0 453 RelocationHolder Relocation::spec_simple(relocInfo::relocType rtype) {
duke@0 454 if (rtype == relocInfo::none) return RelocationHolder::none;
duke@0 455 relocInfo ri = relocInfo(rtype, 0);
duke@0 456 RelocIterator itr;
duke@0 457 itr.set_current(ri);
duke@0 458 itr.reloc();
duke@0 459 return itr._rh;
duke@0 460 }
duke@0 461
duke@0 462 int32_t Relocation::runtime_address_to_index(address runtime_address) {
never@2302 463 assert(!is_reloc_index((intptr_t)runtime_address), "must not look like an index");
duke@0 464
duke@0 465 if (runtime_address == NULL) return 0;
duke@0 466
duke@0 467 StubCodeDesc* p = StubCodeDesc::desc_for(runtime_address);
duke@0 468 if (p != NULL && p->begin() == runtime_address) {
never@2302 469 assert(is_reloc_index(p->index()), "there must not be too many stubs");
duke@0 470 return (int32_t)p->index();
duke@0 471 } else {
duke@0 472 // Known "miscellaneous" non-stub pointers:
duke@0 473 // os::get_polling_page(), SafepointSynchronize::address_of_state()
duke@0 474 if (PrintRelocations) {
duke@0 475 tty->print_cr("random unregistered address in relocInfo: " INTPTR_FORMAT, runtime_address);
duke@0 476 }
duke@0 477 #ifndef _LP64
duke@0 478 return (int32_t) (intptr_t)runtime_address;
duke@0 479 #else
duke@0 480 // didn't fit return non-index
duke@0 481 return -1;
duke@0 482 #endif /* _LP64 */
duke@0 483 }
duke@0 484 }
duke@0 485
duke@0 486
duke@0 487 address Relocation::index_to_runtime_address(int32_t index) {
duke@0 488 if (index == 0) return NULL;
duke@0 489
never@2302 490 if (is_reloc_index(index)) {
duke@0 491 StubCodeDesc* p = StubCodeDesc::desc_for_index(index);
duke@0 492 assert(p != NULL, "there must be a stub for this index");
duke@0 493 return p->begin();
duke@0 494 } else {
duke@0 495 #ifndef _LP64
duke@0 496 // this only works on 32bit machines
duke@0 497 return (address) ((intptr_t) index);
duke@0 498 #else
duke@0 499 fatal("Relocation::index_to_runtime_address, int32_t not pointer sized");
duke@0 500 return NULL;
duke@0 501 #endif /* _LP64 */
duke@0 502 }
duke@0 503 }
duke@0 504
duke@0 505 address Relocation::old_addr_for(address newa,
duke@0 506 const CodeBuffer* src, CodeBuffer* dest) {
duke@0 507 int sect = dest->section_index_of(newa);
duke@0 508 guarantee(sect != CodeBuffer::SECT_NONE, "lost track of this address");
duke@0 509 address ostart = src->code_section(sect)->start();
duke@0 510 address nstart = dest->code_section(sect)->start();
duke@0 511 return ostart + (newa - nstart);
duke@0 512 }
duke@0 513
duke@0 514 address Relocation::new_addr_for(address olda,
duke@0 515 const CodeBuffer* src, CodeBuffer* dest) {
duke@0 516 debug_only(const CodeBuffer* src0 = src);
duke@0 517 int sect = CodeBuffer::SECT_NONE;
duke@0 518 // Look for olda in the source buffer, and all previous incarnations
duke@0 519 // if the source buffer has been expanded.
duke@0 520 for (; src != NULL; src = src->before_expand()) {
duke@0 521 sect = src->section_index_of(olda);
duke@0 522 if (sect != CodeBuffer::SECT_NONE) break;
duke@0 523 }
duke@0 524 guarantee(sect != CodeBuffer::SECT_NONE, "lost track of this address");
duke@0 525 address ostart = src->code_section(sect)->start();
duke@0 526 address nstart = dest->code_section(sect)->start();
duke@0 527 return nstart + (olda - ostart);
duke@0 528 }
duke@0 529
duke@0 530 void Relocation::normalize_address(address& addr, const CodeSection* dest, bool allow_other_sections) {
duke@0 531 address addr0 = addr;
duke@0 532 if (addr0 == NULL || dest->allocates2(addr0)) return;
duke@0 533 CodeBuffer* cb = dest->outer();
duke@0 534 addr = new_addr_for(addr0, cb, cb);
duke@0 535 assert(allow_other_sections || dest->contains2(addr),
duke@0 536 "addr must be in required section");
duke@0 537 }
duke@0 538
duke@0 539
duke@0 540 void CallRelocation::set_destination(address x) {
duke@0 541 pd_set_call_destination(x);
duke@0 542 }
duke@0 543
duke@0 544 void CallRelocation::fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest) {
duke@0 545 // Usually a self-relative reference to an external routine.
duke@0 546 // On some platforms, the reference is absolute (not self-relative).
duke@0 547 // The enhanced use of pd_call_destination sorts this all out.
duke@0 548 address orig_addr = old_addr_for(addr(), src, dest);
duke@0 549 address callee = pd_call_destination(orig_addr);
duke@0 550 // Reassert the callee address, this time in the new copy of the code.
duke@0 551 pd_set_call_destination(callee);
duke@0 552 }
duke@0 553
duke@0 554
duke@0 555 //// pack/unpack methods
duke@0 556
duke@0 557 void oop_Relocation::pack_data_to(CodeSection* dest) {
duke@0 558 short* p = (short*) dest->locs_end();
duke@0 559 p = pack_2_ints_to(p, _oop_index, _offset);
duke@0 560 dest->set_locs_end((relocInfo*) p);
duke@0 561 }
duke@0 562
duke@0 563
duke@0 564 void oop_Relocation::unpack_data() {
duke@0 565 unpack_2_ints(_oop_index, _offset);
duke@0 566 }
duke@0 567
coleenp@3602 568 void metadata_Relocation::pack_data_to(CodeSection* dest) {
coleenp@3602 569 short* p = (short*) dest->locs_end();
coleenp@3602 570 p = pack_2_ints_to(p, _metadata_index, _offset);
coleenp@3602 571 dest->set_locs_end((relocInfo*) p);
coleenp@3602 572 }
coleenp@3602 573
coleenp@3602 574
coleenp@3602 575 void metadata_Relocation::unpack_data() {
coleenp@3602 576 unpack_2_ints(_metadata_index, _offset);
coleenp@3602 577 }
coleenp@3602 578
duke@0 579
duke@0 580 void virtual_call_Relocation::pack_data_to(CodeSection* dest) {
duke@0 581 short* p = (short*) dest->locs_end();
duke@0 582 address point = dest->locs_point();
duke@0 583
coleenp@3602 584 normalize_address(_cached_value, dest);
coleenp@3602 585 jint x0 = scaled_offset_null_special(_cached_value, point);
coleenp@3602 586 p = pack_1_int_to(p, x0);
duke@0 587 dest->set_locs_end((relocInfo*) p);
duke@0 588 }
duke@0 589
duke@0 590
duke@0 591 void virtual_call_Relocation::unpack_data() {
coleenp@3602 592 jint x0 = unpack_1_int();
duke@0 593 address point = addr();
coleenp@3602 594 _cached_value = x0==0? NULL: address_from_scaled_offset(x0, point);
duke@0 595 }
duke@0 596
duke@0 597
duke@0 598 void static_stub_Relocation::pack_data_to(CodeSection* dest) {
duke@0 599 short* p = (short*) dest->locs_end();
duke@0 600 CodeSection* insts = dest->outer()->insts();
duke@0 601 normalize_address(_static_call, insts);
duke@0 602 p = pack_1_int_to(p, scaled_offset(_static_call, insts->start()));
duke@0 603 dest->set_locs_end((relocInfo*) p);
duke@0 604 }
duke@0 605
duke@0 606 void static_stub_Relocation::unpack_data() {
duke@0 607 address base = binding()->section_start(CodeBuffer::SECT_INSTS);
twisti@9449 608 jint offset = unpack_1_int();
twisti@9449 609 _static_call = address_from_scaled_offset(offset, base);
duke@0 610 }
duke@0 611
goetz@5965 612 void trampoline_stub_Relocation::pack_data_to(CodeSection* dest ) {
goetz@5965 613 short* p = (short*) dest->locs_end();
goetz@5965 614 CodeSection* insts = dest->outer()->insts();
goetz@5965 615 normalize_address(_owner, insts);
goetz@5965 616 p = pack_1_int_to(p, scaled_offset(_owner, insts->start()));
goetz@5965 617 dest->set_locs_end((relocInfo*) p);
goetz@5965 618 }
goetz@5965 619
goetz@5965 620 void trampoline_stub_Relocation::unpack_data() {
goetz@5965 621 address base = binding()->section_start(CodeBuffer::SECT_INSTS);
goetz@5965 622 _owner = address_from_scaled_offset(unpack_1_int(), base);
goetz@5965 623 }
duke@0 624
duke@0 625 void external_word_Relocation::pack_data_to(CodeSection* dest) {
duke@0 626 short* p = (short*) dest->locs_end();
duke@0 627 int32_t index = runtime_address_to_index(_target);
duke@0 628 #ifndef _LP64
duke@0 629 p = pack_1_int_to(p, index);
duke@0 630 #else
never@2302 631 if (is_reloc_index(index)) {
duke@0 632 p = pack_2_ints_to(p, index, 0);
duke@0 633 } else {
duke@0 634 jlong t = (jlong) _target;
duke@0 635 int32_t lo = low(t);
duke@0 636 int32_t hi = high(t);
duke@0 637 p = pack_2_ints_to(p, lo, hi);
duke@0 638 DEBUG_ONLY(jlong t1 = jlong_from(hi, lo));
never@2302 639 assert(!is_reloc_index(t1) && (address) t1 == _target, "not symmetric");
duke@0 640 }
duke@0 641 #endif /* _LP64 */
duke@0 642 dest->set_locs_end((relocInfo*) p);
duke@0 643 }
duke@0 644
duke@0 645
duke@0 646 void external_word_Relocation::unpack_data() {
duke@0 647 #ifndef _LP64
duke@0 648 _target = index_to_runtime_address(unpack_1_int());
duke@0 649 #else
duke@0 650 int32_t lo, hi;
duke@0 651 unpack_2_ints(lo, hi);
duke@0 652 jlong t = jlong_from(hi, lo);;
never@2302 653 if (is_reloc_index(t)) {
duke@0 654 _target = index_to_runtime_address(t);
duke@0 655 } else {
duke@0 656 _target = (address) t;
duke@0 657 }
duke@0 658 #endif /* _LP64 */
duke@0 659 }
duke@0 660
duke@0 661
duke@0 662 void internal_word_Relocation::pack_data_to(CodeSection* dest) {
duke@0 663 short* p = (short*) dest->locs_end();
duke@0 664 normalize_address(_target, dest, true);
duke@0 665
duke@0 666 // Check whether my target address is valid within this section.
duke@0 667 // If not, strengthen the relocation type to point to another section.
duke@0 668 int sindex = _section;
duke@0 669 if (sindex == CodeBuffer::SECT_NONE && _target != NULL
duke@0 670 && (!dest->allocates(_target) || _target == dest->locs_point())) {
duke@0 671 sindex = dest->outer()->section_index_of(_target);
duke@0 672 guarantee(sindex != CodeBuffer::SECT_NONE, "must belong somewhere");
duke@0 673 relocInfo* base = dest->locs_end() - 1;
duke@0 674 assert(base->type() == this->type(), "sanity");
duke@0 675 // Change the written type, to be section_word_type instead.
duke@0 676 base->set_type(relocInfo::section_word_type);
duke@0 677 }
duke@0 678
duke@0 679 // Note: An internal_word relocation cannot refer to its own instruction,
duke@0 680 // because we reserve "0" to mean that the pointer itself is embedded
duke@0 681 // in the code stream. We use a section_word relocation for such cases.
duke@0 682
duke@0 683 if (sindex == CodeBuffer::SECT_NONE) {
duke@0 684 assert(type() == relocInfo::internal_word_type, "must be base class");
duke@0 685 guarantee(_target == NULL || dest->allocates2(_target), "must be within the given code section");
duke@0 686 jint x0 = scaled_offset_null_special(_target, dest->locs_point());
duke@0 687 assert(!(x0 == 0 && _target != NULL), "correct encoding of null target");
duke@0 688 p = pack_1_int_to(p, x0);
duke@0 689 } else {
duke@0 690 assert(_target != NULL, "sanity");
duke@0 691 CodeSection* sect = dest->outer()->code_section(sindex);
duke@0 692 guarantee(sect->allocates2(_target), "must be in correct section");
duke@0 693 address base = sect->start();
duke@0 694 jint offset = scaled_offset(_target, base);
duke@0 695 assert((uint)sindex < (uint)CodeBuffer::SECT_LIMIT, "sanity");
duke@0 696 assert(CodeBuffer::SECT_LIMIT <= (1 << section_width), "section_width++");
duke@0 697 p = pack_1_int_to(p, (offset << section_width) | sindex);
duke@0 698 }
duke@0 699
duke@0 700 dest->set_locs_end((relocInfo*) p);
duke@0 701 }
duke@0 702
duke@0 703
duke@0 704 void internal_word_Relocation::unpack_data() {
duke@0 705 jint x0 = unpack_1_int();
duke@0 706 _target = x0==0? NULL: address_from_scaled_offset(x0, addr());
duke@0 707 _section = CodeBuffer::SECT_NONE;
duke@0 708 }
duke@0 709
duke@0 710
duke@0 711 void section_word_Relocation::unpack_data() {
duke@0 712 jint x = unpack_1_int();
duke@0 713 jint offset = (x >> section_width);
duke@0 714 int sindex = (x & ((1<<section_width)-1));
duke@0 715 address base = binding()->section_start(sindex);
duke@0 716
duke@0 717 _section = sindex;
duke@0 718 _target = address_from_scaled_offset(offset, base);
duke@0 719 }
duke@0 720
duke@0 721 //// miscellaneous methods
duke@0 722 oop* oop_Relocation::oop_addr() {
duke@0 723 int n = _oop_index;
duke@0 724 if (n == 0) {
duke@0 725 // oop is stored in the code stream
duke@0 726 return (oop*) pd_address_in_code();
duke@0 727 } else {
twisti@1483 728 // oop is stored in table at nmethod::oops_begin
duke@0 729 return code()->oop_addr_at(n);
duke@0 730 }
duke@0 731 }
duke@0 732
duke@0 733
duke@0 734 oop oop_Relocation::oop_value() {
duke@0 735 oop v = *oop_addr();
duke@0 736 // clean inline caches store a special pseudo-null
duke@0 737 if (v == (oop)Universe::non_oop_word()) v = NULL;
duke@0 738 return v;
duke@0 739 }
duke@0 740
duke@0 741
duke@0 742 void oop_Relocation::fix_oop_relocation() {
duke@0 743 if (!oop_is_immediate()) {
duke@0 744 // get the oop from the pool, and re-insert it into the instruction:
duke@0 745 set_value(value());
duke@0 746 }
duke@0 747 }
duke@0 748
duke@0 749
never@2222 750 void oop_Relocation::verify_oop_relocation() {
never@2222 751 if (!oop_is_immediate()) {
never@2222 752 // get the oop from the pool, and re-insert it into the instruction:
never@2222 753 verify_value(value());
never@2222 754 }
never@2222 755 }
never@2222 756
coleenp@3602 757 // meta data versions
coleenp@3602 758 Metadata** metadata_Relocation::metadata_addr() {
coleenp@3602 759 int n = _metadata_index;
coleenp@3602 760 if (n == 0) {
coleenp@3602 761 // metadata is stored in the code stream
coleenp@3602 762 return (Metadata**) pd_address_in_code();
duke@0 763 } else {
coleenp@3602 764 // metadata is stored in table at nmethod::metadatas_begin
coleenp@3602 765 return code()->metadata_addr_at(n);
duke@0 766 }
duke@0 767 }
duke@0 768
duke@0 769
coleenp@3602 770 Metadata* metadata_Relocation::metadata_value() {
coleenp@3602 771 Metadata* v = *metadata_addr();
coleenp@3602 772 // clean inline caches store a special pseudo-null
coleenp@3602 773 if (v == (Metadata*)Universe::non_oop_word()) v = NULL;
coleenp@3602 774 return v;
duke@0 775 }
duke@0 776
coleenp@3602 777
coleenp@3602 778 void metadata_Relocation::fix_metadata_relocation() {
coleenp@3602 779 if (!metadata_is_immediate()) {
coleenp@3602 780 // get the metadata from the pool, and re-insert it into the instruction:
coleenp@3602 781 pd_fix_value(value());
coleenp@3602 782 }
duke@0 783 }
duke@0 784
duke@0 785
coleenp@3602 786 void metadata_Relocation::verify_metadata_relocation() {
coleenp@3602 787 if (!metadata_is_immediate()) {
coleenp@3602 788 // get the metadata from the pool, and re-insert it into the instruction:
coleenp@3602 789 verify_value(value());
coleenp@3602 790 }
duke@0 791 }
duke@0 792
coleenp@3602 793 address virtual_call_Relocation::cached_value() {
coleenp@3602 794 assert(_cached_value != NULL && _cached_value < addr(), "must precede ic_call");
coleenp@3602 795 return _cached_value;
duke@0 796 }
duke@0 797
duke@0 798
duke@0 799 void virtual_call_Relocation::clear_inline_cache() {
duke@0 800 // No stubs for ICs
duke@0 801 // Clean IC
duke@0 802 ResourceMark rm;
duke@0 803 CompiledIC* icache = CompiledIC_at(this);
duke@0 804 icache->set_to_clean();
duke@0 805 }
duke@0 806
duke@0 807
duke@0 808 void opt_virtual_call_Relocation::clear_inline_cache() {
duke@0 809 // No stubs for ICs
duke@0 810 // Clean IC
duke@0 811 ResourceMark rm;
duke@0 812 CompiledIC* icache = CompiledIC_at(this);
duke@0 813 icache->set_to_clean();
duke@0 814 }
duke@0 815
duke@0 816
duke@0 817 address opt_virtual_call_Relocation::static_stub() {
duke@0 818 // search for the static stub who points back to this static call
duke@0 819 address static_call_addr = addr();
duke@0 820 RelocIterator iter(code());
duke@0 821 while (iter.next()) {
duke@0 822 if (iter.type() == relocInfo::static_stub_type) {
twisti@9449 823 static_stub_Relocation* stub_reloc = iter.static_stub_reloc();
twisti@9449 824 if (stub_reloc->static_call() == static_call_addr) {
duke@0 825 return iter.addr();
duke@0 826 }
duke@0 827 }
duke@0 828 }
duke@0 829 return NULL;
duke@0 830 }
duke@0 831
duke@0 832
duke@0 833 void static_call_Relocation::clear_inline_cache() {
duke@0 834 // Safe call site info
duke@0 835 CompiledStaticCall* handler = compiledStaticCall_at(this);
duke@0 836 handler->set_to_clean();
duke@0 837 }
duke@0 838
duke@0 839
duke@0 840 address static_call_Relocation::static_stub() {
duke@0 841 // search for the static stub who points back to this static call
duke@0 842 address static_call_addr = addr();
duke@0 843 RelocIterator iter(code());
duke@0 844 while (iter.next()) {
duke@0 845 if (iter.type() == relocInfo::static_stub_type) {
twisti@9449 846 static_stub_Relocation* stub_reloc = iter.static_stub_reloc();
twisti@9449 847 if (stub_reloc->static_call() == static_call_addr) {
duke@0 848 return iter.addr();
duke@0 849 }
duke@0 850 }
duke@0 851 }
duke@0 852 return NULL;
duke@0 853 }
duke@0 854
goetz@5965 855 // Finds the trampoline address for a call. If no trampoline stub is
goetz@5965 856 // found NULL is returned which can be handled by the caller.
goetz@5965 857 address trampoline_stub_Relocation::get_trampoline_for(address call, nmethod* code) {
goetz@5965 858 // There are no relocations available when the code gets relocated
goetz@5965 859 // because of CodeBuffer expansion.
goetz@5965 860 if (code->relocation_size() == 0)
goetz@5965 861 return NULL;
goetz@5965 862
goetz@5965 863 RelocIterator iter(code, call);
goetz@5965 864 while (iter.next()) {
goetz@5965 865 if (iter.type() == relocInfo::trampoline_stub_type) {
goetz@5965 866 if (iter.trampoline_stub_reloc()->owner() == call) {
goetz@5965 867 return iter.addr();
goetz@5965 868 }
goetz@5965 869 }
goetz@5965 870 }
goetz@5965 871
goetz@5965 872 return NULL;
goetz@5965 873 }
duke@0 874
duke@0 875 void static_stub_Relocation::clear_inline_cache() {
duke@0 876 // Call stub is only used when calling the interpreted code.
duke@0 877 // It does not really need to be cleared, except that we want to clean out the methodoop.
duke@0 878 CompiledStaticCall::set_stub_to_clean(this);
duke@0 879 }
duke@0 880
duke@0 881
duke@0 882 void external_word_Relocation::fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest) {
duke@0 883 address target = _target;
duke@0 884 if (target == NULL) {
duke@0 885 // An absolute embedded reference to an external location,
duke@0 886 // which means there is nothing to fix here.
duke@0 887 return;
duke@0 888 }
duke@0 889 // Probably this reference is absolute, not relative, so the
duke@0 890 // following is probably a no-op.
duke@0 891 assert(src->section_index_of(target) == CodeBuffer::SECT_NONE, "sanity");
duke@0 892 set_value(target);
duke@0 893 }
duke@0 894
duke@0 895
duke@0 896 address external_word_Relocation::target() {
duke@0 897 address target = _target;
duke@0 898 if (target == NULL) {
duke@0 899 target = pd_get_address_from_code();
duke@0 900 }
duke@0 901 return target;
duke@0 902 }
duke@0 903
duke@0 904
duke@0 905 void internal_word_Relocation::fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest) {
duke@0 906 address target = _target;
duke@0 907 if (target == NULL) {
thartmann@6604 908 target = new_addr_for(this->target(), src, dest);
duke@0 909 }
duke@0 910 set_value(target);
duke@0 911 }
duke@0 912
duke@0 913
duke@0 914 address internal_word_Relocation::target() {
duke@0 915 address target = _target;
duke@0 916 if (target == NULL) {
thartmann@6604 917 if (addr_in_const()) {
thartmann@6604 918 target = *(address*)addr();
thartmann@6604 919 } else {
thartmann@6604 920 target = pd_get_address_from_code();
thartmann@6604 921 }
duke@0 922 }
duke@0 923 return target;
duke@0 924 }
duke@0 925
duke@0 926 //---------------------------------------------------------------------------------
duke@0 927 // Non-product code
duke@0 928
duke@0 929 #ifndef PRODUCT
duke@0 930
duke@0 931 static const char* reloc_type_string(relocInfo::relocType t) {
duke@0 932 switch (t) {
duke@0 933 #define EACH_CASE(name) \
duke@0 934 case relocInfo::name##_type: \
duke@0 935 return #name;
duke@0 936
duke@0 937 APPLY_TO_RELOCATIONS(EACH_CASE);
duke@0 938 #undef EACH_CASE
duke@0 939
duke@0 940 case relocInfo::none:
duke@0 941 return "none";
duke@0 942 case relocInfo::data_prefix_tag:
duke@0 943 return "prefix";
duke@0 944 default:
duke@0 945 return "UNKNOWN RELOC TYPE";
duke@0 946 }
duke@0 947 }
duke@0 948
duke@0 949
duke@0 950 void RelocIterator::print_current() {
duke@0 951 if (!has_current()) {
duke@0 952 tty->print_cr("(no relocs)");
duke@0 953 return;
duke@0 954 }
iveresov@1909 955 tty->print("relocInfo@" INTPTR_FORMAT " [type=%d(%s) addr=" INTPTR_FORMAT " offset=%d",
iveresov@1909 956 _current, type(), reloc_type_string((relocInfo::relocType) type()), _addr, _current->addr_offset());
duke@0 957 if (current()->format() != 0)
duke@0 958 tty->print(" format=%d", current()->format());
duke@0 959 if (datalen() == 1) {
duke@0 960 tty->print(" data=%d", data()[0]);
duke@0 961 } else if (datalen() > 0) {
duke@0 962 tty->print(" data={");
duke@0 963 for (int i = 0; i < datalen(); i++) {
duke@0 964 tty->print("%04x", data()[i] & 0xFFFF);
duke@0 965 }
duke@0 966 tty->print("}");
duke@0 967 }
duke@0 968 tty->print("]");
duke@0 969 switch (type()) {
duke@0 970 case relocInfo::oop_type:
duke@0 971 {
duke@0 972 oop_Relocation* r = oop_reloc();
duke@0 973 oop* oop_addr = NULL;
duke@0 974 oop raw_oop = NULL;
duke@0 975 oop oop_value = NULL;
duke@0 976 if (code() != NULL || r->oop_is_immediate()) {
duke@0 977 oop_addr = r->oop_addr();
duke@0 978 raw_oop = *oop_addr;
duke@0 979 oop_value = r->oop_value();
duke@0 980 }
duke@0 981 tty->print(" | [oop_addr=" INTPTR_FORMAT " *=" INTPTR_FORMAT " offset=%d]",
duke@0 982 oop_addr, (address)raw_oop, r->offset());
duke@0 983 // Do not print the oop by default--we want this routine to
duke@0 984 // work even during GC or other inconvenient times.
duke@0 985 if (WizardMode && oop_value != NULL) {
duke@0 986 tty->print("oop_value=" INTPTR_FORMAT ": ", (address)oop_value);
duke@0 987 oop_value->print_value_on(tty);
duke@0 988 }
duke@0 989 break;
duke@0 990 }
coleenp@3602 991 case relocInfo::metadata_type:
coleenp@3602 992 {
coleenp@3602 993 metadata_Relocation* r = metadata_reloc();
coleenp@3602 994 Metadata** metadata_addr = NULL;
coleenp@3602 995 Metadata* raw_metadata = NULL;
coleenp@3602 996 Metadata* metadata_value = NULL;
coleenp@3602 997 if (code() != NULL || r->metadata_is_immediate()) {
coleenp@3602 998 metadata_addr = r->metadata_addr();
coleenp@3602 999 raw_metadata = *metadata_addr;
coleenp@3602 1000 metadata_value = r->metadata_value();
coleenp@3602 1001 }
coleenp@3602 1002 tty->print(" | [metadata_addr=" INTPTR_FORMAT " *=" INTPTR_FORMAT " offset=%d]",
coleenp@3602 1003 metadata_addr, (address)raw_metadata, r->offset());
coleenp@3602 1004 if (metadata_value != NULL) {
coleenp@3602 1005 tty->print("metadata_value=" INTPTR_FORMAT ": ", (address)metadata_value);
coleenp@3602 1006 metadata_value->print_value_on(tty);
coleenp@3602 1007 }
coleenp@3602 1008 break;
coleenp@3602 1009 }
duke@0 1010 case relocInfo::external_word_type:
duke@0 1011 case relocInfo::internal_word_type:
duke@0 1012 case relocInfo::section_word_type:
duke@0 1013 {
duke@0 1014 DataRelocation* r = (DataRelocation*) reloc();
duke@0 1015 tty->print(" | [target=" INTPTR_FORMAT "]", r->value()); //value==target
duke@0 1016 break;
duke@0 1017 }
duke@0 1018 case relocInfo::static_call_type:
duke@0 1019 case relocInfo::runtime_call_type:
duke@0 1020 {
duke@0 1021 CallRelocation* r = (CallRelocation*) reloc();
duke@0 1022 tty->print(" | [destination=" INTPTR_FORMAT "]", r->destination());
duke@0 1023 break;
duke@0 1024 }
duke@0 1025 case relocInfo::virtual_call_type:
duke@0 1026 {
duke@0 1027 virtual_call_Relocation* r = (virtual_call_Relocation*) reloc();
coleenp@3602 1028 tty->print(" | [destination=" INTPTR_FORMAT " cached_value=" INTPTR_FORMAT "]",
coleenp@3602 1029 r->destination(), r->cached_value());
duke@0 1030 break;
duke@0 1031 }
duke@0 1032 case relocInfo::static_stub_type:
duke@0 1033 {
duke@0 1034 static_stub_Relocation* r = (static_stub_Relocation*) reloc();
duke@0 1035 tty->print(" | [static_call=" INTPTR_FORMAT "]", r->static_call());
duke@0 1036 break;
duke@0 1037 }
goetz@5965 1038 case relocInfo::trampoline_stub_type:
goetz@5965 1039 {
goetz@5965 1040 trampoline_stub_Relocation* r = (trampoline_stub_Relocation*) reloc();
goetz@5965 1041 tty->print(" | [trampoline owner=" INTPTR_FORMAT "]", r->owner());
goetz@5965 1042 break;
goetz@5965 1043 }
duke@0 1044 }
duke@0 1045 tty->cr();
duke@0 1046 }
duke@0 1047
duke@0 1048
duke@0 1049 void RelocIterator::print() {
duke@0 1050 RelocIterator save_this = (*this);
duke@0 1051 relocInfo* scan = _current;
duke@0 1052 if (!has_current()) scan += 1; // nothing to scan here!
duke@0 1053
duke@0 1054 bool skip_next = has_current();
duke@0 1055 bool got_next;
duke@0 1056 while (true) {
duke@0 1057 got_next = (skip_next || next());
duke@0 1058 skip_next = false;
duke@0 1059
duke@0 1060 tty->print(" @" INTPTR_FORMAT ": ", scan);
duke@0 1061 relocInfo* newscan = _current+1;
duke@0 1062 if (!has_current()) newscan -= 1; // nothing to scan here!
duke@0 1063 while (scan < newscan) {
duke@0 1064 tty->print("%04x", *(short*)scan & 0xFFFF);
duke@0 1065 scan++;
duke@0 1066 }
duke@0 1067 tty->cr();
duke@0 1068
duke@0 1069 if (!got_next) break;
duke@0 1070 print_current();
duke@0 1071 }
duke@0 1072
duke@0 1073 (*this) = save_this;
duke@0 1074 }
duke@0 1075
duke@0 1076 // For the debugger:
duke@0 1077 extern "C"
twisti@1483 1078 void print_blob_locs(nmethod* nm) {
twisti@1483 1079 nm->print();
twisti@1483 1080 RelocIterator iter(nm);
duke@0 1081 iter.print();
duke@0 1082 }
duke@0 1083 extern "C"
duke@0 1084 void print_buf_locs(CodeBuffer* cb) {
duke@0 1085 FlagSetting fs(PrintRelocations, true);
duke@0 1086 cb->print();
duke@0 1087 }
duke@0 1088 #endif // !PRODUCT