[llvm] [DA] Remove consistent flag from Dependence class (PR #181608)
via llvm-commits
llvm-commits at lists.llvm.org
Sun Feb 15 23:45:29 PST 2026
llvmbot wrote:
<!--LLVM PR SUMMARY COMMENT-->
@llvm/pr-subscribers-llvm-analysis
Author: Ryotaro Kasuga (kasuga-fj)
<details>
<summary>Changes</summary>
The `Dependence` class has a flag `Consistent`, but it's not clear what it represents. This flag doesn't seem to be updated correctly during analysis. Also, and there are no users of it. Therefore, this flag would be unnecessary.
In addition, because of this flag, even minor code changes can alter test results unintentionally (specifically, the presence/absence of a string "consistent" in the test output). Such test changes can be confusing and gradually add to the maintenance burden.
Given these points, it's better to remove the `Consistent` flag from the `Dependence` class entirely.
---
Patch is 112.03 KiB, truncated to 20.00 KiB below, full version: https://github.com/llvm/llvm-project/pull/181608.diff
44 Files Affected:
- (modified) llvm/include/llvm/Analysis/DependenceAnalysis.h (-9)
- (modified) llvm/lib/Analysis/DependenceAnalysis.cpp (+1-18)
- (modified) llvm/test/Analysis/DependenceAnalysis/Banerjee.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/BasePtrBug.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/Constraints.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/DADelin.ll (+5-5)
- (modified) llvm/test/Analysis/DependenceAnalysis/DifferentOffsets.ll (+4-4)
- (modified) llvm/test/Analysis/DependenceAnalysis/ExactRDIV.ll (+4-4)
- (modified) llvm/test/Analysis/DependenceAnalysis/FlipFlopBaseAddress.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/MIVCheckConst.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/MismatchingNestLevels.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/NonAffineExpr.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/PR21585.ll (+3-3)
- (modified) llvm/test/Analysis/DependenceAnalysis/PR51512.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/Preliminary.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/Propagating.ll (+3-3)
- (modified) llvm/test/Analysis/DependenceAnalysis/SimpleSIVNoValidityCheck.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/SimpleSIVNoValidityCheckFixedSize.ll (+3-3)
- (modified) llvm/test/Analysis/DependenceAnalysis/StrongSIV.ll (+10-10)
- (modified) llvm/test/Analysis/DependenceAnalysis/SymbolicRDIV.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/SymbolicSIV.ll (+4-4)
- (modified) llvm/test/Analysis/DependenceAnalysis/UsefulGEP.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/WeakCrossingSIV.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/WeakZeroDstSIV.ll (+9-9)
- (modified) llvm/test/Analysis/DependenceAnalysis/WeakZeroSrcSIV.ll (+9-9)
- (modified) llvm/test/Analysis/DependenceAnalysis/ZIV.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/becount-couldnotcompute.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/compute-absolute-value.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/exact-siv-overflow.ll (+4-4)
- (modified) llvm/test/Analysis/DependenceAnalysis/gcd-miv-overflow.ll (+10-10)
- (modified) llvm/test/Analysis/DependenceAnalysis/infer_affine_domain_ovlf.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/lcssa.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/monotonicity-cast.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/monotonicity-invariant.ll (+3-3)
- (modified) llvm/test/Analysis/DependenceAnalysis/rdiv-large-btc.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/run-specific-dependence-test.ll (+111-111)
- (modified) llvm/test/Analysis/DependenceAnalysis/same-sd-for-diff-becount-type-loops.ll (+5-5)
- (modified) llvm/test/Analysis/DependenceAnalysis/strong-siv-overflow.ll (+1-1)
- (modified) llvm/test/Analysis/DependenceAnalysis/symbolic-rdiv-overflow.ll (+3-3)
- (modified) llvm/test/Analysis/DependenceAnalysis/weak-crossing-siv-large-btc.ll (+2-2)
- (modified) llvm/test/Analysis/DependenceAnalysis/weak-crossing-siv-overflow.ll (+4-4)
- (modified) llvm/test/Analysis/DependenceAnalysis/weak-zero-siv-large-btc.ll (+6-6)
- (modified) llvm/test/Analysis/DependenceAnalysis/weak-zero-siv-overflow.ll (+6-6)
- (modified) llvm/test/Analysis/DependenceAnalysis/zero-coefficient.ll (+1-1)
``````````diff
diff --git a/llvm/include/llvm/Analysis/DependenceAnalysis.h b/llvm/include/llvm/Analysis/DependenceAnalysis.h
index 6963914d6a03d..b84cab7c6535f 100644
--- a/llvm/include/llvm/Analysis/DependenceAnalysis.h
+++ b/llvm/include/llvm/Analysis/DependenceAnalysis.h
@@ -144,10 +144,6 @@ class LLVM_ABI Dependence {
/// (the compiler understands nothing and makes worst-case assumptions).
virtual bool isConfused() const { return true; }
- /// isConsistent - Returns true if this dependence is consistent
- /// (occurs every time the source and destination are executed).
- virtual bool isConsistent() const { return false; }
-
/// getLevels - Returns the number of common loops surrounding the
/// source and destination of the dependence.
virtual unsigned getLevels() const { return 0; }
@@ -260,10 +256,6 @@ class LLVM_ABI FullDependence final : public Dependence {
/// assumptions).
bool isConfused() const override { return false; }
- /// isConsistent - Returns true if this dependence is consistent
- /// (occurs every time the source and destination are executed).
- bool isConsistent() const override { return Consistent; }
-
/// getLevels - Returns the number of common loops surrounding the
/// source and destination of the dependence.
unsigned getLevels() const override { return Levels; }
@@ -326,7 +318,6 @@ class LLVM_ABI FullDependence final : public Dependence {
unsigned short Levels;
unsigned short SameSDLevels;
bool LoopIndependent;
- bool Consistent; // Init to true, then refine.
std::unique_ptr<DVEntry[]> DV;
std::unique_ptr<DVEntry[]> DVSameSD; // DV entries on SameSD levels
friend class DependenceInfo;
diff --git a/llvm/lib/Analysis/DependenceAnalysis.cpp b/llvm/lib/Analysis/DependenceAnalysis.cpp
index 51d0c32149330..8218eff9f37dd 100644
--- a/llvm/lib/Analysis/DependenceAnalysis.cpp
+++ b/llvm/lib/Analysis/DependenceAnalysis.cpp
@@ -590,7 +590,6 @@ FullDependence::FullDependence(Instruction *Source, Instruction *Destination,
unsigned CommonLevels)
: Dependence(Source, Destination, Assumes), Levels(CommonLevels),
LoopIndependent(PossiblyLoopIndependent) {
- Consistent = true;
SameSDLevels = 0;
if (CommonLevels)
DV = std::make_unique<DVEntry[]>(CommonLevels);
@@ -778,8 +777,6 @@ void Dependence::dump(raw_ostream &OS) const {
if (isConfused())
OS << "confused";
else {
- if (isConsistent())
- OS << "consistent ";
if (isFlow())
OS << "flow";
else if (isOutput())
@@ -1303,7 +1300,6 @@ bool DependenceInfo::testZIV(const SCEV *Src, const SCEV *Dst,
return true; // provably independent
}
LLVM_DEBUG(dbgs() << " possibly dependent\n");
- Result.Consistent = false;
return false; // possibly dependent
}
@@ -1354,10 +1350,8 @@ bool DependenceInfo::strongSIVtest(const SCEV *Coeff, const SCEV *SrcConst,
Level--;
const SCEV *Delta = minusSCEVNoSignedOverflow(SrcConst, DstConst, *SE);
- if (!Delta) {
- Result.Consistent = false;
+ if (!Delta)
return false;
- }
LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta);
LLVM_DEBUG(dbgs() << ", " << *Delta->getType() << "\n");
@@ -1440,8 +1434,6 @@ bool DependenceInfo::strongSIVtest(const SCEV *Coeff, const SCEV *SrcConst,
if (Coeff->isOne()) {
LLVM_DEBUG(dbgs() << "\t Distance = " << *Delta << "\n");
Result.DV[Level].Distance = Delta; // since X/1 == X
- } else {
- Result.Consistent = false;
}
// maybe we can get a useful direction
@@ -1513,7 +1505,6 @@ bool DependenceInfo::weakCrossingSIVtest(const SCEV *Coeff,
++WeakCrossingSIVapplications;
assert(0 < Level && Level <= CommonLevels && "Level out of range");
Level--;
- Result.Consistent = false;
const SCEV *Delta = SE->getMinusSCEV(DstConst, SrcConst);
LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
if (Delta->isZero()) {
@@ -1777,7 +1768,6 @@ bool DependenceInfo::exactSIVtest(const SCEV *SrcCoeff, const SCEV *DstCoeff,
++ExactSIVapplications;
assert(0 < Level && Level <= CommonLevels && "Level out of range");
Level--;
- Result.Consistent = false;
const SCEV *Delta = minusSCEVNoSignedOverflow(DstConst, SrcConst, *SE);
if (!Delta)
return false;
@@ -1965,7 +1955,6 @@ bool DependenceInfo::weakZeroSrcSIVtest(const SCEV *DstCoeff,
++WeakZeroSIVapplications;
assert(0 < Level && Level <= MaxLevels && "Level out of range");
Level--;
- Result.Consistent = false;
const SCEV *Delta = SE->getMinusSCEV(SrcConst, DstConst);
LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
if (SE->isKnownPredicate(CmpInst::ICMP_EQ, SrcConst, DstConst)) {
@@ -2078,7 +2067,6 @@ bool DependenceInfo::weakZeroDstSIVtest(const SCEV *SrcCoeff,
++WeakZeroSIVapplications;
assert(0 < Level && Level <= SrcLevels && "Level out of range");
Level--;
- Result.Consistent = false;
const SCEV *Delta = SE->getMinusSCEV(DstConst, SrcConst);
LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
if (SE->isKnownPredicate(CmpInst::ICMP_EQ, DstConst, SrcConst)) {
@@ -2162,7 +2150,6 @@ bool DependenceInfo::exactRDIVtest(const SCEV *SrcCoeff, const SCEV *DstCoeff,
LLVM_DEBUG(dbgs() << "\t SrcConst = " << *SrcConst << "\n");
LLVM_DEBUG(dbgs() << "\t DstConst = " << *DstConst << "\n");
++ExactRDIVapplications;
- Result.Consistent = false;
const SCEV *Delta = SE->getMinusSCEV(DstConst, SrcConst);
LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
const SCEVConstant *ConstDelta = dyn_cast<SCEVConstant>(Delta);
@@ -2542,7 +2529,6 @@ bool DependenceInfo::testMIV(const SCEV *Src, const SCEV *Dst,
FullDependence &Result) const {
LLVM_DEBUG(dbgs() << " src = " << *Src << "\n");
LLVM_DEBUG(dbgs() << " dst = " << *Dst << "\n");
- Result.Consistent = false;
return gcdMIVtest(Src, Dst, Result) ||
banerjeeMIVtest(Src, Dst, Loops, Result);
}
@@ -3633,7 +3619,6 @@ DependenceInfo::depends(Instruction *Src, Instruction *Dst,
Pair[SI].Loops);
collectCommonLoops(Pair[SI].Dst, LI->getLoopFor(Dst->getParent()),
Pair[SI].Loops);
- Result.Consistent = false;
break;
case Subscript::ZIV:
LLVM_DEBUG(dbgs() << ", ZIV\n");
@@ -3708,8 +3693,6 @@ DependenceInfo::depends(Instruction *Src, Instruction *Dst,
Result.DVSameSD = std::move(DVSameSD);
Result.Levels = CommonLevels;
Result.SameSDLevels = SameSDLevels;
- // Result is not consistent if it considers SameSD levels
- Result.Consistent = false;
}
if (PossiblyLoopIndependent) {
diff --git a/llvm/test/Analysis/DependenceAnalysis/Banerjee.ll b/llvm/test/Analysis/DependenceAnalysis/Banerjee.ll
index 6dde8844c6040..833752af2ca30 100644
--- a/llvm/test/Analysis/DependenceAnalysis/Banerjee.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/Banerjee.ll
@@ -660,7 +660,7 @@ define void @banerjee7(ptr %A, ptr %B, i64 %m, i64 %n) nounwind uwtable ssp {
; DELIN-NEXT: Src: store i64 0, ptr %arrayidx, align 8 --> Dst: store i64 0, ptr %arrayidx, align 8
; DELIN-NEXT: da analyze - none!
; DELIN-NEXT: Src: store i64 0, ptr %arrayidx, align 8 --> Dst: %0 = load i64, ptr %arrayidx7, align 8
-; DELIN-NEXT: da analyze - consistent flow [-1 0]!
+; DELIN-NEXT: da analyze - flow [-1 0]!
; DELIN-NEXT: Src: store i64 0, ptr %arrayidx, align 8 --> Dst: store i64 %0, ptr %B.addr.11, align 8
; DELIN-NEXT: da analyze - confused!
; DELIN-NEXT: Src: %0 = load i64, ptr %arrayidx7, align 8 --> Dst: %0 = load i64, ptr %arrayidx7, align 8
diff --git a/llvm/test/Analysis/DependenceAnalysis/BasePtrBug.ll b/llvm/test/Analysis/DependenceAnalysis/BasePtrBug.ll
index 81e461a5e092d..dd35508b93ddd 100644
--- a/llvm/test/Analysis/DependenceAnalysis/BasePtrBug.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/BasePtrBug.ll
@@ -67,7 +67,7 @@ define void @test2(ptr, i32) #3 {
; CHECK-NEXT: Src: %10 = load i32, ptr %9, align 4 --> Dst: %10 = load i32, ptr %9, align 4
; CHECK-NEXT: da analyze - none!
; CHECK-NEXT: Src: %10 = load i32, ptr %9, align 4 --> Dst: store i32 %10, ptr %12, align 4
-; CHECK-NEXT: da analyze - consistent anti [1]!
+; CHECK-NEXT: da analyze - anti [1]!
; CHECK-NEXT: Src: store i32 %10, ptr %12, align 4 --> Dst: store i32 %10, ptr %12, align 4
; CHECK-NEXT: da analyze - none!
;
diff --git a/llvm/test/Analysis/DependenceAnalysis/Constraints.ll b/llvm/test/Analysis/DependenceAnalysis/Constraints.ll
index 65dbcef153d19..810f9e5a8cdb5 100644
--- a/llvm/test/Analysis/DependenceAnalysis/Constraints.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/Constraints.ll
@@ -35,7 +35,7 @@ define void @dep_constraint_crash_test(i32 %M, i32 %N) {
; CHECK-NEXT: Src: %out_l.promoted = load i32, ptr @out_l, align 4 --> Dst: %32 = load i32, ptr %6, align 4
; CHECK-NEXT: da analyze - none!
; CHECK-NEXT: Src: %out_l.promoted = load i32, ptr @out_l, align 4 --> Dst: store i32 %33, ptr @out_l, align 4
-; CHECK-NEXT: da analyze - consistent anti [|<]!
+; CHECK-NEXT: da analyze - anti [|<]!
; CHECK-NEXT: Src: store i32 0, ptr %13, align 4 --> Dst: store i32 0, ptr %13, align 4
; CHECK-NEXT: da analyze - output [S * *]!
; CHECK-NEXT: Src: store i32 0, ptr %13, align 4 --> Dst: %18 = load i32, ptr %17, align 4
@@ -141,7 +141,7 @@ define void @dep_constraint_crash_test(i32 %M, i32 %N) {
; CHECK-NEXT: Src: store i32 %30, ptr %31, align 4 --> Dst: store i32 %33, ptr @out_l, align 4
; CHECK-NEXT: da analyze - none!
; CHECK-NEXT: Src: %32 = load i32, ptr %6, align 4 --> Dst: %32 = load i32, ptr %6, align 4
-; CHECK-NEXT: da analyze - consistent input [S]!
+; CHECK-NEXT: da analyze - input [S]!
; CHECK-NEXT: Src: %32 = load i32, ptr %6, align 4 --> Dst: store i32 %33, ptr @out_l, align 4
; CHECK-NEXT: da analyze - none!
; CHECK-NEXT: Src: store i32 %33, ptr @out_l, align 4 --> Dst: store i32 %33, ptr @out_l, align 4
diff --git a/llvm/test/Analysis/DependenceAnalysis/DADelin.ll b/llvm/test/Analysis/DependenceAnalysis/DADelin.ll
index 429e37de0a453..8b72880fea767 100644
--- a/llvm/test/Analysis/DependenceAnalysis/DADelin.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/DADelin.ll
@@ -545,7 +545,7 @@ for.cond.cleanup: ; preds = %for.cond.cleanup3,
define double @test_sizes(i16 %h, i16 %N, ptr nocapture %array) {
; CHECK-LABEL: 'test_sizes'
; CHECK-NEXT: Src: %2 = load i16, ptr %arrayidx, align 4 --> Dst: %2 = load i16, ptr %arrayidx, align 4
-; CHECK-NEXT: da analyze - consistent input [0 S]!
+; CHECK-NEXT: da analyze - input [0 S]!
; CHECK-NEXT: Src: %2 = load i16, ptr %arrayidx, align 4 --> Dst: store i16 %add6, ptr %arrayidx8, align 4
; CHECK-NEXT: da analyze - anti [* *|<]!
; CHECK-NEXT: Src: store i16 %add6, ptr %arrayidx8, align 4 --> Dst: store i16 %add6, ptr %arrayidx8, align 4
@@ -646,13 +646,13 @@ exit:
define void @coeff_may_negative(ptr %a, i32 %k) {
; CHECK-LABEL: 'coeff_may_negative'
; CHECK-NEXT: Src: store i8 42, ptr %idx.0, align 1 --> Dst: store i8 42, ptr %idx.0, align 1
-; CHECK-NEXT: da analyze - consistent output [0]!
+; CHECK-NEXT: da analyze - output [0]!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Compare predicate: %k ne) 0
; CHECK-NEXT: Src: store i8 42, ptr %idx.0, align 1 --> Dst: store i8 42, ptr %idx.1, align 1
; CHECK-NEXT: da analyze - output [*|<]!
; CHECK-NEXT: Src: store i8 42, ptr %idx.1, align 1 --> Dst: store i8 42, ptr %idx.1, align 1
-; CHECK-NEXT: da analyze - consistent output [0]!
+; CHECK-NEXT: da analyze - output [0]!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Compare predicate: %k ne) 0
;
@@ -689,13 +689,13 @@ exit:
define void @coeff_positive(ptr %a, i32 %k) {
; CHECK-LABEL: 'coeff_positive'
; CHECK-NEXT: Src: store i8 42, ptr %idx.0, align 1 --> Dst: store i8 42, ptr %idx.0, align 1
-; CHECK-NEXT: da analyze - consistent output [0]!
+; CHECK-NEXT: da analyze - output [0]!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Compare predicate: %k ne) 0
; CHECK-NEXT: Src: store i8 42, ptr %idx.0, align 1 --> Dst: store i8 42, ptr %idx.1, align 1
; CHECK-NEXT: da analyze - output [*|<]!
; CHECK-NEXT: Src: store i8 42, ptr %idx.1, align 1 --> Dst: store i8 42, ptr %idx.1, align 1
-; CHECK-NEXT: da analyze - consistent output [0]!
+; CHECK-NEXT: da analyze - output [0]!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Compare predicate: %k ne) 0
;
diff --git a/llvm/test/Analysis/DependenceAnalysis/DifferentOffsets.ll b/llvm/test/Analysis/DependenceAnalysis/DifferentOffsets.ll
index 3360e603eb406..0c97515281fbf 100644
--- a/llvm/test/Analysis/DependenceAnalysis/DifferentOffsets.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/DifferentOffsets.ll
@@ -27,7 +27,7 @@ entry:
define i32 @alias_with_parametric_offset(ptr nocapture %A, i64 %n) {
; CHECK-LABEL: 'alias_with_parametric_offset'
; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: store i32 2, ptr %arrayidx, align 1
-; CHECK-NEXT: da analyze - consistent output []!
+; CHECK-NEXT: da analyze - output []!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Equal predicate: (zext i2 (trunc i64 %n to i2) to i64) == 0
; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: %0 = load i32, ptr %A, align 1
@@ -47,7 +47,7 @@ entry:
define i32 @alias_with_parametric_expr(ptr nocapture %A, i64 %n, i64 %m) {
; CHECK-LABEL: 'alias_with_parametric_expr'
; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: store i32 2, ptr %arrayidx, align 1
-; CHECK-NEXT: da analyze - consistent output []!
+; CHECK-NEXT: da analyze - output []!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Equal predicate: (zext i2 ((trunc i64 %m to i2) + (-2 * (trunc i64 %n to i2))) to i64) == 0
; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: %0 = load i32, ptr %arrayidx1, align 1
@@ -56,7 +56,7 @@ define i32 @alias_with_parametric_expr(ptr nocapture %A, i64 %n, i64 %m) {
; CHECK-NEXT: Equal predicate: (zext i2 ((trunc i64 %m to i2) + (-2 * (trunc i64 %n to i2))) to i64) == 0
; CHECK-NEXT: Equal predicate: (zext i2 (-2 + (trunc i64 %m to i2)) to i64) == 0
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx1, align 1 --> Dst: %0 = load i32, ptr %arrayidx1, align 1
-; CHECK-NEXT: da analyze - consistent input []!
+; CHECK-NEXT: da analyze - input []!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Equal predicate: (zext i2 (-2 + (trunc i64 %m to i2)) to i64) == 0
;
@@ -75,7 +75,7 @@ entry:
define i32 @gep_i8_vs_i32(ptr nocapture %A, i64 %n, i64 %m) {
; CHECK-LABEL: 'gep_i8_vs_i32'
; CHECK-NEXT: Src: store i32 42, ptr %arrayidx0, align 1 --> Dst: store i32 42, ptr %arrayidx0, align 1
-; CHECK-NEXT: da analyze - consistent output []!
+; CHECK-NEXT: da analyze - output []!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Equal predicate: (zext i2 (trunc i64 %n to i2) to i64) == 0
; CHECK-NEXT: Src: store i32 42, ptr %arrayidx0, align 1 --> Dst: store i32 42, ptr %arrayidx1, align 4
diff --git a/llvm/test/Analysis/DependenceAnalysis/ExactRDIV.ll b/llvm/test/Analysis/DependenceAnalysis/ExactRDIV.ll
index b5ece14121686..2ca80fe06514c 100644
--- a/llvm/test/Analysis/DependenceAnalysis/ExactRDIV.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/ExactRDIV.ll
@@ -504,7 +504,7 @@ define void @rdiv9(ptr %A, ptr %B) nounwind uwtable ssp {
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
-; CHECK-NEXT: da analyze - consistent input [S S]!
+; CHECK-NEXT: da analyze - input [S S]!
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: store i32 %0, ptr %B.addr.11, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
@@ -560,7 +560,7 @@ define void @rdiv10(ptr %A, ptr %B) nounwind uwtable ssp {
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
-; CHECK-NEXT: da analyze - consistent input [S S]!
+; CHECK-NEXT: da analyze - input [S S]!
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: store i32 %0, ptr %B.addr.11, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
@@ -615,7 +615,7 @@ define void @rdiv11(ptr %A, ptr %B) nounwind uwtable ssp {
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
-; CHECK-NEXT: da analyze - consistent input [S S]!
+; CHECK-NEXT: da analyze - input [S S]!
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: store i32 %0, ptr %B.addr.11, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
@@ -670,7 +670,7 @@ define void @rdiv12(ptr %A, ptr %B) nounwind uwtable ssp {
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
-; CHECK-NEXT: da analyze - consistent input [S S]!
+; CHECK-NEXT: da analyze - input [S S]!
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: store i32 %0, ptr %B.addr.11, align 4 --> Dst: store i32 %0, ptr %B.addr.11, align 4
diff --git a/llvm/test/Analysis/DependenceAnalysis/FlipFlopBaseAddress.ll b/llvm/test/Analysis/DependenceAnalysis/FlipFlopBaseAddress.ll
index bd3e29e10e093..972ada71bd381 100644
--- a/llvm/test/Analysis/DependenceAnalysis/FlipFlopBaseAddress.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/FlipFlopBaseAddress.ll
@@ -64,7 +64,7 @@ for.cond.cleanup:
define void @bug53942_foo(i32 noundef %n, ptr noalias nocapture noundef writeonly %A, ptr noalias nocapture noundef %B) {
; CHECK-LABEL: 'bug53942_foo'
; CHECK-NEXT: Src: %.pre = load double, ptr %B, align 8 --> Dst: %.pre = load double, ptr %B, align 8
-; CHECK-NEXT: da analyze - consistent input [S]!
+; CHECK-NEXT: da analyze - input [S]!
; CHECK-NEXT: Src: %.pre = load double, ptr %B, align 8 --> Dst: store double %.pre, ptr %arrayidx2, align 8
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: store double %.pre, ptr %arrayidx2, align 8 --> Dst: store double %.pre, ptr %arrayidx2, align 8
diff --git a/llvm/test/Analysis/DependenceAnalysis/MIVCheckConst.ll b/llvm/test/Analysis/DependenceAnalysis/MIVCheckConst.ll
index d91a916d785c2..c6e93b442afc4 100644
--- a/llvm/test/Analysis/DependenceAnalysis/MIVCheckConst.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/MIVCheckConst.ll
@@ -39,7 +39,7 @@ define void @test(ptr %A, ptr %B, i1 %arg, i32 %n, i32 %m) align 2 {
; CHECK-NEXT: Src: %v1 = load i32, ptr %B, align 4 --> Dst: %v32 = load <32 x i32>, ptr %v30, align 128
; CHECK-NEXT: da analyze - confused!
; CHECK-NEXT: Src: %v27 = load <32 x i32>, ptr %v25, align 256 --> Dst: %v27 = load <32 x i32>, ptr %v25, align 256
-; CHECK-NEXT: da analyze - consistent input [0 S S]!
+; CHECK-NEXT: da analyze - input [0 S S]!
; CHECK-NEXT: Runtime Assumptions:
; CHECK-NEXT: Equal predicate: (zext i7 (4 * (trunc i32 %v1 to i7) * (1 + (trunc i32 %n to i7))) to i32) == 0
; CHECK-NEXT: Equal predicate: (8 * (zext i4 (trunc i32 %v1 to i4) to i32))<nuw><nsw> == 0
@@ -50,7 +50,7 @@ define void @test(ptr %A, ptr %B, i1 %arg, i32 %n, i32 %m) align 2 {
; CHECK-NEXT: Equal predicate: (zext i7 (4 * (trunc i32 %v1 to i7) * (1 + (trunc i32 %n to i7))) to i32) == 0
; CHECK-NEXT: Equal predicate: (8 * (zext i4 (trunc i32 %v1 to i4) to i32))<nuw><nsw> == 0
; CHECK-NEXT: Src: %v32 = load <32 x...
[truncated]
``````````
</details>
https://github.com/llvm/llvm-project/pull/181608
More information about the llvm-commits
mailing list