member's size. It is based on the oddness/evenness of the file pointer.
This fixes a bug with llvm-ar not being able to read archives produced by
llvm-ranlib when there are members with odd long file name lengths.

llvm-svn: 17997

Morten Ofstad.

llvm-svn: 17996

files.  Patch contributed by Morten Ofstad!

llvm-svn: 17995

llvm-svn: 17992

llvm-svn: 17991

llvm-svn: 17990

NOT have the bzlib.h header file. Go figure.

llvm-svn: 17989

llvm-svn: 17988

coalesce out of hbd.  Speeds up compilation by 2% (0.6s)

llvm-svn: 17987

llvm-svn: 17985

llvm-svn: 17981

llvm-svn: 17979

llvm-svn: 17977

eliminate symbols defined by the archive efficiently

llvm-svn: 17976

symbols it has already identified as not defining.

llvm-svn: 17975

This eliminates over 2000 in hbd alone.

llvm-svn: 17973

llvm-svn: 17970

llvm-svn: 17961

llvm-svn: 17959

llvm-svn: 17958

llvm-svn: 17956

visitCallInst works.  Support cast of byte/short/int to long.

llvm-svn: 17949

SingleSource. Update to-do list (open-coding refers to binary operations on
longs, not to passing them into functions, which we already support.)

llvm-svn: 17948

shouldn't be forced to coalesce for us: folded GEP operations.  This too
fires thousands of times across the testsuite.

llvm-svn: 17947

directly rather than making a copy for the register allocator to coalesce.
This kills thousands of live intervals across the testsuite.

llvm-svn: 17946

* Do not put fixed registers into the unhandled set.  This means they will
  never find their way into the inactive, active, or handled sets, so we
  can simplify a bunch of code.

llvm-svn: 17945

incrementing i.

llvm-svn: 17944

i->start == j->start, then certainly i->end > j->start.

llvm-svn: 17943

and properly emitting signed short to unsigned int.  This fixes the last
regression vs. the CBE, MultiSource/Applications/hbd.

llvm-svn: 17942

library (shared library/shared object) whose symbols can be looked up
dynamically. Used for plug-ins.

llvm-svn: 17940

intersecting an interval.

llvm-svn: 17939

llvm-svn: 17938

search physreg intervals every time we access it.  This takes another
half second off of linscan.

llvm-svn: 17937

llvm-svn: 17936

the iterator hints we have to speed up overlaps().  This speeds linscan up
by about .2s (out of 8.7) on 175.vpr for PPC.

llvm-svn: 17935

llvm-svn: 17934

* Eliminate the releaseMemory method, this is not an analysis
* Change the fixed, active, and inactive lists of intervals to maintain an
  iterator for the current position in the interval.  This allows us to do
  constant time increments of the iterator instead of having to do a binary
  search to find our liverange in our liveinterval all of the time, which
  substantially speeds up cases where LiveIntervals have many LiveRanges
  - which is very common for physical registers.  On targets with many
  physregs, this can make a noticable difference.

  With a release build of LLC for PPC, this halves the time in
  processInactiveIntervals and processActiveIntervals, from 1.5s to .75s.

  This also lays the ground for more to come.

llvm-svn: 17933

llvm-svn: 17932

llvm-svn: 17931

iterator/begin/end members.

llvm-svn: 17930