Lines Matching refs:to
16 * 2 along with this work; if not, write to the Free Software Foundation,
157 // If they do not match we jump to slow case.
171 // 3. Jump to the continuation address in compiled code to resume execution.
196 // I0: pointer to osr buffer
241 // Get a pointer to the first character of string0 in tmp0
243 // Get a pointer to the first character of string1 in tmp1
318 // Shift base0 and base1 to the end of the arrays, negate limit
334 // If strings are equal up to min length, return the length difference.
353 // compute pointer to BasicLock
367 // try inlined fast unlocking first, revert to slow locking if it fails
368 // note: lock_reg points to the displaced header since the displaced header offset is 0!
369 assert(BasicLock::displaced_header_offset_in_bytes() == 0, "lock_reg must point to the displaced header");
387 // if the last instruction is a call (typically to do a throw which
389 // must still point into the code area in order to avoid assertion
417 // Emit the code to remove the frame from the stack in the exception
459 // dispatch to the unwind logic
473 // if the last instruction is a call (typically to do a throw which
475 // must still point into the code area in order to avoid assertion
512 // Allocate a new index in oop table to hold the oop once it's been patched
518 // It may not seem necessary to use a sethi/add pair to load a NULL into dest, but the
699 // result must be 0 if value is NaN; test by comparing value to itself
707 // move integer result from float register to int register
1303 Address to = frame_map()->address_for_slot(dest->single_stack_ix());
1305 __ stw(tmp, to.base(), to.disp());
1311 Address to = frame_map()->address_for_slot(dest->single_stack_ix());
1313 __ st_ptr(tmp, to.base(), to.disp());
1320 Address to = frame_map()->address_for_double_slot(dest->double_stack_ix());
1322 __ stw(tmp, to.base(), to.disp());
1324 __ stw(tmp, to.base(), to.disp() + 4);
1387 // before the call to add_debug_info, otherwise the PcDescs don't get
1454 // double to double moves
1458 // float to float moves
1471 // long to long moves
1477 // int to int moves
1481 // int to int moves
1533 // before the call to add_debug_info_for_null_check, otherwise the PcDescs don't get
1557 // Must move the result to G1
1604 // must be set to -1 at code generation time
2179 // We don't need decode because we just need to compare
2209 // src is not a sub class of dst so we have to do a
2219 assert(flags & mask, "one of the two should be known to be an object array");
2574 // that the ld can use simm13s to reference the slots of the data
2668 // Fall through to success case
2715 // check if it needs to be profiled
2763 // fall through to the success case
2833 // overwritten with the original value in "addr" and will be equal to t1.
2842 __ or3(t2, new_value_lo, t2); // t2 holds 64-bit value to swap
2846 // overwritten with the original value in "addr" and will be equal to t1.
2907 // compute pointer to BasicLock
2926 assert(BasicLock::displaced_header_offset_in_bytes() == 0, "lock_reg must point to the displaced header");
2945 assert(BasicLock::displaced_header_offset_in_bytes() == 0, "lock_reg must point to the displaced header");
2986 // that the ld can use simm13s to reference the slots of the data
3007 // statically update the methodDataOop rather than needing to do
3010 // NOTE: we should probably put a lock around this search to
3030 // always does a write to the receiver part of the
3052 // Increment total counter to indicate polymorphic case.
3075 // so we can use _masm instead of _masm->delayed() to do the
3171 // (extended to allow indexed as well as constant displaced for JSR-166)
3241 // special handling to remain atomic.
3328 // we'd like to be able to pull following instructions into
3329 // this slot but we don't know enough to do it safely yet so
3330 // only optimize block to block control flow.
3386 // fixup the return value from G1 to O0/O1 for long returns.