llvm-svn: 4017

llvm-svn: 4016

llvm-svn: 4014

No longer include malloc.h.  If protoypes are needed for memory functions they will be present in the byte code and the generated c as well.

llvm-svn: 4013

    * Implement fully general merging of array subscripts on demand!  This
      does not handle the initial pointer index case yet though.

llvm-svn: 4012

debugging of merging process.

llvm-svn: 4010

* Now all and any bytes of a DSNode can be merged together individually.  This
  is neccesary to support the full generality of C and support aliasing
  correctly.

llvm-svn: 4008

    * Renamed StatisticReporter.h/cpp to Statistic.h/cpp
    * Broke constructor to take two const char * arguments instead of one, so
      that indendation can be taken care of automatically.
    * Sort the list by pass name when printing
    * Make sure to print all statistics as a group, instead of randomly when
      the statistics dtors are called.
    * Updated ProgrammersManual with new semantics.

llvm-svn: 4004

    * Renamed StatisticReporter.h/cpp to Statistic.h/cpp
    * Broke constructor to take two const char * arguments instead of one, so
      that indendation can be taken care of automatically.
    * Sort the list by pass name when printing
    * Make sure to print all statistics as a group, instead of randomly when
      the statistics dtors are called.
    * Updated ProgrammersManual with new semantics.

llvm-svn: 4002

    * Renamed StatisticReporter.h/cpp to Statistic.h/cpp
    * Broke constructor to take two const char * arguments instead of one, so
      that indendation can be taken care of automatically.
    * Sort the list by pass name when printing
    * Make sure to print all statistics as a group, instead of randomly when
      the statistics dtors are called.
    * Updated ProgrammersManual with new semantics.

llvm-svn: 4001

llvm-svn: 4000

    * Renamed StatisticReporter.h/cpp to Statistic.h/cpp
    * Broke constructor to take two const char * arguments instead of one, so
      that indendation can be taken care of automatically.
    * Sort the list by pass name when printing
    * Make sure to print all statistics as a group, instead of randomly when
      the statistics dtors are called.

llvm-svn: 3999

alias analysis

llvm-svn: 3997

nor does it work very well, but I need to get it checked in before I break
the tree unintentionally.

llvm-svn: 3996

llvm-svn: 3995

llvm-svn: 3994

exposed by Support/Timer.h.

llvm-svn: 3993

llvm-svn: 3992

llvm-svn: 3991

llvm-svn: 3985

a predecessor if it has a non-zero first index and the predecessor
ends with a struct index.

llvm-svn: 3982

llvm-svn: 3981

llvm-svn: 3980

rather than in random order.  This causes LICM to be DRAMATICALLY more
effective. For example, on bzip2.c, it is able to hoist 302 loads and
2380 total instructions, as opposed to 44/338 before.  This  obviously
makes other transformations much more powerful as well!

llvm-svn: 3978

llvm-svn: 3977

llvm-svn: 3976

llvm-svn: 3975

llvm-svn: 3972

llvm-svn: 3970

created here, simply by handling all implicit operands (which should
have been done anyway).

llvm-svn: 3969

callee does not return a value.

llvm-svn: 3968

handled like normal operands, not like other call arguments.

llvm-svn: 3967

since it is defined by the instruction.

llvm-svn: 3966

created here.  Instead they are created in LiveRangeInfo.cpp.  This
simplifies the code here quite a bit.

llvm-svn: 3965

needs the RegClass list to be passed in.

llvm-svn: 3964

llvm-svn: 3963

Don't allow direct FP-to-uint conversion (must be eliminated by preselection).
Address arithmetic for arrays is now entirely 64-bit so no sign-ext needed.

llvm-svn: 3961

llvm-svn: 3960

llvm-svn: 3959

llvm-svn: 3958