[PATCH] D20723: Don't generate unnecessary signed ConstantRange during multiply

Pete Cooper via llvm-commits llvm-commits at lists.llvm.org
Thu May 26 22:07:16 PDT 2016

pete created this revision.
pete added a reviewer: jmolloy.
pete added a subscriber: llvm-commits.
pete set the repository for this revision to rL LLVM.

Hi James

In r231483 you taught ConstantRange::multiply to be clever about signed vs unsigned ranges.  For example, an unsigned range could be full-set while the signed range is more specific than that.

In looking at the allocations trace for LTO'ing verify-uselistorder, I see millions of allocations from APInt, many of which come from ConstantRange's.

This change tries to avoid some (3.2 million) allocations by returning the unsigned range if its suitable.  The checks here are that it should not be a wrapping range, and should be positive.  That should be enough to check for ranges such as [1, 10) which the signed range will be equal to, if we were to calculate it.





Index: lib/IR/ConstantRange.cpp
--- lib/IR/ConstantRange.cpp
+++ lib/IR/ConstantRange.cpp
@@ -713,6 +713,13 @@
                                             this_max * Other_max + 1);
   ConstantRange UR = Result_zext.truncate(getBitWidth());
+  // If the unsigned range doesn't wrap, and isn't negative then it's a range
+  // from one positive number to another which is as good as we can generate.
+  // In this case, skip the extra work of generating signed ranges which aren't
+  // going to be better than this range.
+  if (!UR.isWrappedSet() && UR.getLower().isNonNegative())
+    return UR;
   // Now the signed range. Because we could be dealing with negative numbers
   // here, the lower bound is the smallest of the cartesian product of the
   // lower and upper ranges; for example:

-------------- next part --------------
A non-text attachment was scrubbed...
Name: D20723.58752.patch
Type: text/x-patch
Size: 868 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20160527/46b955ad/attachment.bin>

More information about the llvm-commits mailing list