/openjdk9/jaxp/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | NodeIteratorBase.java | 37 protected int _last = -1; field in class:NodeIteratorBase 106 if (_last == -1) { 111 _last++; 116 return _last;
|
H A D | BitArray.java | 180 int _last = Integer.MIN_VALUE; // The _INTEGER INDEX_ where last set bit is field in class:BitArray 196 if (i > _last) _last = i; 206 if (_last == -1) { 210 else if (other._last != -1) { 212 int stop = (_last > other._last) ? _last : other._last;
|
H A D | MatchingIterator.java | 110 if (_last == -1) { 111 _last = _source.getLast(); 113 return _last;
|
H A D | CurrentNodeListIterator.java | 168 if (_last == -1) { 169 _last = computePositionOfLast(); 171 return _last;
|
H A D | NodeSortRecord.java | 75 private int _last = 0; // Number of nodes in the current iterator field in class:NodeSortRecord 104 _last = last; 167 translet, _last); 185 translet, _last);
|
/openjdk9/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/dtm/ref/ |
H A D | DTMAxisIteratorBase.java | 37 protected int _last = -1; field in class:DTMAxisIteratorBase 126 if (_last == -1) // Not previously established 141 _last++; 149 return _last;
|
/openjdk9/hotspot/src/share/vm/gc/g1/ |
H A D | heapRegionSet.inline.hpp | 53 assert_free_region_list((length() == 0 && _head == NULL && _tail == NULL && _last == NULL) || 63 if (_last != NULL && _last->hrm_index() < hr->hrm_index()) { 64 curr = _last; 96 _last = hr; 141 if (_last == hr) { 142 _last = NULL;
|
H A D | heapRegionSet.cpp | 218 if (_last == curr) { 219 _last = NULL; 258 _last = NULL;
|
H A D | heapRegionSet.hpp | 175 // _last is used to keep track of where we added an element the last 177 HeapRegion* _last; member in class:FreeRegionList
|
/openjdk9/hotspot/src/share/vm/utilities/ |
H A D | numberSeq.hpp | 93 double _last; member in class:NumberSeq 101 virtual double last() const { return _last; }
|
H A D | numberSeq.cpp | 107 AbsSeq(alpha), _maximum(0.0), _last(0.0) { 121 _last = val; 248 s->print_cr("\t\t _last = %7.3f, _maximum = %7.3f", _last, _maximum);
|
/openjdk9/hotspot/src/share/vm/runtime/ |
H A D | jniHandles.cpp | 320 // _last, _free_list & _allocate_before_rebuild initialized in allocate_handle 321 debug_only(block->_last = NULL); 443 assert(current->_last == NULL, "only first block should have _last set"); 452 _last = this; 457 if (_last->_top < block_size_in_oops) { 458 oop* handle = &(_last->_handles)[_last->_top++]; 471 if (_last->_next != NULL) { 473 _last [all...] |
H A D | arguments.hpp | 258 AgentLibrary* _last; member in class:VALUE_OBJ_CLASS_SPEC 266 _first = _last = lib; 268 _last->_next = lib; 269 _last = lib; 292 if (curr == _last) { 293 _last = prev; 301 _last = NULL;
|
H A D | jniHandles.hpp | 133 JNIHandleBlock* _last; // Last block in use member in class:JNIHandleBlock
|
/openjdk9/hotspot/src/share/vm/compiler/ |
H A D | compileBroker.hpp | 86 CompileTask* _last; member in class:CompileQueue 97 _last = NULL; 108 CompileTask* last() { return _last; }
|
H A D | oopMap.hpp | 362 const OopMap* _last; member in class:ImmutableOopMapBuilder 404 if (_last != NULL && _last->count() > 0 && _last->equals(map)) {
|
H A D | compileBroker.cpp | 293 if (_last == NULL) { 297 _last = task; 300 assert(_last->next() == NULL, "not last"); 301 _last->set_next(task); 302 task->set_prev(_last); 303 _last = task; 443 assert(task == _last, "Sanity"); 444 _last = task->prev();
|
H A D | oopMap.cpp | 610 ImmutableOopMapBuilder::ImmutableOopMapBuilder(const OopMapSet* set) : _set(set), _new_set(NULL), _empty(NULL), _last(NULL), _empty_offset(-1), _last_offset(-1), _offset(0), _required(-1) { 642 _mapping[i].set(Mapping::OOPMAP_DUPLICATE, _last_offset, 0, map, _last); 648 _last = map;
|
/openjdk9/hotspot/src/share/vm/opto/ |
H A D | block.hpp | 781 Block * _last; // Last block in the trace member in class:Trace 794 _last = b; 797 set_next(_last, NULL); 804 _last(b), 820 Block * last_block() const { return _last; } 832 if (b == _last) { 833 _last = tr->last_block(); 845 insert_after(_last, tr); 850 set_next(_last, b); 851 set_prev(b, _last); [all...] |
H A D | node.cpp | 99 _last = NULL; 115 assert(node->_last_del == _last, "must have deleted the edge just produced"); 125 _last = that._last; 132 // Re-initialize everything, except _last. 220 // Fudge the _last field so that the common assert will be happy. 221 _last = (Node*) node->_last_del; 239 // Fudge the _last field so that the common assert will be happy. 240 _last = (Node*) node->_last_del; 270 assert(node->_last_del == _last, "mus [all...] |
/openjdk9/hotspot/src/share/vm/services/ |
H A D | threadService.hpp | 329 ThreadConcurrentLocks* _last; // Last ThreadConcurrentLocks in the map member in class:ConcurrentLocksDump 336 ConcurrentLocksDump(bool retain_map_on_free) : _map(NULL), _last(NULL), _retain_map_on_free(retain_map_on_free) {}; 337 ConcurrentLocksDump() : _map(NULL), _last(NULL), _retain_map_on_free(false) {}; 350 ThreadSnapshot* _last; member in class:ThreadDumpResult
|
H A D | threadService.cpp | 417 ThreadDumpResult::ThreadDumpResult() : _num_threads(0), _num_snapshots(0), _snapshots(NULL), _next(NULL), _last(NULL) { 425 ThreadDumpResult::ThreadDumpResult(int num_threads) : _num_threads(num_threads), _num_snapshots(0), _snapshots(NULL), _next(NULL), _last(NULL) { 453 _last->set_next(ts); 455 _last = ts; 707 _last->set_next(tcl); 709 _last = tcl;
|
/openjdk9/hotspot/src/share/vm/c1/ |
H A D | c1_GraphBuilder.hpp | 191 Instruction* _last; // the last instruction added member in class:VALUE_OBJ_CLASS_SPEC 207 Instruction* last() const { return _last; } 329 set_inline_cleanup_info(_block, _last, _state); 336 _last = inline_cleanup_return_prev();
|
H A D | c1_GraphBuilder.cpp | 2294 _last = _last->set_next(i1, canon.bci()); 2612 _last = beg; 2887 assert(_last && _last->as_BlockEnd(), ""); 2888 return _last->as_BlockEnd(); 3093 _last = _osr_entry; 3238 _last = start_block; 3284 _last = start_block; 3606 _last [all...] |
/openjdk9/langtools/test/tools/javac/api/ |
H A D | TestGetElement.java | 103 boolean _last = Boolean.parseBoolean(options.get("last")); 106 Scanner scanner = new Scanner(trees, _last);
|