- removeRange() can now update value# information.

llvm-svn: 47044

llvm-svn: 47043

llvm-svn: 47042

Add an overload that supports the uint64_t interface for use by clients
that haven't been updated yet.

llvm-svn: 47039

Spotted by Nick Kledzik.

llvm-svn: 47037

llvm-svn: 47036

Move formats into the formats file

llvm-svn: 47035

bugs fixed.  This now passes PPC bootstrap.

llvm-svn: 47026

handle arbitrary precision integers and any number
of parts.  For example, on a 32 bit machine an i50
corresponds to two i32 parts.  getCopyToParts will
extend the i50 to an i64 then write half of the i64
to each part; getCopyFromParts will combine the two
i32 parts into an i64 then truncate the result to
i50.

llvm-svn: 47024

llvm-svn: 47020

llvm-svn: 47019

variable (with step 1) and m is its final value. Then, the correct trip 
count is SMAX(m,n)-n. Previously, we used SMAX(0,m-n), but m-n may 
overflow and can't in general be interpreted as signed.

Patch by Nick Lewycky.

llvm-svn: 47007

checks for a malloc/alloca immediately followed by a load.

llvm-svn: 47006

llvm-svn: 47002

llvm-svn: 47001

llvm-svn: 46979

in preparation for apint support.  These changes are
intended to have no functional effect.

llvm-svn: 46967

llvm-svn: 46964

llvm-svn: 46963

llvm-svn: 46962

llvm-svn: 46961

to the RHS. This simple change allows to compute loop iteration count 
for loops with condition similar to the one in the testcase (which seems 
to be quite common).

llvm-svn: 46959

Added member template "Add" to FoldingSetNodeID that allows "adding" arbitrary
objects to a profile via dispatch to FoldingSetTrait<T>::Profile().

Removed FoldingSetNodeID::AddAPFloat and FoldingSetNodeID::APInt, as their
functionality is now replaced using the above mentioned member template.

llvm-svn: 46957

arbitrary iteration.

The patch:
1) changes SCEVSDivExpr into SCEVUDivExpr,
2) replaces PartialFact() function with BinomialCoefficient(); the 
computations (essentially, the division) in BinomialCoefficient() are 
performed with the apprioprate bitwidth necessary to avoid overflow; 
unsigned division is used instead of the signed one.

Computations in BinomialCoefficient() require support from the code 
generator for APInts. Currently, we use a hack rounding up the 
neccessary bitwidth to the nearest power of 2. The hack is easy to turn 
off in future.

One remaining issue: we assume the divisor of the binomial coefficient 
formula can be computed accurately using 16 bits. It means we can handle 
AddRecs of length up to 9. In future, we should use APInts to evaluate 
the divisor.

Thanks to Nicholas for cooperation!

llvm-svn: 46955

llvm-svn: 46954

Determine whether a spill kills the register it's spilling before insertion rather than trying to undo the kill marker afterwards.

llvm-svn: 46953

Add some notes to the README.

llvm-svn: 46949

llvm-svn: 46948

This fixes the store case, my previous patch just fixed the load
case.  rdar://5707076.

llvm-svn: 46932

llvm-svn: 46931

llvm-svn: 46930

llvm-svn: 46926

no-op).

llvm-svn: 46922

llvm-svn: 46918

llvm-svn: 46916

pabs{b,w,d} are not two address
fix extract-to-mem sse4 ops
add sse4 vector sign extend nodes

llvm-svn: 46915

llvm-svn: 46908

llvm-svn: 46903

llvm-svn: 46902

llvm-svn: 46901