| /external/junit/src/org/junit/experimental/theories/internal/ |
| ParameterizedAssertionError.java | 33 Object next = iter.next(); local
34 buffer.append(stringValueOf(next));
42 private static String stringValueOf(Object next) {
44 return String.valueOf(next);
|
| /external/libdrm/amdgpu/ |
| amdgpu_vamgr.c | 172 hole = container_of(mgr->va_holes.next, hole, list);
180 struct amdgpu_bo_va_hole *next; local
183 LIST_FOR_EACH_ENTRY(next, &mgr->va_holes, list) {
184 if (next->offset < va)
186 hole = next;
195 if (next != hole
196 && &next->list != &mgr->va_holes
197 && (next->offset + next->size) == va) {
198 next->size += hole->size
[all...] |
| /external/mockito/src/org/mockito/internal/verification/checkers/ |
| NonGreedyNumberOfInvocationsInOrderChecker.java | 39 Invocation next = finder.findFirstMatchingUnverifiedInvocation( invocations, wanted, context ); local
40 if( next == null ){
43 marker.markVerified( next, wanted );
44 context.markVerified( next );
45 lastLocation = next.getLocation();
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ |
| ContactParser.java | 61 final char next = lexer.lookAhead(1); local
62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
|
| /external/selinux/libsepol/cil/src/ |
| cil_list.c | 63 struct cil_list_item *next = NULL; local
66 next = item->next;
73 item = next;
82 new_item->next = NULL;
116 list->tail->next = item;
138 item->next = list->head;
164 item->next = curr->next;
166 curr->next = item
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| ServiceLoaderTest.java | 35 assertTrue(it.next() instanceof Impl1);
37 assertTrue(it.next() instanceof Impl2);
44 ServiceLoader.load(ServiceLoaderTestInterfaceMissingClass.class).iterator().next();
55 ServiceLoader.load(ServiceLoaderTestInterfaceWrongType.class).iterator().next();
65 ServiceLoader.load(ServiceLoaderTestInterfaceParseError.class).iterator().next();
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/list/aux_/ |
| iterator.hpp | 43 struct next< l_iter<Node> > struct in namespace:boost::mpl
45 typedef l_iter< typename Node::next > type;
56 typedef l_iter< typename mpl::next<Node>::type > next;
68 typedef l_iter next; typedef in struct:boost::mpl::l_iter
|
| /system/bt/osi/src/ |
| list.c | 8 struct list_node_t *next; member in struct:list_node_t
98 node->next = prev_node->next;
100 prev_node->next = node;
114 node->next = list->head;
130 node->next = NULL;
136 list->tail->next = node;
151 list_node_t *next = list_free_node_(list, list->head); local
153 list->tail = next;
154 list->head = next;
183 list_node_t *next = node->next; local
215 list_node_t *next = node->next; local
[all...] |
| /toolchain/binutils/binutils-2.25/bfd/ |
| elf-nacl.c | 93 for (seg = *m; seg != NULL; seg = seg->next)
124 rather than trying to put the next (unaligned, or
181 goto next;
197 prevseg = prevseg->next)
212 next:
213 m = &seg->next;
222 *first_load = first->next;
223 first->next = last->next;
224 last->next = first
[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
226 tail.next = node;
245 node.next = nextSibling;
255 nextSibling.previous.next = node;
271 node.previous.next = node.next;
273 head = node.next;
275 if (node.next != null)
318 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
335 next(); method
351 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
412 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
427 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
451 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
484 next(); method
497 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
222 tail.next = node;
241 node.next = nextSibling;
251 nextSibling.previous.next = node;
267 node.previous.next = node.next;
269 head = node.next;
271 if (node.next != null)
314 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
331 next(); method
347 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
408 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
423 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
447 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
480 next(); method
493 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/opencv3/modules/core/src/ |
| alloc.cpp | 208 Node* next;
219 next = _next;
233 prev->next = this;
234 next = _next;
235 if(next)
236 next->prev = this;
252 Block* next;
271 next = _next;
284 BigBlock* next;
300 BigBlock* nextBlock = pool->next;
[all...] |
| /frameworks/base/packages/Osu/src/com/android/hotspot2/osu/ |
| SPVerifier.java | 97 castObject(children.next(), Asn1Constructed.class).getChildren().iterator();
98 mMimeType = castObject(logoTypeDetails.next(), Asn1String.class).getString();
100 Asn1Constructed hashes = castObject(logoTypeDetails.next(), Asn1Constructed.class);
104 Asn1Constructed urls = castObject(logoTypeDetails.next(), Asn1Constructed.class);
117 castObject(children.next(), Asn1Constructed.class).getChildren().iterator();
119 Asn1Object first = imageInfo.next();
121 first = imageInfo.next(); // Ignore optional LogotypeImageType
125 xSize = (int) castObject(imageInfo.next(), Asn1Integer.class).getValue();
126 ySize = (int) castObject(imageInfo.next(), Asn1Integer.class).getValue();
130 Asn1Object next = imageInfo.next() local
[all...] |
| /external/ImageMagick/MagickCore/ |
| layer.c | 220 % with the next image in the sequence.
241 *next;
255 next=GetFirstImageInList(image);
256 bounds=next->page;
259 bounds.width=next->columns;
265 bounds.height=next->rows;
271 coalesce_image=CloneImage(next,bounds.width,bounds.height,MagickTrue,
277 coalesce_image->alpha_trait=next->alpha_trait;
284 (void) CompositeImage(coalesce_image,next,CopyCompositeOp,MagickTrue,
285 next->page.x,next->page.y,exception)
237 *next; local
388 *next; local
759 *next; local
1471 *next; local
1597 *next; local
1916 *next; local
[all...] |
| constitute.c | 387 *next;
597 for (next=image; next != (Image *) NULL; next=GetNextImageInList(next))
610 next->taint=MagickFalse;
612 if (*magick_path == '\0' && *next->magick == '\0')
613 (void) CopyMagickString(next->magick,magick,MagickPathExtent);
614 (void) CopyMagickString(next->magick_filename,magick_filename,
617 (void) CopyMagickString(next->filename,filename,MagickPathExtent)
382 *next; local
1288 *next; local
[all...] |
| /external/ImageMagick/coders/ |
| icon.c | 721 Proceed to next image.
729 Allocate next image structure.
872 *next;
927 next=image;
933 next=SyncNextImageInList(next);
934 } while ((next != (Image *) NULL) && (image_info->adjoin != MagickFalse));
945 next=(images != (Image *) NULL) ? images : image;
864 *next; local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 60 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next())
63 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next())
66 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next())
97 for (Instruction *i = getFirst(); i; i = i->next)
102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
120 assert(inst->next == 0 && inst->prev == 0);
154 assert(inst->next == 0 && inst->prev == 0);
186 assert(p->next == 0 && p->prev == 0);
201 p->next = q;
204 p->prev->next = p
478 Instruction *insn, *next; local
[all...] |
| /bionic/linker/ |
| linked_list.h | 24 LinkedListEntry<T>* next; member in struct:LinkedListEntry
42 entry_ = entry_->next;
84 new_entry->next = head_;
94 new_entry->next = nullptr;
99 tail_->next = new_entry;
111 head_ = entry->next;
132 head_ = head_->next;
149 for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {
161 LinkedListEntry<T>* next = e->next; local
[all...] |
| /external/zlib/src/contrib/blast/ |
| blast.c | 41 unsigned char *in; /* next input location */
52 unsigned next; /* index of next write location in out[] */ member in struct:state
133 int left; /* bits left in next or left to process */
134 short *next; /* next number of codes */ local
140 next = h->count + 1;
145 count = *next++;
151 index += count; /* else update for next length */
256 * next, 0 for literals, 1 for length/distance
[all...] |
| /libcore/luni/src/test/java/libcore/xml/ |
| PullParserTest.java | 31 assertEquals(XmlPullParser.START_TAG, parser.next());
41 assertEquals(XmlPullParser.START_TAG, parser.next());
51 assertEquals(XmlPullParser.START_TAG, parser.next());
55 assertEquals(XmlPullParser.TEXT, parser.next());
77 assertEquals(XmlPullParser.START_TAG, parser.next());
80 assertEquals(XmlPullParser.START_TAG, parser.next());
83 assertEquals(XmlPullParser.END_TAG, parser.next());
86 assertEquals(XmlPullParser.END_TAG, parser.next());
94 assertEquals(XmlPullParser.START_TAG, parser.next());
119 assertEquals(XmlPullParser.START_TAG, parser.next());
[all...] |
| /system/extras/showslab/ |
| showslab.c | 21 struct slab_info *next; member in struct:slab_info
141 prev->next = p;
149 p->next = NULL;
163 struct slab_info *temp = list->next;
176 p->next = a;
178 a = a->next;
180 p->next = b;
182 b = b->next;
186 p->next = (a == NULL) ? b : a;
187 return list.next;
[all...] |
| /development/ndk/platforms/android-9/arch-mips/include/asm/ |
| system.h | 14 *** Any manual change here will be lost the next time this script will
34 #define switch_to(prev, next, last) do { __mips_mt_fpaff_switch_to(prev); if (cpu_has_dsp) __save_dsp(prev); (last) = resume(prev, next, task_thread_info(next)); } while (0)
|
| /external/bison/src/ |
| symlist.c | 53 res->next = NULL;
72 res->next = NULL;
90 res->next = NULL;
108 res->next = NULL;
121 for (/* Nothing. */; l && l->content.sym; l = l->next)
138 node->next = list;
150 symbol_list *node, *next; local
151 for (node = list; node; node = next)
153 next = node->next;
[all...] |
| /external/boringssl/src/crypto/lhash/ |
| lhash_test.c | 28 struct dummy_lhash_node *next; member in struct:dummy_lhash_node
36 struct dummy_lhash_node *cur, *next; local
38 for (cur = lh->head; cur != NULL; cur = next) {
39 next = cur->next;
49 for (cur = lh->head; cur != NULL; cur = cur->next) {
59 for (cur = lh->head; cur != NULL; cur = cur->next) {
71 for (cur = lh->head; cur != NULL; cur = cur->next) {
82 node->next = lh->head;
92 for (cur = lh->head; cur != NULL; cur = cur->next) {
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
| GroupedLinkedMap.java | 75 LinkedEntry<K, V> current = head.next;
80 current = current.next;
92 entry.next = head.next;
100 entry.next = head;
105 entry.next.prev = entry;
106 entry.prev.next = entry;
110 entry.prev.next = entry.next;
111 entry.next.prev = entry.prev
117 LinkedEntry<K, V> next; field in class:GroupedLinkedMap.LinkedEntry
[all...] |
