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