99                             size_t nitems)  in AnnotationList__insertInto()  argument
125                 for (item = 0; cmp == 0 && item < nitems; ++item)  in AnnotationList__insertInto()
205   *items = Sbitset__new_on_obstack (s->nitems, annotations_obstackp);  in AnnotationList__compute_lhs_contributions()
252               Sbitset__new_on_obstack ((*predecessor)->nitems,  in AnnotationList__computePredecessorAnnotations()
258               SBITSET__FOR_EACH (self->contributions[ci], s->nitems,  in AnnotationList__computePredecessorAnnotations()
299                                        items, (*predecessor)->nitems);  in AnnotationList__computePredecessorAnnotations()
311                            predecessor_item < (*predecessor)->nitems;  in AnnotationList__computePredecessorAnnotations()
316                       aver (predecessor_item != (*predecessor)->nitems);  in AnnotationList__computePredecessorAnnotations()
332                                    (*predecessor)->nitems, biter, i)  in AnnotationList__computePredecessorAnnotations()
338                         lookaheads = xnmalloc ((*predecessor)->nitems,  in AnnotationList__computePredecessorAnnotations()
340                         for (j = 0; j < (*predecessor)->nitems; ++j)  in AnnotationList__computePredecessorAnnotations()
374                    annotation_node, (*predecessor)->nitems, lookaheads, true))  in AnnotationList__computePredecessorAnnotations()
381             for (i = 0; i < (*predecessor)->nitems; ++i)  in AnnotationList__computePredecessorAnnotations()
391                                               (*predecessor)->nitems))  in AnnotationList__computePredecessorAnnotations()
429   all_lookaheads = bitsetv_create (s->nitems, ntokens, BITSET_FIXED);  in AnnotationList__compute_from_inadequacies()
476                       Sbitset__new_on_obstack (s->nitems,  in AnnotationList__compute_from_inadequacies()
487                         aver (item_i < s->nitems);  in AnnotationList__compute_from_inadequacies()
505                                          s->nitems));  in AnnotationList__compute_from_inadequacies()
535                      annotation_node, s->nitems, all_lookaheads, true))  in AnnotationList__compute_from_inadequacies()
546                         s->nitems));  in AnnotationList__compute_from_inadequacies()
577 AnnotationList__debug (AnnotationList const *self, size_t nitems, int spaces)  in AnnotationList__debug()  argument
622                     Sbitset__fprint (a->contributions[ci], nitems, stderr);  in AnnotationList__debug()
633                                         size_t nitems,  in AnnotationList__computeLookaheadFilter()  argument
648             SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item)  in AnnotationList__computeLookaheadFilter()
673                                         size_t nitems, ContributionIndex ci,  in AnnotationList__stateMakesContribution()  argument
685     SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item)  in AnnotationList__stateMakesContribution()
694                                              size_t nitems, bitset *lookaheads,  in AnnotationList__computeDominantContribution()  argument
744             if (!AnnotationList__stateMakesContribution (self, nitems, ci,  in AnnotationList__computeDominantContribution()
797       if (AnnotationList__stateMakesContribution (self, nitems, ci,  in AnnotationList__computeDominantContribution()