HomeSort by relevance Sort by last modified time
    Searched full:baseid (Results 1 - 19 of 19) sorted by null

  /external/srec/tools/grxmlcompile/
sub_min.cpp 182 void SubGraph::DeterminizeAtVertex (int baseId, DetCache *cache)
186 fix= FindFromIndex (baseId);
193 while (vertEnd < sortNum && arc[forwardList[vertEnd]]->GetFromId() == baseId) {
200 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == baseId) {
203 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == baseId
210 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != baseId)
218 while (six < sortNum && arc[forwardList[six]]->GetFromId() == baseId) {
221 while (six < sortNum && arc[forwardList[six]]->GetFromId() == baseId
228 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != baseId)
239 if (PairwiseDeterminize (baseId, firstId, fix, secondId, six, cache) > 0)
    [all...]
sub_grph.h 227 void PullUpBegins (int currId, int baseId, int endId, int procLabel, int *nodeList, int currNum, int maxNum);
229 void PullUpEnds (int currId, int baseId, int initialId, int procLabel, int *nodeList, int currNum, int maxNum);
231 bool PullUpTags (int currId, int baseId, int initialId, int outTag, int *nodeList, int currNum, int maxNum);
262 void DeterminizeAtVertex (int baseId, DetCache *cache);
263 int PairwiseDeterminize (int baseId, int firstId, int fixStart, int secondId, int sixStart, DetCache *cache);
sub_grph.cpp 470 void SubGraph::PullUpBegins (int currId, int baseId, int finalId, int procLabel,
481 PullUpBegins (arc[forwardList[rix]]->GetToId(), baseId,
485 InheritArc (arc[forwardList[rix]], baseId);
542 void SubGraph::PullUpEnds (int currId, int baseId, int initialId, int procLabel,
553 PullUpEnds (arc[backwardList[rix]]->GetFromId(), baseId,
557 InheritReverseArc (arc[backwardList[rix]], baseId);
778 bool SubGraph::PullUpTags (int currId, int baseId, int initialId,
790 if (PullUpTags (arc[backwardList[rix]]->GetFromId(), baseId, initialId,
796 InheritReverseArcWithTag (arc[backwardList[rix]], baseId, outTag);