[PATCH] D149195: [SelectionDAG] Limit max recursion in `isKnownNeverZero` and `isKnownToBeAPowerOfTwo`
Noah Goldstein via Phabricator via llvm-commits
llvm-commits at lists.llvm.org
Tue Apr 25 21:44:03 PDT 2023
goldstein.w.n updated this revision to Diff 517045.
goldstein.w.n added a comment.
Rebase
Repository:
rG LLVM Github Monorepo
CHANGES SINCE LAST ACTION
https://reviews.llvm.org/D149195/new/
https://reviews.llvm.org/D149195
Files:
llvm/include/llvm/CodeGen/SelectionDAG.h
llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp
Index: llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp
===================================================================
--- llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp
+++ llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp
@@ -3975,7 +3975,10 @@
return OFK_Sometime;
}
-bool SelectionDAG::isKnownToBeAPowerOfTwo(SDValue Val) const {
+bool SelectionDAG::isKnownToBeAPowerOfTwo(SDValue Val, unsigned Depth) const {
+ if (Depth++ >= MaxRecursionDepth)
+ return false; // Limit search depth.
+
EVT OpVT = Val.getValueType();
unsigned BitWidth = OpVT.getScalarSizeInBits();
@@ -4017,7 +4020,7 @@
// vscale(power-of-two) is a power-of-two for some targets
if (Val.getOpcode() == ISD::VSCALE &&
getTargetLoweringInfo().isVScaleKnownToBeAPowerOfTwo() &&
- isKnownToBeAPowerOfTwo(Val.getOperand(0)))
+ isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth))
return true;
// More could be done here, though the above checks are enough
@@ -4992,7 +4995,10 @@
return false;
}
-bool SelectionDAG::isKnownNeverZero(SDValue Op) const {
+bool SelectionDAG::isKnownNeverZero(SDValue Op, unsigned Depth) const {
+ if (Depth++ >= MaxRecursionDepth)
+ return false; // Limit search depth.
+
assert(!Op.getValueType().isFloatingPoint() &&
"Floating point types unsupported - use isKnownNeverZeroFloat");
Index: llvm/include/llvm/CodeGen/SelectionDAG.h
===================================================================
--- llvm/include/llvm/CodeGen/SelectionDAG.h
+++ llvm/include/llvm/CodeGen/SelectionDAG.h
@@ -1990,7 +1990,7 @@
/// Test if the given value is known to have exactly one bit set. This differs
/// from computeKnownBits in that it doesn't necessarily determine which bit
/// is set.
- bool isKnownToBeAPowerOfTwo(SDValue Val) const;
+ bool isKnownToBeAPowerOfTwo(SDValue Val, unsigned Depth = 0) const;
/// Return the number of times the sign bit of the register is replicated into
/// the other bits. We know that at least 1 bit is always equal to the sign
@@ -2098,7 +2098,7 @@
bool isKnownNeverZeroFloat(SDValue Op) const;
/// Test whether the given SDValue is known to contain non-zero value(s).
- bool isKnownNeverZero(SDValue Op) const;
+ bool isKnownNeverZero(SDValue Op, unsigned Depth = 0) const;
/// Test whether two SDValues are known to compare equal. This
/// is true if they are the same value, or if one is negative zero and the
-------------- next part --------------
A non-text attachment was scrubbed...
Name: D149195.517045.patch
Type: text/x-patch
Size: 2448 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20230426/34a1b47a/attachment.bin>
More information about the llvm-commits
mailing list