Searched refs:tail (Results 126 - 150 of 158) sorted by relevance

1234567

/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/
H A DCommandProcessor.java1587 String tail = cmd.substring(1);
1588 switch (tail.charAt(0)) {
1600 int index = Integer.parseInt(tail);
1614 if (s.startsWith(tail)) {
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DheapRegionSet.cpp255 msg->append(" hd: "PTR_FORMAT" tl: "PTR_FORMAT, head(), tail());
460 out->print_cr(" tail : "PTR_FORMAT, _tail);
/openjdk7/hotspot/src/share/vm/runtime/
H A DobjectMonitor.cpp1119 // TODO: organize EntryList as a CDLL so we can locate the tail in constant-time.
1211 // we have faster access to the tail.
1712 // CONSIDER: finding the tail currently requires a linear-time walk of
1713 // the EntryList. We can make tail access constant-time by converting to
1805 // a. add it directly to the EntryList - either tail or head.
1841 // CONSIDER: finding the tail currently requires a linear-time walk of
1842 // the EntryList. We can make tail access constant-time by converting to
2306 ObjectWaiter* tail = head->_prev; local
2307 assert(tail->_next == head, "invariant check");
2308 tail
[all...]
H A Ddeoptimization.cpp1354 xtty->tail("uncommon_trap");
1932 if (xtty != NULL) xtty->tail("statistics");
/openjdk7/jdk/src/windows/native/sun/windows/
H A Dawt_Font.cpp380 static void strip_tail(wchar_t* text, wchar_t* tail) { // strips tail and any possible whitespace before it from the end of text argument
381 if (wcslen(text)<=wcslen(tail)) {
384 wchar_t* p = text+wcslen(text)-wcslen(tail);
385 if (!wcscmp(p, tail)) {
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/
H A DConstFold.java91 return fold2(opcode, argtypes.head, argtypes.tail.head);
H A DEnter.java271 for (List<T> l = trees; l.nonEmpty(); l = l.tail) {
/openjdk7/langtools/src/share/classes/com/sun/tools/javadoc/
H A DStart.java508 for (List<String> i = arguments; i.nonEmpty(); i=i.tail) {
H A DClassDocImpl.java670 for (; more.nonEmpty(); more=more.tail) {
/openjdk7/hotspot/src/share/vm/opto/
H A DloopPredicate.cpp756 // projs in the list, and they all dominate loop->tail()
758 Node *current_proj = loop->tail(); //start from tail
788 // does not dominate loop->tail(), so it can not be in the if_proj list.
922 if (!_irreducible && !tail()->is_top()) {
H A DloopTransform.cpp270 Node *test = ((IdealLoopTree*)this)->tail();
305 Node *prev = loop->_head->in(LoopNode::LoopBackControl);//loop->tail();
318 if( n->is_If() && n->in(1) == test->in(1) /*&& n != loop->tail()->in(0)*/ ) {
2040 Node *test = tail();
2352 !tail()->is_top()) {
2360 !tail()->is_top()) { // Also ignore the occasional dead backedge
H A Dsplit_if.cpp470 if( get_loop(iff)->tail() == ifp )
H A Dsuperword.hpp131 DepMem* tail() { return _tail; } function in class:VALUE_OBJ_CLASS_SPEC
221 GrowableArray<Node*> _mem_slice_tail; // Memory slice tail nodes
H A Dgcm.cpp1496 Block* tail = _bbs[tail_n->_idx]; local
1499 // For all reasonable loops, the head occurs before the tail in RPO.
1500 if (i <= tail->_rpo) {
1502 // The tail and (recursive) predecessors of the tail
1560 // For all reasonable loops, the head occurs before the tail in RPO.
H A Dcompile.cpp264 if (xtty != NULL) xtty->tail("statistics");
276 if (xtty != NULL) xtty->tail("statistics");
830 xtty->tail("ideal");
1195 _log->tail("mismatched_nodes");
H A Dmacro.cpp976 log->tail("eliminate_allocation");
1966 log->tail("eliminate_lock");
H A DcallGenerator.cpp368 log->tail("late_inline");
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DcompactibleFreeListSpace.cpp252 assert(_indexedFreeList[i].tail() == NULL, "reset check failed");
264 assert(_indexedFreeList[i].tail() == NULL, "reset check failed");
2520 FreeChunk* tail = _indexedFreeList[size].tail(); local
2529 guarantee((fc->next() == NULL) == (fc == tail), "Incorrect tail");
2830 assert(fl->tail()->next() == NULL, "List invariant.");
2967 assert(fl->tail()->next() == NULL, "List invariant.");
/openjdk7/hotspot/src/share/vm/code/
H A Dnmethod.cpp708 xtty->tail("print_native_nmethod");
784 xtty->tail("print_dtrace_nmethod");
992 xtty->tail("print_nmethod");
2808 if (xtty != NULL) xtty->tail("statistics");
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/api/
H A DJavacTrees.java292 for ( ; l.nonEmpty(); l = l.tail) {
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/model/
H A DJavacElements.java299 elems = elems.tail;
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/jvm/
H A DCode.java276 for (List<Type> l = types; l.nonEmpty(); l = l.tail)
1558 lineInfo = lineInfo.tail;
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/file/
H A DJavacFileManager.java325 for (; !files.isEmpty(); files = files.tail) {
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/parser/
H A DJavacParser.java796 buf = buf.tail;
826 odStackSupply.elems = odStackSupply.elems.tail;
834 opStackSupply.elems = opStackSupply.elems.tail;
842 posStackSupply.elems = posStackSupply.elems.tail;
/openjdk7/hotspot/src/share/vm/compiler/
H A DcompileBroker.cpp581 log->tail("task");

Completed in 170 milliseconds

1234567