| /external/chromium_org/v8/src/ |
| zone.cc | 45 void Initialize(Segment* next, int size) {
46 next_ = next;
50 Segment* next() const { return next_; } function in class:v8::internal::Segment
99 Segment* next = current->next(); local
112 current = next;
142 ASSERT(segment_head_ == NULL || segment_head_->next() == NULL);
|
| hydrogen-gvn.cc | 68 int next; // Index in the array of the next list element. member in struct:v8::internal::HValueMap::HValueMapListElement
179 int next; local
180 for (int current = array_[i].next; current != kNil; current = next) {
181 next = lists_[current].next;
186 lists_[current].next = free_list_head_;
190 lists_[current].next = kept;
195 array_[i].next = kept
223 int next = array_[pos].next; local
263 int next = lists_[current].next; local
551 HInstruction* next = instr->next(); local
829 GvnBasicBlockState* next = local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| finddev.c | 39 struct dir_list *next; member in struct:dir_list
58 dp->next = *list;
67 struct dir_list *dp, *next; local
69 for (dp = *list; dp; dp = next) {
70 next = dp->next;
140 list = list->next;
151 * the next level of subdirectories. (breadth-first)
|
| /external/elfutils/libdwfl/ |
| dwfl_module.c | 125 for (Dwfl_Module *m = dwfl->modulelist; m != NULL; m = m->next)
143 mod->next = *tailp;
155 for (Dwfl_Module *m = *prevp; m != NULL; m = *(prevp = &m->next))
162 *prevp = m->next;
168 tailp = &m->next;
217 *tailp = m->next;
221 tailp = &m->next;
|
| /external/guava/guava/src/com/google/common/hash/ |
| Hashing.java | 192 int next; local
200 next = (int) ((candidate + 1) * inv);
202 if (next >= 0 && next < buckets) {
203 candidate = next;
223 int bits = iterator.next().bits();
249 byte[] resultBytes = new byte[iterator.next().bits() / 8];
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractIteratorTest.java | 58 assertEquals(0, (int) iter.next());
64 assertEquals(1, (int) iter.next());
72 iter.next();
104 assertEquals(0, (int) iter.next());
107 assertEquals(1, (int) iter.next());
122 iter.next();
123 fail("next() should throw NoSuchElementException as usual");
129 fail("peek() should still throw NoSuchElementException after next()");
235 assertEquals(0, (int) iter.next());
259 // hasNext/next/peek), but we'll cop out for now, knowing that peek() an
[all...] |
| /external/iproute2/ip/ |
| ipmroute.c | 130 char *next = NULL; local
137 next = strchr(p, ' ');
138 if (next) {
139 *next = 0;
140 next++;
143 p = next;
146 p = next;
|
| /external/iproute2/misc/ |
| ifstat.c | 56 struct ifstat_ent *next; member in struct:ifstat_ent
113 n->next = kern_db;
143 db = db->next;
144 n->next = kern_db;
157 char *next; local
176 if (!(next = strchr(p, ' ')))
178 *next++ = 0;
181 p = next;
185 if (!(next = strchr(p, ' ')))
187 *next++ = 0
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_offset.c | 15 * next paragraph) shall be included in all copies or substantial portions
106 stage->next->tri( stage->next, header );
146 stage->next->flush( stage->next, flags );
152 stage->next->reset_stipple_counter( stage->next );
174 offset->stage.next = NULL;
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
204 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = this;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next table *
[all...] |
| /external/v8/src/ |
| handles-inl.h | 75 prev_next_ = current->next;
86 prev_next_ = current->next;
100 current->next = prev_next_;
124 prev_next_ = current->next;
137 internal::Object** cur = current->next;
139 // Update the current next field, set the value in the created
142 current->next = cur + 1;
157 current->limit = current->next;
|
| zone.cc | 45 void Initialize(Segment* next, int size) {
46 next_ = next;
50 Segment* next() const { return next_; } function in class:v8::internal::Segment
116 keep = keep->next();
123 Segment* next = current->next(); local
135 current = next;
|
| /external/zlib/src/contrib/infback9/ |
| inftree9.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
145 filled is at next and has curr index bits. The code being used is huff
197 next = *table; /* current table to fill in */
231 next[(huff >> drop) + fill] = this;
245 /* go to next symbol, update count, len */
259 next += 1U << curr;
261 /* determine length of next table */
281 (*table)[low].val = (unsigned short)(next - *table)
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| TreeMapExtendTest.java | [all...] |
| /dalvik/vm/compiler/codegen/mips/ |
| RallocUtil.cpp | 201 int next = *nextTemp; local
203 if (next >= numTemps)
204 next = 0;
205 if (!p[next].inUse && !p[next].live) {
206 dvmCompilerClobber(cUnit, p[next].reg);
207 p[next].inUse = true;
208 p[next].pair = false;
209 *nextTemp = next + 1;
210 return p[next].reg
241 int next = start; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glx/apple/ |
| apple_glx_drawable.c | 79 for (i = drawables_list; i; i = i->next) {
151 d->previous->next = d->next;
158 drawables_list = d->next;
161 if (d->next)
162 d->next->previous = d->previous;
297 d->next = NULL;
306 agd->next = drawables_list;
381 dnext = d->next;
433 for (d = drawables_list; d; d = d->next)
[all...] |
| /external/chromium_org/v8/src/third_party/vtune/ |
| ittnotify_config.h | 338 struct ___itt_thread_info* next; member in struct:___itt_thread_info
377 struct ___itt_global* next; member in struct:___itt_global
396 h->next = NULL; \
400 h_tail->next = h; \
413 h->next = NULL; \
417 h_tail->next = h; \
429 h->next = NULL; \
433 h_tail->next = h; \
445 h->next = NULL; \
449 h_tail->next = h;
[all...] |
| /external/dnsmasq/src/ |
| dbus.c | 61 struct watch *next; member in struct:watch
69 for (w = daemon->watches; w; w = w->next)
77 w->next = daemon->watches;
88 for (up = &(daemon->watches), w = daemon->watches; w; w = w->next)
91 *up = w->next;
95 up = &(w->next);
110 for (serv = daemon->servers; serv; serv = serv->next)
184 for (serv = daemon->servers; serv; serv = serv->next)
217 serv->next = daemon->servers;
248 tmp = serv->next;
[all...] |
| /external/mesa3d/src/glx/apple/ |
| apple_glx_drawable.c | 79 for (i = drawables_list; i; i = i->next) {
151 d->previous->next = d->next;
158 drawables_list = d->next;
161 if (d->next)
162 d->next->previous = d->previous;
297 d->next = NULL;
306 agd->next = drawables_list;
381 dnext = d->next;
433 for (d = drawables_list; d; d = d->next)
[all...] |
| /external/valgrind/main/callgrind/ |
| bb.c | 70 BB **new_table, *curr, *next; local
87 next = curr->next;
91 curr->next = new_table[new_idx];
93 if (curr->next) {
95 if (curr->next->next)
99 curr = next;
155 bb->next = bbs.table[idx];
189 bb = bb->next;
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| AbstractMap.java | 193 if (key.equals(it.next().getKey())) {
199 if (it.next().getKey() == null) {
217 if (value.equals(it.next().getValue())) {
223 if (it.next().getValue() == null) {
285 Map.Entry<K, V> entry = it.next();
292 Map.Entry<K, V> entry = it.next();
311 result += it.next().hashCode();
350 public K next() {
351 return setIterator.next().getKey();
395 Map.Entry<K, V> entry = it.next();
[all...] |
| /external/chromium_org/third_party/zlib/ |
| gzread.c | 66 /* Get next byte from input, or -1 if end or error. */
67 #define NEXT() ((strm->avail_in == 0 && gz_avail(state) == -1) ? -1 : \
81 val = NEXT();
82 val += (unsigned)NEXT() << 8;
83 val += (unsigned long)NEXT() << 16;
84 ch = NEXT();
97 that the next available input data is the raw deflate stream. If direct
161 if (NEXT() != 8) { /* compression method */
165 flags = NEXT();
170 NEXT(); /* modification time *
[all...] |
| /frameworks/base/tools/aidl/ |
| aidl_language_y.y | 59 while (p && p->next) {
60 p=p->next;
63 p->next = (document_item_type*)$2.document_item;
86 b->document_item.next = NULL;
107 b->document_item.next = NULL;
132 c->document_item.next = NULL;
142 c->document_item.next = NULL;
152 c->document_item.next = NULL;
193 while (p && p->next) {
194 p=p->next;
[all...] |
| /bootable/recovery/minadbd/ |
| transport.c | 31 .next = &transport_list,
86 adisconnect* dis = t->disconnects.next;
90 adisconnect* next = dis->next; local
92 dis = next;
450 t->next->prev = t->prev;
451 t->prev->next = t->next;
500 t->next = &transport_list;
502 t->next->prev = t
[all...] |
| /external/smack/src/org/jivesoftware/smack/util/collections/ |
| AbstractHashedMap.java | 48 protected static final String NO_NEXT_ENTRY = "No next() entry in the iteration";
50 protected static final String REMOVE_INVALID = "remove() can only be called once after next()";
51 protected static final String GETKEY_INVALID = "getKey() can only be called after next() and before remove()";
52 protected static final String GETVALUE_INVALID = "getValue() can only be called after next() and before remove()";
53 protected static final String SETVALUE_INVALID = "setValue() can only be called after next() and before remove()";
197 entry = entry.next;
234 entry = entry.next;
253 entry = entry.next;
263 entry = entry.next;
288 entry = entry.next;
608 HashEntry<K, V> next = entry.next; local
736 public K next() { method in class:AbstractHashedMap.HashMapIterator
848 public HashEntry<K, V> next() { method in class:AbstractHashedMap.EntrySetIterator
927 public K next() { method in class:AbstractHashedMap.KeySetIterator
1000 public V next() { method in class:AbstractHashedMap.ValuesIterator
1018 protected HashEntry<K, V> next; field in class:AbstractHashedMap.HashEntry
1098 protected HashEntry<K, V> next; field in class:AbstractHashedMap.HashIterator
1109 HashEntry<K, V> next = null; local
[all...] |
