llvm-svn: 19981

llvm-svn: 19980

llvm-svn: 19979

a tasty speedup.

llvm-svn: 19978

llvm-svn: 19977

llvm-svn: 19976

llvm-svn: 19975

llvm-svn: 19974

llvm-svn: 19973

llvm-svn: 19972

llvm-svn: 19971

different names.  Large SCC's tend to be big, so this saves a lot of time.

llvm-svn: 19970

llvm-svn: 19969

llvm-svn: 19968

llvm-svn: 19967

llvm-svn: 19966

llvm-svn: 19965

llvm-svn: 19964

llvm-svn: 19963

llvm-svn: 19962

llvm-svn: 19961

llvm-svn: 19960

llvm-svn: 19959

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