Searched refs:inadequacyNode (Results 1 – 2 of 2) sorted by relevance
48 result->inadequacyNode = NULL; in AnnotationList__alloc_on_obstack()64 aver (0 <= ci && ci < self->inadequacyNode->contributionCount); in AnnotationList__isContributionAlways()106 if (self->inadequacyNode->id < (*node)->inadequacyNode->id) in AnnotationList__insertInto()108 else if ((*node)->inadequacyNode->id < self->inadequacyNode->id) in AnnotationList__insertInto()112 cmp == 0 && ci < self->inadequacyNode->contributionCount; in AnnotationList__insertInto()235 self->inadequacyNode->contributionCount, annotations_obstackp); in AnnotationList__computePredecessorAnnotations()236 annotation_node->inadequacyNode = self->inadequacyNode; in AnnotationList__computePredecessorAnnotations()241 for (ci = 0; ci < self->inadequacyNode->contributionCount; ++ci) in AnnotationList__computePredecessorAnnotations()244 InadequacyList__getContributionToken (self->inadequacyNode, ci) in AnnotationList__computePredecessorAnnotations()532 annotation_node->inadequacyNode = conflict_node; in AnnotationList__compute_from_inadequacies()[all …]
42 InadequacyList *inadequacyNode; member