Searched refs:nstates (Results 1 - 14 of 14) sorted by relevance
/freebsd-9.3-release/contrib/llvm/lib/Support/ |
H A D | regexec.c | 107 #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®_LARGE))
|
H A D | regex2.h | 135 sopno nstates; /* = number of sops */ member in struct:re_guts
|
H A D | regcomp.c | 1430 g->nstates = p->slen;
|
/freebsd-9.3-release/usr.bin/yacc/ |
H A D | mkpar.c | 76 parser = NEW2(nstates, action *); 77 for (i = 0; i < nstates; i++) 226 for (i = 0; i < nstates; ++i) 258 SRconflicts = NEW2(nstates, short); 259 RRconflicts = NEW2(nstates, short); 260 for (i = 0; i < nstates; i++) 377 defred = NEW2(nstates, short); 378 for (i = 0; i < nstates; i++) 400 for (i = 0; i < nstates; i++)
|
H A D | lalr.c | 119 state_table = NEW2(nstates, core *); 131 accessing_symbol = NEW2(nstates, short); 143 shift_table = NEW2(nstates, shifts *); 155 reduction_table = NEW2(nstates, reductions *); 197 lookaheads = NEW2(nstates + 1, short); 200 for (i = 0; i < nstates; i++) 207 lookaheads[nstates] = k; 214 for (i = 0; i < nstates; i++) 596 n = lookaheads[nstates];
|
H A D | output.c | 239 for (i = 1; i < nstates; i++) 261 nvectors = 2*nstates + nvars; 297 for (i = 0; i < nstates; ++i) 324 tally[nstates+i] = reducecount; 326 width[nstates+i] = 0; 349 froms[nstates+i] = r = NEW2(reducecount, short); 350 tos[nstates+i] = s = NEW2(reducecount, short); 365 width[nstates+i] = max - min + 1; 377 state_count = NEW2(nstates, short); 419 for (i = 0; i < nstates; [all...] |
H A D | verbose.c | 68 for (i = 0; i < nstates; i++) 79 fprintf(verbose_file, "%d grammar rules, %d states\n", nrules - 2, nstates); 109 for (i = 0; i < nstates; i++)
|
H A D | lr0.c | 50 int nstates; variable 302 nstates = 1; 356 if (nstates >= SHRT_MAX) 365 p->number = nstates; 375 nstates++;
|
/freebsd-9.3-release/lib/libc/regex/ |
H A D | regexec.c | 152 #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®_LARGE))
|
H A D | regex2.h | 171 sopno nstates; /* = number of sops */ member in struct:re_guts
|
H A D | engine.c | 1120 for (i = 0; i < g->nstates; i++)
|
H A D | regcomp.c | 1369 g->nstates = p->slen;
|
/freebsd-9.3-release/sys/netpfil/ipfw/ |
H A D | ip_fw_dynamic.c | 1380 unsigned int nstates; local 1382 nstates = V_dyn_max; 1384 error = sysctl_handle_int(oidp, &nstates, 0, req); 1389 V_dyn_max = nstates; 1402 unsigned int nstates; local 1404 nstates = DYN_COUNT; 1406 error = sysctl_handle_int(oidp, &nstates, 0, req);
|
/freebsd-9.3-release/lib/libc/regex/grot/ |
H A D | debug.c | 32 fprintf(d, "%ld states", (long)g->nstates);
|
Completed in 77 milliseconds