Searched refs:NodesMap (Results 1 – 9 of 9) sorted by relevance
26 auto &ValueLookup = NodesMap[F.getName()]; in createInlineGraphNode()53 auto It = NodesMap.find(Caller.getName()); in recordInline()54 assert(It != NodesMap.end() && "The node should be already there."); in recordInline()169 auto &Node = *NodesMap[Name]; in calculateRealInlines()188 SortedNodes.reserve(NodesMap.size()); in getSortedNodes()189 for (const NodesMapTy::value_type& Node : NodesMap) in getSortedNodes()
313 const ast_matchers::BoundNodes::IDToNodeMap &NodesMap = in rewriteDescendants() local315 auto It = NodesMap.find(NodeId); in rewriteDescendants()316 if (It == NodesMap.end()) in rewriteDescendants()410 auto &NodesMap = Result.Nodes.getMap(); in getRuleMatchLoc() local411 auto Root = NodesMap.find(RootID); in getRuleMatchLoc()412 assert(Root != NodesMap.end() && "Transformation failed: missing root node."); in getRuleMatchLoc()432 auto &NodesMap = Result.Nodes.getMap(); in findSelectedCase() local435 if (NodesMap.find(Tag) != NodesMap.end()) in findSelectedCase()
55 auto &NodesMap = Nodes.getMap(); in getNode() local56 auto It = NodesMap.find(ID); in getNode()57 if (It == NodesMap.end()) in getNode()
38 auto &NodesMap = Nodes.getMap(); in getNode() local39 auto It = NodesMap.find(Id); in getNode()40 if (It == NodesMap.end()) in getNode()
96 NodesMapTy NodesMap;
230 for (const BoundNodesMap &NodesMap : Bindings) { in isComparable() local231 if (!NodesMap.isComparable()) in isComparable()
268 for (const BoundNodesMap &NodesMap : Bindings) { in isComparable() local269 if (!NodesMap.isComparable()) in isComparable()