Lines Matching defs:to

16  * 2 along with this work; if not, write to the Free Software Foundation,
162 // If they do not match we jump to slow case.
176 // 3. Jump to the continuation address in compiled code to resume execution.
201 // I0: pointer to osr buffer
246 // compute pointer to BasicLock
260 // try inlined fast unlocking first, revert to slow locking if it fails
261 // note: lock_reg points to the displaced header since the displaced header offset is 0!
262 assert(BasicLock::displaced_header_offset_in_bytes() == 0, "lock_reg must point to the displaced header");
280 // if the last instruction is a call (typically to do a throw which
282 // must still point into the code area in order to avoid assertion
310 // Emit the code to remove the frame from the stack in the exception
343 __ save_thread(I1); // need to preserve thread in G2 across
355 // dispatch to the unwind logic
369 // if the last instruction is a call (typically to do a throw which
371 // must still point into the code area in order to avoid assertion
409 // Allocate a new index in table to hold the object once it's been patched
415 // It may not seem necessary to use a sethi/add pair to load a NULL into dest, but the
429 // Allocate a new index in table to hold the klass once it's been patched
434 // It may not seem necessary to use a sethi/add pair to load a NULL into dest, but the
621 // result must be 0 if value is NaN; test by comparing value to itself
626 // move integer result from float register to int register
729 // Don't use O7 here because it may be equal to 'base' (see LIR_Assembler::reg2mem)
1194 Address to = frame_map()->address_for_slot(dest->single_stack_ix());
1196 __ stw(tmp, to.base(), to.disp());
1202 Address to = frame_map()->address_for_slot(dest->single_stack_ix());
1204 __ st_ptr(tmp, to.base(), to.disp());
1211 Address to = frame_map()->address_for_double_slot(dest->double_stack_ix());
1213 __ stw(tmp, to.base(), to.disp());
1215 __ stw(tmp, to.base(), to.disp() + 4);
1279 // before the call to add_debug_info, otherwise the PcDescs don't get
1326 // double to double moves
1330 // float to float moves
1338 // int to int moves
1341 // int to int moves
1394 // before the call to add_debug_info_for_null_check, otherwise the PcDescs don't get
1450 // must be set to -1 at code generation time
1907 // If the compiler was not able to prove that exact type of the source or the destination
1969 // We don't need decode because we just need to compare
1999 // src is not a sub class of dst so we have to do a
2009 assert(flags & mask, "one of the two should be known to be an object array");
2351 // that the ld can use simm13s to reference the slots of the data
2445 // Fall through to success case
2492 // check if it needs to be profiled
2540 // fall through to the success case
2609 // overwritten with the original value in "addr" and will be equal to t1.
2666 // compute pointer to BasicLock
2704 assert(BasicLock::displaced_header_offset_in_bytes() == 0, "lock_reg must point to the displaced header");
2723 assert(BasicLock::displaced_header_offset_in_bytes() == 0, "lock_reg must point to the displaced header");
2759 // that the ld can use simm13s to reference the slots of the data
2780 // statically update the MethodData* rather than needing to do
2783 // NOTE: we should probably put a lock around this search to
2803 // always does a write to the receiver part of the
2825 // Increment total counter to indicate polymorphic case.
2909 // klass seen before, nothing to do. The unknown bit may have been
2910 // set already but no need to check.
2915 // already unknown. Nothing to do anymore.
2931 // already unknown. Nothing to do anymore.
2968 // already unknown. Nothing to do anymore.
2990 // so we can use _masm instead of _masm->delayed() to do the
3079 // (extended to allow indexed as well as constant displaced for JSR-166)
3127 // special handling to remain atomic.
3274 // we'd like to be able to pull following instructions into
3275 // this slot but we don't know enough to do it safely yet so
3276 // only optimize block to block control flow.