mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-09-30 04:56:49 +00:00
When determining whether the new instruction was already present in
the original instruction, half the cases were missed (making it not wrong but suboptimal). Also correct a typo (A <-> B) in the second chunk. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@122414 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
b3898af89f
commit
1cd05bb605
@ -159,10 +159,11 @@ static Value *FactorizeBinOp(unsigned Opcode, Value *LHS, Value *RHS,
|
|||||||
// Does "B op DD" simplify?
|
// Does "B op DD" simplify?
|
||||||
if (Value *V = SimplifyBinOp(Opcode, B, DD, TD, DT, MaxRecurse)) {
|
if (Value *V = SimplifyBinOp(Opcode, B, DD, TD, DT, MaxRecurse)) {
|
||||||
// It does! Return "A op' V" if it simplifies or is already available.
|
// It does! Return "A op' V" if it simplifies or is already available.
|
||||||
// If V equals B then "A op' V" is just the LHS.
|
// If V equals B then "A op' V" is just the LHS. If V equals DD then
|
||||||
if (V == B) {
|
// "A op' V" is just the RHS.
|
||||||
|
if (V == B || V == DD) {
|
||||||
++NumFactor;
|
++NumFactor;
|
||||||
return LHS;
|
return V == B ? LHS : RHS;
|
||||||
}
|
}
|
||||||
// Otherwise return "A op' V" if it simplifies.
|
// Otherwise return "A op' V" if it simplifies.
|
||||||
if (Value *W = SimplifyBinOp(OpcodeToExtract, A, V, TD, DT, MaxRecurse)) {
|
if (Value *W = SimplifyBinOp(OpcodeToExtract, A, V, TD, DT, MaxRecurse)) {
|
||||||
@ -181,10 +182,11 @@ static Value *FactorizeBinOp(unsigned Opcode, Value *LHS, Value *RHS,
|
|||||||
// Does "A op CC" simplify?
|
// Does "A op CC" simplify?
|
||||||
if (Value *V = SimplifyBinOp(Opcode, A, CC, TD, DT, MaxRecurse)) {
|
if (Value *V = SimplifyBinOp(Opcode, A, CC, TD, DT, MaxRecurse)) {
|
||||||
// It does! Return "V op' B" if it simplifies or is already available.
|
// It does! Return "V op' B" if it simplifies or is already available.
|
||||||
// If V equals A then "V op' B" is just the LHS.
|
// If V equals A then "V op' B" is just the LHS. If V equals CC then
|
||||||
if (V == B) {
|
// "V op' B" is just the RHS.
|
||||||
|
if (V == A || V == CC) {
|
||||||
++NumFactor;
|
++NumFactor;
|
||||||
return LHS;
|
return V == A ? LHS : RHS;
|
||||||
}
|
}
|
||||||
// Otherwise return "V op' B" if it simplifies.
|
// Otherwise return "V op' B" if it simplifies.
|
||||||
if (Value *W = SimplifyBinOp(OpcodeToExtract, V, B, TD, DT, MaxRecurse)) {
|
if (Value *W = SimplifyBinOp(OpcodeToExtract, V, B, TD, DT, MaxRecurse)) {
|
||||||
|
@ -20,6 +20,17 @@ define i32 @factorize2(i32 %x) {
|
|||||||
; CHECK: ret i32 %x
|
; CHECK: ret i32 %x
|
||||||
}
|
}
|
||||||
|
|
||||||
|
define i32 @factorize3(i32 %x, i32 %a, i32 %b) {
|
||||||
|
; CHECK: @factorize3
|
||||||
|
; (X | (A|B)) & (X | B) -> X | ((A|B) & B) -> X | B
|
||||||
|
%aORb = or i32 %a, %b
|
||||||
|
%l = or i32 %x, %aORb
|
||||||
|
%r = or i32 %x, %b
|
||||||
|
%z = and i32 %l, %r
|
||||||
|
ret i32 %z
|
||||||
|
; CHECK: ret i32 %r
|
||||||
|
}
|
||||||
|
|
||||||
define i32 @expand(i32 %x) {
|
define i32 @expand(i32 %x) {
|
||||||
; CHECK: @expand
|
; CHECK: @expand
|
||||||
; ((X & 1) | 2) & 1 -> ((X & 1) & 1) | (2 & 1) -> (X & 1) | 0 -> X & 1
|
; ((X & 1) | 2) & 1 -> ((X & 1) & 1) | (2 & 1) -> (X & 1) | 0 -> X & 1
|
||||||
|
Loading…
Reference in New Issue
Block a user