| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
49 (elem)->next = elem; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
75 (elem)->next = list; \
77 (list)->prev->next = elem;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| simple_list.h | 45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
82 (elem)->next = list; \
84 (list)->prev->next = elem;
[all...] |
| /packages/apps/Email/tests/src/com/android/email/activity/ |
| FindParentMailboxTaskTest.java | 112 mIdParent, // Next root
113 mIdChild2, // Next highlighted
114 mIdChild2 // Next selected
132 mIdParent, // Next root
133 mIdParent, // Next highlighted
134 mIdParent // Next selected
151 Mailbox.NO_MAILBOX, // Next root
152 mIdParent, // Next highlighted
153 mIdParent // Next selected
170 Mailbox.NO_MAILBOX, // Next roo
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
| FillLayer.cpp | 164 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { }
167 for (FillLayer* pattern = this; curr; curr = curr->next()) {
173 pattern = pattern->next();
179 for (curr = this; curr && curr->isYPositionSet(); curr = curr->next()) { }
182 for (FillLayer* pattern = this; curr; curr = curr->next()) {
188 pattern = pattern->next();
194 for (curr = this; curr && curr->isAttachmentSet(); curr = curr->next()) { }
197 for (FillLayer* pattern = this; curr; curr = curr->next()) {
199 pattern = pattern->next();
205 for (curr = this; curr && curr->isClipSet(); curr = curr->next()) { }
286 FillLayer* next; local
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| scev-aa.ll | 13 ; CHECK: NoAlias: double* %pi, double* %pi.next
21 %i = phi i64 [ 0, %entry ], [ %i.next, %bb ]
23 %i.next = add i64 %i, 1
24 %pi.next = getelementptr double* %p, i64 %i.next
26 %y = load double* %pi.next
29 %exitcond = icmp eq i64 %i.next, %n
39 ; CHECK: NoAlias: double* %pi.j, double* %pi.next.j
40 ; CHECK: NoAlias: double* %pi.j, double* %pi.j.next
41 ; CHECK: NoAlias: double* %pi.j.next, double* %pi.next.
[all...] |
| /external/clang/test/CodeGenCXX/ |
| temporaries.cpp | 260 // CHECK-NEXT: call void @_ZN6PR58671fENS_1SEi
261 // CHECK-NEXT: call void @_ZN6PR58671SD1Ev
262 // CHECK-NEXT: ret void
270 // CHECK-NEXT: call void @_ZN6PR58671fENS_1SEi
271 // CHECK-NEXT: call void @_ZN6PR58671SD1Ev
272 // CHECK-NEXT: ret void
291 // CHECK-NEXT: ret void
312 // CHECK-NEXT: call i32 @_ZN3T121A1fEv(
313 // CHECK-NEXT: call i32* @_ZN3T121fEi(
314 // CHECK-NEXT: call void @_ZN3T121AD1Ev
[all...] |
| arm.cpp | 29 // CHECK-NEXT: call i32 @atexit(void ()* @__dtor_baz)
257 // CHECK-NEXT: store [[A]]* {{.*}}, [[A]]** [[PTR]], align 4
258 // CHECK-NEXT: [[TMP:%.*]] = load [[A]]** [[PTR]], align 4
259 // CHECK-NEXT: call [[A]]* @_ZN5test51AD1Ev([[A]]* [[TMP]])
260 // CHECK-NEXT: ret void
273 // CHECK-NEXT: store [[A]]* {{.*}}, [[A]]** [[AVAR]], align 4
274 // CHECK-NEXT: [[V:%.*]] = load [[A]]** [[AVAR]], align 4
275 // CHECK-NEXT: [[ISNULL:%.*]] = icmp eq [[A]]* [[V]], null
276 // CHECK-NEXT: br i1 [[ISNULL]]
278 // CHECK-NEXT: [[T1:%.*]] = load void ([[A]]*)*** [[T0]
[all...] |
| /external/llvm/test/Transforms/SROA/ |
| basictest.ll | 75 ; CHECK-NEXT: %[[test3_a2:.*]] = alloca [99 x i8]
76 ; CHECK-NEXT: %[[test3_a3:.*]] = alloca [16 x i8]
77 ; CHECK-NEXT: %[[test3_a4:.*]] = alloca [42 x i8]
78 ; CHECK-NEXT: %[[test3_a5:.*]] = alloca [7 x i8]
79 ; CHECK-NEXT: %[[test3_a6:.*]] = alloca [7 x i8]
80 ; CHECK-NEXT: %[[test3_a7:.*]] = alloca [85 x i8]
84 ; CHECK-NEXT: %[[gep_dst:.*]] = getelementptr inbounds [42 x i8]* %[[test3_a1]], i64 0, i64 0
85 ; CHECK-NEXT: call void @llvm.memcpy.p0i8.p0i8.i32(i8* %[[gep_dst]], i8* %src, i32 42
86 ; CHECK-NEXT: %[[gep:.*]] = getelementptr inbounds i8* %src, i64 42
87 ; CHECK-NEXT: %[[test3_r1:.*]] = load i8* %[[gep]
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| sext.ll | 97 ; CHECK-NEXT: br label %F
99 ; CHECK-NEXT: phi i16
100 ; CHECK-NEXT: ret i16
113 ; CHECK-NEXT: ashr exact i32
114 ; CHECK-NEXT: ret i32
124 ; CHECK-NEXT: icmp eq
125 ; CHECK-NEXT: sext <2 x i1>
126 ; CHECK-NEXT: store <2 x i16>
127 ; CHECK-NEXT: ret
146 ; CHECK-NEXT: %and = lshr i32 %x,
[all...] |
| sign-test-and-or.ll | 12 ; CHECK-NEXT: %1 = or i32 %a, %b
13 ; CHECK-NEXT: %2 = icmp slt i32 %1, 0
14 ; CHECK-NEXT: br
31 ; CHECK-NEXT: %1 = and i32 %a, %b
32 ; CHECK-NEXT: %2 = icmp sgt i32 %1, -1
33 ; CHECK-NEXT: br
50 ; CHECK-NEXT: %1 = and i32 %a, %b
51 ; CHECK-NEXT: %2 = icmp slt i32 %1, 0
52 ; CHECK-NEXT: br
69 ; CHECK-NEXT: %1 = or i32 %a, %
[all...] |
| div-shift.ll | 29 ; CHECK-NEXT: %1 = add i32 %y, 2
30 ; CHECK-NEXT: %2 = zext i32 %1 to i64
31 ; CHECK-NEXT: %3 = lshr i64 %x, %2
32 ; CHECK-NEXT: ret i64 %3
42 ; CHECK-NEXT: [[CMP:%.*]] = icmp ult i32 %y, 5
43 ; CHECK-NEXT: [[SEL:%.*]] = select i1 [[CMP]], i32 5, i32 %y
44 ; CHECK-NEXT: [[SHR:%.*]] = lshr i32 %x, [[SEL]]
45 ; CHECK-NEXT: ret i32 [[SHR]]
56 ; CHECK-NEXT: [[SEL1:%.*]] = select i1 %x, i32 5, i32 6
57 ; CHECK-NEXT: [[LSHR:%.*]] = lshr i32 %V, [[SEL1]
[all...] |
| /external/checkpolicy/ |
| queue.c | 38 newnode->next = NULL;
43 q->tail->next = newnode;
62 newnode->next = NULL;
67 newnode->next = q->head;
86 q->head = q->head->next;
117 p = p->next;
137 p = p->next;
158 last->next = p->next;
159 if (last->next == NULL
[all...] |
| /external/clang/test/CodeGen/ |
| annotations-var.c | 23 // PARAM-NEXT: call void @llvm.var.annotation(
24 // PARAM-NEXT: bitcast i32* [[V]] to i8*
25 // PARAM-NEXT: call void @llvm.var.annotation(
26 // PARAM-NEXT: bitcast i32* [[V]] to i8*
27 // PARAM-NEXT: call void @llvm.var.annotation(
28 // PARAM-NEXT: bitcast i32* [[V]] to i8*
29 // PARAM-NEXT: call void @llvm.var.annotation(
36 // LOCAL-NEXT: [[T0:%.*]] = bitcast i32* [[LOCALVAR]] to i8*
37 // LOCAL-NEXT: call void @llvm.var.annotation(i8* [[T0]], i8* getelementptr inbounds ([15 x i8]* @{{.*}}), i8* getelementptr inbounds ({{.*}}), i32 33)
38 // LOCAL-NEXT: [[T0:%.*]] = bitcast i32* [[LOCALVAR]] to i8
[all...] |
| /external/llvm/test/Transforms/LoopVectorize/X86/ |
| parallel-loops-after-reg2mem.ll | 13 %indvars.iv.next.reg2mem = alloca i64
28 %indvars.iv.next = add i64 %indvars.iv.reload, 1
30 store i64 %indvars.iv.next, i64* %indvars.iv.next.reg2mem
31 %indvars.iv.next.reload1 = load i64* %indvars.iv.next.reg2mem
32 %arrayidx6 = getelementptr inbounds i32* %b, i64 %indvars.iv.next.reload1
35 %indvars.iv.next.reload = load i64* %indvars.iv.next.reg2mem
36 %lftr.wideiv = trunc i64 %indvars.iv.next.reload to i3
[all...] |
| /external/clang/test/CXX/except/except.spec/ |
| p14-ir.cpp | 31 // CHECK-NEXT: ret void
32 // CHECK-NEXT: }
36 // CHECK-NEXT: ret void
37 // CHECK-NEXT: }
60 // CHECK-NEXT: ret void
66 // CHECK-NEXT: ret void
72 // CHECK-NEXT: bitcast
73 // CHECK-NEXT: call void @_ZN2X7C2Ev({{.*}})
78 // CHECK-NEXT: ret void
|
| /external/clang/test/Misc/ |
| warning-flags-tree.c | 18 // CHECK-NEXT: -Wstrict-aliasing=0
19 // CHECK-NEXT: -Wstrict-aliasing=1
20 // CHECK-NEXT: -Wstrict-aliasing=2
22 // CHECK-NEXT: -Wstrict-overflow=0
23 // CHECK-NEXT: -Wstrict-overflow=1
24 // CHECK-NEXT: -Wstrict-overflow=2
25 // CHECK-NEXT: -Wstrict-overflow=3
26 // CHECK-NEXT: -Wstrict-overflow=4
27 // CHECK-NEXT: -Wstrict-overflow=5
|
| /external/llvm/test/CodeGen/ARM/ |
| fp.ll | 6 ;CHECK-NEXT: vcvt.f32.s32
7 ;CHECK-NEXT: vmov
16 ;CHECK-NEXT: vcvt.f64.s32
17 ;CHECK-NEXT: vmov
26 ;CHECK-NEXT: vcvt.f64.u32
27 ;CHECK-NEXT: vmov
36 ;CHECK-NEXT: vcvt.f32.u32
37 ;CHECK-NEXT: vmov
46 ;CHECK-NEXT: vmov
|
| /external/llvm/test/CodeGen/XCore/ |
| addsub64.ll | 8 ; CHECK-NEXT: ladd r2, r0, r0, r2, r11
9 ; CHECK-NEXT: ladd r2, r1, r1, r3, r2
10 ; CHECK-NEXT: retsp 0
18 ; CHECK-NEXT: lsub r2, r0, r0, r2, r11
19 ; CHECK-NEXT: lsub r2, r1, r1, r3, r2
20 ; CHECK-NEXT: retsp 0
32 ; CHECK-NEXT: retsp 0
44 ; CHECK-NEXT: retsp 0
59 ; CHECK-NEXT: retsp 0
|
| /external/llvm/test/Object/ |
| archive-move.test | 28 CHECK-NEXT: oddlen
29 CHECK-NEXT: IsNAN.o
30 CHECK-NEXT: very_long_bytecode_file_name.bc
38 BEFORE-NEXT: evenlen
39 BEFORE-NEXT: oddlen
40 BEFORE-NEXT: IsNAN.o
48 AFTER-NEXT: very_long_bytecode_file_name.bc
49 AFTER-NEXT: oddlen
50 AFTER-NEXT: IsNAN.o
|
| archive-toc.test | 5 GNU-NEXT: rw-r--r-- 500/500 7 Nov 19 02:57 2004 oddlen
6 GNU-NEXT: rwxr-xr-x 500/500 1465 Nov 19 03:01 2004 very_long_bytecode_file_name.bc
7 GNU-NEXT: rw-r--r-- 500/500 2280 Nov 19 03:04 2004 IsNAN.o
15 OSX-NEXT: rw-r--r-- 501/501 8 Nov 19 02:57 2004 oddlen
16 OSX-NEXT: rw-r--r-- 502/502 1465 Feb 4 06:59 2010 very_long_bytecode_file_name.bc
17 OSX-NEXT: rw-r--r-- 501/501 2280 Nov 19 04:32 2004 IsNAN.o
26 CHECK-NEXT: rw-r--r-- 1002/102 7 Nov 19 03:24 2004 oddlen
27 CHECK-NEXT: rwxr-xr-x 1002/102 1465 Nov 19 03:24 2004 very_long_bytecode_file_name.bc
28 CHECK-NEXT: rw-r--r-- 1002/102 2280 Nov 19 03:24 2004 IsNAN.o
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| runtime-check-readonly.ll | 9 ;CHECK-NEXT: getelementptr
10 ;CHECK-NEXT: icmp uge
11 ;CHECK-NEXT: icmp uge
12 ;CHECK-NEXT: icmp uge
13 ;CHECK-NEXT: icmp uge
14 ;CHECK-NEXT: and
21 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
29 %indvars.iv.next = add i64 %indvars.iv, 1
30 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
| /libcore/luni/src/main/java/java/util/ |
| Iterator.java | 24 * methods {@code next} and {@code hasNext()} may throw a {@code ConcurrentModificationException}.
38 * @see #next
43 * Returns the next object and advances the iterator.
45 * @return the next object.
50 public E next(); method in interface:Iterator
53 * Removes the last object returned by {@code next} from the collection.
54 * This method can only be called once between each call to {@code next}.
60 * if {@code next} has not been called, or {@code remove} has
61 * already been called after the last call to {@code next}.
|
| /libcore/luni/src/main/java/libcore/util/ |
| CollectionUtils.java | 43 private T next; local
47 while (next == null && delegate.hasNext()) {
48 next = delegate.next().get();
49 if (trim && next == null) {
57 return next != null;
60 @Override public T next() { method
64 T result = next;
66 next = null;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| iter_iter_alloc.pass.cpp | 49 assert(*next(m.begin(), 0) == 1);
50 assert(*next(m.begin(), 1) == 1);
51 assert(*next(m.begin(), 2) == 1);
52 assert(*next(m.begin(), 3) == 2);
53 assert(*next(m.begin(), 4) == 2);
54 assert(*next(m.begin(), 5) == 2);
55 assert(*next(m.begin(), 6) == 3);
56 assert(*next(m.begin(), 7) == 3);
57 assert(*next(m.begin(), 8) == 3);
|
| iter_iter_comp.pass.cpp | 44 assert(*next(m.begin(), 0) == 1);
45 assert(*next(m.begin(), 1) == 1);
46 assert(*next(m.begin(), 2) == 1);
47 assert(*next(m.begin(), 3) == 2);
48 assert(*next(m.begin(), 4) == 2);
49 assert(*next(m.begin(), 5) == 2);
50 assert(*next(m.begin(), 6) == 3);
51 assert(*next(m.begin(), 7) == 3);
52 assert(*next(m.begin(), 8) == 3);
|
