llvm-svn: 20788

llvm-svn: 20787

global roots in from callees to callers.  The BU graphs do not have accurate
globals information and all of the clients know it.  Instead, just make sure
the GG is up-to-date, and they will be perfectly satiated.

This speeds up the BU pass on 176.gcc from 5.5s to 1.5s, and Loc+BU+TD
from 7s to 2.7s.

llvm-svn: 20786

llvm-svn: 20785

llvm-svn: 20784

incompleteness flags.

Make it more aggressive by taking field sensitive information into
account.

llvm-svn: 20781

Fixed many many bugs.
This now works on almost all Singlesource , and most of MultiSource.

llvm-svn: 20780

llvm-svn: 20779

test cannot be satisfied without interprocedural information.

llvm-svn: 20778

llvm-svn: 20777

llvm-svn: 20776

1. Increase max node size from 64->256 to avoid collapsing an important
   structure in 181.mcf
2. If we have multiple calls to an indirect call node with an indirect
   callee, fold these call nodes together, to avoid DSA turning apoc into
   a flaming fireball of death when analyzing 176.gcc.
  With this change, 176.gcc now takes ~7s to analyze for loc+bu+td, with
  5.7s of that in the BU pass.

llvm-svn: 20775

llvm-svn: 20774

Analysis/DSGraph/2005-03-22-IncompleteGlobal.ll

llvm-svn: 20773

llvm-svn: 20772

llvm-svn: 20771

cloning a graph.

llvm-svn: 20770

llvm-svn: 20769

llvm-svn: 20766

llvm-svn: 20765

by not allowing integer constants to get into the scalar map in the first
place.

llvm-svn: 20764

this clone is supposed to be used for *ALL* of the functions in the SCC.

This fixes the memory explosion problem the TD pass was having, reducing the
memory growth from 24MB -> 3.5MB on povray and 270MB ->8.3MB on perlbmk!
This obviously also speeds up the TD pass *a lot*.

llvm-svn: 20763

up the TD pass about 30% for povray and perlbmk.  It's still not clear why
copying a 5MB set of graphs turns into a 25MB set of graphs though :(

llvm-svn: 20762

llvm-svn: 20761

cloneInto: make it an internally used mapping.

llvm-svn: 20760

llvm-svn: 20759

llvm-svn: 20758

for the return node map.

llvm-svn: 20757

two things:  1)evilness reduction patch, reduces the number of instructions hiding in the small jump CC moving code.  2)implement div of small data types by FP DIV (also reduces evilness and should speed things up)

llvm-svn: 20756

this identity merge.

llvm-svn: 20755

llvm-svn: 20754

llvm-svn: 20753

llvm-svn: 20752

llvm-svn: 20751

llvm-svn: 20750

llvm-svn: 20749

llvm-svn: 20748

llvm-svn: 20747

sites that target multiple callees.  If we have a function table, for
example, with N callees, and M callers call through it, we used to have
to perform O(M*N) graph inlinings.  Now we perform O(M+N) inlinings.

This speeds up the td pass on perlbmk from 36.26s to 25.75s.

llvm-svn: 20743

llvm-svn: 20742