Lines Matching defs:val
89 int val;
140 hnj_hash_insert (HashTab *hashtab, const char *key, int val)
149 e->val = val;
153 /* return val if found, otherwise -1 */
162 return e->val;
227 if (e->val == state)
476 if (e->val)
477 dict[k]->states[e->val].fallback_state = state_num;
483 printf ("%d string %s state %d, fallback=%d\n", i, e->key, e->val,
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);
