/libcore/luni/src/main/java/java/util/ |
LinkedHashMap.java | 53 * The first real entry is header.nxt, and the last is header.prv. 54 * If the map is empty, header.nxt == header && header.prv == header. 141 * LinkedEntry adds nxt/prv double-links to plain HashMapEntry. 144 LinkedEntry<K, V> nxt; field in class:LinkedHashMap.LinkedEntry 150 nxt = prv = this; 155 LinkedEntry<K, V> nxt, LinkedEntry<K, V> prv) { 157 this.nxt = nxt; 167 LinkedEntry<K, V> eldest = header.nxt; 188 LinkedEntry<K, V> eldest = header.nxt; 331 LinkedEntry<K, V> nxt = e.nxt; local [all...] |
/cts/tools/dasm/src/java_cup/ |
lalr_transition.java | 22 * @param nxt next transition in linked list. 24 public lalr_transition(symbol on_sym, lalr_state to_st, lalr_transition nxt) 36 _next = nxt;
|
/external/tcpdump/ |
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...] |
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...] |
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...] |
/system/vold/ |
Devmapper.cpp | 84 unsigned nxt = 0; local 86 n = (struct dm_name_list *) (((char *) n) + nxt); 108 nxt = n->next; 109 } while (nxt);
|
/external/webkit/Tools/android/flex-2.5.4a/ |
tblcmp.c | 309 nxt = reallocate_integer_array( nxt, current_max_xpairs ); 340 * consecutive unused records in the chk and nxt arrays. 347 * nxt and chk. 352 * chk/nxt, which should be 1. 358 * chk/nxt arrays. 409 /* Check to see if all elements in chk (and therefore nxt) 479 nxt[tblend] = end_of_buffer_state; 484 nxt[tblend + i] = 0; 498 /* mkentry - create base/def and nxt/chk entries for transition arra [all...] |
gen.c | 144 * is. The offset is base[nxt[i]] - (base of current state)]. That's 153 /* We need to have room in nxt/chk for two more slots: One for the 156 * nxt/chk pair with is EOB, i.e., 0, so we don't have to make sure 167 nxt[tblend + 1] = end_of_buffer_action; 172 nxt[tblend + 2] = 0; 184 nxt[offset - 1] = anum; /* action number */ 193 transition_struct_out( 0, nxt[i] ); 200 base[nxt[i]] - (i - chk[i]) ); 205 transition_struct_out( chk[tblend + 1], nxt[tblend + 1] ); 206 transition_struct_out( chk[tblend + 2], nxt[tblend + 2] ) [all...] |
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 );
|
flexdef.h | 223 /* Maximum number of nxt/chk pairs for non-templates. */ 227 /* Maximum number of nxt/chk pairs needed for templates. */ 282 * fit the transition table into "holes" inside the nxt/chk table. 576 * nxt - state to enter upon reading character 577 * chk - check value to see if "nxt" applies 578 * tnxt - internal nxt table for templates 579 * base - offset into "nxt" for given state 580 * def - where to go if "chk" disallows "nxt" entry 583 * tblend - last "nxt/chk" table entry being used 584 * firstfree - first empty entry in "nxt/chk" tabl [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/iptables/iptables/ |
xtoptions.c | 1064 char *cur, *nxt; local 1080 id = strtoul(cur, &nxt, strncmp(cur, "0x", 2) == 0 ? 16 : 10); 1081 if (nxt == cur || errno != 0) 1087 cur = nxt; 1095 nxt = cur; 1096 while (*nxt != '\0' && !isspace(*nxt)) 1097 ++nxt; 1098 if (nxt == cur) 1100 *nxt = '\0' [all...] |
/external/oprofile/opjitconv/ |
opjitconv.c | 440 struct procid * id, * nxt; local 472 for (id = pid_list; id; id = nxt) { 474 nxt = id->next;
|
/external/expat/lib/ |
xmlparse.c | 4506 const char *nxt = (quant == XML_CQUANT_NONE local [all...] |