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

12

/external/openfst/src/include/fst/
H A Ddfs-visit.h106 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;
184 if (!expanded && root == nstates) {
[all...]
H A Dvisit.h93 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, kWhiteStat
[all...]
H A Dreplace-util.h110 // 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, argument
491 if (stats_[j].nstates <= nstates
[all...]
H A Dexpanded-fst.h180 typename Arc::StateId nstates = 0; local
182 ++nstates;
183 return nstates;
H A Dvector-fst.h85 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();
H A Dcache.h325 StateId nstates = 0; local
328 newid[s] = nstates;
329 ++nstates;
/external/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.h138 sopno nstates; /* = number of sops */ member in struct:re_guts
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dexpanded-fst.h87 typename Arc::StateId nstates = 0; local
89 ++nstates;
90 return nstates;
H A Ddfs-visit.h91 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;
H A Dvector-fst.h79 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();
H A Dfst.h234 typename A::StateId nstates; // O.w. total # of states member in struct:fst::StateIteratorData
260 return data_.base ? data_.base->Done() : s_ >= data_.nstates;
/external/bison/src/
H A Dstate.c118 state_number nstates = 0; variable
136 aver (nstates < STATE_NUMBER_MAXIMUM);
139 res->number = nstates++;
163 aver (nstates < STATE_NUMBER_MAXIMUM);
166 res->number = nstates++;
428 bitset reachable = bitset_create (nstates, BITSET_FIXED);
432 for (i = 0; i < nstates; ++i)
443 old_to_new[i] = nstates;
447 nstates = nstates_reachable;
463 for (i = 0; i < nstates;
[all...]
H A Dielr.c202 for (i = 0; i < nstates; ++i)
295 * - \c result is a new array of size \c ::nstates.
304 int *predecessor_counts = xnmalloc (nstates, sizeof *predecessor_counts);
305 state ***result = xnmalloc (nstates, sizeof *result);
306 for (i = 0; i < nstates; ++i)
308 for (i = 0; i < nstates; ++i)
314 for (i = 0; i < nstates; ++i)
320 for (i = 0; i < nstates; ++i)
473 * points to a new array of size \c ::nstates.
474 * - For <tt>0 <= i < ::nstates</t
[all...]
H A Dmain.c130 state_number *old_to_new = xnmalloc (nstates, sizeof *old_to_new);
131 state_number nstates_old = nstates;
H A Dtables.c56 return state_number_as_int (nstates) + sym - ntokens;
438 yydefact = xnmalloc (nstates, sizeof *yydefact);
452 for (i = 0; i < nstates; ++i)
541 for (s = 0; s < nstates; s++)
547 for (s = 0; s < nstates; s++)
571 size_t *state_count = xnmalloc (nstates, sizeof *state_count);
636 if (nstates <= i)
819 verify (sizeof nstates <= sizeof nvectors
822 nvectors = state_number_as_int (nstates) + nvars;
H A Dlalr.c82 for (s = 0; s < nstates; ++s)
116 for (s = 0; s < nstates; ++s)
382 for (i = 0; i < nstates; i++)
394 for (i = 0; i < nstates; i++)
418 for (i = 0; i < nstates; ++i)
498 for (s = 0; s < nstates; ++s)
H A Doutput.c281 symbol_number *values = xnmalloc (nstates, sizeof *values);
282 for (i = 0; i < nstates; ++i)
285 0, 1, nstates);
290 MUSCLE_INSERT_INT ("states_number", nstates);
439 yydefact[0], 1, nstates);
450 base[0], 1, nstates);
455 base[nstates], nstates + 1, nvectors);
H A Dconflicts.c392 conflicts = xcalloc (nstates, sizeof *conflicts);
398 for (i = 0; i < nstates; i++)
511 for (i = 0; i < nstates; i++)
541 for (i = 0; i < nstates; i++)
573 for (i = 0; i < nstates; i++)
H A Dstate.h226 extern state_number nstates;
H A DLR0.c65 nstates, sym, symbols[sym]->tag);
306 states = xcalloc (nstates, sizeof *states);
H A Dprint_graph.c204 for (i = 0; i < nstates; i++)
H A Dprint-xml.c525 for (i = 0; i < nstates; i++)
H A Dprint.c525 for (i = 0; i < nstates; i++)
/external/openfst/src/test/
H A Dfst_test.h301 // (I) NumStates() = nstates
311 void InitFst(MutableFst<Arc> *fst, size_t nstates) const {
313 CHECK_GT(nstates, 0);
315 for (StateId s = 0; s < nstates; ++s) {

Completed in 1137 milliseconds

12