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

1234567

/openjdk7/jdk/src/share/native/sun/awt/medialib/
H A Dmlib_ImageColorTrue2Index.c1238 /* Stack pointer pointers to the first free element of stack. */ \
1244 } stack[ BITS ]; \
1422 q = stack[ stack_pointer ].q; \
1423 node = stack[ stack_pointer ].node; \
1434 stack[ stack_pointer ].node = node; \
1435 stack[ stack_pointer++ ].q = q; \
1551 q = stack[ stack_pointer ].q; \
1552 node = stack[ stack_pointer ].node; \
1652 /* Stack pointer pointers to the first free element of stack. */ \
1658 } stack[ BIT
[all...]
/openjdk7/corba/src/share/classes/sun/rmi/rmic/iiop/
H A DStubGenerator.java111 * @param stack The context stack.
113 protected boolean parseNonConforming(ContextStack stack) { argument
119 return stack.getEnv().getParseNonConforming();
125 * @param stack The context stack.
128 protected CompoundType getTopType(ClassDefinition cdef, ContextStack stack) { argument
138 result = AbstractType.forAbstract(cdef,stack,true);
144 result = RemoteType.forRemote(cdef,stack,false);
150 result = ImplementationType.forImplementation(cdef,stack,fals
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/
H A DJTree.java3536 Stack<TreePath> stack;
3540 stack = new Stack<TreePath>();
3543 stack = expandedStack.pop();
3552 stack.push(parentPath);
3556 for(int counter = stack.size() - 1; counter >= 0; counter--) {
3557 parentPath = stack.pop();
3576 stack.removeAllElements();
3577 expandedStack.push(stack);
H A DTransferHandler.java1712 final AccessControlContext stack = AccessController.getContext();
1717 javaSecurityAccess.doIntersectionPrivilege(action, stack, eventAcc);
1725 }, stack, srcAcc);
/openjdk7/hotspot/src/share/vm/opto/
H A Dblock.hpp426 void schedule_late(VectorSet &visited, Node_List &stack);
433 void ComputeLatenciesBackwards(VectorSet &visited, Node_List &stack);
H A Dloopnode.cpp1549 void IdealLoopTree::allpaths_check_safepts(VectorSet &visited, Node_List &stack) { argument
1550 assert(stack.size() == 0, "empty stack");
1551 stack.push(_tail);
1554 while (stack.size() > 0) {
1555 Node* n = stack.pop();
1571 stack.push(in);
1632 void IdealLoopTree::check_safepts(VectorSet &visited, Node_List &stack) { argument
1635 if (_child) _child->check_safepts(visited, stack);
1636 if (_next) _next ->check_safepts(visited, stack);
[all...]
H A Dcfgnode.cpp794 Node_Stack stack(a, C->unique() >> 4);
798 stack.push((Node *)this, 1);
799 while(!stack.is_empty()) {
800 PhiNode *ophi = stack.node()->as_Phi();
801 uint i = stack.index();
803 stack.pop();
814 stack.push(ophi, i);
H A Dloopnode.hpp400 void check_safepts(VectorSet &visited, Node_List &stack);
404 void allpaths_check_safepts(VectorSet &visited, Node_List &stack);
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_FrameMap.cpp193 _incoming_arguments->args()->at_put(i, LIR_OprFact::stack(java_index, as_BasicType(as_ValueType(address->type()))));
314 // skewed by SharedInfo::stack0 to indicate a stack location (vs.a register.)
H A Dc1_LinearScan.cpp216 // fixed intervals not needed for FPU stack allocation
228 // compute next unused stack index that can be used for spilling
255 // oop location. So a stack slot bigger than 2^11 leads to an overflow
260 bailout("too many stack slots used");
322 // eliminate moves from register to stack if stack slot is known to be correct
444 // remove move from register to stack if the stack slot is guaranteed to be correct.
454 // move target is a stack slot that is always correct, so eliminate instruction
460 // insert move from register to stack jus
657 ValueStack* stack = info->stack(); local
1404 ValueStack* stack = info->stack(); local
[all...]
/openjdk7/jdk/src/share/classes/sun/text/bidi/
H A DBidiBase.java1362 * Handling the stack of explicit levels (Xn):
1364 * With the Bidi stack of explicit levels,
1412 byte[] stack = new byte[MAX_EXPLICIT_LEVEL]; /* we never push anything >=MAX_EXPLICIT_LEVEL */
1427 stack[stackTop] = embeddingLevel;
1449 stack[stackTop] = embeddingLevel;
1475 embeddingLevel = stack[stackTop];
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/
H A DDTMDefaultBaseIterators.java1247 * The stack of start node + ancestors up to the root of the tree,
1328 final int[] stack = new int[index + 4];
1329 System.arraycopy(_stack, 0, stack, 0, index);
1330 _stack = stack;
1335 --index; // Pop actual root node (if not start) back off the stack
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.hpp232 Cell stack(int snum) const { function in class:ciTypeFlow::StateVector
237 Cell tos() const { return stack(stack_size()-1); }
241 ciType* stack_type_at(int i) const { return type_at(stack(i)); }
254 // Top-of-stack operations.
346 // null is popped from the stack, we return NULL. Caller beware.
659 // exception path. This means the stack is replaced by the
/openjdk7/jdk/src/share/classes/java/awt/
H A DEventQueue.java124 * The next EventQueue on the stack, or null if this EventQueue is
125 * on the top of the stack. If nextQueue is non-null, requests to post
131 * The previous EventQueue on the stack, or null if this is the
139 * event queue(s) is not enough: we should lock the whole stack.
262 // Forward the event to the top of EventQueue stack
699 final AccessControlContext stack = AccessController.getContext();
703 javaSecurityAccess.doIntersectionPrivilege(action, stack, eventAcc);
711 }, stack, srcAcc);
980 // Forward the request to the top of EventQueue stack
1279 * stack, the
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javap/
H A DAttributeWriter.java525 printMap("stack", frame.stack);
535 printMap("stack", frame.stack);
577 printMap("stack", frame.stack);
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/tty/
H A DCommands.java58 * Save current thread and stack frame. (BugId 4296031)
77 * stack frame the user was looking at. (BugId 4296031)
86 MessageOutput.println("Requested stack frame is no longer active:",
864 MessageOutput.println("End of stack.");
899 MessageOutput.println("End of stack.");
904 List<StackFrame> stack = null;
906 stack = threadInfo.getStack();
911 if (stack == null) {
912 MessageOutput.println("Thread is not running (no stack).");
914 int nFrames = stack
[all...]
/openjdk7/hotspot/src/cpu/x86/vm/
H A DsharedRuntime_x86_32.cpp71 flags_off = xmm7_off + 16/BytesPerInt + 1, // 16-byte stack alignment fill word
133 assert(FPUStateSizeInWords == 27, "update stack layout");
136 // We assume caller has already has return address slot on the stack
163 // since fstp_d can cause FPU stack underflow exceptions. Write it
164 // into the on stack copy and then reload that to make sure that the
357 // Pop all of the register save are off the stack except the return address
368 // The java_calling_convention describes stack locations as ideal slots on
386 // refer to 4-byte stack slots. All stack slots are based off of the stack pointe
413 uint stack = 0; // Starting stack position for args on stack local
990 uint stack = 0; // All arguments on stack local
[all...]
H A DcppInterpreter_x86.cpp139 // mode, results are returned in xmm0 and the FPU stack must
145 // Store as float and empty fpu stack
173 // tosca based result to c++ interpreter stack based result.
174 // Result goes to top of native stack.
179 // code. Place this result on the java expression stack so C++ interpreter can use it.
246 // A result is in the java expression stack of the interpreted method that has just
247 // returned. Place this result on the java expression stack of the caller.
251 // execution stack (which is pre-pushed) and will be return to the top of the caller
252 // stack. The top of the callers stack i
2268 layout_interpreterState(interpreterState to_fill, frame* caller, frame* current, methodOop method, intptr_t* locals, intptr_t* stack, intptr_t* stack_base, intptr_t* monitor_base, intptr_t* frame_bottom, bool is_top_frame ) argument
2425 intptr_t* stack = (intptr_t*) ((intptr_t) stack_base - (tempcount + 1) * BytesPerWord); local
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java1920 Stack<LayoutNode> stack = new Stack<LayoutNode>();
1921 stack.push(startNode);
1923 while (!stack.empty()) {
1924 LayoutNode node = stack.pop();
1933 stack.push(node);
1944 stack.push(e.to);
/openjdk7/hotspot/src/share/vm/classfile/
H A Dverifier.hpp71 // StackMapTable is stack allocated.
76 // a frame that has a mutable one-item stack (ready for pushing the
78 // are immutable (including their locals and stack arrays) after
80 // locals/stack arrays in StackMapFrame are resource allocated.
81 // locals/stack arrays can be shared between StackMapFrame's, except
95 CF_STACK, // Comes from the current frame expression stack
97 SM_STACK, // Comes from stackmap expression stack
107 u2 _index; // local, stack, or constant pool index
120 static TypeOrigin stack(u2 index, StackMapFrame* frame);
150 STACK_SIZE_MISMATCH, // Frames have different stack size
[all...]
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkInliner.cpp152 // Expression stack for inlinability check
162 assert(slot >= 0 && slot < stack_depth(), "bad stack slot");
166 assert(stack_depth() < max_stack(), "stack overrun");
170 assert(stack_depth() > 0, "stack underrun");
199 // case we'd need a stack frame to throw the exception
231 // Inlined methods have no stack frame, so we can't do anything
687 SharkValue *arg = entry_state()->stack(target()->arg_size() - 1 - i);
712 // Pop the value off the stack if necessary
/openjdk7/jdk/test/tools/pack200/pack200-verifier/src/xmlkit/
H A DClassReader.java760 int stack = u2();
769 "stack", "" + stack,
828 boolean ustackIsU4 = currentCode.getAttrLong("stack") >= (1 << 16);
855 // Scan local and stack types in this frame:
H A DClassWriter.java623 int stack = (int) code.getAttrLong("stack");
636 u2(stack);
663 boolean ustackIsU4 = currentCode.getAttrLong("stack") >= (1 << 16);
679 // Scan local and stack types in this frame:
/openjdk7/jdk/src/solaris/classes/sun/awt/X11/
H A DXBaseWindow.java909 StackTraceElement stack[] = (new Throwable()).getStackTrace();
910 log.warning(stack[1] + ": Security violation: calling user code on toolkit thread");
/openjdk7/hotspot/src/cpu/sparc/vm/
H A DcppInterpreter_sparc.cpp55 // while "shadow" interpreter frames are on stack. It is also
144 // tosca based result to c++ interpreter stack based result.
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
221 // Every stack slot is aligned on 64 bit, However is this
222 // the correct stack slot on 64bit?? QQQ
240 // A result is in the java expression stack of the interpreted method that has just
241 // returned. Place this result on the java expression stack of the caller.
245 // execution stack (which is pre-pushed) and will be return to the top of the caller
246 // stack
2095 layout_interpreterState(interpreterState to_fill, frame* caller, frame* current, methodOop method, intptr_t* locals, intptr_t* stack, intptr_t* stack_base, intptr_t* monitor_base, intptr_t* frame_bottom, bool is_top_frame ) argument
2273 intptr_t* stack = stack_base - (tempcount + 1); local
[all...]

Completed in 185 milliseconds

1234567