entered via fall-through. Don't miss fallthroughs from blocks
terminated by conditional branches. Also, move
isOnlyReachableByFallthrough out of line.

llvm-svn: 68129

Patch by Jay Foad.

llvm-svn: 68120

llvm::sys::getOS{Name,Version}.

Right now the implementation just derives from LLVM_HOSTTRIPLE (which
is wrong, but it doesn't look like we have a define for the target
triple). Ideally this routine would actually be able to compute the
triple for targets we care about.

llvm-svn: 68118

llvm-svn: 68113

llvm-svn: 68109

llvm-svn: 68100

llvm-svn: 68099

Remove the "fast" cases for spill and restore point determination, as these were subtlely wrong in obscure cases.  Patch the testcase
to account for this change.

llvm-svn: 68093

llvm-svn: 68092

instructions. This fixes lua.

llvm-svn: 68083

X86 address mode isel tweak. If the base of the address is also used by a CopyToReg (i.e. it's likely live-out), do not fold the sub-expressions into the addressing mode to avoid computing the address twice. The CopyToReg use will be isel'ed to a LEA, re-use it for address instead.

This is not yet enabled.

llvm-svn: 68082

only reachable via fall-through edges. This dramatically reduces the
number of labels printed, and thus also the number of labels the
assembler must parse and remember.

llvm-svn: 68073

Loop Index Split can eliminate a loop if it can determin if loop body is executed only once. There was a bug in determining IV based value of the iteration for which the loop body is executed. Fix it.

llvm-svn: 68071

When optimzing a mul by immediate into two, the resulting mul's should get a x86 specific node to avoid dag combiner from hacking on them further.

llvm-svn: 68066

Turn a 2-address instruction into a 3-address one when it's profitable even if the two-address operand is killed.
e.g.
%reg1024<def> = MOV r1
%reg1025<def> = ADD %reg1024, %reg1026
r0            = MOV %reg1025

If it's not possible / profitable to commute ADD, then turning ADD into a LEA saves a copy.

llvm-svn: 68065

llvm-svn: 68059

llvm-svn: 68057

llvm-svn: 68054

llvm-svn: 68050

Walking an invalidated iterator is not a good idea.

llvm-svn: 68047

llvm-svn: 68036

llvm-svn: 68034

llvm-svn: 68033

Do not propagate ELF-specific stuff (data.rel) into other targets. This simplifies code and also ensures correctness.

llvm-svn: 68032

llvm-svn: 68031

llvm-svn: 68007

llvm-svn: 68006

llvm-svn: 68005

Extend the relocation tracker handler, so we can filter on different 'kinds' of relocations required.

llvm-svn: 68004

when using -soft-float.
Based on a patch by Jakob Stoklund Olesen.

llvm-svn: 67996

hackish workarounds from memdep

llvm-svn: 67971

llvm-svn: 67953

llvm-svn: 67950

llvm-svn: 67949

of operands in an address in so many places.

llvm-svn: 67945

a CALL and a RET node more generic. Add a test for tail calls with a void
return.

llvm-svn: 67943

Enable tail call optimization for functions that return a struct (bug 3664) and for functions that return types that need extending (e.g i1).

llvm-svn: 67934

Optimize some 64-bit multiplication by constants into two lea's or one lea + shl since imulq is slow (latency 5). e.g.
x * 40
=>
shlq    $3, %rdi
leaq    (%rdi,%rdi,4), %rax

This has the added benefit of allowing more multiply to be folded into addressing mode. e.g.
a * 24 + b
=>
leaq    (%rdi,%rdi,2), %rax
leaq    (%rsi,%rax,8), %rax

llvm-svn: 67917

llvm-svn: 67892

llvm-svn: 67881