Lines Matching full:nodes
118 // This function works by first finding all live nodes. The dead nodes in collect()
119 // are then the complement of the set of live nodes. in collect()
121 // Assume that all nodes are dead. Identify instructions which must be in collect()
144 dbgs() << "Live nodes:\n"; in collect()
177 // Erase the nodes given in the Nodes set from DFG. In addition to removing
180 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) { in erase() argument
181 if (Nodes.empty()) in erase()
184 // Prepare the actual set of ref nodes to remove: ref nodes from Nodes in erase()
185 // are included directly, for each InstrNode in Nodes, include the set in erase()
188 for (auto I : Nodes) { in erase()
196 // If it's a code node, add all ref nodes from it. in erase()
207 // Sort the list so that use nodes are removed first. This makes the in erase()
220 dbgs() << "Removing dead ref nodes:\n"; in erase()
230 // Now, remove all dead instruction nodes. in erase()