Home
last modified time | relevance | path

Searched defs:new_node (Results 1 – 25 of 135) sorted by relevance

123456

/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/irpass/
Dpartial_eliminate.h60 auto new_node = node->func_graph()->NewCNode(args); in operator() local
82 auto new_node = node->func_graph()->NewCNode(args); in operator() local
326 auto new_node = in operator() local
339 auto new_node = in operator() local
360 auto new_node = old_cnode->func_graph()->NewCNode(args); in BuildNewSwitchNode() local
410 …auto new_node = BuildNewSwitchLayerNode(cnode, switch_layer_cnode, args_list_[0], AnfNodePtrList{}… in operator() local
422 …auto new_node = BuildNewSwitchLayerNode(cnode, switch_layer_cnode, args_list_[max_args_pos], extra… in operator() local
449 auto new_node = old_cnode->func_graph()->NewCNode(args); in BuildNewSwitchLayerNode() local
Dreshape_eliminate.h96 auto new_node = fg->NewCNode({NewValueNode(prim_), x_, shape_}); in operator() local
137 auto new_node = reshape_same_shape_eliminater_(optimizer, node); in operator() local
Dcast_eliminate.h61 auto new_node = cast_same_type_eliminater_(optimizer, node); in operator() local
Dincorporate_call.h125 auto new_node = node->func_graph()->NewCNode(args); in operator() local
211 auto new_node = fg->NewCNode(args); in operator() local
Dincorporate_getitem.h363 auto new_node = ShrinkFuncGraphOutput(node, tp_cnodes_and_index); in operator() local
434 auto new_node = in ShrinkFuncGraphOutput() local
450 auto new_node = in ShrinkFuncGraphOutput() local
464 auto new_node = origin_node->func_graph()->NewCNode(args_); in TransformFuncGraph() local
675 auto new_node = ShrinkFuncGraphOutput(node, switch_call_cnode, tp_cnodes_and_index); in operator() local
690 auto new_node = fg->NewCNode(args_); in operator() local
718 auto new_node = in ShrinkFuncGraphOutput() local
739 auto new_node = in ShrinkFuncGraphOutput() local
1073 AnfNodePtr new_node; in operator() local
Dcall_graph_tuple_transform.h59 auto new_node = TransformCallGraph(transformed_fg, cnode); in operator() local
226 AnfNodePtr new_node; in operator() local
/third_party/boost/boost/intrusive/
Drbtree_algorithms.hpp230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node()
365 (node_ptr h, node_ptr new_node, NodePtrCompare comp) in insert_equal_upper_bound()
375 (node_ptr h, node_ptr new_node, NodePtrCompare comp) in insert_equal_lower_bound()
385 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp) in insert_equal()
394 (node_ptr header, node_ptr pos, node_ptr new_node) in insert_before()
402 static void push_back(node_ptr header, node_ptr new_node) in push_back()
409 static void push_front(node_ptr header, node_ptr new_node) in push_front()
Dtreap_algorithms.hpp311 (node_ptr h, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal_upper_bound()
336 (node_ptr h, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal_lower_bound()
364 … (node_ptr h, node_ptr hint, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal()
392 (node_ptr header, node_ptr pos, node_ptr new_node, NodePtrPriorityCompare pcomp) in insert_before()
418 static void push_back(node_ptr header, node_ptr new_node, NodePtrPriorityCompare pcomp) in push_back()
443 static void push_front(node_ptr header, node_ptr new_node, NodePtrPriorityCompare pcomp) in push_front()
569 (node_ptr header, node_ptr new_node, const insert_commit_data &commit_data) in insert_unique_commit()
637 (node_ptr h, node_ptr new_node, NodePtrPriorityCompare pcomp, insert_commit_data &commit_data) in rebalance_check_and_commit()
Davltree_algorithms.hpp206 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node()
214 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node()
350 (node_ptr h, node_ptr new_node, NodePtrCompare comp) in insert_equal_upper_bound()
360 (node_ptr h, node_ptr new_node, NodePtrCompare comp) in insert_equal_lower_bound()
370 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp) in insert_equal()
379 (node_ptr header, node_ptr pos, node_ptr new_node) in insert_before()
387 static void push_back(node_ptr header, node_ptr new_node) in push_back()
394 static void push_front(node_ptr header, node_ptr new_node) in push_front()
Dsgtree_algorithms.hpp196 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_upper_bound()
208 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_lower_bound()
220 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp in insert_equal()
232 (node_ptr header, node_ptr pos, node_ptr new_node in insert_before()
243 static void push_back(node_ptr header, node_ptr new_node in push_back()
253 static void push_front(node_ptr header, node_ptr new_node in push_front()
Dsplaytree_algorithms.hpp433 (node_ptr header, node_ptr new_node, NodePtrCompare comp) in insert_equal_upper_bound()
443 (node_ptr header, node_ptr new_node, NodePtrCompare comp) in insert_equal_lower_bound()
453 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp) in insert_equal()
462 (node_ptr header, node_ptr pos, node_ptr new_node) in insert_before()
471 static void push_back(node_ptr header, node_ptr new_node) in push_back()
479 static void push_front(node_ptr header, node_ptr new_node) in push_front()
Dbstree_algorithms.hpp451 …OST_INTRUSIVE_FORCEINLINE static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node()
472 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node()
1115 (node_ptr h, node_ptr hint, node_ptr new_node, NodePtrCompare comp in insert_equal()
1141 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_upper_bound()
1167 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_lower_bound()
1194 (node_ptr header, node_ptr pos, node_ptr new_node in insert_before()
1220 (node_ptr header, node_ptr new_node in push_back()
1245 (node_ptr header, node_ptr new_node in push_front()
1696 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp in insert_equal_check()
1725 …(node_ptr h, node_ptr new_node, NodePtrCompare comp, insert_commit_data & commit_data, std::size_t… in insert_equal_upper_bound_check()
[all …]
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/enhancer/
Dadd_placeholder_for_dynamic_rnn.cc61 auto new_node = kernel_graph->NewValueNode(value_node); in Process() local
67 CNodePtr new_node = nullptr; in Process() local
Dadd_placeholder_for_dynamic_gru.cc60 auto new_node = kernel_graph->NewValueNode(value_node); in Process() local
70 CNodePtr new_node = nullptr; in Process() local
/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/
Dgraph_transform.cc94 auto new_node = fg->NewCNode(inputs); in TransformCallGraph() local
117 auto new_node = fg->NewCNode(inputs); in TransformPartial() local
139 auto new_node = fg->NewCNode(inputs); in TransformSwitchCall() local
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/format_type/
Dinsert_transpose_for_dynamic_gru_v2.cc49 AnfNodePtr new_node = nullptr; in Insert() local
91 CNodePtr new_node = nullptr; in Process() local
Dinsert_transpose_for_basiclstm_op.cc39 CNodePtr new_node = nullptr; in Insert() local
92 CNodePtr new_node = nullptr; in Process() local
Dinsert_trans_op.cc41 AnfNodePtr new_node = InsertTransOpForInput(func_graph, node, kernel_select_); in Process() local
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/ir_fusion/
Dlamb_next_right_rule.cc47 auto new_node = func_graph->NewCNode(new_node_inputs); in CreateLambNextRightNode() local
67 auto new_node = CreateLambNextRightNode(func_graph, equiv); in Process() local
Dderelu_fusion.cc47 auto new_node = graph->NewCNode(inputs); in CreateReluV2() local
90 auto new_node = graph->NewCNode(inputs); in CreateReluGradV2() local
Dmatmul_biasadd_fusion.cc56 auto new_node = graph->NewCNode(inputs); in Process() local
/third_party/boost/boost/geometry/index/detail/rtree/visitors/
Dcopy.hpp46 subtree_destroyer new_node(raw_new_node, m_allocators); in operator ()() local
73 subtree_destroyer new_node(raw_new_node, m_allocators); in operator ()() local
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/
Dvalue_graph_binder.cc42 auto new_node = kernel_graph->NewValueNode(vptr); in Run() local
/third_party/node/deps/cares/src/lib/
Dares_llist.c46 void ares__insert_in_list(struct list_node* new_node, in ares__insert_in_list()
/third_party/mindspore/mindspore/lite/tools/optimizer/common/
Dnode_pass_extends.cc49 AnfNodePtr new_node = Run(func_graph, node); in Run() local

123456