| /external/srec/tools/grxmlcompile/ |
| D | sub_phon.cpp | 33 int ii, wordId, phoneId, currId, newId, nextId, arcCount; in ExpandPhonemes() local
76 currId= arc[ii]->GetFromId(); in ExpandPhonemes()
83 arcOne= CreateArc (phoneId, NONE_LABEL, currId, newId); in ExpandPhonemes()
88 currId= newId; in ExpandPhonemes()
90 arcOne= CreateArc (WB_LABEL, wordId, currId, arc[ii]->GetToId()); in ExpandPhonemes()
112 int ii, rix, currId, leftC; in AddLeftContexts() local
118 currId= arc[ii]->GetFromId(); in AddLeftContexts()
119 rix= FindToIndex (currId); in AddLeftContexts()
124 else if (currId != startId) in AddLeftContexts()
125 printf ("Shouldn't get here (L) %d\n", currId); in AddLeftContexts()
[all …]
|
| D | sub_grph.cpp | 470 void SubGraph::PullUpBegins (int currId, int baseId, int finalId, int procLabel, in PullUpBegins() argument
475 nodeList[currNum]= currId; in PullUpBegins()
476 rix= FindFromIndex (currId); in PullUpBegins()
479 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) { in PullUpBegins()
491 void SubGraph::ProcessBegins (int currId, int finalId, int procLabel, in ProcessBegins() argument
496 nodeList[currNum]= currId; in ProcessBegins()
497 rix= FindFromIndex (currId); in ProcessBegins()
499 visitMark[currId]= 1; in ProcessBegins()
502 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) { in ProcessBegins()
504 PullUpBegins (arc[forwardList[rix]]->GetToId(), currId, in ProcessBegins()
[all …]
|
| D | sub_min.cpp | 47 void SubGraph::ViewNode (int currId) in ViewNode() argument
51 printf ("Node: %d\n", currId); in ViewNode()
52 rix= FindFromIndex (currId); in ViewNode()
55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) { in ViewNode()
157 void SubGraph::CheckForChangeAndResort (int currId, int *mapList) in CheckForChangeAndResort() argument
163 rixBegin= rix= FindFromIndex (currId); in CheckForChangeAndResort()
166 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) { in CheckForChangeAndResort()
487 void SubGraph::DecVisitationCache (int currId) in DecVisitationCache() argument
491 DecNodeProperty (currId); in DecVisitationCache()
493 if (QueryNodeProperty (currId) <= 0) { in DecVisitationCache()
[all …]
|
| D | sub_grph.h | 188 int IsDeterminized (int currId);
227 …void PullUpBegins (int currId, int baseId, int endId, int procLabel, int *nodeList, int currNum, i…
228 …void ProcessBegins (int currId, int endId, int procLabel, int *nodeList, int currNum, int *visitMa…
229 …void PullUpEnds (int currId, int baseId, int initialId, int procLabel, int *nodeList, int currNum,…
230 …void ProcessEnds (int currId, int initialId, int procLabel, int *nodeList, int currNum, int *visit…
231 …bool PullUpTags (int currId, int baseId, int initialId, int outTag, int *nodeList, int currNum, in…
232 …void ProcessTags (int currId, int initialId, int *nodeList, int currNum, int *visitMark, int maxNu…
253 void CheckForChangeAndResort (int currId, int *mapList);
265 void ViewNode (int currId);
268 void ReverseMarkOutput (int currId, int initialId, int outId);
[all …]
|
| D | sub_base.cpp | 247 int ii, currId, incId, outId; in RemoveMarkedNodes() local
249 currId= 0; in RemoveMarkedNodes()
258 arc[currId]= arc[ii]; in RemoveMarkedNodes()
259 currId++; in RemoveMarkedNodes()
264 for (ii= currId; ii < numArc; ii++) in RemoveMarkedNodes()
266 numArc= currId; in RemoveMarkedNodes()
272 int ii, currId, outId, inpId; in RemoveDiscardedArcs() local
274 currId= 0; in RemoveDiscardedArcs()
279 arc[currId]= arc[ii]; in RemoveDiscardedArcs()
280 currId++; in RemoveDiscardedArcs()
[all …]
|
| D | sub_supp.cpp | 361 int currId; in ClearDuplicateArcs() local
364 currId= 0; in ClearDuplicateArcs()
367 if (ARC_COMPARE (forwardList[currId], forwardList[ii]) == 0) in ClearDuplicateArcs()
370 currId= ii; in ClearDuplicateArcs()
|