MCPcopy Create free account
hub / github.com/ARM-software/ComputeLibrary / get_driving_nodes

Function get_driving_nodes

src/graph/Utils.cpp:180–198  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

178}
179
180std::vector<NodeIdxPair> get_driving_nodes(const INode &node)
181{
182 std::vector<NodeIdxPair> driving_nodes;
183
184 const Graph *g = node.graph();
185 ARM_COMPUTE_ERROR_ON(g == nullptr);
186
187 for (auto &output_edge_id : node.output_edges())
188 {
189 auto output_edge = g->edge(output_edge_id);
190 if (output_edge != nullptr)
191 {
192 ARM_COMPUTE_ERROR_ON(output_edge->consumer() == nullptr);
193 driving_nodes.push_back({output_edge->consumer_id(), output_edge->consumer_idx()});
194 }
195 }
196
197 return driving_nodes;
198}
199
200std::vector<NodeIdxPair> get_driver_nodes(const INode &node)
201{

Callers 3

mutateMethod · 0.85
remove_optimized_nodesFunction · 0.85

Calls 6

graphMethod · 0.80
edgeMethod · 0.80
consumerMethod · 0.80
push_backMethod · 0.80
consumer_idMethod · 0.80
consumer_idxMethod · 0.80

Tested by

no test coverage detected