| /system/core/libcutils/ |
| config_utils.c | 44 for(node = root->first_child; node; node = node->next)
58 root->last_child->next = node;
119 char next; member in struct:__anon63622
130 if(cs->next != 0) {
131 c = cs->next;
132 cs->next = 0;
212 cs->next = *data;
297 cs.next = 0;
326 cur = cur->next;
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| page_heap.cc | 79 ASSERT(ll->next->location == Span::ON_NORMAL_FREELIST);
80 return Carve(ll->next, n);
85 ASSERT(ll->next->location == Span::ON_RETURNED_FREELIST);
86 return Carve(ll->next, n);
115 for (Span* span = large_.normal.next;
117 span = span->next) {
129 for (Span* span = large_.returned.next;
131 span = span->next) {
226 Span* next = GetDescriptor(p+n); local
227 if (next != NULL && next->location == span->location)
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 89 * Nodes next v v v v v
101 * basic idea in these lists is to mark the "next" pointers of
109 * use direct CAS'able next pointers. On deletion, instead of
123 * algorithm of changing the next-pointer of a deleted node so
159 * n's next pointer.
161 * 2. CAS n's next pointer to point to a new marker node.
169 * 3. CAS b's next pointer over both n and its marker.
184 * just (b, n, f), although the next field of a marker is
185 * immutable, and once a next field is CAS'ed to point to a
196 * Index levels are maintained as lists with volatile next fields
368 volatile Node<K,V> next; field in class:ConcurrentSkipListMap.Node
2170 Node<K,V> next; field in class:ConcurrentSkipListMap.Iter
2222 public V next() { method in class:ConcurrentSkipListMap.ValueIterator
2230 public K next() { method in class:ConcurrentSkipListMap.KeyIterator
2238 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.EntryIterator
2975 Node<K,V> next; field in class:ConcurrentSkipListMap.SubMap.SubMapIter
3052 public V next() { method in class:ConcurrentSkipListMap.SubMap.SubMapValueIterator
3060 public K next() { method in class:ConcurrentSkipListMap.SubMap.SubMapKeyIterator
3068 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.SubMap.SubMapEntryIterator
[all...] |
| /external/libsepol/src/ |
| conditional.c | 38 p->next = cur->next;
39 cur->next = top;
41 cur = p->next;
44 cur = cur->next;
55 for (n = cl; n != NULL; n = n->next) {
130 cur_a = cur_a->next;
131 cur_b = cur_b->next;
183 haystack = haystack->next;
198 result->next = p->cond_list
468 cond_av_list_t *cur, *next; local
503 cond_node_t *next, *cur; local
[all...] |
| /external/chromium_org/third_party/libxml/src/ |
| schematron.c | 60 node = node->next; \
86 xmlSchematronTestPtr next; /* the next test in the list */ member in struct:_xmlSchematronTest
102 xmlSchematronRulePtr next; /* the next rule in the list */ member in struct:_xmlSchematronRule
103 xmlSchematronRulePtr patnext;/* the next rule in the pattern list */
119 xmlSchematronPatternPtr next;/* the next pattern in the list */ member in struct:_xmlSchematronPattern
340 ret->next = NULL;
346 while (prev->next != NULL
361 xmlSchematronTestPtr next; local
453 xmlSchematronRulePtr next; local
518 xmlSchematronPatternPtr next; local
[all...] |
| /external/libxml2/ |
| schematron.c | 60 node = node->next; \
86 xmlSchematronTestPtr next; /* the next test in the list */ member in struct:_xmlSchematronTest
102 xmlSchematronRulePtr next; /* the next rule in the list */ member in struct:_xmlSchematronRule
103 xmlSchematronRulePtr patnext;/* the next rule in the pattern list */
119 xmlSchematronPatternPtr next;/* the next pattern in the list */ member in struct:_xmlSchematronPattern
340 ret->next = NULL;
346 while (prev->next != NULL
361 xmlSchematronTestPtr next; local
453 xmlSchematronRulePtr next; local
518 xmlSchematronPatternPtr next; local
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkRegion_rects.cpp | 32 VEdge* next = this;
35 prev->fPrev->fNext = next;
36 next->fPrev = prev->fPrev;
38 // insert prev after next
39 prev->fNext = next->fNext;
40 next->fNext->fPrev = prev;
41 next->fNext = prev;
42 prev->fPrev = next;
269 VEdge* next = edge->fNext;
273 edge = next;
[all...] |
| /external/skia/src/core/ |
| SkRegion_rects.cpp | 32 VEdge* next = this;
35 prev->fPrev->fNext = next;
36 next->fPrev = prev->fPrev;
38 // insert prev after next
39 prev->fNext = next->fNext;
40 next->fNext->fPrev = prev;
41 next->fNext = prev;
42 prev->fPrev = next;
269 VEdge* next = edge->fNext;
273 edge = next;
[all...] |
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| iteration-semantics.js | 45 function next() {
50 return { next: next, n: 0 }
55 function next() {
58 return { next: next }
145 function next() {
146 if (n-- == 0) delete this.next;
147 return iter.next();
149 return { next: next
[all...] |
| /external/elfutils/src/ |
| ld.c | 225 struct file_list *next; member in struct:file_list
448 while ((runp = runp->next) != h->last);
737 newp->next = NULL;
847 file which is named next. Do this by remembering a pointer to
848 the pointer which will point to the next object. */
934 runp = first = ld_state.needed->next;
938 struct usedfiles *next = runp->next; local
946 runp = next;
1072 input_file_list = input_file_list->next;
[all...] |
| /external/chromium/third_party/libevent/ |
| evrpc.c | 124 TAILQ_INSERT_TAIL(head, hook, next);
133 TAILQ_FOREACH(hook, head, next) {
135 TAILQ_REMOVE(head, hook, next);
172 TAILQ_FOREACH(hook, head, next) {
217 TAILQ_INSERT_TAIL(&base->registered_rpcs, rpc, next);
236 TAILQ_FOREACH(rpc, &base->registered_rpcs, next) {
244 TAILQ_REMOVE(&base->registered_rpcs, rpc, next);
416 TAILQ_REMOVE(&pool->requests, request, next);
422 TAILQ_REMOVE(&pool->connections, connection, next);
446 TAILQ_INSERT_TAIL(&pool->connections, connection, next);
[all...] |
| /external/chromium_org/third_party/libevent/ |
| evrpc.c | 124 TAILQ_INSERT_TAIL(head, hook, next);
133 TAILQ_FOREACH(hook, head, next) {
135 TAILQ_REMOVE(head, hook, next);
172 TAILQ_FOREACH(hook, head, next) {
217 TAILQ_INSERT_TAIL(&base->registered_rpcs, rpc, next);
236 TAILQ_FOREACH(rpc, &base->registered_rpcs, next) {
244 TAILQ_REMOVE(&base->registered_rpcs, rpc, next);
416 TAILQ_REMOVE(&pool->requests, request, next);
422 TAILQ_REMOVE(&pool->connections, connection, next);
446 TAILQ_INSERT_TAIL(&pool->connections, connection, next);
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/ |
| svga_screen_cache.c | 99 struct list_head *curr, *next; local
109 curr = cache->bucket[bucket].next;
110 next = curr->next;
144 curr = next;
145 next = curr->next;
251 cache->empty.next, head);
303 struct list_head *curr, *next; local
308 curr = cache->validated.next;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ralloc.c | 11 * The above copyright notice and this permission notice (including the next
66 struct ralloc_header *next; member in struct:ralloc_header
92 info->next = parent->child;
95 if (info->next != NULL)
96 info->next->prev = info;
148 info->prev->next = info;
150 if (info->next != NULL)
151 info->next->prev = info;
155 for (child = info->child; child != NULL; child = child->next)
217 info->parent->child = info->next;
[all...] |
| /external/iproute2/tc/ |
| m_ematch.c | 136 for (e = ematch_list; e; e = e->next) {
157 e->next = ematch_list;
178 for (t = tree; t; t = t->next) {
217 if (e->parse_eopt(n, &hdr, t->args->next) < 0)
236 for (t = head; t->next; t = t->next);
237 t->next = tree->child;
244 tree = tree->next;
247 for (i = 0, t = head; t; t = t->next, i++)
250 for (t = head; t; t = t->next)
[all...] |
| /external/libppp/src/ |
| log.c | 91 prompt->next = promptlist;
110 for (p = promptlist; p; p = p->next)
129 for (p = &promptlist; *p; p = &(*p)->next)
131 *p = prompt->next;
132 prompt->next = NULL;
148 pn = p->next;
151 pl->next = p->next;
153 promptlist = p->next;
154 p->next = NULL
[all...] |
| /external/mesa3d/src/gallium/drivers/svga/ |
| svga_screen_cache.c | 99 struct list_head *curr, *next; local
109 curr = cache->bucket[bucket].next;
110 next = curr->next;
144 curr = next;
145 next = curr->next;
251 cache->empty.next, head);
303 struct list_head *curr, *next; local
308 curr = cache->validated.next;
[all...] |
| /external/mesa3d/src/glsl/ |
| ralloc.c | 11 * The above copyright notice and this permission notice (including the next
66 struct ralloc_header *next; member in struct:ralloc_header
92 info->next = parent->child;
95 if (info->next != NULL)
96 info->next->prev = info;
148 info->prev->next = info;
150 if (info->next != NULL)
151 info->next->prev = info;
155 for (child = info->child; child != NULL; child = child->next)
217 info->parent->child = info->next;
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SVGCSSParser.cpp | 99 m_valueList->next();
180 m_valueList->next();
195 if (m_valueList->next()) {
207 m_valueList->next();
225 m_valueList->next();
236 m_valueList->next();
276 m_valueList->next();
322 m_valueList->next();
344 value = m_valueList->next();
346 value = m_valueList->next();
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| skiplist.h | 19 // (2) The contents of a Node except for the next/prev pointers are
25 // ... prev vs. next pointer ordering ...
69 // Advances to the next position.
71 void Next();
151 Node* Next(int n) {
205 inline void SkipList<Key,Comparator>::Iterator::Next() {
207 node_ = node_->Next(0);
228 node_ = list_->head_->Next(0);
244 while (height < kMaxHeight && ((rnd_.Next() % kBranching) == 0)) {
264 Node* next = x->Next(level) local
287 Node* next = x->Next(level); local
307 Node* next = x->Next(level); local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/egl/x11/ |
| x11_screen.c | 400 __GLcontextModes **next; local
403 next = &base;
405 *next = (__GLcontextModes *) CALLOC(1, size);
406 if (*next == NULL) {
411 next = &((*next)->next);
424 __GLcontextModes *next = modes->next; local
426 modes = next;
[all...] |
| /external/chromium_org/tools/gn/ |
| file_template.cc | 266 size_t next = str.find("{{", cur); local
269 if (next == std::string::npos) {
273 } else if (next > cur) {
275 Subrange(Subrange::LITERAL, str.substr(cur, next - cur)));
279 if (str.compare(next, arraysize(kSource) - 1, kSource) == 0) {
283 cur = next + arraysize(kSource) - 1;
284 } else if (str.compare(next, arraysize(kSourceNamePart) - 1,
289 cur = next + arraysize(kSourceNamePart) - 1;
290 } else if (str.compare(next, arraysize(kSourceFilePart) - 1,
295 cur = next + arraysize(kSourceFilePart) - 1
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| AmbiVector.h | 102 Index next; member in struct:Eigen::internal::AmbiVector::ListEl
199 llElements[0].next = -1;
208 el.next = m_llStart;
216 Index nextel = llElements[m_llCurrent].next;
221 nextel = llElements[nextel].next;
241 el.next = llElements[m_llCurrent].next;
242 llElements[m_llCurrent].next = m_llSize;
267 elid = llElements[elid].next;
308 m_currentEl = llElements[m_currentEl].next;
[all...] |
| /external/mesa3d/src/gallium/state_trackers/egl/x11/ |
| x11_screen.c | 400 __GLcontextModes **next; local
403 next = &base;
405 *next = (__GLcontextModes *) CALLOC(1, size);
406 if (*next == NULL) {
411 next = &((*next)->next);
424 __GLcontextModes *next = modes->next; local
426 modes = next;
[all...] |
| /external/zlib/src/examples/ |
| gzjoin.c | 81 unsigned left; /* bytes remaining at next */
82 unsigned char *next; /* next byte to read */ member in struct:__anon31738
114 in->next = in->buf;
129 in->next = in->buf;
141 in->left ? (in->left--, *(in->next)++) : \
166 in->next += skip;
198 in->next += skip;
261 strm->next_in = in->next;
312 start = in->next;
[all...] |
