Searched refs:startId (Results 1 - 8 of 8) sorted by relevance

/external/srec/tools/grxmlcompile/
H A Dsub_base.cpp39 startId= baseG->startId;
145 printf ("Graph %s (%d %d)\n", title, startId, lastId);
158 printf ("Graph %s (%d %d)\n", title, startId, lastId);
175 void SubGraph::ReverseDepthData (int startId, int *depthMap, int depth) argument
179 if (depthMap[startId] > depth)
180 depthMap[startId]= depth;
183 rix= FindToIndex (startId);
186 while (rix < numArc && arc[backwardList[rix]]->GetToId() == startId) {
196 void SubGraph::ForwardDepthData (int startId, in argument
[all...]
H A Dsub_grph.cpp55 opStack[popOp++]= startId;
66 prevStartId= startId;
73 startId= opStack[--popOp];
89 startId= NewVertexId();
98 lastId= startId;
114 lastId= ConnectLastScope (startId, closeId);
149 (void) CreateArc (begLabel, begOutLabel, startId, beginScopeId);
180 (void) CreateArc (NONE_LABEL, NONE_LABEL, startId, lastId); // start to end
184 blockCount= numVertex - startId - 1;
195 (void) CreateArc (NONE_LABEL, NONE_LABEL, startId, finalI
[all...]
H A Dsub_grph.h116 startId= NewVertexId();
117 lastId= startId;
235 void RemoveRuleStarts (int startId, int endId);
236 void RemoveRuleEnds (int startId, int endId);
238 void RemoveForwardConnections (int startId, int endId);
239 void RemoveBackwardConnections (int startId, int endId);
247 void ForwardDepthData (int startId, int *depthMap, int depth);
248 void ReverseDepthData (int startId, int *depthMap, int depth);
358 int startId; member in class:SubGraph
H A Dnetw_arc.h77 NUANArc (NUANArc *arcsrc, int offset, int startId, int newStartId, int endId, int newEndId) argument
81 if (arcsrc->fromId == startId && newStartId >= 0)
H A Dsub_phon.cpp124 else if (currId != startId)
331 ReverseMarkOutput (arc[ii]->GetFromId(), startId, arc[ii]->GetOutput());
445 rix= FindFromIndex (startId);
448 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == startId) {
455 arcOne= CreateArc (modelSequence[0], INITIAL_LABEL, startId, intId);
H A Dsub_supp.cpp407 startId= mapList[startId];
413 startId= 0;
H A Dnetw_dump.cpp345 printf ("Graph %s (%d %d)\n", title, startId, lastId);
H A Dsub_min.cpp554 && (vertexProp[arc[ii]->GetFromId()] > 0 || arc[ii]->GetFromId() == startId))

Completed in 30 milliseconds