| /external/llvm/test/CodeGen/X86/ |
| loop-blocks.ll | 11 ; CHECK-NEXT: align
12 ; CHECK-NEXT: .LBB0_2:
13 ; CHECK-NEXT: callq loop_latch
14 ; CHECK-NEXT: .LBB0_1:
15 ; CHECK-NEXT: callq loop_header
41 ; CHECK-NEXT: align
42 ; CHECK-NEXT: .LBB1_4:
43 ; CHECK-NEXT: callq bar99
44 ; CHECK-NEXT: .LBB1_1:
45 ; CHECK-NEXT: callq bod
[all...] |
| /external/skia/src/pathops/ |
| SkOpContour.h | 67 } while ((segment = segment->next()));
122 } while ((segment = segment->next()));
142 } while ((segment = segment->next()));
207 SkOpSegment* next; local
209 next = segment->next();
210 segment->joinEnds(next ? next : &fHead);
211 } while ((segment = next));
218 } while ((segment = segment->next()));
257 SkOpContour* next() { function in class:SkOpContour
261 const SkOpContour* next() const { function in class:SkOpContour
290 SkOpContour* next = this; local
397 SkOpContour* next; local
406 SkOpContour* next = this; local
422 SkOpContour* next; local
[all...] |
| /external/skqp/src/pathops/ |
| SkOpContour.h | 67 } while ((segment = segment->next()));
122 } while ((segment = segment->next()));
142 } while ((segment = segment->next()));
207 SkOpSegment* next; local
209 next = segment->next();
210 segment->joinEnds(next ? next : &fHead);
211 } while ((segment = next));
218 } while ((segment = segment->next()));
257 SkOpContour* next() { function in class:SkOpContour
261 const SkOpContour* next() const { function in class:SkOpContour
290 SkOpContour* next = this; local
397 SkOpContour* next; local
406 SkOpContour* next = this; local
422 SkOpContour* next; local
[all...] |
| /external/clang/test/Analysis/ |
| crash-trace.c | 19 // CHECK-NEXT: 1. <eof> parser at end of file
20 // CHECK-NEXT: 2. While analyzing stack:
21 // CHECK-NEXT: #0 void inlined()
22 // CHECK-NEXT: #1 void test()
23 // CHECK-NEXT: 3. {{.*}}crash-trace.c:{{[0-9]+}}:3: Error evaluating statement
|
| /external/clang/test/CodeGenObjC/ |
| gc.m | 9 // CHECK-NEXT: store i8* [[T0]], i8** [[X:%.*]], align 8
10 // CHECK-NEXT: call i8* @test0_helper()
11 // CHECK-NEXT: [[T0:%.*]] = load i8*, i8** [[X]], align 8
12 // CHECK-NEXT: call void asm sideeffect "", "r"(i8* [[T0]]) [[NUW:#[0-9]+]]
13 // CHECK-NEXT: ret void
|
| instance-method-metadata.m | 31 // CHECK-NEXT: .long 24
32 // CHECK-NEXT: .long 2
33 // CHECK-NEXT: .quad L_OBJC_METH_VAR_NAME_
34 // CHECK-NEXT: .quad L_OBJC_METH_VAR_TYPE_
35 // CHECK-NEXT: .quad "-[Bar prop]"
|
| objc-container-subscripting-1.m | 22 // CHECK-NEXT: [[SEL:%.*]] = load i8*, i8** @OBJC_SELECTOR_REFERENCES_
23 // CHECK-NEXT: [[ARRC:%.*]] = bitcast {{%.*}} [[ARR]] to i8*
24 // CHECK-NEXT: [[CALL:%.*]] = call i8* bitcast (i8* (i8*, i8*, ...)* @objc_msgSend to i8* (i8*, i8*, i32)*)(i8* [[ARRC]], i8* [[SEL]], i32 10)
25 // CHECK-NEXT: store i8* [[CALL]], i8** [[OLDOBJ:%.*]], align 8
29 // CHECK-NEXT: [[FOUR:%.*]] = load i8*, i8** [[oldObject:%.*]], align 8
30 // CHECK-NEXT: [[FIVE:%.*]] = load i8*, i8** @OBJC_SELECTOR_REFERENCES_.2
31 // CHECK-NEXT: [[SIX:%.*]] = bitcast {{%.*}} [[THREE]] to i8*
32 // CHECK-NEXT: call void bitcast (i8* (i8*, i8*, ...)* @objc_msgSend to void (i8*, i8*, i8*, i32)*)(i8* [[SIX]], i8* [[FIVE]], i8* [[FOUR]], i32 10)
33 // CHECK-NEXT: store i8* [[FOUR]], i8** [[val:%.*]]
40 // CHECK-NEXT: [[EIGHT:%.*]] = load i8*, i8** [[KEY:%.*]], align
[all...] |
| /external/clang/test/CoverageMapping/ |
| comment-in-macro.c | 6 int main() { // CHECK-NEXT: File 0, [[@LINE]]:12 -> [[@LINE+3]]:2 = #0
7 x1; // CHECK-NEXT: Expansion,File 0, [[@LINE]]:3 -> [[@LINE]]:5 = #0
8 x2; // CHECK-NEXT: Expansion,File 0, [[@LINE]]:3 -> [[@LINE]]:5 = #0
10 // CHECK-NEXT: File 1, 3:12 -> 3:14 = #0
11 // CHECK-NEXT: File 2, 4:12 -> 4:20 = #0
|
| while.c | 4 int main() { // CHECK-NEXT: File 0, [[@LINE]]:12 -> [[@LINE+8]]:2 = #0
5 int j = 0; // CHECK-NEXT: File 0, [[@LINE+1]]:9 -> [[@LINE+1]]:14 = (#0 + #1)
6 while(j < 5) ++j; // CHECK-NEXT: File 0, [[@LINE]]:16 -> [[@LINE]]:19 = #1
9 (j < 5) // CHECK-NEXT: File 0, [[@LINE]]:5 -> [[@LINE]]:10 = (#0 + #2)
10 ++j; // CHECK-NEXT: File 0, [[@LINE]]:6 -> [[@LINE]]:9 = #2
|
| /external/clang/test/Misc/ |
| ast-dump-decl.c | 11 // CHECK-NEXT: {{^}}`-FieldDecl{{.*x[^()]*$}}
20 // CHECK-NEXT: FieldDecl{{.*}}x
21 // CHECK-NEXT: RecordDecl{{.*}}y
22 // CHECK-NEXT: FieldDecl{{.*}}z
42 // CHECK-NEXT: EnumConstantDecl{{.*}} testEnumDecl
50 // CHECK-NEXT: EnumDecl{{.*> .*$}}
62 // CHECK-NEXT: FieldDecl
73 // CHECK-NEXT: RecordDecl{{.*}} struct
80 // CHECK-NEXT: RecordDecl{{.*}} struct
94 // CHECK-NEXT: IntegerLitera
[all...] |
| /external/clang/test/SemaCXX/ |
| ambiguous-conversion-show-overload.cpp | 17 // CHECK-NEXT: {{candidate constructor}}
18 // CHECK-NEXT: {{candidate constructor}}
19 // CHECK-NEXT: {{candidate constructor}}
20 // CHECK-NEXT: {{candidate constructor}}
21 // CHECK-NEXT: {{remaining 4 candidates omitted; pass -fshow-overloads=all to show them}}
|
| /external/clang/test/SemaObjC/ |
| debugger-support.m | 9 // CHECK-NEXT: [[RESULT:%.*]] = alloca [[A:%.*]], align 4
10 // CHECK-NEXT: store i8* {{%.*}}, i8** [[X]],
11 // CHECK-NEXT: [[T0:%.*]] = load i8*, i8** [[X]],
12 // CHECK-NEXT: [[T1:%.*]] = load i8*, i8** @OBJC_SELECTOR_REFERENCES_
13 // CHECK-NEXT: [[T2:%.*]] = call { i64, i64 } bitcast (i8* (i8*, i8*, ...)* @objc_msgSend to { i64, i64 } (i8*, i8*)*)(i8* [[T0]], i8* [[T1]])
|
| /external/clang/test/SemaObjCXX/ |
| block-cleanup.mm | 4 // CHECK-NEXT: -CompoundStmt
5 // CHECK-NEXT: -ReturnStmt
6 // CHECK-NEXT: -ExprWithCleanups
7 // CHECK-NEXT: -cleanup Block
8 // CHECK-NEXT: -cleanup Block
|
| /external/compiler-rt/test/esan/TestCases/ |
| verbose-simple.c | 8 // CHECK-NEXT: Shadow #0: [110000000000-114000000000) (256GB)
9 // CHECK-NEXT: Shadow #1: [124000000000-12c000000000) (512GB)
10 // CHECK-NEXT: Shadow #2: [148000000000-150000000000) (512GB)
11 // CHECK-NEXT: in esan::finalizeLibrary
12 // CHECK-NEXT: ==verbose-simple{{.*}}EfficiencySanitizer: total struct field access count = 0
|
| /external/curl/docs/cmdline-opts/ |
| next.d | 2 Long: next
7 Help: Make next URL use its separate set of options
14 --next will reset all local options and only global ones will have their
15 values survive over to the operation following the --next instruction. Global
20 curl www1.example.com --next -d postthis www2.example.com
|
| /external/elfutils/lib/ |
| list.h | 36 assert (_newp->next == NULL); \
39 (first) = _newp->next = _newp->previous = _newp; \
42 _newp->next = (first); \
44 _newp->previous->next = _newp->next->previous = _newp; \
55 || ({ __typeof (elem) _runp = first->next; \
60 _runp = _runp->next; \
62 if (unlikely (_elem->next == _elem)) \
66 _elem->next->previous = _elem->previous; \
67 _elem->previous->next = _elem->next;
[all...] |
| /external/junit/src/main/java/org/junit/internal/runners/statements/ |
| ExpectException.java | 7 private final Statement next; field in class:ExpectException
10 public ExpectException(Statement next, Class<? extends Throwable> expected) {
11 this.next = next;
19 next.evaluate();
|
| RunAfters.java | 11 private final Statement next; field in class:RunAfters
17 public RunAfters(Statement next, List<FrameworkMethod> afters, Object target) {
18 this.next = next;
27 next.evaluate();
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| insert_after_const.pass.cpp | 33 assert(i == next(c.begin()));
35 assert(*next(c.begin()) == 1);
38 i = c.insert_after(next(c.cbegin()), 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin()) == 1);
42 assert(*next(c.begin(), 2) == 2);
46 assert(i == next(c.begin()));
48 assert(*next(c.begin(), 1) == 3);
49 assert(*next(c.begin(), 2) == 1);
50 assert(*next(c.begin(), 3) == 2)
[all...] |
| insert_after_init.pass.cpp | 33 assert(i == next(c.before_begin(), 3));
35 assert(*next(c.begin(), 0) == 0);
36 assert(*next(c.begin(), 1) == 1);
37 assert(*next(c.begin(), 2) == 2);
40 assert(i == next(c.begin(), 2));
42 assert(*next(c.begin(), 0) == 0);
43 assert(*next(c.begin(), 1) == 3);
44 assert(*next(c.begin(), 2) == 4);
45 assert(*next(c.begin(), 3) == 1);
46 assert(*next(c.begin(), 4) == 2)
[all...] |
| insert_after_range.pass.cpp | 36 assert(i == next(c.before_begin(), 3));
38 assert(*next(c.begin(), 0) == 0);
39 assert(*next(c.begin(), 1) == 1);
40 assert(*next(c.begin(), 2) == 2);
43 assert(i == next(c.begin(), 2));
45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 3);
47 assert(*next(c.begin(), 2) == 4);
48 assert(*next(c.begin(), 3) == 1);
49 assert(*next(c.begin(), 4) == 2)
[all...] |
| insert_after_rv.pass.cpp | 36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == 1);
41 i = c.insert_after(next(c.cbegin()), 2);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == 1);
45 assert(*next(c.begin(), 2) == 2);
49 assert(i == next(c.begin()));
51 assert(*next(c.begin(), 1) == 3);
52 assert(*next(c.begin(), 2) == 1);
53 assert(*next(c.begin(), 3) == 2)
[all...] |
| insert_after_size_value.pass.cpp | 31 assert(i == next(c.before_begin(), 3));
33 assert(*next(c.begin(), 0) == 3);
34 assert(*next(c.begin(), 1) == 3);
35 assert(*next(c.begin(), 2) == 3);
38 assert(i == next(c.begin(), 2));
40 assert(*next(c.begin(), 0) == 3);
41 assert(*next(c.begin(), 1) == 2);
42 assert(*next(c.begin(), 2) == 2);
43 assert(*next(c.begin(), 3) == 3);
44 assert(*next(c.begin(), 4) == 3)
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| scev-dispositions.ll | 14 ; CHECK-NEXT: --> {{.*}} LoopDispositions: { %loop: Computable }
16 ; CHECK-NEXT: --> {{.*}} LoopDispositions: { %loop: Computable }
18 ; CHECK-NEXT: --> {{.*}} LoopDispositions: { %loop: Invariant }
20 ; CHECK-NEXT: --> {{.*}} LoopDispositions: { %loop: Computable }
22 ; CHECK-NEXT: --> {{.*}} LoopDispositions: { %loop: Variant }
40 ; CHECK: %j = phi i64 [ 0, %entry ], [ %j.next, %outer.latch ]
41 ; CHECK-NEXT: --> {{.*}} LoopDispositions: { %outer.loop: Computable, %bb: Invariant }
42 ; CHECK: %i = phi i64 [ 0, %outer.loop ], [ %i.next, %bb ]
43 ; CHECK-NEXT: --> {{.*}} LoopDispositions: { %bb: Computable, %outer.loop: Variant }
45 ; CHECK-NEXT: --> {{.*}} LoopDispositions: { %bb: Invariant, %outer.loop: Computable
[all...] |
| /external/llvm/test/Bitcode/ |
| mdnodes-distinct-in-post-order.ll | 10 ; CHECK-NEXT: <DISTINCT_NODE/>
14 ; CHECK-NEXT: <DISTINCT_NODE op0=1 op1=2/>
17 ; CHECK-NEXT: <DISTINCT_NODE op0=1 op1=3 op2=2/>
22 ; CHECK-NEXT: <NAME
23 ; CHECK-NEXT: <NAMED_NODE op0=3/>
|
