Searched refs:nstates (Results 1 - 20 of 20) sorted by relevance

/freebsd-10.3-release/contrib/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))
H A Dregex2.h135 sopno nstates; /* = number of sops */ member in struct:re_guts
H A Dregcomp.c1430 g->nstates = p->slen;
/freebsd-10.3-release/contrib/nvi/regex/
H A Dregexec.c118 #define CLEAR(v) memset(v, 0, m->g->nstates)
122 #define ASSIGN(d, s) memcpy(d, s, m->g->nstates)
123 #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
125 #define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \
129 #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
176 if (g->nstates <= (int)(CHAR_BIT*sizeof(states1)) && !(eflags&REG_LARGE))
H A Dregex2.h148 sopno nstates; /* = number of sops */ member in struct:re_guts
H A Dengine.c1034 for (i = 0; i < g->nstates; i++)
H A Dregcomp.c1589 g->nstates = p->slen;
/freebsd-10.3-release/contrib/byacc/
H A Dmkpar.c51 parser = NEW2(nstates, action *);
52 for (i = 0; i < nstates; i++)
200 for (i = 0; i < nstates; ++i)
232 SRconflicts = NEW2(nstates, Value_t);
233 RRconflicts = NEW2(nstates, Value_t);
234 for (i = 0; i < nstates; i++)
373 defred = NEW2(nstates, Value_t);
374 for (i = 0; i < nstates; i++)
396 for (i = 0; i < nstates; i++)
H A Dgraph.c22 for (i = 0; i < nstates; ++i)
29 for (i = 0; i < nstates; ++i)
H A Doutput.c297 for (i = 1; i < nstates; i++)
320 if (nstates != 0)
322 translate = TMALLOC(int, nstates);
325 for (i = 0; i < nstates; ++i)
336 for (i = 1; i < nstates; ++i)
388 for (i = 0; i < nstates; ++i)
486 tally[nstates + i] = reducecount;
489 tally[2 * nstates + i] = conflictcount;
492 width[nstates + i] = 0;
495 width[2 * nstates
[all...]
H A Dlalr.c76 state_table = NEW2(nstates, core *);
86 accessing_symbol = NEW2(nstates, Value_t);
96 shift_table = NEW2(nstates, shifts *);
106 reduction_table = NEW2(nstates, reductions *);
145 lookaheads = NEW2(nstates + 1, Value_t);
148 for (i = 0; i < nstates; i++)
155 lookaheads[nstates] = (Value_t) k;
162 for (i = 0; i < nstates; i++)
539 n = lookaheads[nstates];
H A Dlr0.c19 int nstates; variable
243 nstates = 1;
294 if (nstates >= MAXYYINT)
303 p->number = (Value_t) nstates;
313 nstates++;
H A Dverbose.c30 for (i = 0; i < nstates; i++)
41 fprintf(verbose_file, "%d grammar rules, %d states\n", nrules - 2, nstates);
89 for (i = 0; i < nstates; i++)
/freebsd-10.3-release/lib/libc/regex/
H A Dregexec.c152 #define CLEAR(v) memset(v, 0, m->g->nstates)
156 #define ASSIGN(d, s) memcpy(d, s, m->g->nstates)
157 #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
159 #define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \
163 #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
229 else if (g->nstates <= CHAR_BIT*sizeof(states1) && !(eflags&REG_LARGE))
H A Dregex2.h171 sopno nstates; /* = number of sops */ member in struct:re_guts
H A Dengine.c1120 for (i = 0; i < g->nstates; i++)
H A Dregcomp.c1403 g->nstates = p->slen;
/freebsd-10.3-release/sys/netpfil/ipfw/
H A Dip_fw_dynamic.c1382 unsigned int nstates; local
1384 nstates = V_dyn_max;
1386 error = sysctl_handle_int(oidp, &nstates, 0, req);
1391 V_dyn_max = nstates;
1404 unsigned int nstates; local
1406 nstates = DYN_COUNT;
1408 error = sysctl_handle_int(oidp, &nstates, 0, req);
/freebsd-10.3-release/contrib/netbsd-tests/lib/libc/regex/
H A Ddebug.c65 fprintf(d, "%ld states, %zu categories", (long)g->nstates,
/freebsd-10.3-release/lib/libc/regex/grot/
H A Ddebug.c32 fprintf(d, "%ld states", (long)g->nstates);

Completed in 258 milliseconds