#include <DeadNodeQueryService.h>
Definition at line 27 of file DeadNodeQueryService.h.
◆ isDeadNode()
bool luci::DeadNodeQueryServiceImpl::isDeadNode |
( |
loco::Node * |
node | ) |
|
|
finalvirtual |
Check if the node is dead node.
Implements logo::DeadNodeQueryService.
Definition at line 39 of file DeadNodeQueryService.cpp.
40{
44
45 auto input_nodes = std::set<loco::Node *>(input_nodes_vec.begin(), input_nodes_vec.end());
46 auto output_nodes = std::set<loco::Node *>(output_nodes_vec.begin(), output_nodes_vec.end());
48
50 return false;
51
53 return false;
54
55
57 {
58 VirtualOutputDetector d;
59 if (circle_node->accept(&d))
60 {
61 assert(node->
arity() == 1);
64 return false;
66 return false;
67 }
68 }
69
70 return true;
71}
Logical unit of computation.
virtual Node * arg(uint32_t N) const =0
Access N-th argument node.
virtual uint32_t arity(void) const =0
Return the number of arguments.
std::vector< Node * > input_nodes(const Graph *)
std::set< loco::Node * > active_nodes(const std::vector< loco::Node * > &roots)
Enumerate all the nodes required to compute "roots".
std::vector< Node * > output_nodes(Graph *)
References loco::active_nodes(), loco::Node::arg(), loco::Node::arity(), loco::Node::graph(), loco::input_nodes(), and loco::output_nodes().
The documentation for this struct was generated from the following files: