Lines Matching defs:nitems
72 * that state has \c nitems kernel items.
99 size_t nitems)
125 for (item = 0; cmp == 0 && item < nitems; ++item)
205 *items = Sbitset__new_on_obstack (s->nitems, annotations_obstackp);
252 Sbitset__new_on_obstack ((*predecessor)->nitems,
258 SBITSET__FOR_EACH (self->contributions[ci], s->nitems,
299 items, (*predecessor)->nitems);
311 predecessor_item < (*predecessor)->nitems;
316 aver (predecessor_item != (*predecessor)->nitems);
332 (*predecessor)->nitems, biter, i)
338 lookaheads = xnmalloc ((*predecessor)->nitems,
340 for (j = 0; j < (*predecessor)->nitems; ++j)
374 annotation_node, (*predecessor)->nitems, lookaheads, true))
381 for (i = 0; i < (*predecessor)->nitems; ++i)
391 (*predecessor)->nitems))
429 all_lookaheads = bitsetv_create (s->nitems, ntokens, BITSET_FIXED);
476 Sbitset__new_on_obstack (s->nitems,
487 aver (item_i < s->nitems);
505 s->nitems));
535 annotation_node, s->nitems, all_lookaheads, true))
546 s->nitems));
577 AnnotationList__debug (AnnotationList const *self, size_t nitems, int spaces)
622 Sbitset__fprint (a->contributions[ci], nitems, stderr);
633 size_t nitems,
648 SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item)
657 * - \c nitems is the number of kernel items in the LR(0) state that \c self
663 * - For any <tt>0 <= i < nitems</tt>, <tt>lookaheads[i]</tt> is either:
673 size_t nitems, ContributionIndex ci,
685 SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item)
694 size_t nitems, bitset *lookaheads,
744 if (!AnnotationList__stateMakesContribution (self, nitems, ci,
797 if (AnnotationList__stateMakesContribution (self, nitems, ci,