| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
| compute_memory_pool.c | 9 * The above copyright notice and this permission notice (including the next
136 for (item = pool->item_list; item; item = item->next) {
166 for (item = pool->item_list; item; item = item->next) {
167 if (item->next) {
169 && item->next->start_in_dw > start_in_dw) {
239 chunk.prev = chunk.next = NULL;
251 struct compute_memory_item *item, *next; local
258 for (item = pool->item_list; item; item = item->next) {
259 COMPUTE_DBG("list: %i %p\n", item->start_in_dw, item->next);
262 for (item = pool->item_list; item; item = next) {
353 struct compute_memory_item *item, *next; local
[all...] |
| /external/mesa3d/src/gallium/drivers/r600/ |
| compute_memory_pool.c | 9 * The above copyright notice and this permission notice (including the next
136 for (item = pool->item_list; item; item = item->next) {
166 for (item = pool->item_list; item; item = item->next) {
167 if (item->next) {
169 && item->next->start_in_dw > start_in_dw) {
239 chunk.prev = chunk.next = NULL;
251 struct compute_memory_item *item, *next; local
258 for (item = pool->item_list; item; item = item->next) {
259 COMPUTE_DBG("list: %i %p\n", item->start_in_dw, item->next);
262 for (item = pool->item_list; item; item = next) {
353 struct compute_memory_item *item, *next; local
[all...] |
| /bionic/libc/upstream-netbsd/libc/include/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
32 (elt)->link.next = (type *)(-1); \
37 (void *)((elt)->link.next) != (void *)(-1))
51 (elt)->link.next = (list).head; \
59 (list).tail->link.next = (elt); \
63 (elt)->link.next = NULL; \
70 if ((elt)->link.next != NULL) \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
77 (elt)->link.prev->link.next = (elt)->link.next; \
[all...] |
| /external/e2fsprogs/e2fsck/ |
| region.c | 25 struct region_el *next; member in struct:region_el
49 struct region_el *r, *next; local
51 for (r = region->allocated; r; r = next) {
52 next = r->next;
61 struct region_el *r, *new_region, *prev, *next; local
77 for (r = region->allocated, prev=NULL; r; prev = r, r = r->next) {
87 if ((next = r->next)) {
88 if (end > next->start
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| ptw32_MCS_lock.c | 165 node->next = 0; /* initially, no successor */
174 pred->next = node;
195 ptw32_mcs_local_node_t *next = local
197 PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */
199 if (0 == next)
214 next = (ptw32_mcs_local_node_t *)
215 PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */
219 ptw32_mcs_flag_set(&next->readyFlag);
234 node->next = 0; /* initially, no successor */
262 new_node->next = 0
[all...] |
| /external/mksh/src/ |
| lalloc.c | 40 ap->next = NULL;
59 while (ap->next != lp)
60 if ((ap = ap->next) == NULL) {
94 pp->next = lp->next;
105 lp->next = ap->next;
106 ap->next = lp;
119 pp->next = lp->next;
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| AbstractCollection.java | 76 if (add(it.next())) {
102 it.next();
130 if (object.equals(it.next())) {
136 if (it.next() == null) {
167 if (!contains(it.next())) {
228 if (object.equals(it.next())) {
235 if (it.next() == null) {
277 if (collection.contains(it.next())) {
318 if (!collection.contains(it.next())) {
372 Object next = it.next() local
[all...] |
| LinkedList.java | 51 Link<ET> previous, next; field in class:LinkedList.Link
56 next = n;
77 link = link.next;
91 Link<ET> next = link.next; local
92 Link<ET> newLink = new Link<ET>(object, link, next);
93 link.next = newLink;
94 next.previous = newLink;
107 return link.next != list.voidLink;
114 public ET next() { method in class:LinkedList.LinkIterator
116 LinkedList.Link<ET> next = link.next; local
151 Link<ET> next = lastLink.next; local
208 public ET next() { method in class:LinkedList.ReverseLinkIterator
224 Link<ET> next = link.previous; local
363 Link<E> next = previous.next; local
653 Link<E> next = link.next; local
682 Link<E> next = first.next; local
[all...] |
| /system/core/libsparse/ |
| backed_block.c | 46 struct backed_block *next; member in struct:backed_block
62 return bb->next;
135 struct backed_block *next = bb->next; local
137 bb = next;
155 for (end = start; end && end->next; end = end->next)
166 from->data_blocks = end->next;
168 for (bb = from->data_blocks; bb; bb = bb->next) {
169 if (bb->next == start)
[all...] |
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| generators-iteration.js | 41 var result = iter.next();
58 iter.next());
60 assertThrows(function() { iter.next(); }, Error);
67 iter.next(send_val));
69 assertThrows(function() { iter.next(send_val); }, Error);
77 iter.next());
81 assertThrows(function () { iter.next(); }, Error);
362 function next() {
365 return { next: next }
[all...] |
| /external/javassist/src/main/javassist/ |
| CtMember.java | 23 CtMember next; // for internal use field in class:CtMember
54 fieldTail.next = this;
65 method.next = methodTail.next;
66 methodTail.next = method;
79 cons.next = consTail.next;
80 consTail.next = cons;
88 field.next = this; // or fieldTail.next
131 final CtMember next() { return next; } method in class:CtMember
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| move.pass.cpp | 64 assert(*next(m.begin(), 0) == 1);
65 assert(*next(m.begin(), 1) == 1);
66 assert(*next(m.begin(), 2) == 1);
67 assert(*next(m.begin(), 3) == 2);
68 assert(*next(m.begin(), 4) == 2);
69 assert(*next(m.begin(), 5) == 2);
70 assert(*next(m.begin(), 6) == 3);
71 assert(*next(m.begin(), 7) == 3);
72 assert(*next(m.begin(), 8) == 3);
103 assert(*next(m.begin(), 0) == 1)
[all...] |
| /external/chromium/net/disk_cache/ |
| mem_rankings.cc | 30 MemEntryImpl* next = node->next(); local
33 head_ = next;
39 prev->set_next(next);
41 if (next)
42 next->set_prev(prev);
57 return node->next();
|
| /external/chromium_org/net/disk_cache/ |
| mem_rankings.cc | 30 MemEntryImpl* next = node->next(); local
33 head_ = next;
39 prev->set_next(next);
41 if (next)
42 next->set_prev(prev);
57 return node->next();
|
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLInputStream.h | 36 // [--current--][--next--][--next--] ... [--next--]
93 void splitInto(SegmentedString& next)
95 next = m_first;
100 // the m_last string, |next| is now the last one.
101 m_last = &next;
105 void mergeFrom(SegmentedString& next)
107 m_first.append(next);
108 if (m_last == &next) {
[all...] |
| /external/chromium_org/third_party/freetype/src/cache/ |
| ftcmru.c | 52 cnode = cnode->next;
59 last->next = node;
60 node->next = first;
65 node->next = node;
83 FTC_MruNode prev, next, last; local
93 cnode = cnode->next;
103 next = node->next;
105 prev->next = next;
126 FTC_MruNode prev, next; local
331 FTC_MruNode first, node, next; local
[all...] |
| /external/freetype/src/cache/ |
| ftcmru.c | 52 cnode = cnode->next;
59 last->next = node;
60 node->next = first;
65 node->next = node;
83 FTC_MruNode prev, next, last; local
93 cnode = cnode->next;
103 next = node->next;
105 prev->next = next;
126 FTC_MruNode prev, next; local
331 FTC_MruNode first, node, next; local
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| leak-cases.c | 42 struct _Node* next; member in struct:_Node
48 Node* mk(Node* next)
53 x->next = next;
82 (p6->next)++; // 16/1 possibly lost
88 (p8->next)++; // 16/1 possibly lost
92 (p9->next)++; // 32(16d,16i)/1 definitely lost (double count!)
|
| /external/smack/src/org/xbill/DNS/ |
| NXTRecord.java | 9 * Next name - this record contains the following name in an ordered list
21 private Name next; field in class:NXTRecord
33 * @param next The following name in an ordered list of the zone
37 NXTRecord(Name name, int dclass, long ttl, Name next, BitSet bitmap) {
39 this.next = checkName("next", next);
45 next = new Name(in);
58 next = st.getName(origin);
76 sb.append(next);
[all...] |
| /libcore/luni/src/main/java/libcore/util/ |
| CollectionUtils.java | 43 private T next; local
47 while (next == null && delegate.hasNext()) {
48 next = delegate.next().get();
49 if (trim && next == null) {
57 return next != null;
60 @Override public T next() { method
64 T result = next;
66 next = null;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/ |
| equal_range.pass.cpp | 47 assert(r.second == next(m.begin(), 3));
49 assert(r.first == next(m.begin(), 3));
50 assert(r.second == next(m.begin(), 3));
52 assert(r.first == next(m.begin(), 3));
53 assert(r.second == next(m.begin(), 6));
55 assert(r.first == next(m.begin(), 6));
56 assert(r.second == next(m.begin(), 6));
58 assert(r.first == next(m.begin(), 6));
59 assert(r.second == next(m.begin(), 9));
84 assert(r.second == next(m.begin(), 3))
[all...] |
| /external/srec/seti/sltsEngine/src/ |
| linklist_impl.c | 58 n->next = n->prev = 0;
74 (g_LNodeAllocArray[i].node).next = NULL;
134 (list->head)->next = NULL;
152 newnode->next = NULL;
153 (list->curr)->next = newnode;
162 newnode->next = list->head;
175 newnode->next = (list->curr)->next;
176 (list->curr)->next = newnode;
177 (newnode->next)->prev = newnode
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.cpp | 29 for (Item *next, *item = head.next; item != &head; item = next) {
30 next = item->next;
33 head.next = head.prev = &head;
43 pos = pos->next;
56 pos = pos->next;
67 ins->next = pos->next;
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.cpp | 29 for (Item *next, *item = head.next; item != &head; item = next) {
30 next = item->next;
33 head.next = head.prev = &head;
43 pos = pos->next;
56 pos = pos->next;
67 ins->next = pos->next;
[all...] |
| /hardware/ti/wlan/lib/ |
| shlist.c | 13 listPtr->next = listPtr;
21 for(item=head->next;( item != head );item=item->next)
44 if( head->next != head )
45 return( head->next );
54 for(i=0,item=head->next;( (i < num) && (item != head) );i++,item=item->next);
64 if( item->next != head )
65 return( item->next );
85 (item->prev)->next = item->next
[all...] |
