Home
last modified time | relevance | path

Searched refs:nstates (Results 1 – 23 of 23) sorted by relevance

/freebsd/contrib/nvi/regex/
H A Dregexec.c110 #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) do { (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&REG_LARGE)) in regexec()
H A Dregex2.h144 sopno nstates; /* = number of sops */ member
H A Dengine.c981 for (i = 0; i < g->nstates; i++) in print()
H A Dregcomp.c1483 g->nstates = p->slen; in stripsnug()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A Dregexec.c107 #define CLEAR(v) memset(v, 0, m->g->nstates)
111 #define ASSIGN(d, s) memmove(d, s, m->g->nstates)
112 #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
114 #define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \
118 #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
158 if (g->nstates <= (long)(CHAR_BIT*sizeof(states1)) && !(eflags&REG_LARGE)) in llvm_regexec()
H A Dregex2.h141 sopno nstates; /* = number of sops */ member
H A Dregcomp.c1571 g->nstates = p->slen; in stripsnug()
H A Dregengine.inc1042 for (i = 0; i < g->nstates; i++)
/freebsd/contrib/byacc/
H A Doutput.c355 for (i = 1; i < nstates; i++) in output_yydefred()
375 if (nstates != 0) in output_accessing_symbols()
380 translate = TCMALLOC(int, nstates); 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()
548 tally[nstates + i] = reducecount; in token_actions()
551 tally[2 * nstates + i] = conflictcount; in token_actions()
554 width[nstates + i] = 0; in token_actions()
557 width[2 * nstates + i] = 0; in token_actions()
[all …]
H A Dmkpar.c51 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 Dlalr.c76 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 Dgraph.c22 for (i = 0; i < nstates; ++i) in graph()
29 for (i = 0; i < nstates; ++i) in graph()
H A Dlr0.c19 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 Dverbose.c30 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 Ddefs.h391 extern Value_t nstates;
/freebsd/lib/libc/regex/
H A Dregexec.c146 #define CLEAR(v) memset(v, 0, m->g->nstates)
150 #define ASSIGN(d, s) memcpy(d, s, m->g->nstates)
151 #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
153 #define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \
157 #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
223 else if (g->nstates <= CHAR_BIT*sizeof(states1) && !(eflags&REG_LARGE)) in regexec()
H A Dregex2.h179 sopno nstates; /* = number of sops */ member
H A Dengine.c1147 for (i = 0; i < g->nstates; i++) in print()
H A Dregcomp.c1840 g->nstates = p->slen;
/freebsd/sys/dev/gpio/
H A Dgpioregulator.c57 int nstates; member
133 for (n = 0; n < sc->def->nstates; n++) { in gpioregulator_regnode_set_voltage()
173 for (n = 0; n < sc->def->nstates; n++) { in gpioregulator_regnode_get_voltage()
220 sc->init_def.nstates = len / 2; in gpioregulator_parse_fdt()
221 sc->init_def.states = malloc(sc->init_def.nstates * in gpioregulator_parse_fdt()
223 for (n = 0; n < sc->init_def.nstates; n++) { in gpioregulator_parse_fdt()
/freebsd/lib/libc/regex/grot/
H A Ddebug.c29 fprintf(d, "%ld states", (long)g->nstates);
/freebsd/contrib/netbsd-tests/lib/libc/regex/
H A Ddebug.c60 fprintf(d, "%ld states, %zu categories", (long)g->nstates, in regprint()
/freebsd/sys/netpfil/ipfw/
H A Dip_fw_dynamic.c389 uint32_t nstates; in sysctl_dyn_max() local
392 nstates = V_dyn_max; in sysctl_dyn_max()
393 error = sysctl_handle_32(oidp, &nstates, 0, req); in sysctl_dyn_max()
398 V_dyn_max = nstates; in sysctl_dyn_max()
406 uint32_t nstates; in sysctl_dyn_parent_max() local
409 nstates = V_dyn_parent_max; in sysctl_dyn_parent_max()
410 error = sysctl_handle_32(oidp, &nstates, 0, req); in sysctl_dyn_parent_max()
415 V_dyn_parent_max = nstates; in sysctl_dyn_parent_max()