Fri, 27 Aug 2010 01:51:27 -0700
6961697: move nmethod constants section before instruction section
Summary: This is a preparation for 6961690.
Reviewed-by: kvn, never
duke@435 | 1 | /* |
twisti@2117 | 2 | * Copyright (c) 1997, 2010, Oracle and/or its affiliates. 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 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // Types in this file: |
duke@435 | 26 | // relocInfo |
duke@435 | 27 | // One element of an array of halfwords encoding compressed relocations. |
duke@435 | 28 | // Also, the source of relocation types (relocInfo::oop_type, ...). |
duke@435 | 29 | // Relocation |
duke@435 | 30 | // A flyweight object representing a single relocation. |
duke@435 | 31 | // It is fully unpacked from the compressed relocation array. |
duke@435 | 32 | // oop_Relocation, ... (subclasses of Relocation) |
duke@435 | 33 | // The location of some type-specific operations (oop_addr, ...). |
duke@435 | 34 | // Also, the source of relocation specs (oop_Relocation::spec, ...). |
duke@435 | 35 | // RelocationHolder |
duke@435 | 36 | // A ValueObj type which acts as a union holding a Relocation object. |
duke@435 | 37 | // Represents a relocation spec passed into a CodeBuffer during assembly. |
duke@435 | 38 | // RelocIterator |
duke@435 | 39 | // A StackObj which iterates over the relocations associated with |
duke@435 | 40 | // a range of code addresses. Can be used to operate a copy of code. |
duke@435 | 41 | // PatchingRelocIterator |
duke@435 | 42 | // Specialized subtype of RelocIterator which removes breakpoints |
duke@435 | 43 | // temporarily during iteration, then restores them. |
duke@435 | 44 | // BoundRelocation |
duke@435 | 45 | // An _internal_ type shared by packers and unpackers of relocations. |
duke@435 | 46 | // It pastes together a RelocationHolder with some pointers into |
duke@435 | 47 | // code and relocInfo streams. |
duke@435 | 48 | |
duke@435 | 49 | |
duke@435 | 50 | // Notes on relocType: |
duke@435 | 51 | // |
duke@435 | 52 | // These hold enough information to read or write a value embedded in |
duke@435 | 53 | // the instructions of an CodeBlob. They're used to update: |
duke@435 | 54 | // |
duke@435 | 55 | // 1) embedded oops (isOop() == true) |
duke@435 | 56 | // 2) inline caches (isIC() == true) |
duke@435 | 57 | // 3) runtime calls (isRuntimeCall() == true) |
duke@435 | 58 | // 4) internal word ref (isInternalWord() == true) |
duke@435 | 59 | // 5) external word ref (isExternalWord() == true) |
duke@435 | 60 | // |
duke@435 | 61 | // when objects move (GC) or if code moves (compacting the code heap). |
duke@435 | 62 | // They are also used to patch the code (if a call site must change) |
duke@435 | 63 | // |
duke@435 | 64 | // A relocInfo is represented in 16 bits: |
duke@435 | 65 | // 4 bits indicating the relocation type |
duke@435 | 66 | // 12 bits indicating the offset from the previous relocInfo address |
duke@435 | 67 | // |
duke@435 | 68 | // The offsets accumulate along the relocInfo stream to encode the |
duke@435 | 69 | // address within the CodeBlob, which is named RelocIterator::addr(). |
duke@435 | 70 | // The address of a particular relocInfo always points to the first |
duke@435 | 71 | // byte of the relevant instruction (and not to any of its subfields |
duke@435 | 72 | // or embedded immediate constants). |
duke@435 | 73 | // |
duke@435 | 74 | // The offset value is scaled appropriately for the target machine. |
duke@435 | 75 | // (See relocInfo_<arch>.hpp for the offset scaling.) |
duke@435 | 76 | // |
duke@435 | 77 | // On some machines, there may also be a "format" field which may provide |
duke@435 | 78 | // additional information about the format of the instruction stream |
duke@435 | 79 | // at the corresponding code address. The format value is usually zero. |
duke@435 | 80 | // Any machine (such as Intel) whose instructions can sometimes contain |
duke@435 | 81 | // more than one relocatable constant needs format codes to distinguish |
duke@435 | 82 | // which operand goes with a given relocation. |
duke@435 | 83 | // |
duke@435 | 84 | // If the target machine needs N format bits, the offset has 12-N bits, |
duke@435 | 85 | // the format is encoded between the offset and the type, and the |
duke@435 | 86 | // relocInfo_<arch>.hpp file has manifest constants for the format codes. |
duke@435 | 87 | // |
duke@435 | 88 | // If the type is "data_prefix_tag" then the offset bits are further encoded, |
duke@435 | 89 | // and in fact represent not a code-stream offset but some inline data. |
duke@435 | 90 | // The data takes the form of a counted sequence of halfwords, which |
duke@435 | 91 | // precedes the actual relocation record. (Clients never see it directly.) |
duke@435 | 92 | // The interpetation of this extra data depends on the relocation type. |
duke@435 | 93 | // |
duke@435 | 94 | // On machines that have 32-bit immediate fields, there is usually |
duke@435 | 95 | // little need for relocation "prefix" data, because the instruction stream |
duke@435 | 96 | // is a perfectly reasonable place to store the value. On machines in |
duke@435 | 97 | // which 32-bit values must be "split" across instructions, the relocation |
duke@435 | 98 | // data is the "true" specification of the value, which is then applied |
duke@435 | 99 | // to some field of the instruction (22 or 13 bits, on SPARC). |
duke@435 | 100 | // |
duke@435 | 101 | // Whenever the location of the CodeBlob changes, any PC-relative |
duke@435 | 102 | // relocations, and any internal_word_type relocations, must be reapplied. |
duke@435 | 103 | // After the GC runs, oop_type relocations must be reapplied. |
duke@435 | 104 | // |
duke@435 | 105 | // |
duke@435 | 106 | // Here are meanings of the types: |
duke@435 | 107 | // |
duke@435 | 108 | // relocInfo::none -- a filler record |
duke@435 | 109 | // Value: none |
duke@435 | 110 | // Instruction: The corresponding code address is ignored |
duke@435 | 111 | // Data: Any data prefix and format code are ignored |
duke@435 | 112 | // (This means that any relocInfo can be disabled by setting |
duke@435 | 113 | // its type to none. See relocInfo::remove.) |
duke@435 | 114 | // |
duke@435 | 115 | // relocInfo::oop_type -- a reference to an oop |
duke@435 | 116 | // Value: an oop, or else the address (handle) of an oop |
duke@435 | 117 | // Instruction types: memory (load), set (load address) |
duke@435 | 118 | // Data: [] an oop stored in 4 bytes of instruction |
duke@435 | 119 | // [n] n is the index of an oop in the CodeBlob's oop pool |
duke@435 | 120 | // [[N]n l] and l is a byte offset to be applied to the oop |
duke@435 | 121 | // [Nn Ll] both index and offset may be 32 bits if necessary |
duke@435 | 122 | // Here is a special hack, used only by the old compiler: |
duke@435 | 123 | // [[N]n 00] the value is the __address__ of the nth oop in the pool |
duke@435 | 124 | // (Note that the offset allows optimal references to class variables.) |
duke@435 | 125 | // |
duke@435 | 126 | // relocInfo::internal_word_type -- an address within the same CodeBlob |
duke@435 | 127 | // relocInfo::section_word_type -- same, but can refer to another section |
duke@435 | 128 | // Value: an address in the CodeBlob's code or constants section |
duke@435 | 129 | // Instruction types: memory (load), set (load address) |
duke@435 | 130 | // Data: [] stored in 4 bytes of instruction |
duke@435 | 131 | // [[L]l] a relative offset (see [About Offsets] below) |
duke@435 | 132 | // In the case of section_word_type, the offset is relative to a section |
duke@435 | 133 | // base address, and the section number (e.g., SECT_INSTS) is encoded |
duke@435 | 134 | // into the low two bits of the offset L. |
duke@435 | 135 | // |
duke@435 | 136 | // relocInfo::external_word_type -- a fixed address in the runtime system |
duke@435 | 137 | // Value: an address |
duke@435 | 138 | // Instruction types: memory (load), set (load address) |
duke@435 | 139 | // Data: [] stored in 4 bytes of instruction |
duke@435 | 140 | // [n] the index of a "well-known" stub (usual case on RISC) |
duke@435 | 141 | // [Ll] a 32-bit address |
duke@435 | 142 | // |
duke@435 | 143 | // relocInfo::runtime_call_type -- a fixed subroutine in the runtime system |
duke@435 | 144 | // Value: an address |
duke@435 | 145 | // Instruction types: PC-relative call (or a PC-relative branch) |
duke@435 | 146 | // Data: [] stored in 4 bytes of instruction |
duke@435 | 147 | // |
duke@435 | 148 | // relocInfo::static_call_type -- a static call |
duke@435 | 149 | // Value: an CodeBlob, a stub, or a fixup routine |
duke@435 | 150 | // Instruction types: a call |
duke@435 | 151 | // Data: [] |
duke@435 | 152 | // The identity of the callee is extracted from debugging information. |
duke@435 | 153 | // //%note reloc_3 |
duke@435 | 154 | // |
duke@435 | 155 | // relocInfo::virtual_call_type -- a virtual call site (which includes an inline |
duke@435 | 156 | // cache) |
duke@435 | 157 | // Value: an CodeBlob, a stub, the interpreter, or a fixup routine |
duke@435 | 158 | // Instruction types: a call, plus some associated set-oop instructions |
duke@435 | 159 | // Data: [] the associated set-oops are adjacent to the call |
duke@435 | 160 | // [n] n is a relative offset to the first set-oop |
duke@435 | 161 | // [[N]n l] and l is a limit within which the set-oops occur |
duke@435 | 162 | // [Nn Ll] both n and l may be 32 bits if necessary |
duke@435 | 163 | // The identity of the callee is extracted from debugging information. |
duke@435 | 164 | // |
duke@435 | 165 | // relocInfo::opt_virtual_call_type -- a virtual call site that is statically bound |
duke@435 | 166 | // |
duke@435 | 167 | // Same info as a static_call_type. We use a special type, so the handling of |
duke@435 | 168 | // virtuals and statics are separated. |
duke@435 | 169 | // |
duke@435 | 170 | // |
duke@435 | 171 | // The offset n points to the first set-oop. (See [About Offsets] below.) |
duke@435 | 172 | // In turn, the set-oop instruction specifies or contains an oop cell devoted |
duke@435 | 173 | // exclusively to the IC call, which can be patched along with the call. |
duke@435 | 174 | // |
duke@435 | 175 | // The locations of any other set-oops are found by searching the relocation |
duke@435 | 176 | // information starting at the first set-oop, and continuing until all |
duke@435 | 177 | // relocations up through l have been inspected. The value l is another |
duke@435 | 178 | // relative offset. (Both n and l are relative to the call's first byte.) |
duke@435 | 179 | // |
duke@435 | 180 | // The limit l of the search is exclusive. However, if it points within |
duke@435 | 181 | // the call (e.g., offset zero), it is adjusted to point after the call and |
duke@435 | 182 | // any associated machine-specific delay slot. |
duke@435 | 183 | // |
duke@435 | 184 | // Since the offsets could be as wide as 32-bits, these conventions |
duke@435 | 185 | // put no restrictions whatever upon code reorganization. |
duke@435 | 186 | // |
duke@435 | 187 | // The compiler is responsible for ensuring that transition from a clean |
duke@435 | 188 | // state to a monomorphic compiled state is MP-safe. This implies that |
duke@435 | 189 | // the system must respond well to intermediate states where a random |
duke@435 | 190 | // subset of the set-oops has been correctly from the clean state |
duke@435 | 191 | // upon entry to the VEP of the compiled method. In the case of a |
duke@435 | 192 | // machine (Intel) with a single set-oop instruction, the 32-bit |
duke@435 | 193 | // immediate field must not straddle a unit of memory coherence. |
duke@435 | 194 | // //%note reloc_3 |
duke@435 | 195 | // |
duke@435 | 196 | // relocInfo::breakpoint_type -- a conditional breakpoint in the code |
duke@435 | 197 | // Value: none |
duke@435 | 198 | // Instruction types: any whatsoever |
duke@435 | 199 | // Data: [b [T]t i...] |
duke@435 | 200 | // The b is a bit-packed word representing the breakpoint's attributes. |
duke@435 | 201 | // The t is a target address which the breakpoint calls (when it is enabled). |
duke@435 | 202 | // The i... is a place to store one or two instruction words overwritten |
duke@435 | 203 | // by a trap, so that the breakpoint may be subsequently removed. |
duke@435 | 204 | // |
duke@435 | 205 | // relocInfo::static_stub_type -- an extra stub for each static_call_type |
duke@435 | 206 | // Value: none |
duke@435 | 207 | // Instruction types: a virtual call: { set_oop; jump; } |
duke@435 | 208 | // Data: [[N]n] the offset of the associated static_call reloc |
duke@435 | 209 | // This stub becomes the target of a static call which must be upgraded |
duke@435 | 210 | // to a virtual call (because the callee is interpreted). |
duke@435 | 211 | // See [About Offsets] below. |
duke@435 | 212 | // //%note reloc_2 |
duke@435 | 213 | // |
duke@435 | 214 | // For example: |
duke@435 | 215 | // |
duke@435 | 216 | // INSTRUCTIONS RELOC: TYPE PREFIX DATA |
duke@435 | 217 | // ------------ ---- ----------- |
duke@435 | 218 | // sethi %hi(myObject), R oop_type [n(myObject)] |
duke@435 | 219 | // ld [R+%lo(myObject)+fldOffset], R2 oop_type [n(myObject) fldOffset] |
duke@435 | 220 | // add R2, 1, R2 |
duke@435 | 221 | // st R2, [R+%lo(myObject)+fldOffset] oop_type [n(myObject) fldOffset] |
duke@435 | 222 | //%note reloc_1 |
duke@435 | 223 | // |
duke@435 | 224 | // This uses 4 instruction words, 8 relocation halfwords, |
duke@435 | 225 | // and an entry (which is sharable) in the CodeBlob's oop pool, |
duke@435 | 226 | // for a total of 36 bytes. |
duke@435 | 227 | // |
duke@435 | 228 | // Note that the compiler is responsible for ensuring the "fldOffset" when |
duke@435 | 229 | // added to "%lo(myObject)" does not overflow the immediate fields of the |
duke@435 | 230 | // memory instructions. |
duke@435 | 231 | // |
duke@435 | 232 | // |
duke@435 | 233 | // [About Offsets] Relative offsets are supplied to this module as |
duke@435 | 234 | // positive byte offsets, but they may be internally stored scaled |
duke@435 | 235 | // and/or negated, depending on what is most compact for the target |
duke@435 | 236 | // system. Since the object pointed to by the offset typically |
duke@435 | 237 | // precedes the relocation address, it is profitable to store |
duke@435 | 238 | // these negative offsets as positive numbers, but this decision |
duke@435 | 239 | // is internal to the relocation information abstractions. |
duke@435 | 240 | // |
duke@435 | 241 | |
duke@435 | 242 | class Relocation; |
duke@435 | 243 | class CodeBuffer; |
duke@435 | 244 | class CodeSection; |
duke@435 | 245 | class RelocIterator; |
duke@435 | 246 | |
duke@435 | 247 | class relocInfo VALUE_OBJ_CLASS_SPEC { |
duke@435 | 248 | friend class RelocIterator; |
duke@435 | 249 | public: |
duke@435 | 250 | enum relocType { |
duke@435 | 251 | none = 0, // Used when no relocation should be generated |
duke@435 | 252 | oop_type = 1, // embedded oop |
duke@435 | 253 | virtual_call_type = 2, // a standard inline cache call for a virtual send |
duke@435 | 254 | opt_virtual_call_type = 3, // a virtual call that has been statically bound (i.e., no IC cache) |
duke@435 | 255 | static_call_type = 4, // a static send |
duke@435 | 256 | static_stub_type = 5, // stub-entry for static send (takes care of interpreter case) |
duke@435 | 257 | runtime_call_type = 6, // call to fixed external routine |
duke@435 | 258 | external_word_type = 7, // reference to fixed external address |
duke@435 | 259 | internal_word_type = 8, // reference within the current code blob |
duke@435 | 260 | section_word_type = 9, // internal, but a cross-section reference |
duke@435 | 261 | poll_type = 10, // polling instruction for safepoints |
duke@435 | 262 | poll_return_type = 11, // polling instruction for safepoints at return |
duke@435 | 263 | breakpoint_type = 12, // an initialization barrier or safepoint |
duke@435 | 264 | yet_unused_type = 13, // Still unused |
duke@435 | 265 | yet_unused_type_2 = 14, // Still unused |
duke@435 | 266 | data_prefix_tag = 15, // tag for a prefix (carries data arguments) |
duke@435 | 267 | type_mask = 15 // A mask which selects only the above values |
duke@435 | 268 | }; |
duke@435 | 269 | |
duke@435 | 270 | protected: |
duke@435 | 271 | unsigned short _value; |
duke@435 | 272 | |
duke@435 | 273 | enum RawBitsToken { RAW_BITS }; |
duke@435 | 274 | relocInfo(relocType type, RawBitsToken ignore, int bits) |
duke@435 | 275 | : _value((type << nontype_width) + bits) { } |
duke@435 | 276 | |
duke@435 | 277 | relocInfo(relocType type, RawBitsToken ignore, int off, int f) |
duke@435 | 278 | : _value((type << nontype_width) + (off / (unsigned)offset_unit) + (f << offset_width)) { } |
duke@435 | 279 | |
duke@435 | 280 | public: |
duke@435 | 281 | // constructor |
duke@435 | 282 | relocInfo(relocType type, int offset, int format = 0) |
duke@435 | 283 | #ifndef ASSERT |
duke@435 | 284 | { |
duke@435 | 285 | (*this) = relocInfo(type, RAW_BITS, offset, format); |
duke@435 | 286 | } |
duke@435 | 287 | #else |
duke@435 | 288 | // Put a bunch of assertions out-of-line. |
duke@435 | 289 | ; |
duke@435 | 290 | #endif |
duke@435 | 291 | |
duke@435 | 292 | #define APPLY_TO_RELOCATIONS(visitor) \ |
duke@435 | 293 | visitor(oop) \ |
duke@435 | 294 | visitor(virtual_call) \ |
duke@435 | 295 | visitor(opt_virtual_call) \ |
duke@435 | 296 | visitor(static_call) \ |
duke@435 | 297 | visitor(static_stub) \ |
duke@435 | 298 | visitor(runtime_call) \ |
duke@435 | 299 | visitor(external_word) \ |
duke@435 | 300 | visitor(internal_word) \ |
duke@435 | 301 | visitor(poll) \ |
duke@435 | 302 | visitor(poll_return) \ |
duke@435 | 303 | visitor(breakpoint) \ |
duke@435 | 304 | visitor(section_word) \ |
duke@435 | 305 | |
duke@435 | 306 | |
duke@435 | 307 | public: |
duke@435 | 308 | enum { |
duke@435 | 309 | value_width = sizeof(unsigned short) * BitsPerByte, |
duke@435 | 310 | type_width = 4, // == log2(type_mask+1) |
duke@435 | 311 | nontype_width = value_width - type_width, |
duke@435 | 312 | datalen_width = nontype_width-1, |
duke@435 | 313 | datalen_tag = 1 << datalen_width, // or-ed into _value |
duke@435 | 314 | datalen_limit = 1 << datalen_width, |
duke@435 | 315 | datalen_mask = (1 << datalen_width)-1 |
duke@435 | 316 | }; |
duke@435 | 317 | |
duke@435 | 318 | // accessors |
duke@435 | 319 | public: |
duke@435 | 320 | relocType type() const { return (relocType)((unsigned)_value >> nontype_width); } |
duke@435 | 321 | int format() const { return format_mask==0? 0: format_mask & |
duke@435 | 322 | ((unsigned)_value >> offset_width); } |
duke@435 | 323 | int addr_offset() const { assert(!is_prefix(), "must have offset"); |
duke@435 | 324 | return (_value & offset_mask)*offset_unit; } |
duke@435 | 325 | |
duke@435 | 326 | protected: |
duke@435 | 327 | const short* data() const { assert(is_datalen(), "must have data"); |
duke@435 | 328 | return (const short*)(this + 1); } |
duke@435 | 329 | int datalen() const { assert(is_datalen(), "must have data"); |
duke@435 | 330 | return (_value & datalen_mask); } |
duke@435 | 331 | int immediate() const { assert(is_immediate(), "must have immed"); |
duke@435 | 332 | return (_value & datalen_mask); } |
duke@435 | 333 | public: |
duke@435 | 334 | static int addr_unit() { return offset_unit; } |
duke@435 | 335 | static int offset_limit() { return (1 << offset_width) * offset_unit; } |
duke@435 | 336 | |
duke@435 | 337 | void set_type(relocType type); |
duke@435 | 338 | void set_format(int format); |
duke@435 | 339 | |
duke@435 | 340 | void remove() { set_type(none); } |
duke@435 | 341 | |
duke@435 | 342 | protected: |
duke@435 | 343 | bool is_none() const { return type() == none; } |
duke@435 | 344 | bool is_prefix() const { return type() == data_prefix_tag; } |
duke@435 | 345 | bool is_datalen() const { assert(is_prefix(), "must be prefix"); |
duke@435 | 346 | return (_value & datalen_tag) != 0; } |
duke@435 | 347 | bool is_immediate() const { assert(is_prefix(), "must be prefix"); |
duke@435 | 348 | return (_value & datalen_tag) == 0; } |
duke@435 | 349 | |
duke@435 | 350 | public: |
duke@435 | 351 | // Occasionally records of type relocInfo::none will appear in the stream. |
duke@435 | 352 | // We do not bother to filter these out, but clients should ignore them. |
duke@435 | 353 | // These records serve as "filler" in three ways: |
duke@435 | 354 | // - to skip large spans of unrelocated code (this is rare) |
duke@435 | 355 | // - to pad out the relocInfo array to the required oop alignment |
duke@435 | 356 | // - to disable old relocation information which is no longer applicable |
duke@435 | 357 | |
duke@435 | 358 | inline friend relocInfo filler_relocInfo(); |
duke@435 | 359 | |
duke@435 | 360 | // Every non-prefix relocation may be preceded by at most one prefix, |
duke@435 | 361 | // which supplies 1 or more halfwords of associated data. Conventionally, |
duke@435 | 362 | // an int is represented by 0, 1, or 2 halfwords, depending on how |
duke@435 | 363 | // many bits are required to represent the value. (In addition, |
duke@435 | 364 | // if the sole halfword is a 10-bit unsigned number, it is made |
duke@435 | 365 | // "immediate" in the prefix header word itself. This optimization |
duke@435 | 366 | // is invisible outside this module.) |
duke@435 | 367 | |
duke@435 | 368 | inline friend relocInfo prefix_relocInfo(int datalen = 0); |
duke@435 | 369 | |
duke@435 | 370 | protected: |
duke@435 | 371 | // an immediate relocInfo optimizes a prefix with one 10-bit unsigned value |
duke@435 | 372 | static relocInfo immediate_relocInfo(int data0) { |
duke@435 | 373 | assert(fits_into_immediate(data0), "data0 in limits"); |
duke@435 | 374 | return relocInfo(relocInfo::data_prefix_tag, RAW_BITS, data0); |
duke@435 | 375 | } |
duke@435 | 376 | static bool fits_into_immediate(int data0) { |
duke@435 | 377 | return (data0 >= 0 && data0 < datalen_limit); |
duke@435 | 378 | } |
duke@435 | 379 | |
duke@435 | 380 | public: |
duke@435 | 381 | // Support routines for compilers. |
duke@435 | 382 | |
duke@435 | 383 | // This routine takes an infant relocInfo (unprefixed) and |
duke@435 | 384 | // edits in its prefix, if any. It also updates dest.locs_end. |
duke@435 | 385 | void initialize(CodeSection* dest, Relocation* reloc); |
duke@435 | 386 | |
duke@435 | 387 | // This routine updates a prefix and returns the limit pointer. |
duke@435 | 388 | // It tries to compress the prefix from 32 to 16 bits, and if |
duke@435 | 389 | // successful returns a reduced "prefix_limit" pointer. |
duke@435 | 390 | relocInfo* finish_prefix(short* prefix_limit); |
duke@435 | 391 | |
duke@435 | 392 | // bit-packers for the data array: |
duke@435 | 393 | |
duke@435 | 394 | // As it happens, the bytes within the shorts are ordered natively, |
duke@435 | 395 | // but the shorts within the word are ordered big-endian. |
duke@435 | 396 | // This is an arbitrary choice, made this way mainly to ease debugging. |
duke@435 | 397 | static int data0_from_int(jint x) { return x >> value_width; } |
duke@435 | 398 | static int data1_from_int(jint x) { return (short)x; } |
duke@435 | 399 | static jint jint_from_data(short* data) { |
duke@435 | 400 | return (data[0] << value_width) + (unsigned short)data[1]; |
duke@435 | 401 | } |
duke@435 | 402 | |
duke@435 | 403 | static jint short_data_at(int n, short* data, int datalen) { |
duke@435 | 404 | return datalen > n ? data[n] : 0; |
duke@435 | 405 | } |
duke@435 | 406 | |
duke@435 | 407 | static jint jint_data_at(int n, short* data, int datalen) { |
duke@435 | 408 | return datalen > n+1 ? jint_from_data(&data[n]) : short_data_at(n, data, datalen); |
duke@435 | 409 | } |
duke@435 | 410 | |
duke@435 | 411 | // Update methods for relocation information |
duke@435 | 412 | // (since code is dynamically patched, we also need to dynamically update the relocation info) |
duke@435 | 413 | // Both methods takes old_type, so it is able to performe sanity checks on the information removed. |
duke@435 | 414 | static void change_reloc_info_for_address(RelocIterator *itr, address pc, relocType old_type, relocType new_type); |
duke@435 | 415 | static void remove_reloc_info_for_address(RelocIterator *itr, address pc, relocType old_type); |
duke@435 | 416 | |
duke@435 | 417 | // Machine dependent stuff |
duke@435 | 418 | #include "incls/_relocInfo_pd.hpp.incl" |
duke@435 | 419 | |
duke@435 | 420 | protected: |
duke@435 | 421 | // Derived constant, based on format_width which is PD: |
duke@435 | 422 | enum { |
duke@435 | 423 | offset_width = nontype_width - format_width, |
duke@435 | 424 | offset_mask = (1<<offset_width) - 1, |
duke@435 | 425 | format_mask = (1<<format_width) - 1 |
duke@435 | 426 | }; |
duke@435 | 427 | public: |
duke@435 | 428 | enum { |
duke@435 | 429 | // Conservatively large estimate of maximum length (in shorts) |
duke@435 | 430 | // of any relocation record (probably breakpoints are largest). |
duke@435 | 431 | // Extended format is length prefix, data words, and tag/offset suffix. |
duke@435 | 432 | length_limit = 1 + 1 + (3*BytesPerWord/BytesPerShort) + 1, |
duke@435 | 433 | have_format = format_width > 0 |
duke@435 | 434 | }; |
duke@435 | 435 | }; |
duke@435 | 436 | |
duke@435 | 437 | #define FORWARD_DECLARE_EACH_CLASS(name) \ |
duke@435 | 438 | class name##_Relocation; |
duke@435 | 439 | APPLY_TO_RELOCATIONS(FORWARD_DECLARE_EACH_CLASS) |
duke@435 | 440 | #undef FORWARD_DECLARE_EACH_CLASS |
duke@435 | 441 | |
duke@435 | 442 | |
duke@435 | 443 | |
duke@435 | 444 | inline relocInfo filler_relocInfo() { |
duke@435 | 445 | return relocInfo(relocInfo::none, relocInfo::offset_limit() - relocInfo::offset_unit); |
duke@435 | 446 | } |
duke@435 | 447 | |
duke@435 | 448 | inline relocInfo prefix_relocInfo(int datalen) { |
duke@435 | 449 | assert(relocInfo::fits_into_immediate(datalen), "datalen in limits"); |
duke@435 | 450 | return relocInfo(relocInfo::data_prefix_tag, relocInfo::RAW_BITS, relocInfo::datalen_tag | datalen); |
duke@435 | 451 | } |
duke@435 | 452 | |
duke@435 | 453 | |
duke@435 | 454 | // Holder for flyweight relocation objects. |
duke@435 | 455 | // Although the flyweight subclasses are of varying sizes, |
duke@435 | 456 | // the holder is "one size fits all". |
duke@435 | 457 | class RelocationHolder VALUE_OBJ_CLASS_SPEC { |
duke@435 | 458 | friend class Relocation; |
duke@435 | 459 | friend class CodeSection; |
duke@435 | 460 | |
duke@435 | 461 | private: |
duke@435 | 462 | // this preallocated memory must accommodate all subclasses of Relocation |
duke@435 | 463 | // (this number is assertion-checked in Relocation::operator new) |
duke@435 | 464 | enum { _relocbuf_size = 5 }; |
duke@435 | 465 | void* _relocbuf[ _relocbuf_size ]; |
duke@435 | 466 | |
duke@435 | 467 | public: |
duke@435 | 468 | Relocation* reloc() const { return (Relocation*) &_relocbuf[0]; } |
duke@435 | 469 | inline relocInfo::relocType type() const; |
duke@435 | 470 | |
duke@435 | 471 | // Add a constant offset to a relocation. Helper for class Address. |
duke@435 | 472 | RelocationHolder plus(int offset) const; |
duke@435 | 473 | |
duke@435 | 474 | inline RelocationHolder(); // initializes type to none |
duke@435 | 475 | |
duke@435 | 476 | inline RelocationHolder(Relocation* r); // make a copy |
duke@435 | 477 | |
duke@435 | 478 | static const RelocationHolder none; |
duke@435 | 479 | }; |
duke@435 | 480 | |
duke@435 | 481 | // A RelocIterator iterates through the relocation information of a CodeBlob. |
duke@435 | 482 | // It is a variable BoundRelocation which is able to take on successive |
duke@435 | 483 | // values as it is advanced through a code stream. |
duke@435 | 484 | // Usage: |
duke@435 | 485 | // RelocIterator iter(nm); |
duke@435 | 486 | // while (iter.next()) { |
duke@435 | 487 | // iter.reloc()->some_operation(); |
duke@435 | 488 | // } |
duke@435 | 489 | // or: |
duke@435 | 490 | // RelocIterator iter(nm); |
duke@435 | 491 | // while (iter.next()) { |
duke@435 | 492 | // switch (iter.type()) { |
duke@435 | 493 | // case relocInfo::oop_type : |
duke@435 | 494 | // case relocInfo::ic_type : |
duke@435 | 495 | // case relocInfo::prim_type : |
duke@435 | 496 | // case relocInfo::uncommon_type : |
duke@435 | 497 | // case relocInfo::runtime_call_type : |
duke@435 | 498 | // case relocInfo::internal_word_type: |
duke@435 | 499 | // case relocInfo::external_word_type: |
duke@435 | 500 | // ... |
duke@435 | 501 | // } |
duke@435 | 502 | // } |
duke@435 | 503 | |
duke@435 | 504 | class RelocIterator : public StackObj { |
twisti@2117 | 505 | enum { SECT_LIMIT = 3 }; // must be equal to CodeBuffer::SECT_LIMIT, checked in ctor |
duke@435 | 506 | friend class Relocation; |
duke@435 | 507 | friend class relocInfo; // for change_reloc_info_for_address only |
duke@435 | 508 | typedef relocInfo::relocType relocType; |
duke@435 | 509 | |
duke@435 | 510 | private: |
duke@435 | 511 | address _limit; // stop producing relocations after this _addr |
duke@435 | 512 | relocInfo* _current; // the current relocation information |
duke@435 | 513 | relocInfo* _end; // end marker; we're done iterating when _current == _end |
twisti@1918 | 514 | nmethod* _code; // compiled method containing _addr |
duke@435 | 515 | address _addr; // instruction to which the relocation applies |
duke@435 | 516 | short _databuf; // spare buffer for compressed data |
duke@435 | 517 | short* _data; // pointer to the relocation's data |
duke@435 | 518 | short _datalen; // number of halfwords in _data |
duke@435 | 519 | char _format; // position within the instruction |
duke@435 | 520 | |
duke@435 | 521 | // Base addresses needed to compute targets of section_word_type relocs. |
duke@435 | 522 | address _section_start[SECT_LIMIT]; |
twisti@2117 | 523 | address _section_end [SECT_LIMIT]; |
duke@435 | 524 | |
duke@435 | 525 | void set_has_current(bool b) { |
duke@435 | 526 | _datalen = !b ? -1 : 0; |
duke@435 | 527 | debug_only(_data = NULL); |
duke@435 | 528 | } |
duke@435 | 529 | void set_current(relocInfo& ri) { |
duke@435 | 530 | _current = &ri; |
duke@435 | 531 | set_has_current(true); |
duke@435 | 532 | } |
duke@435 | 533 | |
duke@435 | 534 | RelocationHolder _rh; // where the current relocation is allocated |
duke@435 | 535 | |
duke@435 | 536 | relocInfo* current() const { assert(has_current(), "must have current"); |
duke@435 | 537 | return _current; } |
duke@435 | 538 | |
duke@435 | 539 | void set_limits(address begin, address limit); |
duke@435 | 540 | |
duke@435 | 541 | void advance_over_prefix(); // helper method |
duke@435 | 542 | |
twisti@2117 | 543 | void initialize_misc(); |
duke@435 | 544 | |
twisti@1918 | 545 | void initialize(nmethod* nm, address begin, address limit); |
duke@435 | 546 | |
duke@435 | 547 | friend class PatchingRelocIterator; |
duke@435 | 548 | // make an uninitialized one, for PatchingRelocIterator: |
duke@435 | 549 | RelocIterator() { initialize_misc(); } |
duke@435 | 550 | |
duke@435 | 551 | public: |
duke@435 | 552 | // constructor |
twisti@1918 | 553 | RelocIterator(nmethod* nm, address begin = NULL, address limit = NULL); |
duke@435 | 554 | RelocIterator(CodeSection* cb, address begin = NULL, address limit = NULL); |
duke@435 | 555 | |
duke@435 | 556 | // get next reloc info, return !eos |
duke@435 | 557 | bool next() { |
duke@435 | 558 | _current++; |
duke@435 | 559 | assert(_current <= _end, "must not overrun relocInfo"); |
duke@435 | 560 | if (_current == _end) { |
duke@435 | 561 | set_has_current(false); |
duke@435 | 562 | return false; |
duke@435 | 563 | } |
duke@435 | 564 | set_has_current(true); |
duke@435 | 565 | |
duke@435 | 566 | if (_current->is_prefix()) { |
duke@435 | 567 | advance_over_prefix(); |
duke@435 | 568 | assert(!current()->is_prefix(), "only one prefix at a time"); |
duke@435 | 569 | } |
duke@435 | 570 | |
duke@435 | 571 | _addr += _current->addr_offset(); |
duke@435 | 572 | |
duke@435 | 573 | if (_limit != NULL && _addr >= _limit) { |
duke@435 | 574 | set_has_current(false); |
duke@435 | 575 | return false; |
duke@435 | 576 | } |
duke@435 | 577 | |
duke@435 | 578 | if (relocInfo::have_format) _format = current()->format(); |
duke@435 | 579 | return true; |
duke@435 | 580 | } |
duke@435 | 581 | |
duke@435 | 582 | // accessors |
duke@435 | 583 | address limit() const { return _limit; } |
duke@435 | 584 | void set_limit(address x); |
duke@435 | 585 | relocType type() const { return current()->type(); } |
duke@435 | 586 | int format() const { return (relocInfo::have_format) ? current()->format() : 0; } |
duke@435 | 587 | address addr() const { return _addr; } |
twisti@1918 | 588 | nmethod* code() const { return _code; } |
duke@435 | 589 | short* data() const { return _data; } |
duke@435 | 590 | int datalen() const { return _datalen; } |
duke@435 | 591 | bool has_current() const { return _datalen >= 0; } |
duke@435 | 592 | |
duke@435 | 593 | void set_addr(address addr) { _addr = addr; } |
twisti@2117 | 594 | bool addr_in_const() const; |
duke@435 | 595 | |
duke@435 | 596 | address section_start(int n) const { |
twisti@2117 | 597 | assert(_section_start[n], "must be initialized"); |
twisti@2117 | 598 | return _section_start[n]; |
twisti@2117 | 599 | } |
twisti@2117 | 600 | address section_end(int n) const { |
twisti@2117 | 601 | assert(_section_end[n], "must be initialized"); |
twisti@2117 | 602 | return _section_end[n]; |
duke@435 | 603 | } |
duke@435 | 604 | |
duke@435 | 605 | // The address points to the affected displacement part of the instruction. |
duke@435 | 606 | // For RISC, this is just the whole instruction. |
duke@435 | 607 | // For Intel, this is an unaligned 32-bit word. |
duke@435 | 608 | |
duke@435 | 609 | // type-specific relocation accessors: oop_Relocation* oop_reloc(), etc. |
duke@435 | 610 | #define EACH_TYPE(name) \ |
duke@435 | 611 | inline name##_Relocation* name##_reloc(); |
duke@435 | 612 | APPLY_TO_RELOCATIONS(EACH_TYPE) |
duke@435 | 613 | #undef EACH_TYPE |
duke@435 | 614 | // generic relocation accessor; switches on type to call the above |
duke@435 | 615 | Relocation* reloc(); |
duke@435 | 616 | |
duke@435 | 617 | // CodeBlob's have relocation indexes for faster random access: |
duke@435 | 618 | static int locs_and_index_size(int code_size, int locs_size); |
duke@435 | 619 | // Store an index into [dest_start+dest_count..dest_end). |
duke@435 | 620 | // At dest_start[0..dest_count] is the actual relocation information. |
duke@435 | 621 | // Everything else up to dest_end is free space for the index. |
duke@435 | 622 | static void create_index(relocInfo* dest_begin, int dest_count, relocInfo* dest_end); |
duke@435 | 623 | |
duke@435 | 624 | #ifndef PRODUCT |
duke@435 | 625 | public: |
duke@435 | 626 | void print(); |
duke@435 | 627 | void print_current(); |
duke@435 | 628 | #endif |
duke@435 | 629 | }; |
duke@435 | 630 | |
duke@435 | 631 | |
duke@435 | 632 | // A Relocation is a flyweight object allocated within a RelocationHolder. |
duke@435 | 633 | // It represents the relocation data of relocation record. |
duke@435 | 634 | // So, the RelocIterator unpacks relocInfos into Relocations. |
duke@435 | 635 | |
duke@435 | 636 | class Relocation VALUE_OBJ_CLASS_SPEC { |
duke@435 | 637 | friend class RelocationHolder; |
duke@435 | 638 | friend class RelocIterator; |
duke@435 | 639 | |
duke@435 | 640 | private: |
duke@435 | 641 | static void guarantee_size(); |
duke@435 | 642 | |
duke@435 | 643 | // When a relocation has been created by a RelocIterator, |
duke@435 | 644 | // this field is non-null. It allows the relocation to know |
duke@435 | 645 | // its context, such as the address to which it applies. |
duke@435 | 646 | RelocIterator* _binding; |
duke@435 | 647 | |
duke@435 | 648 | protected: |
duke@435 | 649 | RelocIterator* binding() const { |
duke@435 | 650 | assert(_binding != NULL, "must be bound"); |
duke@435 | 651 | return _binding; |
duke@435 | 652 | } |
duke@435 | 653 | void set_binding(RelocIterator* b) { |
duke@435 | 654 | assert(_binding == NULL, "must be unbound"); |
duke@435 | 655 | _binding = b; |
duke@435 | 656 | assert(_binding != NULL, "must now be bound"); |
duke@435 | 657 | } |
duke@435 | 658 | |
duke@435 | 659 | Relocation() { |
duke@435 | 660 | _binding = NULL; |
duke@435 | 661 | } |
duke@435 | 662 | |
duke@435 | 663 | static RelocationHolder newHolder() { |
duke@435 | 664 | return RelocationHolder(); |
duke@435 | 665 | } |
duke@435 | 666 | |
duke@435 | 667 | public: |
duke@435 | 668 | void* operator new(size_t size, const RelocationHolder& holder) { |
duke@435 | 669 | if (size > sizeof(holder._relocbuf)) guarantee_size(); |
duke@435 | 670 | assert((void* const *)holder.reloc() == &holder._relocbuf[0], "ptrs must agree"); |
duke@435 | 671 | return holder.reloc(); |
duke@435 | 672 | } |
duke@435 | 673 | |
duke@435 | 674 | // make a generic relocation for a given type (if possible) |
duke@435 | 675 | static RelocationHolder spec_simple(relocInfo::relocType rtype); |
duke@435 | 676 | |
duke@435 | 677 | // here is the type-specific hook which writes relocation data: |
duke@435 | 678 | virtual void pack_data_to(CodeSection* dest) { } |
duke@435 | 679 | |
duke@435 | 680 | // here is the type-specific hook which reads (unpacks) relocation data: |
duke@435 | 681 | virtual void unpack_data() { |
duke@435 | 682 | assert(datalen()==0 || type()==relocInfo::none, "no data here"); |
duke@435 | 683 | } |
duke@435 | 684 | |
duke@435 | 685 | protected: |
duke@435 | 686 | // Helper functions for pack_data_to() and unpack_data(). |
duke@435 | 687 | |
duke@435 | 688 | // Most of the compression logic is confined here. |
duke@435 | 689 | // (The "immediate data" mechanism of relocInfo works independently |
duke@435 | 690 | // of this stuff, and acts to further compress most 1-word data prefixes.) |
duke@435 | 691 | |
duke@435 | 692 | // A variable-width int is encoded as a short if it will fit in 16 bits. |
duke@435 | 693 | // The decoder looks at datalen to decide whether to unpack short or jint. |
duke@435 | 694 | // Most relocation records are quite simple, containing at most two ints. |
duke@435 | 695 | |
duke@435 | 696 | static bool is_short(jint x) { return x == (short)x; } |
duke@435 | 697 | static short* add_short(short* p, int x) { *p++ = x; return p; } |
duke@435 | 698 | static short* add_jint (short* p, jint x) { |
duke@435 | 699 | *p++ = relocInfo::data0_from_int(x); *p++ = relocInfo::data1_from_int(x); |
duke@435 | 700 | return p; |
duke@435 | 701 | } |
duke@435 | 702 | static short* add_var_int(short* p, jint x) { // add a variable-width int |
duke@435 | 703 | if (is_short(x)) p = add_short(p, x); |
duke@435 | 704 | else p = add_jint (p, x); |
duke@435 | 705 | return p; |
duke@435 | 706 | } |
duke@435 | 707 | |
duke@435 | 708 | static short* pack_1_int_to(short* p, jint x0) { |
duke@435 | 709 | // Format is one of: [] [x] [Xx] |
duke@435 | 710 | if (x0 != 0) p = add_var_int(p, x0); |
duke@435 | 711 | return p; |
duke@435 | 712 | } |
duke@435 | 713 | int unpack_1_int() { |
duke@435 | 714 | assert(datalen() <= 2, "too much data"); |
duke@435 | 715 | return relocInfo::jint_data_at(0, data(), datalen()); |
duke@435 | 716 | } |
duke@435 | 717 | |
duke@435 | 718 | // With two ints, the short form is used only if both ints are short. |
duke@435 | 719 | short* pack_2_ints_to(short* p, jint x0, jint x1) { |
duke@435 | 720 | // Format is one of: [] [x y?] [Xx Y?y] |
duke@435 | 721 | if (x0 == 0 && x1 == 0) { |
duke@435 | 722 | // no halfwords needed to store zeroes |
duke@435 | 723 | } else if (is_short(x0) && is_short(x1)) { |
duke@435 | 724 | // 1-2 halfwords needed to store shorts |
duke@435 | 725 | p = add_short(p, x0); if (x1!=0) p = add_short(p, x1); |
duke@435 | 726 | } else { |
duke@435 | 727 | // 3-4 halfwords needed to store jints |
duke@435 | 728 | p = add_jint(p, x0); p = add_var_int(p, x1); |
duke@435 | 729 | } |
duke@435 | 730 | return p; |
duke@435 | 731 | } |
duke@435 | 732 | void unpack_2_ints(jint& x0, jint& x1) { |
duke@435 | 733 | int dlen = datalen(); |
duke@435 | 734 | short* dp = data(); |
duke@435 | 735 | if (dlen <= 2) { |
duke@435 | 736 | x0 = relocInfo::short_data_at(0, dp, dlen); |
duke@435 | 737 | x1 = relocInfo::short_data_at(1, dp, dlen); |
duke@435 | 738 | } else { |
duke@435 | 739 | assert(dlen <= 4, "too much data"); |
duke@435 | 740 | x0 = relocInfo::jint_data_at(0, dp, dlen); |
duke@435 | 741 | x1 = relocInfo::jint_data_at(2, dp, dlen); |
duke@435 | 742 | } |
duke@435 | 743 | } |
duke@435 | 744 | |
duke@435 | 745 | protected: |
duke@435 | 746 | // platform-dependent utilities for decoding and patching instructions |
duke@435 | 747 | void pd_set_data_value (address x, intptr_t off); // a set or mem-ref |
duke@435 | 748 | address pd_call_destination (address orig_addr = NULL); |
duke@435 | 749 | void pd_set_call_destination (address x); |
duke@435 | 750 | void pd_swap_in_breakpoint (address x, short* instrs, int instrlen); |
duke@435 | 751 | void pd_swap_out_breakpoint (address x, short* instrs, int instrlen); |
duke@435 | 752 | static int pd_breakpoint_size (); |
duke@435 | 753 | |
duke@435 | 754 | // this extracts the address of an address in the code stream instead of the reloc data |
duke@435 | 755 | address* pd_address_in_code (); |
duke@435 | 756 | |
duke@435 | 757 | // this extracts an address from the code stream instead of the reloc data |
duke@435 | 758 | address pd_get_address_from_code (); |
duke@435 | 759 | |
duke@435 | 760 | // these convert from byte offsets, to scaled offsets, to addresses |
duke@435 | 761 | static jint scaled_offset(address x, address base) { |
duke@435 | 762 | int byte_offset = x - base; |
duke@435 | 763 | int offset = -byte_offset / relocInfo::addr_unit(); |
duke@435 | 764 | assert(address_from_scaled_offset(offset, base) == x, "just checkin'"); |
duke@435 | 765 | return offset; |
duke@435 | 766 | } |
duke@435 | 767 | static jint scaled_offset_null_special(address x, address base) { |
duke@435 | 768 | // Some relocations treat offset=0 as meaning NULL. |
duke@435 | 769 | // Handle this extra convention carefully. |
duke@435 | 770 | if (x == NULL) return 0; |
duke@435 | 771 | assert(x != base, "offset must not be zero"); |
duke@435 | 772 | return scaled_offset(x, base); |
duke@435 | 773 | } |
duke@435 | 774 | static address address_from_scaled_offset(jint offset, address base) { |
duke@435 | 775 | int byte_offset = -( offset * relocInfo::addr_unit() ); |
duke@435 | 776 | return base + byte_offset; |
duke@435 | 777 | } |
duke@435 | 778 | |
duke@435 | 779 | // these convert between indexes and addresses in the runtime system |
duke@435 | 780 | static int32_t runtime_address_to_index(address runtime_address); |
duke@435 | 781 | static address index_to_runtime_address(int32_t index); |
duke@435 | 782 | |
duke@435 | 783 | // helpers for mapping between old and new addresses after a move or resize |
duke@435 | 784 | address old_addr_for(address newa, const CodeBuffer* src, CodeBuffer* dest); |
duke@435 | 785 | address new_addr_for(address olda, const CodeBuffer* src, CodeBuffer* dest); |
duke@435 | 786 | void normalize_address(address& addr, const CodeSection* dest, bool allow_other_sections = false); |
duke@435 | 787 | |
duke@435 | 788 | public: |
duke@435 | 789 | // accessors which only make sense for a bound Relocation |
twisti@1918 | 790 | address addr() const { return binding()->addr(); } |
twisti@1918 | 791 | nmethod* code() const { return binding()->code(); } |
twisti@1918 | 792 | bool addr_in_const() const { return binding()->addr_in_const(); } |
duke@435 | 793 | protected: |
duke@435 | 794 | short* data() const { return binding()->data(); } |
duke@435 | 795 | int datalen() const { return binding()->datalen(); } |
duke@435 | 796 | int format() const { return binding()->format(); } |
duke@435 | 797 | |
duke@435 | 798 | public: |
duke@435 | 799 | virtual relocInfo::relocType type() { return relocInfo::none; } |
duke@435 | 800 | |
duke@435 | 801 | // is it a call instruction? |
duke@435 | 802 | virtual bool is_call() { return false; } |
duke@435 | 803 | |
duke@435 | 804 | // is it a data movement instruction? |
duke@435 | 805 | virtual bool is_data() { return false; } |
duke@435 | 806 | |
duke@435 | 807 | // some relocations can compute their own values |
duke@435 | 808 | virtual address value(); |
duke@435 | 809 | |
duke@435 | 810 | // all relocations are able to reassert their values |
duke@435 | 811 | virtual void set_value(address x); |
duke@435 | 812 | |
duke@435 | 813 | virtual void clear_inline_cache() { } |
duke@435 | 814 | |
duke@435 | 815 | // This method assumes that all virtual/static (inline) caches are cleared (since for static_call_type and |
duke@435 | 816 | // ic_call_type is not always posisition dependent (depending on the state of the cache)). However, this is |
duke@435 | 817 | // probably a reasonable assumption, since empty caches simplifies code reloacation. |
duke@435 | 818 | virtual void fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest) { } |
duke@435 | 819 | |
duke@435 | 820 | void print(); |
duke@435 | 821 | }; |
duke@435 | 822 | |
duke@435 | 823 | |
duke@435 | 824 | // certain inlines must be deferred until class Relocation is defined: |
duke@435 | 825 | |
duke@435 | 826 | inline RelocationHolder::RelocationHolder() { |
duke@435 | 827 | // initialize the vtbl, just to keep things type-safe |
duke@435 | 828 | new(*this) Relocation(); |
duke@435 | 829 | } |
duke@435 | 830 | |
duke@435 | 831 | |
duke@435 | 832 | inline RelocationHolder::RelocationHolder(Relocation* r) { |
duke@435 | 833 | // wordwise copy from r (ok if it copies garbage after r) |
duke@435 | 834 | for (int i = 0; i < _relocbuf_size; i++) { |
duke@435 | 835 | _relocbuf[i] = ((void**)r)[i]; |
duke@435 | 836 | } |
duke@435 | 837 | } |
duke@435 | 838 | |
duke@435 | 839 | |
duke@435 | 840 | relocInfo::relocType RelocationHolder::type() const { |
duke@435 | 841 | return reloc()->type(); |
duke@435 | 842 | } |
duke@435 | 843 | |
duke@435 | 844 | // A DataRelocation always points at a memory or load-constant instruction.. |
duke@435 | 845 | // It is absolute on most machines, and the constant is split on RISCs. |
duke@435 | 846 | // The specific subtypes are oop, external_word, and internal_word. |
duke@435 | 847 | // By convention, the "value" does not include a separately reckoned "offset". |
duke@435 | 848 | class DataRelocation : public Relocation { |
duke@435 | 849 | public: |
duke@435 | 850 | bool is_data() { return true; } |
duke@435 | 851 | |
duke@435 | 852 | // both target and offset must be computed somehow from relocation data |
duke@435 | 853 | virtual int offset() { return 0; } |
duke@435 | 854 | address value() = 0; |
duke@435 | 855 | void set_value(address x) { set_value(x, offset()); } |
duke@435 | 856 | void set_value(address x, intptr_t o) { |
duke@435 | 857 | if (addr_in_const()) |
duke@435 | 858 | *(address*)addr() = x; |
duke@435 | 859 | else |
duke@435 | 860 | pd_set_data_value(x, o); |
duke@435 | 861 | } |
duke@435 | 862 | |
duke@435 | 863 | // The "o" (displacement) argument is relevant only to split relocations |
duke@435 | 864 | // on RISC machines. In some CPUs (SPARC), the set-hi and set-lo ins'ns |
duke@435 | 865 | // can encode more than 32 bits between them. This allows compilers to |
duke@435 | 866 | // share set-hi instructions between addresses that differ by a small |
duke@435 | 867 | // offset (e.g., different static variables in the same class). |
duke@435 | 868 | // On such machines, the "x" argument to set_value on all set-lo |
duke@435 | 869 | // instructions must be the same as the "x" argument for the |
duke@435 | 870 | // corresponding set-hi instructions. The "o" arguments for the |
duke@435 | 871 | // set-hi instructions are ignored, and must not affect the high-half |
duke@435 | 872 | // immediate constant. The "o" arguments for the set-lo instructions are |
duke@435 | 873 | // added into the low-half immediate constant, and must not overflow it. |
duke@435 | 874 | }; |
duke@435 | 875 | |
duke@435 | 876 | // A CallRelocation always points at a call instruction. |
duke@435 | 877 | // It is PC-relative on most machines. |
duke@435 | 878 | class CallRelocation : public Relocation { |
duke@435 | 879 | public: |
duke@435 | 880 | bool is_call() { return true; } |
duke@435 | 881 | |
duke@435 | 882 | address destination() { return pd_call_destination(); } |
duke@435 | 883 | void set_destination(address x); // pd_set_call_destination |
duke@435 | 884 | |
duke@435 | 885 | void fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest); |
duke@435 | 886 | address value() { return destination(); } |
duke@435 | 887 | void set_value(address x) { set_destination(x); } |
duke@435 | 888 | }; |
duke@435 | 889 | |
duke@435 | 890 | class oop_Relocation : public DataRelocation { |
duke@435 | 891 | relocInfo::relocType type() { return relocInfo::oop_type; } |
duke@435 | 892 | |
duke@435 | 893 | public: |
duke@435 | 894 | // encode in one of these formats: [] [n] [n l] [Nn l] [Nn Ll] |
duke@435 | 895 | // an oop in the CodeBlob's oop pool |
duke@435 | 896 | static RelocationHolder spec(int oop_index, int offset = 0) { |
duke@435 | 897 | assert(oop_index > 0, "must be a pool-resident oop"); |
duke@435 | 898 | RelocationHolder rh = newHolder(); |
duke@435 | 899 | new(rh) oop_Relocation(oop_index, offset); |
duke@435 | 900 | return rh; |
duke@435 | 901 | } |
duke@435 | 902 | // an oop in the instruction stream |
duke@435 | 903 | static RelocationHolder spec_for_immediate() { |
duke@435 | 904 | const int oop_index = 0; |
duke@435 | 905 | const int offset = 0; // if you want an offset, use the oop pool |
duke@435 | 906 | RelocationHolder rh = newHolder(); |
duke@435 | 907 | new(rh) oop_Relocation(oop_index, offset); |
duke@435 | 908 | return rh; |
duke@435 | 909 | } |
duke@435 | 910 | |
duke@435 | 911 | private: |
duke@435 | 912 | jint _oop_index; // if > 0, index into CodeBlob::oop_at |
duke@435 | 913 | jint _offset; // byte offset to apply to the oop itself |
duke@435 | 914 | |
duke@435 | 915 | oop_Relocation(int oop_index, int offset) { |
duke@435 | 916 | _oop_index = oop_index; _offset = offset; |
duke@435 | 917 | } |
duke@435 | 918 | |
duke@435 | 919 | friend class RelocIterator; |
duke@435 | 920 | oop_Relocation() { } |
duke@435 | 921 | |
duke@435 | 922 | public: |
duke@435 | 923 | int oop_index() { return _oop_index; } |
duke@435 | 924 | int offset() { return _offset; } |
duke@435 | 925 | |
duke@435 | 926 | // data is packed in "2_ints" format: [i o] or [Ii Oo] |
duke@435 | 927 | void pack_data_to(CodeSection* dest); |
duke@435 | 928 | void unpack_data(); |
duke@435 | 929 | |
duke@435 | 930 | void fix_oop_relocation(); // reasserts oop value |
duke@435 | 931 | |
duke@435 | 932 | address value() { return (address) *oop_addr(); } |
duke@435 | 933 | |
duke@435 | 934 | bool oop_is_immediate() { return oop_index() == 0; } |
duke@435 | 935 | |
duke@435 | 936 | oop* oop_addr(); // addr or &pool[jint_data] |
duke@435 | 937 | oop oop_value(); // *oop_addr |
duke@435 | 938 | // Note: oop_value transparently converts Universe::non_oop_word to NULL. |
duke@435 | 939 | }; |
duke@435 | 940 | |
duke@435 | 941 | class virtual_call_Relocation : public CallRelocation { |
duke@435 | 942 | relocInfo::relocType type() { return relocInfo::virtual_call_type; } |
duke@435 | 943 | |
duke@435 | 944 | public: |
duke@435 | 945 | // "first_oop" points to the first associated set-oop. |
duke@435 | 946 | // The oop_limit helps find the last associated set-oop. |
duke@435 | 947 | // (See comments at the top of this file.) |
duke@435 | 948 | static RelocationHolder spec(address first_oop, address oop_limit = NULL) { |
duke@435 | 949 | RelocationHolder rh = newHolder(); |
duke@435 | 950 | new(rh) virtual_call_Relocation(first_oop, oop_limit); |
duke@435 | 951 | return rh; |
duke@435 | 952 | } |
duke@435 | 953 | |
duke@435 | 954 | virtual_call_Relocation(address first_oop, address oop_limit) { |
duke@435 | 955 | _first_oop = first_oop; _oop_limit = oop_limit; |
duke@435 | 956 | assert(first_oop != NULL, "first oop address must be specified"); |
duke@435 | 957 | } |
duke@435 | 958 | |
duke@435 | 959 | private: |
duke@435 | 960 | address _first_oop; // location of first set-oop instruction |
duke@435 | 961 | address _oop_limit; // search limit for set-oop instructions |
duke@435 | 962 | |
duke@435 | 963 | friend class RelocIterator; |
duke@435 | 964 | virtual_call_Relocation() { } |
duke@435 | 965 | |
duke@435 | 966 | |
duke@435 | 967 | public: |
duke@435 | 968 | address first_oop(); |
duke@435 | 969 | address oop_limit(); |
duke@435 | 970 | |
duke@435 | 971 | // data is packed as scaled offsets in "2_ints" format: [f l] or [Ff Ll] |
duke@435 | 972 | // oop_limit is set to 0 if the limit falls somewhere within the call. |
duke@435 | 973 | // When unpacking, a zero oop_limit is taken to refer to the end of the call. |
duke@435 | 974 | // (This has the effect of bringing in the call's delay slot on SPARC.) |
duke@435 | 975 | void pack_data_to(CodeSection* dest); |
duke@435 | 976 | void unpack_data(); |
duke@435 | 977 | |
duke@435 | 978 | void clear_inline_cache(); |
duke@435 | 979 | |
duke@435 | 980 | // Figure out where an ic_call is hiding, given a set-oop or call. |
duke@435 | 981 | // Either ic_call or first_oop must be non-null; the other is deduced. |
twisti@1918 | 982 | // Code if non-NULL must be the nmethod, else it is deduced. |
duke@435 | 983 | // The address of the patchable oop is also deduced. |
duke@435 | 984 | // The returned iterator will enumerate over the oops and the ic_call, |
duke@435 | 985 | // as well as any other relocations that happen to be in that span of code. |
duke@435 | 986 | // Recognize relevant set_oops with: oop_reloc()->oop_addr() == oop_addr. |
twisti@1918 | 987 | static RelocIterator parse_ic(nmethod* &nm, address &ic_call, address &first_oop, oop* &oop_addr, bool *is_optimized); |
duke@435 | 988 | }; |
duke@435 | 989 | |
duke@435 | 990 | |
duke@435 | 991 | class opt_virtual_call_Relocation : public CallRelocation { |
duke@435 | 992 | relocInfo::relocType type() { return relocInfo::opt_virtual_call_type; } |
duke@435 | 993 | |
duke@435 | 994 | public: |
duke@435 | 995 | static RelocationHolder spec() { |
duke@435 | 996 | RelocationHolder rh = newHolder(); |
duke@435 | 997 | new(rh) opt_virtual_call_Relocation(); |
duke@435 | 998 | return rh; |
duke@435 | 999 | } |
duke@435 | 1000 | |
duke@435 | 1001 | private: |
duke@435 | 1002 | friend class RelocIterator; |
duke@435 | 1003 | opt_virtual_call_Relocation() { } |
duke@435 | 1004 | |
duke@435 | 1005 | public: |
duke@435 | 1006 | void clear_inline_cache(); |
duke@435 | 1007 | |
duke@435 | 1008 | // find the matching static_stub |
duke@435 | 1009 | address static_stub(); |
duke@435 | 1010 | }; |
duke@435 | 1011 | |
duke@435 | 1012 | |
duke@435 | 1013 | class static_call_Relocation : public CallRelocation { |
duke@435 | 1014 | relocInfo::relocType type() { return relocInfo::static_call_type; } |
duke@435 | 1015 | |
duke@435 | 1016 | public: |
duke@435 | 1017 | static RelocationHolder spec() { |
duke@435 | 1018 | RelocationHolder rh = newHolder(); |
duke@435 | 1019 | new(rh) static_call_Relocation(); |
duke@435 | 1020 | return rh; |
duke@435 | 1021 | } |
duke@435 | 1022 | |
duke@435 | 1023 | private: |
duke@435 | 1024 | friend class RelocIterator; |
duke@435 | 1025 | static_call_Relocation() { } |
duke@435 | 1026 | |
duke@435 | 1027 | public: |
duke@435 | 1028 | void clear_inline_cache(); |
duke@435 | 1029 | |
duke@435 | 1030 | // find the matching static_stub |
duke@435 | 1031 | address static_stub(); |
duke@435 | 1032 | }; |
duke@435 | 1033 | |
duke@435 | 1034 | class static_stub_Relocation : public Relocation { |
duke@435 | 1035 | relocInfo::relocType type() { return relocInfo::static_stub_type; } |
duke@435 | 1036 | |
duke@435 | 1037 | public: |
duke@435 | 1038 | static RelocationHolder spec(address static_call) { |
duke@435 | 1039 | RelocationHolder rh = newHolder(); |
duke@435 | 1040 | new(rh) static_stub_Relocation(static_call); |
duke@435 | 1041 | return rh; |
duke@435 | 1042 | } |
duke@435 | 1043 | |
duke@435 | 1044 | private: |
duke@435 | 1045 | address _static_call; // location of corresponding static_call |
duke@435 | 1046 | |
duke@435 | 1047 | static_stub_Relocation(address static_call) { |
duke@435 | 1048 | _static_call = static_call; |
duke@435 | 1049 | } |
duke@435 | 1050 | |
duke@435 | 1051 | friend class RelocIterator; |
duke@435 | 1052 | static_stub_Relocation() { } |
duke@435 | 1053 | |
duke@435 | 1054 | public: |
duke@435 | 1055 | void clear_inline_cache(); |
duke@435 | 1056 | |
duke@435 | 1057 | address static_call() { return _static_call; } |
duke@435 | 1058 | |
duke@435 | 1059 | // data is packed as a scaled offset in "1_int" format: [c] or [Cc] |
duke@435 | 1060 | void pack_data_to(CodeSection* dest); |
duke@435 | 1061 | void unpack_data(); |
duke@435 | 1062 | }; |
duke@435 | 1063 | |
duke@435 | 1064 | class runtime_call_Relocation : public CallRelocation { |
duke@435 | 1065 | relocInfo::relocType type() { return relocInfo::runtime_call_type; } |
duke@435 | 1066 | |
duke@435 | 1067 | public: |
duke@435 | 1068 | static RelocationHolder spec() { |
duke@435 | 1069 | RelocationHolder rh = newHolder(); |
duke@435 | 1070 | new(rh) runtime_call_Relocation(); |
duke@435 | 1071 | return rh; |
duke@435 | 1072 | } |
duke@435 | 1073 | |
duke@435 | 1074 | private: |
duke@435 | 1075 | friend class RelocIterator; |
duke@435 | 1076 | runtime_call_Relocation() { } |
duke@435 | 1077 | |
duke@435 | 1078 | public: |
duke@435 | 1079 | }; |
duke@435 | 1080 | |
duke@435 | 1081 | class external_word_Relocation : public DataRelocation { |
duke@435 | 1082 | relocInfo::relocType type() { return relocInfo::external_word_type; } |
duke@435 | 1083 | |
duke@435 | 1084 | public: |
duke@435 | 1085 | static RelocationHolder spec(address target) { |
duke@435 | 1086 | assert(target != NULL, "must not be null"); |
duke@435 | 1087 | RelocationHolder rh = newHolder(); |
duke@435 | 1088 | new(rh) external_word_Relocation(target); |
duke@435 | 1089 | return rh; |
duke@435 | 1090 | } |
duke@435 | 1091 | |
duke@435 | 1092 | // Use this one where all 32/64 bits of the target live in the code stream. |
duke@435 | 1093 | // The target must be an intptr_t, and must be absolute (not relative). |
duke@435 | 1094 | static RelocationHolder spec_for_immediate() { |
duke@435 | 1095 | RelocationHolder rh = newHolder(); |
duke@435 | 1096 | new(rh) external_word_Relocation(NULL); |
duke@435 | 1097 | return rh; |
duke@435 | 1098 | } |
duke@435 | 1099 | |
duke@435 | 1100 | private: |
duke@435 | 1101 | address _target; // address in runtime |
duke@435 | 1102 | |
duke@435 | 1103 | external_word_Relocation(address target) { |
duke@435 | 1104 | _target = target; |
duke@435 | 1105 | } |
duke@435 | 1106 | |
duke@435 | 1107 | friend class RelocIterator; |
duke@435 | 1108 | external_word_Relocation() { } |
duke@435 | 1109 | |
duke@435 | 1110 | public: |
duke@435 | 1111 | // data is packed as a well-known address in "1_int" format: [a] or [Aa] |
duke@435 | 1112 | // The function runtime_address_to_index is used to turn full addresses |
duke@435 | 1113 | // to short indexes, if they are pre-registered by the stub mechanism. |
duke@435 | 1114 | // If the "a" value is 0 (i.e., _target is NULL), the address is stored |
duke@435 | 1115 | // in the code stream. See external_word_Relocation::target(). |
duke@435 | 1116 | void pack_data_to(CodeSection* dest); |
duke@435 | 1117 | void unpack_data(); |
duke@435 | 1118 | |
duke@435 | 1119 | void fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest); |
duke@435 | 1120 | address target(); // if _target==NULL, fetch addr from code stream |
duke@435 | 1121 | address value() { return target(); } |
duke@435 | 1122 | }; |
duke@435 | 1123 | |
duke@435 | 1124 | class internal_word_Relocation : public DataRelocation { |
duke@435 | 1125 | relocInfo::relocType type() { return relocInfo::internal_word_type; } |
duke@435 | 1126 | |
duke@435 | 1127 | public: |
duke@435 | 1128 | static RelocationHolder spec(address target) { |
duke@435 | 1129 | assert(target != NULL, "must not be null"); |
duke@435 | 1130 | RelocationHolder rh = newHolder(); |
duke@435 | 1131 | new(rh) internal_word_Relocation(target); |
duke@435 | 1132 | return rh; |
duke@435 | 1133 | } |
duke@435 | 1134 | |
duke@435 | 1135 | // use this one where all the bits of the target can fit in the code stream: |
duke@435 | 1136 | static RelocationHolder spec_for_immediate() { |
duke@435 | 1137 | RelocationHolder rh = newHolder(); |
duke@435 | 1138 | new(rh) internal_word_Relocation(NULL); |
duke@435 | 1139 | return rh; |
duke@435 | 1140 | } |
duke@435 | 1141 | |
duke@435 | 1142 | internal_word_Relocation(address target) { |
duke@435 | 1143 | _target = target; |
duke@435 | 1144 | _section = -1; // self-relative |
duke@435 | 1145 | } |
duke@435 | 1146 | |
duke@435 | 1147 | protected: |
duke@435 | 1148 | address _target; // address in CodeBlob |
duke@435 | 1149 | int _section; // section providing base address, if any |
duke@435 | 1150 | |
duke@435 | 1151 | friend class RelocIterator; |
duke@435 | 1152 | internal_word_Relocation() { } |
duke@435 | 1153 | |
duke@435 | 1154 | // bit-width of LSB field in packed offset, if section >= 0 |
duke@435 | 1155 | enum { section_width = 2 }; // must equal CodeBuffer::sect_bits |
duke@435 | 1156 | |
duke@435 | 1157 | public: |
duke@435 | 1158 | // data is packed as a scaled offset in "1_int" format: [o] or [Oo] |
duke@435 | 1159 | // If the "o" value is 0 (i.e., _target is NULL), the offset is stored |
duke@435 | 1160 | // in the code stream. See internal_word_Relocation::target(). |
duke@435 | 1161 | // If _section is not -1, it is appended to the low bits of the offset. |
duke@435 | 1162 | void pack_data_to(CodeSection* dest); |
duke@435 | 1163 | void unpack_data(); |
duke@435 | 1164 | |
duke@435 | 1165 | void fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest); |
duke@435 | 1166 | address target(); // if _target==NULL, fetch addr from code stream |
duke@435 | 1167 | int section() { return _section; } |
duke@435 | 1168 | address value() { return target(); } |
duke@435 | 1169 | }; |
duke@435 | 1170 | |
duke@435 | 1171 | class section_word_Relocation : public internal_word_Relocation { |
duke@435 | 1172 | relocInfo::relocType type() { return relocInfo::section_word_type; } |
duke@435 | 1173 | |
duke@435 | 1174 | public: |
duke@435 | 1175 | static RelocationHolder spec(address target, int section) { |
duke@435 | 1176 | RelocationHolder rh = newHolder(); |
duke@435 | 1177 | new(rh) section_word_Relocation(target, section); |
duke@435 | 1178 | return rh; |
duke@435 | 1179 | } |
duke@435 | 1180 | |
duke@435 | 1181 | section_word_Relocation(address target, int section) { |
duke@435 | 1182 | assert(target != NULL, "must not be null"); |
duke@435 | 1183 | assert(section >= 0, "must be a valid section"); |
duke@435 | 1184 | _target = target; |
duke@435 | 1185 | _section = section; |
duke@435 | 1186 | } |
duke@435 | 1187 | |
duke@435 | 1188 | //void pack_data_to -- inherited |
duke@435 | 1189 | void unpack_data(); |
duke@435 | 1190 | |
duke@435 | 1191 | private: |
duke@435 | 1192 | friend class RelocIterator; |
duke@435 | 1193 | section_word_Relocation() { } |
duke@435 | 1194 | }; |
duke@435 | 1195 | |
duke@435 | 1196 | |
duke@435 | 1197 | class poll_Relocation : public Relocation { |
duke@435 | 1198 | bool is_data() { return true; } |
duke@435 | 1199 | relocInfo::relocType type() { return relocInfo::poll_type; } |
never@739 | 1200 | void fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest); |
duke@435 | 1201 | }; |
duke@435 | 1202 | |
duke@435 | 1203 | class poll_return_Relocation : public Relocation { |
duke@435 | 1204 | bool is_data() { return true; } |
duke@435 | 1205 | relocInfo::relocType type() { return relocInfo::poll_return_type; } |
never@739 | 1206 | void fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest); |
duke@435 | 1207 | }; |
duke@435 | 1208 | |
duke@435 | 1209 | |
duke@435 | 1210 | class breakpoint_Relocation : public Relocation { |
duke@435 | 1211 | relocInfo::relocType type() { return relocInfo::breakpoint_type; } |
duke@435 | 1212 | |
duke@435 | 1213 | enum { |
duke@435 | 1214 | // attributes which affect the interpretation of the data: |
duke@435 | 1215 | removable_attr = 0x0010, // buffer [i...] allows for undoing the trap |
duke@435 | 1216 | internal_attr = 0x0020, // the target is an internal addr (local stub) |
duke@435 | 1217 | settable_attr = 0x0040, // the target is settable |
duke@435 | 1218 | |
duke@435 | 1219 | // states which can change over time: |
duke@435 | 1220 | enabled_state = 0x0100, // breakpoint must be active in running code |
duke@435 | 1221 | active_state = 0x0200, // breakpoint instruction actually in code |
duke@435 | 1222 | |
duke@435 | 1223 | kind_mask = 0x000F, // mask for extracting kind |
duke@435 | 1224 | high_bit = 0x4000 // extra bit which is always set |
duke@435 | 1225 | }; |
duke@435 | 1226 | |
duke@435 | 1227 | public: |
duke@435 | 1228 | enum { |
duke@435 | 1229 | // kinds: |
duke@435 | 1230 | initialization = 1, |
duke@435 | 1231 | safepoint = 2 |
duke@435 | 1232 | }; |
duke@435 | 1233 | |
duke@435 | 1234 | // If target is NULL, 32 bits are reserved for a later set_target(). |
duke@435 | 1235 | static RelocationHolder spec(int kind, address target = NULL, bool internal_target = false) { |
duke@435 | 1236 | RelocationHolder rh = newHolder(); |
duke@435 | 1237 | new(rh) breakpoint_Relocation(kind, target, internal_target); |
duke@435 | 1238 | return rh; |
duke@435 | 1239 | } |
duke@435 | 1240 | |
duke@435 | 1241 | private: |
duke@435 | 1242 | // We require every bits value to NOT to fit into relocInfo::datalen_width, |
duke@435 | 1243 | // because we are going to actually store state in the reloc, and so |
duke@435 | 1244 | // cannot allow it to be compressed (and hence copied by the iterator). |
duke@435 | 1245 | |
duke@435 | 1246 | short _bits; // bit-encoded kind, attrs, & state |
duke@435 | 1247 | address _target; |
duke@435 | 1248 | |
duke@435 | 1249 | breakpoint_Relocation(int kind, address target, bool internal_target); |
duke@435 | 1250 | |
duke@435 | 1251 | friend class RelocIterator; |
duke@435 | 1252 | breakpoint_Relocation() { } |
duke@435 | 1253 | |
duke@435 | 1254 | short bits() const { return _bits; } |
duke@435 | 1255 | short& live_bits() const { return data()[0]; } |
duke@435 | 1256 | short* instrs() const { return data() + datalen() - instrlen(); } |
duke@435 | 1257 | int instrlen() const { return removable() ? pd_breakpoint_size() : 0; } |
duke@435 | 1258 | |
duke@435 | 1259 | void set_bits(short x) { |
duke@435 | 1260 | assert(live_bits() == _bits, "must be the only mutator of reloc info"); |
duke@435 | 1261 | live_bits() = _bits = x; |
duke@435 | 1262 | } |
duke@435 | 1263 | |
duke@435 | 1264 | public: |
duke@435 | 1265 | address target() const; |
duke@435 | 1266 | void set_target(address x); |
duke@435 | 1267 | |
duke@435 | 1268 | int kind() const { return bits() & kind_mask; } |
duke@435 | 1269 | bool enabled() const { return (bits() & enabled_state) != 0; } |
duke@435 | 1270 | bool active() const { return (bits() & active_state) != 0; } |
duke@435 | 1271 | bool internal() const { return (bits() & internal_attr) != 0; } |
duke@435 | 1272 | bool removable() const { return (bits() & removable_attr) != 0; } |
duke@435 | 1273 | bool settable() const { return (bits() & settable_attr) != 0; } |
duke@435 | 1274 | |
duke@435 | 1275 | void set_enabled(bool b); // to activate, you must also say set_active |
duke@435 | 1276 | void set_active(bool b); // actually inserts bpt (must be enabled 1st) |
duke@435 | 1277 | |
duke@435 | 1278 | // data is packed as 16 bits, followed by the target (1 or 2 words), followed |
duke@435 | 1279 | // if necessary by empty storage for saving away original instruction bytes. |
duke@435 | 1280 | void pack_data_to(CodeSection* dest); |
duke@435 | 1281 | void unpack_data(); |
duke@435 | 1282 | |
duke@435 | 1283 | // during certain operations, breakpoints must be out of the way: |
duke@435 | 1284 | void fix_relocation_after_move(const CodeBuffer* src, CodeBuffer* dest) { |
duke@435 | 1285 | assert(!active(), "cannot perform relocation on enabled breakpoints"); |
duke@435 | 1286 | } |
duke@435 | 1287 | }; |
duke@435 | 1288 | |
duke@435 | 1289 | |
duke@435 | 1290 | // We know all the xxx_Relocation classes, so now we can define these: |
duke@435 | 1291 | #define EACH_CASE(name) \ |
duke@435 | 1292 | inline name##_Relocation* RelocIterator::name##_reloc() { \ |
duke@435 | 1293 | assert(type() == relocInfo::name##_type, "type must agree"); \ |
duke@435 | 1294 | /* The purpose of the placed "new" is to re-use the same */ \ |
duke@435 | 1295 | /* stack storage for each new iteration. */ \ |
duke@435 | 1296 | name##_Relocation* r = new(_rh) name##_Relocation(); \ |
duke@435 | 1297 | r->set_binding(this); \ |
duke@435 | 1298 | r->name##_Relocation::unpack_data(); \ |
duke@435 | 1299 | return r; \ |
duke@435 | 1300 | } |
duke@435 | 1301 | APPLY_TO_RELOCATIONS(EACH_CASE); |
duke@435 | 1302 | #undef EACH_CASE |
duke@435 | 1303 | |
twisti@1918 | 1304 | inline RelocIterator::RelocIterator(nmethod* nm, address begin, address limit) { |
twisti@1918 | 1305 | initialize(nm, begin, limit); |
duke@435 | 1306 | } |
duke@435 | 1307 | |
duke@435 | 1308 | // if you are going to patch code, you should use this subclass of |
duke@435 | 1309 | // RelocIterator |
duke@435 | 1310 | class PatchingRelocIterator : public RelocIterator { |
duke@435 | 1311 | private: |
duke@435 | 1312 | RelocIterator _init_state; |
duke@435 | 1313 | |
duke@435 | 1314 | void prepass(); // deactivates all breakpoints |
duke@435 | 1315 | void postpass(); // reactivates all enabled breakpoints |
duke@435 | 1316 | |
duke@435 | 1317 | // do not copy these puppies; it would have unpredictable side effects |
duke@435 | 1318 | // these are private and have no bodies defined because they should not be called |
duke@435 | 1319 | PatchingRelocIterator(const RelocIterator&); |
duke@435 | 1320 | void operator=(const RelocIterator&); |
duke@435 | 1321 | |
duke@435 | 1322 | public: |
twisti@1918 | 1323 | PatchingRelocIterator(nmethod* nm, address begin = NULL, address limit = NULL) |
twisti@1918 | 1324 | : RelocIterator(nm, begin, limit) { prepass(); } |
duke@435 | 1325 | |
duke@435 | 1326 | ~PatchingRelocIterator() { postpass(); } |
duke@435 | 1327 | }; |