gcc 4.4 (due to use of sprintf).

llvm-svn: 60209

being both a namespace and a variable name.

llvm-svn: 60208

formulation that doesn't require set lookups or scanning a set.

llvm-svn: 60203

nothing to do with dead instruction elimination.  No tests in
dejagnu depend on this, so I don't know what it was needed for.

llvm-svn: 60202

elimination to use more modern infrastructure.  Also do a bunch
of small cleanups.

llvm-svn: 60201

RecursivelyDeleteTriviallyDeadInstructions.

llvm-svn: 60196

making it use RecursivelyDeleteTriviallyDeadInstructions to do
the heavy lifting.

llvm-svn: 60195

PHIs dead if they are single-value.

llvm-svn: 60194

return a list of deleted instructions.

llvm-svn: 60193

llvm-svn: 60192

wrappers around the interesting code and use an obscure iterator
abstraction that dates back many many years.

Move EraseDeadInstructions to Transforms/Utils and name it
RecursivelyDeleteTriviallyDeadInstructions.

llvm-svn: 60191

llvm-svn: 60190

llvm-svn: 60189

llvm-svn: 60188

llvm-svn: 60187

llvm-svn: 60186

by 1, as well as multiply by -1.

llvm-svn: 60182

it ends up being the entry block.

llvm-svn: 60180

move the other block back up into the entry position!

llvm-svn: 60179

Despite changing the order of evaluation, this doesn't actually change the
meaning of the statement.

llvm-svn: 60177

llvm-svn: 60175

llvm-svn: 60174

FindAvailableLoadedValue

llvm-svn: 60169

llvm-svn: 60168

if it has it.

llvm-svn: 60167

llvm-svn: 60166

inlined" message.

llvm-svn: 60165

llvm-svn: 60164

llvm-svn: 60163

llvm-svn: 60162

just simple threading.

llvm-svn: 60157

llvm-svn: 60156

llvm-svn: 60149

1. Make it fold blocks separated by an unconditional branch.  This enables
   jump threading to see a broader scope.
2. Make jump threading able to eliminate locally redundant loads when they
   feed the branch condition of a block.  This frequently occurs due to
   reg2mem running.
3. Make jump threading able to eliminate *partially redundant* loads when
   they feed the branch condition of a block.  This is common in code with
   lots of loads and stores like C++ code and 255.vortex.

This implements thread-loads.ll and rdar://6402033.

Per the fixme's, several pieces of this should be moved into Transforms/Utils.

llvm-svn: 60148

llvm-svn: 60145

llvm-svn: 60141

On x86 favors folding short immediate into some arithmetic operations (e.g. add, and, xor, etc.) because materializing an immediate in a register is expensive in turns of code size.
e.g.
movl 4(%esp), %eax
addl $4, %eax

is 2 bytes shorter than

movl $4, %eax
addl 4(%esp), %eax

llvm-svn: 60139

llvm-svn: 60137

the conditional for the BRCOND statement. For instance, it will generate:

    addl %eax, %ecx
    jo LOF

instead of

    addl %eax, %ecx
    ; About 10 instructions to compare the signs of LHS, RHS, and sum.
    jl LOF

llvm-svn: 60123

performance in most cases on the Grawp tester, but does speed some 
things up (like shootout/hash by 15%).  This also doesn't impact 
compile time in a noticable way on the Grawp tester.

It also, of course, gets the testcase it was designed for right :)

llvm-svn: 60120