| /external/llvm/test/Transforms/LoopVectorize/X86/ |
| avx1.ll | 14 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 0, %0 ]
19 %indvars.iv.next = add i64 %indvars.iv, 1
20 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
37 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 0, %0 ]
42 %indvars.iv.next = add i64 %indvars.iv, 1
43 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| conversion-cost.ll | 14 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 3, %0 ]
18 %indvars.iv.next = add i64 %indvars.iv, 1
19 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
35 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 9, %0 ]
40 %indvars.iv.next = add i64 %indvars.iv, 1
41 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| unroll-small-loops.ll | 15 %indvars.iv = phi i64 [ 0, %0 ], [ %indvars.iv.next, %1 ]
20 %indvars.iv.next = add i64 %indvars.iv, 1
21 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
38 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 0, %0 ]
43 %indvars.iv.next = add i64 %indvars.iv, 1
44 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| vector-scalar-select-cost.ll | 17 %indvars.iv = phi i64 [ 0, %0 ], [ %indvars.iv.next, %1 ]
30 %indvars.iv.next = add i64 %indvars.iv, 1
31 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
44 %indvars.iv = phi i64 [ 0, %0 ], [ %indvars.iv.next, %1 ]
58 %indvars.iv.next = add i64 %indvars.iv, 1
59 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| flags.ll | 16 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 9, %0 ]
21 %indvars.iv.next = add i64 %indvars.iv, 1
22 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
41 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 9, %0 ]
46 %indvars.iv.next = add i64 %indvars.iv, 1
47 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| hoist-loads.ll | 16 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %if.end9 ]
30 %indvars.iv.next = add i64 %indvars.iv, 1
31 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
48 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %if.end9 ]
62 %indvars.iv.next = add i64 %indvars.iv, 1
63 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| increment.ll | 22 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ 0, %0 ]
28 %indvars.iv.next = add i64 %indvars.iv, 1
29 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
51 %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %entry ]
59 %indvars.iv.next = add i64 %indvars.iv, 1
60 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| minmax_reduction.ll | 27 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
33 %indvars.iv.next = add i64 %indvars.iv, 1
34 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
56 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
62 %indvars.iv.next = add i64 %indvars.iv, 1
63 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
84 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
90 %indvars.iv.next = add i64 %indvars.iv, 1
91 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
113 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/address/ |
| NetObjectList.java | 111 /** returns the next element
114 public GenericObject next() { method in class:NetObjectList
115 return (NetObject) super.next();
118 /** returns the next element
122 public GenericObject next(ListIterator li) { method in class:NetObjectList
123 return (NetObject) super.next(li);
|
| /external/qemu/distrib/sdl-1.2.15/docs/html/ |
| sdlwaitevent.html | 18 REL="NEXT"
64 >Next</A
83 >SDL_WaitEvent -- Waits indefinitely for the next available event.</DIV
123 >Waits indefinitely for the next available event, returning
141 >, the next
203 >Next</A
|
| /external/skia/src/pathops/ |
| SkIntersectionHelper.h | 66 bool isAdjacent(const SkIntersectionHelper& next) {
67 return fContour == next.fContour && fIndex + 1 == next.fIndex;
70 bool isFirstLast(const SkIntersectionHelper& next) {
71 return fContour == next.fContour && fIndex == 0
72 && next.fIndex == fLast - 1;
|
| /external/smack/src/org/jivesoftware/smackx/muc/ |
| ConnectionDetachedPacketCollector.java | 68 * @return the next packet result, or <tt>null</tt> if there are no more
76 * Returns the next available packet. The method call will block (not return)
79 * @return the next available packet.
91 * Returns the next available packet. The method call will block (not return)
95 * @param timeout the amount of time to wait for the next packet (in milleseconds).
96 * @return the next available packet.
|
| /external/tcpdump/ |
| print-igrp.c | 84 u_int nint, nsys, next; local
94 next = EXTRACT_16BITS(&hdr->ig_nx);
103 next);
115 } else if (next > 0) {
118 --next;
126 if (nint == 0 && nsys == 0 && next == 0)
|
| /external/v8/src/ |
| dateparser-inl.h | 101 token = scanner.Next()) {
114 if (scanner.Peek().IsSymbol('.')) scanner.Next();
119 int n = ReadMilliseconds(scanner.Next());
158 n = scanner.Next().number();
211 in_->Next();
230 DateToken sign_token = scanner->Next();
233 int year = scanner->Next().number();
237 day->Add(scanner->Next().number());
239 return scanner->Next();
243 !DayComposer::IsMonth(scanner->Peek().number())) return scanner->Next();
[all...] |
| /frameworks/base/core/java/android/content/ |
| CursorEntityIterator.java | 56 * @see EntityIterator#next()
67 * Returns the next object in the iteration, i.e. returns the element in
70 * @return the next object.
75 public Entity next() { method in class:CursorEntityIterator
77 throw new IllegalStateException("calling next() when the iterator is closed");
80 throw new IllegalStateException("you may only call next() if hasNext() is true");
|
| /frameworks/base/services/java/com/android/server/accessibility/ |
| EventStreamTransformation.java | 28 * output events to the next transformation in the sequence set via
49 * internal state and to propagate the event to the next one to enable subsequent
78 * Sets the next transformation.
80 * @param next The next transformation.
82 public void setNext(EventStreamTransformation next);
|
| /libcore/luni/src/main/java/java/util/ |
| AbstractSet.java | 79 Object next = it.next(); local
80 result += next == null ? 0 : next.hashCode();
102 if (collection.contains(it.next())) {
110 result = remove(it.next()) || result;
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| CompletionService.java | 63 * Retrieves and removes the Future representing the next
66 * @return the Future representing the next completed task
72 * Retrieves and removes the Future representing the next
75 * @return the Future representing the next completed task, or
81 * Retrieves and removes the Future representing the next
89 * @return the Future representing the next completed task or
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| insert_iter_size_value.pass.cpp | 48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
49 assert(i == next(l1.begin()));
69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
78 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
79 assert(i == next(l1.begin()));
99 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
| /packages/apps/Email/src/com/android/email/mail/store/imap/ |
| ImapResponseParser.java | 109 * Peek next one byte.
115 final int next = mIn.peek(); local
116 if (next == -1) {
119 return next;
129 int next = mIn.read(); local
130 if (next == -1) {
133 mDiscourseLogger.addReceivedByte(next);
134 return next;
150 * Reads the next response available on the stream and returns an
209 * Read next byte from stream and throw it away. If the byte is different from {@code expected
213 final int next = readByte(); local
295 final int next = peek(); local
331 final int next = peek(); local
406 final int next = peek(); local
[all...] |
| /system/core/libzipfile/ |
| zipfile.c | 35 Zipentry* next = entry->next; local
37 entry = next;
51 entry = entry->next;
143 entry = entry->next;
156 entry = entry->next;
|
| /external/llvm/test/CodeGen/X86/ |
| lsr-reuse.ll | 27 %i = phi i64 [ %i.next, %loop ], [ 0, %entry ]
35 %i.next = add nsw i64 %i, 1
36 %exitcond = icmp eq i64 %i.next, %n
72 %i = phi i64 [ %i.next, %loop ], [ 0, %entry ]
88 %i.next = add nsw i64 %i, 1
89 %exitcond = icmp eq i64 %i.next, %n
118 %i = phi i64 [ %i.next, %loop ], [ 0, %entry ]
134 %i.next = add nsw i64 %i, 1
135 %exitcond = icmp eq i64 %i.next, %n
163 %i = phi i64 [ %i.next, %loop ], [ 0, %entry
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| IntervalSet.java | 108 Interval r = (Interval) iter.next();
113 // next to each other, make a single larger interval
117 // should be merged with next interval in list
119 Interval next = (Interval) iter.next(); local
120 if ( bigger.adjacent(next)||!bigger.disjoint(next) ) {
121 // if we bump up against or overlap next, merge
124 iter.set(bigger.union(next)); // set to 3 merged ones
157 // next to each other, make a single larger interva
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MinMaxPriorityQueueTest.java | 309 it.next();
310 it.next();
312 it.next();
324 it.next();
325 it.next();
328 it.next();
350 Integer value = iter.next();
403 assertEquals((Integer) 1, it.next());
404 assertEquals((Integer) 20, it.next());
405 assertEquals((Integer) 100, it.next());
691 Integer next = q.pollFirst(); local
[all...] |
| /art/test/080-oom-throw/src/ |
| Main.java | 35 InstanceMemEater next; field in class:Main.InstanceMemEater
60 lastMemEater.next = InstanceMemEater.allocate();
61 lastMemEater = lastMemEater.next;
|
