Home
last modified time | relevance | path

Searched refs:graph (Results 1 - 25 of 27) sorted by relevance

12

/foundation/resourceschedule/ffrt/test/ut/testcase/
H A Dut_graphCheck.cpp50 GraphCheckCyclic graph; in HWTEST_F() local
52 graph.AddVetexByLabel(0x12); in HWTEST_F()
53 graph.AddVetexByLabel(0x34); in HWTEST_F()
54 graph.AddEdgeByLabel(0x12, 0x34); in HWTEST_F()
55 graph.AddEdgeByLabel(0x34, 0x12); in HWTEST_F()
57 EXPECT_EQ(graph.VertexNum(), 2); in HWTEST_F()
58 EXPECT_EQ(graph.IsCyclic(), true); in HWTEST_F()
63 GraphCheckCyclic graph; in HWTEST_F() local
65 graph.AddVetexByLabel(0x12); in HWTEST_F()
66 graph in HWTEST_F()
[all...]
/foundation/distributeddatamgr/udmf/framework/innerkitsimpl/test/unittest/
H A Dgraph_test.cpp22 #include "graph.h"
73 Graph graph(vextexNum, {}); in HWTEST_F()
75 graph.AddEdge(edges[i][0], edges[i][1]); in HWTEST_F()
77 bool isDAGFlag = graph.DfsUnconnectedGraph([&](uint32_t currNode) -> bool in HWTEST_F()
95 Graph graph(vextexNum, {}); in HWTEST_F()
97 graph.AddEdge(edges[i][0], edges[i][1]); in HWTEST_F()
99 bool isDAGFlag = graph.DfsUnconnectedGraph([&](uint32_t currNode) -> bool in HWTEST_F()
118 Graph graph(vextexNum, {}); in HWTEST_F()
120 graph.AddEdge(edges[i][0], edges[i][1]); in HWTEST_F()
122 bool isDAGFlag = graph in HWTEST_F()
[all...]
/foundation/resourceschedule/ffrt/src/sync/
H A Dmutex_private.h35 GraphCheckCyclic graph; member in ffrt::MutexGraph
69 graph.AddVetexByLabel(task); in AddNode()
71 graph.AddEdgeByLabel(ownerTask, task); in AddNode()
72 if (graph.IsCyclic()) { in AddNode()
98 graph.RemoveEdgeByLabel(task); in RemoveNode()
/foundation/distributeddatamgr/udmf/framework/common/
H A Dutd_graph.cpp87 auto graph = std::make_unique<Graph>(descriptorsNum, typeIdIndex); in ConstructNewGraph() local
92 graph->AddEdge(belongsToType, descriptorCfg.typeId); in ConstructNewGraph()
95 return graph; in ConstructNewGraph()
98 void UtdGraph::Update(std::unique_ptr<Graph> graph) in Update() argument
101 graph_ = std::move(graph); in Update()
H A Dutd_graph.h24 #include "graph.h"
37 void Update(std::unique_ptr<Graph> graph);
H A Dutd_cfgs_checker.cpp203 auto graph = UtdGraph::GetInstance().ConstructNewGraph(allTypeCfgs); in CanConstructDAG() local
204 if (graph->IsDAG()) { in CanConstructDAG()
/foundation/multimedia/media_foundation/engine/pipeline/core/
H A Dpipeline_core.cpp256 void ConstructGraph(const std::vector<Filter*> &filters, std::vector<FilterNode> &graph, std::stack<size_t> &stack) in ConstructGraph() argument
258 std::map<Filter*, size_t> mapInfo; // filter to index map, index is the node index in graph in ConstructGraph()
261 graph.emplace_back(FilterNode(f->GetPreFilters().size(), f, {})); in ConstructGraph()
268 auto& tmp = graph[mapInfo[f]].nexts; in ConstructGraph()
278 std::vector<FilterNode> graph; in ReorderFilters() local
280 ConstructGraph(filters_, graph, stack); in ReorderFilters()
285 for (const auto& idx : graph[cur].nexts) { in ReorderFilters()
286 graph[idx].inDegree--; in ReorderFilters()
287 if (graph[idx].inDegree == 0) { in ReorderFilters()
291 result.emplace_back(graph[cu in ReorderFilters()
[all...]
/foundation/arkui/ace_engine/test/tools/event_tree_to_graph/src/graph/
H A Dgraph_converter.py98 graph: Digraph,
105 graph.node(node_name, node_label, tooltip=item.item_self.to_string())
107 graph.edge(parent_node_name, node_name, color=edge_colors[finger])
109 draw_event_scop_tree_recursively(item.children, node_name, finger, graph, is_show_detail)
138 # create a graph
151 log_message('event trees graph generated done, count: ' + str(current_index))
200 graph: Digraph):
204 graph.node(node_name, node_label, tooltip=item.item_self.to_string())
206 graph.edge(parent_node_name, node_name)
208 draw_hittest_result_recursively(item.children, node_name, graph)
[all...]
/foundation/ai/neural_network_runtime/example/drivers/nnrt/v1_0/hdi_cpu_service/src/
H A Dnnrt_device_service.cpp114 auto graph = TransModelToGraph(model); in PrepareModel() local
115 if (graph == nullptr) { in PrepareModel()
116 HDF_LOGE("Transfrom model to graph failed."); in PrepareModel()
133 ret = service->Compile(graph); in PrepareModel()
318 for (auto graph : model.subGraph) { in TransModelToGraph()
319 metaGraph->subGraph.emplace_back(TransSubGraph(graph, numTensor)); in TransModelToGraph()
390 std::unique_ptr<mindspore::schema::SubGraphT> NnrtDeviceService::TransSubGraph(const SubGraph& graph, in TransSubGraph() argument
394 subGraph->name = graph.name; in TransSubGraph()
395 subGraph->inputIndices = graph.inputIndices; in TransSubGraph()
396 subGraph->outputIndices = graph in TransSubGraph()
[all...]
H A Dprepared_model_service.cpp185 int32_t PreparedModelService::Compile(std::shared_ptr<mindspore::schema::MetaGraphT> graph) in Compile() argument
187 if (graph == nullptr) { in Compile()
191 for (auto i : graph->inputIndex) { in Compile()
192 auto inputShape = graph->allTensors[i]->dims; in Compile()
199 auto offset = mindspore::schema::MetaGraph::Pack(m_builder, graph.get()); in Compile()
/foundation/ai/neural_network_runtime/example/drivers/nnrt/v2_0/hdi_cpu_service/src/
H A Dnnrt_device_service.cpp115 auto graph = TransModelToGraph(model, ret); in PrepareModel() local
116 if (graph == nullptr) { in PrepareModel()
117 HDF_LOGE("Transfrom model to graph failed."); in PrepareModel()
140 ret = service->Compile(graph); in PrepareModel()
354 for (auto graph : model.subGraph) { in TransModelToGraph()
355 metaGraph->subGraph.emplace_back(TransSubGraph(graph, numTensor)); in TransModelToGraph()
438 std::unique_ptr<mindspore::schema::SubGraphT> NnrtDeviceService::TransSubGraph(const SubGraph& graph, in TransSubGraph() argument
442 subGraph->name = graph.name; in TransSubGraph()
443 subGraph->inputIndices = graph.inputIndices; in TransSubGraph()
444 subGraph->outputIndices = graph in TransSubGraph()
[all...]
H A Dprepared_model_service.cpp225 NNRT_ReturnCode PreparedModelService::Compile(std::shared_ptr<mindspore::schema::MetaGraphT> graph) in Compile() argument
227 if (graph == nullptr) { in Compile()
231 for (auto i : graph->inputIndex) { in Compile()
232 auto inputShape = graph->allTensors[i]->dims; in Compile()
239 auto offset = mindspore::schema::MetaGraph::Pack(m_builder, graph.get()); in Compile()
/foundation/arkui/ace_engine/test/tools/event_tree_to_graph/
H A Dmain.py26 from src.graph.graph_converter import generate_all_graphs
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/include/
H A Ddb_common.h115 const std::map<std::string, std::map<std::string, bool>> &graph,
158 static void InsertNodesByScore(const std::map<std::string, std::map<std::string, bool>> &graph,
/foundation/ai/neural_network_runtime/frameworks/native/neural_network_runtime/
H A Dhdi_device_v2_1.cpp477 OH_NN_ReturnCode HDIDeviceV2_1::GetOfflineModelFromLiteGraph(std::shared_ptr<const mindspore::lite::LiteGraph> graph, in GetOfflineModelFromLiteGraph() argument
480 // graph has been checked in PrepareOfflineModel, no need to check twice. in GetOfflineModelFromLiteGraph()
483 const size_t inputNum = graph->all_nodes_[0]->input_indices_.size(); in GetOfflineModelFromLiteGraph()
490 uint32_t index = graph->all_nodes_[0]->input_indices_[inputNum - 1]; in GetOfflineModelFromLiteGraph()
491 mindspore::lite::TensorPtr pTensor = graph->all_tensors_[index]; in GetOfflineModelFromLiteGraph()
632 LOGE("Error happens when getting offline models from lite graph."); in PrepareOfflineModel()
H A Dhdi_device_v2_0.cpp482 OH_NN_ReturnCode HDIDeviceV2_0::GetOfflineModelFromLiteGraph(std::shared_ptr<const mindspore::lite::LiteGraph> graph, in GetOfflineModelFromLiteGraph() argument
485 // graph has been checked in PrepareOfflineModel, no need to check twice. in GetOfflineModelFromLiteGraph()
488 const size_t inputNum = graph->all_nodes_[0]->input_indices_.size(); in GetOfflineModelFromLiteGraph()
495 uint32_t index = graph->all_nodes_[0]->input_indices_[inputNum - 1]; in GetOfflineModelFromLiteGraph()
496 mindspore::lite::TensorPtr pTensor = graph->all_tensors_[index]; in GetOfflineModelFromLiteGraph()
637 LOGE("Error happens when getting offline models from lite graph."); in PrepareOfflineModel()
H A Dhdi_device_v2_0.h71 OH_NN_ReturnCode GetOfflineModelFromLiteGraph(std::shared_ptr<const mindspore::lite::LiteGraph> graph,
H A Dhdi_device_v2_1.h71 OH_NN_ReturnCode GetOfflineModelFromLiteGraph(std::shared_ptr<const mindspore::lite::LiteGraph> graph,
H A Dlite_graph_to_hdi_model_v2_0.cpp1005 LOGE("MindIR_LiteGraph_To_Model v2 failed, lite graph is nullptr."); in LiteGraph_To_HDIModel()
1066 for (auto graph : liteGraph->sub_graphs_) { in LiteGraph_To_HDIModel()
1068 tmp.name = graph->name_; in LiteGraph_To_HDIModel()
1069 tmp.inputIndices = std::vector<uint32_t>(graph->input_indices_); in LiteGraph_To_HDIModel()
1070 tmp.outputIndices = std::vector<uint32_t>(graph->output_indices_); in LiteGraph_To_HDIModel()
1071 tmp.nodeIndices = std::vector<uint32_t>(graph->node_indices_); in LiteGraph_To_HDIModel()
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/src/
H A Ddb_common.cpp508 * 1. select a point which in-degree is 0 in the graph and record it;
510 * 3. repeat step 1 and 2, until the graph is empty or there is no point with a zero degree
564 void DBCommon::InsertNodesByScore(const std::map<std::string, std::map<std::string, bool>> &graph, in InsertNodesByScore() argument
568 auto copyGraph = graph; in InsertNodesByScore()
579 LOGW("[DBCommon] not find score in graph"); in InsertNodesByScore()
591 const std::map<std::string, std::map<std::string, bool>> &graph, in GenerateNodesByNodeWeight()
604 if (graph.find(source) == graph.end()) { in GenerateNodesByNodeWeight()
607 for (const auto &[target, reach] : graph.at(source)) { in GenerateNodesByNodeWeight()
620 InsertNodesByScore(graph, generateNode in GenerateNodesByNodeWeight()
590 GenerateNodesByNodeWeight(const std::vector<std::string> &nodes, const std::map<std::string, std::map<std::string, bool>> &graph, const std::map<std::string, int> &nodeWeight) GenerateNodesByNodeWeight() argument
[all...]
/foundation/ai/neural_network_runtime/example/drivers/nnrt/v1_0/hdi_cpu_service/include/
H A Dnnrt_device_service.h71 std::unique_ptr<mindspore::schema::SubGraphT> TransSubGraph(const SubGraph& graph, const size_t numTensor) const;
H A Dprepared_model_service.h40 int32_t Compile(std::shared_ptr<mindspore::schema::MetaGraphT> graph);
/foundation/ai/neural_network_runtime/example/drivers/nnrt/v2_0/hdi_cpu_service/include/
H A Dprepared_model_service.h40 NNRT_ReturnCode Compile(std::shared_ptr<mindspore::schema::MetaGraphT> graph);
H A Dnnrt_device_service.h75 std::unique_ptr<mindspore::schema::SubGraphT> TransSubGraph(const SubGraph& graph, const size_t numTensor) const;
/foundation/distributeddatamgr/udmf/framework/innerkitsimpl/client/
H A Dutd_client.cpp426 auto graph = UtdGraph::GetInstance().ConstructNewGraph(allTypeCfgs); in UpdateGraph() local
428 UtdGraph::GetInstance().Update(std::move(graph)); in UpdateGraph()

Completed in 14 milliseconds

12