| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/ |
| member_swap.pass.cpp | 33 assert(*next(c1.begin(), 0) == 10);
34 assert(*next(c1.begin(), 1) == 11);
35 assert(*next(c1.begin(), 2) == 12);
39 assert(*next(c2.begin(), 0) == 0);
40 assert(*next(c2.begin(), 1) == 1);
41 assert(*next(c2.begin(), 2) == 2);
42 assert(*next(c2.begin(), 3) == 3);
43 assert(*next(c2.begin(), 4) == 4);
44 assert(*next(c2.begin(), 5) == 5);
60 assert(*next(c2.begin(), 0) == 0)
[all...] |
| non_member_swap.pass.cpp | 34 assert(*next(c1.begin(), 0) == 10);
35 assert(*next(c1.begin(), 1) == 11);
36 assert(*next(c1.begin(), 2) == 12);
40 assert(*next(c2.begin(), 0) == 0);
41 assert(*next(c2.begin(), 1) == 1);
42 assert(*next(c2.begin(), 2) == 2);
43 assert(*next(c2.begin(), 3) == 3);
44 assert(*next(c2.begin(), 4) == 4);
45 assert(*next(c2.begin(), 5) == 5);
61 assert(*next(c2.begin(), 0) == 0)
[all...] |
| /external/clang/test/CodeGenCXX/ |
| microsoft-abi-vtables-multiple-nonvirtual-inheritance.cpp | 45 // NO-THUNKS-Test1-NEXT: 0 | void no_thunks::Test1::f()
48 // NO-THUNKS-Test1-NEXT: 0 | void B::g()
49 // NO-THUNKS-Test1-NEXT: 1 | void B::h()
52 // NO-THUNKS-Test1-NEXT: 0 | void no_thunks::Test1::f()
62 // NO-THUNKS-Test2-NEXT: 0 | void A::f()
65 // NO-THUNKS-Test2-NEXT: 0 | void no_thunks::Test2::g()
66 // NO-THUNKS-Test2-NEXT: 1 | void B::h()
69 // NO-THUNKS-Test2-NEXT: via vfptr at offset 4
70 // NO-THUNKS-Test2-NEXT: 0 | void no_thunks::Test2::g()
81 // NO-THUNKS-Test3-NEXT: 0 | void A::f(
[all...] |
| exceptions.cpp | 31 // CHECK-NEXT: [[CAST:%.*]] = bitcast i8* [[NEW]] to [[A]]*
32 // CHECK-NEXT: invoke void @_ZN5test11AC1Ei([[A]]* [[CAST]], i32 5)
41 // CHECK-NEXT: [[CAST:%.*]] = bitcast i8* [[NEW]] to [[A]]*
42 // CHECK-NEXT: [[FOO:%.*]] = invoke i32 @_ZN5test13fooEv()
56 // CHECK-NEXT: [[NEW:%.*]] = call noalias i8* @_Znwm(i64 8)
57 // CHECK-NEXT: store i1 true, i1* [[ACTIVE]]
58 // CHECK-NEXT: [[CAST:%.*]] = bitcast i8* [[NEW]] to [[A]]*
59 // CHECK-NEXT: invoke void @_ZN5test11BC1Ev([[B:%.*]]* [[T0:%.*]])
61 // CHECK-NEXT: [[T2:%.*]] = load i32* [[T1]], align 4
62 // CHECK-NEXT: invoke void @_ZN5test11AC1Ei([[A]]* [[CAST]], i32 [[T2]]
[all...] |
| rvalue-references.cpp | 12 // CHECK-NEXT: bitcast %struct.B*
13 // CHECK-NEXT: getelementptr inbounds i8*
14 // CHECK-NEXT: bitcast i8* {{.*}} to %struct.A*
15 // CHECK-NEXT: ret %struct.A*
24 // CHECK-NEXT: ret i32*
29 // CHECK-NEXT: ret i32*
34 // CHECK-NEXT: store i32 {{.*}}, i32*
35 // CHECK-NEXT: ret i32*
67 // CHECK-NEXT: call void @_ZN1CD1Ev
68 // CHECK-NEXT: ret voi
[all...] |
| value-init.cpp | 46 // CHECK-NEXT: bitcast
47 // CHECK-NEXT: call void @llvm.memset
48 // CHECK-NEXT: call void @_ZN19enum_holder_and_intC1Ev
50 // CHECK-NEXT: ret void
154 // CHECK-NEXT: call void @_ZN8zeroinit2X1C1Ev
155 // CHECK-NEXT: call void @_ZN8zeroinit2X11fEv
177 // CHECK-NEXT: ret void
207 // CHECK-NEXT: [[INNER:%.*]] = getelementptr inbounds [10 x [20 x [[A]]]]* [[ARR]], i64 0, i64 0
208 // CHECK-NEXT: [[T0:%.*]] = getelementptr inbounds [20 x [[A]]]* [[INNER]], i64 0, i64 0
209 // CHECK-NEXT: call void @_ZN5test61AC1Ei([[A]]* [[T0]], i32 5
[all...] |
| /external/iptables/libiptc/ |
| linux_list.h | 48 * sometimes we already know the next/prev entries and we can
54 struct list_head *next, *prev; member in struct:list_head
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
70 * the prev/next entries already!
74 struct list_head *next)
76 next->prev = new;
77 new->next = next;
79 prev->next = new;
92 __list_add(new, head, head->next);
279 struct list_head *next = head->next; local
514 struct hlist_node *next, **pprev; member in struct:hlist_node
534 struct hlist_node *next = n->next; local
[all...] |
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| array-iterator.js | 48 assertIteratorResult('a', false, iterator.next());
49 assertIteratorResult('b', false, iterator.next());
50 assertIteratorResult('c', false, iterator.next());
51 assertIteratorResult(void 0, true, iterator.next());
54 assertIteratorResult(void 0, true, iterator.next());
61 assertIteratorResult('a', false, iterator.next());
62 assertIteratorResult('b', false, iterator.next());
63 assertIteratorResult('c', false, iterator.next());
65 assertIteratorResult('d', false, iterator.next());
66 assertIteratorResult(void 0, true, iterator.next());
[all...] |
| /external/clang/test/CodeGenObjCXX/ |
| arc-special-member-functions.mm | 34 // CHECK-NEXT: ret void
61 // CHECK-NEXT: ret void
67 // CHECK-NEXT: br label
74 // CHECK-NEXT: call void @_ZN15ObjCBlockMemberD1Ev
75 // CHECK-NEXT: ret void
82 // CHECK-NEXT: call void @_ZN15ObjCBlockMemberD1Ev
83 // CHECK-NEXT: ret void
90 // CHECK-NEXT: ret void
96 // CHECK-NEXT: [[T1:%.*]] = load i32 (i32)** [[T0]], align 8
97 // CHECK-NEXT: [[T2:%.*]] = bitcast i32 (i32)* [[T1]] to i8
[all...] |
| arc-new-delete.mm | 9 // CHECK-NEXT: store i8* null, i8** [[INVALUEADDR]]
10 // CHECK-NEXT: call void @objc_storeStrong(i8** [[INVALUEADDR]], i8* [[INVALUE:%.*]])
13 // CHECK-NEXT: {{bitcast i8\*.*to i8\*\*}}
14 // CHECK-NEXT: store i8* null, i8**
17 // CHECK-NEXT: {{bitcast i8\*.*to i8\*\*}}
18 // CHECK-NEXT: store i8* null, i8**
22 // CHECK-NEXT: {{bitcast i8\*.*to i8\*\*}}
23 // CHECK-NEXT: store i8* null, i8**
26 // CHECK-NEXT: {{bitcast i8\*.*to i8\*\*}}
27 // CHECK-NEXT: store i8* null, i8*
[all...] |
| arc.mm | 23 // CHECK-NEXT: [[T1:%.*]] = call i8* @objc_retainAutoreleasedReturnValue(i8* [[T0]])
24 // CHECK-NEXT: [[T2:%.*]] = load i8*** {{%.*}}, align 8
25 // CHECK-NEXT: [[T3:%.*]] = call i8* @objc_storeWeak(i8** [[T2]], i8* [[T1]])
26 // CHECK-NEXT: [[T4:%.*]] = call i8* @objc_retain(i8* [[T3]])
27 // CHECK-NEXT: store i8* [[T4]], i8**
28 // CHECK-NEXT: call void @objc_release(i8* [[T1]])
32 // CHECK-NEXT: [[T1:%.*]] = call i8* @objc_retainAutoreleasedReturnValue(i8* [[T0]])
33 // CHECK-NEXT: [[T2:%.*]] = load i8*** {{%.*}}, align 8
34 // CHECK-NEXT: [[T3:%.*]] = call i8* @objc_storeWeak(i8** [[T2]], i8* [[T1]])
35 // CHECK-NEXT: [[T4:%.*]] = call i8* @objc_loadWeakRetained(i8** [[T2]]
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| load-cmp.ll | 14 ; CHECK-NEXT: %R = icmp eq i32 %X, 9
15 ; CHECK-NEXT: ret i1 %R
24 ; CHECK-NEXT: %R = icmp ne i32 %X, 4
25 ; CHECK-NEXT: ret i1 %R
34 ; CHECK-NEXT: %R = icmp eq i32 %X, 1
35 ; CHECK-NEXT: ret i1 %R
44 ; CHECK-NEXT: lshr i32 933, %X
45 ; CHECK-NEXT: and i32 {{.*}}, 1
46 ; CHECK-NEXT: %R = icmp ne i32 {{.*}}, 0
47 ; CHECK-NEXT: ret i1 %
[all...] |
| rem.ll | 8 ; CHECK-NEXT: ret i32 0
15 ; CHECK-NEXT: ret i32 0
22 ; CHECK-NEXT: [[AND:%.*]] = and i32 %A, 7
23 ; CHECK-NEXT: ret i32 [[AND]]
30 ; CHECK-NEXT: [[AND:%.*]] = and i32 %A, 7
31 ; CHECK-NEXT: [[CMP:%.*]] = icmp ne i32 [[AND]], 0
32 ; CHECK-NEXT: ret i1 [[CMP]]
40 ; CHECK-NEXT: [[SEL:%.*]] = select i1 %C, i32 0, i32 7
41 ; CHECK-NEXT: [[AND:%.*]] = and i32 [[SEL]], %X
49 ; CHECK-NEXT: [[ZEXT:%.*]] = zext i8 %B to i3
[all...] |
| LandingPadClauses.ll | 52 ; CHECK-NEXT: @T1
53 ; CHECK-NEXT: @T2
54 ; CHECK-NEXT: unreachable
62 ; CHECK-NEXT: filter
63 ; CHECK-NEXT: unreachable
72 ; CHECK-NEXT: @T1
73 ; CHECK-NEXT: filter [0 x i32*]
74 ; CHECK-NEXT: unreachable
81 ; CHECK-NEXT: filter [1 x i32*] zeroinitializer
82 ; CHECK-NEXT: unreachabl
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| resize_size.pass.cpp | 45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 1);
47 assert(*next(c.begin(), 2) == 2);
51 assert(*next(c.begin(), 0) == 0);
52 assert(*next(c.begin(), 1) == 1);
53 assert(*next(c.begin(), 2) == 2);
54 assert(*next(c.begin(), 3) == 0);
55 assert(*next(c.begin(), 4) == 0);
56 assert(*next(c.begin(), 5) == 0);
60 assert(*next(c.begin(), 0) == 0)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| list.h | 11 * The above copyright notice and this permission notice (including the next
31 * \c next pointer being \c NULL.
33 * A list is empty if either the head sentinel's \c next pointer points to the
43 * - A \c head pointer that represents the \c next pointer of the
46 * sentinel node and the \c next pointer of the tail sentinel node. This
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
75 struct exec_node *next; member in struct:exec_node
98 exec_node() : next(NULL), prev(NULL)
105 return next;
110 return next;
229 void next() function in class:iterator
251 void next() function in class:exec_list_iterator
[all...] |
| /external/mesa3d/src/glsl/ |
| list.h | 11 * The above copyright notice and this permission notice (including the next
31 * \c next pointer being \c NULL.
33 * A list is empty if either the head sentinel's \c next pointer points to the
43 * - A \c head pointer that represents the \c next pointer of the
46 * sentinel node and the \c next pointer of the tail sentinel node. This
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
75 struct exec_node *next; member in struct:exec_node
98 exec_node() : next(NULL), prev(NULL)
105 return next;
110 return next;
229 void next() function in class:iterator
251 void next() function in class:exec_list_iterator
[all...] |
| /dalvik/vm/compiler/ |
| IntermediateRep.cpp | 37 mir->prev = mir->next = NULL;
39 bb->lastMIRInsn->next = mir;
41 mir->next = NULL;
52 mir->prev = mir->next = NULL;
55 mir->next = bb->firstMIRInsn;
65 newMIR->next = currentMIR->next;
66 currentMIR->next = newMIR;
68 if (newMIR->next) {
70 newMIR->next->prev = newMIR
[all...] |
| /external/clang/test/CodeGen/ |
| trapv.c | 10 // CHECK-NEXT: [[T2:%.*]] = load i32* @uk
11 // CHECK-NEXT: [[T3:%.*]] = add i32 [[T1]], [[T2]]
12 // CHECK-NEXT: store i32 [[T3]], i32* @ui
16 // CHECK-NEXT: [[T2:%.*]] = load i32* @k
17 // CHECK-NEXT: [[T3:%.*]] = call { i32, i1 } @llvm.sadd.with.overflow.i32(i32 [[T1]], i32 [[T2]])
18 // CHECK-NEXT: [[T4:%.*]] = extractvalue { i32, i1 } [[T3]], 0
19 // CHECK-NEXT: [[T5:%.*]] = extractvalue { i32, i1 } [[T3]], 1
20 // CHECK-NEXT: [[T6:%.*]] = xor i1 [[T5]], true
21 // CHECK-NEXT: br i1 [[T6]]
32 // CHECK-NEXT: [[T2:%.*]] = call { i32, i1 } @llvm.sadd.with.overflow.i32(i32 [[T1]], i32 1
[all...] |
| /external/llvm/test/MC/PowerPC/ |
| ppc64-errors.s | 8 # CHECK-NEXT: add 32, 32, 32
12 # CHECK-NEXT: add %r32, %r32, %r32
18 # CHECK-NEXT: add 3, symbol@tls, 4
22 # CHECK-NEXT: subf 3, 4, symbol@tls
28 # CHECK-NEXT: addi 1, 0, -32769
32 # CHECK-NEXT: addi 1, 0, 32768
38 # CHECK-NEXT: ori 1, 2, -1
42 # CHECK-NEXT: ori 1, 2, 65536
56 # CHECK-NEXT: lwz 1, 0(32)
60 # CHECK-NEXT: lwz 1, 0(%r32
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions
161 struct draw_stage *next = draw->pipeline.rasterize; local
167 /* Set the validate's next stage to the rasterize stage, so that it
170 stage->next = next;
196 draw->pipeline.aaline->next = next;
197 next = draw->pipeline.aaline;
202 draw->pipeline.aapoint->next = next;
[all...] |
| /external/compiler-rt/lib/tsan/lit_tests/ |
| simple_stack.c | 51 // CHECK-NEXT: Write of size 4 at {{.*}} by thread T1:
52 // CHECK-NEXT: #0 foo1{{.*}} {{.*}}simple_stack.c:9{{(:3)?}} ({{.*}})
53 // CHECK-NEXT: #1 bar1{{.*}} {{.*}}simple_stack.c:14{{(:3)?}} ({{.*}})
54 // CHECK-NEXT: #2 Thread1{{.*}} {{.*}}simple_stack.c:28{{(:3)?}} ({{.*}})
56 // CHECK-NEXT: #0 foo2{{.*}} {{.*}}simple_stack.c:18{{(:26)?}} ({{.*}})
57 // CHECK-NEXT: #1 bar2{{.*}} {{.*}}simple_stack.c:23{{(:3)?}} ({{.*}})
58 // CHECK-NEXT: #2 Thread2{{.*}} {{.*}}simple_stack.c:33{{(:3)?}} ({{.*}})
60 // CHECK-NEXT: #0 pthread_create {{.*}} ({{.*}})
61 // CHECK-NEXT: #1 StartThread{{.*}} {{.*}}simple_stack.c:38{{(:3)?}} ({{.*}})
62 // CHECK-NEXT: #2 main{{.*}} {{.*}}simple_stack.c:43{{(:3)?}} ({{.*}}
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions
161 struct draw_stage *next = draw->pipeline.rasterize; local
167 /* Set the validate's next stage to the rasterize stage, so that it
170 stage->next = next;
196 draw->pipeline.aaline->next = next;
197 next = draw->pipeline.aaline;
202 draw->pipeline.aapoint->next = next;
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| NXTRecord.java | 9 * Next name - this record contains the following name in an ordered list
21 private Name next; field in class:NXTRecord
33 * @param next The following name in an ordered list of the zone
37 NXTRecord(Name name, int dclass, long ttl, Name next, BitSet bitmap) {
39 this.next = checkName("next", next);
45 next = new Name(in);
58 next = st.getName(origin);
76 sb.append(next);
[all...] |
| /external/kernel-headers/original/linux/ |
| list.h | 16 * sometimes we already know the next/prev entries and we can
22 struct list_head *next, *prev; member in struct:list_head
32 list->next = list;
40 * the prev/next entries already!
44 struct list_head *next)
46 next->prev = new;
47 new->next = next;
49 prev->next = new;
62 __list_add(new, head, head->next);
302 struct list_head *next = head->next; local
597 struct hlist_node *next, **pprev; member in struct:hlist_node
621 struct hlist_node *next = n->next; local
678 struct hlist_node *next = old->next; local
[all...] |
