| /external/clang/test/CodeGenObjCXX/ |
| arc-new-delete.mm | 9 // CHECK-NEXT: call i8* @objc_retain
12 // CHECK-NEXT: {{bitcast i8\*.*to i8\*\*}}
13 // CHECK-NEXT: store i8* null, i8**
16 // CHECK-NEXT: {{bitcast i8\*.*to i8\*\*}}
17 // CHECK-NEXT: store i8* null, i8**
21 // CHECK-NEXT: {{bitcast i8\*.*to i8\*\*}}
22 // CHECK-NEXT: store i8* null, i8**
25 // CHECK-NEXT: {{bitcast i8\*.*to i8\*\*}}
26 // CHECK-NEXT: store i8* null, i8**
60 // CHECK-NEXT: call void @objc_releas
[all...] |
| arc-move.mm | 9 // CHECK-NEXT: call void @objc_release
11 // CHECK-NEXT: ret void
40 // CHECK-NEXT: load i8**
41 // CHECK-NEXT: store i8*
42 // CHECK-NEXT: call void @objc_release
43 // CHECK-NEXT: ret void
51 // CHECK-NEXT: [[OBJ:%[a-zA-Z0-9]+]] = load i8** [[Y]]
53 // CHECK-NEXT: store i8* null, i8** [[Y]]
55 // CHECK-NEXT: store i8* [[OBJ]], i8** [[X:%[a-zA-Z0-9]+]]
58 // CHECK-NEXT: store i32 1
[all...] |
| property-object-conditional-exp.mm | 26 // CHECK-NEXT: bitcast
27 // CHECK-NEXT:getelementptr { i8*, i32 }* [[SRC:%.*]]
28 // CHECK-NEXT:extractvalue
29 // CHECK-NEXT:store
30 // CHECK-NEXT:getelementptr { i8*, i32 }* [[SRC:%.*]]
31 // CHECK-NEXT:extractvalue
32 // CHECK-NEXT:store
|
| /external/clang/test/CodeGen/ |
| compound-literal.c | 20 // CHECK-NEXT: [[COMPOUNDLIT:%[a-zA-Z0-9.]+]] = alloca [[STRUCT]]
21 // CHECK-NEXT: [[CX:%[a-zA-Z0-9.]+]] = getelementptr inbounds [[STRUCT]]* [[COMPOUNDLIT]], i32 0, i32 0
22 // CHECK-NEXT: [[SY:%[a-zA-Z0-9.]+]] = getelementptr inbounds [[STRUCT]]* [[S]], i32 0, i32 1
23 // CHECK-NEXT: [[TMP:%[a-zA-Z0-9.]+]] = load i32* [[SY]]
24 // CHECK-NEXT: store i32 [[TMP]], i32* [[CX]]
25 // CHECK-NEXT: [[CY:%[a-zA-Z0-9.]+]] = getelementptr inbounds [[STRUCT]]* [[COMPOUNDLIT]], i32 0, i32 1
26 // CHECK-NEXT: [[SX:%[a-zA-Z0-9.]+]] = getelementptr inbounds [[STRUCT]]* [[S]], i32 0, i32 0
27 // CHECK-NEXT: [[TMP:%[a-zA-Z0-9.]+]] = load i32* [[SX]]
28 // CHECK-NEXT: store i32 [[TMP]], i32* [[CY]]
29 // CHECK-NEXT: [[SI8:%[a-zA-Z0-9.]+]] = bitcast [[STRUCT]]* [[S]] to i8
[all...] |
| annotations-field.c | 17 // CHECK-NEXT: bitcast i32* {{.*}} to i8*
18 // CHECK-NEXT: call i8* @llvm.ptr.annotation.p0i8({{.*}}str{{.*}}str{{.*}}i32 8)
19 // CHECK-NEXT: bitcast i8* {{.*}} to i32*
20 // CHECK-NEXT: bitcast i32* {{.*}} to i8*
21 // CHECK-NEXT: call i8* @llvm.ptr.annotation.p0i8({{.*}}str{{.*}}str{{.*}}i32 8)
22 // CHECK-NEXT: bitcast i8* {{.*}} to i32*
25 // CHECK-NEXT: call i8* @llvm.ptr.annotation.p0i8({{.*}}str{{.*}}str{{.*}}i32 8)
|
| /external/clang/test/CodeGenCXX/ |
| 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...] |
| catch-undef-behavior.cpp | 13 // CHECK-NEXT: icmp uge i64 %[[SIZE]], 4
16 // CHECK-NEXT: %[[MISALIGN:.*]] = and i64 %[[PTRINT]], 3
17 // CHECK-NEXT: icmp eq i64 %[[MISALIGN]], 0
36 // CHECK-NEXT: icmp uge i64 %[[SIZE]], 24
39 // CHECK-NEXT: %[[MISALIGN:.*]] = and i64 %[[PTRINT]], 7
40 // CHECK-NEXT: icmp eq i64 %[[MISALIGN]], 0
48 // CHECK-NEXT: icmp uge i64 %[[SIZE]], 4
51 // CHECK-NEXT: %[[MISALIGN:.*]] = and i64 %[[PTRINT]], 3
52 // CHECK-NEXT: icmp eq i64 %[[MISALIGN]], 0
62 // CHECK-NEXT: icmp uge i64 %[[SIZE]], 2
[all...] |
| /external/compiler-rt/lib/tsan/output_tests/ |
| simple_stack.c | 50 // CHECK-NEXT: Write of size 4 at {{.*}} by thread 1:
51 // CHECK-NEXT: #0 foo1{{.*}} {{.*}}simple_stack.c:8{{(:3)?}} ({{.*}})
52 // CHECK-NEXT: #1 bar1{{.*}} {{.*}}simple_stack.c:13{{(:3)?}} ({{.*}})
53 // CHECK-NEXT: #2 Thread1{{.*}} {{.*}}simple_stack.c:27{{(:3)?}} ({{.*}})
55 // CHECK-NEXT: #0 foo2{{.*}} {{.*}}simple_stack.c:17{{(:26)?}} ({{.*}})
56 // CHECK-NEXT: #1 bar2{{.*}} {{.*}}simple_stack.c:22{{(:3)?}} ({{.*}})
57 // CHECK-NEXT: #2 Thread2{{.*}} {{.*}}simple_stack.c:32{{(:3)?}} ({{.*}})
59 // CHECK-NEXT: #0 pthread_create {{.*}} ({{.*}})
60 // CHECK-NEXT: #1 StartThread{{.*}} {{.*}}simple_stack.c:37{{(:3)?}} ({{.*}})
61 // CHECK-NEXT: #2 main{{.*}} {{.*}}simple_stack.c:42{{(:3)?}} ({{.*}}
[all...] |
| simple_stack2.cc | 45 // CHECK-NEXT: Write of size 4 at {{.*}} by thread 1:
46 // CHECK-NEXT: #0 foo1{{.*}} {{.*}}simple_stack2.cc:8{{(:3)?}} ({{.*}})
47 // CHECK-NEXT: #1 bar1{{.*}} {{.*}}simple_stack2.cc:15{{(:3)?}} ({{.*}})
48 // CHECK-NEXT: #2 Thread1{{.*}} {{.*}}simple_stack2.cc:33{{(:3)?}} ({{.*}})
50 // CHECK-NEXT: #0 foo2{{.*}} {{.*}}simple_stack2.cc:19{{(:28)?}} ({{.*}})
51 // CHECK-NEXT: #1 bar2{{.*}} {{.*}}simple_stack2.cc:28{{(:3)?}} ({{.*}})
52 // CHECK-NEXT: #2 main{{.*}} {{.*}}simple_stack2.cc:40{{(:3)?}} ({{.*}})
|
| /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...] |
| /external/llvm/test/Transforms/InstCombine/ |
| 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...] |
| /external/clang/test/CodeGenObjC/ |
| arc-property.m | 27 // CHECK-NEXT: [[T0:%.*]] = bitcast [[TEST1:%.*]]* {{%.*}} to i8*
28 // CHECK-NEXT: [[T1:%.*]] = getelementptr inbounds i8* [[T0]], i64 [[OFFSET]]
29 // CHECK-NEXT: [[T2:%.*]] = bitcast i8* [[T1]] to [[S1]]**
30 // CHECK-NEXT: [[T3:%.*]] = load [[S1]]** [[T2]], align 8
31 // CHECK-NEXT: ret [[S1]]* [[T3]]
36 // CHECK-NEXT: [[OFFSET:%.*]] = load i64* @"OBJC_IVAR_$_Test1.pointer"
37 // CHECK-NEXT: [[T1:%.*]] = load [[S1]]** {{%.*}}
38 // CHECK-NEXT: [[T2:%.*]] = bitcast [[S1]]* [[T1]] to i8*
39 // CHECK-NEXT: call void @objc_setProperty(i8* [[T0]], i8* {{%.*}}, i64 [[OFFSET]], i8* [[T2]], i1 zeroext false, i1 zeroext false)
40 // CHECK-NEXT: ret voi
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 * the prev/next entries already!
45 struct list_head * next)
47 next->prev = add;
48 add->next = next;
50 prev->next = add;
63 __list_add(add, head, head->next);
[all...] |
| /external/skia/src/utils/ |
| SkNWayCanvas.cpp | 48 bool next() { function in class:SkNWayCanvas::Iter
65 while (iter.next()) {
74 while (iter.next()) {
82 while (iter.next()) {
90 while (iter.next()) {
98 while (iter.next()) {
106 while (iter.next()) {
114 while (iter.next()) {
122 while (iter.next()) {
130 while (iter.next()) {
[all...] |
| /external/linux-tools-perf/util/include/linux/added/ |
| list.h | 13 list->next = list;
21 * the prev/next entries already!
26 struct list_head *next)
28 next->prev = new;
29 new->next = next;
31 prev->next = new;
36 struct list_head *next);
49 __list_add(new, head, head->next);
67 * Delete a list entry by making the prev/next entrie
187 struct list_head *next = head->next; local
566 struct hlist_node *next = n->next; local
[all...] |
| /external/clang/test/Index/ |
| file-refs.c | 28 // CHECK-NEXT: EnumConstantDecl=VALUE:2:3 (Definition) =[2:3 - 2:8]
29 // CHECK-NEXT: DeclRefExpr=VALUE:2:3 =[8:19 - 8:24]
32 // CHECK-NEXT: DeclRefExpr=glob_x:5:12
33 // CHECK-NEXT: VarDecl=glob_x:5:12 =[5:12 - 5:18]
34 // CHECK-NEXT: DeclRefExpr=glob_x:5:12 =[8:12 - 8:18]
37 // CHECK-NEXT: DeclRefExpr=x:7:11
38 // CHECK-NEXT: ParmDecl=x:7:11 (Definition) =[7:11 - 7:12]
39 // CHECK-NEXT: DeclRefExpr=x:7:11 =[8:10 - 8:11]
42 // CHECK-NEXT: FieldDecl=x:12:7 (Definition)
43 // CHECK-NEXT: FieldDecl=x:12:7 (Definition) =[12:7 - 12:8
[all...] |
| index-refs.cpp | 74 // CHECK-NEXT: [indexDeclaration]: kind: variable | name: gx
75 // CHECK-NEXT: [indexDeclaration]: kind: typedef | name: MyInt
76 // CHECK-NEXT: [indexDeclaration]: kind: enum
77 // CHECK-NEXT: [indexDeclaration]: kind: enumerator | name: EnumVal
78 // CHECK-NEXT: [indexDeclaration]: kind: variable | name: gx
79 // CHECK-NEXT: [indexEntityReference]: kind: namespace | name: NS
80 // CHECK-NEXT: [indexEntityReference]: kind: typedef | name: MyInt
81 // CHECK-NEXT: [indexEntityReference]: kind: namespace | name: NS
82 // CHECK-NEXT: [indexEntityReference]: kind: enumerator | name: EnumVal
83 // CHECK-NEXT: [indexDeclaration]: kind: function | name: fo
[all...] |
| /external/llvm/test/Transforms/LoopUnswitch/ |
| 2011-11-18-TwoSwitches-Threshold.ll | 10 ; CHECK-NEXT: br i1 %1, label %.split.us, label %..split_crit_edge
13 ; CHECK-NEXT: br label %.split
16 ; CHECK-NEXT: br label %loop_begin.us
20 ; CHECK-NEXT: i32 1, label %inc.us
23 ; CHECK-NEXT: switch i32 %d, label %default.us [
24 ; CHECK-NEXT: i32 1, label %inc.us
25 ; CHECK-NEXT: ]
28 ; CHECK-NEXT: call void @incf() noreturn nounwind
29 ; CHECK-NEXT: br label %loop_begin.backedge.us
32 ; CHECK-NEXT: br label %loop_begi
[all...] |
| /external/chromium/net/disk_cache/ |
| mem_rankings.cc | 30 MemEntryImpl* next = node->next(); local
33 head_ = next;
39 prev->set_next(next);
41 if (next)
42 next->set_prev(prev);
57 return node->next();
|
| /external/freetype/src/cache/ |
| ftcmru.c | 52 cnode = cnode->next;
59 last->next = node;
60 node->next = first;
65 node->next = node;
83 FTC_MruNode prev, next, last; local
93 cnode = cnode->next;
103 next = node->next;
105 prev->next = next;
126 FTC_MruNode prev, next; local
331 FTC_MruNode first, node, next; local
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| no-cfi.ll | 6 ; STATIC-NEXT: .long __gxx_personality_v0
7 ; STATIC-NEXT: .byte 3
8 ; STATIC-NEXT: .byte 3
12 ; PIC-NEXT: .L
13 ; PIC-NEXT: .long DW.ref.__gxx_personality_v0-.L
14 ; PIC-NEXT: .byte 27
15 ; PIC-NEXT: .byte 27
|
| /external/llvm/test/Transforms/Reassociate/ |
| mulfactor.ll | 6 ; CHECK-NEXT: mul i32 %a, 2
7 ; CHECK-NEXT: add
8 ; CHECK-NEXT: mul
9 ; CHECK-NEXT: add
10 ; CHECK-NEXT: ret
25 ; CHECK-NEXT: add
26 ; CHECK-NEXT: ret
40 ; CHECK-NEXT: mul
41 ; CHECK-NEXT: mul
42 ; CHECK-NEXT: re
[all...] |
| /external/oprofile/libutil/ |
| op_list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head * next, * prev; member in struct:list_head
36 ptr->next = ptr;
44 * the prev/next entries already!
48 struct list_head * next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
66 __list_add(new_entry, head, head->next);
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| DecimalNumber.cpp | 108 UChar* next = buffer; local
116 *next++ = '-';
117 *next++ = '0';
118 *next++ = '.';
120 *next++ = '0';
122 *next++ = m_significand[i];
124 return next - buffer;
134 *next++ = '-';
136 *next++ = m_significand[i];
138 *next++ = '0'
164 UChar* next = buffer; local
[all...] |
