[llvm] [DA] Clean up unnecessary member function declarations (PR #170106)
Ryotaro Kasuga via llvm-commits
llvm-commits at lists.llvm.org
Mon Dec 1 03:30:50 PST 2025
https://github.com/kasuga-fj created https://github.com/llvm/llvm-project/pull/170106
Follow-up for #169047. The previous PR moved some functions from DA to Delinearization, but the member function declarations were not updated accordingly. This patch removes them.
>From c1cde5c8f8e385a7f105508b2a629d618556d75b Mon Sep 17 00:00:00 2001
From: Ryotaro Kasuga <kasuga.ryotaro at fujitsu.com>
Date: Mon, 1 Dec 2025 11:25:37 +0000
Subject: [PATCH] [DA] Clean up unnecessary member function declarations
---
llvm/include/llvm/Analysis/DependenceAnalysis.h | 11 -----------
1 file changed, 11 deletions(-)
diff --git a/llvm/include/llvm/Analysis/DependenceAnalysis.h b/llvm/include/llvm/Analysis/DependenceAnalysis.h
index 8286d8e8e45cc..ad46d2f1466cf 100644
--- a/llvm/include/llvm/Analysis/DependenceAnalysis.h
+++ b/llvm/include/llvm/Analysis/DependenceAnalysis.h
@@ -506,17 +506,6 @@ class DependenceInfo {
bool isKnownPredicate(ICmpInst::Predicate Pred, const SCEV *X,
const SCEV *Y) const;
- /// isKnownLessThan - Compare to see if S is less than Size
- /// Another wrapper for isKnownNegative(S - max(Size, 1)) with some extra
- /// checking if S is an AddRec and we can prove lessthan using the loop
- /// bounds.
- bool isKnownLessThan(const SCEV *S, const SCEV *Size) const;
-
- /// isKnownNonNegative - Compare to see if S is known not to be negative
- /// Uses the fact that S comes from Ptr, which may be an inbound GEP,
- /// Proving there is no wrapping going on.
- bool isKnownNonNegative(const SCEV *S, const Value *Ptr) const;
-
/// collectUpperBound - All subscripts are the same type (on my machine,
/// an i64). The loop bound may be a smaller type. collectUpperBound
/// find the bound, if available, and zero extends it to the Type T.
More information about the llvm-commits
mailing list