Searched refs:next (Results 251 - 275 of 5298) sorted by relevance

<<11121314151617181920>>

/external/ImageMagick/coders/
H A Dicon.c721 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;
959 next=SyncNextImageInList(next);
864 *next; local
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_bb.cpp60 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
478 Instruction *insn, *next; local
[all...]
H A Dnv50_ir_graph.cpp40 for (IteratorRef it = safeIteratorDFS(); !it->end(); it->next())
56 prev[0]->next[0] = next[0];
57 next[0]->prev[0] = prev[0];
59 origin->out = (next[0] == this) ? NULL : next[0];
64 prev[1]->next[1] = next[1];
65 next[1]->prev[1] = prev[1];
67 target->in = (next[
234 virtual void next() { if (pos < count) ++pos; } function in class:nv50_ir::DFSIterator
280 virtual void next() { if (pos < count) ++pos; } function in class:nv50_ir::CFGIterator
418 Node *next = NULL; local
[all...]
/external/skia/src/utils/
H A DSkNWayCanvas.cpp40 bool next() { function in class:SkNWayCanvas::Iter
57 while (iter.next()) {
66 while (iter.next()) {
77 while (iter.next()) {
85 while (iter.next()) {
93 while (iter.next()) {
101 while (iter.next()) {
109 while (iter.next()) {
117 while (iter.next()) {
125 while (iter.next()) {
[all...]
/external/chromium-trace/catapult/telemetry/third_party/web-page-replay/third_party/dns/rdtypes/ANY/
H A DNSEC.py26 @ivar next: the next name
27 @type next: dns.name.Name object
31 __slots__ = ['next', 'windows']
33 def __init__(self, rdclass, rdtype, next, windows):
35 self.next = next
39 next = self.next.choose_relativity(origin, relativize)
50 return '%s%s' % (next, tex
[all...]
/external/zlib/src/contrib/blast/
H A Dblast.c41 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,
[all...]
/external/autotest/tko/parsers/
H A Dbase.py21 self.state.next()
29 return self.state.next()
49 return self.state.next()
/external/bison/src/
H A Dsymlist.c53 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/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/
H A DGroupedLinkedMap.java75 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
117 LinkedEntry<K, V> next; field in class:GroupedLinkedMap.LinkedEntry
[all...]
/external/google-tv-pairing-protocol/java/src/com/google/polo/json/
H A DJSONTokener.java73 * the next number or identifier.
106 * Determine if the source string still contains characters that next()
111 char nextChar = next();
121 * Get the next character in the source string.
123 * @return The next character, or 0 if past the end of the source string.
125 public char next() throws JSONException { method in class:JSONTokener
151 * Consume the next character, and check that it matches a specified
157 public char next(char c) throws JSONException { method in class:JSONTokener
158 char n = next();
168 * Get the next
176 public String next(int n) throws JSONException { method in class:JSONTokener
[all...]
/external/jacoco/org.jacoco.core/src/org/jacoco/core/runtime/
H A DWildcardMatcher.java34 boolean next = false;
36 if (next) {
40 next = true;
/external/javassist/src/main/javassist/bytecode/analysis/
H A DIntQueue.java21 private IntQueue.Entry next; field in class:IntQueue.Entry
34 tail.next = entry;
50 head = head.next;
/external/javassist/src/main/javassist/convert/
H A DTransformer.java34 private Transformer next; field in class:Transformer
37 next = t;
40 public Transformer getNext() { return next; }
/external/libcxx/test/std/containers/associative/map/map.cons/
H A Dcopy.pass.cpp49 assert(*next(m.begin()) == V(2, 1));
50 assert(*next(m.begin(), 2) == V(3, 1));
57 assert(*next(mo.begin()) == V(2, 1));
58 assert(*next(mo.begin(), 2) == V(3, 1));
84 assert(*next(m.begin()) == V(2, 1));
85 assert(*next(m.begin(), 2) == V(3, 1));
92 assert(*next(mo.begin()) == V(2, 1));
93 assert(*next(mo.begin(), 2) == V(3, 1));
118 assert(*next(m.begin()) == V(2, 1));
119 assert(*next(
[all...]
H A Dcopy_alloc.pass.cpp48 assert(*next(m.begin()) == V(2, 1));
49 assert(*next(m.begin(), 2) == V(3, 1));
56 assert(*next(mo.begin()) == V(2, 1));
57 assert(*next(mo.begin(), 2) == V(3, 1));
83 assert(*next(m.begin()) == V(2, 1));
84 assert(*next(m.begin(), 2) == V(3, 1));
91 assert(*next(mo.begin()) == V(2, 1));
92 assert(*next(mo.begin(), 2) == V(3, 1));
117 assert(*next(m.begin()) == V(2, 1));
118 assert(*next(
[all...]
/external/syslinux/com32/lib/syslinux/
H A Dinitramfs.c45 ir->prev = ir->next = ir;
70 in->next = ihead;
72 ihead->prev->next = in;
H A Dsetup_data.c13 setup_data->prev = setup_data->next = setup_data;
30 setup_data->next = head;
31 head->prev->next = setup_data;
/external/syslinux/libfat/
H A Dcache.c26 for (ls = fs->sectors; ls; ls = ls->next) {
48 ls->next = fs->sectors;
62 lsnext = ls->next;
/external/toybox/toys/posix/
H A Dtee.c30 struct fd_list *next; member in struct:fd_list
41 temp->next = TT.outputs;
68 fdl = fdl->next;
/external/v8/src/zone/
H A Dzone-segment.h28 Segment* next() const { return next_; } function in class:v8::internal::Segment
29 void set_next(Segment* const next) { next_ = next; } argument
/external/e2fsprogs/lib/et/
H A Dcom_right.c52 for (p = list; p; p = p->next) {
63 for (p = list; p; p = p->next) {
96 for (end = list, et = *list; et; end = &et->next, et = et->next)
107 et->next = NULL;
117 et = et->next;
/external/guava/guava-testlib/test/com/google/common/collect/testing/
H A DMinimalIterableTest.java40 iterator.next();
55 assertEquals("a", iterator.next());
58 iterator.next();
75 iterator.next();
91 assertEquals("a", iterator.next());
99 iterator.next();
/external/javassist/src/main/javassist/compiler/
H A DLex.java19 public Token next = null; field in class:Token
57 lookAheadTokens = lookAheadTokens.next;
63 * Looks at the next token.
73 tk.next = null;
77 for (; i-- > 0; tk = tk.next)
78 if (tk.next == null) {
80 tk.next = tk2 = new Token();
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_bufmgr_cache.c15 * next paragraph) shall be included in all copies or substantial portions
127 struct list_head *curr, *next; local
133 curr = mgr->delayed.next;
134 next = curr->next;
143 curr = next;
144 next = curr->next;
267 struct list_head *curr, *next; local
274 curr = mgr->delayed.next;
360 struct list_head *curr, *next; local
[all...]
/external/skia/src/core/
H A DSkTLS.cpp52 SkTLSRec* next = rec->fNext; local
54 rec = next;
116 SkTLSRec* next = curr->fNext; local
119 prev->fNext = next;
122 SkTLS::PlatformSetSpecific(next);
128 curr = next;

Completed in 3961 milliseconds

<<11121314151617181920>>