Searched refs:node_iter (Results 1 – 8 of 8) sorted by relevance
256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode() local257 if (node_iter == nodes_.end()) { in GetTreeNode()260 return &node_iter->second; in GetTreeNode()265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode() local266 if (node_iter == nodes_.end()) { in GetTreeNode()269 return &node_iter->second; in GetTreeNode()
280 std::map<uint32_t, DominatorTreeNode>::iterator node_iter = in GetOrInsertNode() local282 if (node_iter == nodes_.end()) { in GetOrInsertNode()286 dtn = &node_iter->second; in GetOrInsertNode()
187 for (auto node_iter : map_iter.second) { in findSiblings() local188 if (node_iter->FuncId == FnId) in findSiblings()189 Siblings.push_back(node_iter); in findSiblings()196 for (auto node_iter : ParentSibling->Callees) in findSiblings() local197 if (node_iter->FuncId == FnId) in findSiblings()198 Siblings.push_back(node_iter); in findSiblings()
650 const auto& node_iter = node_name_index.find(node_name); in GetGraph() local651 if (node_iter != node_name_index.end()) { in GetGraph()673 const auto& node_iter = node_name_index.find(node_name); in GetGraph() local674 if (node_iter != node_name_index.end()) { in GetGraph()
78 const auto& node_iter = index.find(node_name); in ConvertGraphShapeInfoToShapeMap() local79 if (node_iter != index.end()) { in ConvertGraphShapeInfoToShapeMap()
1266 auto node_iter = node_map.find(e->src()); in RewriteShapeInferenceGraph() local1267 if (node_iter == node_map.end()) { in RewriteShapeInferenceGraph()1271 g->AddEdge(node_iter->second, e->src_output(), copy, in RewriteShapeInferenceGraph()