376     int *nodeList= new int [numVertex];  in RemoveRuleStarts()  local
382     ProcessBegins (startPoint, endPoint, BEGINRULE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveRuleStarts()
385     delete [] nodeList;  in RemoveRuleStarts()
397     int *nodeList= new int [numVertex];  in RemoveRuleEnds()  local
403     ProcessEnds (endPoint, startPoint, ENDRULE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveRuleEnds()
406     delete [] nodeList;  in RemoveRuleEnds()
418     int *nodeList= new int [numVertex];  in RemoveNulls()  local
424     ProcessBegins (startPoint, endPoint, NONE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveNulls()
427     delete [] nodeList;  in RemoveNulls()
455     int *nodeList= new int [numVertex];  in RemoveForwardConnections()  local
461     ProcessBegins (startPoint, endPoint, BEGINSCOPE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveForwardConnections()
465     delete [] nodeList;  in RemoveForwardConnections()
471                              int *nodeList, int currNum, int maxNum)  in PullUpBegins()  argument
475     nodeList[currNum]= currId;  in PullUpBegins()
482                                 finalId, procLabel, nodeList, currNum+1, maxNum);  in PullUpBegins()
492                               int *nodeList, int currNum, int *visitMark, int maxNum)  in ProcessBegins()  argument
496     nodeList[currNum]= currId;  in ProcessBegins()
505                         finalId, procLabel, nodeList, currNum, maxNum);  in ProcessBegins()
509         if (nextId >= 0 && nextId != finalId && checkEntry (nodeList, currNum, nextId) < 0  in ProcessBegins()
511             ProcessBegins (nextId, finalId, procLabel, nodeList, currNum+1, visitMark, maxNum);  in ProcessBegins()
527     int *nodeList= new int [numVertex];  in RemoveBackwardConnections()  local
533     ProcessEnds (endPoint, startPoint, ENDSCOPE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveBackwardConnections()
537     delete [] nodeList;  in RemoveBackwardConnections()
543                            int *nodeList, int currNum, int maxNum)  in PullUpEnds()  argument
547     nodeList[currNum]= currId;  in PullUpEnds()
554                                 initialId, procLabel, nodeList, currNum+1, maxNum);  in PullUpEnds()
564                             int *nodeList, int currNum, int *visitMark, int maxNum)  in ProcessEnds()  argument
568     nodeList[currNum]= currId;  in ProcessEnds()
577                         initialId, procLabel, nodeList, currNum, maxNum);  in ProcessEnds()
580         if (nextId != initialId && checkEntry (nodeList, currNum, nextId) < 0  in ProcessEnds()
582             ProcessEnds (nextId, initialId, procLabel, nodeList, currNum+1, visitMark, maxNum);  in ProcessEnds()
763     int *nodeList= new int [numVertex];  in RemoveTagConnections()  local
769     ProcessTags (endPoint, startPoint, nodeList, 0, visitList, numVertex);  in RemoveTagConnections()
773     delete [] nodeList;  in RemoveTagConnections()
779                            int outTag, int *nodeList, int currNum, int maxNum)  in PullUpTags()  argument
784     nodeList[currNum]= currId;  in PullUpTags()
791                 arc[backwardList[rix]]->GetOutput(), nodeList, currNum+1, maxNum))  in PullUpTags()
802 void SubGraph::ProcessTags (int currId, int initialId, int *nodeList, int currNum,  in ProcessTags()  argument
807     nodeList[currNum]= currId;  in ProcessTags()
816                 arc[backwardList[rix]]->GetOutput(), nodeList, currNum, maxNum))  in ProcessTags()
820         if (nextId != initialId && checkEntry (nodeList, currNum, nextId) < 0  in ProcessTags()
822             ProcessTags (nextId, initialId, nodeList, currNum+1, visitMark, maxNum);  in ProcessTags()