Home
last modified time | relevance | path

Searched refs:equivMap (Results 1 – 4 of 4) sorted by relevance

/external/srec/tools/grxmlcompile/
Dsub_min.cpp63 bool SubGraph::EquivalenceTestForward (int firstId, int secondId, int *equivMap) in EquivalenceTestForward() argument
120 void SubGraph::IdentifyEquivalence (int *depthMap, int *equivMap) in IdentifyEquivalence() argument
135 if (depthMap[ii] == dd && ii == equivMap[ii]) { in IdentifyEquivalence()
136 CheckForChangeAndResort (ii, equivMap); in IdentifyEquivalence()
138 if (depthMap[jj] == dd && jj == equivMap[jj]) { in IdentifyEquivalence()
140 CheckForChangeAndResort (jj, equivMap); in IdentifyEquivalence()
142 if (EquivalenceTestForward (ii, jj, equivMap)) { in IdentifyEquivalence()
143 equivMap[jj]= ii; in IdentifyEquivalence()
Dsub_base.cpp291 void SubGraph::MapGraphVertices (int *equivMap) in MapGraphVertices() argument
298 if (equivMap[fromId] != fromId) in MapGraphVertices()
302 if (equivMap[toId] != toId) in MapGraphVertices()
303 arc[ii]->AssignToId (equivMap[toId]); in MapGraphVertices()
Dsub_grph.cpp631 int ii, *equivMap, *depthMap; in ReduceArcsByEquivalence() local
649 equivMap= new int [numVertex]; in ReduceArcsByEquivalence()
651 equivMap[ii]= ii; in ReduceArcsByEquivalence()
655 IdentifyEquivalence (depthMap, equivMap); in ReduceArcsByEquivalence()
659 MapGraphVertices (equivMap); in ReduceArcsByEquivalence()
666 delete [] equivMap; in ReduceArcsByEquivalence()
Dsub_grph.h246 bool EquivalenceTestForward (int firstId, int secondId, int *equivMap);
251 void MapGraphVertices (int *equivMap);
252 void IdentifyEquivalence (int *depthMap, int *equivMap);