| /external/llvm/lib/ExecutionEngine/IntelJITEvents/ |
| ittnotify_config.h | 309 struct ___itt_thread_info* next; member in struct:___itt_thread_info
348 struct ___itt_global* next; member in struct:___itt_global
367 h->next = NULL; \
371 h_tail->next = h; \
384 h->next = NULL; \
388 h_tail->next = h; \
400 h->next = NULL; \
404 h_tail->next = h; \
416 h->next = NULL; \
420 h_tail->next = h;
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_scene.c | 15 * next paragraph) shall be included in all copies or substantial portions
45 struct resource_ref *next; member in struct:resource_ref
79 assert(scene->data.head->next == NULL);
128 bin->tail->next = NULL;
223 for (ref = scene->resources; ref; ref = ref->next) {
248 for (block = list->head->next; block; block = tmp) {
249 tmp = block->next;
253 list->head->next = NULL;
281 bin->tail->next = block;
289 block->next = NULL
[all...] |
| /external/openssl/crypto/ |
| mem_dbg.c | 157 struct app_mem_info_st *next; /* tail of thread's stack */ member in struct:app_mem_info_st
208 if (inf->next != NULL)
210 app_info_free(inf->next);
369 APP_INFO *next=ret->next; local
371 if (next != NULL)
373 next->references++;
374 (void)lh_APP_INFO_insert(amih,next);
387 ret->next = NULL;
388 if (next != NULL
[all...] |
| /external/v8/tools/ |
| consarray.js | 56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null);
72 * Returns the current item, moves to the next one.
74 ConsArray.prototype.next = function() {
77 this.currCell_ = this.currCell_.next;
89 ConsArray.Cell = function(data, next) {
91 this.next = next;
|
| /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...] |
| /libcore/luni/src/main/java/java/util/ |
| Calendar.java | 166 * recomputed until the next call to {@code get()},
197 * as a result, the next larger field is incremented or decremented and the
220 * gives September of the next year. Since {@code DAY_OF_MONTH} cannot be
778 * them all a value of zero. The actual field values will be determined the next
791 * it a value of zero. The actual field value will be determined the next
894 int value, next; local
915 int value, next; local
[all...] |
| /external/chromium_org/third_party/libxml/src/ |
| tree.c | 126 while (ulccur->next != NULL) { \
128 ulccur = ulccur->next; \
758 while (prev->next != NULL) {
759 prev = prev->next;
766 prev->next = cur;
819 xmlNsPtr next; local
828 next = cur->next;
830 cur = next;
905 cur = cur->next;
992 xmlNodePtr next; local
1087 xmlNodePtr next, c = cur->children; local
2012 xmlAttrPtr next; local
3586 xmlNodePtr next; local
4533 xmlNodePtr cur, tmp, next; local
7596 xmlNsMapItemPtr next; member in struct:xmlNsMapItem
[all...] |
| /external/libxml2/ |
| tree.c | 126 while (ulccur->next != NULL) { \
128 ulccur = ulccur->next; \
769 while (prev->next != NULL) {
770 prev = prev->next;
777 prev->next = cur;
830 xmlNsPtr next; local
839 next = cur->next;
841 cur = next;
916 cur = cur->next;
1003 xmlNodePtr next; local
1098 xmlNodePtr next, c = cur->children; local
2023 xmlAttrPtr next; local
3597 xmlNodePtr next; local
4546 xmlNodePtr cur, tmp, next; local
7609 xmlNsMapItemPtr next; member in struct:xmlNsMapItem
[all...] |
| /bionic/libc/bionic/ |
| pthread_debug.cpp | 205 struct MutexInfo* next; member in struct:MutexInfo
243 object->next = 0;
502 HashEntry* next; member in struct:HashEntry
548 HashEntry* next = entry->next; local
549 if (prev != NULL) entry->prev->next = next;
550 if (next != NULL) entry->next->prev = prev;
552 // we are the head of the list. set the head to be next
[all...] |
| /cts/tools/device-setup/TestDeviceSetup/src/android/tests/getinfo/ |
| RootProcessScanner.java | 150 String name = scanner.next();
183 * @param scanner to call next() until the token is found
189 String next = scanner.next(); local
190 if (next.equals(token)) {
218 return scanner.next();
|
| /cts/tools/tradefed-host/tests/src/com/android/cts/tradefed/testtype/ |
| TestPackageXmlParserTest.java | 90 TestIdentifier firstTest = iterator.next();
94 TestIdentifier secondTest = iterator.next();
98 TestIdentifier thirdTest = iterator.next();
113 TestIdentifier firstTest = iterator.next();
117 TestIdentifier thirdTest = iterator.next();
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| FilterExprIteratorSimple.java | 141 * Returns the next node in the set and advances the position of the
145 * @return The next <code>Node</code> in the set being iterated over, or
153 int next; local
157 m_lastFetched = next = m_exprObj.nextNode();
160 m_lastFetched = next = DTM.NULL;
162 // m_lastFetched = next;
163 if (DTM.NULL != next)
166 return next;
|
| OneStepIterator.java | 121 * Get the next node via getFirstAttribute && getNextAttribute.
125 return m_lastFetched = m_iterator.next();
215 int next; local
217 while (DTM.NULL != (next = clone.nextNode()))
274 int next; local
276 while (DTM.NULL != (next = clone.nextNode()))
|
| /external/chromium/net/disk_cache/ |
| eviction.cc | 116 Rankings::ScopedRankingsBlock next(rankings_,
119 while ((header_->num_bytes > target_size || test_mode_) && next.get()) {
121 if (!next->HasData())
123 node.reset(next.release());
124 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
294 Rankings::ScopedRankingsBlock next[kListsToSearch]; local
300 next[i].set_rankings(rankings_);
303 next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i)));
304 if (!empty && NodeIsOldEnough(next[i].get(), i)) {
312 list = SelectListByLength(next);
[all...] |
| /external/chromium_org/components/policy/core/common/ |
| generate_policy_source_unittest.cc | 77 const char** next = kExpectedProperties; local
79 !it.IsAtEnd(); it.Advance(), ++next) {
80 ASSERT_TRUE(*next != NULL);
81 EXPECT_STREQ(*next, it.key());
85 EXPECT_TRUE(*next == NULL);
|
| /external/chromium_org/net/disk_cache/ |
| eviction.cc | 124 Rankings::ScopedRankingsBlock next(
128 while ((header_->num_bytes > target_size || test_mode_) && next.get()) {
130 if (!next->HasData())
132 node.reset(next.release());
133 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
319 Rankings::ScopedRankingsBlock next[kListsToSearch]; local
325 next[i].set_rankings(rankings_);
328 next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i)));
329 if (!empty && NodeIsOldEnough(next[i].get(), i)) {
337 list = SelectListByLength(next);
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/fetch/ |
| RawResource.cpp | 47 while (RawResourceClient* c = w.next())
86 while (RawResourceClient* c = w.next())
98 while (RawResourceClient* c = w.next())
105 while (RawResourceClient* c = w.next())
112 while (RawResourceClient* c = w.next())
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLDialogElement.cpp | 46 Node* next = 0; local
47 for (Node* node = dialog->firstChild(); node; node = next) {
49 next = NodeTraversal::nextSkippingChildren(*node, dialog);
51 next = NodeTraversal::next(*node, dialog);
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
| re.h | 28 struct Range *next; member in struct:Range
35 r->next = NULL;
44 r->next = NULL;
53 ro->next = NULL;
62 ro->next = NULL;
|
| /external/e2fsprogs/debugfs/ |
| icheck.c | 110 goto next;
122 goto next;
128 goto next;
136 goto next;
142 next:
|
| /external/icu4c/common/ |
| uenum.c | 93 if (en->next != NULL) {
94 const char *cstr = en->next(en, &len, status);
162 if (en->next != NULL) {
164 return en->next(en, resultLength, status);
168 return en->next(en, &dummyLength, status);
|
| /external/ipsec-tools/src/racoon/ |
| remoteconf.c | 324 if (sa->next)
325 delisakmpsa(sa->next);
347 new->next = NULL;
349 if (orig->next)
350 new->next=dupetypes(orig->next);
359 if (e->next)
360 deletypes(e->next);
384 struct remoteconf *p, *next; local
386 for (p = TAILQ_FIRST(&rmtree); p; p = next) {
[all...] |
| /external/iptables/extensions/ |
| libip6t_dst.c | 58 char *buffer, *cp, *next, *range; local
65 for (cp = buffer, i = 0; cp && i < IP6T_OPTS_OPTSNR; cp = next, i++)
67 next = strchr(cp, ',');
69 if (next)
70 *next++='\0';
|
| libip6t_hbh.c | 60 char *buffer, *cp, *next, *range; local
66 for (cp=buffer, i=0; cp && i<IP6T_OPTS_OPTSNR; cp=next,i++)
68 next=strchr(cp, ',');
69 if (next) *next++='\0';
|
| /external/kernel-headers/original/asm-x86/ |
| system_32.h | 13 extern struct task_struct * FASTCALL(__switch_to(struct task_struct *prev, struct task_struct *next));
19 #define switch_to(prev,next,last) do { \
33 :"m" (next->thread.esp),"m" (next->thread.eip), \
34 "2" (prev), "d" (next)); \
|
