mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-11-04 22:07:27 +00:00
1bc7315c02
This is how it ignores the dead code:
1) When a dead branch target, say block B, is identified, all the
blocks dominated by B is dead as well.
2) The PHIs of those blocks in dominance-frontier(B) is updated such
that the operands corresponding to dead predecessors are replaced
by "UndefVal".
Using lattice's jargon, the "UndefVal" is the "Top" in essence.
Phi node like this "phi(v1 bb1, undef xx)" will be optimized into
"v1" if v1 is constant, or v1 is an instruction which dominate this
PHI node.
3) When analyzing the availability of a load L, all dead mem-ops which
L depends on disguise as a load which evaluate exactly same value as L.
4) The dead mem-ops will be materialized as "UndefVal" during code motion.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@191017 91177308-0d34-0410-b5e6-96231b3b80d8
26 lines
507 B
LLVM
26 lines
507 B
LLVM
; RUN: opt < %s -basicaa -gvn -S | FileCheck %s
|
|
|
|
define i32 @main(i32** %p, i32 %x, i32 %y) {
|
|
block1:
|
|
%cmp = icmp eq i32 %x, %y
|
|
br i1 %cmp , label %block2, label %block3
|
|
|
|
block2:
|
|
%a = load i32** %p
|
|
br label %block4
|
|
|
|
block3:
|
|
%b = load i32** %p
|
|
br label %block4
|
|
|
|
block4:
|
|
; CHECK-NOT: %existingPHI = phi
|
|
; CHECK: %DEAD = phi
|
|
%existingPHI = phi i32* [ %a, %block2 ], [ %b, %block3 ]
|
|
%DEAD = load i32** %p
|
|
%c = load i32* %DEAD
|
|
%d = load i32* %existingPHI
|
|
%e = add i32 %c, %d
|
|
ret i32 %e
|
|
}
|