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