of a constant.

llvm-svn: 123570

llvm-svn: 123569

multiple uses.  In some cases, all the uses are the same operation,
so instcombine can go ahead and promote the phi.  In the testcase
this pushes an add out of the loop.

llvm-svn: 123568

llvm-svn: 123567

first line of the function because it isn't a good idea, even for compares.

llvm-svn: 123566

llvm-svn: 123565

llvm-svn: 123564

of the stored value to the new store type is always.  Also, add a testcase.

llvm-svn: 123563

llvm-svn: 123562

llvm-svn: 123561

llvm-svn: 123560

multi-instruction sequences like calls.  Many thanks to Jakob for
finding a testcase.

llvm-svn: 123559

llvm-svn: 123558

Revert "Archive: Replace all internal uses of PathV1 with PathV2. The external API still uses PathV1."

llvm-svn: 123557

llvm-svn: 123556

it so the bots go green

llvm-svn: 123555

llvm-svn: 123554

llvm-svn: 123553

llvm-svn: 123552

llvm-svn: 123551

Support/GraphWriter: Replace all internal uses of PathV1 with PathV2. The external API still uses PathV1.

llvm-svn: 123550

llvm-svn: 123549

llvm-svn: 123548

http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel

In a silly microbenchmark on a 65 nm core2 this is 1.5x faster than the old
code in 32 bit mode and about 2x faster in 64 bit mode. It's also a lot shorter,
especially when counting 64 bit population on a 32 bit target.

I hope this is fast enough to replace Kernighan-style counting loops even when
the input is rather sparse.

llvm-svn: 123547

llvm-svn: 123546

llvm-svn: 123545

llvm-svn: 123544

llvm-svn: 123543

Add toCharUnitsInBits() to simplify the many calls to CharUnits::fromQuantity() of the form CharUnits::fromQuantity(bitSize, Context.getCharWidth()).

llvm-svn: 123542

opporuntities. Fixes PR8978.

llvm-svn: 123541

Patch by arrowdodger!

llvm-svn: 123539

llvm-svn: 123538

llvm-svn: 123537

Also, replace tabs with spaces. Yes, it's 2011.

llvm-svn: 123535

half a million non-local queries, each of which would otherwise have triggered a
linear scan over a basic block.

Also fix a fixme for memory intrinsics which dereference pointers. With this,
we prove that a pointer is non-null because it was dereferenced by an intrinsic
112 times in llvm-test.

llvm-svn: 123533

llvm-svn: 123531

llvm-svn: 123530

llvm-svn: 123529

realize that ConstantFoldTerminator doesn't preserve dominfo.

llvm-svn: 123527

The basic issue is that isel (very reasonably!) expects conditional branches
to be folded, so CGP leaving around a bunch dead computation feeding
conditional branches isn't such a good idea.  Just fold branches on constants
into unconditional branches.

llvm-svn: 123526