Searched refs:InverseMap (Results 1 - 4 of 4) sorted by relevance

/external/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp342 InterExplodedGraphMap *InverseMap) const{
408 if (InverseMap) (*InverseMap)[NewN] = N;
H A DBugReporter.cpp2827 InterExplodedGraphMap InverseMap; member in class:__anon18257::TrimmedGraph
2877 G.reset(OriginalGraph->trim(Nodes, &ForwardMap, &InverseMap));
2955 InterExplodedGraphMap::const_iterator IMitr = InverseMap.find(OrigN);
2956 assert(IMitr != InverseMap.end() && "No mapping to original node.");
/external/llvm/lib/IR/
H A DConstantsContext.h518 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
522 InverseMapTy InverseMap; member in class:llvm::ConstantUniqueMap
552 typename InverseMapTy::iterator IMI = InverseMap.find(CP);
553 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
555 "InverseMap corrupt!");
580 InverseMap.insert(std::make_pair(Result, I));
611 InverseMap.erase(CP);
632 InverseMap[C] = I;
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h372 /// \param[out] InverseMap An optional map from nodes in the returned graph to
377 InterExplodedGraphMap *InverseMap = nullptr) const;

Completed in 75 milliseconds