- Jul 12, 2009
-
-
Nick Lewycky authored
llvm-svn: 75413
-
Nick Lewycky authored
Some = [10, 2730). A subset of that is [1024..2048) which covers every possible 10-bit pattern. llvm-svn: 75411
-
Nick Lewycky authored
llvm-svn: 75410
-
- Jul 11, 2009
-
-
Nick Lewycky authored
A full set is a constant range that represents any number. If you take the umax of that and [5, 10) you end up with [5, INT_MAX] because the values less than 5 would be umax's against a value which is at least 5. llvm-svn: 75372
-
Nick Lewycky authored
changes. llvm-svn: 75369
-
- Jul 10, 2009
-
-
Dan Gohman authored
merge the new functionality and unittests into ConstantRange. Thanks to Nick Lewycky for pointing out that it isn't necessary to have two separate classes here. llvm-svn: 75191
-
Dan Gohman authored
what ConstantRange does for unsigned integers. Factor out a common base class for common functionality. Add some new functions for performing arithmetic on constant ranges. Some of these are currently just stubbed out with conservative implementations. Add unittests for ConstantRange and ConstantSignedRange. llvm-svn: 75177
-