Lines Matching defs:unvisited
551 rf_RecurPrintDAG(RF_DagNode_t *node, int depth, int unvisited)
556 node->visited = (unvisited) ? 0 : 1;
589 if (node->succedents[i]->visited == unvisited)
590 rf_RecurPrintDAG(node->succedents[i], depth + 1, unvisited);
597 int unvisited, i;
616 unvisited = dag_h->succedents[0]->visited;
628 if (dag_h->succedents[i]->visited == unvisited)
629 rf_RecurPrintDAG(dag_h->succedents[i], 1, unvisited);
637 int unvisited, i, nnum;
641 unvisited = dag_h->succedents[0]->visited;
646 if (node->visited == unvisited) {
647 nnum = rf_RecurAssignNodeNums(dag_h->succedents[i], nnum, unvisited);
654 rf_RecurAssignNodeNums(RF_DagNode_t *node, int num, int unvisited)
658 node->visited = (unvisited) ? 0 : 1;
662 if (node->succedents[i]->visited == unvisited) {
663 num = rf_RecurAssignNodeNums(node->succedents[i], num, unvisited);
703 RF_DagNode_t **nodes, int unvisited)
708 node->visited = (unvisited) ? 0 : 1;
749 if (node->succedents[i]->visited == unvisited) {
751 acount, nodes, unvisited)) {
760 rf_ValidateBranchVisitedBits(RF_DagNode_t *node, int unvisited, int rl)
764 RF_ASSERT(node->visited == unvisited);
770 rf_ValidateBranchVisitedBits(node->succedents[i], unvisited, rl + 1);
779 int i, unvisited;
781 unvisited = dag->succedents[0]->visited;
788 rf_ValidateBranchVisitedBits(dag->succedents[i], unvisited, 0);
814 int unvisited;
843 unvisited = dag_h->succedents[0]->visited;
849 if ((dag_h->succedents[i]->visited == unvisited)
851 acount, nodes, unvisited)) {