| /external/llvm/test/CodeGen/PowerPC/ |
| 2013-05-15-preinc-fold.ll | 16 ; CHECK-NEXT: stbu 4, -1(3)
17 ; CHECK-NEXT: stb 4, 2(3)
18 ; CHECK-NEXT: blr
30 ; CHECK-NEXT: stdu 4, -8(3)
31 ; CHECK-NEXT: std 4, 16(3)
32 ; CHECK-NEXT: blr
|
| /external/llvm/test/CodeGen/X86/ |
| atom-bypass-slow-division-64.ll | 9 ; CHECK-NEXT: testq $-65536, %rax
10 ; CHECK-NEXT: je
23 ; CHECK-NEXT: testq $-65536, %rax
24 ; CHECK-NEXT: je
37 ; CHECK-NEXT: testq $-65536, %rax
38 ; CHECK-NEXT: je
|
| ghc-cc.ll | 13 ; CHECK-NEXT: movl {{[0-9]*}}(%esp), %ebp
14 ; CHECK-NEXT: calll addtwo
25 ; CHECK-NEXT: ret
32 ; CHECK-NEXT: movl sp, %ebp
33 ; CHECK-NEXT: movl hp, %edi
34 ; CHECK-NEXT: movl r1, %esi
|
| /external/llvm/test/MC/Mips/ |
| elf-gprel-32-64.ll | 35 ; CHECK-NEXT: 0x{{[0-9,A-F]+}} R_MIPS_GPREL32/R_MIPS_64/R_MIPS_NONE
36 ; CHECK-NEXT: 0x{{[0-9,A-F]+}} R_MIPS_GPREL32/R_MIPS_64/R_MIPS_NONE
37 ; CHECK-NEXT: 0x{{[0-9,A-F]+}} R_MIPS_GPREL32/R_MIPS_64/R_MIPS_NONE
38 ; CHECK-NEXT: 0x{{[0-9,A-F]+}} R_MIPS_GPREL32/R_MIPS_64/R_MIPS_NONE
39 ; CHECK-NEXT: }
40 ; CHECK-NEXT: ]
|
| /external/llvm/test/Object/ |
| archive-replace-pos.test | 12 CHECK-NEXT: .zed
13 CHECK-NEXT: .bar
20 CHECK2-NEXT: .foo
21 CHECK2-NEXT: .bar
26 CHECK3-NEXT: .zed
27 CHECK3-NEXT: .bar
|
| /external/llvm/test/Transforms/LICM/ |
| scalar_promote.ll | 11 ; CHECK-NEXT: load i32* @X
12 ; CHECK-NEXT: br label %Loop
16 %j = phi i32 [ 0, %Entry ], [ %Next, %Loop ] ; <i32> [#uses=1]
20 %Next = add i32 %j, 1 ; <i32> [#uses=2]
21 %cond = icmp eq i32 %Next, 0 ; <i1> [#uses=1]
27 ; CHECK-NEXT: store i32 %x2, i32* @X
28 ; CHECK-NEXT: ret void
37 ; CHECK-NEXT: %.promoted = load i32* getelementptr inbounds (i32* @X, i64 1)
38 ; CHECK-NEXT: br label %Loop
51 ; CHECK-NEXT: store i32 %V, i32* getelementptr inbounds (i32* @X, i64 1
[all...] |
| /external/llvm/test/Transforms/ObjCARC/ |
| weak-dce.ll | 7 ; CHECK-NEXT: call i8* @objc_retain(i8* %p)
8 ; CHECK-NEXT: ret void
19 ; CHECK-NEXT: call i8* @objc_retain(i8* %p)
20 ; CHECK-NEXT: ret i8* %p
31 ; CHECK-NEXT: call i8* @objc_retain(i8* %q)
32 ; CHECK-NEXT: ret i8* %q
|
| /external/llvm/test/Transforms/Sink/ |
| basic.ll | 11 ; CHECK-NEXT: %l = load i32* @A
12 ; CHECK-NEXT: ret i32 %l
28 ; CHECK-NEXT: store i32
44 ; CHECK-NEXT: phi
45 ; CHECK-NEXT: mul nsw
46 ; CHECK-NEXT: sub
|
| /external/skia/src/gpu/ |
| GrAllocPool.cpp | 21 static Block* Create(size_t size, Block* next) {
25 block->fNext = next;
72 Block* next = block->fNext; local
74 block = next;
97 Block* next = fBlock->fNext; local
99 fBlock = next;
|
| /frameworks/base/core/jni/android/graphics/ |
| AutoDecodeCancel.cpp | 36 AutoDecoderCancel* next = fNext; local
40 prev->fNext = next;
43 gAutoDecoderCancel = next;
45 if (next) {
46 SkASSERT(next->fPrev == this);
47 next->fPrev = prev;
|
| /system/core/sh/ |
| nodes.h | 88 union node *next; member in struct:nclist
96 union node *next; member in struct:narg
104 union node *next; member in struct:nfile
113 union node *next; member in struct:ndup
122 union node *next; member in struct:nhere
153 struct nodelist *next; member in struct:nodelist
|
| /external/llvm/test/CodeGen/AArch64/ |
| atomic-ops.ll | 16 ; CHECK-NEXT: ldaxrb w[[OLD:[0-9]+]], [x[[ADDR]]]
19 ; CHECK-NEXT: add [[NEW:w[0-9]+]], w[[OLD]], w0
20 ; CHECK-NEXT: stlxrb [[STATUS:w[0-9]+]], [[NEW]], [x[[ADDR]]]
21 ; CHECK-NEXT: cbnz [[STATUS]], .LBB{{[0-9]+}}_1
36 ; CHECK-NEXT: ldaxrh w[[OLD:[0-9]+]], [x[[ADDR]]]
39 ; CHECK-NEXT: add [[NEW:w[0-9]+]], w[[OLD]], w0
40 ; CHECK-NEXT: stxrh [[STATUS:w[0-9]+]], [[NEW]], [x[[ADDR]]]
41 ; CHECK-NEXT: cbnz [[STATUS]], .LBB{{[0-9]+}}_1
56 ; CHECK-NEXT: ldxr w[[OLD:[0-9]+]], [x[[ADDR]]]
59 ; CHECK-NEXT: add [[NEW:w[0-9]+]], w[[OLD]], w
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| trip-count9.ll | 19 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
20 %i.next = add i4 %i, 1
21 %t = icmp slt i4 %i.next, %n
35 %i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
36 %i.next = add i4 %i, 2
37 %t = icmp slt i4 %i.next, %n
51 %i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
52 %i.next = add i4 %i, 1
53 %t = icmp slt i4 %i.next, %n
67 %i = phi i4 [ 1, %entry ], [ %i.next, %loop
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| LinkedList.java | 51 Link<ET> previous, next; field in class:LinkedList.Link
56 next = n;
77 link = link.next;
91 Link<ET> next = link.next; local
92 Link<ET> newLink = new Link<ET>(object, link, next);
93 link.next = newLink;
94 next.previous = newLink;
107 return link.next != list.voidLink;
114 public ET next() { method in class:LinkedList.LinkIterator
116 LinkedList.Link<ET> next = link.next; local
151 Link<ET> next = lastLink.next; local
208 public ET next() { method in class:LinkedList.ReverseLinkIterator
224 Link<ET> next = link.previous; local
363 Link<E> next = previous.next; local
653 Link<E> next = link.next; local
682 Link<E> next = first.next; local
[all...] |
| /bionic/libc/bionic/ |
| pthread_internals.cpp | 38 if (thread->next != NULL) {
39 thread->next->prev = thread->prev;
42 thread->prev->next = thread->next;
44 gThreadList = thread->next;
58 thread->next = gThreadList;
60 if (thread->next != NULL) {
61 thread->next->prev = thread;
|
| /external/chromium_org/third_party/WebKit/Tools/GardeningServer/scripts/ui/ |
| actions_unittests.js | 59 var next = new ui.actions.Next();
60 equal(next.makeDefault(), next);
61 equal(next.className, 'action next default');
68 new ui.actions.Next()
73 '<li><button class="action next">\u25B6</button></li>');
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
| cso_hash.c | 15 * next paragraph) shall be included in all copies or substantial portions
75 struct cso_node *next; member in struct:cso_node
120 node->next = (struct cso_node*)(*anextNode);
159 while (lastNode->next != e && lastNode->next->key == h)
160 lastNode = lastNode->next;
162 afterLastNode = lastNode->next;
165 beforeFirstNode = &(*beforeFirstNode)->next;
166 lastNode->next = *beforeFirstNode;
209 assert(*node == hash->data.e || (*node)->next);
269 struct cso_node *next = cur->next; local
304 struct cso_node *next; member in union:__anon14426
371 struct cso_hash_iter next = {iter.hash, cso_hash_data_next(iter.node)}; local
388 struct cso_node *next = (*node)->next; local
[all...] |
| /external/clang/test/CodeGen/ |
| 2002-02-14-EntryNodePreds.c | 11 struct edge_rec *next; member in struct:edge_rec
33 return (int)basel->next;
|
| bmi-builtins.c | 15 // CHECK-NEXT: %{{.*}} = and i32 %{{.*}}, [[DEST]]
26 // CHECK-NEXT: %{{.*}} = and i32 [[SRC]], [[DEST]]
32 // CHECK-NEXT: %{{.*}} = xor i32 [[DEST]], [[SRC]]
38 // CHECK-NEXT: %{{.*}} = and i32 [[DEST]], [[SRC]]
49 // CHECK-NEXT: %{{.*}} = and i64 %{{.*}}, [[DEST]]
60 // CHECK-NEXT: %{{.*}} = and i64 [[SRC]], [[DEST]]
66 // CHECK-NEXT: %{{.*}} = xor i64 [[DEST]], [[SRC]]
72 // CHECK-NEXT: %{{.*}} = and i64 [[DEST]], [[SRC]]
|
| /external/clang/test/CodeGenCXX/ |
| debug-info-pubtypes.cpp | 8 //CHECK-NEXT: .long 0
9 //CHECK-NEXT: Lpubtypes_end[[SECNUM]]
|
| static-init-pnacl.cpp | 13 // CHECK-NEXT: [[GUARD:%.*]] = icmp eq i8 [[LOAD]], 0
14 // CHECK-NEXT: br i1 [[GUARD]]
|
| /external/clang/test/Rewriter/ |
| no-integrated-preprocessing.m | 24 // CHECK-NEXT: 0, 0, 0,
25 // CHECK-NEXT: 0,
|
| /external/compiler-rt/lib/ubsan/lit_tests/TypeCheck/ |
| misaligned.cpp | 30 // CHECK-LOAD-NEXT: [[PTR]]: note: pointer points here
31 // CHECK-LOAD-NEXT: {{^ 00 00 00 01 02 03 04 05}}
32 // CHECK-LOAD-NEXT: {{^ \^}}
37 // CHECK-STORE-NEXT: [[PTR]]: note: pointer points here
38 // CHECK-STORE-NEXT: {{^ 00 00 00 01 02 03 04 05}}
39 // CHECK-STORE-NEXT: {{^ \^}}
45 // CHECK-REFERENCE-NEXT: [[PTR]]: note: pointer points here
46 // CHECK-REFERENCE-NEXT: {{^ 00 00 00 01 02 03 04 05}}
47 // CHECK-REFERENCE-NEXT: {{^ \^}}
53 // CHECK-MEMBER-NEXT: [[PTR]]: note: pointer points her
[all...] |
| /external/iproute2/ |
| README.devel | 11 code in the mainline Linux kernel (ie follows Linus). The net-next
13 next release; it corresponds with networking development branch in
|
| /external/junit/src/org/junit/internal/runners/statements/ |
| RunBefores.java | 18 public RunBefores(Statement next, List<FrameworkMethod> befores, Object target) {
19 fNext= next;
|
