llvm-svn: 117268

llvm-svn: 117266

from stores when folding in bitcasts.

llvm-svn: 117265

instruction at the beginning of each function that has the attribute, allowing
the function to be easily hooked and/or patched.

llvm-svn: 117264

Rather than rename this instance, use the cast-to-void idiom
instead.  This will hopefully fix the windows buildbots.

llvm-svn: 117262

we check for _GLOBAL_OFFSET_TABLE_.

llvm-svn: 117241

it isn't unreachable and should not be zapped.  The check for the entry block
was missing in one case: a block containing a unwind instruction.  While there,
do some small cleanups: "M" is not a great name for a Function* (it would be
more appropriate for a Module*), change it to "Fn"; use Fn in more places.

llvm-svn: 117224

llvm-svn: 117213

note that we can actually handle some f64 arguments.

llvm-svn: 117209

llvm-svn: 117206

llvm-svn: 117205

name and prefixed with 'LLVM_'.

llvm-svn: 117203

llvm-svn: 117202

until other LLVM projects using these are cleaned up.

llvm-svn: 117200

was found by a GCC warning. ;]

llvm-svn: 117199

llvm-svn: 117194

2) live-outs.

Previously the post-RA schedulers completely ignore these dependencies since
returns, branches, etc. are all scheduling barriers. This patch model the
latencies between instructions being scheduled and the barriers. It also
handle calls by marking their register uses.

llvm-svn: 117193

llvm-svn: 117192

of all predecessors.

llvm-svn: 117191

llvm-svn: 117188

llvm-svn: 117180

llvm-svn: 117176

framework. It's purpose is not to improve register allocation per se,
but to make it easier to develop powerful live range splitting. I call
it the basic allocator because it is as simple as a global allocator
can be but provides the building blocks for sophisticated register
allocation with live range splitting. 

A minimal implementation is provided that trivially spills whenever it
runs out of registers. I'm checking in now to get high-level design
and style feedback. I've only done minimal testing. The next step is
implementing a "greedy" allocation algorithm that does some register
reassignment and makes better splitting decisions.

llvm-svn: 117174

llvm-svn: 117170

When a block has exactly two uses and the register is both live-in and live-out,
don't isolate the block. We would be inserting two copies, so we haven't really
made any progress.

If the live-in and live-out values separate into disconnected components after
splitting, we would be making progress. We can't detect that for now.

llvm-svn: 117169

llvm-svn: 117165

llvm-svn: 117155

llvm-svn: 117154

llvm-svn: 117151

An exit block with a critical edge must only have predecessors in the loop, or
just before the loop. This guarantees that the inserted copies in the loop
predecessors dominate the exit block.

llvm-svn: 117144

llvm-svn: 117143

llvm-svn: 117134

llvm-svn: 117133

llvm-svn: 117131

llvm-svn: 117128

llvm-svn: 117126

llvm-svn: 117121

llvm-svn: 117119

definitions.

llvm-svn: 117114

llvm-svn: 117111