| /external/bison/src/ |
| D | reduce.c | 118 for (r = 0; r < nrules; r++) in useless_nonterminals()
165 Pp = bitset_create (nrules, BITSET_FIXED); in inaccessable_symbols()
176 for (r = 0; r < nrules; r++) in inaccessable_symbols()
209 nuseless_productions = nrules - nuseful_productions; in inaccessable_symbols()
223 for (r = 0; r < nrules; ++r) in inaccessable_symbols()
241 for (r = 0; r < nrules; r++) in reduce_grammar_tables()
250 int useless = nrules - nuseless_productions; in reduce_grammar_tables()
251 rule *rules_sorted = xnmalloc (nrules, sizeof *rules_sorted); in reduce_grammar_tables()
253 for (r = 0; r < nrules; ++r) in reduce_grammar_tables()
259 for (r = 0; r < nrules; ++r) in reduce_grammar_tables()
[all …]
|
| D | output.c | 211 unsigned int *prhs = xnmalloc (nrules, sizeof *prhs); in prepare_rules()
212 unsigned int *rline = xnmalloc (nrules, sizeof *rline); in prepare_rules()
213 symbol_number *r1 = xnmalloc (nrules, sizeof *r1); in prepare_rules()
214 unsigned int *r2 = xnmalloc (nrules, sizeof *r2); in prepare_rules()
215 int *dprec = xnmalloc (nrules, sizeof *dprec); in prepare_rules()
216 int *merger = xnmalloc (nrules, sizeof *merger); in prepare_rules()
218 for (r = 0; r < nrules; ++r) in prepare_rules()
242 muscle_insert_unsigned_int_table ("prhs", prhs, 0, 0, nrules); in prepare_rules()
243 muscle_insert_unsigned_int_table ("rline", rline, 0, 0, nrules); in prepare_rules()
244 muscle_insert_symbol_number_table ("r1", r1, 0, 0, nrules); in prepare_rules()
[all …]
|
| D | gram.c | 39 rule_number nrules = 0; variable
57 return r->number < nrules; in rule_useful_p()
184 for (r = 0; r < nrules; ++r) in ritem_longest_rhs()
208 for (r = 0; r < nrules + nuseless_productions; r++) in grammar_rules_partial_print()
247 ntokens, nvars, nsyms, nrules, nritems); in grammar_dump()
267 for (i = 0; i < nrules + nuseless_productions; i++) in grammar_dump()
295 for (r = 0; r < nrules + nuseless_productions; r++) in grammar_dump()
316 for (r = 0; r < nrules ; ++r) in grammar_rules_never_reduced_report()
|
| D | derives.c | 78 rule_list *delts = xnmalloc (nrules, sizeof *delts); in derives_compute()
80 for (r = nrules - 1; r >= 0; --r) in derives_compute()
94 q = xnmalloc (nvars + nrules, sizeof *q); in derives_compute()
|
| D | reader.c | 197 ++nrules; in grammar_current_rule_begin()
317 ++nrules; in grammar_midrule_action()
425 rules = xnmalloc (nrules, sizeof *rules); in packgram()
533 if (nrules == 0) in check_and_convert_grammar()
560 nrules += 1; in check_and_convert_grammar()
|
| D | nullable.c | 66 size_t *rcount = xcalloc (nrules, sizeof *rcount); in nullable_compute()
79 for (ruleno = 0; ruleno < nrules; ++ruleno) in nullable_compute()
|
| D | closure.c | 166 fderives = bitsetv_create (nvars, nrules, BITSET_FIXED); in set_fderives()
189 ruleset = bitset_create (nrules, BITSET_FIXED); in new_closure()
|
| D | print.c | 470 for (r = 0; r < nrules; r++) in print_grammar()
490 for (r = 0; r < nrules; r++) in print_grammar()
514 for (r = 0; r < nrules; r++) in print_grammar()
528 for (r = 0; r < nrules; r++) in print_grammar()
|
| D | LR0.c | 108 for (r = 0; r < nrules; ++r) in allocate_itemsets()
142 redset = xnmalloc (nrules, sizeof *redset); in allocate_storage()
|
| D | gram.h | 149 extern rule_number nrules;
|
| D | tables.c | 439 for (r = 0; r < nrules; ++r) in token_actions()
|
| /external/libsepol/src/ |
| D | avtab.c | 301 int avtab_alloc(avtab_t *h, uint32_t nrules) in avtab_alloc() argument
305 uint32_t work = nrules; in avtab_alloc()
308 if (nrules == 0) in avtab_alloc()
|
| /external/icu4c/tools/tzcode/ |
| D | zic.c | 294 static int nrules; /* number of rules */ variable
870 if (nrules != 0) { in associate()
871 (void) qsort((void *) rules, (size_t) nrules, in associate()
873 for (i = 0; i < nrules - 1; ++i) { in associate()
884 for (j = i + 2; j < nrules; ++j) { in associate()
904 for (base = 0; base < nrules; base = out) { in associate()
906 for (out = base + 1; out < nrules; ++out) in associate()
1112 (int) ((nrules + 1) * sizeof *rules));
1113 rules[nrules++] = r;
|
| /external/bison/ |
| D | ChangeLog | 8177 Stop storing rules from 1 to nrules + 1.
8182 Iterate from 0 to nrules.
8310 `nterms_number', `nrules' as `rules_number', `nstates' as
10024 * src/gram.c (nitems, nrules, nsyms, ntokens, nvars, nritems)
10132 the end of `rules', and count them out of `nrules'.
10135 the usefulness of a rule, as useless rules are beyond `nrules + 1'.
10141 lacking `+ 1' to nrules, Bison reported as useless a token if it
10153 Normalize loops to using `< nrules + 1', not `<= nrules'.
11588 * src/closure.c (closure): Use nrules instead of playing tricks
|