Lines Matching defs:L1_scratch
145 // Result goes to address in L1_scratch
150 // stack. This is relatively simple the destination is in L1_scratch
151 // i.e. L1_scratch is the first free element on the stack. If we "push" a return value we must
152 // adjust L1_scratch
159 __ st(O0, L1_scratch, 0);
160 __ sub(L1_scratch, wordSize, L1_scratch);
167 __ st(O0, L1_scratch, 0);
168 __ sub(L1_scratch, wordSize, L1_scratch);
174 __ st(O0, L1_scratch, 0);
175 __ sub(L1_scratch, wordSize, L1_scratch);
181 __ st(O0, L1_scratch, 0);
182 __ sub(L1_scratch, wordSize, L1_scratch);
195 __ stx(G1, L1_scratch, -wordSize);
198 __ st(O1, L1_scratch, 0); // Low order
199 __ st(O0, L1_scratch, -wordSize); // High order
202 __ stx(O0, L1_scratch, -wordSize);
204 __ sub(L1_scratch, 2*wordSize, L1_scratch);
208 __ st(O0, L1_scratch, 0);
209 __ sub(L1_scratch, wordSize, L1_scratch);
216 __ stf(FloatRegisterImpl::S, F0, L1_scratch, 0);
217 __ sub(L1_scratch, wordSize, L1_scratch);
223 __ stf(FloatRegisterImpl::D, F0, L1_scratch, -wordSize);
224 __ sub(L1_scratch, 2*wordSize, L1_scratch);
228 __ st_ptr(O0, L1_scratch, 0);
229 __ sub(L1_scratch, wordSize, L1_scratch);
1372 __ ld_ptr(STATE(_stack), L1_scratch); // get top of java expr stack
1380 // L1_scratch points to top of stack (prepushed)
1381 __ st_ptr(L1_scratch, STATE(_stack));
1401 __ ld_ptr(STATE(_stack), L1_scratch); // Get current stack top
1402 __ sub(L1_scratch, entry_size, L1_scratch);
1403 __ st_ptr(L1_scratch, STATE(_stack));
1405 __ delayed()->add(L1_scratch, wordSize, L1_scratch); // first real entry (undo prepush)
1410 __ st_ptr(L3_scratch, Address(L1_scratch, 0));
1411 __ add(L1_scratch, wordSize, L1_scratch);
1413 __ cmp(L1_scratch, L4_scratch);
1415 __ delayed()->ld_ptr(L1_scratch, entry_size, L3_scratch);
1629 __ ld(STATE(_msg), L1_scratch); // Get new message
1638 __ cmp(L1_scratch, (int)BytecodeInterpreter::call_method);
1640 __ delayed()->cmp(L1_scratch, (int)BytecodeInterpreter::return_from_method);
1642 __ delayed()->cmp(L1_scratch, (int)BytecodeInterpreter::throwing_exception);
1644 __ delayed()->cmp(L1_scratch, (int)BytecodeInterpreter::do_osr);
1646 __ delayed()->cmp(L1_scratch, (int)BytecodeInterpreter::more_monitors);
1655 __ set((int)BytecodeInterpreter::got_monitors, L1_scratch);
1658 __ delayed()->st(L1_scratch, STATE(_msg));
1680 __ set((int)BytecodeInterpreter::deopt_resume, L1_scratch);
1682 __ delayed()->st(L1_scratch, STATE(_msg));
1754 __ ld_ptr(STATE(_stack), L1_scratch); // get top of java expr stack
1757 __ add(L1_scratch, L2_scratch, L1_scratch); // stack destination for result
1767 // L1_scratch points to top of stack (prepushed)
1770 __ delayed()->mov(L1_scratch, O1);
1800 __ ld_ptr(STATE(_prev_link), L1_scratch);
1803 __ tst(L1_scratch);
1856 __ set((int)BytecodeInterpreter::method_resume, L1_scratch);
1857 __ st(L1_scratch, STATE(_msg));
1910 __ ld_ptr(STATE(_prev_link), L1_scratch);
1916 __ tst(L1_scratch);
1963 __ ld_ptr(STATE(_stack_limit), L1_scratch);
1966 __ sub(Gargs, L1_scratch, L2_scratch); // compute unused space
1981 __ sub(Gargs, SP, L1_scratch);
1982 __ cmp(L1_scratch, 16*wordSize);
2008 __ set((intptr_t) entry_point, L1_scratch);
2009 __ cmp(L1_scratch, L2_scratch);
2032 __ ld_ptr(STATE(_prev_link), L1_scratch);
2033 __ tst(L1_scratch);