Make this clearer for the mathematically inclined. Thanks to Duncan Sands for

going over the text!

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@75414 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/include/llvm/Support/ConstantRange.h b/include/llvm/Support/ConstantRange.h
index 64019ca3a7bc92bff431a6ef8b0fb0ea96d717e9..cbf3f87a3543cd95f95c0d7cf9f5eb991114e7ba 100644 (file)
--- a/include/llvm/Support/ConstantRange.h
+++ b/include/llvm/Support/ConstantRange.h
@@ -61,6 +61,10 @@ public:
   /// makeICmpRegion - Produce the smallest range that contains all values that
   /// might satisfy the comparison specified by Pred when compared to any value
   /// contained within Other.
   /// makeICmpRegion - Produce the smallest range that contains all values that
   /// might satisfy the comparison specified by Pred when compared to any value
   /// contained within Other.

+  ///
+  /// Solves for range X in 'for all x in X, there exists a y in Y such that
+  /// icmp op x, y is true'. Every value that might make the comparison true
+  /// is included in the resulting range.

   static ConstantRange makeICmpRegion(unsigned Pred,
                                       const ConstantRange &Other);
 
   static ConstantRange makeICmpRegion(unsigned Pred,
                                       const ConstantRange &Other);