| /external/llvm/test/Verifier/ |
| dominates.ll | 8 ; CHECK-NEXT: %z = add i32 %x, 1
9 ; CHECK-NEXT: %y = add i32 %z, 1
24 ; CHECK-NEXT: %y1 = invoke i32 @g()
25 ; CHECK-NEXT: to label %bb1 unwind label %bb2
26 ; CHECK-NEXT: %y2 = phi i32 [ %y1, %bb0 ]
42 ; CHECK-NEXT: %y1 = invoke i32 @g()
43 ; CHECK-NEXT: to label %bb1 unwind label %bb2
44 ; CHECK-NEXT: %y3 = phi i32 [ %y1, %bb2 ]
55 ; CHECK-NEXT: %y1 = add i32 %x, 1
56 ; CHECK-NEXT: %y3 = phi i32 [ %y1, %bb0
[all...] |
| /external/mesa3d/src/gallium/drivers/r600/ |
| compute_memory_pool.c | 9 * The above copyright notice and this permission notice (including the next
136 for (item = pool->item_list; item; item = item->next) {
166 for (item = pool->item_list; item; item = item->next) {
167 if (item->next) {
169 && item->next->start_in_dw > start_in_dw) {
239 chunk.prev = chunk.next = NULL;
251 struct compute_memory_item *item, *next; local
258 for (item = pool->item_list; item; item = item->next) {
259 COMPUTE_DBG("list: %i %p\n", item->start_in_dw, item->next);
262 for (item = pool->item_list; item; item = next) {
353 struct compute_memory_item *item, *next; local
[all...] |
| /external/clang/test/CodeGenCXX/ |
| microsoft-abi-vtables-virtual-inheritance.cpp | 34 // VTABLE-C-NEXT: 0 | void C::f()
35 // VTABLE-C-NEXT: 1 | void A::z()
38 // VTABLE-C-NEXT: vbtable index 1, vfptr at offset 0
39 // VTABLE-C-NEXT: 0 | void C::f()
49 // VTABLE-D-NEXT: 0 | void D::h()
52 // VTABLE-D-NEXT: 0 | void D::f()
53 // VTABLE-D-NEXT: 1 | void A::z()
56 // VTABLE-D-NEXT: via vfptr at offset 0
57 // VTABLE-D-NEXT: 0 | void D::h()
58 // VTABLE-D-NEXT: via vbtable index 1, vfptr at offset
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/text/ |
| BidiRunList.h | 105 Run* next = m_firstRun; local
106 while (next != run) {
107 current = next;
108 next = current->next();
112 m_firstRun = run->next();
129 Run* next = current->next(); local
130 while (next != run) {
131 current = next;
233 Run* next = curr->next(); local
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| or-xor.ll | 9 ; CHECK-NEXT: %y.not = xor i32 %y, -1
10 ; CHECK-NEXT: %z = or i32 %y.not, %x
11 ; CHECK-NEXT: ret i32 %z
20 ; CHECK-NEXT: %x.not = xor i32 %x, -1
21 ; CHECK-NEXT: %z = or i32 %x.not, %y
22 ; CHECK-NEXT: ret i32 %z
31 ; CHECK-NEXT: %y.not = xor i32 %y, -1
32 ; CHECK-NEXT: %z = or i32 %y.not, %x
33 ; CHECK-NEXT: ret i32 %z
42 ; CHECK-NEXT: %x.not = xor i32 %x, -
[all...] |
| /system/core/libsparse/ |
| backed_block.c | 46 struct backed_block *next; member in struct:backed_block
62 return bb->next;
135 struct backed_block *next = bb->next; local
137 bb = next;
155 for (end = start; end && end->next; end = end->next)
166 from->data_blocks = end->next;
168 for (bb = from->data_blocks; bb; bb = bb->next) {
169 if (bb->next == start)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| nouveau_heap.c | 75 r->next = heap->next;
76 if (heap->next)
77 heap->next->prev = r;
79 heap->next = r;
85 heap = heap->next;
103 if (r->next && !r->next->in_use) {
104 struct nouveau_heap *new = r->next;
108 r->prev->next = new
[all...] |
| /external/chromium_org/v8/src/ |
| unbound-queue-inl.h | 41 : value(value), next(NULL) {
45 Node* next; member in struct:v8::internal::UnboundQueue::Node
65 first_ = tmp->next;
73 Node* next = reinterpret_cast<Node*>(divider_)->next;
74 *rec = next->value;
75 Release_Store(÷r_, reinterpret_cast<AtomicWord>(next));
82 Node*& next = reinterpret_cast<Node*>(last_)->next; local
83 next = new Node(rec)
[all...] |
| /external/dhcpcd/ |
| if-pref.c | 81 if (!ifaces || !ifaces->next)
84 ifaces = ifaces->next;
85 sorted->next = NULL;
86 for (ifp = ifaces; ifp && (ifn = ifp->next, 1); ifp = ifn) {
89 ifp->next = sorted;
94 for (ift = sorted; ift->next; ift = ift->next) {
95 if (ifcmp(ifp, ift->next) == -1) {
96 ifp->next = ift->next;
[all...] |
| /external/e2fsprogs/contrib/ |
| dconf | 19 ic=$3; next
22 bc=$3; next
25 fb=$3; next
28 bs=$3; next
34 next
37 ipg=$4; next
42 next
50 next
63 next
86 next
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ilist_node.h | 39 /// ilist_node - Base class that provides next/prev services for nodes
46 NodeTy *Next;
47 NodeTy *getNext() { return Next; }
48 const NodeTy *getNext() const { return Next; }
49 void setNext(NodeTy *N) { Next = N; }
51 ilist_node() : Next(0) {}
79 /// \brief Get the next node, or 0 for the list tail.
81 NodeTy *Next = getNext();
84 if (!Next->getNext())
87 return Next;
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| hipe-cc.ll | 8 ; CHECK-NEXT: movl 44(%esp), %edx
9 ; CHECK-NEXT: movl $8, %ecx
10 ; CHECK-NEXT: calll addfour
15 ; CHECK-NEXT: movl $2, 12(%esp)
16 ; CHECK-NEXT: movl $1, 8(%esp)
25 ; CHECK-NEXT: addl %ecx, %eax
37 ; CHECK-NEXT: movl %ebp, 12(%esp)
38 ; CHECK-NEXT: movl %eax, 8(%esp)
39 ; CHECK-NEXT: movl %edx, 4(%esp)
40 ; CHECK-NEXT: movl %ecx, (%esp
[all...] |
| bss_pagealigned.ll | 11 ; CHECK-NEXT: xorl %esi, %esi
12 ; CHECK-NEXT: movl $4096, %edx
13 ; CHECK-NEXT: callq memset
18 ; CHECK-NEXT: .align 4096
19 ; CHECK-NEXT: bm_pte:
20 ; CHECK-NEXT: .zero 4096
21 ; CHECK-NEXT: .size bm_pte, 4096
|
| utf16-cfstrings.ll | 12 ; CHECK-NEXT: .align 1
13 ; CHECK-NEXT: _.str:
14 ; CHECK-NEXT: .short 252 ## 0xfc
15 ; CHECK-NEXT: .short 98 ## 0x62
16 ; CHECK-NEXT: .short 101 ## 0x65
17 ; CHECK-NEXT: .short 114 ## 0x72
18 ; CHECK-NEXT: .short 0 ## 0x0
|
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_heap.c | 75 r->next = heap->next;
76 if (heap->next)
77 heap->next->prev = r;
79 heap->next = r;
85 heap = heap->next;
103 if (r->next && !r->next->in_use) {
104 struct nouveau_heap *new = r->next;
108 r->prev->next = new
[all...] |
| /external/mksh/src/ |
| lalloc.c | 40 ap->next = NULL;
59 while (ap->next != lp)
60 if ((ap = ap->next) == NULL) {
94 pp->next = lp->next;
105 lp->next = ap->next;
106 ap->next = lp;
119 pp->next = lp->next;
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| ListIterator.java | 28 * Inserts the specified object into the list between {@code next} and
46 * @see #next
60 * Returns the next object in the iteration.
62 * @return the next object.
67 public E next(); method in interface:ListIterator
70 * Returns the index of the next object in the iteration.
72 * @return the index of the next object, or the size of the list if the
76 * @see #next
102 * Removes the last object returned by {@code next} or {@code previous} from
108 * if {@code next} or {@code previous} have not been called, o
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| PartitionAlloc.cpp | 65 root->seedPage.next = &root->seedPage;
95 PartitionFreepagelistEntry* next = entry->next;
98 entry = next;
104 PartitionPageHeader* next = page->next;
107 page = next;
156 // We ran out, need to get more pages next time.
173 // Re-randomize the base location for next time just in case the
213 PartitionFreelistEntry* next = reinterpret_cast<PartitionFreelistEntry*>(reinterpret_cast<char*>(freelist) + size)
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| win32toolhelp_unittest.cc | 71 static bool Next(HANDLE handle, TestData* d) {
115 bool CheckCallCounters(int first, int next, int fail, int close) {
116 bool match = first_called_ == first && next_called_ == next
122 << next << ", "
157 static bool Next(HANDLE handle, Type* t) {
158 return Win32ToolhelpTest::Next(handle, t);
174 static bool Next(HANDLE handle, Type* t) {
193 static bool Next(HANDLE handle, Type* t) {
211 EXPECT_FALSE(t.Next());
215 // Tests that Next() returns false if the first-pointe
[all...] |
| /external/llvm/test/Transforms/SimplifyCFG/ |
| dce-cond-after-folding-terminator.ll | 6 ; CHECK-NEXT: entry:
7 ; CHECK-NEXT: ret void
21 ; CHECK-NEXT: entry:
22 ; CHECK-NEXT: ret void
39 ; CHECK-NEXT: entry:
41 ; CHK-NEXT: ret void
43 ; CHECK-NEXT: br label %L1
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
49 (elem)->next = elem; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
75 (elem)->next = list; \
77 (list)->prev->next = elem;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| simple_list.h | 45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
82 (elem)->next = list; \
84 (list)->prev->next = elem;
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| pagemap_unittest.cc | 128 CHECK(map.Next(0) == NULL);
129 CHECK(map.Next(5) == NULL);
130 CHECK(map.Next(1<<30) == NULL);
135 CHECK(map.Next(0) == &a);
136 CHECK(map.Next(39) == &a);
137 CHECK(map.Next(40) == &a);
138 CHECK(map.Next(41) == NULL);
139 CHECK(map.Next(1<<30) == NULL);
148 CHECK(map.Next(0) == &a);
149 CHECK(map.Next(39) == &a)
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| pagemap_unittest.cc | 128 CHECK(map.Next(0) == NULL);
129 CHECK(map.Next(5) == NULL);
130 CHECK(map.Next(1<<30) == NULL);
135 CHECK(map.Next(0) == &a);
136 CHECK(map.Next(39) == &a);
137 CHECK(map.Next(40) == &a);
138 CHECK(map.Next(41) == NULL);
139 CHECK(map.Next(1<<30) == NULL);
148 CHECK(map.Next(0) == &a);
149 CHECK(map.Next(39) == &a)
[all...] |
| /external/clang/test/CodeGen/ |
| vld_dup.c | 18 // CHECK-NEXT: [[T169:%.*]] = extractvalue { <2 x i32>, <2 x i32>, <2 x i32> } [[T168]], 0
19 // CHECK-NEXT: [[T170:%.*]] = shufflevector <2 x i32> [[T169]], <2 x i32> [[T169]], <2 x i32> zeroinitializer
20 // CHECK-NEXT: [[T171:%.*]] = insertvalue { <2 x i32>, <2 x i32>, <2 x i32> } [[T168]], <2 x i32> [[T170]], 0
21 // CHECK-NEXT: [[T172:%.*]] = extractvalue { <2 x i32>, <2 x i32>, <2 x i32> } [[T171]], 1
22 // CHECK-NEXT: [[T173:%.*]] = shufflevector <2 x i32> [[T172]], <2 x i32> [[T172]], <2 x i32> zeroinitializer
23 // CHECK-NEXT: [[T174:%.*]] = insertvalue { <2 x i32>, <2 x i32>, <2 x i32> } [[T171]], <2 x i32> [[T173]], 1
24 // CHECK-NEXT: [[T175:%.*]] = extractvalue { <2 x i32>, <2 x i32>, <2 x i32> } [[T174]], 2
25 // CHECK-NEXT: [[T176:%.*]] = shufflevector <2 x i32> [[T175]], <2 x i32> [[T175]], <2 x i32> zeroinitializer
26 // CHECK-NEXT: [[T177:%.*]] = insertvalue { <2 x i32>, <2 x i32>, <2 x i32> } [[T174]], <2 x i32> [[T176]], 2
30 // CHECK-NEXT: [[T179:%.*]] = extractvalue { <2 x i32>, <2 x i32>, <2 x i32>, <2 x i32> } [[T178]],
[all...] |
