Searched refs:stack (Results 151 - 169 of 169) sorted by relevance

1234567

/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/sax2dtm/
H A DSAX2DTM2.java805 * The stack of start node + ancestors up to the root of the tree,
884 final int[] stack = new int[index*2];
885 System.arraycopy(_stack, 0, stack, 0, index);
886 _stack = stack;
892 --index; // Pop actual root node (if not start) back off the stack
/openjdk7/corba/src/share/classes/sun/rmi/rmic/iiop/
H A DIDLGenerator.java86 * @param stack The context stack.
88 protected boolean parseNonConforming(ContextStack stack) { argument
99 ContextStack stack) {
100 return CompoundType.forCompound(cdef,stack);
98 getTopType(ClassDefinition cdef, ContextStack stack) argument
/openjdk7/hotspot/src/share/vm/runtime/
H A Darguments.cpp1777 // Check stack pages settings
1783 // greater stack shadow pages can't generate instruction to bang stack
1812 // builds so the cost of stack banging can be measured.
2314 "Invalid thread stack size: %s\n", option->optionString);
2702 "Invalid mark stack size: %s\n", option->optionString);
2712 "Invalid maximum mark stack size: %s\n",
H A Drelocator.cpp463 // The width of instruction at "bci" is changing by "delta". Adjust the stack
524 // The stack map frame may contain verification types, if so we need to
536 // Full frame has stack values too
541 types = ff->stack(eol);
621 // Adjust stack maps
624 // Relocate the pending change stack...
/openjdk7/jdk/src/share/classes/sun/awt/datatransfer/
H A DDataTransferer.java2311 final Stack stack = new Stack();
2331 stack.push(data);
2350 while (stack.empty()) {
2358 ret = (byte[])stack.pop();
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/expr/
H A DExpressionParser.java46 Stack<LValue> stack = new Stack<LValue>(); field in class:ExpressionParser
53 return stack.peek();
57 return stack.pop();
61 stack.push(lval);
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.cpp97 // Special case. If nothing is on the jsr stack, then there can
499 assert(stack_size() == 1, "must have one-element stack");
517 // Handle stack separately. When an exception occurs, the
518 // only stack entry is the exception instance.
672 ciType* stack_type = type_at(stack(stack_base + i++));
676 ciType* stack_type2 = type_at(stack(stack_base + i++));
1518 st->print_cr(" State : locals %d, stack %d, monitors %d", num_locals, num_stack, num_monitors);
1527 st->print(" stack %2d : ", i);
1528 print_cell_on(st, stack(i));
2164 // We can assume the monitor stack i
[all...]
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LIR.cpp727 // On x86 tan/sin/cos need two temporary fpu stack slots and
753 // On x86 pow needs two temporary fpu stack slots: tmp1 and
1501 out->print("stack:%d", single_stack_ix());
1648 if (info() != NULL) out->print(" [bci:%d]", info()->stack()->bci());
1863 if (stub()->info() != NULL) out->print(" [bci:%d]", stub()->info()->stack()->bci());
1982 if (info_for_exception() != NULL) out->print(" [bci:%d]", info_for_exception()->stack()->bci());
H A Dc1_LIRAssembler.cpp64 Bytecodes::Code code = info->scope()->method()->java_code_at_bci(info->stack()->bci());
475 // C2 leave fpu stack dirty clean it
790 "round_fp: rounds register -> stack location");
H A Dc1_LIR.hpp183 // it can be a register (ALU/FPU), stack location or a constant;
186 // Registers and stack locations are inlined into the this pointer
228 , is_fpu_stack_offset_bits = 1 // used in assertion checking on x86 for FPU stack slot allocation
737 // the index is platform independent; a double stack useing indeces 2 and 3 has always
739 static LIR_Opr stack(int index, BasicType type) { function in class:LIR_OprFact
1072 // FPU stack simulation helpers -- only used on Intel
1975 // result is a stack location for old backend and vreg for UseLinearScan
2244 // constants and stack operands are ignored
2278 assert(opr->is_stack(), "stack operands are not processed");
/openjdk7/hotspot/src/share/vm/opto/
H A Dcallnode.hpp89 // The method start node for on stack replacement code
137 // unwinds stack. Rethrow happens in the caller's method.
156 // Pop stack frame and jump indirect
170 // Pop stack frame and jump indirect
188 // or to let the GC mark the stack.
202 uint _stkoff; // Offset to stack in input edge mapping
361 Node *stack(JVMState* jvms, uint idx) const { function in class:SafePointNode
394 // Handle monitor stack
945 fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // Address of stack location for lock
H A DdoCall.cpp424 Node* receiver_node = stack(sp() - nargs);
499 // Return value (if any) is already pushed on the stack by the cg.
681 push_ex_oop(ex_oop); // Clear stack and push just the oop.
722 // Start executing from the given throw state. (Keep its stack, for now.)
H A Dmachnode.hpp184 // Modify this instruction's register mask to use stack version for cisc_operand
257 // This method is free to ignore stack slots if that helps.
482 // location (stack or register).
678 Node *stack(const JVMState* jvms, uint idx) const { function in class:MachSafePointNode
715 uint _argsize; // Size of argument block on stack
H A Dcallnode.cpp96 // The method start node for an on stack replacement adapter
394 // Print stack
399 format_helper(regalloc, st, mcall->stack(this, i), "STK[", i, &scobjs);
1029 // stack space for the monitor) and the Object being locked.
H A Doutput.cpp167 // Determine if we need to generate a stack overflow check.
175 // Determine if we need to generate a register stack overflow check.
579 // Java local or expression stack to constant, register or stack-slot. For
655 if( OptoReg::is_valid(regnum) ) {// Got a register/stack?
681 // width 64-bit stack slot.
697 // This is actually reasonable, since locals and stack arrays
699 // (If, on some machine, the interpreter's Java locals or stack
747 // Must be restored to the full-width 64-bit stack slot.
767 // This is actually reasonable, since locals and stack array
[all...]
H A Dparse1.cpp97 // on stack replacement.
178 // performing a parse for on stack replacement. Add values into map.
200 // Set initial stack depth.
203 // Check bailouts. We currently do not perform on stack replacement
204 // of loops in catch blocks or loops which branch with a non-empty stack.
206 C->record_method_not_compilable("OSR starts with non-empty stack");
307 // Extract the needed stack entries from the interpreter frame.
311 // Currently the compiler bails out when attempting to on stack replace
312 // at a bci with a non-empty stack. We should not reach here.
359 Node* l = stack(inde
[all...]
/openjdk7/jdk/test/tools/pack200/pack200-verifier/src/xmlkit/
H A DXMLKit.java265 * XMLKit.stack(Filter&amp;Filter | Filter[]) // result is (fx && g(fx))
3183 public static Filter stack(final Filter f0, final Filter f1) { method in class:XMLKit
3184 return stack(new Filter[]{f0, f1});
3187 public static Filter stack(final Filter... fs) { method in class:XMLKit
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.cpp2985 // Deal with stack overflow: by restarting at the indicated
2994 // Should reset the revisit stack above, since no class tree
3035 // Deal with stack overflow: by restarting at the indicated
3044 // Should reset the revisit stack above, since no class tree
3200 assert(_markStack.isEmpty(), "Marking stack should be empty");
3719 // push oop on marking stack
3720 // . drain the marking stack
3734 // Clear the revisit stack, just in case there are any
3909 // . check global overflow stack; steal a batch of oops and trace
3983 // stack an
[all...]
/openjdk7/hotspot/src/share/vm/classfile/
H A Dverifier.cpp283 TypeOrigin TypeOrigin::stack(u2 index, StackMapFrame* frame) {
328 ss->print(" (current frame, stack[%d])", _index);
331 ss->print(" (stack map, locals[%d])", _index);
334 ss->print(" (stack map, stack[%d])", _index);
400 "to stack map frame's.");
415 ss->print("Current frame's stack size doesn't match stackmap.");
418 ss->print("Exceeded max stack size.");
421 ss->print("Attempt to pop empty stack.");
579 const char* bad_type_msg = "Bad type on operand stack i
[all...]

Completed in 156 milliseconds

1234567