/freebsd-10.1-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-10.1-release/contrib/nvi/regex/ |
H A D | regexec.c | 118 #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®_LARGE))
|
H A D | regex2.h | 148 sopno nstates; /* = number of sops */ member in struct:re_guts
|
H A D | engine.c | 1034 for (i = 0; i < g->nstates; i++)
|
H A D | regcomp.c | 1589 g->nstates = p->slen;
|
/freebsd-10.1-release/contrib/byacc/ |
H A D | mkpar.c | 51 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 D | graph.c | 22 for (i = 0; i < nstates; ++i) 29 for (i = 0; i < nstates; ++i)
|
H A D | output.c | 260 for (i = 1; i < nstates; i++) 283 if (nstates != 0) 285 translate = TMALLOC(int, nstates); 288 for (i = 0; i < nstates; ++i) 299 for (i = 1; i < nstates; ++i) 351 for (i = 0; i < nstates; ++i) 449 tally[nstates + i] = reducecount; 452 tally[2 * nstates + i] = conflictcount; 455 width[nstates + i] = 0; 458 width[2 * nstates [all...] |
H A D | lalr.c | 75 state_table = NEW2(nstates, core *); 85 accessing_symbol = NEW2(nstates, Value_t); 95 shift_table = NEW2(nstates, shifts *); 105 reduction_table = NEW2(nstates, reductions *); 144 lookaheads = NEW2(nstates + 1, Value_t); 147 for (i = 0; i < nstates; i++) 154 lookaheads[nstates] = (Value_t) k; 161 for (i = 0; i < nstates; i++) 534 n = lookaheads[nstates];
|
H A D | lr0.c | 19 int nstates; variable 243 nstates = 1; 294 if (nstates >= MAXYYINT) 303 p->number = (Value_t) nstates; 313 nstates++;
|
H A D | verbose.c | 30 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.1-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 | 1386 g->nstates = p->slen;
|
/freebsd-10.1-release/sys/netpfil/ipfw/ |
H A D | ip_fw_dynamic.c | 1379 unsigned int nstates; local 1381 nstates = V_dyn_max; 1383 error = sysctl_handle_int(oidp, &nstates, 0, req); 1388 V_dyn_max = nstates; 1401 unsigned int nstates; local 1403 nstates = DYN_COUNT; 1405 error = sysctl_handle_int(oidp, &nstates, 0, req);
|
/freebsd-10.1-release/lib/libc/regex/grot/ |
H A D | debug.c | 32 fprintf(d, "%ld states", (long)g->nstates);
|