Home
last modified time | relevance | path

Searched refs:nstates (Results 1 – 25 of 30) sorted by relevance

12

/external/openfst/src/include/fst/
Dvisit.h93 StateId nstates = start + 1; // # of known states in general case in Visit() local
96 nstates = CountStates(fst); // uses ExpandedFst::NumStates(). in Visit()
100 state_status.resize(nstates, kWhiteState); in Visit()
101 arc_iterator.resize(nstates); in Visit()
108 for (StateId root = start; visit && root < nstates;) { in Visit()
115 nstates = s + 1; in Visit()
116 state_status.resize(nstates, kWhiteState); in Visit()
117 arc_iterator.resize(nstates); in Visit()
139 nstates = arc.nextstate + 1; in Visit()
140 state_status.resize(nstates, kWhiteState); in Visit()
[all …]
Ddfs-visit.h106 StateId nstates = start + 1; // # of known states in general case in DfsVisit() local
109 nstates = CountStates(fst); // uses ExpandedFst::NumStates(). in DfsVisit()
113 state_color.resize(nstates, kDfsWhite); in DfsVisit()
120 for (StateId root = start; dfs && root < nstates;) { in DfsVisit()
128 nstates = s + 1; in DfsVisit()
129 state_color.resize(nstates, kDfsWhite); in DfsVisit()
149 nstates = arc.nextstate + 1; in DfsVisit()
150 state_color.resize(nstates, kDfsWhite); in DfsVisit()
179 root < nstates && state_color[root] != kDfsWhite; in DfsVisit()
184 if (!expanded && root == nstates) { in DfsVisit()
[all …]
Dreplace-util.h113 void ReplaceBySize(size_t nstates, size_t narcs, size_t nnonterms);
137 StateId nstates; // # of states member
149 : nstates(0), in ReplaceStats()
287 ++stats_[i].nstates; in GetDependencies()
334 stats_[i].nstates += stats_[j].nstates * ni; in UpdateStats()
478 void ReplaceUtil<Arc>::ReplaceBySize(size_t nstates, size_t narcs, in ReplaceBySize() argument
491 if (stats_[j].nstates <= nstates && in ReplaceBySize()
Dexpanded-fst.h180 typename Arc::StateId nstates = 0; in CountStates() local
182 ++nstates; in CountStates()
183 return nstates; in CountStates()
Dvector-fst.h85 StateId nstates = 0; in DeleteStates() local
88 newid[s] = nstates; in DeleteStates()
89 if (s != nstates) in DeleteStates()
90 states_[nstates] = states_[s]; in DeleteStates()
91 ++nstates; in DeleteStates()
96 states_.resize(nstates); in DeleteStates()
146 data->nstates = states_.size(); in InitStateIterator()
Dcache.h325 StateId nstates = 0; in DeleteStates() local
328 newid[s] = nstates; in DeleteStates()
329 ++nstates; in DeleteStates()
Dfst.h327 typename A::StateId nstates; // O.w. total # of states member
354 return data_.base ? data_.base->Done() : s_ >= data_.nstates; in Done()
Dconst-fst.h97 data->nstates = nstates_; in InitStateIterator()
Dedit-fst.h572 data->nstates = NumStates(); in InitStateIterator()
/external/bison/src/
Dstate.c118 state_number nstates = 0; variable
136 aver (nstates < STATE_NUMBER_MAXIMUM); in state_new()
139 res->number = nstates++; in state_new()
163 aver (nstates < STATE_NUMBER_MAXIMUM); in state_new_isocore()
166 res->number = nstates++; in state_new_isocore()
428 bitset reachable = bitset_create (nstates, BITSET_FIXED); in state_remove_unreachable_states()
432 for (i = 0; i < nstates; ++i) in state_remove_unreachable_states()
443 old_to_new[i] = nstates; in state_remove_unreachable_states()
447 nstates = nstates_reachable; in state_remove_unreachable_states()
463 for (i = 0; i < nstates; ++i) in states_free()
Dielr.c202 for (i = 0; i < nstates; ++i) in ielr_compute_follow_kernel_items()
304 int *predecessor_counts = xnmalloc (nstates, sizeof *predecessor_counts); in ielr_compute_predecessors()
305 state ***result = xnmalloc (nstates, sizeof *result); in ielr_compute_predecessors()
306 for (i = 0; i < nstates; ++i) in ielr_compute_predecessors()
308 for (i = 0; i < nstates; ++i) in ielr_compute_predecessors()
314 for (i = 0; i < nstates; ++i) in ielr_compute_predecessors()
320 for (i = 0; i < nstates; ++i) in ielr_compute_predecessors()
491 xnmalloc (nstates, sizeof *item_lookahead_sets); in ielr_compute_annotation_lists()
493 xnmalloc (nstates, sizeof *annotation_counts); in ielr_compute_annotation_lists()
498 *inadequacy_listsp = xnmalloc (nstates, sizeof **inadequacy_listsp); in ielr_compute_annotation_lists()
[all …]
Dtables.c56 return state_number_as_int (nstates) + sym - ntokens; in symbol_number_to_vector_number()
438 yydefact = xnmalloc (nstates, sizeof *yydefact); in token_actions()
452 for (i = 0; i < nstates; ++i) in token_actions()
541 for (s = 0; s < nstates; s++) in default_goto()
547 for (s = 0; s < nstates; s++) in default_goto()
571 size_t *state_count = xnmalloc (nstates, sizeof *state_count); in goto_actions()
636 if (nstates <= i) in matching_state()
818 verify (sizeof nstates <= sizeof nvectors in tables_generate()
821 nvectors = state_number_as_int (nstates) + nvars; in tables_generate()
Doutput.c281 symbol_number *values = xnmalloc (nstates, sizeof *values); in prepare_states()
282 for (i = 0; i < nstates; ++i) in prepare_states()
285 0, 1, nstates); in prepare_states()
290 MUSCLE_INSERT_INT ("states_number", nstates); in prepare_states()
439 yydefact[0], 1, nstates); in prepare_actions()
450 base[0], 1, nstates); in prepare_actions()
455 base[nstates], nstates + 1, nvectors); in prepare_actions()
Dlalr.c82 for (s = 0; s < nstates; ++s) in set_goto_map()
116 for (s = 0; s < nstates; ++s) in set_goto_map()
382 for (i = 0; i < nstates; i++) in initialize_LA()
394 for (i = 0; i < nstates; i++) in initialize_LA()
418 for (i = 0; i < nstates; ++i) in lookahead_tokens_print()
498 for (s = 0; s < nstates; ++s) in lalr_free()
Dconflicts.c391 conflicts = xcalloc (nstates, sizeof *conflicts); in conflicts_solve()
397 for (i = 0; i < nstates; i++) in conflicts_solve()
510 for (i = 0; i < nstates; i++) in conflicts_output()
540 for (i = 0; i < nstates; i++) in conflicts_total_count()
572 for (i = 0; i < nstates; i++) in conflicts_print()
Dmain.c130 state_number *old_to_new = xnmalloc (nstates, sizeof *old_to_new); in main()
131 state_number nstates_old = nstates; in main()
DLR0.c65 nstates, sym, symbols[sym]->tag); in state_list_append()
304 states = xcalloc (nstates, sizeof *states); in set_states()
Dstate.h226 extern state_number nstates;
Dprint_graph.c203 for (i = 0; i < nstates; i++) in print_graph()
Dprint-xml.c525 for (i = 0; i < nstates; i++) in print_xml()
Dprint.c522 for (i = 0; i < nstates; i++) in print_results()
/external/llvm/lib/Support/
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)) in llvm_regexec()
Dregex2.h138 sopno nstates; /* = number of sops */ member
/external/openfst/src/test/
Dfst_test.h311 void InitFst(MutableFst<Arc> *fst, size_t nstates) const { in InitFst() argument
313 CHECK_GT(nstates, 0); in InitFst()
315 for (StateId s = 0; s < nstates; ++s) { in InitFst()
/external/libxml2/os400/iconv/bldcsndfa/
Dbldcsndfa.c1740 unsigned int nstates; in generate() local
1753 nstates = 0; in generate()
1758 s->s_index = nstates++; in generate()
1761 maxfinal = nstates; in generate()
1769 nstates, maxfinal, ntrans); in generate()
1771 nstates, maxfinal, ntrans); in generate()
1778 fprintf(fp, "typedef %-23s t_staterange;\n", inttype(nstates)); in generate()
1844 fprintf(fp, " %u\n};\n\n", nstates); in generate()
1867 fprintf(fp, "\n};\n", nstates); in generate()

12