| /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;
|
| /external/srec/srec/crec/ |
| astar_pphash.c | 56 while (parp1->next && parp2->next)
63 parp1 = parp1->next;
64 parp2 = parp2->next;
66 diff = (int)parp1->next - (int)parp2->next;
84 while ((parp = parp->next) != NULL)
|
| /ndk/sources/third_party/googletest/googletest/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/WebKit/Source/core/dom/ |
| ElementTraversal.h | 40 Element* next(const Node&);
41 Element* next(const Node&, const Node* stayWithin);
42 Element* next(const ContainerNode&);
43 Element* next(const ContainerNode&, const Node* stayWithin);
45 // Like next, but skips children.
74 Node* node = NodeTraversal::next(current);
79 inline Element* next(const ContainerNode& current) { return traverseNextElementTemplate(current); } function in namespace:WebCore::ElementTraversal
80 inline Element* next(const Node& current) { return traverseNextElementTemplate(current); } function in namespace:WebCore::ElementTraversal
85 Node* node = NodeTraversal::next(current, stayWithin);
90 inline Element* next(const ContainerNode& current, const Node* stayWithin) { return traverseNextElementTemplate(current (…) function in namespace:WebCore::ElementTraversal
91 inline Element* next(const Node& current, const Node* stayWithin) { return traverseNextElementTemplate(current, stayWithin); } function in namespace:WebCore::ElementTraversal
[all...] |
| /system/core/toolbox/ |
| readtty.c | 29 char *next; local
32 next = strchr(map[i].chars, current);
33 if(next && next[1])
34 return next[1];
44 char *next; local
47 next = strchr(map[i].chars+1, current);
48 if(next && next[-1])
49 return next[-1]
[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/libaddressinput/chromium/cpp/src/ |
| address_field_util.cc | 74 next = format.begin() + 1;
75 current != format.end() && next != format.end();
76 ++current, ++next) {
77 if (IsTokenPrefix(*current) && IsToken(*next)) {
78 fields->push_back(ParseToken(*next));
|
| /external/e2fsprogs/lib/ext2fs/ |
| io_manager.c | 25 char *next, *ptr, *options, *arg; local
42 next = strchr(ptr, '&');
43 if (next)
44 *next++ = 0;
53 ptr = next;
|
| /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
|
| /hardware/ril/libril/ |
| ril_event.cpp | 82 dlog(" next = %x", (unsigned int)ev->next);
111 list->next = list;
118 ev->next = list;
120 ev->prev->next = ev;
130 ev->next->prev = ev->prev;
131 ev->prev->next = ev->next;
132 ev->next = NULL;
164 struct ril_event * tev = timer_list.next;
165 struct ril_event * next; local
208 struct ril_event * next = ev->next; local
[all...] |
| /hardware/ti/omap4xxx/ |
| mapinfo.c | 43 mi->next = 0;
59 mi->next = milist;
74 mi = mi->next;
86 mi = mi->next;
103 mi = mi->next;
|
| /ndk/sources/cxx-stl/llvm-libc++/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...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| PathMatcher.java | 46 Node next = current.getChild(segments[i]); local
47 if (next == null) {
48 next = current.getChild("*");
49 if (next != null) {
55 current = next;
|
| /system/core/libcutils/ |
| hashmap.c | 31 Entry* next; member in struct:Entry
117 Entry* next = entry->next; local
119 entry->next = newBuckets[index];
121 entry = next;
145 Entry* next = entry->next; local
147 entry = next;
174 entry->next = NULL;
216 // Move to next entry
313 Entry *next = entry->next; local
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| encodemb.c | 206 signed char next; member in struct:vp8_token_state
240 int next; local
285 tokens[eob][0].next = 16;
289 next = eob;
302 error0 = tokens[next][0].error;
303 error1 = tokens[next][1].error;
305 rate0 = tokens[next][0].rate;
306 rate1 = tokens[next][1].rate;
309 if (next < 16)
314 mb->token_costs[type][band][pt][tokens[next][0].token]
[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/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
78 AllocList *next[kMaxLevel]; // actually has levels elements. member in struct:low_level_alloc_internal::AllocList
121 // level<kMaxLevel and next[level-1] will fit in the node.
127 int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *);
143 for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
160 e->next[i] = prev[i]->next[i];
161 prev[i]->next[i] = e;
172 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++)
363 AllocList *next = prev->next[i]; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
78 AllocList *next[kMaxLevel]; // actually has levels elements. member in struct:low_level_alloc_internal::AllocList
121 // level<kMaxLevel and next[level-1] will fit in the node.
127 int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *);
143 for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
160 e->next[i] = prev[i]->next[i];
161 prev[i]->next[i] = e;
172 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++)
363 AllocList *next = prev->next[i]; local
[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/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/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...] |
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| AtomicIntegerFieldUpdater.java | 149 int next = current + 1; local
150 if (compareAndSet(obj, current, next))
165 int next = current - 1; local
166 if (compareAndSet(obj, current, next))
182 int next = current + delta; local
183 if (compareAndSet(obj, current, next))
198 int next = current + 1; local
199 if (compareAndSet(obj, current, next))
200 return next;
214 int next = current - 1 local
231 int next = current + delta; local
[all...] |
| AtomicLongFieldUpdater.java | 152 long next = current + 1; local
153 if (compareAndSet(obj, current, next))
168 long next = current - 1; local
169 if (compareAndSet(obj, current, next))
185 long next = current + delta; local
186 if (compareAndSet(obj, current, next))
201 long next = current + 1; local
202 if (compareAndSet(obj, current, next))
203 return next;
217 long next = current - 1 local
234 long next = current + delta; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.h | 91 virtual void next() = 0;
106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
112 (__item)->next = (__item); \
118 (__item)->next = (__list); \
120 (__list)->prev->next = (__item); \
127 (__item)->next = (__list)->next; \
155 Item *next; member in class:nv50_ir::DLList::Item
194 virtual void next() { if (!end()) pos = rev ? pos->prev : pos->next; } function in class:nv50_ir::DLList::Iterator
391 void next() { if (pos < size) { ++pos; nextValid(); } } function in class:nv50_ir::ArrayList
[all...] |
