/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/ |
H A D | Modules.java | 1350 primaryTodo = primaryTodo.tail; 1354 secondaryTodo = secondaryTodo.tail; 1451 requires = requires.tail; 1495 todo = todo.tail; 1727 queue = queue.tail;
|
H A D | Enter.java | 300 for (List<T> l = trees; l.nonEmpty(); l = l.tail) {
|
H A D | Operators.java | 368 types.isSameType(formals.tail.head, t2);
|
/openjdk10/hotspot/src/share/vm/gc/cms/ |
H A D | compactibleFreeListSpace.cpp | 219 assert(_indexedFreeList[i].tail() == NULL, "reset check failed"); 235 assert(_indexedFreeList[i].tail() == NULL, "reset check failed"); 2338 FreeChunk* tail = _indexedFreeList[size].tail(); local 2347 guarantee((fc->next() == NULL) == (fc == tail), "Incorrect tail"); 2656 assert(fl->tail()->next() == NULL, "List invariant."); 2812 assert(fl->tail()->next() == NULL, "List invariant.");
|
/openjdk10/hotspot/src/share/vm/opto/ |
H A D | superword.cpp | 987 _dg.make_edge(slice_sink, _dg.tail()); 2688 // Find memory slices (head and tail) 4161 Node* tail = 0; local 4164 tail = _mem_slice_tail.at(m); 4167 if (tail == 0) { //test that found phi is in the list _mem_slice_head 4228 Node* tail = _mem_slice_tail.at(i); local 4230 tail_err = tail; 4231 _ii_last = _clone_map.gen(tail->_idx); 4233 else if (_ii_last != _clone_map.gen(tail->_idx)) { 4236 tty->print_cr("SuperWord::mark_generations _ii_last error - found different generations in two tail node [all...] |
H A D | split_if.cpp | 470 if( get_loop(iff)->tail() == ifp )
|
H A D | loopPredicate.cpp | 839 // projs in the list, and they all dominate loop->tail() 841 Node *current_proj = loop->tail(); //start from tail 872 // does not dominate loop->tail(), so it can not be in the if_proj list. 1023 if (!_irreducible && !tail()->is_top()) {
|
H A D | compile.cpp | 241 if (xtty != NULL) xtty->tail("statistics"); 253 if (xtty != NULL) xtty->tail("statistics"); 871 xtty->tail("ideal"); 1300 _log->tail("mismatched_nodes"); 4266 log()->tail("late_inline");
|
H A D | gcm.cpp | 1633 Block* tail = get_block_for_node(tail_n); local 1636 // For all reasonable loops, the head occurs before the tail in RPO. 1637 if (i <= tail->_rpo) { 1639 // The tail and (recursive) predecessors of the tail 1697 // For all reasonable loops, the head occurs before the tail in RPO.
|
H A D | superword.hpp | 131 DepMem* tail() { return _tail; } function in class:VALUE_OBJ_CLASS_SPEC 267 GrowableArray<Node*> _mem_slice_tail; // Memory slice tail nodes
|
H A D | loopTransform.cpp | 280 Node *test = ((IdealLoopTree*)this)->tail(); 318 Node *prev = loop->_head->in(LoopNode::LoopBackControl);//loop->tail(); 331 if( n->is_If() && n->in(1) == test->in(1) /*&& n != loop->tail()->in(0)*/ ) { 2468 Node *test = tail(); 2874 !tail()->is_top()) { 2882 !tail()->is_top()) { // Also ignore the occasional dead backedge
|
H A D | macro.cpp | 1181 log->tail("eliminate_allocation"); 1222 log->tail("eliminate_boxing");
|
H A D | output.cpp | 1565 xtty->tail("opto_assembly");
|
/openjdk10/hotspot/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/ |
H A D | CommandProcessor.java | 1851 String tail = cmd.substring(1); 1852 switch (tail.charAt(0)) { 1864 int index = Integer.parseInt(tail); 1878 if (s.startsWith(tail)) {
|
/openjdk10/hotspot/src/share/vm/runtime/ |
H A D | arguments.hpp | 517 static jint parse_xss(const JavaVMOption* option, const char* tail, intx* out_ThreadStackSize);
|
H A D | deoptimization.cpp | 1348 xtty->tail("deoptimized"); 1723 xtty->tail("uncommon_trap"); 2366 if (xtty != NULL) xtty->tail("statistics");
|
/openjdk10/langtools/src/jdk.javadoc/share/classes/com/sun/tools/javadoc/main/ |
H A D | Start.java | 565 for (List<String> i = arguments; i.nonEmpty(); i=i.tail) {
|
H A D | ClassDocImpl.java | 695 for (; more.nonEmpty(); more=more.tail) {
|
/openjdk10/hotspot/src/share/vm/code/ |
H A D | nmethod.cpp | 635 xtty->tail("print_native_nmethod"); 882 xtty->tail("print_nmethod"); 2893 if (xtty != NULL) xtty->tail("statistics");
|
/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/code/ |
H A D | Symbol.java | 1295 is = is.tail) 1696 is = is.tail) { 1914 remaining = remaining.tail;
|
/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ |
H A D | Code.java | 280 for (List<Type> l = types; l.nonEmpty(); l = l.tail) 1615 lineInfo = lineInfo.tail; 2146 iter = iter.tail;
|
/openjdk10/langtools/test/tools/javac/lib/ |
H A D | DPrinter.java | 294 int tail = maxSrcLength - trim.length() - head; 295 s = s.substring(0, head) + trim + s.substring(s.length() - tail);
|
/openjdk10/hotspot/src/share/vm/memory/ |
H A D | metaspace.cpp | 2504 // any humongous chunks so will not point to the tail 4088 Metachunk* tail = head; 4095 tail->set_next(c); 4096 c->set_prev(tail); 4097 tail = c;
|
/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/model/ |
H A D | JavacElements.java | 348 elems = elems.tail;
|
/openjdk10/langtools/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jszip/dist/ |
H A D | jszip.js | 3340 var next_out_utf8, tail, utf8str; 3378 tail = strm.next_out - next_out_utf8; 3381 // move tail 3382 strm.next_out = tail; 3383 strm.avail_out = chunkSize - tail; 3384 if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }
|