Searched refs:NodesMap (Results 1 – 6 of 6) sorted by relevance
38 auto &ValueLookup = NodesMap[F.getName()]; in createInlineGraphNode()65 auto It = NodesMap.find(Caller.getName()); in recordInline()66 assert(It != NodesMap.end() && "The node should be already there."); in recordInline()181 auto &Node = *NodesMap[Name]; in calculateRealInlines()200 SortedNodes.reserve(NodesMap.size()); in getSortedNodes()201 for (const NodesMapTy::value_type &Node : NodesMap) in getSortedNodes()
333 const ast_matchers::BoundNodes::IDToNodeMap &NodesMap = in rewriteDescendants() local335 auto It = NodesMap.find(NodeId); in rewriteDescendants()336 if (It == NodesMap.end()) in rewriteDescendants()433 auto &NodesMap = Result.Nodes.getMap(); in getRuleMatchLoc() local434 auto Root = NodesMap.find(RootID); in getRuleMatchLoc()435 assert(Root != NodesMap.end() && "Transformation failed: missing root node."); in getRuleMatchLoc()454 auto &NodesMap = Result.Nodes.getMap(); in findSelectedCase() local457 if (NodesMap.find(Tag) != NodesMap.end()) in findSelectedCase()
56 auto &NodesMap = Nodes.getMap(); in getNode() local57 auto It = NodesMap.find(ID); in getNode()58 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;
324 for (const BoundNodesMap &NodesMap : Bindings) {325 if (!NodesMap.isComparable())