Lines Matching refs:ci
62 ContributionIndex ci) in AnnotationList__isContributionAlways() argument
64 aver (0 <= ci && ci < self->inadequacyNode->contributionCount); in AnnotationList__isContributionAlways()
65 return self->contributions[ci] == NULL; in AnnotationList__isContributionAlways()
105 ContributionIndex ci; in AnnotationList__insertInto() local
111 for (ci = 0; in AnnotationList__insertInto()
112 cmp == 0 && ci < self->inadequacyNode->contributionCount; in AnnotationList__insertInto()
113 ++ci) in AnnotationList__insertInto()
115 if (AnnotationList__isContributionAlways (self, ci)) in AnnotationList__insertInto()
117 if (!AnnotationList__isContributionAlways (*node, ci)) in AnnotationList__insertInto()
120 else if (AnnotationList__isContributionAlways (*node, ci)) in AnnotationList__insertInto()
127 if (!Sbitset__test (self->contributions[ci], item)) in AnnotationList__insertInto()
129 if (Sbitset__test ((*node)->contributions[ci], item)) in AnnotationList__insertInto()
132 else if (!Sbitset__test ((*node)->contributions[ci], item)) in AnnotationList__insertInto()
240 ContributionIndex ci; in AnnotationList__computePredecessorAnnotations() local
241 for (ci = 0; ci < self->inadequacyNode->contributionCount; ++ci) in AnnotationList__computePredecessorAnnotations()
244 InadequacyList__getContributionToken (self->inadequacyNode, ci) in AnnotationList__computePredecessorAnnotations()
246 if (AnnotationList__isContributionAlways (self, ci)) in AnnotationList__computePredecessorAnnotations()
248 annotation_node->contributions[ci] = NULL; in AnnotationList__computePredecessorAnnotations()
251 annotation_node->contributions[ci] = in AnnotationList__computePredecessorAnnotations()
258 SBITSET__FOR_EACH (self->contributions[ci], s->nitems, in AnnotationList__computePredecessorAnnotations()
291 annotation_node->contributions[ci]); in AnnotationList__computePredecessorAnnotations()
292 annotation_node->contributions[ci] = NULL; in AnnotationList__computePredecessorAnnotations()
297 Sbitset__or (annotation_node->contributions[ci], in AnnotationList__computePredecessorAnnotations()
298 annotation_node->contributions[ci], in AnnotationList__computePredecessorAnnotations()
322 Sbitset__set (annotation_node->contributions[ci], in AnnotationList__computePredecessorAnnotations()
327 if (annotation_node->contributions[ci]) in AnnotationList__computePredecessorAnnotations()
331 SBITSET__FOR_EACH (annotation_node->contributions[ci], in AnnotationList__computePredecessorAnnotations()
462 ContributionIndex ci = 0; in AnnotationList__compute_from_inadequacies() local
475 annotation_node->contributions[ci] = in AnnotationList__compute_from_inadequacies()
489 Sbitset__set (annotation_node->contributions[ci], item_i); in AnnotationList__compute_from_inadequacies()
497 &annotation_node->contributions[ci], in AnnotationList__compute_from_inadequacies()
500 annotation_node->contributions[ci++] = NULL; in AnnotationList__compute_from_inadequacies()
504 aver (!Sbitset__isEmpty (annotation_node->contributions[ci], in AnnotationList__compute_from_inadequacies()
506 ++ci; in AnnotationList__compute_from_inadequacies()
591 ContributionIndex ci; in AnnotationList__debug() local
594 for (ci = 0; ci < a->inadequacyNode->contributionCount; ++ci) in AnnotationList__debug()
597 InadequacyList__getContributionToken (a->inadequacyNode, ci) in AnnotationList__debug()
604 if (ci == InadequacyList__getShiftContributionIndex ( in AnnotationList__debug()
617 if (AnnotationList__isContributionAlways (a, ci)) in AnnotationList__debug()
622 Sbitset__fprint (a->contributions[ci], nitems, stderr); in AnnotationList__debug()
639 ContributionIndex ci; in AnnotationList__computeLookaheadFilter() local
640 for (ci = 0; ci < self->inadequacyNode->contributionCount; ++ci) in AnnotationList__computeLookaheadFilter()
641 if (!AnnotationList__isContributionAlways (self, ci)) in AnnotationList__computeLookaheadFilter()
646 InadequacyList__getContributionToken (self->inadequacyNode, ci) in AnnotationList__computeLookaheadFilter()
648 SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item) in AnnotationList__computeLookaheadFilter()
673 size_t nitems, ContributionIndex ci, in AnnotationList__stateMakesContribution() argument
676 if (AnnotationList__isContributionAlways (self, ci)) in AnnotationList__stateMakesContribution()
682 InadequacyList__getContributionToken (self->inadequacyNode, ci)->number; in AnnotationList__stateMakesContribution()
685 SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item) in AnnotationList__stateMakesContribution()
709 ContributionIndex ci; in AnnotationList__computeDominantContribution() local
721 for (ci = 0, actioni = bitset_first (self->inadequacyNode->inadequacy in AnnotationList__computeDominantContribution()
723 ci < self->inadequacyNode->contributionCount; in AnnotationList__computeDominantContribution()
724 ++ci, actioni = bitset_next (self->inadequacyNode->inadequacy in AnnotationList__computeDominantContribution()
728 if (ci == ci_shift) in AnnotationList__computeDominantContribution()
744 if (!AnnotationList__stateMakesContribution (self, nitems, ci, in AnnotationList__computeDominantContribution()
757 || AnnotationList__isContributionAlways (self, ci)) in AnnotationList__computeDominantContribution()
764 ci_rr_dominator = ci; in AnnotationList__computeDominantContribution()
779 if (AnnotationList__isContributionAlways (self, ci)) in AnnotationList__computeDominantContribution()
795 ContributionIndex ci; in AnnotationList__computeDominantContribution() local
796 for (ci = 0; ci < self->inadequacyNode->contributionCount; ++ci) in AnnotationList__computeDominantContribution()
797 if (AnnotationList__stateMakesContribution (self, nitems, ci, in AnnotationList__computeDominantContribution()
801 && !AnnotationList__isContributionAlways (self, ci)) in AnnotationList__computeDominantContribution()
803 return ci; in AnnotationList__computeDominantContribution()