Searched defs:new_nodes (Results 1 – 15 of 15) sorted by relevance
136 def InsertNodesBefore(new_nodes, target): argument151 def InsertNodesAfter(new_nodes, target): argument
160 … const mindspore::CNodePtr &pre_node, std::vector<mindspore::CNodePtr> *new_nodes) { in AddTbeClearZeroNode()189 std::vector<mindspore::CNodePtr> *new_nodes) { in AddFusionTbeClearZeroNode()352 std::vector<CNodePtr> new_nodes; in TbeClearZeroNodeFusion() local425 std::vector<CNodePtr> new_nodes; in KernelBuildPreprocess() local
31 std::vector<std::unique_ptr<schema::CNodeT>> new_nodes; in Run() local
94 std::vector<schema::CNodeT *> new_nodes{}; in Run() local
43 static unsigned long *new_nodes[2]; variable
127 unsigned long *old_nodes, *new_nodes; in test_invalid_nodes() local
72 unsigned long *old_nodes, *new_nodes; in migrate_to_node() local
304 auto new_nodes = this->GetNodes(); in MergeSubGraph() local316 auto new_nodes = this->GetNodes(); in MergeSubGraph() local
750 GHashNode **new_nodes; in g_hash_table_resize() local
60 AnfNodeSet new_nodes = AnfNodeSet(DeepLinkedGraphSearch(new_root)); in SuccessfulInlining() local
363 auto new_nodes = new_fg->GetOrderedCnodes(); in GetFuncGraphs() local
447 std::vector<std::unique_ptr<schema::CNodeT>> new_nodes; in TopologicalSort() local
330 std::vector<CNodePtr> new_nodes; in HideNopNode() local349 std::vector<CNodePtr> new_nodes; in RemoveNopNode() local
59 NodeCounter new_nodes; member341 std::vector<AnfNodePtr> new_nodes = func_graph->parameters(); in AddFuncGraph() local
2201 size_type new_nodes = (new_elems + get_block_size() - 1) / in priv_reserve_elements_at_front() local2227 size_type new_nodes = (new_elems + get_block_size() - 1)/get_block_size(); in priv_reserve_elements_at_back() local