Lines Matching refs:currId
470 void SubGraph::PullUpBegins (int currId, int baseId, int finalId, int procLabel,
475 nodeList[currNum]= currId;
476 rix= FindFromIndex (currId);
479 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
491 void SubGraph::ProcessBegins (int currId, int finalId, int procLabel,
496 nodeList[currNum]= currId;
497 rix= FindFromIndex (currId);
499 visitMark[currId]= 1;
502 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
504 PullUpBegins (arc[forwardList[rix]]->GetToId(), currId,
514 visitMark[currId]= 1;
542 void SubGraph::PullUpEnds (int currId, int baseId, int initialId, int procLabel,
547 nodeList[currNum]= currId;
548 rix= FindToIndex (currId);
551 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
563 void SubGraph::ProcessEnds (int currId, int initialId, int procLabel,
568 nodeList[currNum]= currId;
569 rix= FindToIndex (currId);
571 visitMark[currId]= 1;
574 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
576 PullUpEnds (arc[backwardList[rix]]->GetFromId(), currId,
585 visitMark[currId]= 1;
706 int SubGraph::IsDeterminized (int currId)
712 rix= FindFromIndex (currId);
715 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
778 bool SubGraph::PullUpTags (int currId, int baseId, int initialId,
784 nodeList[currNum]= currId;
785 rix= FindToIndex (currId);
788 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
802 void SubGraph::ProcessTags (int currId, int initialId, int *nodeList, int currNum,
807 nodeList[currNum]= currId;
808 rix= FindToIndex (currId);
810 visitMark[currId]= 1;
813 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
815 if (PullUpTags (arc[backwardList[rix]]->GetFromId(), currId, initialId,
825 visitMark[currId]= 1;
