| /third_party/mindspore/mindspore/lite/src/ |
| D | sub_graph_kernel.cc | 38 for (auto node : this->nodes_) { in Prepare()
71 oss << std::endl << nodes_.size() << " nodes in subgraph :"; in ToString()
72 for (auto kernel : this->nodes_) { in ToString()
83 auto ret = executor_->Run(this->in_tensors(), this->out_tensors(), this->nodes_, before, after); in Execute()
93 for (auto kernel : nodes_) { in ReSize()
144 for (auto *node : nodes_) { in InitInputTensorInitRefCount()
153 for (auto *node : nodes_) { in InitOutTensorInitRefCount()
159 lite::VectorErase(&nodes_, node); in DropNode()
169 if (nodes_.size() < 1) { in Prepare()
172 auto provider = nodes_[0]->desc().provider; in Prepare()
[all …]
|
| D | sub_graph_split.cc | 217 if (subgraph.nodes_.empty()) { in ConvertSubGraphToModel()
251 while (!subgraph.nodes_.empty()) { in ConvertSubGraphToModel()
252 uint32_t node_index = subgraph.nodes_.front(); in ConvertSubGraphToModel()
261 VectorErase(&subgraph.nodes_, node_index); in ConvertSubGraphToModel()
398 subgraph->nodes_.clear(); in InsertNode()
404 if (IsNodeSubGraphHead(index, subgraph->nodes_)) { in InsertNode()
405 if (subgraph->nodes_.empty()) { in InsertNode()
418 subgraph->nodes_.insert(subgraph->nodes_.begin(), index); in InsertNode()
434 if (sub.nodes_.empty()) { in OptimizeAfterFusion()
460 if (!IsNodeSubGraphHeadWithRoot(input_node_index, sub.nodes_, root_node_index)) { in OptimizeAfterFusion()
[all …]
|
| D | sub_graph_kernel.h | 65 nodes_(std::move(nodes)), in SubGraphKernel()
73 for (auto *node : nodes_) { in ~SubGraphKernel()
76 nodes_.clear(); in ~SubGraphKernel()
102 std::vector<LiteKernel *> &nodes() { return this->nodes_; } in nodes()
113 std::vector<LiteKernel *> nodes_{};
176 for (auto &node : this->nodes_) { in Prepare()
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/ |
| D | transform_op_optimizer.cc | 52 (void)nodes_[from].out_edges.emplace_back(edges_.size() - 1); in AddEdge()
55 (void)nodes_[to].out_edges.emplace_back(edges_.size() - 1); in AddEdge()
60 for (auto &node : nodes_) { in BfsSetDepth()
63 nodes_[source_id_].depth = 1; in BfsSetDepth()
68 for (auto e_id : nodes_[edge_from].out_edges) { in BfsSetDepth()
70 if (edges_[e_id].capacity > 0 && nodes_[edge_to].depth == 0) { in BfsSetDepth()
71 nodes_[edge_to].depth = nodes_[edge_from].depth + 1; in BfsSetDepth()
76 return nodes_[sink_id_].depth > 0; in BfsSetDepth()
82 for (size_t e_id : nodes_[node].out_edges) { in DfsMaxFlow()
83 … if ((edges_[e_id].capacity > 0) && (nodes_[node].depth + 1 == nodes_[edges_[e_id].to].depth)) { in DfsMaxFlow()
[all …]
|
| D | parallel_fusion.h | 41 : nodes_(nodes), dims_(dims), fusion_info_(fusion_info) {} in ParallelInfo()
43 nodes_ = obj.nodes_; in ParallelInfo()
50 if (nodes_.size() != dims_.size()) { in GetSize()
53 return nodes_.size(); in GetSize()
55 const AnfNodePtrList &nodes() const { return nodes_; } in nodes()
60 AnfNodePtrList nodes_;
|
| D | graph_kernel_cluster.cc | 363 …auto include = [this, &candidates, func_graph = nodes_[basenode_id]->func_graph()](size_t cluster_… in FindCandidates()
364 const AnfNodePtr &node = this->nodes_[cluster_id]; in FindCandidates()
385 for (int i = SizeToInt(nodes_.size()) - 1; i >= 0; i--) { in Process()
402 return !IsPrimitiveCNode(this->nodes_[node_id], prim::kPrimTupleGetItem); in Process()
408 const auto &node = nodes_[clusters[i][0]]; in Process()
423 [this](size_t id) { return this->nodes_[id]; }); in CreateFuncGraph()
464 if (IsPrimitiveCNode(nodes_[cluster_id], prim::kPrimTupleGetItem)) { in RemoveWildGetitem()
490 nodes_ = TopoSort(func_graph->get_return(), SuccIncoming, in Init()
492 for (size_t i = 0; i < nodes_.size(); i++) { in Init()
493 node_idx_map_[nodes_[i]] = i; in Init()
[all …]
|
| D | graph_kernel_cluster.h | 53 std::vector<AnfNodePtr>().swap(nodes_); in Clean()
59 std::vector<AnfNodePtr> nodes_; variable
|
| /third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 294 explicit PointerMap(const Vec<Node*>* nodes) : nodes_(nodes) { in PointerMap()
301 Node* n = (*nodes_)[i]; in Find()
310 (*nodes_)[i]->next_hash = *head; in Add()
320 Node* n = (*nodes_)[index]; in Remove()
335 const Vec<Node*>* nodes_; member in absl::synchronization_internal::__anonf7c977ba0111::PointerMap
346 Vec<Node*> nodes_; member
357 Rep() : ptrmap_(&nodes_) {} in Rep()
361 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
372 for (auto* node : rep_->nodes_) { in ~GraphCycles()
383 for (uint32_t x = 0; x < r->nodes_.size(); x++) { in CheckInvariants()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 294 explicit PointerMap(const Vec<Node*>* nodes) : nodes_(nodes) { in PointerMap()
301 Node* n = (*nodes_)[i]; in Find()
310 (*nodes_)[i]->next_hash = *head; in Add()
320 Node* n = (*nodes_)[index]; in Remove()
335 const Vec<Node*>* nodes_; member in absl::synchronization_internal::__anonbc76c36f0111::PointerMap
346 Vec<Node*> nodes_; member
357 Rep() : ptrmap_(&nodes_) {} in Rep()
361 Node* n = rep->nodes_[NodeIndex(id)]; in FindNode()
372 for (auto* node : rep_->nodes_) { in ~GraphCycles()
383 for (uint32_t x = 0; x < r->nodes_.size(); x++) { in CheckInvariants()
[all …]
|
| /third_party/flutter/skia/third_party/externals/spirv-tools/source/util/ |
| D | move_to_front.h | 54 nodes_.reserve(reserve_capacity);
57 nodes_.emplace_back(Node());
122 uint32_t handle = static_cast<uint32_t>(nodes_.size()); in CreateNode()
126 nodes_.emplace_back(Node()); in CreateNode()
127 Node& node = nodes_.back(); in CreateNode()
152 return nodes_.at(node).value; in ValueOf()
157 return nodes_.at(node).left; in LeftOf()
162 return nodes_.at(node).right; in RightOf()
167 return nodes_.at(node).parent; in ParentOf()
173 return nodes_.at(node).timestamp; in TimestampOf()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/ |
| D | execution_tree.h | 83 DatasetOp &operator*() { return *nodes_[ind_]; } // dereference operator
84 std::shared_ptr<DatasetOp> operator->() { return nodes_[ind_]; }
88 std::shared_ptr<DatasetOp> get() { return nodes_[ind_]; } in get()
90 bool operator==(const Iterator &rhs) { return nodes_[ind_] == rhs.nodes_[rhs.ind_]; }
92 bool operator!=(const Iterator &rhs) { return nodes_[ind_] != rhs.nodes_[rhs.ind_]; }
94 int32_t NumNodes() { return nodes_.size(); } in NumNodes()
98 std::vector<std::shared_ptr<DatasetOp>> nodes_; // store the nodes in post order variable
|
| /third_party/mindspore/mindspore/lite/test/ut/tools/converter/registry/parser/ |
| D | model_parser_test.cc | 78 nodes_.insert(std::make_pair(input, parameter)); in BuildGraphInputs()
111 if (nodes_.find(input) != nodes_.end()) { in BuildGraphNodes()
112 anf_inputs.push_back(nodes_[input]); in BuildGraphNodes()
127 nodes_.insert(std::make_pair(input, parameter)); in BuildGraphNodes()
134 nodes_.insert(std::make_pair(node_name, cnode)); in BuildGraphNodes()
152 if (nodes_.find(outputs[0]) == nodes_.end()) { in BuildGraphOutputs()
156 auto return_cnode = res_graph_->NewCNode(return_prim, {nodes_[outputs[0]]}); in BuildGraphOutputs()
|
| /third_party/boost/libs/intrusive/example/ |
| D | doc_stateful_value_traits.cpp | 35 : ids_(ids), nodes_(node_array) in stateful_value_traits()
40 { return this->nodes_ + (&value - this->ids_); } in to_node_ptr()
42 { return this->nodes_ + (&value - this->ids_); } in to_node_ptr()
44 { return this->ids_ + (n - this->nodes_); } in to_value_ptr()
46 { return this->ids_ + (n - this->nodes_); } in to_value_ptr()
50 node_ptr nodes_; member
|
| /third_party/ninja/src/ |
| D | deps_log.cc | 215 assert(deps_data[i] < (int)nodes_.size()); in Load()
216 assert(nodes_[deps_data[i]]); in Load()
217 deps->nodes[i] = nodes_[deps_data[i]]; in Load()
244 int id = nodes_.size(); in Load()
252 nodes_.push_back(node); in Load()
312 for (vector<Node*>::iterator i = nodes_.begin(); i != nodes_.end(); ++i) in Recompact()
320 if (!IsDepsEntryLiveFor(nodes_[old_id])) in Recompact()
323 if (!new_log.RecordDeps(nodes_[old_id], deps->mtime, in Recompact()
334 nodes_.swap(new_log.nodes_); in Recompact()
391 int id = nodes_.size(); in RecordId()
[all …]
|
| /third_party/mindspore/mindspore/lite/src/runtime/kernel/opencl/ |
| D | opencl_subgraph.cc | 85 GetKernelFromToTensor(in_tensors, nodes_, &loop_kernels, true); in GenToFormatOp()
177 nodes_.insert(nodes_.begin(), in_convert_ops_.begin(), in_convert_ops_.end()); in InsertOpsPass()
186 nodes_.insert(nodes_.end(), out_convert_ops_.begin(), out_convert_ops_.end()); in InsertOpsPass()
230 for (auto iv : nodes_) { in UpdateTensorDataTypePass()
287 for (auto *node : nodes_) { in GetInOutNodes()
318 for (auto node : this->nodes_) { in Prepare()
350 auto ret = opencl_exec->RunOrTune(in_tensors(), out_tensors(), nodes_, nullptr, nullptr, true); in Prepare()
368 for (const auto &op : nodes_) { in UnInit()
371 nodes_.clear(); in UnInit()
380 for (auto kernel : nodes_) { in ReSize()
[all …]
|
| D | opencl_fusion.cc | 687 for (auto *node : nodes_) { in FusionPass()
696 return std::find(nodes_.begin(), nodes_.end(), a) > std::find(nodes_.begin(), nodes_.end(), b); in FusionPass()
715 if (!AIsInB(succ, &qset) && !AIsInB(succ, &removed_set) && AIsInB(succ, &nodes_)) { in FusionPass()
722 if (TryMergeEltwiseEltwise(node, &removed_set, &nodes_) == RET_OK) { in FusionPass()
727 DoSpecificFusion(node, &removed_set, &nodes_); in FusionPass()
733 MS_LOG(DEBUG) << "number of kernels(before fusion): " << nodes_.size(); in FusionPass()
734 nodes_.erase( in FusionPass()
735 …std::remove_if(nodes_.begin(), nodes_.end(), [&](LiteKernel *node) { return AIsInB(node, &removed_… in FusionPass()
736 nodes_.end()); in FusionPass()
737 MS_LOG(DEBUG) << "number of kernels(after fusion) : " << nodes_.size(); in FusionPass()
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | dominator_tree.h | 207 nodes_.clear(); in ClearTree()
256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode()
257 if (node_iter == nodes_.end()) { in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode()
266 if (node_iter == nodes_.end()) { in GetTreeNode()
296 DominatorTreeNodeMap nodes_; variable
|
| D | dominator_tree.cpp | 265 auto a_itr = nodes_.find(a); in ImmediateDominator()
266 if (a_itr == nodes_.end()) return nullptr; in ImmediateDominator()
281 nodes_.find(bb->id()); in GetOrInsertNode()
282 if (node_iter == nodes_.end()) { in GetOrInsertNode()
283 dtn = &nodes_.emplace(std::make_pair(bb->id(), DominatorTreeNode{bb})) in GetOrInsertNode()
|
| /third_party/spirv-tools/source/opt/ |
| D | dominator_tree.h | 207 nodes_.clear(); in ClearTree()
256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode()
257 if (node_iter == nodes_.end()) { in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode()
266 if (node_iter == nodes_.end()) { in GetTreeNode()
296 DominatorTreeNodeMap nodes_; variable
|
| D | dominator_tree.cpp | 265 auto a_itr = nodes_.find(a); in ImmediateDominator()
266 if (a_itr == nodes_.end()) return nullptr; in ImmediateDominator()
281 nodes_.find(bb->id()); in GetOrInsertNode()
282 if (node_iter == nodes_.end()) { in GetOrInsertNode()
283 dtn = &nodes_.emplace(std::make_pair(bb->id(), DominatorTreeNode{bb})) in GetOrInsertNode()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | dominator_tree.h | 207 nodes_.clear(); in ClearTree()
256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode()
257 if (node_iter == nodes_.end()) { in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode()
266 if (node_iter == nodes_.end()) { in GetTreeNode()
296 DominatorTreeNodeMap nodes_; variable
|
| D | dominator_tree.cpp | 265 auto a_itr = nodes_.find(a); in ImmediateDominator()
266 if (a_itr == nodes_.end()) return nullptr; in ImmediateDominator()
281 nodes_.find(bb->id()); in GetOrInsertNode()
282 if (node_iter == nodes_.end()) { in GetOrInsertNode()
283 dtn = &nodes_.emplace(std::make_pair(bb->id(), DominatorTreeNode{bb})) in GetOrInsertNode()
|
| /third_party/mindspore/mindspore/lite/tools/common/ |
| D | func_graph_subgraph.cc | 51 this->nodes_ = nodes; in Reset()
70 std::set<CNodePtr> SubGraph::GetNodes() const { return this->nodes_; } in GetNodes()
167 this->nodes_.insert(cur_node); in InitSubGraphNode()
196 if (this->nodes_.count(input_cnode) == 0) { in InitSubGraphNode()
224 for (const auto &node : this->nodes_) { in InitSubGraphInNode()
235 if (this->nodes_.count(input_cnode) == 0) { in InitSubGraphInNode()
264 for (const auto &node : this->nodes_) { in InitSubGraphOutNode()
285 if (this->nodes_.count(output_cnode) == 0) { in InitSubGraphOutNode()
409 if (this->nodes_.empty()) { in CreatePartialInBelongAnf()
412 graph_name = (*(this->nodes_.begin()))->fullname_with_scope() + "/subgraph"; in CreatePartialInBelongAnf()
[all …]
|
| /third_party/mindspore/mindspore/lite/tools/converter/parser/caffe/ |
| D | caffe_model_parser.cc | 328 nodes_.insert(std::pair(layer.top(0), parameter)); in ConvertGraphInputsOfLayer()
361 nodes_.insert(std::pair(caffe_model_.input(i), parameter)); in ConvertGraphInputsOfShape()
393 nodes_.insert(std::pair(caffe_model_.input(i), parameter)); in ConvertGraphInputsOfDim()
427 if (nodes_.find(output_node) == nodes_.end()) { in ConvertGraphOutputs()
431 auto cnode = nodes_.find(output_node)->second; in ConvertGraphOutputs()
455 if (nodes_.find(caffeInspector.GetGraphOutput().front()) == nodes_.end()) { in ConvertGraphOutputs()
459 auto cnode = nodes_.find(caffeInspector.GetGraphOutput().front())->second; in ConvertGraphOutputs()
560 if (nodes_.find(origin_layer) == nodes_.end()) { in ConvertBottom()
564 input_nodes->emplace_back(nodes_.find(origin_layer)->second); in ConvertBottom()
577 nodes_[layer.top(0)] = cnode; in ConvertTop()
[all …]
|
| /third_party/flutter/engine/flutter/lib/ui/semantics/ |
| D | semantics_update.cc | 28 : nodes_(std::move(nodes)), actions_(std::move(actions)) {} in SemanticsUpdate()
33 return std::move(nodes_); in takeNodes()
|