Lines Matching refs:contributions
33 * - \c contributions member is allocated with \c contribution_count
43 contribution_count * sizeof result->contributions[0];
45 offsetof (AnnotationList, contributions)
65 return self->contributions[ci] == NULL;
88 * - Two always-contributions are identical.
89 * - Two never-contributions are identical.
90 * - For two potential-contributions, sort on the contributions' kernel
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))
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],
351 /* If the predecessor has any contributions besides just "always" and
352 "never" contributions:
355 predecessor states. Moreover, all contributions that affect
357 or "never" contributions in order for the dominant contribution to
362 dominant contributions will have the same dominant contribution when
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],
512 /* If there are any contributions besides just "always" contributions:
524 annotation_node->contributions[contribution_count - 1] = NULL;
622 Sbitset__fprint (a->contributions[ci], nitems, stderr);
648 SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item)
685 SBITSET__FOR_EACH (self->contributions[ci], nitems, biter, item)
793 Fortunately, contributions are sorted by rule number. */
