now SymbolicNonLValue.

Cleaned up some casts.

llvm-svn: 46467

Renamed ExprValue to RValue, as all expression values are RValues, and this
keeps with the C terminology (renamed old "RValue" class to "NonLValue").

Introduced "ConcreteInt", a class that represents a concrete, integer
constant as an RValue.

Temporarily removed classes to represent set of possible constants and set of !=
constants. Will replace with a more general class representing a set of
constraints.

Added some foundational code to track "symbolic" values, which are used to
accrue constraints on an abstract value that is shared between multiple
variables.  e.g:

   x = y;      // at this point "x" and "y" share the same "value"
   if (x > 1) 
     ...       // at this point, the value shared by "x" and "y" is "> 1".

llvm-svn: 46466

llvm-svn: 46379

a template-template parameter.

llvm-svn: 46378

Renamed RValueConjunctiveUnequal to RValInequalityANDSet.

Refactored add/subtract/multiple (and now divide) operations for
RValEqualityORSet to be based on a single template function.

llvm-svn: 46374

llvm-svn: 46370

llvm-svn: 46368

information is not separated into a "base" and "sub" type. Eventually the
value-tracking logic will know about LValues and RValues, but not about
specialized LValues and RValues; separating the "kind" information into bits
indicating whether an ExprValue is an LValue or an RValue from the bits that
specify the actual value type makes this separation easier.

llvm-svn: 46329

llvm-svn: 46327

llvm-svn: 46326

llvm-svn: 46323

a Stmt* is a block-level expression when we INSERT a value into the map, and
not also when we QUERY a value.

llvm-svn: 46321

the value map as if the expressions were non-block-level expressions.

llvm-svn: 46319

we falsely constructed an APInt to represent the constant '1' instead of
using an APSInt (which has a sign).

llvm-svn: 46317

Added some workarounds for loss of signess information on some APSInt
operations. Considering the best route to integrate these into APSInt directly.
(FIXME's in GRConstants.cpp).

llvm-svn: 46310

llvm-svn: 46300

Added initial support for integer casting operations to GRConstants.

llvm-svn: 46298

llvm-svn: 46294

Added "multiplication" support for equality sets.

llvm-svn: 46289

llvm-svn: 46288

causing problems with Dot.

llvm-svn: 46285

llvm-svn: 46284

abstract "L-values" and "R-values" when doing value tracking, and expanding
constant tracking to encompass tracking disjunctive sets of possible constants.
Further, the tree-walking is more efficient, as we don't blindly recurse the
tree if we won't generate new states.

llvm-svn: 46278

use ImmutableMap::SlimFind(), which returns the correct value.

Added pruning of dead block-level expressions and Decls from our value map
using liveness information.

llvm-svn: 46154

values for the block-level expressions.

Modified 'LiveVariables' to provide the option to clients to record
liveness information for block-level expressions (using the above feature).

Modified 'DeadStores' to conform to the new interface of 'LiveVariables'.

Modified 'GRConstants' to compute liveness information for block-level
expressions.

llvm-svn: 46137

Refactored the use of this method into both the Sema module and Analysis module,
which were using their own static functions that did the same thing.

llvm-svn: 46129

state.

llvm-svn: 46106

map. This will allow us to quickly prune them from maps without searching the
entire map.

llvm-svn: 46101

to sort sub-expressions before Block-level expressions.

llvm-svn: 46100

values are determined when evaluating the parent expression.

llvm-svn: 46096

constant propagation.

llvm-svn: 46095

llvm-svn: 46092

llvm-svn: 46087

llvm-svn: 46086

that were "not a constant."

llvm-svn: 46085

Fixed some compilation errors with GREngine that showed up during
template instantiation.

llvm-svn: 46074

node caching in GREngine will guarantee that we do not insert a node twice into
a nodeset.

llvm-svn: 46071

llvm-svn: 46051

variant type, and not just the pointer value.

llvm-svn: 46049

Cleaned up GRConstants::AddBinding to not directly reference the
predecessor node.  Now we just manipulate the current state, and a driver
function creates nodes as needed.

llvm-svn: 46040