Home
last modified time | relevance | path

Searched refs:subgraph (Results 1 – 25 of 98) sorted by relevance

1234

/third_party/boost/boost/graph/
Dsubgraph.hpp82 template < typename Graph > class subgraph class
85 typedef std::list< subgraph< Graph >* > ChildrenList;
119 subgraph() : m_parent(0), m_edge_counter(0) {} in subgraph() function in boost::subgraph
121 subgraph(const graph_property_type& p) in subgraph() function in boost::subgraph
126 subgraph(vertices_size_type n, in subgraph() function in boost::subgraph
137 subgraph(const subgraph& x) : m_parent(x.m_parent), m_edge_counter(0) in subgraph() function in boost::subgraph
149 typename subgraph< Graph >::vertex_iterator vi, vi_end; in subgraph()
159 typename subgraph< Graph >::children_iterator i, i_end; in subgraph()
163 m_children.push_back(new subgraph< Graph >(*i)); in subgraph()
168 ~subgraph() in ~subgraph()
[all …]
/third_party/mindspore/mindspore/lite/tools/converter/legacy_optimizer/graph/
Dsubgraph_node_pass.cc31 STATUS SubgraphNodePass::GetSubgraphAllTensorIndices(const std::unique_ptr<SubGraphT> &subgraph, in GetSubgraphAllTensorIndices() argument
33 for (auto &node_idx : subgraph->nodeIndices) { in GetSubgraphAllTensorIndices()
54 const std::unique_ptr<SubGraphT> &subgraph) { in IsNodeInputInSubgraph() argument
55 …return std::any_of(node->inputIndex.begin(), node->inputIndex.end(), [&tensors_indices, &subgraph]… in IsNodeInputInSubgraph()
56 return (tensors_indices.count(idx) > 0) || IsContain(subgraph->inputIndices, idx); in IsNodeInputInSubgraph()
62 const std::unique_ptr<SubGraphT> &subgraph) { in IsNodeOutputInSubgraph() argument
63 …f(node->outputIndex.begin(), node->outputIndex.end(), [&tensors_indices, &subgraph](uint32_t idx) { in IsNodeOutputInSubgraph()
64 return (tensors_indices.count(idx) > 0) || IsContain(subgraph->outputIndices, idx); in IsNodeOutputInSubgraph()
69 for (auto &subgraph : graph->subGraph) { in DecreaseSubgraphNodeIndices() local
70 …std::transform(subgraph->nodeIndices.begin(), subgraph->nodeIndices.end(), subgraph->nodeIndices.b… in DecreaseSubgraphNodeIndices()
[all …]
Dsubgraph_tensor_pass.cc39 for (const auto &subgraph : graph->subGraph) { in IsUsing() local
40 if (IsContain<uint32_t>(subgraph->inputIndices, tensor_idx)) { in IsUsing()
43 if (IsContain<uint32_t>(subgraph->outputIndices, tensor_idx)) { in IsUsing()
51 for (const auto &subgraph : graph->subGraph) { in UpdateTensorIdx() local
52 UpdateVec<uint32_t>(&(subgraph->inputIndices), tensor_idx); in UpdateTensorIdx()
53 UpdateVec<uint32_t>(&(subgraph->outputIndices), tensor_idx); in UpdateTensorIdx()
Dsubgraph_node_pass.h39 …STATUS GetSubgraphAllTensorIndices(const std::unique_ptr<SubGraphT> &subgraph, schema::MetaGraphT …
42 const std::unique_ptr<SubGraphT> &subgraph);
44 const std::unique_ptr<SubGraphT> &subgraph);
Dinfershape_pass.cc316 auto &subgraph = graph->subGraph.at(subgraph_index); in CopyPartialShapeToSubGraph() local
318 if (subgraph->inputIndices.size() != partial_node->inputIndex.size()) { in CopyPartialShapeToSubGraph()
321 … << " subgraph " << subgraph_index << " input size: " << subgraph->inputIndices.size(); in CopyPartialShapeToSubGraph()
326 auto &subgraph_input = graph->allTensors.at(subgraph->inputIndices[i]); in CopyPartialShapeToSubGraph()
347 auto &subgraph = graph->subGraph.at(subgraph_index); in RestoreSubGraphInput() local
348 for (size_t i = 0; i < subgraph->inputIndices.size(); ++i) { in RestoreSubGraphInput()
349 auto &subgraph_input = graph->allTensors.at(subgraph->inputIndices[i]); in RestoreSubGraphInput()
565 auto &subgraph = graph->subGraph.at(subgraph_index); in InitSearchTensor() local
567 if (IsContain(subgraph->inputIndices, i) || !graph->allTensors.at(i)->data.empty()) { in InitSearchTensor()
571 for (size_t i = 0; i < subgraph->nodeIndices.size(); i++) { in InitSearchTensor()
[all …]
/third_party/boost/libs/graph/example/
Dgraphviz_test.dot3 subgraph cluster0 { //subgraph<Graph>
8 subgraph inner { //subgraph<Graph> or subgraph of subgraph
14 a0 -> subgraph inner;
19 subgraph cluster1 {
26 subgraph cluster1 -> subgraph cluster0 [style=dashed color=red]
28 start -> subgraph inner[style=dotted];
/third_party/mindspore/mindspore/lite/src/
Dsub_graph_split.cc216 for (Subgraph &subgraph : *sub_graphs) { in ConvertSubGraphToModel()
217 if (subgraph.nodes_.empty()) { in ConvertSubGraphToModel()
221 DeviceType device_type = subgraph.device_; in ConvertSubGraphToModel()
222 size_t thread_num = subgraph.thread_; 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()
266 for (uint32_t head_index : subgraph.heads_) { in ConvertSubGraphToModel()
292 for (uint32_t end_index : subgraph.ends_) { in ConvertSubGraphToModel()
378 void SearchSubGraph::InsertNode(uint32_t index, Subgraph *subgraph, uint32_t last_index) { in InsertNode() argument
[all …]
Dlite_model.h165 auto *subgraph = new (std::nothrow) LiteGraph::SubGraph(); in MetaGraphMappingSubGraph() local
166 if (subgraph == nullptr) { in MetaGraphMappingSubGraph()
171 subgraph->name_ = meta_graph.name()->c_str(); in MetaGraphMappingSubGraph()
175subgraph->input_indices_.push_back(size_t(meta_graph.inputIndex()->template GetAs<uint32_t>(i))); in MetaGraphMappingSubGraph()
179subgraph->output_indices_.push_back(size_t(meta_graph.outputIndex()->template GetAs<uint32_t>(i))); in MetaGraphMappingSubGraph()
183 subgraph->node_indices_.push_back(i); in MetaGraphMappingSubGraph()
187 subgraph->tensor_indices_.push_back(i); in MetaGraphMappingSubGraph()
189 this->graph_.sub_graphs_.push_back(subgraph); in MetaGraphMappingSubGraph()
Dscheduler.cc356 for (auto subgraph : *dst_kernels) { in Schedule()
357 MS_LOG(DEBUG) << "[subgraph] : " << subgraph->name() << ", type:" << subgraph->subgraph_type(); in Schedule()
358 if (subgraph->desc().arch == kernel::KERNEL_ARCH::kDelegate) { in Schedule()
361 …kernel ::LiteKernel *> kernel_list = reinterpret_cast<kernel::SubGraphKernel *>(subgraph)->nodes(); in Schedule()
629 auto subgraph = src_model_->graph_.sub_graphs_.at(subgraph_index); in RestoreSubGraphInput() local
630 for (size_t i = 0; i < subgraph->input_indices_.size(); ++i) { in RestoreSubGraphInput()
631 auto &subgraph_input = src_tensors_->at(subgraph->input_indices_[i]); in RestoreSubGraphInput()
646 auto subgraph = src_model_->graph_.sub_graphs_.at(subgraph_index); in CopyPartialShapeToSubGraph() local
647 if (subgraph->input_indices_.size() != partial_node->input_indices_.size()) { in CopyPartialShapeToSubGraph()
650 << " subgraph input size: " << subgraph->input_indices_.size(); in CopyPartialShapeToSubGraph()
[all …]
Dsub_graph_split.h95 void InsertNode(uint32_t index, Subgraph *subgraph, uint32_t last_index);
102 void InsertNodeByMid(uint32_t node_index, Subgraph *subgraph, uint32_t last_index);
103 void InsertHeadNode(uint32_t index, Subgraph *subgraph);
124 void InsertParallelNode(uint32_t index, Subgraph *subgraph);
/third_party/mindspore/mindspore/lite/micro/coder/
Dtrain.cc30 std::set<OperatorCoder *> subgraph; in FindInferenceOpcoders() local
38 if (subgraph.find(curr) != subgraph.end()) { in FindInferenceOpcoders()
41 subgraph.insert(curr); in FindInferenceOpcoders()
47 auto item = subgraph.find(edge); in FindInferenceOpcoders()
48 if (item == subgraph.end()) { in FindInferenceOpcoders()
50 return subgraph; in FindInferenceOpcoders()
53 subgraph.erase(item); in FindInferenceOpcoders()
54 return subgraph; in FindInferenceOpcoders()
/third_party/mindspore/mindspore/_extends/graph_kernel/model/
Dmodel_builder.py172 def add_stitch_info(self, subgraph, desc): argument
174 if subgraph.stitch_info and subgraph.stitch_info.stitch_ops:
175 buffer_stitch = {'stitch_op': list(subgraph.stitch_info.stitch_ops)}
176 if subgraph.stitch_info.stitch_atomic_ops:
177 buffer_stitch['stitch_atomic_op'] = list(subgraph.stitch_info.stitch_atomic_ops)
181 def add_recompute_ops(self, subgraph, desc): argument
183 if subgraph.recompute_ops:
184 desc['recompute_ops'] = [op.output.name for op in subgraph.recompute_ops]
200 def dump(self, subgraph): argument
203 inputs, outputs = subgraph.deduce_parameters()
[all …]
/third_party/boost/boost/graph/detail/
Dread_graphviz_spirit.hpp218 >> (subgraph[data_stmt.dests = arg1] in definition()
228 = (subgraph[(data_stmt.dests in definition()
254 subgraph = !(as_lower_d[keyword_p("subgraph")] in definition()
255 >> (!ID[(subgraph.name = arg1), in definition()
256 (subgraph.nodes in definition()
258 (subgraph.edges in definition()
262 [(var(subgraph_nodes))[subgraph.name] in definition()
263 = subgraph.nodes] in definition()
264 [(var(subgraph_edges))[subgraph.name] in definition()
265 = subgraph.edges] in definition()
[all …]
/third_party/boost/libs/graph/src/
Dread_graphviz_new.cpp480 static edge_endpoint subgraph(const subgraph_name& ep) in subgraph() function
763 return edge_endpoint::subgraph(parse_subgraph(first_token)); in parse_endpoint_rest()
989 edge_endpoint::subgraph(ref.name)); in get_recursive_members()
1209 subgraph a -> b
1210 subgraph a {c}
1211 subgraph a -> d
1212 subgraph a {node [color=red]; e}
1213 subgraph a -> f
1214 subgraph a {g} -> h
1215 subgraph a {node [color=green]; i} -> j
[all …]
/third_party/mindspore/mindspore/lite/src/delegate/npu/pass/
Dnpu_pass_manager.cc27 int NPUPassManager::RunPass(NPUGraph *subgraph) { in RunPass() argument
29 auto ret = pass->Run(subgraph); in RunPass()
31 …R) << "NPU Pass Run failed. Pass name is:" << pass->name() << " for subgraph " << subgraph->name(); in RunPass()
/third_party/mindspore/mindspore/lite/tools/common/
Dfunc_graph_subgraph.cc88 std::set<CNodePtr> SubGraph::FindCommonOutputs(const SubGraphPtr &subgraph) const { in FindCommonOutputs()
89 if (subgraph == nullptr) { in FindCommonOutputs()
93 if (this == subgraph.get()) { in FindCommonOutputs()
96 std::set<CNodePtr> outputs_other = subgraph->GetOutputCNodes(); in FindCommonOutputs()
113 bool SubGraph::IfDependOnSameNode(const SubGraphPtr &subgraph) const { in IfDependOnSameNode()
114 if (subgraph == nullptr || this == subgraph.get()) { in IfDependOnSameNode()
118 std::set<CNodePtr> inputs_other = subgraph->GetInputCNodes(); in IfDependOnSameNode()
296 bool SubGraph::MergeSubGraph(const SubGraphPtr &subgraph) { in MergeSubGraph() argument
297 if (subgraph == nullptr || this == subgraph.get()) { in MergeSubGraph()
302 auto common_outputs = this->FindCommonOutputs(subgraph); in MergeSubGraph()
[all …]
Dfunc_graph_subgraph.h43 bool MergeSubGraph(const SubGraphPtr &subgraph);
59 std::set<CNodePtr> FindCommonOutputs(const SubGraphPtr &subgraph) const;
60 bool IfDependOnSameNode(const SubGraphPtr &subgraph) const;
/third_party/boost/libs/graph_parallel/doc/
Dlocal_subgraph.rst10 The local subgraph adaptor takes an existing `Distributed Graph` and
30 The local subgraph adaptor adapts and forwards all operations of
32 operations unique to the local subgraph adaptor are presented.
41 Constructs a local subgraph presenting the local portion of the
61 Constructs a local subgraph presenting the local portion of the
/third_party/libinput/doc/user/dot/
Dlibinput-stack-xorg.gv9 subgraph cluster_2 {
15 subgraph cluster_0 {
17 subgraph cluster_1 {
Dlibinput-stack-wayland.gv9 subgraph cluster_2 {
15 subgraph cluster_0 {
Dlibinput-stack-gnome.gv13 subgraph cluster0 {
22 subgraph cluster3 {
/third_party/mindspore/mindspore/lite/src/runtime/
Druntime_pass.cc138 bool RuntimePassValid(kernel::SubGraphKernel *subgraph) { in RuntimePassValid() argument
139 if (subgraph->desc().arch != kernel::KERNEL_ARCH::kCPU) { in RuntimePassValid()
143 auto kernels = subgraph->nodes(); in RuntimePassValid()
168 kernel::SubGraphKernel *subgraph = reinterpret_cast<kernel::SubGraphKernel *>(kernel); in Nc4hw4PassAct() local
169 std::vector<kernel::LiteKernel *> &particial_nodes = subgraph->nodes(); in Nc4hw4PassAct()
231 for (auto subgraph : *subgraphs) { in RuntimePass()
232 auto sub = reinterpret_cast<kernel::SubGraphKernel *>(subgraph); in RuntimePass()
/third_party/skia/third_party/externals/harfbuzz/src/
Dhb-repacker.hh404 hb_hashmap_t<unsigned, unsigned> subgraph; in isolate_subgraph() local
411 subgraph.set (root_idx, wide_parents (root_idx, parents)); in isolate_subgraph()
412 find_subgraph (root_idx, subgraph); in isolate_subgraph()
418 for (auto entry : subgraph.iter ()) in isolate_subgraph()
443 + subgraph.keys () in isolate_subgraph()
467 void find_subgraph (unsigned node_idx, hb_hashmap_t<unsigned, unsigned>& subgraph) in find_subgraph()
471 if (subgraph.has (link.objidx)) in find_subgraph()
473 subgraph.set (link.objidx, subgraph[link.objidx] + 1); in find_subgraph()
476 subgraph.set (link.objidx, 1); in find_subgraph()
477 find_subgraph (link.objidx, subgraph); in find_subgraph()
[all …]
/third_party/boost/libs/graph/example/figs/
Dcc-internet.dot5 subgraph cluster0 {
14 subgraph cluster1 {
23 subgraph cluster2 {
28 subgraph cluster3 {
/third_party/weston/doc/doxygen/
Dtools_arch_new.gv31 subgraph cluster_0 {
45 subgraph cluster_1 {
51 subgraph cluster_2 {
57 subgraph cluster_3 {

1234