| /external/openfst/src/include/fst/ |
| dfs-visit.h | 106 StateId nstates = start + 1; // # of known states in general case local
109 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
113 state_color.resize(nstates, kDfsWhite);
120 for (StateId root = start; dfs && root < nstates;) {
128 nstates = s + 1;
129 state_color.resize(nstates, kDfsWhite);
149 nstates = arc.nextstate + 1;
150 state_color.resize(nstates, kDfsWhite);
179 root < nstates && state_color[root] != kDfsWhite;
183 if (!expanded && root == nstates) {
[all...] |
| visit.h | 93 StateId nstates = start + 1; // # of known states in general case local
96 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
100 state_status.resize(nstates, kWhiteState);
101 arc_iterator.resize(nstates);
108 for (StateId root = start; visit && root < nstates;) {
115 nstates = s + 1;
116 state_status.resize(nstates, kWhiteState);
117 arc_iterator.resize(nstates);
139 nstates = arc.nextstate + 1;
140 state_status.resize(nstates, kWhiteState)
[all...] |
| expanded-fst.h | 180 typename Arc::StateId nstates = 0; local
182 ++nstates;
183 return nstates;
|
| replace-util.h | 110 // Replaces Fsts that have at most 'nstates' states, 'narcs' arcs and
113 void ReplaceBySize(size_t nstates, size_t narcs, size_t nnonterms);
137 StateId nstates; // # of states member in struct:fst::ReplaceUtil::ReplaceStats
149 : nstates(0),
287 ++stats_[i].nstates;
334 stats_[i].nstates += stats_[j].nstates * ni;
478 void ReplaceUtil<Arc>::ReplaceBySize(size_t nstates, size_t narcs,
491 if (stats_[j].nstates <= nstates &
[all...] |
| vector-fst.h | 85 StateId nstates = 0; local
88 newid[s] = nstates;
89 if (s != nstates)
90 states_[nstates] = states_[s];
91 ++nstates;
96 states_.resize(nstates);
146 data->nstates = states_.size();
|
| /external/llvm/lib/Support/ |
| 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))
|
| regex2.h | 135 sopno nstates; /* = number of sops */ member in struct:re_guts
|
| /ndk/sources/host-tools/ndk-stack/regex/ |
| regexec.c | 105 #define CLEAR(v) memset(v, 0, m->g->nstates)
109 #define ASSIGN(d, s) memcpy(d, s, m->g->nstates)
110 #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
112 #define STATESETUP(m, nv) { (m)->space = (char*)malloc((nv)*(m)->g->nstates); \
116 #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
156 if (g->nstates <= (int)(CHAR_BIT*sizeof(states1)) && !(eflags®_LARGE))
|
| regex2.h | 135 sopno nstates; /* = number of sops */ member in struct:re_guts
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| expanded-fst.h | 87 typename Arc::StateId nstates = 0; local
89 ++nstates;
90 return nstates;
|
| dfs-visit.h | 91 StateId nstates = CountStates(fst); local
93 while ((StateId)state_color.size() < nstates)
100 for (StateId root = start; dfs && root < nstates;) {
150 root < nstates && state_color[root] != kDfsWhite;
|
| vector-fst.h | 79 StateId nstates = 0; local
82 newid[s] = nstates;
83 if (s != nstates)
84 states_[nstates] = states_[s];
85 ++nstates;
90 states_.resize(nstates);
140 data->nstates = states_.size();
|
| fst.h | 234 typename A::StateId nstates; // O.w. total # of states member in struct:fst::StateIteratorData
260 return data_.base ? data_.base->Done() : s_ >= data_.nstates;
|
| /bionic/libc/upstream-netbsd/libc/regex/ |
| regexec.c | 158 #define CLEAR(v) memset(v, 0, (size_t)m->g->nstates)
162 #define ASSIGN(d, s) memcpy(d, s, (size_t)m->g->nstates)
163 #define EQ(a, b) (memcmp(a, b, (size_t)m->g->nstates) == 0)
166 if (((m)->space = malloc((size_t)((nv)*(m)->g->nstates))) == NULL) \
172 #define SETUP(v) ((v) = &m->space[(size_t)(m->vn++ * m->g->nstates)])
230 if (g->nstates <= (sopno)(CHAR_BIT*sizeof(states1)) && !(eflags®_LARGE))
|
| regex2.h | 187 sopno nstates; /* = number of sops */ member in struct:re_guts
|
| /external/bison/src/ |
| lalr.c | 88 for (s = 0; s < nstates; ++s)
122 for (s = 0; s < nstates; ++s)
382 for (i = 0; i < nstates; i++)
393 for (i = 0; i < nstates; i++)
415 for (i = 0; i < nstates; ++i)
460 for (s = 0; s < nstates; ++s)
|
| state.c | 120 state_number nstates = 0; variable
138 assert (nstates < STATE_NUMBER_MAXIMUM);
141 res->number = nstates++;
367 for (i = 0; i < nstates; ++i)
|
| conflicts.c | 312 conflicts = xcalloc (nstates, sizeof *conflicts);
317 for (i = 0; i < nstates; i++)
419 for (i = 0; i < nstates; i++)
449 for (i = 0; i < nstates; i++)
481 for (i = 0; i < nstates; i++)
|
| tables.c | 58 return state_number_as_int (nstates) + sym - ntokens;
428 yydefact = xnmalloc (nstates, sizeof *yydefact);
442 for (i = 0; i < nstates; ++i)
531 for (s = 0; s < nstates; s++)
537 for (s = 0; s < nstates; s++)
561 size_t *state_count = xnmalloc (nstates, sizeof *state_count);
626 if (nstates <= i)
809 verify (sizeof nstates <= sizeof nvectors
812 nvectors = state_number_as_int (nstates) + nvars;
|
| output.c | 269 symbol_number *values = xnmalloc (nstates, sizeof *values);
270 for (i = 0; i < nstates; ++i)
273 0, 1, nstates);
278 MUSCLE_INSERT_INT ("states_number", nstates);
453 yydefact[0], 1, nstates);
464 base[0], 1, nstates);
469 base[nstates], nstates + 1, nvectors);
|
| state.h | 37 state 0 and NSTATES is the number of states. (FIXME: This sentence
39 NSTATES indicates termination.) All the cores are chained together
219 extern state_number nstates;
|
| LR0.c | 68 nstates, sym, symbols[sym]->tag);
305 states = xcalloc (nstates, sizeof *states);
|
| print_graph.c | 221 for (i = 0; i < nstates; i++)
|
| print.c | 570 for (i = 0; i < nstates; i++)
|
| /external/openfst/src/test/ |
| fst_test.h | 260 // (I) NumStates() = nstates
270 void InitFst(MutableFst<Arc> *fst, size_t nstates) const {
272 CHECK_GT(nstates, 0);
274 for (StateId s = 0; s < nstates; ++s) {
|
