| /external/clang/test/CodeGenObjC/ |
| exceptions.m | 23 // CHECK-NEXT: getelementptr
24 // CHECK-NEXT: call i32 @_setjmp(
25 // CHECK-NEXT: icmp
26 // CHECK-NEXT: br i1
29 // CHECK-NEXT: call void @foo()
53 // CHECK-NEXT: [[CAUGHT:%.*]] = icmp eq i32 [[SETJMP]], 0
54 // CHECK-NEXT: br i1 [[CAUGHT]]
58 // CHECK-NEXT: call void asm sideeffect "", "*m,*m"(i32* [[X]]
59 // CHECK-NEXT: call void @foo()
60 // CHECK-NEXT: call void @objc_exception_try_exi
[all...] |
| /external/clang/test/Index/ |
| annotate-module.m | 11 // CHECK-NEXT: Identifier: "include" [2:2 - 2:9] inclusion directive=[[INC_DIR]]
12 // CHECK-NEXT: Punctuation: "<" [2:10 - 2:11] inclusion directive=[[INC_DIR]]
13 // CHECK-NEXT: Identifier: "DependsOnModule" [2:11 - 2:26] inclusion directive=[[INC_DIR]]
14 // CHECK-NEXT: Punctuation: "/" [2:26 - 2:27] inclusion directive=[[INC_DIR]]
15 // CHECK-NEXT: Identifier: "DependsOnModule" [2:27 - 2:42] inclusion directive=[[INC_DIR]]
16 // CHECK-NEXT: Punctuation: "." [2:42 - 2:43] inclusion directive=[[INC_DIR]]
17 // CHECK-NEXT: Identifier: "h" [2:43 - 2:44] inclusion directive=[[INC_DIR]]
18 // CHECK-NEXT: Punctuation: ">" [2:44 - 2:45] inclusion directive=[[INC_DIR]]
19 // CHECK-NEXT: Punctuation: "@" [3:1 - 3:2] ModuleImport=DependsOnModule:3:1
20 // CHECK-NEXT: Keyword: "import" [3:2 - 3:8] ModuleImport=DependsOnModule:3:
[all...] |
| 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/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/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/llvm/test/CodeGen/SystemZ/ |
| int-const-02.ll | 11 ; CHECK-NEXT: br %r14
19 ; CHECK-NEXT: br %r14
23 ; Check the next value up, which must use LLILL instead.
27 ; CHECK-NEXT: br %r14
35 ; CHECK-NEXT: br %r14
39 ; Check the first useful LLILH value, which is the next one up.
43 ; CHECK-NEXT: br %r14
47 ; Check the first useful LGFI value, which is the next one up again.
51 ; CHECK-NEXT: br %r14
59 ; CHECK-NEXT: br %r1
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next
41 struct intel_resolve_map **tail = &head->next;
50 tail = &(*tail)->next;
55 (*tail)->next = NULL;
70 struct intel_resolve_map *item = head->next;
76 item = item->next;
89 elem->prev->next = elem->next;
90 if (elem->next)
91 elem->next->prev = elem->prev
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
| prclist.h | 46 PRCList *next; member in struct:PRCListStr
55 (_e)->next = (_l); \
57 (_l)->prev->next = (_e); \
66 (_e)->next = (_l)->next; \
68 (_l)->next->prev = (_e); \
69 (_l)->next = (_e); \
76 ((_e)->next)
94 #define PR_LIST_HEAD(_l) (_l)->next
102 (_e)->prev->next = (_e)->next;
[all...] |
| /external/clang/test/CodeGenCXX/ |
| blocks-cxx11.cpp | 52 // CHECK-NEXT: store i32 0,
53 // CHECK-NEXT: [[COERCE:%.*]] = bitcast
54 // CHECK-NEXT: [[CVAL:%.*]] = load i64* [[COERCE]]
55 // CHECK-NEXT: call void @_Z13takeItByValueICiEvT_(i64 [[CVAL]])
74 // CHECK-NEXT: [[I:%.*]] = load i32* getelementptr inbounds ({ i32, i32 }* @_ZN28test_complex_int_ref_mutable1yE, i32 0, i32 1)
75 // CHECK-NEXT: [[RSLOT:%.*]] = getelementptr inbounds { i32, i32 }* [[CSLOT:%.*]], i32 0, i32 0
76 // CHECK-NEXT: [[ISLOT:%.*]] = getelementptr inbounds { i32, i32 }* [[CSLOT]], i32 0, i32 1
77 // CHECK-NEXT: store i32 [[R]], i32* [[RSLOT]]
78 // CHECK-NEXT: store i32 [[I]], i32* [[ISLOT]]
79 // CHECK-NEXT: [[COERCE:%.*]] = bitcast { i32, i32 }* [[CSLOT]] to i64
[all...] |
| /external/clang/test/CodeGenObjCXX/ |
| 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/llvm/test/Transforms/LoopUnswitch/ |
| 2011-11-18-TwoSwitches-Threshold.ll | 11 ; CHECK-NEXT: br i1 %1, label %.split.us, label %..split_crit_edge
14 ; CHECK-NEXT: br label %.split
17 ; CHECK-NEXT: br label %loop_begin.us
21 ; CHECK-NEXT: i32 1, label %inc.us
24 ; CHECK-NEXT: switch i32 %d, label %default.us [
25 ; CHECK-NEXT: i32 1, label %inc.us
26 ; CHECK-NEXT: ]
29 ; CHECK-NEXT: call void @incf() [[NOR_NUW:#[0-9]+]]
30 ; CHECK-NEXT: br label %loop_begin.backedge.us
33 ; CHECK-NEXT: br label %loop_begi
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next
41 struct intel_resolve_map **tail = &head->next;
50 tail = &(*tail)->next;
55 (*tail)->next = NULL;
70 struct intel_resolve_map *item = head->next;
76 item = item->next;
89 elem->prev->next = elem->next;
90 if (elem->next)
91 elem->next->prev = elem->prev
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| insert_iter_iter.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);
74 assert(*next(m.begin(), 0) == 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| copy_alloc.pass.cpp | 45 assert(*next(m.begin(), 0) == 1);
46 assert(*next(m.begin(), 1) == 1);
47 assert(*next(m.begin(), 2) == 1);
48 assert(*next(m.begin(), 3) == 2);
49 assert(*next(m.begin(), 4) == 2);
50 assert(*next(m.begin(), 5) == 2);
51 assert(*next(m.begin(), 6) == 3);
52 assert(*next(m.begin(), 7) == 3);
53 assert(*next(m.begin(), 8) == 3);
59 assert(*next(mo.begin(), 0) == 1)
[all...] |
| iter_iter.pass.cpp | 43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 1);
45 assert(*next(m.begin(), 2) == 1);
46 assert(*next(m.begin(), 3) == 2);
47 assert(*next(m.begin(), 4) == 2);
48 assert(*next(m.begin(), 5) == 2);
49 assert(*next(m.begin(), 6) == 3);
50 assert(*next(m.begin(), 7) == 3);
51 assert(*next(m.begin(), 8) == 3);
72 assert(*next(m.begin(), 0) == 1)
[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/chromium_org/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/chromium_org/third_party/WebKit/Source/wtf/ |
| DecimalNumber.cpp | 108 LChar* 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 LChar* next = buffer; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_double_list.h | 23 * next paragraph) shall be included in all copies or substantial portions
48 struct list_head *next; member in struct:list_head
54 item->next = item;
60 item->next = list->next;
61 list->next->prev = item;
62 list->next = item;
67 item->next = list;
69 list->prev->next = item;
76 to->next = from->next
[all...] |
| /external/clang/test/CodeGen/ |
| 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/compiler-rt/lib/tsan/lit_tests/ |
| simple_stack2.cc | 46 // CHECK-NEXT: Write of size 4 at {{.*}} by thread T1:
47 // CHECK-NEXT: #0 foo1{{.*}} {{.*}}simple_stack2.cc:9{{(:3)?}} ({{.*}})
48 // CHECK-NEXT: #1 bar1{{.*}} {{.*}}simple_stack2.cc:16{{(:3)?}} ({{.*}})
49 // CHECK-NEXT: #2 Thread1{{.*}} {{.*}}simple_stack2.cc:34{{(:3)?}} ({{.*}})
51 // CHECK-NEXT: #0 foo2{{.*}} {{.*}}simple_stack2.cc:20{{(:28)?}} ({{.*}})
52 // CHECK-NEXT: #1 bar2{{.*}} {{.*}}simple_stack2.cc:29{{(:3)?}} ({{.*}})
53 // CHECK-NEXT: #2 main{{.*}} {{.*}}simple_stack2.cc:41{{(:3)?}} ({{.*}})
|
| /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/PowerPC/ |
| ppc64-linux-func-size.ll | 4 ; CHECK-NEXT: test1:
5 ; CHECK-NEXT: .align 3
6 ; CHECK-NEXT: .quad .L.test1
7 ; CHECK-NEXT: .quad .TOC.@tocbase
8 ; CHECK-NEXT: .quad 0
9 ; CHECK-NEXT: .text
10 ; CHECK-NEXT: .L.test1:
|
