argument by reference, rather than by value. 

llvm-svn: 46960

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

getNumRegisters.  This is needed for calling functions
with apint parameters or return values.

llvm-svn: 46956

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

llvm-svn: 46952

llvm-svn: 46951

Add some notes to the README.

llvm-svn: 46949

llvm-svn: 46948

maybe c380004 can be hyperlinked too?

llvm-svn: 46934

"I have been working my way through the JIT and Kaleidoscope tutorials in my
(minuscule) spare time.  Thanks again for writing them!  I have attached a
patch containing some minor changes, ranging from spelling and grammar fixes
to adding a "Next: <next tutorial section>" hyperlink to the bottom of each
page.

Every page has been given the "next link" treatment, but otherwise I'm only
half way through the Kaleidoscope tutorial.  I will send a follow-on patch
if time permits."

llvm-svn: 46933

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: 46929

llvm-svn: 46928

llvm-svn: 46926

llvm-svn: 46925

llvm-svn: 46924

llvm-svn: 46923

no-op).

llvm-svn: 46922

llvm-svn: 46921

llvm-svn: 46920

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: 46914

llvm-svn: 46913

llvm-svn: 46912

whether SSE is present, on Darwin anyway.  Make it
explicit.

llvm-svn: 46909

llvm-svn: 46908

Add a check if the initial value of the induction variable is 0 (the method comment says it should be).

llvm-svn: 46907

llvm-svn: 46903

llvm-svn: 46902

llvm-svn: 46901

common problem of putting two terminators in the same block.  I can't write
a testcase for this because the .ll parser rejects this before the verifier
can, but this can occur when generating IR.

llvm-svn: 46900

begin adding some methods to use it this way.

llvm-svn: 46899

llvm-svn: 46898