Searched refs:tail (Results 101 - 125 of 158) sorted by relevance

1234567

/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/
H A Dcoding.cpp608 coding_method* tail = U_NEW(coding_method, 1); local
609 CHECK_NULL(tail);
610 tail->u = u;
618 self->next = tail;
624 tail->init(band_rp, band_limit, NO_META, mode, defc, N2, valueSink);
626 tail->init(band_rp, band_limit, meta_rp, mode, defc, N2, valueSink);
628 // Note: The preceding calls to init should be tail-recursive.
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/jvm/
H A DClassReader.java795 List<Type> tail = head;
797 tail = tail.setTail(List.of(sigToType()));
799 return head.tail;
1232 nt.type = new MethodType(nt.type.getParameterTypes().tail,
1248 types1 = types1.tail;
1249 types2 = types2.tail;
1339 while (parameters.tail != null) {
1341 parameters = parameters.tail;
1476 v.nonEmpty(); v = v.tail) {
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/
H A DMemberEnter.java363 for (List<JCVariableDecl> l = params; l.nonEmpty(); l = l.tail) {
373 for (List<JCExpression> l = thrown; l.nonEmpty(); l = l.tail) {
412 for (List<? extends JCTree> l = trees; l.nonEmpty(); l = l.tail)
586 for (List<JCVariableDecl> l = tree.params; l.nonEmpty(); l = l.tail) {
699 for (List<JCTypeParameter> l = tree.typarams; l.nonEmpty(); l = l.tail)
701 for (List<JCVariableDecl> l = tree.params; l.nonEmpty(); l = l.tail)
764 for (List<JCAnnotation> al = annotations; al.nonEmpty(); al = al.tail) {
781 for (List<JCAnnotation> al = annotations; al.nonEmpty(); al = al.tail) {
1049 typarams = typarams.tail)
1278 params = params.tail;
[all...]
/openjdk7/jdk/src/windows/native/java/net/
H A DNetworkInterface.c317 * Put the interface at tail of list as GetIfTable(,,TRUE) is
324 netif *tail = netifP; local
325 while (tail->next != NULL) {
326 tail = tail->next;
328 tail->next = curr;
/openjdk7/jdk/src/share/classes/java/lang/invoke/
H A DMethodType.java473 int tail = len - end;
474 nptypes = Arrays.copyOfRange(ptypes, 0, start + tail);
475 System.arraycopy(ptypes, end, nptypes, start, tail);
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.cpp1890 st->print(" %d<-%d", lp->head()->pre_order(),lp->tail()->pre_order());
2225 // Clone lp's head and replace tail's successors with clone.
2250 Block* tail = lp->tail(); local
2253 tty->print(" for predecessor "); tail->print_value_on(tty);
2262 // Insert clone after (orig) tail in reverse post order
2263 clone->set_rpo_next(tail->rpo_next());
2264 tail->set_rpo_next(clone);
2266 // tail->head becomes tail
[all...]
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/langtools/src/share/classes/com/sun/tools/javac/code/
H A DScope.java224 for (List<ScopeListener> l = listeners; l.nonEmpty(); l = l.tail) {
277 for (List<ScopeListener> l = listeners; l.nonEmpty(); l = l.tail) {
703 scopesToScan = scopesToScan.tail;
H A DLint.java325 v.nonEmpty(); v = v.tail) {
H A DSymbol.java808 is = is.tail)
1087 is = is.tail) {
1271 remaining = remaining.tail;
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/axes/
H A DWalkerFactory.java861 StepPattern tail = step;
937 tail = pat;
944 XNumber score = tail.getStaticScore();
945 tail.setRelativePathPattern(selfPattern);
946 tail.setStaticScore(score);
969 * @param tail The step that is the first step analyzed, but the last
970 * step in the relative match linked list, i.e. the tail.
982 int analysis, StepPattern tail, StepPattern head)
980 createDefaultStepPattern( Compiler compiler, int opPos, MatchPatternIterator mpi, int analysis, StepPattern tail, StepPattern head) argument
/openjdk7/corba/make/common/shared/
H A DDefs-utils.gmk131 TAIL = $(UTILS_USR_BIN_PATH)tail
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1CollectorPolicy.hpp508 // The tail of the incrementally built collection set.
742 // The tail of the incrementally built collection set.
914 HeapRegion* tail) {
917 _recorded_survivor_tail = tail;
912 record_survivor_regions(uint regions, HeapRegion* head, HeapRegion* tail) argument
/openjdk7/langtools/src/share/classes/com/sun/tools/javadoc/
H A DJavadocTool.java144 for (List<String> it = javaNames; it.nonEmpty(); it = it.tail) {
167 for (List<String> packs = names.toList(); packs.nonEmpty(); packs = packs.tail) {
/openjdk7/hotspot/src/share/vm/memory/
H A DbinaryTreeDictionary.hpp67 using FreeList<Chunk>::tail;
H A DfreeList.hpp33 // maintains a the structure of the list (head, tail, etc.) plus
94 // Reset the head, tail, hint, and count of a free list.
126 Chunk* tail() const { function in class:VALUE_OBJ_CLASS_SPEC
135 // Set the tail of the list and set the next field of non-null
/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/langtools/src/share/classes/com/sun/tools/apt/main/
H A DAptJavaCompiler.java237 for (List<String> l = filenames; l.nonEmpty(); l = l.tail) {
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/tree/
H A DTreeInfo.java116 for (List<JCTree> l = trees; l.nonEmpty(); l = l.tail)
203 stats = stats.tail;
540 path = path.tail;
590 for (List<? extends JCTree> l = trees; l.nonEmpty(); l = l.tail)
H A DTreeScanner.java56 for (List<? extends JCTree> l = trees; l.nonEmpty(); l = l.tail)
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/main/
H A DJavaCompiler.java945 defs = defs.tail) {
1354 Assert.check(pdef.tail.isEmpty());
1402 for (List<JCTree> l = cdefs; l.nonEmpty(); l = l.tail) {
1504 for (List<JCTree> it = tree.defs; it.tail != null; it = it.tail) {
/openjdk7/jdk/make/common/shared/
H A DDefs-utils.gmk148 TAIL = $(UTILS_USR_BIN_PATH)tail
/openjdk7/corba/src/share/classes/com/sun/tools/corba/se/idl/toJavaPortable/
H A DUtil.java232 String tail = "" ;
241 return trname + tail ;
245 tail = head.substring( index ) + tail ;
/openjdk7/jdk/test/java/lang/invoke/
H A DBigArityTest.java132 Object[] tail = Arrays.copyOfRange(args, skip, nargs, cls);
134 r = smh.invokeExact(tail);
136 r = smh.invokeExact((Integer[]) tail);
138 r = smh.invoke(tail);
141 tail = Arrays.copyOfRange(args, skip, nargs, cls);
143 r = smh.invokeExact(args[0], tail);
145 r = smh.invokeExact(args[0], (Integer[]) tail);
147 r = smh.invoke(args[0], tail);
150 tail = Arrays.copyOfRange(args, skip, nargs, cls);
152 r = smh.invokeExact(args[0], args[1], tail);
[all...]

Completed in 160 milliseconds

1234567