llvm-svn: 16625

llvm-svn: 16624

or cleared externally.

llvm-svn: 16623

llvm-svn: 16622

llvm-svn: 16621

llvm-svn: 16620

Make accessors return FunctionPass* as appropriate.

llvm-svn: 16619

llvm-svn: 16618

llvm-svn: 16617

llvm-svn: 16616

llvm-svn: 16615

targets that supported multiple memory operands.

llvm-svn: 16614

llvm-svn: 16613

* Add const_iterator stuff
* Add a print method, which means that I can now call dump() from the
  debugger.

llvm-svn: 16612

Add some comments.

llvm-svn: 16611

to find instrs that have delay slots.

llvm-svn: 16610

llvm-svn: 16609

two spillers produce perfectly identical code (at least on povray and eon),
but the simple spiller is substantially faster than the local spiller. Once
the local spiller is improved, we can switch back.

Switching cuts 5.2% off of the llc time for povray (about 1.3s).

llvm-svn: 16608

use a simple vector.  This speeds up -spiller=simple from taking 22s to taking
.1s on povray (debug build).  This change does not modify the generated code.

llvm-svn: 16607

data structures).  Fix the print method to send to the right ostream, not
always cerr.  Delete typedefs that are only used once.

llvm-svn: 16606

the beginning of processing the next one.

llvm-svn: 16605

prune #includes, add print/dump methods, etc.  No functionality changes.

llvm-svn: 16604

that always prints when linking programs to libstdc++ :(

llvm-svn: 16603

won't work if not compiled in V9 mode, currently by GCC only, because Sun's
system compiler does not tell us if it's a V8 or V9 system.

llvm-svn: 16602

llvm-svn: 16598

llvm-svn: 16597

llvm-svn: 16595

llvm-svn: 16594

This method is linear time in the size of the basic block, which is very
bad for large basic blocks.  On the Assembler/2004-09-29-VerifierIsReallySlow.llx
testcase, the verifier changes from taking 50s to 0.23s with this patch.

llvm-svn: 16593

llvm-svn: 16592

llvm-svn: 16591

something, because the wrong bit patterns get output.

llvm-svn: 16590

* SubOne/AddOne functions always return ConstantInt, declare them as such
* Pull code for handling setcc X, cst, where cst is at the end of the range,
  or cc is LE or GE up earlier in visitSetCondInst.  This reduces #iterations
  in some cases.
* Fold: (div X, C1) op C2 -> range check, implementing div.ll:test6 - test9.

llvm-svn: 16588

llvm-svn: 16587

llvm-svn: 16586

potentially fold more in one pass.

llvm-svn: 16583

This takes something like this:

%A = phi int [ 3, %cond_false.0 ], [ 2, %endif.0.i ], [ 2, %endif.1.i ]
%B = div int %tmp.243, 4

and turns it into:

%A = phi int [ 3/4, %cond_false.0 ], [ 2/4, %endif.0.i ], [ 2/4, %endif.1.i ]

which is later simplified (in this case) into %A = 0.

This triggers thousands of times in spec, for example, 269 times in 176.gcc.

This is tested by InstCombine/add.ll:test23 and set.ll:test18.

llvm-svn: 16582

llvm-svn: 16581

Generate better code by being far less clever when it comes to the select instruction.  Don't create overlapping register lifetimes

llvm-svn: 16580

llvm-svn: 16579