Lines Matching full:states
181 dict->states = hnj_realloc (dict->states,
185 dict->states[dict->num_states].match = NULL;
186 dict->states[dict->num_states].repl = NULL;
187 dict->states[dict->num_states].fallback_state = -1;
188 dict->states[dict->num_states].num_trans = 0;
189 dict->states[dict->num_states].trans = NULL;
200 num_trans = dict->states[state1].num_trans;
203 dict->states[state1].trans = hnj_malloc (sizeof(HyphenTrans));
207 dict->states[state1].trans = hnj_realloc (dict->states[state1].trans,
211 dict->states[state1].trans[num_trans].ch = ch;
212 dict->states[state1].trans[num_trans].new_state = state2;
213 dict->states[state1].num_trans++;
310 dict[k]->states = hnj_malloc (sizeof(HyphenState));
311 dict[k]->states[0].match = NULL;
312 dict[k]->states[0].repl = NULL;
313 dict[k]->states[0].fallback_state = -1;
314 dict[k]->states[0].num_trans = 0;
315 dict[k]->states[0].trans = NULL;
425 dict[k]->states[state_num].match = hnj_strdup (pattern + i);
426 dict[k]->states[state_num].repl = repl;
427 dict[k]->states[state_num].replindex = replindex;
429 dict[k]->states[state_num].replcut = strlen(word);
431 dict[k]->states[state_num].replcut = replcut;
465 /* put in the fallback states */
477 dict[k]->states[e->val].fallback_state = state_num;
484 dict[k]->states[e->val].fallback_state);
485 for (j = 0; j < dict[k]->states[e->val].num_trans; j++)
486 printf (" %c->%d\n", dict[k]->states[e->val].trans[j].ch,
487 dict[k]->states[e->val].trans[j].new_state);
507 hstate = &dict->states[state_num];
517 hnj_free (dict->states);
582 hstate = &dict->states[state];
601 match = dict->states[state].match;
603 if (match && !dict->states[state].repl)
782 hstate = &dict->states[state];
801 match = dict->states[state].match;
802 repl = dict->states[state].repl;
803 replindex = dict->states[state].replindex;
804 replcut = dict->states[state].replcut;
