| /external/llvm/test/CodeGen/X86/ |
| masked-iv-unsafe.ll | 14 %indvar = phi i64 [ 10, %entry ], [ %indvar.next, %loop ]
29 %indvar.next = add i64 %indvar, 1
30 %exitcond = icmp eq i64 %indvar.next, 0
42 %indvar = phi i64 [ 10, %entry ], [ %indvar.next, %loop ]
57 %indvar.next = sub i64 %indvar, 1
58 %exitcond = icmp eq i64 %indvar.next, 20
70 %indvar = phi i64 [ 10, %entry ], [ %indvar.next, %loop ]
87 %indvar.next = add i64 %indvar, 1
88 %exitcond = icmp eq i64 %indvar.next, 0
100 %indvar = phi i64 [ 10, %entry ], [ %indvar.next, %loop
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| skiplist.h | 19 // (2) The contents of a Node except for the next/prev pointers are
25 // ... prev vs. next pointer ordering ...
69 // Advances to the next position.
71 void Next();
151 Node* Next(int n) {
205 inline void SkipList<Key,Comparator>::Iterator::Next() {
207 node_ = node_->Next(0);
228 node_ = list_->head_->Next(0);
244 while (height < kMaxHeight && ((rnd_.Next() % kBranching) == 0)) {
264 Node* next = x->Next(level) local
287 Node* next = x->Next(level); local
307 Node* next = x->Next(level); local
[all...] |
| /external/chromium_org/third_party/npapi/npspy/common/ |
| epmanager.cpp | 46 next(NULL),
56 next(NULL),
80 InstanceList * next = instances->next; local
82 instances = next;
85 PluginEntryPointList * next = eps->next; local
87 eps = next;
123 eps->next = mEntryPoints;
133 for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next)
[all...] |
| /external/llvm/test/Transforms/ObjCARC/ |
| rv.ll | 30 ; CHECK-NEXT: entry:
31 ; CHECK-NEXT: %x = call i8* @returner
32 ; CHECK-NEXT: %0 = tail call i8* @objc_retainAutoreleasedReturnValue(i8* %x) [[NUW:#[0-9]+]]
36 ; CHECK-NEXT: call void @objc_release(i8* %x)
37 ; CHECK-NEXT: ret void
38 ; CHECK-NEXT: }
72 ; CHECK-NEXT: ret i8* %call
86 ; CHECK-NEXT: ret i8* %call
101 ; HECK-NEXT: ret i8* %call
153 ; CHECK-NEXT: ret i8* %
[all...] |
| contract.ll | 78 ; CHECK-NEXT: entry:
79 ; CHECK-NEXT: @objc_retainAutorelease(i8* %x) [[NUW]]
80 ; CHECK-NEXT: @use_pointer
81 ; CHECK-NEXT: @objc_release
82 ; CHECK-NEXT: ret void
83 ; CHECK-NEXT: }
141 ; CHECK-NEXT: }
192 ; CHECK-NEXT: %y = call i8* @returner()
193 ; CHECK-NEXT: tail call i8* @objc_retainAutoreleasedReturnValue(i8* %y) [[NUW]]
194 ; CHECK-NEXT: ret voi
[all...] |
| /build/tools/droiddoc/templates-pdk/ |
| docpage.cs | 26 <?cs if:next.link ?>
28 <div class="training-nav-button-next">
29 <a href="<?cs var:next.link ?>">
32 <span class="training-nav-button-title"><?cs var:next.title ?></span>
38 <div class="training-nav-button-next">
39 <a href="<?cs var:next.link ?>">
40 Next lesson
42 <span class="training-nav-button-title"><?cs var:next.title ?></span>
47 <?cs /if ?><?cs # end if next.link ?>
68 <?cs if:!startpage && (previous.link || next.link) ?
[all...] |
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| CollationElementIteratorTest.java | 51 iterator.next();
62 int order = iterator.next();
66 order = iterator.next();
86 int order = iterator.next();
90 order = iterator.next();
106 int order = iterator.next();
109 order = iterator.next();
120 int order = iterator.next();
124 int order2 = iterator2.next();
135 int order = iterator.next();
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeTraversal.cpp | 47 if (Node* next = current->pseudoAwareFirstChild())
48 return next;
51 if (Node* next = current->pseudoAwareNextSibling())
52 return next;
56 if (Node* next = current->pseudoAwareNextSibling())
57 return next;
66 if (Node* next = current->pseudoAwareNextSibling())
67 return next;
71 if (Node* next = current->pseudoAwareNextSibling())
72 return next;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| nouveau_fence.c | 96 screen->fence.tail->next = fence;
117 screen->fence.head = fence->next;
121 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 it->next = fence->next;
140 struct nouveau_fence *next = NULL; local
147 for (fence = screen->fence.head; fence; fence = next) {
148 next = fence->next;
[all...] |
| /external/freetype/src/base/ |
| ftutil.c | 254 cur = cur->next;
270 node->next = 0;
274 before->next = node;
291 node->next = after;
313 after = node->next;
316 before->next = after;
337 after = node->next;
343 before->next = after;
351 node->next = list->head;
370 FT_ListNode next = cur->next local
398 FT_ListNode next = cur->next; local
[all...] |
| /external/llvm/test/CodeGen/PowerPC/ |
| vec_constants.ll | 29 ; CHECK-NEXT: vadduwm
30 ; CHECK-NEXT: blr
38 ; CHECK-NEXT: vspltisw
39 ; CHECK-NEXT: vsubuwm
40 ; CHECK-NEXT: blr
48 ; CHECK-NEXT: vadduhm
49 ; CHECK-NEXT: blr
57 ; CHECK-NEXT: vslb
58 ; CHECK-NEXT: blr
66 ; CHECK-NEXT: vsldo
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| extractvalue.ll | 43 ; CHECK-NEXT: [[GEP:%[a-z0-9]+]] = getelementptr inbounds {{.*}}* %pair, i32 0, i32 1
44 ; CHECK-NEXT: [[LOAD:%[A-Za-z0-9]+]] = load i32* [[GEP]]
45 ; CHECK-NEXT: store
46 ; CHECK-NEXT: br label %loop
71 ; CHECK-NEXT: [[GEP:%[a-z0-9]+]] = getelementptr inbounds {{.*}}* %arg, i32 0, i32 1, i32 1
72 ; CHECK-NEXT: [[LOAD:%[A-Za-z0-9]+]] = load i32* [[GEP]]
73 ; CHECK-NEXT: ret i32 [[LOAD]]
84 ; CHECK-NEXT: load {{.*}} %pair
85 ; CHECK-NEXT: extractvalue
86 ; CHECK-NEXT: extractvalu
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_fence.c | 96 screen->fence.tail->next = fence;
117 screen->fence.head = fence->next;
121 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 it->next = fence->next;
140 struct nouveau_fence *next = NULL; local
147 for (fence = screen->fence.head; fence; fence = next) {
148 next = fence->next;
[all...] |
| /external/valgrind/main/coregrind/m_gdbserver/ |
| inferiors.c | 44 new_inferior->next = NULL;
46 list->tail->next = new_inferior;
55 struct inferior_list_entry *cur = list->head, *next; local
58 next = cur->next;
60 cur = next;
79 list->head = entry->next;
86 while (*cur && (*cur)->next != entry)
87 cur = &(*cur)->next;
92 (*cur)->next = entry->next
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| AtomicInteger.java | 133 int next = current + 1; local
134 if (compareAndSet(current, next))
147 int next = current - 1; local
148 if (compareAndSet(current, next))
162 int next = current + delta; local
163 if (compareAndSet(current, next))
176 int next = current + 1; local
177 if (compareAndSet(current, next))
178 return next;
190 int next = current - 1 local
205 int next = current + delta; local
[all...] |
| AtomicLong.java | 147 long next = current + 1; local
148 if (compareAndSet(current, next))
161 long next = current - 1; local
162 if (compareAndSet(current, next))
176 long next = current + delta; local
177 if (compareAndSet(current, next))
190 long next = current + 1; local
191 if (compareAndSet(current, next))
192 return next;
204 long next = current - 1 local
219 long next = current + delta; local
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
| reverse_fold_impl.hpp | 54 typedef typename mpl::next<iter0>::type iter1;
75 typedef typename mpl::next<iter0>::type iter1;
77 typedef typename mpl::next<iter1>::type iter2;
101 typedef typename mpl::next<iter0>::type iter1;
103 typedef typename mpl::next<iter1>::type iter2;
105 typedef typename mpl::next<iter2>::type iter3;
130 typedef typename mpl::next<iter0>::type iter1;
132 typedef typename mpl::next<iter1>::type iter2;
134 typedef typename mpl::next<iter2>::type iter3;
136 typedef typename mpl::next<iter3>::type iter4
[all...] |
| /external/chromium_org/net/disk_cache/ |
| rankings.cc | 267 node->Data()->next = my_head.value();
273 node->Data()->next = my_tail.value();
291 // y, prev is x and next is z):
296 // 4. r(0, 0), head(0), tail(0) next.Store()
300 // 2. a(x, r), r(a, b), b(a, y), head(x), tail(y) next.Store()
307 // 3. r(r, b), b(b, y), head(b), tail(y) next.Store()
314 // 4. a(x, a), r(0, 0), head(x), tail(a) next.Store()
317 node->Data()->next, node->Data()->prev, list);
322 Addr next_addr(node->Data()->next);
333 CacheRankingsBlock next(backend_->File(next_addr), next_addr)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 204 * Traverse to the next node after the current node.
209 * @return the next node in the iteration, or DTM.NULL.
211 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AncestorTraverser
217 * Traverse to the next node after the current node that is matched
224 * @return the next node in the iteration, or DTM.NULL.
226 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AncestorTraverser
276 ? context : next(context, context, expandedTypeID);
287 * Traverse to the next node after the current node.
292 * @return the next node in the iteration, or DTM.NULL.
294 public int next(int context, int current method in class:DTMDefaultBaseTraversers.AttributeTraverser
310 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AttributeTraverser
460 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.ChildTraverser
475 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.ChildTraverser
558 int next = findElementFromIndex(nsIndex, lnIndex, nextPotential); local
701 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.DescendantTraverser
730 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.DescendantTraverser
805 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AllFromNodeTraverser
926 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.FollowingTraverser
958 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.FollowingTraverser
994 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.FollowingSiblingTraverser
1009 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.FollowingSiblingTraverser
1036 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.NamespaceDeclsTraverser
1054 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.NamespaceDeclsTraverser
1087 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.NamespaceTraverser
1105 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.NamespaceTraverser
1183 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.ParentTraverser
1201 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.ParentTraverser
1245 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingTraverser
1274 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingTraverser
1309 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingAndAncestorTraverser
1337 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingAndAncestorTraverser
1370 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingSiblingTraverser
1385 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingSiblingTraverser
1443 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.SelfTraverser
1458 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.SelfTraverser
1504 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AllFromRootTraverser
1530 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AllFromRootTraverser
1579 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.RootTraverser
1594 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.RootTraverser
[all...] |
| /external/dropbear/libtomcrypt/testprof/ |
| der_tests.c | 198 /* we expect l->next to be NULL and l->child to not be */
200 if (l->next != NULL || l->child == NULL) {
201 fprintf(stderr, "(%d), %d, %lu, next=%p, prev=%p, parent=%p, child=%p\n", __LINE__, l->type, l->size, l->next, l->prev, l->parent, l->child);
207 fprintf(stderr, "(%d), %d, %lu, next=%p, prev=%p, parent=%p, child=%p\n", __LINE__, l->type, l->size, l->next, l->prev, l->parent, l->child);
214 if (l->next == NULL || l->child != NULL) {
215 fprintf(stderr, "(%d), %d, %lu, next=%p, prev=%p, parent=%p, child=%p\n", __LINE__, l->type, l->size, l->next, l->prev, l->parent, l->child);
220 fprintf(stderr, "(%d), %d, %lu, next=%p, prev=%p, parent=%p, child=%p\n", __LINE__, l->type, l->size, l->next, l->prev, l->parent, l->c (…)
[all...] |
| /external/okhttp/src/test/java/com/squareup/okhttp/internal/http/ |
| RouteSelectorTest.java | 91 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
97 routeSelector.next("GET");
110 Connection connection = routeSelector.next("GET");
114 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
118 routeSelector.next("GET");
131 assertConnection(routeSelector.next("GET"), address, proxyA, dns.inetAddresses[0], proxyAPort,
133 assertConnection(routeSelector.next("GET"), address, proxyA, dns.inetAddresses[1], proxyAPort,
149 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
151 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[1], uriPort,
169 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort
[all...] |
| /external/bison/lib/ |
| lbitset.c | 63 struct lbitset_elt_struct *next; /* Next element. */ member in struct:lbitset_elt_struct
100 lbitset_free_list = elt->next;
159 elt->next = lbitset_free_list;
168 lbitset_elt *next = elt->next; local
172 prev->next = next;
174 if (next)
175 next->prev = prev
213 lbitset_elt *next; local
391 lbitset_elt *next; local
867 lbitset_elt *next; local
[all...] |
| /external/libsepol/src/ |
| ebitmap.c | 37 n1 = n1->next;
38 n2 = n2->next;
42 n1 = n1->next;
46 n2 = n2->next;
49 new->next = 0;
51 prev->next = new;
161 n1 = n1->next;
162 n2 = n2->next;
187 new->next = 0;
189 prev->next = new
[all...] |
| /external/llvm/test/Transforms/Reassociate/ |
| basictest.ll | 10 ; CHECK-NEXT: sub i32 0, %arg
11 ; CHECK-NEXT: ret i32
20 ; CHECK-NEXT: add i32 %reg1111, %reg109
21 ; CHECK-NEXT: ret i32
119 ; CHECK-NEXT: add i32 %C, %B
120 ; CHECK-NEXT: mul i32
121 ; CHECK-NEXT: mul i32
122 ; CHECK-NEXT: ret i32
133 ; CHECK-NEXT: %A = mul i32 %Y, %X
134 ; CHECK-NEXT: %C = sub i32 %Z, %
[all...] |
| /external/javassist/src/main/javassist/ |
| CtMember.java | 23 CtMember next; // for internal use field in class:CtMember
54 fieldTail.next = this;
65 method.next = methodTail.next;
66 methodTail.next = method;
79 cons.next = consTail.next;
80 consTail.next = cons;
88 field.next = this; // or fieldTail.next
131 final CtMember next() { return next; } method in class:CtMember
[all...] |
