llvm-svn: 29752

llvm-svn: 29751

llvm-svn: 29750

llvm-svn: 29748

llvm-svn: 29747

llvm-svn: 29746

This reduces selectiondag time on kc++ from 5.43s to 4.98s (9%).  More
significantly, this speeds up the default ppc scheduler from ~1571ms to 1063ms,
a 33% speedup.

llvm-svn: 29743

llvm-svn: 29741

llvm-svn: 29740

llvm-svn: 29730

Remove the hard coded store and load of the link register
Implement ARMFrameInfo

llvm-svn: 29727

llvm-svn: 29726

llvm-svn: 29725

llvm-svn: 29722

linking the program on the fly.

llvm-svn: 29721

llvm-svn: 29715

llvm-svn: 29711

the creation of canonical VTLists.

llvm-svn: 29709

llvm-svn: 29687

of value-type nodes.  This avoids having to do mallocs for std::vectors of
valuetypes when a node returns more than one type.

llvm-svn: 29685

llvm-svn: 29677

kimwitu, but seems like a good idea from a "avoid performance cliffs" standpoint :)

llvm-svn: 29675

Transforms/CondProp/2006-08-14-SingleEntryPhiCrash.ll

llvm-svn: 29673

Rafael Espindola for pointing this out.

llvm-svn: 29669

ldr rx, [ry, #offset]

llvm-svn: 29664

the number of relocations in object files, shrinkifying them.

llvm-svn: 29650

llvm-svn: 29649

llvm-svn: 29648

Not only will this take huge amounts of compile time, the resultant loop nests
won't be useful for optimization.  This reduces loopsimplify time on
Transforms/LoopSimplify/2006-08-11-LoopSimplifyLongTime.ll from ~32s to ~0.4s
with a debug build of llvm on a 2.7Ghz G5.

llvm-svn: 29647

pounding on Loop::contains (which is O(n) in the size of the loop), use a
sorted vector, which is O(log(N)) for each query.  This speeds up Duraid's
horrible testcase from ~72s to ~31s in a debug build.

llvm-svn: 29645

blocks that target loop blocks.

Before, the code was run once per loop, and depended on the number of
predecessors each block in the loop had.  Unfortunately, scanning preds can
be really slow when huge numbers of phis exist or when phis with huge numbers
of inputs exist.

Now, the code is run once per function and scans successors instead of preds,
which is far faster.  In addition, the new code is simpler and is goto free,
woo.

This change speeds up a nasty testcase Duraid provided me from taking hours to
taking ~72s with a debug build.  The functionality this implements is already
tested in the testsuite as Transforms/CodeExtractor/2004-03-13-LoopExtractorCrash.ll.

llvm-svn: 29644

doesn't significantly improve performance but it helps a small amount.

llvm-svn: 29642

speedup in isel time.

llvm-svn: 29640

#includes it.

llvm-svn: 29639

llvm-svn: 29631

llvm-svn: 29627

RegNodes, and ValueNodes maps into the CSEMap.

llvm-svn: 29626

llvm-svn: 29621

make a temporary vector.

llvm-svn: 29618

instead of a vector of operands.

llvm-svn: 29616