| /openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
| H A D | heapRegionSet.inline.hpp | 106 assert((length() == 0 && _head == NULL && _tail == NULL) ||
107 (length() > 0 && _head != NULL && _tail != NULL),
116 _tail = hr;
123 assert((length() == 0 && _head == NULL && _tail == NULL) ||
124 (length() > 0 && _head != NULL && _tail != NULL),
130 if (_tail != NULL) {
131 _tail->set_next(hr);
135 _tail = hr;
141 assert(length() > 0 && _head != NULL && _tail != NULL,
148 _tail
[all...] |
| H A D | heapRegionSet.cpp | 280 assert(length() > 0 && _tail != NULL, hrs_ext_msg(this, "invariant"));
281 from_list->_tail->set_next(_head);
283 assert(length() == 0 && _tail == NULL, hrs_ext_msg(this, "invariant"));
284 _tail = from_list->_tail;
318 if (_tail != NULL) {
320 _tail->set_next(from_list->_head);
325 _tail = from_list->_tail;
383 assert(_tail
[all...] |
| H A D | sparsePRT.hpp | 340 SparsePRT* _tail; member in class:VALUE_OBJ_CLASS_SPEC
343 SparsePRTCleanupTask() : _head(NULL), _tail(NULL) { }
347 SparsePRT* tail() { return _tail; }
|
| H A D | heapRegionSet.hpp | 291 HeapRegion* _tail; member in class:HeapRegionLinkedList
295 HeapRegion* tail() { return _tail; }
|
| H A D | sparsePRT.cpp | 559 if (_tail != NULL) {
560 _tail->set_next_expanded(sprt);
564 _tail = sprt;
|
| /openjdk7/hotspot/src/share/vm/services/ |
| H A D | memTrackWorker.cpp | 50 _head = _tail = 0;
120 if (_head != _tail) {
124 if (_gen[_head].has_more_recorder() || _head == _tail) {
175 _gen[_tail].set_number_of_classes(number_of_classes);
177 _gen[_tail].add_recorders(rec);
178 assert(count_recorder(_gen[_tail].peek()) <= MemRecorder::_instance_count,
181 // we need to increment _tail to start a new generation.
182 if (_gen[_tail].has_more_recorder() || _head == _tail) {
183 _tail
[all...] |
| H A D | memTrackWorker.hpp | 84 int _head, _tail; // head and tail pointers to above circular buffer member in class:MemTrackWorker
114 return (_tail >= _head ? (_tail - _head + 1) : (MAX_GENERATIONS - (_head - _tail) + 1));
|
| /openjdk7/hotspot/src/share/vm/memory/ |
| H A D | freeList.hpp | 54 Chunk* _tail; // Tail of list of free chunks member in class:VALUE_OBJ_CLASS_SPEC
128 return _tail;
132 _tail = v;
133 assert(!_tail || _tail->size() == _size, "bad chunk size");
|
| H A D | freeList.cpp | 45 _head(NULL), _tail(NULL)
58 _head(fc), _tail(fc)
|
| /openjdk7/hotspot/src/share/vm/adlc/ |
| H A D | forms.hpp | 257 Form *_tail; member in class:FormList
265 if (_tail==NULL) { _root = _tail = _cur = entry;}
266 else { _tail->_next = entry; _tail = entry;}
315 FormList() { _justReset = 1; _justReset2 = 1; _root = NULL; _tail = NULL; _cur = NULL; _cur2 = NULL;};
|
| /openjdk7/hotspot/src/os/windows/vm/ |
| H A D | attachListener_windows.cpp | 75 static Win32AttachOperation* _tail; member in class:Win32AttachListener
81 static Win32AttachOperation* tail() { return _tail; }
82 static void set_tail(Win32AttachOperation* tail) { _tail = tail; }
115 Win32AttachOperation* Win32AttachListener::_tail; member in class:Win32AttachListener
|
| /openjdk7/hotspot/src/os/solaris/vm/ |
| H A D | attachListener_solaris.cpp | 98 static SolarisAttachOperation* _tail; member in class:SolarisAttachListener
103 static SolarisAttachOperation* tail() { return _tail; }
104 static void set_tail(SolarisAttachOperation* tail) { _tail = tail; }
172 SolarisAttachOperation* SolarisAttachListener::_tail = NULL; member in class:SolarisAttachListener
|
| /openjdk7/hotspot/src/share/vm/opto/ |
| H A D | loopnode.hpp | 336 Node *_tail; // Tail of loop member in class:IdealLoopTree
337 inline Node *tail(); // Handle lazy update of _tail field
354 _head(head), _tail(tail),
484 bool is_loop() { return !_irreducible && _tail && !_tail->is_top(); }
1087 // Handle lazy update of _tail field
1088 Node *n = _tail;
1093 _tail = n;
|
| H A D | superword.hpp | 122 DepMem* _tail; member in class:VALUE_OBJ_CLASS_SPEC
127 _tail = new (_arena) DepMem(NULL);
131 DepMem* tail() { return _tail; }
|
| H A D | loopnode.cpp | 682 loop->_tail = iftrue;
733 loop->_tail = back_control = ift2;
1272 while( _head->in(outer_idx) != _tail ) outer_idx++;
1430 IdealLoopTree *ilt = new IdealLoopTree( phase, _head, _tail );
1431 phase->set_loop(_tail,ilt); // Adjust tail
1432 _tail = r; // Self's tail is new merge point
1446 if( _head->in(i) == ilt->_tail )
1459 assert( ilt->_tail == hot_tail, "expected to only find the hot inner loop here" );
1551 stack.push(_tail);
1553 visited.set(_tail
[all...] |
| H A D | split_if.cpp | 471 get_loop(iff)->_tail = ifpx;
|
| /openjdk7/hotspot/src/share/vm/ci/ |
| H A D | ciTypeFlow.hpp | 720 Block* _tail; // Tail of loop member in class:ciTypeFlow::Loop
726 _head(head), _tail(tail),
734 Block* tail() const { return _tail; }
739 void set_tail(Block* tl) { _tail = tl; }
762 bool is_root() const { return _tail->pre_order() == max_jint; }
|