Lines Matching refs:stack
244 #define UPDATE_PC_AND_TOS(opsize, stack) \
245 {pc += opsize; MORE_STACK(stack); }
254 #define UPDATE_PC_AND_TOS_AND_CONTINUE(opsize, stack) { \
255 pc += opsize; opcode = *pc; MORE_STACK(stack); \
269 #define UPDATE_PC_AND_TOS_AND_CONTINUE(opsize, stack) { \
270 pc += opsize; opcode = *pc; MORE_STACK(stack); \
283 #define UPDATE_PC_AND_TOS_AND_CONTINUE(opsize, stack) { \
284 pc += opsize; MORE_STACK(stack); \
366 #define CACHE_TOS() topOfStack = (intptr_t *)istate->stack();
467 assert(abs(istate->_stack_base - istate->_stack_limit) == (istate->_method->max_stack() + 1), "bad stack limit");
478 // Screwups with stack management usually cause us to overwrite istate
485 register intptr_t* topOfStack = (intptr_t *)istate->stack(); /* access with STACK macros */
597 /* QQQ this should be a stack method so we don't know actual direction */
773 // entry/exit events are sent for that thread to track stack depth.
830 // Returned from an opcode that has completed. The stack has
852 // we expect to find newly allocated monitor at the "top" of the monitor stack.
902 /* QQQ Hmm this has knowledge of direction, ought to be a stack method */
915 /* Push miscellaneous constants onto the stack. */
952 /* Push a 1-byte signed integer value onto the stack. */
957 /* Push a 2-byte signed integer constant onto the stack. */
1109 /* stack pop, dup, and insert opcodes */
1112 CASE(_pop): /* Discard the top item on the stack */
1116 CASE(_pop2): /* Discard the top 2 items on the stack */
1120 CASE(_dup): /* Duplicate the top item on the stack */
1124 CASE(_dup2): /* Duplicate the top 2 items on the stack */
1144 CASE(_swap): { /* swap top two elements on the stack */
1245 /* negate the value on the top of the stack */
1269 CASE(_i2f): /* convert top of stack int to float */
1273 CASE(_i2l): /* convert top of stack int to long */
1283 CASE(_i2d): /* convert top of stack int to double */
1293 CASE(_l2i): /* convert top of stack long to int */
1301 CASE(_l2f): /* convert top of stack long to float */
1309 CASE(_l2d): /* convert top of stack long to double */
1317 CASE(_f2i): /* Convert top of stack float to int */
1321 CASE(_f2l): /* convert top of stack float to long */
1329 CASE(_f2d): /* convert top of stack float to double */
1340 CASE(_d2i): /* convert top of stack double to int */
1348 CASE(_d2f): /* convert top of stack double to float */
1356 CASE(_d2l): /* convert top of stack double to long */
1781 // Now store the result on the stack
2012 // stack grows down, dimensions are up!
2016 //adjust pointer to start of stack element
2442 /* push bytecode index on stack */
2458 /* push return address on the stack */
2534 // expression stack is emptied
2542 // Place exception on top of stack
2639 // examine all the entries in reverse time(and stack) order and
2749 // are still on the stack (4340444).
2768 // entry/exit events are sent for that thread to track stack depth.
2803 // stack and re-execute the call. We also have to notify deoptimization that this
2805 // java expression stack. Yuck.
3085 tty->print_cr("stack: " INTPTR_FORMAT, (uintptr_t) this->_stack);