Searched refs:InverseMap (Results 1 – 4 of 4) sorted by relevance
588 InverseMapTy InverseMap;618 typename InverseMapTy::iterator IMI = InverseMap.find(CP);619 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&646 InverseMap.insert(std::make_pair(Result, I));677 InverseMap.erase(CP);698 InverseMap[C] = I;
350 InterExplodedGraphMap *InverseMap) const { in trim()410 if (InverseMap) (*InverseMap)[NewN] = N; in trim()
2802 InterExplodedGraphMap InverseMap; member in __anon889b26420311::TrimmedGraph2852 G = OriginalGraph->trim(Nodes, &ForwardMap, &InverseMap); in TrimmedGraph()2929 InterExplodedGraphMap::const_iterator IMitr = InverseMap.find(OrigN); in popNextReportGraph()2930 assert(IMitr != InverseMap.end() && "No mapping to original node."); in popNextReportGraph()
386 InterExplodedGraphMap *InverseMap = nullptr) const;