/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/format_type/ |
D | insert_cast.cc | 49 AnfNodePtr replace_node = nullptr; in InsertCastForMultipleOutput() local 65 …replace_node = AddCastOpNodeToGraph(func_graph, getitem, dev_fmt, device_type, origin_type, origin… in InsertCastForMultipleOutput() 67 MS_EXCEPTION_IF_NULL(replace_node); in InsertCastForMultipleOutput() 68 replace_node->set_scope(cnode->scope()); in InsertCastForMultipleOutput() 69 AnfAlgo::SetNodeAttr(kAttrVisited, MakeValue(true), replace_node); in InsertCastForMultipleOutput() 71 kernel_graph->ReplaceInternalOutput(cnode, replace_node, output_idx, 0); in InsertCastForMultipleOutput() 74 replace_node = getitem; in InsertCastForMultipleOutput() 76 abstract_list.emplace_back(replace_node->abstract()); in InsertCastForMultipleOutput() 77 make_tuple_inputs.push_back(replace_node); in InsertCastForMultipleOutput() 99 AnfNodePtr replace_node = cnode; in InsertCastForOutput() local [all …]
|
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/gpu/ |
D | apply_momentum_weight_fusion.cc | 60 auto replace_node = graph->NewCNode(inputs); in Process() local 61 MS_EXCEPTION_IF_NULL(replace_node); in Process() 64 AnfAlgo::SetOutputInferTypeAndShape(types, shapes, replace_node.get()); in Process() 65 replace_node->set_scope(node->scope()); in Process() 66 return replace_node; in Process()
|
D | apply_momentum_scale_fusion.cc | 88 auto replace_node = graph->NewCNode(inputs); in Process() local 89 MS_EXCEPTION_IF_NULL(replace_node); in Process() 92 AnfAlgo::SetOutputInferTypeAndShape(types, shapes, replace_node.get()); in Process() 93 replace_node->set_scope(node->scope()); in Process() 94 return replace_node; in Process()
|
D | apply_momentum_weight_scale_fusion.cc | 125 auto replace_node = graph->NewCNode(inputs); in Process() local 126 MS_EXCEPTION_IF_NULL(replace_node); in Process() 129 AnfAlgo::SetOutputInferTypeAndShape(types, shapes, replace_node.get()); in Process() 130 replace_node->set_scope(node->scope()); in Process() 131 return replace_node; in Process()
|
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/pass/ |
D | optimize_dependence.cc | 76 auto replace_node = eliminate_node->input(kSingleInputIndex); in EliminateIsolatedVirtualNodeInput() local 78 new_depend_inputs[kIsolatedDependRealInputIndex + 1] = replace_node; in EliminateIsolatedVirtualNodeInput() 197 auto replace_node = GetConvertNode(func_graph, cnode, index); in Process() local 198 if (replace_node != nullptr) { in Process() 199 new_inputs[index] = replace_node; in Process() 230 AnfNodePtr replace_node = GetReplaceNode(graph, replacing_cnode); in GetConvertNode() local 231 return replace_node; in GetConvertNode()
|
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/ops_info/ |
D | dropout_do_mask_info.cc | 282 CNodePtr replace_node = func_graph->NewCNode(replace_input); in ReplaceOneOp() local 283 MS_EXCEPTION_IF_NULL(replace_node); in ReplaceOneOp() 286 replace_node->set_scope(scope); in ReplaceOneOp() 287 replace_node->set_in_forward_flag(true); in ReplaceOneOp() 289 PrimitivePtr prim = GetValueNode<PrimitivePtr>(replace_node->input(0)); in ReplaceOneOp() 292 (void)manager->Replace(node, replace_node); in ReplaceOneOp()
|
/third_party/mindspore/mindspore/ccsrc/pipeline/jit/static_analysis/ |
D | program_specialize.cc | 339 AnfNodePtr replace_node = BuildPossibleValueNode(iconf->node(), ival, attrs); in ProcessNode() local 340 if (replace_node == nullptr) { in ProcessNode() 341 replace_node = BuildReplacedNode(iconf); in ProcessNode() 342 replace_node->set_abstract(ival); in ProcessNode() 343 …MS_LOG(DEBUG) << "Set replaced: " << replace_node->ToString() << ", to abstract: " << ival->ToStri… in ProcessNode() 346 … << ", ival: " << ival->ToString() << ", replace_node: " << replace_node->ToString(); in ProcessNode() 348 if (new_inputs[i] != replace_node) { in ProcessNode() 349 new_inputs[i] = replace_node; in ProcessNode() 350 MS_LOG(DEBUG) << "Set new_input[" << i << "] = " << replace_node->DebugString(); in ProcessNode()
|
/third_party/mindspore/mindspore/lite/tools/converter/acl/mapper/ |
D | spatial_node_adapter.cc | 127 const std::vector<AnfNodePtr> replace_node = {cnode_inputs[0], make_tuple_cnode}; in AdapteNodeWithDynamicInput() local 128 cnode->set_inputs(replace_node); in AdapteNodeWithDynamicInput()
|
/third_party/boost/boost/intrusive/ |
D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() function in boost::intrusive::rbtree_algorithms 234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), 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() function in boost::intrusive::rbtree_algorithms 240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
|
D | avltree_algorithms.hpp | 206 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() function in boost::intrusive::avltree_algorithms 210 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), 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() function in boost::intrusive::avltree_algorithms 216 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
|
D | sgtree_algorithms.hpp | 107 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node); 110 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|
D | treap_algorithms.hpp | 202 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node); 205 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|
D | splaytree_algorithms.hpp | 197 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node); 200 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|
D | set.hpp | 412 void replace_node(iterator replace_this, reference with_this); 907 void replace_node(iterator replace_this, reference with_this);
|
D | bs_set.hpp | 409 void replace_node(iterator replace_this, reference with_this); 903 void replace_node(iterator replace_this, reference with_this);
|
D | avl_set.hpp | 412 void replace_node(iterator replace_this, reference with_this); 907 void replace_node(iterator replace_this, reference with_this);
|
D | bstree_algorithms.hpp | 451 …BOOST_INTRUSIVE_FORCEINLINE static void replace_node(node_ptr node_to_be_replaced, node_ptr new_no… in replace_node() function in boost::intrusive::bstree_algorithms 455 replace_node(node_to_be_replaced, base_type::get_header(node_to_be_replaced), 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() function in boost::intrusive::bstree_algorithms
|
D | bstree.hpp | 193 void replace_node(iterator replace_this, reference with_this) in replace_node() function 195 node_algorithms::replace_node( get_value_traits().to_node_ptr(*replace_this) in replace_node() 1935 void replace_node(iterator replace_this, reference with_this);
|
D | splay_set.hpp | 417 void replace_node(iterator replace_this, reference with_this); 928 void replace_node(iterator replace_this, reference with_this);
|
D | treap_set.hpp | 443 void replace_node(iterator replace_this, reference with_this); 959 void replace_node(iterator replace_this, reference with_this);
|
D | sg_set.hpp | 410 void replace_node(iterator replace_this, reference with_this); 916 void replace_node(iterator replace_this, reference with_this);
|
/third_party/e2fsprogs/tests/f_extent_oobounds/ |
D | script | 27 replace_node 15 30 200
|
/third_party/e2fsprogs/debugfs/ |
D | extent_cmds.ct | 62 replace_node, replace;
|
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/ |
D | step_parallel.cc | 743 CNodePtr replace_node = func_graph->NewCNode(replace_input); in StepReplaceOp() local 744 MS_EXCEPTION_IF_NULL(replace_node); in StepReplaceOp() 747 replace_node->set_scope(scope); in StepReplaceOp() 748 PrimitivePtr prim = GetValueNode<PrimitivePtr>(replace_node->input(0)); in StepReplaceOp() 759 replace_node->set_user_data<OperatorInfo>(node->user_data<OperatorInfo>()); in StepReplaceOp() 760 replace_node->set_primal_attrs(node->primal_attrs()); in StepReplaceOp() 762 replace_node->set_in_forward_flag(true); in StepReplaceOp() 765 auto new_cnode = InsertMakeTuple(replace_node, replace_op_info[index].second, func_graph); in StepReplaceOp() 769 (void)manager->Replace(node, replace_node); // using Replace function to insert node in StepReplaceOp()
|
/third_party/boost/boost/interprocess/mem_algo/ |
D | rbtree_best_fit.hpp | 1108 m_header.m_imultiset.replace_node(old_next_block_it, *rem_block); in priv_expand() 1277 m_header.m_imultiset.replace_node(Imultiset::s_iterator_to(*it_old), *rem_block); in priv_check_and_allocate() 1369 m_header.m_imultiset.replace_node(next_it, *block_to_insert); in priv_deallocate()
|