| /external/zlib/src/ |
| infback.c | 93 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 = Z_NULL;
258 z_const unsigned char FAR *next; \/* next input *\/ local
[all...] |
| /external/dhcpcd/ |
| ipv6rs.c | 237 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...] |
| control.c | 57 for (l = fds; l != NULL; l = l->next) {
62 fds = l->next;
64 last->next = l->next;
114 l->next = fds;
167 ll = l->next;
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_encodemb.c | 78 int next; member in struct:vp9_token_state
129 int rc, x, next, i; local
156 tokens[eob][0].next = default_eob;
160 next = eob;
173 error0 = tokens[next][0].error;
174 error1 = tokens[next][1].error;
176 rate0 = tokens[next][0].rate;
177 rate1 = tokens[next][1].rate;
180 if (next < default_eob) {
185 [tokens[next][0].token]
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| LinkedHashMapTest.java | 225 Map.Entry m = (Map.Entry) i.next();
242 s1.remove(m2.entrySet().iterator().next());
243 assertEquals("jumbo", s1.iterator().next().getKey());
260 assertNull("Failed with null key", m.keySet().iterator().next());
267 Integer remove1 = (Integer) it.next();
270 Integer remove2 = (Integer) it.next();
276 assertTrue("Wrong result", it.next().equals(list.get(0)));
278 assertTrue("Wrong contents", map.keySet().iterator().next().equals(
285 Integer remove3 = (Integer) it2.next();
286 Integer next; local
[all...] |
| /system/extras/ext4_utils/ |
| allocate.c | 42 struct region *next; member in struct:region
66 struct xattr_list_element *next; member in struct:xattr_list_element
86 for (element = aux_info.xattrs; element != NULL; element = element->next) {
98 element->next = aux_info.xattrs;
105 reg->prev->next = reg->next;
107 if (reg->next)
108 reg->next->prev = reg->prev;
111 list->first = reg->next;
116 reg->next = NULL
627 struct region *next; local
800 struct region *next = reg->next; local
807 struct region *next = reg->next; local
[all...] |
| /external/mksh/src/ |
| jobs.c | 42 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/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen_unittest.cc | 99 SANDBOX_ASSERT(insn0->next == NULL);
109 SANDBOX_ASSERT(insn2->next == NULL);
125 SANDBOX_ASSERT(insn0->next == insn2);
132 SANDBOX_ASSERT(insn5->next == insn4);
199 SANDBOX_ASSERT(insn->next == NULL);
206 SANDBOX_ASSERT(insn->next != NULL);
207 insn = insn->next;
244 // either a jump or a return instruction. It can also end, if the next
264 branch_targets.find(insn->next) !=
339 // For "normal" instructions, just follow to the next basic block
[all...] |
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_interface_ann.cc | 69 ExpectRace *next; member in struct:__tsan::ExpectRace
95 ExpectRace *race = list->next;
96 for (; race != list; race = race->next) {
117 race->next = list->next;
118 race->next->prev = race;
119 list->next = race;
123 for (ExpectRace *race = list->next; race != list; race = race->next) {
145 list->next = list
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SortedMapInterfaceTest.java | 86 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...] |
| /system/core/adb/ |
| usb_libusb.c | 46 usb_handle *next; member in struct:usb_handle
64 .next = &handle_list,
213 h->next->prev = h->prev;
214 h->prev->next = h->next;
216 h->next = NULL;
237 h->next->prev = h->prev;
238 h->prev->next = h->next;
240 h->next = NULL
[all...] |
| /external/ipsec-tools/src/racoon/ |
| proposal.c | 116 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 = new
[all...] |
| /external/elfutils/libcpu/ |
| i386_parse.y | 74 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 != NULL
[all...] |
| /bionic/libc/stdio/ |
| findfp.c | 91 g->next = NULL;
117 for (g = &__sglue; g != NULL; g = g->next) {
128 lastglue->next = g;
162 for (g = &__sglue; (n -= g->niobs) > 0 && g->next; g = g->next)
166 lastglue->next = g;
|
| /external/chromium_org/ppapi/examples/2d/ |
| graphics_2d_example.c | 37 struct InstanceInfo* next; member in struct:InstanceInfo
107 cur = cur->next;
123 info->next = all_instances;
136 *prev_ptr = cur->next;
140 prev_ptr = &cur->next;
141 cur = cur->next;
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| tstnrapi.cpp | 27 if(norm.next()!=0xe4) {
28 dataerrln("error in Normalizer(CharacterIterator).next()");
33 if(copy.next()!=0xac00) {
34 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).next()");
46 if(clone->next()!=0x4e3d) {
47 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next()");
51 errln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next().hashCode()==copy.hashCode()");
103 if(copy.next()!=0x308 || copy.next()!=0x1100) {
135 if(norm.first()!=0x61 || norm.next()!=0x308 || norm.last()!=0x2f800)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/d3d1x/dxgi/src/ |
| dxgi_loader.cpp | 75 const char *cur, *next; local
80 next = strchr(cur, ':');
81 len = (next) ? next - cur : strlen(cur);
86 cur = (next) ? next + 1 : NULL;
|
| /external/chromium_org/third_party/mesa/src/src/glsl/glcpp/ |
| glcpp.h | 11 * The above copyright notice and this permission notice (including the next
40 struct string_node *next; member in struct:string_node
100 struct token_node *next; member in struct:token_node
111 struct argument_node *next; member in struct:argument_node
143 struct expansion_node *next; member in struct:expansion_node
155 struct skip_node *next; member in struct:skip_node
161 struct active_list *next; member in struct:active_list
|
| /external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
| prcountr.h | 468 ** FUNCTION: PR_FindNextCounterQname() -- Retreive the next QName counter
472 ** PR_FindNextCounterQname() retreives the first or next Qname
477 ** the next QName handle.
497 #define PR_FIND_NEXT_COUNTER_QNAME(next,handle)\
498 (next) = PR_FindNextCounterQname((handle))
500 #define PR_FIND_NEXT_COUNTER_QNAME(next,handle) NULL
509 ** FUNCTION: PR_FindNextCounterRname() -- Retreive the next RName counter
513 ** PR_FindNextCounterRname() retreives the first or next RNname
518 ** attempts to retreive the next RName handle.
540 #define PR_FIND_NEXT_COUNTER_RNAME(next,rhandle,qhandle)
[all...] |
| prtrace.h | 250 ** the referenced trace handle. The next logically available
251 ** PRTraceEntry is used; when the next trace entry would overflow
340 ** with the next in-memory buffer segment that would be written
486 ** PR_FindNextTraceQname() retreives the first or next trace
494 ** retreived using PR_FindNextQname() the next QName handle is
509 #define PR_FIND_NEXT_TRACE_QNAME(next,handle)\
510 (next) = PR_FindNextTraceQname((handle))
512 #define PR_FIND_NEXT_TRACE_QNAME(next,handle)
526 ** PR_FindNextTraceRname() retreives the first or next trace
534 ** previously retreived using PR_FindNextRname() the next RNam
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkIntersectionHelper.h | 71 bool isAdjacent(const SkIntersectionHelper& next) {
72 return fContour == next.fContour && fIndex + 1 == next.fIndex;
75 bool isFirstLast(const SkIntersectionHelper& next) {
76 return fContour == next.fContour && fIndex == 0
77 && next.fIndex == fLast - 1;
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| stack_trace_table.cc | 86 b = b->next;
103 b->next = table_[idx];
135 b = b->next;
149 Bucket* next = b->next; local
151 b = next;
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| stack_trace_table.cc | 86 b = b->next;
103 b->next = table_[idx];
135 b = b->next;
149 Bucket* next = b->next; local
151 b = next;
|
| /external/e2fsprogs/lib/blkid/ |
| devno.c | 74 dp->next = *list;
83 struct dir_list *dp, *next; local
85 for (dp = *list; dp; dp = next) {
86 next = dp->next;
157 list = list->next;
166 * the next level of subdirectories. (breadth-first)
|
| /external/emma/core/java12/com/vladium/util/ |
| WCMatcher.java | 249 next: while (true)
264 continue next; local
278 continue next; local
288 // [continue next;]
308 next: while (true)
323 continue next; local
337 continue next; local
347 // [continue next;]
|
