| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/ |
| D | decrease_transfer_precision.cc | 110 auto in_node = item->cast<CNodePtr>(); in Run() local
111 if (IsPrimitive(in_node->input(0), prim::kPrimTupleGetItem)) { in Run()
112 auto tuple_node = in_node->input(1); in Run()
113 auto tuple_index = ObtainGetItemIndex(in_node); in Run()
116 … (users_map[in_node].size() > 1 && IsAllUserCandidateNode(users_map[in_node])) || in Run()
123 … in_node->set_abstract(std::make_shared<abstract::AbstractTensor>(kFloat16, GetShape(in_node))); in Run()
125 for (auto each_out : users_map[in_node]) { in Run()
129 if (IsCandidateNode(in_node)) { in Run()
130 auto fail_flag = !IsAllUserCandidateNode(users_map[in_node]); in Run()
135 (void)Process_Father(func_graph, in_node, false, 0); in Run()
|
| D | graph_kernel_splitter.cc | 193 for (const auto &in_node : ft_cnode->inputs()) { in TraverseFuncGraphFromCNode() local
194 if (visited.count(in_node) == 0) { in TraverseFuncGraphFromCNode()
195 que.push(in_node); in TraverseFuncGraphFromCNode()
196 visited.insert(in_node); in TraverseFuncGraphFromCNode()
230 AnfNodePtr in_node = cnode->input(i); in CreateParameters() local
231 if (!IsExternalCNode(in_node)) continue; in CreateParameters()
232 auto it = node_param_map.find(in_node); in CreateParameters()
235 new_param->set_abstract(in_node->abstract()); in CreateParameters()
237 node_param_map.insert(std::make_pair(in_node, new_param)); in CreateParameters()
369 for (auto &in_node : cnode->inputs()) { in AreaGraph() local
[all …]
|
| D | decrease_compute_precision.cc | 90 auto in_node = prev_node.first; in InsertCastForGraphKernel() local
92 auto ori_shape = AnfAlgo::GetOutputDeviceShape(in_node, in_index); in InsertCastForGraphKernel()
93 auto ori_dtype = AnfAlgo::GetOutputDeviceDataType(in_node, in_index); in InsertCastForGraphKernel()
142 auto in_node = cnode->input(1); in Process() local
143 (void)mng->Replace(node, in_node); in Process()
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/enhancer/ |
| D | split_n_optimizer.cc | 97 auto in_node = VisitSplitKernel(AnfAlgo::GetInputNode(cnode, i), 0).first; in InputCheck() local
98 MS_EXCEPTION_IF_NULL(in_node); in InputCheck()
99 if (in_node->isa<Parameter>() || in_node->isa<ValueNode>()) { in InputCheck()
103 if (in_node->isa<CNode>()) { in InputCheck()
104 auto in_cnode = in_node->cast<CNodePtr>(); in InputCheck()
107 auto trans_input = AnfAlgo::VisitKernel(in_node, 0).first; in InputCheck()
116 …if ((AnfAlgo::HasNodeAttr("non_task", in_cnode) && AnfAlgo::GetNodeAttr<bool>(in_node, "non_task")… in InputCheck()
|
| /third_party/mindspore/mindspore/ccsrc/runtime/device/executor/ |
| D | dynamic_kernel.cc | 120 auto in_node = input_node_with_idx.first; in InferShapeForNopNode() local
121 MS_EXCEPTION_IF_NULL(in_node); in InferShapeForNopNode()
122 if (opt::IsNopNode(in_node)) { in InferShapeForNopNode()
123 nop_road.push(in_node); in InferShapeForNopNode()
124 *input_node = in_node; in InferShapeForNopNode()
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/gnn/ |
| D | edge.h | 70 Status SetNode(const std::pair<std::shared_ptr<Node>, std::shared_ptr<Node>> &in_node) { in SetNode() argument
71 src_node_ = in_node.first; in SetNode()
72 dst_node_ = in_node.second; in SetNode()
|
| /third_party/ninja/src/ |
| D | test.cc | 117 for (vector<Node*>::const_iterator in_node = (*e)->inputs_.begin(); in VerifyGraph() local
118 in_node != (*e)->inputs_.end(); ++in_node) { in VerifyGraph()
119 const vector<Edge*>& out_edges = (*in_node)->out_edges(); in VerifyGraph()
|
| /third_party/mindspore/mindspore/lite/micro/coder/ |
| D | graph.cc | 135 auto in_node = model_->all_nodes_.at(in_node_index); in InitGraphInOutTensors() local
136 MS_CHECK_PTR(in_node); in InitGraphInOutTensors()
137 for (uint32_t i = 0; i < in_node->input_indices_.size(); i++) { in InitGraphInOutTensors()
138 auto in_tensor_index = size_t(in_node->input_indices_.at(i)); in InitGraphInOutTensors()
152 AddInputMap(in_node->name_, in_tensor); in InitGraphInOutTensors()
|
| /third_party/mindspore/mindspore/core/ir/ |
| D | func_graph_extends.cc | 310 auto in_node = node->input(i); in FindRoots() local
311 auto in_cnode = in_node->cast<CNodePtr>(); in FindRoots()
332 auto in_node = node->input(i); in FindLeaves() local
333 if (!in_node->isa<CNode>()) { in FindLeaves()
336 auto in_cnode = in_node->cast<CNodePtr>(); in FindLeaves()
|
| /third_party/flutter/skia/third_party/externals/spirv-tools/source/util/ |
| D | huffman_codec.h | 240 Context(Node* in_node, uint64_t in_bits, size_t in_depth) in CreateEncodingTable()
241 : node(in_node), bits(in_bits), depth(in_depth) {} in CreateEncodingTable()
|
| /third_party/mindspore/mindspore/lite/src/ |
| D | lite_session.cc | 307 auto in_node = model->graph_.all_nodes_[in_node_index]; in InitGraphInputMap() local
308 MS_ASSERT(in_node != nullptr); in InitGraphInputMap()
309 auto in_size = in_node->input_indices_.size(); in InitGraphInputMap()
311 … MS_ASSERT(this->input_map_.find(in_node->name_ + std::to_string(i)) == this->input_map_.end()); in InitGraphInputMap()
312 auto in_tensor_index = size_t(in_node->input_indices_[i]); in InitGraphInputMap()
329 auto tensor_name = in_node->name_ + std::to_string(i); in InitGraphInputMap()
|
| D | lite_mindrt.cc | 85 for (auto in_node : reinterpret_cast<kernel::SubGraphKernel *>(kernel)->in_nodes()) { in ReplaceNodeInTensor()
86 … for (size_t node_in_index = 0; node_in_index < in_node->in_tensors().size(); node_in_index++) { in ReplaceNodeInTensor()
87 if (old_tensor == in_node->in_tensors()[node_in_index]) { in ReplaceNodeInTensor()
88 in_node->set_in_tensor(new_tensor, node_in_index); in ReplaceNodeInTensor()
|
| /third_party/mindspore/mindspore/lite/tools/common/ |
| D | func_graph_subgraph.cc | 76 for (const auto &in_node : in_nodes_) { in GetInputCNodes() local
77 if (in_node == nullptr) { in GetInputCNodes()
80 auto input_cnodes = GetInputCNode(in_node); in GetInputCNodes()
|
| /third_party/mindspore/mindspore/lite/src/train/ |
| D | train_session.cc | 608 for (auto in_node : kernel->in_kernels()) { in BuildInferenceKernelsRecursive() local
609 BuildInferenceKernelsRecursive(in_node, v); in BuildInferenceKernelsRecursive()
|