| /system/vold/ |
| Devmapper.cpp | 80 unsigned nxt = 0; local
82 n = (struct dm_name_list *) (((char *) n) + nxt);
104 nxt = n->next;
105 } while (nxt);
|
| /external/iptables/extensions/ |
| libipt_realm.c | 51 char *cur, *nxt; local
70 id = strtoul(cur, &nxt, strncmp(cur, "0x", 2) ? 10 : 16);
71 if ((nxt == cur) || errno)
77 cur = nxt;
85 nxt = cur;
86 while ((*nxt != 0) && !isspace(*nxt))
87 nxt++;
88 if (nxt == cur)
98 newnm->len = nxt - cur
[all...] |
| /external/srec/srec/cfront/ |
| spec_anl.c | 275 bigdata t, sum, mom, nxt; local
283 nxt = 0;
286 ASSERT(((float)nxt + (float)freqobj->framp[j] *(float)density[j]) < LONG_MAX);
287 ASSERT(((float)nxt + (float)freqobj->framp[j] *(float)density[j]) > -LONG_MAX);
288 nxt += (bigdata) SHIFT_DOWN((bigdata)freqobj->framp[j] * (bigdata)density[j], RAMP_SHIFT);
308 ASSERT(((float)nxt + (float)sum - (float)mom) < LONG_MAX);
309 ASSERT(((float)nxt + (float)sum - (float)mom) > LONG_MIN);
312 t = (bigdata)((SHIFT_UP(nxt + sum - mom, HALF_RAMP_SHIFT)
316 nxt = mom;
|
| /external/tcpdump/ |
| print-atalk.c | 533 struct hnamemem *nxt; member in struct:hnamemem
571 tp->nxt; tp = tp->nxt)
574 tp->nxt = newhnamemem();
580 for (tp = &hnametable[i & (HASHNAMESIZE-1)]; tp->nxt; tp = tp->nxt)
586 for (tp2 = &hnametable[i & (HASHNAMESIZE-1)]; tp2->nxt; tp2 = tp2->nxt)
589 tp->nxt = newhnamemem();
597 tp->nxt = newhnamemem()
[all...] |
| print-tcp.c | 83 struct tcp_seq_hash *nxt; member in struct:tcp_seq_hash
386 th->nxt; th = th->nxt)
391 if (!th->nxt || (flags & TH_SYN)) {
393 if (th->nxt == NULL) {
394 th->nxt = (struct tcp_seq_hash *)
396 if (th->nxt == NULL)
747 u_int8_t nxt; local
773 nxt = 0;
774 MD5_Update(&ctx, (char *)&nxt, sizeof(nxt))
[all...] |
| addrtoname.c | 87 struct hnamemem *nxt; member in struct:hnamemem
141 struct h6namemem *nxt; member in struct:h6namemem
234 for (; p->nxt; p = p->nxt) {
239 p->nxt = newhnamemem();
284 for (; p->nxt; p = p->nxt) {
289 p->nxt = newh6namemem();
547 for (tp = &eprototable[i & (HASHNAMESIZE-1)]; tp->nxt; tp = tp->nxt)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| LinkedHashMap.java | 57 * The first real entry is header.nxt, and the last is header.prv.
58 * If the map is empty, header.nxt == header && header.prv == header.
146 * LinkedEntry adds nxt/prv double-links to plain HashMapEntry.
149 LinkedEntry<K, V> nxt; field in class:LinkedHashMap.LinkedEntry
155 nxt = prv = this;
160 LinkedEntry<K, V> nxt, LinkedEntry<K, V> prv) {
162 this.nxt = nxt;
184 LinkedEntry<K, V> eldest = header.nxt;
193 table[index] = oldTail.nxt = header.prv = newTail
327 LinkedEntry<K, V> nxt = e.nxt; local
[all...] |
| /external/webkit/WebKitTools/android/flex-2.5.4a/ |
| main.c | 89 int lastdfa, *nxt, *chk, *tnxt; variable
536 _( " %d/%d (peak %d) nxt-chk entries created\n" ),
539 _( " %d/%d (peak %d) template nxt-chk entries created\n" ),
1093 nxt = allocate_integer_array( current_max_xpairs );
|
| /external/expat/lib/ |
| xmlparse.c | 4506 const char *nxt = (quant == XML_CQUANT_NONE local
[all...] |
