llvm-svn: 119058

looking for lib/Target/*AsmPrinter.cpp.  Fix llvm-config to handle targets
that don't have an explicit AsmPrinter library.

llvm-svn: 119057

that should be split out is the InstPrinter (if a target is mc'ized).
This change makes all the targets be consistent.

llvm-svn: 119056

it to get better phi node simplification.

llvm-svn: 119055

llvm-svn: 119054

llvm-svn: 119053

llvm-svn: 119052

and the Alpha backend isn't MCized yet.  Approved by Andrew.

llvm-svn: 119051

llvm-svn: 119050

llvm-svn: 119049

offload the work to hasConstantValue rather than do something more
complicated (such handling mutually recursive phis) because (1) it is
not clear it is worth it; and (2) if it is worth it, maybe such logic
would be better placed in hasConstantValue.  Adjust some GVN tests
which are now cleaned up much further (eg: all phi nodes are removed).

llvm-svn: 119043

operands are the phi node itself or undef, then return undef.
This logic already existed at a higher level so in practice it
shouldn't make the slightest difference.  Note that this code
could be replaced by a call to PN->hasConstantValue().  However
since we bail out the moment we see a non-constant operand, it
is more efficient to have a specialized version of that logic.

llvm-svn: 119041

llvm-svn: 119040

llvm-svn: 119038

llvm-svn: 119033

llvm-svn: 119032

llvm-svn: 119031

llvm-svn: 119029

signature symbol causes a local symbol to be created unless there is
some other use of the symbol.

llvm-svn: 119026

It can pass two tests below on Win32.
  - Clang :: CodeGenCXX/dyncast.cpp
  - LLVM :: CodeGen/ARM/globals.ll

llvm-svn: 119023

the symbols.

llvm-svn: 119022

llvm-svn: 119021

as it goes").  Before -std-compile-opts only got it down to
  %a = tail call i32 @foo(i32 0) readnone
  %x = tail call i32 @foo(i32 %a) readnone
  %y = tail call i32 @foo(i32 %a) readnone
  %z = icmp eq i32 %x, %y
  ret i1 %z
while now -basicaa -gvn alone reduce it to
  %a = call i32 @foo(i32 0) readnone
  %x = call i32 @foo(i32 %a) readnone
  ret i1 true

llvm-svn: 119009

llvm-svn: 119007

llvm-svn: 119006

SimplifyAssociativeOrCommutative) "(A op C1) op C2" -> "A op (C1 op C2)",
which previously was only done if C1 and C2 were constants, to occur whenever
"C1 op C2" simplifies (a la InstructionSimplify).  Since the simplifying operand
combination can no longer be assumed to be the right-hand terms, consider all of
the possible permutations.  When compiling "gcc as one big file", transform 2
(i.e. using right-hand operands) fires about 4000 times but it has to be said
that most of the time the simplifying operands are both constants.  Transforms
3, 4 and 5 each fired once.  Transform 6, which is an existing transform that
I didn't change, never fired.  With this change, the testcase is now optimized
perfectly with one run of instcombine (previously it required instcombine +
reassociate + instcombine, and it may just have been luck that this worked).

llvm-svn: 119002

llvm-svn: 119001

llvm-svn: 119000

llvm-svn: 118999

llvm-svn: 118998

- Get the opcode once.
- Add a ParserMatchClass to reglist.

llvm-svn: 118997

future to separate out the ia, ib, da, db variants of the load/store multiple
instructions.

llvm-svn: 118995

 - What was I thinking?????

llvm-svn: 118992

llvm-svn: 118987

llvm-svn: 118985

llvm-svn: 118981

llvm-svn: 118980

llvm-svn: 118978

darwin and, judging from the buildbots, Linux.
Removing it for now, but this is not the right fix,
Wesley please look at it.

llvm-svn: 118977

another patch.
This lets us parse a bit more of the gcc 4.5 output.

llvm-svn: 118975