Lines Matching refs:nitems
203 if (states[i]->nitems > max_nitems)
204 max_nitems = states[i]->nitems;
211 size_t nitems = states[from_state[i]]->nitems;
214 for (j = 0; j < nitems; ++j)
386 xnmalloc (s->nitems, sizeof item_lookahead_sets[s->number][0]);
387 for (i = 0; i < s->nitems; ++i)
447 predecessor_item < (*predecessor)->nitems;
452 aver (predecessor_item != (*predecessor)->nitems);
529 states[i]->nitems, 2);
543 for (j = 0; j < states[i]->nitems; ++j)
620 for (t_item = 0; t_item < t->nitems; ++t_item)
649 for (; s_item < s->state->nitems; ++s_item)
652 aver (s_item != s->state->nitems);
719 a, lr0_isocore->state->nitems, lookaheads, false);
741 a, lr0_isocore->state->nitems,
753 for (i = 0; i < t->nitems; ++i)
767 if (i == t->nitems)
776 for (i = 0; i < lr0_isocore->state->nitems; ++i)
798 xnmalloc (t->nitems, sizeof (*this_isocorep)->lookaheads);
799 for (i = 0; i < t->nitems; ++i)
802 for (i = 0; i < t->nitems; ++i)
846 t2->nitems, work2);
923 xnmalloc (t->nitems, sizeof (*last_statep)->lookaheads);
924 for (i = 0; i < t->nitems; ++i)
983 if (states[i]->nitems > max_nitems)
984 max_nitems = states[i]->nitems;
1007 t->nitems, lookahead_filter);
1063 aver (i < node->state->nitems);
1080 for (i = 0; i < node->state->nitems; ++i)
