| /third_party/mindspore/mindspore/_extends/graph_kernel/ |
| D | splitter.py | 54 def _dump_split_info(flags, graph_json, graph_desc, subgraphs, graph_mode): argument
64 if len(subgraphs) > 1 or subgraphs[0].stitch_info.has_stitch_op():
65 for i, g in enumerate(subgraphs):
|
| /third_party/mindspore/mindspore/lite/src/ |
| D | sub_graph_split.cc | 74 bool SearchSubGraph::CheckIsParallelSubGraph(const std::vector<Subgraph> &subgraphs) { in CheckIsParallelSubGraph() argument
75 if (subgraphs.size() != kDefaultSubGraphSize) { in CheckIsParallelSubGraph()
79 for (const auto &sub_graph : subgraphs) { in CheckIsParallelSubGraph()
808 std::vector<Subgraph> &subgraphs = map.second; in SubGraphSplitByMiddle() local
809 if (subgraphs.size() < kDefaultSubGraphSize) { in SubGraphSplitByMiddle()
813 CalculateCostModel(&subgraphs); in SubGraphSplitByMiddle()
818 InitSubgraphRuntimeInfo(&subgraphs); in SubGraphSplitByMiddle()
819 SubgraphFusion(&subgraphs); in SubGraphSplitByMiddle()
821 MS_ASSERT(subgraphs.size() == kDefaultSubGraphSize); in SubGraphSplitByMiddle()
822 …if (subgraphs.at(kDefaultFirstSubgraph).nodes_.empty() || subgraphs.at(kDefaultSecondSubgraph).nod… in SubGraphSplitByMiddle()
[all …]
|
| D | sub_graph_split.h | 109 bool CheckIsParallelSubGraph(const std::vector<Subgraph> &subgraphs);
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | ssca.cpp | 341 std::vector<std::vector<vertex_descriptor> > subgraphs; in subgraph_extraction() local
378 subgraphs.push_back(std::vector<vertex_descriptor>()); in subgraph_extraction()
379 std::vector<vertex_descriptor>& subgraph = subgraphs.back(); in subgraph_extraction()
393 for (unsigned int i = 0; i < subgraphs.size(); i++) { in subgraph_extraction()
394 all_gather(pg, subgraphs[i].begin(), subgraphs[i].end(), subgraphs[i]); in subgraph_extraction()
395 std::sort(subgraphs[i].begin(), subgraphs[i].end()); in subgraph_extraction()
396 subgraphs[i].erase(std::unique(subgraphs[i].begin(), subgraphs[i].end()), in subgraph_extraction()
397 subgraphs[i].end()); in subgraph_extraction()
401 for (int i = 0; abs(i) < subgraphs.size(); i++) { in subgraph_extraction()
403 for (int j = 0; abs(j) < subgraphs[i].size(); j++) in subgraph_extraction()
[all …]
|
| /third_party/mindspore/tests/st/graph_kernel/model/ |
| D | graph_kernel_split.py | 83 subgraphs = []
92 subgraphs.append(g)
98 subgraphs.append(g)
99 return subgraphs
|
| D | test_split.py | 373 subgraphs = sp.split(False)
376 for i, g in enumerate(subgraphs):
382 fc, sub_costs = model.estimate(subgraphs)
403 subgraphs = split.GraphSplitByPatternV2(graph).split()
404 for i, g in enumerate(subgraphs):
408 assert len(subgraphs) == expect_n
|
| /third_party/mindspore/mindspore/lite/test/config/ |
| D | models_npu_fp16.cfg | 43 #hdc_retinaface #too many subgraphs
51 # hdc_ocr_attention.onnx 0.5 #too many subgraphs
52 # hdc_ocr_detect.onnx 30 #too many subgraphs
|
| D | models_npu.cfg | 59 #hdc_retinaface #too many subgraphs
67 hdc_ocr_attention.onnx 0.5 #too many subgraphs
68 # hdc_ocr_detect.onnx 30 #too many subgraphs
|
| /third_party/boost/libs/graph/doc/ |
| D | read_graphviz.rst | 208 - ``read_graphviz`` treats subgraphs as syntactic sugar. It does not
209 reflect subgraphs as actual entities in the BGL. Rather, they are
215 - Subgraph IDs refer to subgraphs defined earlier in the graph
216 description. Undefined subgraphs behave as empty subgraphs
232 - Support for optional recognition of subgraphs as distinct entities.
|
| D | isomorphism-impl-v2.w | 97 each subgraph such that the new subgraphs are still isomorphic to one
99 that can be added to extend the isomorphic subgraphs. We then
100 backtrack to previous smaller matching subgraphs, and try extending
128 of the isomorphism between subgraphs $G_1[k]$ and $G_2[S]$. At this
565 to right to extend isomorphic subgraphs, and move back to the right
1056 % LocalWords: Isomorphism Siek isomorphism adjacency subgraph subgraphs OM DFS
|
| D | isomorphism-impl-v3.w | 115 that the new subgraphs are still isomorphic to one another. At some
117 to extend the isomorphic subgraphs. We then backtrack to previous
118 smaller matching subgraphs, and try extending with a different vertex
380 have a matching vertex $v$ we extend the matching subgraphs by
976 % LocalWords: Isomorphism Siek isomorphism adjacency subgraph subgraphs OM DFS
|
| D | isomorphism-impl.w | 104 each subgraph such that the new subgraphs are still isomorphic to one
106 that can be added to extend the isomorphic subgraphs. We then
107 backtrack to previous smaller matching subgraphs, and try extending
1195 % LocalWords: Isomorphism Siek isomorphism adjacency subgraph subgraphs OM DFS
|
| /third_party/boost/libs/graph/src/ |
| D | read_graphviz_new.cpp | 526 std::map< subgraph_name, subgraph_info > subgraphs; member
532 subgraph_info& current() { return subgraphs[current_subgraph_name]; } in current()
786 if (subgraphs.find(name) == subgraphs.end()) in parse_subgraph()
788 subgraphs[name] in parse_subgraph()
790 subgraphs[name].members.clear(); // Except member list in parse_subgraph()
976 = subgraphs.find(ep.subgraph_ep); in get_recursive_members()
977 if (info_i != subgraphs.end()) in get_recursive_members()
|
| /third_party/mindspore/mindspore/lite/src/runtime/ |
| D | runtime_pass.h | 29 void RuntimePass(std::vector<kernel::LiteKernel *> *subgraphs, std::vector<Tensor *> *tensors);
|
| D | runtime_pass.cc | 230 void RuntimePass(std::vector<kernel::LiteKernel *> *subgraphs, std::vector<Tensor *> *tensors) { in RuntimePass() argument
231 for (auto subgraph : *subgraphs) { in RuntimePass()
|
| /third_party/mindspore/mindspore/lite/tools/converter/parser/tflite/ |
| D | tflite_model_parser.cc | 60 if (tflite_model_->subgraphs.empty()) { in TfliteModelVerify()
67 for (auto &subgraph : tflite_model_->subgraphs) { in TfliteModelVerify()
165 auto subgraph_num = tflite_model_->subgraphs.size(); in ConvertTfliteGraph()
168 const auto &tflite_subgraph = tflite_model_->subgraphs.at(idx); in ConvertTfliteGraph()
451 if (tflite_subgraph == tflite_model_->subgraphs.front()) { in ConvertGraphInputs()
526 if (tflite_subgraph == tflite_model_->subgraphs.front()) { in ConvertGraphOutputs()
|
| D | schema.fbs | 17 // Version 1: Add subgraphs to schema.
1073 // All the subgraphs of the model. The 0th is assumed to be the main
1075 subgraphs:[SubGraph];
|
| /third_party/skia/third_party/externals/harfbuzz/docs/ |
| D | repacker.md | 135 subtables of the two subgraphs, potentially resulting in overflows. Since each of these subgraphs a…
164 The above is an ideal situation where the subgraphs are disconnected from each other, in practice
185 subgraphs and assigning unique spaces to each one. More information on the space assignment can be
193 The goal of space assignment is to find connected subgraphs that are only reachable via 32 bit offs…
|
| /third_party/mindspore/mindspore/_extends/graph_kernel/model/ |
| D | graph_split.py | 460 subgraphs = []
464 …subgraphs.append(Graph('{}_{}'.format(self.graph.name, i), area.ops, area.stitch_info, area.recomp…
466 return subgraphs, graphmodes
480 subgraphs, graphmodes = self.to_subgraphs()
481 return subgraphs, graphmodes
|
| /third_party/mindspore/third_party/proto/tensorflow/lite/ |
| D | schema.fbs | 17 // Version 1: Add subgraphs to schema.
1073 // All the subgraphs of the model. The 0th is assumed to be the main
1075 subgraphs:[SubGraph];
|
| D | schema_2.4.1.fbs | 17 // Version 1: Add subgraphs to schema.
1122 // All the subgraphs of the model. The 0th is assumed to be the main
1124 subgraphs:[SubGraph];
|
| /third_party/mindspore/ |
| D | RELEASE.md | 101 - Fix bug of too many subgraphs when network include`for` statement.([!23669](https://gitee.com/min…
2377 2. Optimize sub-graph mechanism by dynamically splitting the entire graph into multiple subgraphs b…
2512 - Move 'multi-subgraphs' interface to internal([!5696](https://gitee.com/mindspore/mindspore/pulls/…
|
| /third_party/chromium/patch/ |
| D | 0001-cve.patch | 25320 @@ -165,7 +165,7 @@ The above is an ideal situation where the subgraphs are disconnected from each o
|