| /third_party/node/deps/cares/src/lib/ |
| D | ares_llist.c | 47 struct list_node* old_node) { in ares__insert_in_list() argument
48 new_node->next = old_node; in ares__insert_in_list()
49 new_node->prev = old_node->prev; in ares__insert_in_list()
50 old_node->prev->next = new_node; in ares__insert_in_list()
51 old_node->prev = new_node; in ares__insert_in_list()
|
| D | ares_llist.h | 35 struct list_node* old_node);
|
| /third_party/boost/boost/xpressive/detail/core/ |
| D | list.hpp | 140 node *old_node = static_cast<node *>(_sentry._next); in pop_front() local
141 _sentry._next = old_node->_next; in pop_front()
143 delete old_node; in pop_front()
149 node *old_node = static_cast<node *>(_sentry._prev); in pop_back() local
150 _sentry._prev = old_node->_prev; in pop_back()
152 delete old_node; in pop_back()
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/ir_fission/ |
| D | reduce_min_fission.cc | 24 …Ptr CreateReduceMin(const FuncGraphPtr &graph, const AnfNodePtr &input, const CNodePtr &old_node) { in CreateReduceMin() argument
27 MS_EXCEPTION_IF_NULL(old_node); in CreateReduceMin()
31 reduce_min->set_scope(old_node->scope()); in CreateReduceMin()
32 AnfAlgo::CopyNodeAttr(kAttrKeepDims, old_node, reduce_min); in CreateReduceMin()
|
| /third_party/mindspore/mindspore/core/ir/ |
| D | func_graph_cloner.cc | 91 auto old_node = node->cast<CNodePtr>(); in CloneCNode() local
92 new_node->CloneCNodeInfo(old_node); in CloneCNode()
95 repl_node_[old_node] = new_node; in CloneCNode()
96 nodes_.emplace_back(old_node, new_node); in CloneCNode()
130 auto old_node = value_node.first; in CloneValueNodes() local
131 MS_EXCEPTION_IF_NULL(old_node); in CloneValueNodes()
132 if (repl_node_.count(old_node) == 0) { in CloneValueNodes()
133 CloneValueNode(old_node); in CloneValueNodes()
631 CNodePtr old_node = node_pair.first; in LinkEdges() local
633 MS_EXCEPTION_IF_NULL(old_node); in LinkEdges()
[all …]
|
| D | manager.cc | 626 bool FuncGraphManager::Replace(const AnfNodePtr &old_node, const AnfNodePtr &new_node) { in Replace() argument
627 auto func_graph = old_node->func_graph(); in Replace()
629 bool success = tr.Replace(old_node, new_node); in Replace()
633 func_graph->ReplaceInOrder(old_node, new_node); in Replace()
787 bool FuncGraphTransaction::Replace(const AnfNodePtr &old_node, const AnfNodePtr &new_node) { in Replace() argument
788 MS_EXCEPTION_IF_NULL(old_node); in Replace()
790 FuncGraphPtr old_func_graph = old_node->func_graph(); in Replace()
791 if (old_func_graph != nullptr && old_func_graph->get_return() == old_node) { in Replace()
795 auto &users = manager_->node_users()[old_node]; in Replace()
|
| D | manager.h | 300 bool Replace(const AnfNodePtr &old_node, const AnfNodePtr &new_node) final;
395 bool Replace(const AnfNodePtr &old_node, const AnfNodePtr &new_node);
|
| D | func_graph.cc | 679 void FuncGraph::ReplaceInOrder(const AnfNodePtr &old_node, const AnfNodePtr &new_node) { in ReplaceInOrder() argument
680 MS_EXCEPTION_IF_NULL(old_node); in ReplaceInOrder()
686 auto old_cnode = old_node->cast<CNodePtr>(); in ReplaceInOrder()
|
| D | func_graph.h | 386 void ReplaceInOrder(const AnfNodePtr &old_node, const AnfNodePtr &new_node);
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/ |
| D | graph_kernel_expander.cc | 166 …PyExpander::CreateExpandGraphKernel(const FuncGraphPtr &new_func_graph, const CNodePtr &old_node) { in CreateExpandGraphKernel() argument
167 auto func_graph = old_node->func_graph(); in CreateExpandGraphKernel()
168 std::vector<AnfNodePtr> inputs(old_node->inputs().begin() + 1, old_node->inputs().end()); in CreateExpandGraphKernel()
176 MS_LOG(DEBUG) << "Expand node: " << old_node->fullname_with_scope() in CreateExpandGraphKernel()
|
| D | graph_kernel_expander.h | 39 …l AnfNodePtr CreateExpandGraphKernel(const FuncGraphPtr &new_func_graph, const CNodePtr &old_node);
|
| /third_party/mindspore/mindspore/ccsrc/frontend/optimizer/irpass/ |
| D | branch_culling.cc | 120 CNodePtr old_node = node_pair.first; in RunSwitchNodeReplace() local
122 MS_EXCEPTION_IF_NULL(old_node); in RunSwitchNodeReplace()
124 for (size_t i = 0; i < old_node->size(); i++) { in RunSwitchNodeReplace()
125 auto input = old_node->input(i); in RunSwitchNodeReplace()
128 } else if (repl_node_inputs.count(std::pair<AnfNodePtr, size_t>(old_node, i)) != 0) { in RunSwitchNodeReplace()
129 new_node->add_input(repl_node_inputs[std::pair<AnfNodePtr, size_t>(old_node, i)]); in RunSwitchNodeReplace()
|
| /third_party/boost/boost/lockfree/detail/ |
| D | freelist.hpp | 561 T * old_node = NodeStorage::nodes() + index; in allocate_impl() local
562 tagged_index * next_index = reinterpret_cast<tagged_index*>(old_node); in allocate_impl()
579 T * old_node = NodeStorage::nodes() + index; in allocate_impl_unsafe() local
580 tagged_index * next_index = reinterpret_cast<tagged_index*>(old_node); in allocate_impl_unsafe()
|
| /third_party/mindspore/mindspore/core/api/ir/ |
| D | func_graph_manager.h | 45 virtual bool Replace(const AnfNodePtr &old_node, const AnfNodePtr &new_node) = 0;
|
| /third_party/mindspore/mindspore/ccsrc/pipeline/jit/static_analysis/ |
| D | program_specialize.cc | 569 auto old_node = cnode->input(i + 2); in BuildSpecializedParameterNode() local
570 … auto possibile_value_node = BuildPossibleValueNode(old_node, partial_closure->args()[i], attrs); in BuildSpecializedParameterNode()
574 if (!(old_node->isa<CNode>() || old_node->isa<Parameter>())) { in BuildSpecializedParameterNode()
575 … MS_LOG(EXCEPTION) << "Old node should be CNode or Parameter, but " << old_node->ToString(); in BuildSpecializedParameterNode()
577 partial_node_list.push_back(old_node); in BuildSpecializedParameterNode()
|
| /third_party/mindspore/mindspore/lite/src/train/ |
| D | train_export.cc | 39 auto &old_node = graphT.nodes.at(i); in GetLinkedPostIdx() local
40 if (old_node == nullptr) { in GetLinkedPostIdx()
43 auto input_indexes = old_node->inputIndex; in GetLinkedPostIdx()
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/common/ |
| D | helper.h | 220 void TransferDependOrUpdateState(const CNodePtr &old_node, const FuncGraphPtr &graph, const CNodePt…
|
| D | helper.cc | 919 void TransferDependOrUpdateState(const CNodePtr &old_node, const FuncGraphPtr &graph, const CNodePt… in TransferDependOrUpdateState() argument
920 MS_EXCEPTION_IF_NULL(old_node); in TransferDependOrUpdateState()
925 auto node_users = manager->node_users()[old_node]; in TransferDependOrUpdateState()
|
| /third_party/python/Lib/ |
| D | ast.py | 178 def copy_location(new_node, old_node): argument
184 if attr in old_node._attributes and attr in new_node._attributes:
185 value = getattr(old_node, attr, None)
189 hasattr(old_node, attr) and attr.startswith("end_")
|
| /third_party/mindspore/mindspore/ccsrc/backend/session/ |
| D | ascend_auto_monad.cc | 1072 void ReplaceNode(const AnfNodePtr &old_node, const AnfNodePtr &new_node) { in ReplaceNode() argument
1073 kernel_graph_->ReplaceNode(old_node, new_node); in ReplaceNode()
1076 std::replace(callee.args.begin(), callee.args.end(), old_node, new_node); in ReplaceNode()
|
| /third_party/python/Doc/library/ |
| D | ast.rst | 2031 .. function:: copy_location(new_node, old_node)
2034 and :attr:`end_col_offset`) from *old_node* to *new_node* if possible,
|