Searched refs:next (Results 351 - 375 of 3487) sorted by relevance

<<11121314151617181920>>

/external/zlib/src/
H A Dgzread.c155 state->x.next = state->out;
157 memcpy(state->x.next, strm->next_in, strm->avail_in);
167 On return, state->x.have and state->x.next point to the just decompressed
169 the next gzip stream or raw data, once state->x.have is depleted. Returns 0
209 state->x.next = strm->next_out - state->x.have;
242 state->x.next = state->out;
268 state->x.next += n;
331 memcpy(buf, state->x.next, n);
332 state->x.next += n;
403 return *(state->x.next)
[all...]
H A Dinfback.c93 static code *next; local
101 next = fixed;
102 lenfix = next;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
109 distfix = next;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
132 next = strm->next_in; \
143 strm->next_in = next; \
161 have = in(in_desc, &next); \
163 next
258 unsigned char FAR *next; /* next input */ local
[all...]
/external/apache-xml/src/main/java/org/apache/xpath/axes/
H A DDescendantIterator.java161 * Returns the next node in the set and advances the position of the
165 * @return The next <code>Node</code> in the set being iterated over, or
182 int next;
208 next = m_lastFetched = (DTM.NULL == m_lastFetched)
210 : m_traverser.next(m_context, m_lastFetched);
214 next = m_lastFetched = (DTM.NULL == m_lastFetched)
216 : m_traverser.next(m_context, m_lastFetched,
220 if (DTM.NULL != next)
222 if(DTMIterator.FILTER_ACCEPT == acceptNode(next))
230 while (next !
[all...]
H A DMatchPatternIterator.java185 * Get the next node via getNextXXX. Bottlenecked for derived class override.
186 * @return The next node on the axis, or DTM.NULL.
192 : m_traverser.next(m_context, m_lastFetched);
197 * Returns the next node in the set and advances the position of the
200 * @return The next <code>Node</code> in the set being iterated over, or
208 int next;
235 next = getNextNode();
237 if (DTM.NULL != next)
239 if(DTMIterator.FILTER_ACCEPT == acceptNode(next, m_execContext))
247 while (next !
[all...]
/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_sync.cc45 tab_[i].val = tmp->next;
87 for (res = b->ListHead(); res; res = res->next) {
108 for (SyncVar *res = p->val; res; res = res->next) {
123 for (; res; res = res->next) {
129 res->next = p->val;
159 SyncVar **prev = &res->next;
165 *prev = res->next;
168 prev = &res->next;
193 *prev = res->next;
196 prev = &res->next;
[all...]
/external/dnsmasq/src/
H A Dlog.c49 struct log_entry *next; member in struct:log_entry
89 free_entries->next = NULL;
142 entries = tmp->next;
143 tmp->next = free_entries;
207 stop trying until the next call to my_syslog()
232 /* try again on next syslog() call */
318 free_entries = entry->next;
327 entry->next = NULL;
333 for (tmp = entries; tmp->next; tmp = tmp->next);
[all...]
/external/icu4c/test/intltest/
H A Dbytestrietest.cpp227 // with next() and current().
315 trie->next('j');
316 trie->next('a');
317 trie->next('n');
318 // hasUniqueValue() directly after next()
323 trie->next('u');
327 if(trie->next('n')!=USTRINGTRIE_INTERMEDIATE_VALUE || 6!=trie->getValue()) {
336 trie->next('u');
353 trie->next('j');
354 trie->next('
[all...]
/external/ipsec-tools/src/racoon/
H A Dsainfo.c217 struct sainfo *s, *next; local
219 for (s = LIST_FIRST(&sitree); s; s = next) {
220 next = LIST_NEXT(s, chain);
248 struct sainfoalg *a, *next; local
250 for (a = alg; a; a = next) {
251 next = a->next;
263 for (a = *head; a && a->next; a = a->next)
266 a->next
[all...]
H A Dproposal.c116 for (p = *head; p->next; p = p->next)
118 p->next = new;
131 for (p = pp->head; p && p->next; p = p->next)
136 p->next = new;
147 new->next = pp->head;
173 for (tr = pr->head; tr && tr->next; tr = tr->next)
178 tr->next
[all...]
/external/qemu/android/
H A Dboot-properties.c37 struct BootProperty* next; member in struct:BootProperty
50 prop->next = NULL;
65 /* address to store pointer to next new list element */
76 BootProperty *next = NULL; local
78 next = p->next;
80 p = next;
128 _boot_properties_tail = &prop->next;
247 for (; p; p = p->next) {
262 for ( ; p; p = p->next) {
[all...]
/external/qemu/telephony/
H A Dsysdeps_qemu.c54 SysTimer next; member in struct:SysTimerRec_
67 _s_timers0[nn].next = _s_timers0 + (nn+1);
78 _s_free_timers = timer->next;
79 timer->next = NULL;
94 timer->next = _s_free_timers;
159 SysChannel next; member in struct:SysChannelRec_
173 _s_channels0[nn].next = _s_channels0 + (nn+1);
183 _s_free_channels = channel->next;
184 channel->next = NULL;
199 channel->next
[all...]
/external/quake/quake/src/QW/qwfwd/
H A Dqwfwd.c72 struct peer *next; member in struct:peer
199 for (p = peers; p; p = p->next) {
215 for (p = peers; p; p = p->next)
228 p->next = peers;
235 for (p = peers; p; p = p->next)
252 if (!pp && !p->next) {
258 pp->next = p->next;
261 p = pp->next;
264 p = p->next;
[all...]
/external/webkit/Tools/DumpRenderTree/mac/PerlSupport/
H A DDumpRenderTreeSupport_wrapPregenerated.c79 struct swig_type_info *next; member in struct:swig_type_info
124 swig_type_info *tc, *head, *ret, *next; local
141 next = tc->next;
147 next = 0;
159 head->next = tc;
164 if (next) next->prev = head;
165 head->next = next;
[all...]
/external/elfutils/libebl/
H A Deblgstrtab.c75 struct Ebl_GStrent *next; member in struct:Ebl_GStrent
86 struct memoryblock *next; member in struct:memoryblock
149 newmem->next = st->memory;
164 mb = mb->next;
196 newstr->next = NULL;
279 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
295 newstr->next = (*sep)->next;
296 (*sep)->next
[all...]
H A Deblwstrtab.c77 struct Ebl_WStrent *next; member in struct:Ebl_WStrent
87 struct memoryblock *next; member in struct:memoryblock
146 newmem->next = st->memory;
163 mb = mb->next;
198 newstr->next = NULL;
273 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
289 newstr->next = (*sep)->next;
290 (*sep)->next
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DRegularImmutableMap.java73 existing = existing.next();
97 @Nullable LinkedEntry<K, V> next) {
98 return (next == null)
100 : new NonTerminalEntry<K, V>(key, value, next);
104 /** Returns the next entry in the list or {@code null} if none exists. */
105 @Nullable LinkedEntry<K, V> next(); method in interface:RegularImmutableMap.LinkedEntry
108 /** {@code LinkedEntry} implementation that has a next value. */
113 final LinkedEntry<K, V> next; field in class:RegularImmutableMap.NonTerminalEntry
115 NonTerminalEntry(K key, V value, LinkedEntry<K, V> next) { argument
117 this.next
96 newLinkedEntry(K key, V value, @Nullable LinkedEntry<K, V> next) argument
120 @Override public LinkedEntry<K, V> next() { method in class:RegularImmutableMap.NonTerminalEntry
137 @Nullable @Override public LinkedEntry<K, V> next() { method in class:RegularImmutableMap.TerminalEntry
[all...]
/external/openssl/crypto/lhash/
H A Dlhash.c170 nn=n->next;
199 nn->next=NULL;
234 *rn=nn->next;
290 n=a->next;
334 *n1= (*n1)->next;
335 np->next= *n2;
339 n1= &((*n1)->next);
399 while (n1->next != NULL)
400 n1=n1->next;
401 n1->next
[all...]
/external/oprofile/module/x86/
H A Dop_nmi.c310 static int pmc_add_sysctls(ctl_table * next) argument
312 ctl_table * start = next;
318 next->ctl_name = 1;
319 next->procname = names[i];
320 next->mode = 0755;
325 next->child = tab;
334 next++;
340 next = start;
342 kfree(next->child);
343 next
349 pmc_remove_sysctls(ctl_table * next) argument
[all...]
/external/eigen/Eigen/src/OrderingMethods/
H A DAmd.h64 Index cs_tdfs(Index j, Index k, Index *head, const Index *next, Index *post, Index *stack) argument
67 if(!head || !next || !post || !stack) return (-1); /* check inputs */
80 head[p] = next[i]; /* remove i from children of p */
116 Index* next = W + 2*(n+1); local
136 next[i] = -1;
170 next[i] = head[d]; /* put node i in degree list d */
179 if(next[k] != -1) last[next[k]] = -1;
180 head[mindeg] = next[k]; /* remove k from degree list */
235 if(next[
[all...]
/external/qemu/distrib/zlib-1.2.3/
H A Dinfback.c84 static code *next; local
92 next = fixed;
93 lenfix = next;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
100 distfix = next;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
123 next = strm->next_in; \
134 strm->next_in = next; \
152 have = in(in_desc, &next); \
154 next
249 unsigned char FAR *next; /* next input */ local
[all...]
/external/dhcpcd/
H A Dipv6rs.c237 if (ifp->ras == NULL || ifp->ras->next == NULL)
242 ifp->ras = ifp->ras->next;
243 sorted->next = NULL;
244 for (rap = ifp->ras; rap && (ran = rap->next, 1); rap = ran) {
247 rap->next = sorted;
252 for (rat = sorted; rat->next; rat = rat->next) {
253 if (timercmp(&rap->received, &rat->next->received, <)) {
254 rap->next = rat->next;
685 struct timeval now, lt, expire, next; local
[all...]
/external/mksh/src/
H A Djobs.c42 Proc *next; /* next process in pipeline (if any) */ member in struct:proc
78 Job *next; /* next job in list */ member in struct:job
239 for (j = job_list; j != NULL; j = j->next) {
416 p->next = NULL;
430 last_proc->next = p;
582 for (p = j->proc_list; p; p = p->next)
673 for (j = job_list; j; j = j->next)
788 for (p = j->proc_list; p != NULL; p = p->next) {
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DSortedMapInterfaceTest.java86 K prior = iterator.next();
89 K current = iterator.next();
143 K expected = map.keySet().iterator().next();
249 K first = iterator.next();
250 K second = iterator.next();
268 Entry<K, V> firstEntry = iterator.next();
269 Entry<K, V> secondEntry = iterator.next();
270 Entry<K, V> thirdEntry = iterator.next();
290 Entry<K, V> firstEntry = iterator.next();
291 Entry<K, V> secondEntry = iterator.next();
[all...]
/external/libusb_aah/libusb/
H A Dlibusbi.h53 struct list_head *prev, *next; member in struct:list_head
71 for (pos = list_entry((head)->next, type, member); \
73 pos = list_entry(pos->member.next, type, member))
76 for (pos = list_entry((head)->next, type, member), \
77 n = list_entry(pos->member.next, type, member); \
79 pos = n, n = list_entry(n->member.next, type, member))
81 #define list_empty(entry) ((entry)->next == (entry))
85 entry->prev = entry->next = entry;
90 entry->next = head->next;
[all...]
/external/elfutils/libcpu/
H A Di386_parse.y74 struct bitvalue *next;
86 struct argname *next;
93 struct argument *next;
126 struct instruction *next;
356 args = args->next;
360 newp->next = instructions;
392 while (runp->next != NULL)
393 runp = runp->next;
394 runp->next = $3;
407 while (runp->next !
[all...]

Completed in 4266 milliseconds

<<11121314151617181920>>