Thu, 27 May 2010 19:08:38 -0700
6941466: Oracle rebranding changes for Hotspot repositories
Summary: Change all the Sun copyrights to Oracle copyright
Reviewed-by: ohair
duke@435 | 1 | /* |
trims@1907 | 2 | * Copyright (c) 1997, 2009, 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 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_assembler.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | |
duke@435 | 29 | // Implementation of AbstractAssembler |
duke@435 | 30 | // |
duke@435 | 31 | // The AbstractAssembler is generating code into a CodeBuffer. To make code generation faster, |
duke@435 | 32 | // the assembler keeps a copy of the code buffers boundaries & modifies them when |
duke@435 | 33 | // emitting bytes rather than using the code buffers accessor functions all the time. |
twisti@1040 | 34 | // The code buffer is updated via set_code_end(...) after emitting a whole instruction. |
duke@435 | 35 | |
duke@435 | 36 | AbstractAssembler::AbstractAssembler(CodeBuffer* code) { |
duke@435 | 37 | if (code == NULL) return; |
duke@435 | 38 | CodeSection* cs = code->insts(); |
duke@435 | 39 | cs->clear_mark(); // new assembler kills old mark |
duke@435 | 40 | _code_section = cs; |
duke@435 | 41 | _code_begin = cs->start(); |
duke@435 | 42 | _code_limit = cs->limit(); |
duke@435 | 43 | _code_pos = cs->end(); |
duke@435 | 44 | _oop_recorder= code->oop_recorder(); |
duke@435 | 45 | if (_code_begin == NULL) { |
jcoomes@1845 | 46 | vm_exit_out_of_memory(0, err_msg("CodeCache: no room for %s", |
jcoomes@1845 | 47 | code->name())); |
duke@435 | 48 | } |
duke@435 | 49 | } |
duke@435 | 50 | |
duke@435 | 51 | void AbstractAssembler::set_code_section(CodeSection* cs) { |
duke@435 | 52 | assert(cs->outer() == code_section()->outer(), "sanity"); |
duke@435 | 53 | assert(cs->is_allocated(), "need to pre-allocate this section"); |
duke@435 | 54 | cs->clear_mark(); // new assembly into this section kills old mark |
duke@435 | 55 | _code_section = cs; |
duke@435 | 56 | _code_begin = cs->start(); |
duke@435 | 57 | _code_limit = cs->limit(); |
duke@435 | 58 | _code_pos = cs->end(); |
duke@435 | 59 | } |
duke@435 | 60 | |
duke@435 | 61 | // Inform CodeBuffer that incoming code and relocation will be for stubs |
duke@435 | 62 | address AbstractAssembler::start_a_stub(int required_space) { |
duke@435 | 63 | CodeBuffer* cb = code(); |
duke@435 | 64 | CodeSection* cs = cb->stubs(); |
duke@435 | 65 | assert(_code_section == cb->insts(), "not in insts?"); |
duke@435 | 66 | sync(); |
duke@435 | 67 | if (cs->maybe_expand_to_ensure_remaining(required_space) |
duke@435 | 68 | && cb->blob() == NULL) { |
duke@435 | 69 | return NULL; |
duke@435 | 70 | } |
duke@435 | 71 | set_code_section(cs); |
duke@435 | 72 | return pc(); |
duke@435 | 73 | } |
duke@435 | 74 | |
duke@435 | 75 | // Inform CodeBuffer that incoming code and relocation will be code |
duke@435 | 76 | // Should not be called if start_a_stub() returned NULL |
duke@435 | 77 | void AbstractAssembler::end_a_stub() { |
duke@435 | 78 | assert(_code_section == code()->stubs(), "not in stubs?"); |
duke@435 | 79 | sync(); |
duke@435 | 80 | set_code_section(code()->insts()); |
duke@435 | 81 | } |
duke@435 | 82 | |
duke@435 | 83 | // Inform CodeBuffer that incoming code and relocation will be for stubs |
duke@435 | 84 | address AbstractAssembler::start_a_const(int required_space, int required_align) { |
duke@435 | 85 | CodeBuffer* cb = code(); |
duke@435 | 86 | CodeSection* cs = cb->consts(); |
duke@435 | 87 | assert(_code_section == cb->insts(), "not in insts?"); |
duke@435 | 88 | sync(); |
duke@435 | 89 | address end = cs->end(); |
duke@435 | 90 | int pad = -(intptr_t)end & (required_align-1); |
duke@435 | 91 | if (cs->maybe_expand_to_ensure_remaining(pad + required_space)) { |
duke@435 | 92 | if (cb->blob() == NULL) return NULL; |
duke@435 | 93 | end = cs->end(); // refresh pointer |
duke@435 | 94 | } |
duke@435 | 95 | if (pad > 0) { |
duke@435 | 96 | while (--pad >= 0) { *end++ = 0; } |
duke@435 | 97 | cs->set_end(end); |
duke@435 | 98 | } |
duke@435 | 99 | set_code_section(cs); |
duke@435 | 100 | return end; |
duke@435 | 101 | } |
duke@435 | 102 | |
duke@435 | 103 | // Inform CodeBuffer that incoming code and relocation will be code |
duke@435 | 104 | // Should not be called if start_a_const() returned NULL |
duke@435 | 105 | void AbstractAssembler::end_a_const() { |
duke@435 | 106 | assert(_code_section == code()->consts(), "not in consts?"); |
duke@435 | 107 | sync(); |
duke@435 | 108 | set_code_section(code()->insts()); |
duke@435 | 109 | } |
duke@435 | 110 | |
duke@435 | 111 | |
duke@435 | 112 | void AbstractAssembler::flush() { |
duke@435 | 113 | sync(); |
duke@435 | 114 | ICache::invalidate_range(addr_at(0), offset()); |
duke@435 | 115 | } |
duke@435 | 116 | |
duke@435 | 117 | |
duke@435 | 118 | void AbstractAssembler::a_byte(int x) { |
duke@435 | 119 | emit_byte(x); |
duke@435 | 120 | } |
duke@435 | 121 | |
duke@435 | 122 | |
duke@435 | 123 | void AbstractAssembler::a_long(jint x) { |
duke@435 | 124 | emit_long(x); |
duke@435 | 125 | } |
duke@435 | 126 | |
duke@435 | 127 | // Labels refer to positions in the (to be) generated code. There are bound |
duke@435 | 128 | // and unbound |
duke@435 | 129 | // |
duke@435 | 130 | // Bound labels refer to known positions in the already generated code. |
duke@435 | 131 | // offset() is the position the label refers to. |
duke@435 | 132 | // |
duke@435 | 133 | // Unbound labels refer to unknown positions in the code to be generated; it |
duke@435 | 134 | // may contain a list of unresolved displacements that refer to it |
duke@435 | 135 | #ifndef PRODUCT |
duke@435 | 136 | void AbstractAssembler::print(Label& L) { |
duke@435 | 137 | if (L.is_bound()) { |
duke@435 | 138 | tty->print_cr("bound label to %d|%d", L.loc_pos(), L.loc_sect()); |
duke@435 | 139 | } else if (L.is_unbound()) { |
duke@435 | 140 | L.print_instructions((MacroAssembler*)this); |
duke@435 | 141 | } else { |
duke@435 | 142 | tty->print_cr("label in inconsistent state (loc = %d)", L.loc()); |
duke@435 | 143 | } |
duke@435 | 144 | } |
duke@435 | 145 | #endif // PRODUCT |
duke@435 | 146 | |
duke@435 | 147 | |
duke@435 | 148 | void AbstractAssembler::bind(Label& L) { |
duke@435 | 149 | if (L.is_bound()) { |
duke@435 | 150 | // Assembler can bind a label more than once to the same place. |
duke@435 | 151 | guarantee(L.loc() == locator(), "attempt to redefine label"); |
duke@435 | 152 | return; |
duke@435 | 153 | } |
duke@435 | 154 | L.bind_loc(locator()); |
duke@435 | 155 | L.patch_instructions((MacroAssembler*)this); |
duke@435 | 156 | } |
duke@435 | 157 | |
duke@435 | 158 | void AbstractAssembler::generate_stack_overflow_check( int frame_size_in_bytes) { |
duke@435 | 159 | if (UseStackBanging) { |
duke@435 | 160 | // Each code entry causes one stack bang n pages down the stack where n |
duke@435 | 161 | // is configurable by StackBangPages. The setting depends on the maximum |
duke@435 | 162 | // depth of VM call stack or native before going back into java code, |
duke@435 | 163 | // since only java code can raise a stack overflow exception using the |
duke@435 | 164 | // stack banging mechanism. The VM and native code does not detect stack |
duke@435 | 165 | // overflow. |
duke@435 | 166 | // The code in JavaCalls::call() checks that there is at least n pages |
duke@435 | 167 | // available, so all entry code needs to do is bang once for the end of |
duke@435 | 168 | // this shadow zone. |
duke@435 | 169 | // The entry code may need to bang additional pages if the framesize |
duke@435 | 170 | // is greater than a page. |
duke@435 | 171 | |
duke@435 | 172 | const int page_size = os::vm_page_size(); |
duke@435 | 173 | int bang_end = StackShadowPages*page_size; |
duke@435 | 174 | |
duke@435 | 175 | // This is how far the previous frame's stack banging extended. |
duke@435 | 176 | const int bang_end_safe = bang_end; |
duke@435 | 177 | |
duke@435 | 178 | if (frame_size_in_bytes > page_size) { |
duke@435 | 179 | bang_end += frame_size_in_bytes; |
duke@435 | 180 | } |
duke@435 | 181 | |
duke@435 | 182 | int bang_offset = bang_end_safe; |
duke@435 | 183 | while (bang_offset <= bang_end) { |
duke@435 | 184 | // Need at least one stack bang at end of shadow zone. |
duke@435 | 185 | bang_stack_with_offset(bang_offset); |
duke@435 | 186 | bang_offset += page_size; |
duke@435 | 187 | } |
duke@435 | 188 | } // end (UseStackBanging) |
duke@435 | 189 | } |
duke@435 | 190 | |
duke@435 | 191 | void Label::add_patch_at(CodeBuffer* cb, int branch_loc) { |
duke@435 | 192 | assert(_loc == -1, "Label is unbound"); |
duke@435 | 193 | if (_patch_index < PatchCacheSize) { |
duke@435 | 194 | _patches[_patch_index] = branch_loc; |
duke@435 | 195 | } else { |
duke@435 | 196 | if (_patch_overflow == NULL) { |
duke@435 | 197 | _patch_overflow = cb->create_patch_overflow(); |
duke@435 | 198 | } |
duke@435 | 199 | _patch_overflow->push(branch_loc); |
duke@435 | 200 | } |
duke@435 | 201 | ++_patch_index; |
duke@435 | 202 | } |
duke@435 | 203 | |
duke@435 | 204 | void Label::patch_instructions(MacroAssembler* masm) { |
duke@435 | 205 | assert(is_bound(), "Label is bound"); |
duke@435 | 206 | CodeBuffer* cb = masm->code(); |
duke@435 | 207 | int target_sect = CodeBuffer::locator_sect(loc()); |
duke@435 | 208 | address target = cb->locator_address(loc()); |
duke@435 | 209 | while (_patch_index > 0) { |
duke@435 | 210 | --_patch_index; |
duke@435 | 211 | int branch_loc; |
duke@435 | 212 | if (_patch_index >= PatchCacheSize) { |
duke@435 | 213 | branch_loc = _patch_overflow->pop(); |
duke@435 | 214 | } else { |
duke@435 | 215 | branch_loc = _patches[_patch_index]; |
duke@435 | 216 | } |
duke@435 | 217 | int branch_sect = CodeBuffer::locator_sect(branch_loc); |
duke@435 | 218 | address branch = cb->locator_address(branch_loc); |
duke@435 | 219 | if (branch_sect == CodeBuffer::SECT_CONSTS) { |
duke@435 | 220 | // The thing to patch is a constant word. |
duke@435 | 221 | *(address*)branch = target; |
duke@435 | 222 | continue; |
duke@435 | 223 | } |
duke@435 | 224 | |
duke@435 | 225 | #ifdef ASSERT |
duke@435 | 226 | // Cross-section branches only work if the |
duke@435 | 227 | // intermediate section boundaries are frozen. |
duke@435 | 228 | if (target_sect != branch_sect) { |
duke@435 | 229 | for (int n = MIN2(target_sect, branch_sect), |
duke@435 | 230 | nlimit = (target_sect + branch_sect) - n; |
duke@435 | 231 | n < nlimit; n++) { |
duke@435 | 232 | CodeSection* cs = cb->code_section(n); |
duke@435 | 233 | assert(cs->is_frozen(), "cross-section branch needs stable offsets"); |
duke@435 | 234 | } |
duke@435 | 235 | } |
duke@435 | 236 | #endif //ASSERT |
duke@435 | 237 | |
duke@435 | 238 | // Push the target offset into the branch instruction. |
duke@435 | 239 | masm->pd_patch_instruction(branch, target); |
duke@435 | 240 | } |
duke@435 | 241 | } |
duke@435 | 242 | |
jrose@1057 | 243 | struct DelayedConstant { |
jrose@1057 | 244 | typedef void (*value_fn_t)(); |
jrose@1057 | 245 | BasicType type; |
jrose@1057 | 246 | intptr_t value; |
jrose@1057 | 247 | value_fn_t value_fn; |
jrose@1057 | 248 | // This limit of 20 is generous for initial uses. |
jrose@1057 | 249 | // The limit needs to be large enough to store the field offsets |
jrose@1057 | 250 | // into classes which do not have statically fixed layouts. |
jrose@1057 | 251 | // (Initial use is for method handle object offsets.) |
jrose@1057 | 252 | // Look for uses of "delayed_value" in the source code |
jrose@1057 | 253 | // and make sure this number is generous enough to handle all of them. |
jrose@1057 | 254 | enum { DC_LIMIT = 20 }; |
jrose@1057 | 255 | static DelayedConstant delayed_constants[DC_LIMIT]; |
jrose@1057 | 256 | static DelayedConstant* add(BasicType type, value_fn_t value_fn); |
jrose@1057 | 257 | bool match(BasicType t, value_fn_t cfn) { |
jrose@1057 | 258 | return type == t && value_fn == cfn; |
jrose@1057 | 259 | } |
jrose@1057 | 260 | static void update_all(); |
jrose@1057 | 261 | }; |
jrose@1057 | 262 | |
jrose@1057 | 263 | DelayedConstant DelayedConstant::delayed_constants[DC_LIMIT]; |
jrose@1057 | 264 | // Default C structure initialization rules have the following effect here: |
jrose@1057 | 265 | // = { { (BasicType)0, (intptr_t)NULL }, ... }; |
jrose@1057 | 266 | |
jrose@1057 | 267 | DelayedConstant* DelayedConstant::add(BasicType type, |
jrose@1057 | 268 | DelayedConstant::value_fn_t cfn) { |
jrose@1057 | 269 | for (int i = 0; i < DC_LIMIT; i++) { |
jrose@1057 | 270 | DelayedConstant* dcon = &delayed_constants[i]; |
jrose@1057 | 271 | if (dcon->match(type, cfn)) |
jrose@1057 | 272 | return dcon; |
jrose@1057 | 273 | if (dcon->value_fn == NULL) { |
jrose@1057 | 274 | // (cmpxchg not because this is multi-threaded but because I'm paranoid) |
jrose@1057 | 275 | if (Atomic::cmpxchg_ptr(CAST_FROM_FN_PTR(void*, cfn), &dcon->value_fn, NULL) == NULL) { |
jrose@1057 | 276 | dcon->type = type; |
jrose@1057 | 277 | return dcon; |
jrose@1057 | 278 | } |
jrose@1057 | 279 | } |
jrose@1057 | 280 | } |
jrose@1057 | 281 | // If this assert is hit (in pre-integration testing!) then re-evaluate |
jrose@1057 | 282 | // the comment on the definition of DC_LIMIT. |
jrose@1057 | 283 | guarantee(false, "too many delayed constants"); |
jrose@1057 | 284 | return NULL; |
jrose@1057 | 285 | } |
jrose@1057 | 286 | |
jrose@1057 | 287 | void DelayedConstant::update_all() { |
jrose@1057 | 288 | for (int i = 0; i < DC_LIMIT; i++) { |
jrose@1057 | 289 | DelayedConstant* dcon = &delayed_constants[i]; |
jrose@1057 | 290 | if (dcon->value_fn != NULL && dcon->value == 0) { |
jrose@1057 | 291 | typedef int (*int_fn_t)(); |
jrose@1057 | 292 | typedef address (*address_fn_t)(); |
jrose@1057 | 293 | switch (dcon->type) { |
jrose@1057 | 294 | case T_INT: dcon->value = (intptr_t) ((int_fn_t) dcon->value_fn)(); break; |
jrose@1057 | 295 | case T_ADDRESS: dcon->value = (intptr_t) ((address_fn_t)dcon->value_fn)(); break; |
jrose@1057 | 296 | } |
jrose@1057 | 297 | } |
jrose@1057 | 298 | } |
jrose@1057 | 299 | } |
jrose@1057 | 300 | |
jrose@1057 | 301 | intptr_t* AbstractAssembler::delayed_value_addr(int(*value_fn)()) { |
jrose@1057 | 302 | DelayedConstant* dcon = DelayedConstant::add(T_INT, (DelayedConstant::value_fn_t) value_fn); |
jrose@1057 | 303 | return &dcon->value; |
jrose@1057 | 304 | } |
jrose@1057 | 305 | intptr_t* AbstractAssembler::delayed_value_addr(address(*value_fn)()) { |
jrose@1057 | 306 | DelayedConstant* dcon = DelayedConstant::add(T_ADDRESS, (DelayedConstant::value_fn_t) value_fn); |
jrose@1057 | 307 | return &dcon->value; |
jrose@1057 | 308 | } |
jrose@1057 | 309 | void AbstractAssembler::update_delayed_values() { |
jrose@1057 | 310 | DelayedConstant::update_all(); |
jrose@1057 | 311 | } |
jrose@1057 | 312 | |
jrose@1057 | 313 | |
jrose@1057 | 314 | |
duke@435 | 315 | |
duke@435 | 316 | void AbstractAssembler::block_comment(const char* comment) { |
duke@435 | 317 | if (sect() == CodeBuffer::SECT_INSTS) { |
duke@435 | 318 | code_section()->outer()->block_comment(offset(), comment); |
duke@435 | 319 | } |
duke@435 | 320 | } |
duke@435 | 321 | |
coleenp@672 | 322 | bool MacroAssembler::needs_explicit_null_check(intptr_t offset) { |
coleenp@672 | 323 | // Exception handler checks the nmethod's implicit null checks table |
coleenp@672 | 324 | // only when this method returns false. |
kvn@1077 | 325 | #ifdef _LP64 |
kvn@1077 | 326 | if (UseCompressedOops && Universe::narrow_oop_base() != NULL) { |
kvn@1077 | 327 | assert (Universe::heap() != NULL, "java heap should be initialized"); |
coleenp@672 | 328 | // The first page after heap_base is unmapped and |
coleenp@672 | 329 | // the 'offset' is equal to [heap_base + offset] for |
coleenp@672 | 330 | // narrow oop implicit null checks. |
kvn@1077 | 331 | uintptr_t base = (uintptr_t)Universe::narrow_oop_base(); |
kvn@1077 | 332 | if ((uintptr_t)offset >= base) { |
coleenp@672 | 333 | // Normalize offset for the next check. |
kvn@1077 | 334 | offset = (intptr_t)(pointer_delta((void*)offset, (void*)base, 1)); |
coleenp@672 | 335 | } |
coleenp@672 | 336 | } |
kvn@1077 | 337 | #endif |
coleenp@672 | 338 | return offset < 0 || os::vm_page_size() <= offset; |
coleenp@672 | 339 | } |
duke@435 | 340 | |
duke@435 | 341 | #ifndef PRODUCT |
duke@435 | 342 | void Label::print_instructions(MacroAssembler* masm) const { |
duke@435 | 343 | CodeBuffer* cb = masm->code(); |
duke@435 | 344 | for (int i = 0; i < _patch_index; ++i) { |
duke@435 | 345 | int branch_loc; |
duke@435 | 346 | if (i >= PatchCacheSize) { |
duke@435 | 347 | branch_loc = _patch_overflow->at(i - PatchCacheSize); |
duke@435 | 348 | } else { |
duke@435 | 349 | branch_loc = _patches[i]; |
duke@435 | 350 | } |
duke@435 | 351 | int branch_pos = CodeBuffer::locator_pos(branch_loc); |
duke@435 | 352 | int branch_sect = CodeBuffer::locator_sect(branch_loc); |
duke@435 | 353 | address branch = cb->locator_address(branch_loc); |
duke@435 | 354 | tty->print_cr("unbound label"); |
duke@435 | 355 | tty->print("@ %d|%d ", branch_pos, branch_sect); |
duke@435 | 356 | if (branch_sect == CodeBuffer::SECT_CONSTS) { |
duke@435 | 357 | tty->print_cr(PTR_FORMAT, *(address*)branch); |
duke@435 | 358 | continue; |
duke@435 | 359 | } |
duke@435 | 360 | masm->pd_print_patched_instruction(branch); |
duke@435 | 361 | tty->cr(); |
duke@435 | 362 | } |
duke@435 | 363 | } |
duke@435 | 364 | #endif // ndef PRODUCT |