HomeSort by relevance Sort by last modified time
    Searched refs:nrules (Results 1 - 20 of 20) sorted by null

  /external/bison/src/
reduce.c 117 for (r = 0; r < nrules; r++)
164 Pp = bitset_create (nrules, BITSET_FIXED);
175 for (r = 0; r < nrules; r++)
208 nuseless_productions = nrules - nuseful_productions;
222 for (r = 0; r < nrules; ++r)
230 | Put the useless productions at the end of RULES, and adjust NRULES |
240 for (r = 0; r < nrules; r++)
249 int useless = nrules - nuseless_productions;
250 rule *rules_sorted = xnmalloc (nrules, sizeof *rules_sorted);
252 for (r = 0; r < nrules; ++r
    [all...]
output.c 223 unsigned int *prhs = xnmalloc (nrules, sizeof *prhs);
224 unsigned int *rline = xnmalloc (nrules, sizeof *rline);
225 symbol_number *r1 = xnmalloc (nrules, sizeof *r1);
226 unsigned int *r2 = xnmalloc (nrules, sizeof *r2);
227 int *dprec = xnmalloc (nrules, sizeof *dprec);
228 int *merger = xnmalloc (nrules, sizeof *merger);
230 for (r = 0; r < nrules; ++r)
254 muscle_insert_unsigned_int_table ("prhs", prhs, 0, 0, nrules);
255 muscle_insert_unsigned_int_table ("rline", rline, 0, 0, nrules);
256 muscle_insert_symbol_number_table ("r1", r1, 0, 0, nrules);
    [all...]
derives.c 73 /* DELTS[RULE] -- There are NRULES rule number to attach to nterms.
74 Instead of performing NRULES allocations for each, have an array
76 rule_list *delts = xnmalloc (nrules, sizeof *delts);
78 for (r = nrules - 1; r >= 0; --r)
92 q = xnmalloc (nvars + nrules, sizeof *q);
gram.c 38 rule_number nrules = 0; variable
52 return r->number < nrules;
162 for (r = 0; r < nrules; ++r)
181 for (r = 0; r < nrules + nuseless_productions; r++)
210 for (r = 0; r < nrules + nuseless_productions; r++)
246 "ntokens = %d, nvars = %d, nsyms = %d, nrules = %d, nritems = %d\n\n",
247 ntokens, nvars, nsyms, nrules, nritems);
267 for (i = 0; i < nrules + nuseless_productions; i++)
295 for (r = 0; r < nrules + nuseless_productions; r++)
308 for (r = 0; r < nrules ; ++r
    [all...]
nullable.c 64 size_t *rcount = xcalloc (nrules, sizeof *rcount);
69 Supposedly NRITEMS - NRULES is enough. But why take the risk? */
77 for (ruleno = 0; ruleno < nrules; ++ruleno)
closure.c 150 | Set FDERIVES to an NVARS by NRULES matrix of bits indicating which |
165 fderives = bitsetv_create (nvars, nrules, BITSET_FIXED);
189 ruleset = bitset_create (nrules, BITSET_FIXED);
gram.h 36 The rules receive rule numbers 1 to NRULES in the order they are
149 extern rule_number nrules;
207 /* Return true IFF the rule has a `number' smaller than NRULES. That is, it is
211 /* Return true IFF the rule has a `number' higher than NRULES. That is, it is
print.c 425 for (r = 0; r < nrules; r++)
445 for (r = 0; r < nrules; r++)
469 for (r = 0; r < nrules; r++)
485 for (r = 0; r < nrules; r++)
LR0.c 106 for (r = 0; r < nrules; ++r)
140 redset = xnmalloc (nrules, sizeof *redset);
reader.c 235 ++nrules;
387 ++nrules;
514 rules = xnmalloc (nrules, sizeof *rules);
676 if (nrules == 0)
721 nrules += 1;
tables.c 449 for (r = 0; r < nrules; ++r)
  /ndk/sources/host-tools/make-3.81/
implicit.c 241 unsigned int nrules;
309 nrules = 0;
409 tryrules[nrules] = rule;
410 matches[nrules] = i;
411 checked_lastslash[nrules] = check_lastslash;
412 ++nrules;
419 for (i = 0; i < nrules; ++i)
441 for (i = 0; i < nrules; i++)
783 if (i < nrules)
239 unsigned int nrules; local
  /external/libsepol/src/
avtab.c 301 int avtab_alloc(avtab_t *h, uint32_t nrules)
305 uint32_t work = nrules;
308 if (nrules == 0)
  /external/chromium_org/third_party/icu/source/tools/tzcode/
zic.c 294 static int nrules; /* number of rules */ variable
870 if (nrules != 0) {
871 (void) qsort((void *) rules, (size_t) nrules,
873 for (i = 0; i < nrules - 1; ++i) {
884 for (j = i + 2; j < nrules; ++j) {
904 for (base = 0; base < nrules; base = out) {
906 for (out = base + 1; out < nrules; ++out)
1112 (int) ((nrules + 1) * sizeof *rules));
1113 rules[nrules++] = r;
    [all...]
  /external/icu4c/tools/tzcode/
zic.c 294 static int nrules; /* number of rules */ variable
870 if (nrules != 0) {
871 (void) qsort((void *) rules, (size_t) nrules,
873 for (i = 0; i < nrules - 1; ++i) {
884 for (j = i + 2; j < nrules; ++j) {
904 for (base = 0; base < nrules; base = out) {
906 for (out = base + 1; out < nrules; ++out)
1112 (int) ((nrules + 1) * sizeof *rules));
1113 rules[nrules++] = r;
    [all...]
  /ndk/sources/host-tools/sed-4.2.1/lib/
regex_internal.h 839 uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
841 if (nrules != 0)
838 uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES); local
regcomp.c 2761 uint32_t nrules; local
3408 uint32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES); local
    [all...]
regexec.c 3864 uint32_t nrules; local
4017 uint32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES); local
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/pydoc_data/
topics.py     [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/pydoc_data/
topics.py     [all...]

Completed in 1869 milliseconds