llvm-svn: 5450

llvm-svn: 5431

llvm-svn: 5425

llvm-svn: 5420

* T-D pass now eliminates unreachable globals

llvm-svn: 5419

llvm-svn: 5418

llvm-svn: 5401

llvm-svn: 5284

llvm-svn: 5282

llvm-svn: 5270

Also added Statistic counters for NoAlias and MayAlias.

llvm-svn: 4972

llvm-svn: 4968

i.e., enumerates all data and control dependences for the function.

llvm-svn: 4958

computes a dependence graph for data dependences on memory locations
using interprocedural Mod/Ref information.

llvm-svn: 4957

llvm-svn: 4954

(1) Make entries for Constant values in the ScalarMap.
(2) Set MOD bit for the node pointed to by the
    argument of a free instruction.

llvm-svn: 4948

fact that the incoming nodes may be merged away at intermediate
steps.  Use an extra level of indirection via DSNodeHandles
to track the nodes being merged.  All this now happens in a
static helper function MergeNodes().

llvm-svn: 4947

been missed if node *this got merged away due to recursive merging!
Also, links were not moved correctly if a node is collapsed.

llvm-svn: 4933

llvm-svn: 4886

before inlining their graphs into a function.  To support this,
added flags to CloneFlags to strip/keep Mod/Ref bits.

llvm-svn: 4836

    We run removeDeadNodes() on the TD graph up front before using it.
(2) Major enhancement to printing of results: now we list the actual objects
    that are mod/ref instead of just printing the bit vectors.
Also an important bug fix in TDDataStructures pass (no change here):
clear Mod/Ref bits of callers before inlining into a function.

llvm-svn: 4833

llvm-svn: 4831

Add structure padding optimizations

llvm-svn: 4749

llvm-svn: 4748

llvm-svn: 4747

their source function

llvm-svn: 4723

llvm-svn: 4722

S: ----------------------------------------------------------------------

llvm-svn: 4721

llvm-svn: 4706

For now, this just computes the #indirect call sites and
the avg. #callees per indirect call site (actually it prints
both totals and the average is their ratio).

llvm-svn: 4705

llvm-svn: 4701

 * The globals vector was getting broken and unsorted, this caused vortex
   to get badly pessimized
 * Node offset handling was being handled really poorly, and in particular
   we were not merging types with offsets right.  This causes several graphs
   to be non-merged.

llvm-svn: 4699

llvm-svn: 4697

llvm-svn: 4696

llvm-svn: 4695

the algorithm instead of hand coded depth first iteration

llvm-svn: 4694

llvm-svn: 4690

death when handling moderately sized SCC's, but what can you do

llvm-svn: 4689

llvm-svn: 4688

llvm-svn: 4687