annotate src/share/vm/code/relocInfo.cpp @ 5965:53fa76359eb1

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