Lines Matching full:dead
11 // instructions. It also performs simple dead load elimination.
513 UndefVal // A UndefValue representing a value from dead block (which
1199 // rehashed. Just leave the dead load around.
1276 assert(!ValuesPerBlock[0].isUndefValue() && "Dead BB dominate this block");
1384 // Dead dependent mem-op disguise as a load evaluating the same value
2370 // Fabricate val-num for dead-code in order to suppress assertion in
2692 // BB is declared dead, which implied other blocks become dead as well. This
2693 // function is to add all these blocks to "DeadBlocks". For the dead blocks'
2695 // corresponding to dead blocks with UndefVal.
2707 // All blocks dominated by D are dead.
2729 // S could be proved dead later on. That is why we don't update phi
2733 // While S is not dominated by D, it is dead by now. This could take
2734 // place if S already have a dead predecessor before D is declared
2735 // dead.
2742 // For the dead blocks' live successors, update their phi nodes by replacing
2743 // the operands corresponding to dead blocks with UndefVal.
2775 // 1) If the dead out-coming edge is a critical-edge, split it. Let
2776 // R be the target of the dead out-coming edge.
2777 // 1) Identify the set of dead blocks implied by the branch's dead outcoming
2779 // 2) Identify those blocks which haves at least one dead prodecessor. The
2782 // dead blocks with "UndefVal" in an hope these PHIs will optimized away.
2784 // Return true iff *NEW* dead code are found.
2806 // associated val-num. As it normally has far more live instructions than dead
2808 // dead code than checking if instruction involved is dead or not.
