| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_unfilled.c | 15 * next paragraph) shall be included in all copies or substantial portions
65 stage->next->point( stage->next, &tmp );
75 stage->next->line( stage->next, &tmp );
100 stage->next->reset_stipple_counter( stage->next );
145 stage->next->tri( stage->next, header );
177 stage->next->flush( stage->next, flags )
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_program.c | 15 * next paragraph) shall be included in all copies or substantial
57 struct rc_instruction * inst = c->Program.Instructions.Next;
63 inst = inst->Next;
114 for(inst = c->Program.Instructions.Next;
115 inst != &c->Program.Instructions; inst = inst->Next) {
187 inst->Next = after->Next;
189 inst->Prev->Next = inst;
190 inst->Next->Prev = inst;
204 inst->Prev->Next = inst->Next
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 struct cache_item *next; member in struct:cache_item
85 struct cache_item *c, *next; local
95 for (c = cache->items[i]; c; c = next) {
96 next = c->next;
97 c->next = items[c->hash % size];
111 struct cache_item *c, *next; local
117 for (c = cache->items[i]; c; c = next) {
118 next = c->next
[all...] |
| /external/oprofile/libop/ |
| op_alloc_counter.c | 24 struct list_head next; member in struct:counter_arc_head
31 /** the next counter allowed for this event */
32 struct list_head next; member in struct:counter_arc
56 list_init(&ctr_arc[i].next);
69 list_add_tail(&arc->next, &ctr_arc[i].next);
90 list_for_each_safe(pos, pos2, &ctr_arc[i].next) {
91 counter_arc * arc = list_entry(pos, counter_arc, next);
92 list_del(&arc->next);
135 if((&ctr_arc[depth].next)->next == &ctr_arc[depth].next)
[all...] |
| /external/proguard/src/proguard/optimize/peephole/ |
| ReachableCodeMarker.java | 44 private boolean next; field in class:ReachableCodeMarker
127 next = false;
141 next = false;
158 next = false;
178 next = false;
217 boolean oldNext = next;
221 next = oldNext;
230 boolean oldNext = next;
244 // By default, we'll assume we can continue with the next
246 next = true
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/timer/ |
| SDL_timer.c | 46 struct _SDL_TimerID *next; member in struct:_SDL_TimerID
107 SDL_TimerID t, prev, next; local
113 for ( prev = NULL, t = SDL_timers; t; t = next ) {
116 next = t->next;
147 prev->next = next;
149 SDL_timers = next;
174 t->next = SDL_timers;
214 for (t = SDL_timers; t; prev=t, t = t->next ) {
[all...] |
| /external/qemu/ |
| iohandler.c | 41 QLIST_ENTRY(IOHandlerRecord) next;
59 QLIST_FOREACH(ioh, &io_handlers, next) {
66 QLIST_FOREACH(ioh, &io_handlers, next) {
71 QLIST_INSERT_HEAD(&io_handlers, ioh, next);
95 QLIST_FOREACH(ioh, &io_handlers, next) {
118 QLIST_FOREACH_SAFE(ioh, &io_handlers, next, pioh) {
128 QLIST_REMOVE(ioh, next);
140 QLIST_ENTRY(ChildProcessRecord) next;
155 ChildProcessRecord *rec, *next; local
157 QLIST_FOREACH_SAFE(rec, &child_watches, next, next)
[all...] |
| /external/smack/src/org/jivesoftware/smack/util/collections/ |
| MapIterator.java | 32 * to <code>next()</code>, the <code>getValue()</code> method provides direct
37 * Object key = it.next();
57 * Gets the next <em>key</em> from the <code>Map</code>.
59 * @return the next key in the iteration
63 K next(); method in interface:MapIterator
68 * to <code>next()</code>.
71 * @throws IllegalStateException if <code>next()</code> has not yet been called
77 * returned by <code>next()</code>.
80 * @throws IllegalStateException if <code>next()</code> has not yet been called
88 * This method can be called once per call to <code>next()</code>
[all...] |
| /external/zlib/src/examples/ |
| gun.c | 93 unsigned char *next; local
96 next = me->inbuf;
97 *buf = next;
103 ret = (int)read(me->infile, next, ret);
108 next += ret;
154 /* next input byte macro for use inside lunpipe() and gunpipe() */
155 #define NEXT() (have ? 0 : (have = in(indp, &next)), \
156 last = have ? (have--, (int)(*next++)) : -1)
178 if (NEXT() == -1)
387 z_const unsigned char *next = NULL; local
[all...] |
| /external/icu4c/test/intltest/ |
| ucharstrietest.cpp | 236 // with next() and current().
338 // The first string (before next()) will be empty.
342 void next() { function in class:__anon20938::Generator
374 gen.next();
401 UStringTrieResult result=trie->next(x.getBuffer(), x.length());
403 errln("next(%d chars U+%04X U+%04X)!=hasValue or "
404 "next()!=current() or getValue() wrong "
408 gen.next();
472 trie->next(u_j);
473 trie->next(u_a)
[all...] |
| /external/clang/test/CodeGenCXX/ |
| mangle-lambdas.cpp | 24 // CHECK-NEXT: call i32 @_Z5inneri
27 // CHECK-NEXT: ret void
47 // CHECK-NEXT: call i32 @_ZZN1S1fEiiEd0_NKUlvE0_clEv
48 // CHECK-NEXT: add nsw i32
49 // CHECK-NEXT: call i32 @_ZZN1S1fEiiEd_NKUlvE_clEv
50 // CHECK-NEXT: call void @_ZN1S1fEii
58 // CHECK-NEXT: call i32 @"_ZNK1S3$_1clEv"
59 // CHECK-NEXT: call void @_ZN1S1gEi
62 // CHECK-NEXT: ret void
87 // CHECK-NEXT: call double @_ZZN2STIdE1fEddEd0_NKUlvE0_clE
[all...] |
| catch-undef-behavior.cpp | 21 // CHECK-NEXT: icmp uge i64 %[[SIZE]], 4
24 // CHECK-NEXT: %[[MISALIGN:.*]] = and i64 %[[PTRINT]], 3
25 // CHECK-NEXT: icmp eq i64 %[[MISALIGN]], 0
40 // CHECK-NEXT: icmp uge i64 %[[SIZE]], 24
43 // CHECK-NEXT: %[[MISALIGN:.*]] = and i64 %[[PTRINT]], 7
44 // CHECK-NEXT: icmp eq i64 %[[MISALIGN]], 0
49 // CHECK-NEXT: %[[VPTR:.*]] = load i64* %[[VPTRADDR]]
60 // CHECK-NEXT: xor i64 {{-4030275160588942838|2562089159}}, %[[VPTR]]
61 // CHECK-NEXT: mul i64 {{.*}}, -7070675565921424023
62 // CHECK-NEXT: lshr i64 {{.*}}, 4
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 114 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
116 Node<K, V> nextSibling; // the next node with the same key
197 tail.next = node;
211 node.next = nextSibling;
221 nextSibling.previous.next = node;
237 node.previous.next = node.next;
239 head = node.next;
241 if (node.next != null)
281 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
300 next(); method
310 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
366 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
374 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
395 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
426 next(); method
439 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| LinkedListMultimap.java | 110 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
112 Node<K, V> nextSibling; // the next node with the same key
193 tail.next = node;
207 node.next = nextSibling;
217 nextSibling.previous.next = node;
233 node.previous.next = node.next;
235 head = node.next;
237 if (node.next != null)
277 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
296 next(); method
306 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
362 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
370 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
391 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
422 next(); method
435 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| PeekingIteratorTest.java | 130 assertEquals("next() should still return first element after peeking",
131 "A", peekingIterator.next());
137 assertEquals("next() should still return middle element after peeking",
138 "B", peekingIterator.next());
144 assertEquals("next() should still return last element after peeking",
145 "C", peekingIterator.next());
149 fail("Should throw exception if no next to peek()");
153 fail("Should continue to throw exception if no next to peek()");
156 peekingIterator.next();
157 fail("next() should still throw exception after the end of iteration")
202 public E next() { method in class:PeekingIteratorTest.ThrowsAtEndIterator
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_range.pass.cpp | 93 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
94 next(c2.cbefore_begin(), f), next(c2.cbefore_begin(), l));
109 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
110 next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l));
117 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
118 next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l));
137 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2)
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| Tokenizer.java | 184 int next = is.read(); local
185 if (next != '\n')
186 is.unread(next);
225 * Gets the next token from a tokenizer.
229 * @return The next token in the stream.
339 * Gets the next token from a tokenizer, ignoring whitespace and comments.
340 * @return The next token in the stream.
350 * Returns a token to the stream, so that it will be returned by the next call
365 * Gets the next token from a tokenizer and converts it to a string.
366 * @return The next token in the stream, as a string
372 Token next = get(); local
381 Token next = get(); local
407 String next = _getIdentifier("an integer"); local
474 String next = _getIdentifier("a TTL value"); local
492 String next = _getIdentifier("a TTL-like value"); local
513 String next = _getIdentifier("a name"); local
535 String next = _getIdentifier("an address"); local
551 Token next = get(); local
661 String next = _getIdentifier("a hex string"); local
677 String next = _getIdentifier("a base32 string"); local
[all...] |
| /external/srec/portable/src/ |
| phashtable.c | 42 PHashTableEntry *next; member in struct:PHashTableEntry_t
50 struct PHashTableEntryBlock_t *next; member in struct:PHashTableEntryBlock_t
139 tmp = block->next;
173 entry = entry->next;
183 entry = entry->next;
193 entry->table->entries[entry->idx] = entry->next;
195 entry->prev->next = entry->next;
197 if (entry->next != NULL)
198 entry->next->prev = entry->prev
279 PHashTableEntry *entry, *tmp, *next; local
[all...] |
| /external/llvm/test/CodeGen/SystemZ/ |
| int-cmp-44.ll | 13 ; CHECK-NEXT: je .L{{.*}}
32 ; CHECK-NEXT: jne .L{{.*}}
51 ; CHECK-NEXT: cijl %r2, 0, .L{{.*}}
70 ; CHECK-NEXT: cijle %r2, 0, .L{{.*}}
89 ; CHECK-NEXT: cijh %r2, 0, .L{{.*}}
108 ; CHECK-NEXT: cijhe %r2, 0, .L{{.*}}
127 ; CHECK-NEXT: jne .L{{.*}}
147 ; CHECK-NEXT: cijl %r2, 0, .L{{.*}}
168 ; CHECK-NEXT: jl .L{{.*}}
187 ; CHECK-NEXT: cijl %r2, 0, .L{{.*}
[all...] |
| /cts/tools/tradefed-host/tests/src/com/android/cts/tradefed/testtype/ |
| TestFilterTest.java | 63 assertEquals(TEST2, iter.next());
64 assertEquals(TEST3, iter.next());
74 assertEquals(TEST3, filteredList.iterator().next());
85 assertEquals(TEST1, iter.next());
86 assertEquals(TEST2, iter.next());
97 assertEquals(TEST1, iter.next());
|
| /external/chromium_org/third_party/WebKit/Source/core/loader/cache/ |
| ResourceClientWalker.h | 35 // Just keep calling next() on this. It's safe from deletions of items.
48 T* next() function in class:WebCore::ResourceClientWalker
52 ResourceClient* next = m_clientVector[m_index++]; local
53 if (m_clientSet.contains(next)) {
54 ASSERT(T::expectedType() == ResourceClient::expectedType() || next->resourceClientType() == T::expectedType());
55 return static_cast<T*>(next);
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkDrawLooper.h | 24 More than that, via the next() method, the looper can modify the draw to be
34 * calls to next() until next() returns false.
44 * will be as it was following the previous call to next() or init().
46 * The implementation must ensure that, when next() finally returns false,
50 virtual bool next(SkCanvas*, SkPaint* paint) = 0;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkTLS.cpp | 45 SkTLSRec* next = rec->fNext; local
47 rec = next;
109 SkTLSRec* next = curr->fNext; local
112 prev->fNext = next;
115 SkTLS::PlatformSetSpecific(next);
121 curr = next;
|
| /external/clang/test/CodeGenObjC/ |
| arc-bridged-cast.m | 34 // CHECK-NEXT: ret void
53 // CHECK-NEXT: ret void
61 // CHECK-NEXT: call i8* @objc_retainAutoreleasedReturnValue
66 // CHECK-NEXT: call i8* @objc_retainAutoreleasedReturnValue
70 // CHECK-NEXT: ret void
88 // CHECK-NEXT: ret void
|
| /external/llvm/test/CodeGen/ARM/ |
| arm-negative-stride.ll | 13 %indvar = phi i32 [ 0, %entry ], [ %indvar.next, %bb ] ; <i32> [#uses=2]
17 %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=2]
18 icmp eq i32 %indvar.next, %i ; <i1>:1 [#uses=1]
35 %indvar = phi i32 [ 0, %entry ], [ %indvar.next, %bb ] ; <i32> [#uses=2]
40 %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=2]
41 icmp eq i32 %indvar.next, %i ; <i1>:1 [#uses=1]
|
