diagnose, and took even longer to fix. It has to do with rewriting of a message
receiver which is an 'ivar' reference. Fix, however, is to remove a code which
was not doing the right thing and no longer needed.

llvm-svn: 46279

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

Made ImmutableSet::ImmutableSet(ImutAVLTree* Root) public. (this allows handy
casting between trees and sets).

llvm-svn: 46277

llvm-svn: 46274

llvm-svn: 46268

llvm-svn: 46267

llvm-svn: 46263

llvm-svn: 46262

llvm-svn: 46260

llvm-svn: 46259

llvm-svn: 46258

llvm-svn: 46257

noticing this!

llvm-svn: 46256

llvm-svn: 46255

NDEBUG.  This is in response to a really nasty bug I introduced that 
Dale tracked down, hopefully this won't happen in the future.  
Many thanks Dale.

llvm-svn: 46254

llvm-svn: 46253

llvm-svn: 46252

llvm-svn: 46251

llvm-svn: 46250

integers.  Handle truncstore of a legal type to an unusual
number of bits.  Most of this code is not reachable unless
the new legalize infrastructure is turned on.

llvm-svn: 46249

llvm-svn: 46247

llvm-svn: 46246

This fixes PR1927

This should be pulled into llvm 2.2.

llvm-svn: 46245

a smaller bitwidth.

llvm-svn: 46244

llvm-svn: 46243

- Add Sema::CheckStringLiteralInit, Sema::IsStringLiteralInit.
- Use previous hooks to simplify Sema::CheckInitializerTypes()...

llvm-svn: 46235

llvm-svn: 46234

llvm-svn: 46233

a method.

llvm-svn: 46232

Add a predicate/getter when checking for incomplete array types ("[]").

llvm-svn: 46231

llvm-svn: 46230

llvm-svn: 46229

be ignored on the false branch.

llvm-svn: 46228

clearer sequence of hashing compositions.

llvm-svn: 46227

to be reused to compute multiple object profiles.

llvm-svn: 46226

problem was that we previously hashed based on the pointers of the left and
right children, but this is bogus: we can easily have different trees that
represent the same set. Now we use a hashing based scheme that compares the
*contents* of the trees, but not without having to do a full scan of a tree. The
only caveat is that with hashing is that we may have collisions, which result in
two different trees being falsely labeled as equivalent. If this becomes a
problem, we can add extra data to the profile to hopefully resolve most
collisions.

llvm-svn: 46224

llvm-svn: 46223

external symbols (e.g. 'fmod') as needing a stub.  This regression
was introduced by Evan's jit patch here:
http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20071231/056749.html

With this fixed, the two ExecutionEngine failures are passing on ppc,
and the ppc jit works on freebench and olden.

This should be pulled into the 2.2 release branch.

llvm-svn: 46222

llvm-svn: 46220

llvm-svn: 46218