llvm-svn: 54425

llvm-svn: 54422

llvm-svn: 54421

llvm-svn: 54420

llvm-svn: 54378

llvm-svn: 54375

llvm-svn: 54374

llvm-svn: 54371

llvm-svn: 54369

llvm-svn: 54361

llvm-svn: 54349

llvm-svn: 54347

Fix PR2568: Fix bug that cause redudant kill marker after its live interval has been extended due to coalescing.

llvm-svn: 54346

llvm-svn: 54337

llvm-svn: 54336

- Add a basic machine-level dead block eliminator.

These two have to go together, since many other parts of the code generator are unable to handle the unreachable blocks otherwise created.

llvm-svn: 54333

This allows it to work correctly on aggregate values.
This fixes PR2623.

llvm-svn: 54331

This allows it to work correctly on nested aggregate values.
This fixes PR2625.

llvm-svn: 54330

switches use the binary search algorithm) for
environments that don't support it.  PPC64 JIT
is such an environment; turn the flag on for that.

llvm-svn: 54248

llvm-svn: 54239

it isn't always visible to gdb.

llvm-svn: 54228

empty structs. This fixes PR2612.

llvm-svn: 54226

Use existing LiveInterval methods to simplify live interval merging.  Thanks to Evan for pointing these out.

llvm-svn: 54225

llvm-svn: 54218

llvm-svn: 54186

When merging live intervals, we also need to merge in any live ranges that are inputs to two-address instructions
that themselves define a range we already care about.

llvm-svn: 54185

When merging a PHI operand's live interval into the PHI's live interval, we need to merge over all liveranges in
the operand's interval that share the relevant value number, not just the range that immediately precedes the PHI.

llvm-svn: 54174

llvm-svn: 54173

to be marked invalid regardless of whether it is
a debug, an exception handling or (hopefully) a
GC label.

llvm-svn: 54172

llvm-svn: 54168

The CellSPU codegen is broken, but needs to be fixed before we can
put this back in.

llvm-svn: 54164

CodeGen & Clang work coming next.

llvm-svn: 54161

a new ilist_node class, and remove them. Unlike alist_node,
ilist_node doesn't attempt to manage storage itself, so it avoids
the associated problems, including being opaque in gdb.

Adjust the Recycler class so that it doesn't depend on alist_node.
Also, change it to use explicit Size and Align parameters, allowing
it to work when the largest-sized node doesn't have the greatest
alignment requirement.

Change MachineInstr's MachineMemOperand list from a pool-backed
alist to a std::list for now.

llvm-svn: 54146

llvm-svn: 54136

the SelectionDAG's.

llvm-svn: 54129

llvm-svn: 54128

parallel its analogue, Value::value_use_iterator. The operator* method
now returns the user, rather than the use.

llvm-svn: 54127

llvm-svn: 54124

unary operations!  Add support for softening
some additional unary operations like fp_to_sint.

llvm-svn: 54122

Fix the issues originally addressed in r54070.  After thinking about it some more, I realized that the right thing to do
is to have StrongPHIElimination use its knowledge of the PHIs before they're erased to update the intervals appropriate.  This is
both simpler and more accurate than the alternative, which was having LIA figure it out when it renumbered things, plus it's just
the right thing to do!

llvm-svn: 54077