mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-18 12:29:21 +00:00
Just like we use the RHS of an AND to simplify the LHS, use the LHS to
simplify the RHS. This allows for the elimination of many thousands of ands from multisource, and compiles CodeGen/PowerPC/and-elim.ll:test2 into this: _test2: srwi r2, r3, 1 xori r3, r2, 40961 blr instead of this: _test2: rlwinm r2, r3, 31, 17, 31 xori r2, r2, 40961 rlwinm r3, r2, 0, 16, 31 blr git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26388 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
cfdbb7caa8
commit
5f0c658aa4
@ -223,6 +223,23 @@ bool TargetLowering::SimplifyDemandedBits(SDOperand Op, uint64_t DemandedMask,
|
||||
// If the RHS is a constant, see if we can simplify it.
|
||||
if (TLO.ShrinkDemandedConstant(Op, DemandedMask & ~KnownZero2))
|
||||
return true;
|
||||
|
||||
// If the RHS is a constant, check to see if the LHS would be zero without
|
||||
// using the bits from the RHS. Above, we used knowledge about the RHS to
|
||||
// simplify the LHS, here we're using information from the LHS to simplify
|
||||
// the RHS.
|
||||
if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
|
||||
uint64_t LHSZero, LHSOne;
|
||||
ComputeMaskedBits(Op.getOperand(0), DemandedMask,
|
||||
LHSZero, LHSOne, Depth+1);
|
||||
// If the LHS already has zeros where RHSC does, this and is dead.
|
||||
if ((LHSZero & DemandedMask) == (~RHSC->getValue() & DemandedMask))
|
||||
return TLO.CombineTo(Op, Op.getOperand(0));
|
||||
// If any of the set bits in the RHS are known zero on the LHS, shrink
|
||||
// the constant.
|
||||
if (TLO.ShrinkDemandedConstant(Op, ~LHSZero & DemandedMask))
|
||||
return true;
|
||||
}
|
||||
|
||||
// Output known-1 bits are only known if set in both the LHS & RHS.
|
||||
KnownOne &= KnownOne2;
|
||||
|
Loading…
Reference in New Issue
Block a user