| /external/srec/tools/grxmlcompile/ |
| H A D | sub_phon.cpp | 33 int ii, wordId, phoneId, currId, newId, nextId, arcCount; local
76 currId= arc[ii]->GetFromId();
83 arcOne= CreateArc (phoneId, NONE_LABEL, currId, newId);
88 currId= newId;
90 arcOne= CreateArc (WB_LABEL, wordId, currId, arc[ii]->GetToId());
112 int ii, rix, currId, leftC; local
118 currId= arc[ii]->GetFromId();
119 rix= FindToIndex (currId);
124 else if (currId != startId)
125 printf ("Shouldn't get here (L) %d\n", currId);
135 int ii, rix, currId, rightC; local
158 int ii, currId, newId, arcCount, left, right, centre; local
210 int ii, fix, bix, firstId, newId, modelCount, followCount, currId, count; local
335 ReverseMarkOutput(int currId, int initialId, int outId) argument
358 int ii, currId, rix; local
[all...] |
| H A D | sub_base.cpp | 247 int ii, currId, incId, outId; local
249 currId= 0;
258 arc[currId]= arc[ii];
259 currId++;
264 for (ii= currId; ii < numArc; ii++)
266 numArc= currId;
272 int ii, currId, outId, inpId; local
274 currId= 0;
279 arc[currId]= arc[ii];
280 currId
[all...] |
| H A D | sub_grph.h | 188 int IsDeterminized (int currId);
227 void PullUpBegins (int currId, int baseId, int endId, int procLabel, int *nodeList, int currNum, int maxNum);
228 void ProcessBegins (int currId, int endId, int procLabel, int *nodeList, int currNum, int *visitMark, int maxNum);
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);
253 void CheckForChangeAndResort (int currId, int *mapList);
265 void ViewNode (int currId);
268 void ReverseMarkOutput (int currId, in
[all...] |
| H A D | sub_grph.cpp | 470 void SubGraph::PullUpBegins (int currId, int baseId, int finalId, int procLabel, argument
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, argument
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,
542 PullUpEnds(int currId, int baseId, int initialId, int procLabel, int *nodeList, int currNum, int maxNum) argument
563 ProcessEnds(int currId, int initialId, int procLabel, int *nodeList, int currNum, int *visitMark, int maxNum) argument
706 IsDeterminized(int currId) argument
778 PullUpTags(int currId, int baseId, int initialId, int outTag, int *nodeList, int currNum, int maxNum) argument
802 ProcessTags(int currId, int initialId, int *nodeList, int currNum, int *visitMark, int maxNum) argument
[all...] |
| H A D | sub_min.cpp | 47 void SubGraph::ViewNode (int currId) argument
51 printf ("Node: %d\n", currId);
52 rix= FindFromIndex (currId);
55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
157 void SubGraph::CheckForChangeAndResort (int currId, int *mapList) argument
163 rixBegin= rix= FindFromIndex (currId);
166 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
487 void SubGraph::DecVisitationCache (int currId) argument
491 DecNodeProperty (currId);
492 // std::cout << " [" << currId << " " << QueryNodePropert
512 IncVisitationCache(int currId) argument
[all...] |
| H A D | sub_supp.cpp | 361 int currId;
364 currId= 0;
367 if (ARC_COMPARE (forwardList[currId], forwardList[ii]) == 0)
370 currId= ii;
|
| /external/webkit/Source/WebKit/chromium/src/ |
| H A D | WebPluginContainerImpl.cpp | 314 unsigned currId = m_platformLayer->textureId(); local
315 if (currId == id)
322 if (!(currId * id))
|