Searched refs:nstates (Results 1 – 12 of 12) sorted by relevance
/dragonfly/contrib/byacc/ |
H A D | output.c | 355 for (i = 1; i < nstates; i++) in output_yydefred() 375 if (nstates != 0) in output_accessing_symbols() 383 for (i = 0; i < nstates; ++i) in output_accessing_symbols() 396 for (i = 1; i < nstates; ++i) in output_accessing_symbols() 450 for (i = 0; i < nstates; ++i) in token_actions() 554 width[nstates + i] = 0; in token_actions() 557 width[2 * nstates + i] = 0; in token_actions() 641 for (i = 0; i < nstates; i++) in default_goto() 800 if (i >= 2 * nstates) in matching_vector() 988 for (i = nstates + 1; i < 2 * nstates; i++) in output_base() [all …]
|
H A D | mkpar.c | 51 parser = NEW2(nstates, action *); in make_parser() 52 for (i = 0; i < nstates; i++) in make_parser() 204 for (i = 0; i < nstates; ++i) in unused_rules() 235 SRconflicts = NEW2(nstates, Value_t); in remove_conflicts() 236 RRconflicts = NEW2(nstates, Value_t); in remove_conflicts() 237 for (i = 0; i < nstates; i++) in remove_conflicts() 377 defred = NEW2(nstates, Value_t); in defreds() 378 for (i = 0; i < nstates; i++) in defreds() 400 for (i = 0; i < nstates; i++) in free_parser()
|
H A D | lalr.c | 76 state_table = NEW2(nstates, core *); in set_state_table() 86 accessing_symbol = NEW2(nstates, Value_t); in set_accessing_symbol() 96 shift_table = NEW2(nstates, shifts *); in set_shift_table() 106 reduction_table = NEW2(nstates, reductions *); in set_reduction_table() 145 lookaheads = NEW2(nstates + 1, Value_t); in initialize_LA() 148 for (i = 0; i < nstates; i++) in initialize_LA() 155 lookaheads[nstates] = (Value_t)k; in initialize_LA() 162 for (i = 0; i < nstates; i++) in initialize_LA() 534 n = lookaheads[nstates]; in compute_lookaheads()
|
H A D | lr0.c | 19 Value_t nstates; variable 246 nstates = 1; in initialize_states() 297 if (nstates >= MAXYYINT) in new_state() 306 p->number = (Value_t)nstates; in new_state() 316 nstates++; in new_state()
|
H A D | graph.c | 22 for (i = 0; i < nstates; ++i) in graph() 29 for (i = 0; i < nstates; ++i) in graph()
|
H A D | verbose.c | 30 for (i = 0; i < nstates; i++) in verbose() 42 (long)(nrules - 2), (long)nstates); in verbose() 90 for (i = 0; i < nstates; i++) in log_conflicts()
|
H A D | defs.h | 390 extern Value_t nstates;
|
/dragonfly/contrib/nvi2/regex/ |
H A D | regexec.c | 110 #define CLEAR(v) memset(v, 0, m->g->nstates) 114 #define ASSIGN(d, s) memcpy(d, s, m->g->nstates) 115 #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0) 117 #define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \ 121 #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates]) 169 if (g->nstates <= (int)(CHAR_BIT*sizeof(states1)) && !(eflags®_LARGE)) in regexec()
|
H A D | regex2.h | 144 sopno nstates; /* = number of sops */ member
|
H A D | engine.c | 981 for (i = 0; i < g->nstates; i++) in print()
|
H A D | regcomp.c | 1483 g->nstates = p->slen; in stripsnug()
|
/dragonfly/usr.bin/systat/ |
H A D | pftop.c | 237 size_t nstates; in fetchpftop() local 262 nstates = ps.ps_len / sizeof(*states); in fetchpftop() 267 for (i = 0; i < nstates; ++i) in fetchpftop()
|