/external/bison/src/ |
closure.c | 46 #define FDERIVES(Var) fderives[(Var) - ntokens] 47 #define FIRSTS(Var) firsts[(Var) - ntokens] 78 for (i = ntokens; i < nsyms; i++) 85 symbols[j + ntokens]->tag); 99 for (i = ntokens; i < nsyms; i++) 120 | symbol 5, so the bit [8 - ntokens] in first[5 - ntokens] (= FIRST | 131 for (i = ntokens; i < nsyms; i++) 132 for (j = 0; derives[i - ntokens][j]; ++j) 134 item_number sym = derives[i - ntokens][j]->rhs[0] [all...] |
derives.c | 47 for (i = ntokens; i < nsyms; i++) 51 for (rp = derives[i - ntokens]; *rp; ++rp) 69 /* DSET[NTERM - NTOKENS] -- A linked list of the numbers of the rules 83 p->next = dset[lhs - ntokens]; 85 dset[lhs - ntokens] = p; 94 for (i = ntokens; i < nsyms; i++) 96 rule_list *p = dset[i - ntokens]; 97 derives[i - ntokens] = q;
|
nullable.c | 23 the null string. NULLABLE[I - NTOKENS] is nonzero if symbol I can 49 for (i = ntokens; i < nsyms; i++) 51 nullable[i - ntokens] ? "yes" : "no"); 96 p->next = rsets[*rp - ntokens]; 98 rsets[*rp - ntokens] = p; 108 && ! nullable[rules_ruleno->lhs->number - ntokens]) 110 nullable[rules_ruleno->lhs->number - ntokens] = true; 117 for (p = rsets[*s1++ - ntokens]; p; p = p->next) 121 if (r->useful && ! nullable[r->lhs->number - ntokens]) 123 nullable[r->lhs->number - ntokens] = true [all...] |
reduce.c | 76 if (ISVAR (*rhsp) && !bitset_test (N0, *rhsp - ntokens)) 121 bitset_set (Np, rules[r].lhs->number - ntokens); 167 if (bitset_test (N, accept->number - ntokens)) 183 if (ISTOKEN (*rhsp) || bitset_test (N, *rhsp - ntokens)) 213 for (i = ntokens; i < nsyms; i++) 295 n = ntokens; 296 for (i = ntokens; i < nsyms; i++) 298 nontermmap[i - ntokens] = n++; 299 for (i = ntokens; i < nsyms; i++) 302 nontermmap[i - ntokens] = n++ [all...] |
lalr.c | 57 /* LA is an NLA by NTOKENS matrix of bits. LA[l, i] is 1 if the rule 93 goto_map[TRANSITION_SYMBOL (sp, i) - ntokens]++; 100 for (i = ntokens; i < nsyms; i++) 102 temp_map[i - ntokens] = k; 103 k += goto_map[i - ntokens]; 106 for (i = ntokens; i < nsyms; i++) 107 goto_map[i - ntokens] = temp_map[i - ntokens]; 109 goto_map[nsyms - ntokens] = ngotos; 110 temp_map[nsyms - ntokens] = ngotos [all...] |
gram.h | 26 NTOKENS is the number of tokens, and NVARS is the number of 27 variables (nonterminals). NSYMS is the total number, ntokens + 31 Numbers 0 to NTOKENS - 1 are for tokens, and NTOKENS to NSYMS - 1 33 This token is counted in ntokens. The true number of token values 34 assigned is NTOKENS reduced by one for each alias declaration. 108 # define ISTOKEN(i) ((i) < ntokens) 109 # define ISVAR(i) ((i) >= ntokens) 112 extern int ntokens;
|
tables.c | 56 return state_number_as_int (nstates) + sym - ntokens; 191 for (j = 0; j < ntokens; j += 1) 250 for (i = 0; i < ntokens; i++) 333 for (j = 0; j < ntokens; j++) 353 for (j = 0; j < ntokens; j++) 366 for (i = 0; i < ntokens; i++) 393 for (i = 0; i < ntokens; i++) 407 for (i = 0; i < ntokens; i++) 440 actrow = xnmalloc (ntokens, sizeof *actrow); 441 conflrow = xnmalloc (ntokens, sizeof *conflrow) [all...] |
output.c | 153 MUSCLE_INSERT_INT ("tokens_number", ntokens); 202 int *values = xnmalloc (ntokens, sizeof *values); 203 for (i = 0; i < ntokens; ++i) 206 values[0], 1, ntokens); 350 for (i = 0; i < ntokens; ++i) 445 yydefgoto[0], 1, nsyms - ntokens);
|
graphviz.c | 90 *no_reduce_set = bitset_create (ntokens, BITSET_FIXED); 191 for (i = 0; i < ntokens; i++)
|
gram.c | 42 int ntokens = 1; variable 246 "ntokens = %d, nvars = %d, nsyms = %d, nrules = %d, nritems = %d\n\n", 247 ntokens, nvars, nsyms, nrules, nritems); 255 for (i = ntokens; i < nsyms; i++)
|
conflicts.c | 270 for (i = 0; i < ntokens; i++) 390 symbol **errors = xnmalloc (ntokens + 1, sizeof *errors); 393 shift_set = bitset_create (ntokens, BITSET_FIXED); 394 lookahead_set = bitset_create (ntokens, BITSET_FIXED); 469 for (i = 0; i < ntokens; i++)
|
AnnotationList.c | 157 bitset shift_tokens = bitset_create (ntokens, BITSET_FIXED); 168 bitset conflicted_tokens = bitset_create (ntokens, BITSET_FIXED); 169 bitset conflicted_tokens_rule = bitset_create (ntokens, BITSET_FIXED); 170 bitset tokens = bitset_create (ntokens, BITSET_FIXED); 344 lookaheads[i] = bitset_create (ntokens, BITSET_FIXED); 429 all_lookaheads = bitsetv_create (s->nitems, ntokens, BITSET_FIXED); [all...] |
symtab.c | 339 sym->number = ntokens++; 375 NTOKENS. */ 377 --ntokens; 504 this->number += ntokens; 832 for (i = 0; i < ntokens; ++i) 853 for (i = 0; i < ntokens; ++i) 897 ntokens -= 1;
|
print-xml.c | 268 for (i = 0; i < ntokens; i++) 298 for (i = 0; i < ntokens; i++) 412 for (i = ntokens; i < nsyms + nuseless_nonterminals; i++) 520 no_reduce_set = bitset_create (ntokens, BITSET_FIXED);
|
print.c | 268 for (i = 0; i < ntokens; i++) 297 for (i = 0; i < ntokens; i++) 439 for (i = ntokens; i < nsyms; i++) 524 no_reduce_set = bitset_create (ntokens, BITSET_FIXED);
|
ielr.c | 58 && nullable [item_number_as_symbol_number (ritem[i]) - ntokens]) 113 - ntokens]; 240 * \c ntokens columns. 252 *always_followsp = bitsetv_create (ngotos, ntokens, BITSET_FIXED); 267 if (nullable[sym - ntokens]) 393 bitset_create (ntokens, BITSET_FIXED); 605 * \c t, and the number of columns is \c ::ntokens. 671 * \c ::ntokens. 807 bitset_create (ntokens, BITSET_FIXED); [all...] |
/external/iputils/ |
ping_common.c | 485 long ntokens; local 489 ntokens = (tv.tv_sec - cur_time.tv_sec)*1000 + 494 if (ntokens < MININTERVAL && in_flight() >= preload) 495 return MININTERVAL-ntokens; 497 ntokens += tokens; 498 if (ntokens > interval*preload) 499 ntokens = interval*preload; 500 if (ntokens < interval) 501 return interval - ntokens; 504 tokens = ntokens - interval [all...] |