dev/raidframe/rf_dagutils.c

151 	node->succedents = (nSucc) ? (RF_DagNode_t **) ptrs : NULL;
562 		printf("%d%s", node->succedents[i]->nodeNum,
589 		if (node->succedents[i]->visited == unvisited)
590 			rf_RecurPrintDAG(node->succedents[i], depth + 1, unvisited);
616 	unvisited = dag_h->succedents[0]->visited;
623 		printf("%d%s", dag_h->succedents[i]->nodeNum,
628 		if (dag_h->succedents[i]->visited == unvisited)
629 			rf_RecurPrintDAG(dag_h->succedents[i], 1, unvisited);
641 	unvisited = dag_h->succedents[0]->visited;
645 		node = dag_h->succedents[i];
647 			nnum = rf_RecurAssignNodeNums(dag_h->succedents[i], nnum, unvisited);
662 		if (node->succedents[i]->visited == unvisited) {
663 			num = rf_RecurAssignNodeNums(node->succedents[i], num, unvisited);
674 		if (dag_h->succedents[i]->dagHdr != newptr)
675 			rf_RecurResetDAGHeaderPointers(dag_h->succedents[i], newptr);
684 		if (node->succedents[i]->dagHdr != newptr)
685 			rf_RecurResetDAGHeaderPointers(node->succedents[i], newptr);
725 			printf("INVALID DAG: Terminator node has succedents\n");
730 			printf("INVALID DAG: Non-terminator node has no succedents\n");
735 		if (!node->succedents[i]) {
739 		scount[node->succedents[i]->nodeNum]++;
749 		if (node->succedents[i]->visited == unvisited) {
750 			if (rf_ValidateBranch(node->succedents[i], scount,
766 		if (node->succedents[i] == NULL) {
767 			printf("node=%lx node->succedents[%d] is NULL\n", (long) node, i);
770 		rf_ValidateBranchVisitedBits(node->succedents[i], unvisited, rl + 1);
781 	unvisited = dag->succedents[0]->visited;
784 		if (dag->succedents[i] == NULL) {
785 			printf("dag=%lx dag->succedents[%d] is NULL\n", (long) dag, i);
788 		rf_ValidateBranchVisitedBits(dag->succedents[i], unvisited, 0);
843 	unvisited = dag_h->succedents[0]->visited;
849 		if ((dag_h->succedents[i]->visited == unvisited)
850 		    && rf_ValidateBranch(dag_h->succedents[i], scount,
876 			printf("INVALID DAG: node %s has %d succedents but appears as an antecedent %d times\n",