mirror of
https://github.com/RPCS3/llvm.git
synced 2026-07-18 13:16:24 -04:00
[ValueTracking] Fix recurrence detection to check both PHI operands.
Summary: Currently we fail to compute known bits for recurrences where the first incoming value is the start value of the recurrence. Instead of exiting the loop when the first incoming value is not the step of the recurrence, continue to check the second incoming value. The original code uses a loop to handle both cases, but incorrectly exits instead of continuing. Reviewers: lebedev.ri, spatel, nikic Reviewed By: lebedev.ri Subscribers: hiraditya, llvm-commits Tags: #llvm Differential Revision: https://reviews.llvm.org/D66216 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@369088 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -1373,7 +1373,7 @@ static void computeKnownBitsFromOperator(const Operator *I, KnownBits &Known,
|
||||
else if (LR == I)
|
||||
L = LL;
|
||||
else
|
||||
break;
|
||||
continue; // Check for recurrence with L and R flipped.
|
||||
// Ok, we have a PHI of the form L op= R. Check for low
|
||||
// zero bits.
|
||||
computeKnownBits(R, Known2, Depth + 1, Q);
|
||||
|
||||
@@ -19,8 +19,8 @@ define void @phi_recurrence_start_first() {
|
||||
; CHECK-NEXT: br i1 [[COND_V]], label [[FOR_COND11:%.*]], label [[FOR_COND26]]
|
||||
; CHECK: for.cond11:
|
||||
; CHECK-NEXT: [[I_1:%.*]] = phi i32 [ [[START]], [[IF_THEN]] ], [ [[STEP:%.*]], [[FOR_COND11]] ]
|
||||
; CHECK-NEXT: [[CMP13:%.*]] = icmp slt i32 [[I_1]], 100
|
||||
; CHECK-NEXT: [[STEP]] = add nsw i32 [[I_1]], 1
|
||||
; CHECK-NEXT: [[CMP13:%.*]] = icmp ult i32 [[I_1]], 100
|
||||
; CHECK-NEXT: [[STEP]] = add nuw nsw i32 [[I_1]], 1
|
||||
; CHECK-NEXT: br i1 [[CMP13]], label [[FOR_COND11]], label [[WHILE_END]]
|
||||
; CHECK: for.cond26:
|
||||
; CHECK-NEXT: br label [[WHILE_COND]]
|
||||
|
||||
Reference in New Issue
Block a user