Searched refs:DeepLinkedGraphSearch (Results 1 – 8 of 8) sorted by relevance
59 AnfNodeSet orig_nodes = AnfNodeSet(DeepLinkedGraphSearch(orig->output())); in SuccessfulInlining()60 AnfNodeSet new_nodes = AnfNodeSet(DeepLinkedGraphSearch(new_root)); in SuccessfulInlining()116 FuncGraphIndex idx2(g_clone, DeepLinkedGraphSearch); in TEST_F()
48 std::vector<AnfNodePtr> DeepLinkedGraphSearch(const AnfNodePtr &root, const IncludeFunc &include);62 std::vector<AnfNodePtr> DeepLinkedGraphSearch(const AnfNodePtr &root, const IncludeFunc &include = …
197 std::vector<AnfNodePtr> DeepLinkedGraphSearch(const AnfNodePtr &root, const IncludeFunc &include) { in DeepLinkedGraphSearch() function
168 auto nodes = DeepLinkedGraphSearch(item.second); in CloneFuncGraphDefaultValues()
90 static_cast<void>(DeepLinkedGraphSearch(param_user, IncludeUser)); in HasPathToParamUser()
202 static_cast<void>(DeepLinkedGraphSearch(out_node, IncludeFunc)); in FindAllOutputs()
2775 root_forward_nodes = DeepLinkedGraphSearch(cnode); in FindRootForwardCNode()2866 auto all_dfs_nodes = DeepLinkedGraphSearch(return_node); in MarkForwardCNode()
365 auto all_nodes = DeepLinkedGraphSearch(ret); in ExistSummaryNode()