HomeSort by relevance Sort by last modified time
    Searched refs:initialId (Results 1 - 4 of 4) sorted by null

  /external/srec/tools/grxmlcompile/
sub_grph.h 229 void PullUpEnds (int currId, int baseId, int initialId, int procLabel, int *nodeList, int currNum, int maxNum);
230 void ProcessEnds (int currId, int initialId, int procLabel, int *nodeList, int currNum, int *visitMark, int maxNum);
231 bool PullUpTags (int currId, int baseId, int initialId, int outTag, int *nodeList, int currNum, int maxNum);
232 void ProcessTags (int currId, int initialId, int *nodeList, int currNum, int *visitMark, int maxNum);
241 void RemoveUnvisitedArcs (int initialId, int finalId);
268 void ReverseMarkOutput (int currId, int initialId, int outId);
sub_grph.cpp 295 int initialId, finalId, ruleId, pos;
300 initialId= arc[ii]->GetFromId();
313 subList[ruleId]->startId, initialId, subList[ruleId]->lastId, finalId);
542 void SubGraph::PullUpEnds (int currId, int baseId, int initialId, int procLabel,
554 initialId, procLabel, nodeList, currNum+1, maxNum);
563 void SubGraph::ProcessEnds (int currId, int initialId, int procLabel,
577 initialId, procLabel, nodeList, currNum, maxNum);
580 if (nextId != initialId && checkEntry (nodeList, currNum, nextId) < 0
582 ProcessEnds (nextId, initialId, procLabel, nodeList, currNum+1, visitMark, maxNum);
778 bool SubGraph::PullUpTags (int currId, int baseId, int initialId,
    [all...]
sub_base.cpp 217 void SubGraph::RemoveUnvisitedArcs (int initialId, int finalId)
228 ForwardDepthData (initialId, forwardDepth, 1);
sub_phon.cpp 335 void SubGraph::ReverseMarkOutput (int currId, int initialId, int outId)
349 ReverseMarkOutput (arc[backwardList[rix]]->GetFromId(), initialId, outId);

Completed in 412 milliseconds