Searched refs:_stack (Results 1 - 25 of 33) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_ValueStack.hpp49 Values _stack; // the expression stack member in class:ValueStack
92 int stack_size() const { return _stack.length(); }
94 bool stack_is_empty() const { return _stack.is_empty(); }
133 Value x = _stack.at(i);
135 _stack.at(i + 1) == NULL, "hi-word of doubleword value must be NULL");
146 _stack.at_put(i, x);
156 void truncate_stack(int size) { _stack.trunc_to(size); }
157 void raw_push(Value t) { _stack.push(t); }
158 Value raw_pop() { return _stack.pop(); }
161 void ipush(Value t) { _stack
[all...]
H A Dc1_ValueStack.cpp39 , _stack(scope->method()->max_stack())
52 , _stack()
65 _stack = Values(scope()->method()->max_stack());
68 _stack = Values(copy_from->stack_size());
70 _stack.appendAll(&copy_from->_stack);
137 apply(state->_stack, f);
181 _stack[index] = phi;
183 assert(!t->is_double_word() || _stack.at(index + 1) == NULL, "hi-word of doubleword value must be NULL");
266 Value v = _stack
[all...]
H A Dc1_IR.hpp255 ValueStack* _stack; // used by deoptimization (contains also monitors member in class:CodeEmitInfo
274 ValueStack* stack() const { return _stack; }
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkStateScanner.hpp39 : SharkTargetInvariants(function), _stack(function->stack()) {}
42 SharkStack* _stack; member in class:SharkStateScanner
46 return _stack;
H A DsharkFunction.hpp69 SharkStack* _stack; member in class:SharkFunction
86 return _stack;
H A DsharkState.hpp56 SharkValue** _stack; member in class:SharkState
103 return _sp - _stack;
H A DsharkNativeWrapper.hpp72 SharkStack* _stack; member in class:SharkNativeWrapper
114 return _stack;
H A DsharkState.cpp41 _stack = NEW_RESOURCE_ARRAY(SharkValue*, max_stack());
44 NOT_PRODUCT(memset(_stack, 23, max_stack() * sizeof(SharkValue *)));
45 _sp = _stack;
H A DsharkInliner.cpp154 bool* _stack; member in class:SharkInlinerHelper
159 return _sp - _stack;
683 _stack = NEW_RESOURCE_ARRAY(bool, max_stack());
692 _sp = _stack;
H A DsharkFunction.cpp92 _stack = SharkStack::CreateBuildAndPushFrame(this, method);
/openjdk7/hotspot/src/share/vm/classfile/
H A DstackMapFrame.hpp50 int32_t _stack_size; // number of valid type elements in _stack
61 VerificationType* _stack; // operand stack type array member in class:StackMapFrame
79 _stack = NEW_RESOURCE_ARRAY(VerificationType, _max_stack);
82 _stack[i] = cp._stack[i];
84 _stack[i] = VerificationType::bogus_type();
95 // in _locals and _stack.
99 // which have _locals_size and _stack_size array elements in _locals and _stack.
114 _locals(locals), _stack(stack),
133 inline VerificationType* stack() const { return _stack; }
[all...]
H A DstackMapFrame.cpp40 _stack = NEW_RESOURCE_ARRAY_IN_THREAD(thr, VerificationType, max_stack);
46 _stack[i] = VerificationType::bogus_type();
65 if (_stack[i].is_uninitialized()) {
81 if (_stack[i].equals(old_object)) {
82 _stack[i] = new_object;
156 _stack[i] = src->stack()[i];
236 mismatch_loc = is_assignable_to(_stack, target->stack(), _stack_size, THREAD);
261 VerificationType top = _stack[--_stack_size];
409 _stack[j].print_on(str);
/openjdk7/hotspot/src/cpu/zero/vm/
H A DbytecodeInterpreter_zero.cpp56 DO(_stack);
H A Dframe_zero.inline.hpp111 return get_interpreterState()->_stack + 1;
/openjdk7/hotspot/src/share/vm/utilities/
H A Dstack.hpp190 StackIterator(Stack<E, F>& stack): _stack(stack) { sync(); }
192 Stack<E, F>& stack() const { return _stack; }
202 Stack<E, F>& _stack; member in class:StackIterator
H A Dstack.inline.hpp261 _full_seg_size = _stack._full_seg_size;
262 _cur_seg_size = _stack._cur_seg_size;
263 _cur_seg = _stack._cur_seg;
272 _cur_seg = _stack.get_link(_cur_seg);
273 _cur_seg_size = _stack.segment_size();
274 _full_seg_size -= _stack.segment_size();
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/
H A DDTMDefaultBaseIterators.java1250 protected int[] _stack = new int[_maxAncestors]; field in class:DTMDefaultBaseIterators.PrecedingIterator
1281 final int[] stackCopy = new int[_stack.length];
1282 System.arraycopy(_stack, 0, stackCopy, 0, _stack.length);
1284 clone._stack = stackCopy;
1319 _stack[index = 0] = node;
1326 if (++index == _stack.length)
1329 System.arraycopy(_stack, 0, stack, 0, index);
1330 _stack = stack;
1332 _stack[inde
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A DloopPredicate.cpp455 Node_Stack _stack; member in class:Invariance
471 _stack.push(n, n->in(0) == NULL ? 1 : 0);
481 while (_stack.is_nonempty()) {
482 Node* n = _stack.node();
483 uint idx = _stack.index();
485 _stack.pop();
501 _stack.set_index(idx + 1);
519 _stack.push(n, n->in(0) == NULL ? 1 : 0);
526 while (_stack.is_nonempty()) {
527 Node* n = _stack
[all...]
H A Ddomgraph.cpp169 Block_Descr *_stack; member in class:Block_Stack
174 _stack = NEW_RESOURCE_ARRAY(Block_Descr, size);
175 _stack_max = _stack + size;
176 _stack_top = _stack - 1; // stack is empty
203 bool is_nonempty() { return (_stack_top >= _stack); }
H A DphaseX.cpp769 _stack(C->unique() >> 1),
777 _stack( igvn->_stack ),
786 _stack(C->unique() >> 1),
1157 assert(_stack.is_empty(), "not empty");
1158 _stack.push(dead, PROCESS_INPUTS);
1160 while (_stack.is_nonempty()) {
1161 dead = _stack.node();
1162 uint progress_state = _stack.index();
1168 _stack
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/stream/buffer/stax/
H A DStreamReaderBufferProcessor.java67 protected ElementStackEntry[] _stack = new ElementStackEntry[CACHE_SIZE]; field in class:StreamReaderBufferProcessor
68 /** The top-most active entry of the {@link #_stack}. */
131 for (int i=0; i < _stack.length; i++){
132 _stack[i] = new ElementStackEntry();
825 if (_depth == _stack.length) {
827 ElementStackEntry [] tmp = _stack;
828 _stack = new ElementStackEntry[_stack.length * 3 /2 + 1];
829 System.arraycopy(tmp, 0, _stack, 0, tmp.length);
830 for (int i = tmp.length; i < _stack
[all...]
/openjdk7/hotspot/src/share/vm/ci/
H A DbcEscapeAnalyzer.cpp91 ArgumentMap *_stack; member in class:BCEscapeAnalyzer::StateInfo
101 ArgumentMap raw_pop() { guarantee(_stack_height > 0, "stack underflow"); return _stack[--_stack_height]; }
105 void raw_push(ArgumentMap i) { guarantee(_stack_height < _max_stack, "stack overflow"); _stack[_stack_height++] = i; }
260 (code != Bytecodes::_invokevirtual || target->is_final_method() || state._stack[arg_base] .is_empty());
265 ArgumentMap arg = state._stack[i];
995 d_state->_stack[i] = s_state->_stack[i];
1008 d_state->_stack[i].set_union(s_state->_stack[i]);
1028 t = s_state->_stack[
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/sax2dtm/
H A DSAX2DTM2.java808 protected int[] _stack = new int[_maxAncestors]; field in class:SAX2DTM2.PrecedingIterator
839 final int[] stackCopy = new int[_stack.length];
840 System.arraycopy(_stack, 0, stackCopy, 0, _stack.length);
842 clone._stack = stackCopy;
877 _stack[index = 0] = node;
882 if (++index == _stack.length)
885 System.arraycopy(_stack, 0, stack, 0, index);
886 _stack = stack;
888 _stack[inde
[all...]
/openjdk7/hotspot/src/cpu/x86/vm/
H A DcppInterpreter_x86.cpp280 __ movptr(rdx, STATE(_stack));
293 __ movptr(rcx, STATE(_stack));
301 __ movptr(rdx, STATE(_stack));
334 __ movptr(rdx, STATE(_stack)); // get top of stack
338 __ movptr(rdx, STATE(_stack)); // get top of stack
343 __ movptr(rdx, STATE(_stack)); // get top of stack
351 __ movptr(rdx, STATE(_stack)); // get top of stack
359 __ movptr(rdx, STATE(_stack)); // get top of stack
533 __ movptr(STATE(_stack), rsp); // set current expression stack tos
537 __ movptr(STATE(_stack), rs
[all...]
/openjdk7/hotspot/src/share/vm/interpreter/
H A DbytecodeInterpreter.hpp128 intptr_t* _stack; // expression stack member in class:BytecodeInterpreter
223 inline intptr_t* stack() { return _stack; }
224 inline void set_stack(intptr_t* new_stack) { _stack = new_stack; }

Completed in 76 milliseconds

12