| /third_party/skia/tests/ |
| D | TopoSortTest.cpp | 14 typedef void (*CreateGraphPF)(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph);
25 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0() argument
26 ToolUtils::TopoTestNode::AllocNodes(graph, 4); in create_graph0()
28 (*graph)[0]->dependsOn((*graph)[1].get()); in create_graph0()
29 (*graph)[0]->dependsOn((*graph)[2].get()); in create_graph0()
30 (*graph)[1]->dependsOn((*graph)[3].get()); in create_graph0()
31 (*graph)[2]->dependsOn((*graph)[3].get()); in create_graph0()
46 static void create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph1() argument
47 ToolUtils::TopoTestNode::AllocNodes(graph, 4); in create_graph1()
49 (*graph)[0]->dependsOn((*graph)[1].get()); in create_graph1()
[all …]
|
| D | GrRenderTaskClusterTest.cpp | 13 typedef void (*CreateGraphPF)(SkTArray<sk_sp<GrMockRenderTask>>* graph,
35 static void create_graph0(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph0() argument
39 make_tasks(3, graph); in create_graph0()
41 graph->at(0)->addTarget(proxies[0]); in create_graph0()
42 graph->at(1)->addTarget(proxies[1]); in create_graph0()
43 graph->at(2)->addTarget(proxies[0]); in create_graph0()
44 graph->at(2)->addDependency(graph->at(1).get()); in create_graph0()
46 expected->push_back(graph->at(1)); in create_graph0()
47 expected->push_back(graph->at(0)); in create_graph0()
48 expected->push_back(graph->at(2)); in create_graph0()
[all …]
|
| /third_party/flutter/skia/tests/ |
| D | TopoSortTest.cpp | 14 typedef void (*CreateGraphPF)(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph);
23 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0() argument
24 ToolUtils::TopoTestNode::AllocNodes(graph, 4); in create_graph0()
26 (*graph)[0]->dependsOn((*graph)[1].get()); in create_graph0()
27 (*graph)[0]->dependsOn((*graph)[2].get()); in create_graph0()
28 (*graph)[1]->dependsOn((*graph)[3].get()); in create_graph0()
29 (*graph)[2]->dependsOn((*graph)[3].get()); in create_graph0()
41 static void create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph1() argument
42 ToolUtils::TopoTestNode::AllocNodes(graph, 4); in create_graph1()
44 (*graph)[0]->dependsOn((*graph)[1].get()); in create_graph1()
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | regression.cfg | 4 // ./regression --tests ../libs/graph/example/regression.cfg -o graph-eg.html
8 compile libs/graph/example/accum-compile-times.cpp
9 compile libs/graph/example/adjacency_list.cpp
10 compile libs/graph/example/adjacency_list_io.cpp
11 compile libs/graph/example/adjacency_matrix.cpp
12 compile libs/graph/example/bellman-example.cpp
13 compile libs/graph/example/bellman-ford-internet.cpp
14 compile libs/graph/example/bfs-example.cpp
15 compile libs/graph/example/bfs-name-printer.cpp
16 compile libs/graph/example/bfs.cpp
[all …]
|
| D | grid_graph_example.cpp | 33 Graph graph(lengths, wrapped); in main() local
36 for (Traits::vertices_size_type v_index = 0; v_index < num_vertices(graph); in main()
42 << get(boost::vertex_index, graph, vertex(v_index, graph)) in main()
47 for (Traits::edges_size_type e_index = 0; e_index < num_edges(graph); in main()
53 << get(boost::edge_index, graph, edge_at(e_index, graph)) in main()
58 std::cout << graph.dimensions() << std::endl; // prints "3" in main()
61 std::cout << graph.length(0) << "x" << graph.length(1) << "x" in main()
62 << graph.length(2) << std::endl; // prints "3x5x7" in main()
65 std::cout << (graph.wrapped(0) ? "W" : "U") << ", " in main()
66 << (graph.wrapped(1) ? "W" : "U") << ", " in main()
[all …]
|
| /third_party/harfbuzz/src/ |
| D | test-repacker.cc | 197 graph_t graph (c.object_graph ()); in test_sort_kahn_1() local
198 graph.sort_kahn (); in test_sort_kahn_1()
200 assert(strncmp (graph.object (3).head, "abc", 3) == 0); in test_sort_kahn_1()
201 assert(graph.object (3).links.length == 2); in test_sort_kahn_1()
202 assert(graph.object (3).links[0].objidx == 2); in test_sort_kahn_1()
203 assert(graph.object (3).links[1].objidx == 1); in test_sort_kahn_1()
205 assert(strncmp (graph.object (2).head, "def", 3) == 0); in test_sort_kahn_1()
206 assert(graph.object (2).links.length == 1); in test_sort_kahn_1()
207 assert(graph.object (2).links[0].objidx == 0); in test_sort_kahn_1()
209 assert(strncmp (graph.object (1).head, "jkl", 3) == 0); in test_sort_kahn_1()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | grid_graph_test.cpp | 70 Graph graph(lengths, wrapped); in do_test() local
77 graph.length(dimension_index) == lengths[dimension_index]); in do_test()
79 graph.wrapped(dimension_index) == wrapped[dimension_index]); in do_test()
84 vertex_index < num_vertices(graph); ++vertex_index) in do_test()
87 get(boost::vertex_index, graph, vertex(vertex_index, graph)) in do_test()
91 for (edges_size_type edge_index = 0; edge_index < num_edges(graph); in do_test()
95 edge_descriptor current_edge = edge_at(edge_index, graph); in do_test()
97 get(boost::edge_index, graph, current_edge) == edge_index); in do_test()
102 BOOST_FOREACH (vertex_descriptor current_vertex, vertices(graph)) in do_test()
106 = get(boost::vertex_index, graph, current_vertex); in do_test()
[all …]
|
| /third_party/mindspore/tests/ut/cpp/parallel/auto_parallel/ |
| D | rec_partition_test.cc | 32 …void Create(std::shared_ptr<Graph> graph, int node_num, std::vector<int64_t> edge_head, std::vecto…
33 void InitEdge(std::shared_ptr<Graph> graph, int vHead, int vTail);
34 void InitNode(std::shared_ptr<Graph> graph, int num_node);
40 void TestPartition::Create(std::shared_ptr<Graph> graph, int node_num, std::vector<int64_t> edge_he… in Create() argument
42 TestPartition::InitNode(graph, node_num); in Create()
49 TestPartition::InitEdge(graph, edge_head[i], edge_tail[i]); in Create()
54 void TestPartition::InitNode(std::shared_ptr<Graph> graph, int num_node) { in InitNode() argument
57 graph->nodes.push_back(NewNode); in InitNode()
60 graph->nodes[i].name = ss.str(); in InitNode()
61 graph->nodes[i].info = kConstant; in InitNode()
[all …]
|
| /third_party/mindspore/mindspore/lite/tools/converter/legacy_optimizer/graph/ |
| D | subgraph_tensor_pass.cc | 30 bool SubgraphTensorPass::IsUsing(schema::MetaGraphT *graph, const uint32_t &tensor_idx) { in IsUsing() argument
31 for (const auto &node : graph->nodes) { in IsUsing()
39 for (const auto &subgraph : graph->subGraph) { in IsUsing()
50 STATUS SubgraphTensorPass::UpdateTensorIdx(schema::MetaGraphT *graph, const uint32_t &tensor_idx) { in UpdateTensorIdx() argument
51 for (const auto &subgraph : graph->subGraph) { in UpdateTensorIdx()
55 for (const auto &node : graph->nodes) { in UpdateTensorIdx()
59 UpdateVec<uint32_t>(&(graph->inputIndex), tensor_idx); in UpdateTensorIdx()
60 UpdateVec<uint32_t>(&(graph->outputIndex), tensor_idx); in UpdateTensorIdx()
64 STATUS SubgraphTensorPass::RemoveUselessTensors(schema::MetaGraphT *graph) { in RemoveUselessTensors() argument
65 for (auto it = graph->allTensors.begin(); it != graph->allTensors.end();) { in RemoveUselessTensors()
[all …]
|
| D | dtype_trans_pass.cc | 31 STATUS DTypeTransPass::Run(schema::MetaGraphT *graph) { in Run() argument
32 CHECK_NULL_RETURN(graph); in Run()
34 auto status = DoModelInputDTypeTrans(graph); in Run()
40 status = DoModelOutputDTypeTrans(graph); in Run()
46 status = DoNodeInoutDTypeTrans(graph); in Run()
54 STATUS DTypeTransPass::DoModelInputDTypeTrans(schema::MetaGraphT *graph) { in DoModelInputDTypeTrans() argument
55 MS_ASSERT(graph != nullptr); in DoModelInputDTypeTrans()
56 auto &graph_in_idxes = graph->inputIndex; in DoModelInputDTypeTrans()
64 MS_ASSERT(graph_in_idx < graph->allTensors.size()); in DoModelInputDTypeTrans()
65 auto &tensor = graph->allTensors.at(graph_in_idx); in DoModelInputDTypeTrans()
[all …]
|
| D | infershape_pass.cc | 80 void ConvertTensorList(MetaGraphT *graph, uint32_t index, bool *convert_succ, std::vector<Tensor *>… in ConvertTensorList() argument
82 auto &tensorT = graph->allTensors.at(index); in ConvertTensorList()
135 void ConvertString(MetaGraphT *graph, uint32_t index, bool *convert_succ, std::vector<Tensor *> *li… in ConvertString() argument
137 auto &tensorT = graph->allTensors.at(index); in ConvertString()
163 void ConvertOtherTensor(MetaGraphT *graph, uint32_t index, bool *convert_succ, std::vector<Tensor *… in ConvertOtherTensor() argument
165 auto &tensorT = graph->allTensors.at(index); in ConvertOtherTensor()
185 std::vector<Tensor *> ConvertTensorToLiteTensor(MetaGraphT *graph, const std::vector<uint32_t> &ten… in ConvertTensorToLiteTensor() argument
186 MS_ASSERT(graph != nullptr); in ConvertTensorToLiteTensor()
190 auto &tensorT = graph->allTensors.at(tensor_indexs[i]); in ConvertTensorToLiteTensor()
193 ConvertTensorList(graph, tensor_indexs[i], &convert_succ, &lite_tensors); in ConvertTensorToLiteTensor()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/runtime/framework/ |
| D | graph_compiler.cc | 57 void CreateParameterDeviceAddress(const DeviceContext *device_context, const KernelGraphPtr &graph)… in CreateParameterDeviceAddress() argument
59 MS_EXCEPTION_IF_NULL(graph); in CreateParameterDeviceAddress()
60 std::vector<AnfNodePtr> graph_inputs = graph->inputs(); in CreateParameterDeviceAddress()
61 const std::vector<bool> &graph_valid_input = graph->valid_inputs(); in CreateParameterDeviceAddress()
62 …(void)graph_inputs.insert(graph_inputs.end(), graph->child_graph_result().begin(), graph->child_gr… in CreateParameterDeviceAddress()
146 void CreateValueNodeDeviceAddress(const DeviceContext *device_context, const KernelGraphPtr &graph)… in CreateValueNodeDeviceAddress() argument
148 MS_EXCEPTION_IF_NULL(graph); in CreateValueNodeDeviceAddress()
149 for (const ValueNodePtr &value_node : graph->graph_value_nodes()) { in CreateValueNodeDeviceAddress()
170 …CreateKernelOutputDeviceAddress(const DeviceContext *device_context, const KernelGraphPtr &graph) { in CreateKernelOutputDeviceAddress() argument
172 MS_EXCEPTION_IF_NULL(graph); in CreateKernelOutputDeviceAddress()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | property_iter_range.hpp | 58 Graph& graph, const Tag& tag, const vertex_property_tag&) in get_property_iter_range_kind() argument
61 return std::make_pair(iter(vertices(graph).first, get(tag, graph)), in get_property_iter_range_kind()
62 iter(vertices(graph).second, get(tag, graph))); in get_property_iter_range_kind()
68 const Graph& graph, const Tag& tag, const vertex_property_tag&) in get_property_iter_range_kind() argument
72 return std::make_pair(iter(vertices(graph).first, get(tag, graph)), in get_property_iter_range_kind()
73 iter(vertices(graph).second, get(tag, graph))); in get_property_iter_range_kind()
79 Graph& graph, const Tag& tag, const edge_property_tag&) in get_property_iter_range_kind() argument
82 return std::make_pair(iter(edges(graph).first, get(tag, graph)), in get_property_iter_range_kind()
83 iter(edges(graph).second, get(tag, graph))); in get_property_iter_range_kind()
89 const Graph& graph, const Tag& tag, const edge_property_tag&) in get_property_iter_range_kind() argument
[all …]
|
| D | grid_graph.hpp | 56 grid_graph_index_map(const Graph& graph) : m_graph(&graph) {} in grid_graph_index_map()
147 grid_graph_vertex_at(const Graph* graph) : m_graph(graph) {} in grid_graph_vertex_at()
174 vertex_descriptor source_vertex, const Graph* graph) in grid_graph_out_edge_at()
175 : m_vertex(source_vertex), m_graph(graph) in grid_graph_out_edge_at()
205 vertex_descriptor target_vertex, const Graph* graph) in grid_graph_in_edge_at()
206 : m_vertex(target_vertex), m_graph(graph) in grid_graph_in_edge_at()
230 grid_graph_edge_at(const Graph* graph) : m_graph(graph) {} in grid_graph_edge_at()
250 result_type source_vertex, const Graph* graph) in grid_graph_adjacent_vertex_at()
251 : m_vertex(source_vertex), m_graph(graph) in grid_graph_adjacent_vertex_at()
798 vertices(const type& graph) in vertices() argument
[all …]
|
| D | dijkstra_shortest_paths_no_color_map.hpp | 28 void dijkstra_shortest_paths_no_color_map_no_init(const Graph& graph, in dijkstra_shortest_paths_no_color_map_no_init() argument
56 graph, index_map, index_in_heap_map_holder); in dijkstra_shortest_paths_no_color_map_no_init()
63 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
70 visitor.examine_vertex(min_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
82 BGL_FORALL_OUTEDGES_T(min_vertex, current_edge, graph, Graph) in dijkstra_shortest_paths_no_color_map_no_init()
84 visitor.examine_edge(current_edge, graph); in dijkstra_shortest_paths_no_color_map_no_init()
93 Vertex neighbor_vertex = target(current_edge, graph); in dijkstra_shortest_paths_no_color_map_no_init()
101 = relax_target(current_edge, graph, weight_map, predecessor_map, in dijkstra_shortest_paths_no_color_map_no_init()
106 visitor.edge_relaxed(current_edge, graph); in dijkstra_shortest_paths_no_color_map_no_init()
109 visitor.discover_vertex(neighbor_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
[all …]
|
| /third_party/node/deps/npm/node_modules/color-convert/ |
| D | route.js | 15 var graph = {};
20 graph[models[i]] = { variable
28 return graph;
33 var graph = buildGraph();
36 graph[fromModel].distance = 0;
44 var node = graph[adjacent];
47 node.distance = graph[current].distance + 1;
54 return graph;
63 function wrapConversion(toModel, graph) { argument
64 var path = [graph[toModel].parent, toModel];
[all …]
|
| /third_party/ffmpeg/libavfilter/ |
| D | avfiltergraph.c | 71 void ff_graph_thread_free(AVFilterGraph *graph) in ff_graph_thread_free() argument
75 int ff_graph_thread_init(AVFilterGraph *graph) in ff_graph_thread_init() argument
77 graph->thread_type = 0; in ff_graph_thread_init()
78 graph->nb_threads = 1; in ff_graph_thread_init()
102 void ff_filter_graph_remove_filter(AVFilterGraph *graph, AVFilterContext *filter) in ff_filter_graph_remove_filter() argument
105 for (i = 0; i < graph->nb_filters; i++) { in ff_filter_graph_remove_filter()
106 if (graph->filters[i] == filter) { in ff_filter_graph_remove_filter()
107 FFSWAP(AVFilterContext*, graph->filters[i], in ff_filter_graph_remove_filter()
108 graph->filters[graph->nb_filters - 1]); in ff_filter_graph_remove_filter()
109 graph->nb_filters--; in ff_filter_graph_remove_filter()
[all …]
|
| D | pthread.c | 37 AVFilterGraph *graph; member
63 ThreadContext *c = ctx->graph->internal->thread; in thread_execute()
84 int ff_graph_thread_init(AVFilterGraph *graph) in ff_graph_thread_init() argument
88 if (graph->nb_threads == 1) { in ff_graph_thread_init()
89 graph->thread_type = 0; in ff_graph_thread_init()
93 graph->internal->thread = av_mallocz(sizeof(ThreadContext)); in ff_graph_thread_init()
94 if (!graph->internal->thread) in ff_graph_thread_init()
97 ret = thread_init_internal(graph->internal->thread, graph->nb_threads); in ff_graph_thread_init()
99 av_freep(&graph->internal->thread); in ff_graph_thread_init()
100 graph->thread_type = 0; in ff_graph_thread_init()
[all …]
|
| /third_party/skia/src/gpu/ |
| D | GrTTopoSort.h | 16 void GrTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CheckAllUnmarked() argument
17 for (int i = 0; i < graph.count(); ++i) { in GrTTopoSort_CheckAllUnmarked()
18 SkASSERT(!Traits::IsTempMarked(graph[i].get())); in GrTTopoSort_CheckAllUnmarked()
19 SkASSERT(!Traits::WasOutput(graph[i].get())); in GrTTopoSort_CheckAllUnmarked()
24 void GrTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CleanExit() argument
25 for (int i = 0; i < graph.count(); ++i) { in GrTTopoSort_CleanExit()
26 SkASSERT(!Traits::IsTempMarked(graph[i].get())); in GrTTopoSort_CleanExit()
27 SkASSERT(Traits::WasOutput(graph[i].get())); in GrTTopoSort_CleanExit()
28 SkASSERT(Traits::GetIndex(graph[i].get()) == (uint32_t) i); in GrTTopoSort_CleanExit()
85 bool GrTTopoSort(SkTArray<sk_sp<T>>* graph) { in GrTTopoSort() argument
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/test/fuzz/ |
| D | call_graph_test.cpp | 284 const auto graph = CallGraph(context.get()); in TEST() local
286 const auto& function_in_degree = graph.GetFunctionInDegree(); in TEST()
304 const auto graph = CallGraph(context.get()); in TEST() local
307 ASSERT_EQ(graph.GetDirectCallees(2), std::set<uint32_t>({35, 48, 50})); in TEST()
308 ASSERT_EQ(graph.GetDirectCallees(35), std::set<uint32_t>({})); in TEST()
309 ASSERT_EQ(graph.GetDirectCallees(48), std::set<uint32_t>({35, 50, 61})); in TEST()
310 ASSERT_EQ(graph.GetDirectCallees(50), std::set<uint32_t>({35})); in TEST()
311 ASSERT_EQ(graph.GetDirectCallees(61), std::set<uint32_t>({})); in TEST()
323 const auto graph = CallGraph(context.get()); in TEST() local
326 ASSERT_EQ(graph.GetIndirectCallees(2), std::set<uint32_t>({35, 48, 50, 61})); in TEST()
[all …]
|
| /third_party/spirv-tools/test/fuzz/ |
| D | call_graph_test.cpp | 284 const auto graph = CallGraph(context.get()); in TEST() local
286 const auto& function_in_degree = graph.GetFunctionInDegree(); in TEST()
304 const auto graph = CallGraph(context.get()); in TEST() local
307 ASSERT_EQ(graph.GetDirectCallees(2), std::set<uint32_t>({35, 48, 50})); in TEST()
308 ASSERT_EQ(graph.GetDirectCallees(35), std::set<uint32_t>({})); in TEST()
309 ASSERT_EQ(graph.GetDirectCallees(48), std::set<uint32_t>({35, 50, 61})); in TEST()
310 ASSERT_EQ(graph.GetDirectCallees(50), std::set<uint32_t>({35})); in TEST()
311 ASSERT_EQ(graph.GetDirectCallees(61), std::set<uint32_t>({})); in TEST()
323 const auto graph = CallGraph(context.get()); in TEST() local
326 ASSERT_EQ(graph.GetIndirectCallees(2), std::set<uint32_t>({35, 48, 50, 61})); in TEST()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/fuzz/ |
| D | call_graph_test.cpp | 284 const auto graph = CallGraph(context.get()); in TEST() local
286 const auto& function_in_degree = graph.GetFunctionInDegree(); in TEST()
304 const auto graph = CallGraph(context.get()); in TEST() local
307 ASSERT_EQ(graph.GetDirectCallees(2), std::set<uint32_t>({35, 48, 50})); in TEST()
308 ASSERT_EQ(graph.GetDirectCallees(35), std::set<uint32_t>({})); in TEST()
309 ASSERT_EQ(graph.GetDirectCallees(48), std::set<uint32_t>({35, 50, 61})); in TEST()
310 ASSERT_EQ(graph.GetDirectCallees(50), std::set<uint32_t>({35})); in TEST()
311 ASSERT_EQ(graph.GetDirectCallees(61), std::set<uint32_t>({})); in TEST()
323 const auto graph = CallGraph(context.get()); in TEST() local
326 ASSERT_EQ(graph.GetIndirectCallees(2), std::set<uint32_t>({35, 48, 50, 61})); in TEST()
[all …]
|
| /third_party/mindspore/tests/ut/cpp/device/ |
| D | hccl_adapter_test.cc | 28 CNodePtr CreateAllToAllvNode(const FuncGraphPtr &graph, const std::vector<AnfNodePtr> inputs, in CreateAllToAllvNode() argument
30 MS_EXCEPTION_IF_NULL(graph); in CreateAllToAllvNode()
33 auto all_to_all_v = graph->NewCNode(all_to_all_v_input); in CreateAllToAllvNode()
56 …std::vector<AnfNodePtr> CreateInputs(const FuncGraphPtr &graph, const std::vector<std::vector<size… in CreateInputs() argument
58 MS_EXCEPTION_IF_NULL(graph); in CreateInputs()
64 …auto node = graph->NewCNode(std::vector<AnfNodePtr>{NewValueNode(std::make_shared<Primitive>("AnyN… in CreateInputs()
93 auto graph = std::make_shared<FuncGraph>(); in TEST_F() local
94 ASSERT_TRUE(graph != nullptr); in TEST_F()
98 …auto alltoall = CreateAllToAllvNode(graph, CreateInputs(graph, {{1}}, {type_}), send_rank_ids, rec… in TEST_F()
116 auto graph = std::make_shared<FuncGraph>(); in TEST_F() local
[all …]
|
| /third_party/flutter/skia/src/core/ |
| D | SkTTopoSort.h | 16 void SkTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) { in SkTTopoSort_CheckAllUnmarked() argument
17 for (int i = 0; i < graph.count(); ++i) { in SkTTopoSort_CheckAllUnmarked()
18 SkASSERT(!Traits::IsTempMarked(graph[i].get())); in SkTTopoSort_CheckAllUnmarked()
19 SkASSERT(!Traits::WasOutput(graph[i].get())); in SkTTopoSort_CheckAllUnmarked()
24 void SkTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) { in SkTTopoSort_CleanExit() argument
25 for (int i = 0; i < graph.count(); ++i) { in SkTTopoSort_CleanExit()
26 SkASSERT(!Traits::IsTempMarked(graph[i].get())); in SkTTopoSort_CleanExit()
27 SkASSERT(Traits::WasOutput(graph[i].get())); in SkTTopoSort_CleanExit()
82 bool SkTTopoSort(SkTArray<sk_sp<T>>* graph) { in SkTTopoSort() argument
86 SkTTopoSort_CheckAllUnmarked<T, Traits>(*graph); in SkTTopoSort()
[all …]
|
| /third_party/mindspore/mindspore/lite/mindir/src/ |
| D | mindir_nnrt_lite_graph.cc | 28 auto graph = *lite_graph; in MindIR_LiteGraph_Destroy() local
29 graph->name_.clear(); in MindIR_LiteGraph_Destroy()
30 graph->input_indices_.clear(); in MindIR_LiteGraph_Destroy()
31 graph->output_indices_.clear(); in MindIR_LiteGraph_Destroy()
34 for (size_t idx = 0; idx < graph->all_nodes_.size(); idx++) { in MindIR_LiteGraph_Destroy()
35 if (graph->all_nodes_[idx] != nullptr) { in MindIR_LiteGraph_Destroy()
37 static_cast<schema::Primitive *>(graph->all_nodes_[idx]->primitive_)); in MindIR_LiteGraph_Destroy()
38 delete graph->all_nodes_[idx]; in MindIR_LiteGraph_Destroy()
43 for (size_t idx = 0; idx < graph->sub_graphs_.size(); idx++) { in MindIR_LiteGraph_Destroy()
44 if (graph->sub_graphs_[idx] != nullptr) { in MindIR_LiteGraph_Destroy()
[all …]
|