llvm-svn: 19958

llvm-svn: 19957

This list does not provide the ability to go backwards in the list (its
more of an unordered collection, stored in the shape of a list).

This change means that use iterators are now only forward iterators, not
bidirectional.

This improves the memory usage of use lists from '5 + 4*#use' per value to
'1 + 4*#use'.  While it would be better to reduce the multiplied factor,
I'm not smart enough to do so.  This list also has slightly more efficient
operators for manipulating list nodes (a few less loads/stores), due to not
needing to be able to iterate backwards through the list.

This change reduces the memory footprint required to hold 176.gcc from
66.025M -> 57.687M, a 14% reduction.  It also speeds up the compiler,
7.73% in the case of bytecode loading alone (release build loading 176.gcc).

llvm-svn: 19956

llvm-svn: 19955

llvm-svn: 19954

in spec

llvm-svn: 19953

llvm-svn: 19952

llvm-svn: 19951

llvm-svn: 19950

llvm-svn: 19949

No change to the tests themselves.

llvm-svn: 19948

11 indirect calls in perlbmk.

llvm-svn: 19947

llvm-svn: 19946

llvm-svn: 19945

llvm-svn: 19944

LLVM make the very reasonable assumption that constant expressions will
have at least one operand! :)

llvm-svn: 19943

llvm-svn: 19942

llvm-svn: 19941

llvm-svn: 19940

* Change the FunctionCalls and AuxFunctionCalls vectors into std::lists.
  This makes many operations on these lists much more natural, and avoids
  *exteremely* expensive copying of DSCallSites (e.g. moving nodes around
  between lists, erasing a node from not the end of the vector, etc).

With a profile build of analyze, this speeds up BU DS from 25.14s to
12.59s on 176.gcc.  I expect that it would help TD even more, but I don't
have data for it.

This effectively eliminates removeIdenticalCalls and children from the
profile, going from 6.53 to 0.27s.

llvm-svn: 19939

added fp extend and removed a forgotten assert in more than 6 arg support (should break somewhere else now :) ) and fix an incorrect asm sequence for indirect calls

llvm-svn: 19938

llvm-svn: 19937

llvm-svn: 19934

llvm-svn: 19933

llvm-svn: 19932

llvm-svn: 19931

llvm-svn: 19930

the same.

llvm-svn: 19929

llvm-svn: 19928

llvm-svn: 19926

Based on the ilist changes avoid allocating an entire Use object for the
end of the Use chain.  This saves 8 bytes of memory for each Value allocated
in the program.  For 176.gcc, this reduces us from 69.5M -> 66.0M, a 5.3%
memory savings.

llvm-svn: 19925

llvm-svn: 19924

llvm-svn: 19923

llvm-svn: 19922

Add a new method, destroySentinal, that is used to delete it (instead of
requiring use of delete.

llvm-svn: 19921

llvm-svn: 19920

llvm-svn: 19919

cases it represented them as 'unsigned's, which are not enough for 64-bit
hosts.  In other cases, it represented them as uint64_t's, which are
inefficient for 32-bit hosts.

This patch unifies all of the sizes to use size_t instead.

llvm-svn: 19918

This file was schizophrenic when it came to representing sizes.  In some
cases it represented them as 'unsigneds', which are not enough for 64-bit
hosts.  In other cases, it represented them as uint64_t's, which are
inefficient for 32-bit hosts.

This patch unifies all of the sizes to use size_t instead.

llvm-svn: 19917

really need.  This reduces 4M of memory consumption reading 176.gcc.

llvm-svn: 19916