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

12

/openjdk10/hotspot/src/share/vm/utilities/
H A DnativeCallStack.hpp59 address _stack[NMT_TrackingStackDepth]; member in class:NativeCallStack
69 return _stack[0] == NULL;
76 return memcmp(_stack, other._stack, sizeof(_stack));
88 return _stack[index];
H A DnativeCallStack.cpp49 os::get_native_stack(_stack, NMT_TrackingStackDepth, toSkip);
52 _stack[index] = NULL;
62 _stack[index] = pc[index];
65 _stack[index] = NULL;
74 if (_stack[index] == NULL) {
86 if (_stack[index] == NULL) break;
87 hash_val += (uintptr_t)_stack[index];
H A Dstack.hpp193 StackIterator(Stack<E, F>& stack): _stack(stack) { sync(); }
195 Stack<E, F>& stack() const { return _stack; }
205 Stack<E, F>& _stack; member in class:StackIterator
H A Dstack.inline.hpp256 _full_seg_size = _stack._full_seg_size;
257 _cur_seg_size = _stack._cur_seg_size;
258 _cur_seg = _stack._cur_seg;
267 _cur_seg = _stack.get_link(_cur_seg);
268 _cur_seg_size = _stack.segment_size();
269 _full_seg_size -= _stack.segment_size();
/openjdk10/hotspot/src/share/vm/gc/shared/
H A DconcurrentGCPhaseManager.cpp48 _stack(stack)
65 assert_manager_is_tos(this, _stack, "This");
67 _stack->_top = _prev;
74 assert_manager_is_tos(this, _stack, "This");
75 return _active && (_stack->_requested_phase == _phase);
82 while (_active && (_stack->_requested_phase == _phase)) {
92 assert_manager_is_tos(this, _stack, "This");
100 assert_manager_is_tos(this, _stack, "This");
109 assert_manager_is_tos(this, _stack, "This");
H A DpreservedMarks.cpp33 while (!_stack.is_empty()) {
34 const OopAndMarkOop elem = _stack.pop();
51 assert(_stack.is_empty(), "stack expected to be empty, size = " SIZE_FORMAT,
52 _stack.size());
53 assert(_stack.cache_size() == 0,
55 _stack.cache_size());
H A DconcurrentGCPhaseManager.hpp128 Stack* _stack; member in class:ConcurrentGCPhaseManager
H A DpreservedMarks.inline.hpp39 _stack.push(elem);
74 : _stack(OopAndMarkOopStack::default_segment_size(),
H A DpreservedMarks.hpp52 OopAndMarkOopStack _stack; member in class:VALUE_OBJ_CLASS_SPEC
58 size_t size() const { return _stack.size(); }
/openjdk10/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.at_put(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...]
/openjdk10/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;
/openjdk10/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();
66 if (_stack[i].equals(old_object)) {
67 _stack[i] = new_object;
141 _stack[i] = src->stack()[i];
182 mismatch_loc = is_assignable_to(_stack, target->stack(), _stack_size, THREAD);
206 VerificationType top = _stack[--_stack_size];
354 _stack[j].print_on(str);
/openjdk10/hotspot/src/share/vm/services/
H A DvirtualMemoryTracker.hpp257 NativeCallStack _stack; member in class:CommittedMemoryRegion
261 VirtualMemoryRegion(addr, size), _stack(stack) { }
281 inline void set_call_stack(const NativeCallStack& stack) { _stack = stack; }
282 inline const NativeCallStack* call_stack() const { return &_stack; }
294 NativeCallStack _stack; member in class:ReservedMemoryRegion
302 VirtualMemoryRegion(base, size), _stack(stack), _flag(flag),
307 VirtualMemoryRegion(base, size), _stack(NativeCallStack::EMPTY_STACK), _flag(mtNone),
316 inline void set_call_stack(const NativeCallStack& stack) { _stack = stack; }
317 inline const NativeCallStack* call_stack() const { return &_stack; }
360 _stack
[all...]
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/dtm/ref/
H A DDTMDefaultBaseIterators.java1249 protected int[] _stack = new int[_maxAncestors]; field in class:DTMDefaultBaseIterators.PrecedingIterator
1280 final int[] stackCopy = new int[_stack.length];
1281 System.arraycopy(_stack, 0, stackCopy, 0, _stack.length);
1283 clone._stack = stackCopy;
1318 _stack[index = 0] = node;
1325 if (++index == _stack.length)
1328 System.arraycopy(_stack, 0, stack, 0, index);
1329 _stack = stack;
1331 _stack[inde
[all...]
/openjdk10/jaxws/src/java.xml.ws/share/classes/com/sun/xml/internal/stream/buffer/stax/
H A DStreamReaderBufferProcessor.java63 protected ElementStackEntry[] _stack = new ElementStackEntry[CACHE_SIZE]; field in class:StreamReaderBufferProcessor
64 /** The top-most active entry of the {@link #_stack}. */
127 for (int i=0; i < _stack.length; i++){
128 _stack[i] = new ElementStackEntry();
857 if (_depth == _stack.length) {
859 ElementStackEntry [] tmp = _stack;
860 _stack = new ElementStackEntry[_stack.length * 3 /2 + 1];
861 System.arraycopy(tmp, 0, _stack, 0, tmp.length);
862 for (int i = tmp.length; i < _stack
[all...]
/openjdk10/hotspot/src/cpu/zero/vm/
H A DbytecodeInterpreter_zero.cpp54 DO(_stack);
H A Dframe_zero.inline.hpp127 return get_interpreterState()->_stack + 1;
/openjdk10/hotspot/src/share/vm/opto/
H A DloopPredicate.cpp411 Node_Stack _stack; member in class:Invariance
427 _stack.push(n, n->in(0) == NULL ? 1 : 0);
437 while (_stack.is_nonempty()) {
438 Node* n = _stack.node();
439 uint idx = _stack.index();
441 _stack.pop();
463 _stack.set_index(idx + 1);
481 _stack.push(n, n->in(0) == NULL ? 1 : 0);
488 while (_stack.is_nonempty()) {
489 Node* n = _stack
[all...]
/openjdk10/hotspot/src/share/vm/ci/
H A DbcEscapeAnalyzer.cpp93 ArgumentMap *_stack; member in class:BCEscapeAnalyzer::StateInfo
103 ArgumentMap raw_pop() { guarantee(_stack_height > 0, "stack underflow"); return _stack[--_stack_height]; }
107 void raw_push(ArgumentMap i) { guarantee(_stack_height < _max_stack, "stack overflow"); _stack[_stack_height++] = i; }
282 (code != Bytecodes::_invokevirtual || target->is_final_method() || state._stack[arg_base] .is_empty());
287 ArgumentMap arg = state._stack[i];
1044 d_state->_stack[i] = s_state->_stack[i];
1057 d_state->_stack[i].set_union(s_state->_stack[i]);
1077 t = s_state->_stack[
[all...]

Completed in 137 milliseconds

12