Searched defs:tail (Results 51 - 58 of 58) sorted by relevance

123

/openjdk7/hotspot/src/share/vm/opto/
H A Dloopnode.hpp331 // The head-tail backedge defines the loop.
332 // If tail is NULL then this loop has multiple backedges as part of the
337 inline Node *tail(); // Handle lazy update of _tail field
352 IdealLoopTree( PhaseIdealLoop* phase, Node *head, Node *tail )
354 _head(head), _tail(tail),
398 // executed (call dominates loop tail). These loops do not need non-call
402 // Allpaths backwards scan from loop tail, terminating each path at first safepoint
1086 inline Node* IdealLoopTree::tail() { function in class:IdealLoopTree
H A Dloopnode.cpp1270 // Find index of outermost loop; it should also be my tail.
1429 // tail being the new merge point.
1431 phase->set_loop(_tail,ilt); // Adjust tail
1432 _tail = r; // Self's tail is new merge point
1547 // Allpaths backwards scan from loop tail, terminating each path at first safepoint
1561 _required_safept->push(n); // save the one closest to the tail
1580 // executed (call dominates loop tail). These loops do not need non-call
1621 // tail to head following the idom (immediate dominator)
1625 // when the tail of an inner loop is encountered.
1629 // from the tail t
1663 Node* tail = nlpt->_tail; local
2565 Node *tail = _tail; // Inline a non-updating version of local
[all...]
/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 Darguments.cpp106 // Check if head of 'option' matches 'name', and sets 'tail' remaining part of option string
109 const char** tail) {
112 *tail = option->optionString + len;
132 const char* tail; local
134 if (match_option(option, "-Dsun.java.launcher=", &tail)) {
135 process_java_launcher_argument(tail, option->extraInfo);
138 if (match_option(option, "-Dsun.java.launcher.pid=", &tail)) {
139 _sun_java_launcher_pid = atoi(tail);
2029 // If tail_allowed is true, then the tail must begin with a colon; otherwise,
2031 static bool match_option(const JavaVMOption* option, const char** names, const char** tail, argument
108 match_option(const JavaVMOption *option, const char* name, const char** tail) argument
2136 const char* tail; local
2904 const char* tail; local
2998 const char* tail; local
[all...]
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.hpp725 Loop(Block* head, Block* tail) : argument
726 _head(head), _tail(tail),
734 Block* tail() const { return _tail; } function in class:ciTypeFlow::Loop
822 // Clone lp's head and replace tail's successors with clone.
/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/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/jdk/src/share/native/sun/java2d/cmm/lcms/
H A Dcmscgats.c445 char *tail; local
460 tail = strrchr(buffer, DIR_CHAR);
461 if (tail == NULL) return FALSE; // Is not absolute and has no separators??
463 len = (cmsUInt32Number) (tail - buffer);
467 strncpy(tail + 1, relPath, MaxLen - len);

Completed in 1800 milliseconds

123