172     PrintOutVector("Dead blocks from the original loop:", DeadLoopBlocks);  in dump()
174     PrintOutVector("Dead exit blocks:", DeadExitBlocks);  in dump()
219     // Collect live and dead loop blocks and exits.  in analyze()
224       // If a loop block wasn't marked as live so far, then it's dead.  in analyze()
250     // Amount of dead and live loop blocks should match the total number of  in analyze()
255     // Now, all exit blocks that are not marked as live are dead, if all their  in analyze()
322   /// We cannot simply remove edge from the loop to dead exit because in this
342   /// Doing so, we preserve static reachibility of all dead exits and can later
345     // If no dead exits, nothing to do.  in handleDeadExits()
350     // dead exits.  in handleDeadExits()
362       // Eliminate all Phis and LandingPads from dead exits.  in handleDeadExits()
363       // TODO: Consider removing all instructions in this dead block.  in handleDeadExits()
377       assert(DummyIdx != 0 && "Too many dead exits!");  in handleDeadExits()
385       // When we break dead edges, the outer loop may become unreachable from  in handleDeadExits()
444     // break this invariant for the dead loop. So we detatch and erase all dead  in deleteDeadLoopBlocks()
462              "Header of the current loop cannot be dead!");  in deleteDeadLoopBlocks()
463       LLVM_DEBUG(dbgs() << "Deleting dead loop block " << BB->getName()  in deleteDeadLoopBlocks()
567     // TODO: Support blocks that are not dead, but also not in loop after the  in run()
574                     " support blocks that are not dead, but will stop "  in run()
580     // dead exit blocks requires LCSSA form to be maintained for all values,  in run()
607                     << " dead blocks in loop " << Header->getName() << "\n");  in run()