| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_heap.h | 28 struct nouveau_heap *next; member in struct:nouveau_heap
|
| nouveau_mm.h | 11 struct nouveau_mm_allocation *next; member in struct:nouveau_mm_allocation
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| memory_pool.c | 11 * The above copyright notice and this permission notice (including the next
35 struct memory_block * next; member in struct:memory_block
48 pool->blocks = block->next;
62 newblock->next = pool->blocks;
90 block->next = pool->blocks;
|
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_quad_stipple.c | 54 qs->next->run(qs->next, quads, pass);
60 qs->next->begin(qs->next);
|
| /external/nist-sip/java/gov/nist/javax/sip/header/ |
| SIPObjectList.java | 90 GenericObject outerObj = (GenericObject) it1.next();
92 Object innerObj = it2.next();
125 * Get the next object of this list (assumes that first() has been
129 public GenericObject next() { method in class:SIPObjectList
130 return (SIPObject) super.next();
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
| PUserDatabaseParser.java | 100 char next = this.lexer.getNextChar(); local
101 if (next!='>'&&next!='\n')
103 dbname.append(next);
|
| /external/ant-glob/src/org/apache/tools/ant/util/ |
| FileUtils.java | 161 int next = colon + 1; local
162 root = path.substring(0, next);
166 next = (ca[next] == sep) ? next + 1 : next;
170 for (int i = next; i < ca.length; i++) {
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| BasicTestIterator.java | 31 * Base for iterators that handle predicates. Does the basic next
33 * next node.
120 * Get the next node via getNextXXX. Bottlenecked for derived class override.
121 * @return The next node on the axis, or DTM.NULL.
126 * Returns the next node in the set and advances the position of the
130 * @return The next <code>Node</code> in the set being iterated over, or
146 int next; local
170 next = getNextNode();
172 if (DTM.NULL != next)
174 if(DTMIterator.FILTER_ACCEPT == acceptNode(next))
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x9/ |
| DHDomainParameters.java | 76 ASN1Encodable next = getNext(e); local
78 if (next != null && next instanceof ASN1Integer)
80 this.j = ASN1Integer.getInstance(next);
81 next = getNext(e);
84 if (next != null)
86 this.validationParms = DHValidationParms.getInstance(next.toASN1Primitive());
|
| /external/chromium_org/testing/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
87 QueueNode<E>* next = node->next(); local
90 node = next;
92 next = node->next();
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_cull.c | 15 * next paragraph) shall be included in all copies or substantial portions
83 /* triangle is not culled, pass to next stage */
84 stage->next->tri( stage->next, header );
106 stage->next->flush( stage->next, flags );
112 stage->next->reset_stipple_counter( stage->next );
134 cull->stage.next = NULL;
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| free_list.h | 68 inline void EnsureNonLoop(void* node, void* next) {
71 if (node != next) return;
72 Log(kCrash, __FILE__, __LINE__, "Circular loop in list detected: ", next);
92 // Returns value of the |next| pointer w/out running a sanity check.
116 void *next = FL_Next_No_Check(t); local
117 if (next) {
118 FL_EqualityCheck(FL_Previous_No_Check(next), t, __FILE__, __LINE__);
120 return next;
124 // |*list|, and updates |*list| to point to the next element in the
|
| /external/libunwind/src/ |
| os-hpux.c | 105 map->next = as->map_list;
110 while (map_list->next != NULL && map->start <= map_list->next->start)
111 map_list = map_list->next;
112 map->next = map_list->next;
113 map_list->next = map;
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_cull.c | 15 * next paragraph) shall be included in all copies or substantial portions
83 /* triangle is not culled, pass to next stage */
84 stage->next->tri( stage->next, header );
106 stage->next->flush( stage->next, flags );
112 stage->next->reset_stipple_counter( stage->next );
134 cull->stage.next = NULL;
|
| /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());
107 assertEquals(TEST3, filteredList.iterator().next());
119 assertEquals(TEST1, iter.next());
120 assertEquals(TEST3, iter.next());
164 assertEquals(TEST2, iter.next());
[all...] |
| /external/chromium_org/v8/test/mjsunit/es6/ |
| generators-iteration.js | 39 assertIteratorResult(undefined, true, iter.next());
40 assertDoesNotThrow(function() { iter.next(); });
53 var result = iter.next();
70 // var v3 = iter.next();
71 assertIteratorResult(v1, v2, iter.next());
80 iter.next(send_val));
90 iter.next());
367 assertIteratorResult(1, false, iter.next());
368 assertIteratorResult(2, false, iter.next());
369 assertIteratorResult(3, false, iter.next());
[all...] |
| /external/ltrace/ |
| filter.c | 34 filt->next = NULL;
42 struct filter_rule *next = it->next; local
44 it = next;
56 rule->next = NULL;
70 for (rulep = &filt->rules; *rulep != NULL; rulep = &(*rulep)->next)
150 for (; filt != NULL; filt = filt->next) {
152 for (it = filt->rules; it != NULL; it = it->next)
168 for (; filt != NULL; filt = filt->next) {
171 for (it = filt->rules; it != NULL; it = it->next) {
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/UglifyJS/ |
| parse-js.js | 17 function to fetch the next token.
272 function next(signal_eof) {
324 next();
330 ret += next();
375 var ch = next(true);
393 var digit = parseInt(next(true), 16);
403 var quote = next(), ret = "";
405 var ch = next(true);
415 next();
428 next();
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| QuadraticBezierClip.cpp | 62 int next = idx + 1; local
63 if (next == 3) {
64 next = 0;
66 x_at(distance2y[idx], distance2y[next], top, bottom, flags, minT, maxT);
67 idx = next;
|
| /external/chromium_org/v8/src/ |
| lookup-inl.h | 18 JSReceiver* next = JSReceiver::cast(map->prototype());
19 DCHECK(!next->map()->IsGlobalObjectMap() ||
20 next->map()->is_hidden_prototype());
23 !(check_hidden() && next->map()->is_hidden_prototype()) &&
30 return next;
|
| /external/libcxx/test/containers/sequences/list/list.ops/ |
| splice_pos_list_iter_iter.pass.cpp | 29 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
41 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2));
53 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 3));
66 l1.splice(l1.begin(), l2, next(l2.begin()), l2.end());
86 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end());
106 l1.splice(l1.end(), l2, next(l2.begin()), l2.end())
[all...] |
| /external/libsepol/src/ |
| sidtab.c | 56 cur = cur->next;
74 newnode->next = prev->next;
75 prev->next = newnode;
77 newnode->next = s->htable[hvalue];
100 cur = cur->next;
107 s->htable[hvalue] = cur->next;
109 last->next = cur->next;
129 cur = cur->next;
[all...] |
| /external/mdnsresponder/mDNSShared/ |
| dnsextd.h | 47 struct DNSZone * next; member in struct:DNSZone
64 struct RRTableElem *next; member in struct:RRTableElem
81 struct AnswerListElem *next; member in struct:AnswerListElem
94 struct LLQEntry *next; member in struct:LLQEntry
115 struct EventSource * next; member in struct:EventSource
|
| /external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
| CollectionUtils.java | 31 Object value = (Object)it.next();
44 Object key = it.next();
52 if (!p.evaluate(it.next())) {
62 result.add(t.transform(it.next()));
71 indexes.put(it.next(), new Integer(index++));
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
| encodemb.c | 206 signed char next; member in struct:vp8_token_state
240 int next; local
278 tokens[eob][0].next = 16;
282 next = eob;
295 error0 = tokens[next][0].error;
296 error1 = tokens[next][1].error;
298 rate0 = tokens[next][0].rate;
299 rate1 = tokens[next][1].rate;
302 if (next < 16)
307 mb->token_costs[type][band][pt][tokens[next][0].token]
[all...] |
