multiplicity.

llvm-svn: 117630

llvm-svn: 117629

llvm-svn: 117615

llvm-svn: 117602

in SSAUpdaterImpl.h

Verifying live intervals revealed that the old method was completely wrong, and
we need an iterative approach to calculating PHI placemant. Fortunately, we have
MachineDominators available, so we don't have to compute that over and over
like SSAUpdaterImpl.h must.

Live-out values are cached between calls to mapValue() and computed in a greedy
way, so most calls will be working with very small block sets.

Thanks to Bob for explaining how this should work.

llvm-svn: 117599

proper SSA updating.

This doesn't cause MachineDominators to be recomputed since we are already
requiring MachineLoopInfo which uses dominators as well.

llvm-svn: 117598

split.

llvm-svn: 117597

llvm-svn: 117588

llvm-svn: 117563

Also do some minor refactoring to reduce indentation.

llvm-svn: 117558

llvm-svn: 117531

llvm-svn: 117520

by the number of defs first for it to match the instruction itinerary.

llvm-svn: 117518

Putting r117193 back except for the compile time cost. Rather than assuming fallthroughs uses all registers, just gather the union of all successor liveins.

llvm-svn: 117506

There are currently 100 references to COFF::IMAGE_SCN in 6 files
and 11 different functions. Section to attribute mapping really
needs to happen in one place to avoid problems like this.

llvm-svn: 117473

llvm-svn: 117472

llvm-svn: 117453

live out.

This doesn't prevent us from inserting a loop preheader later on, if that is
better.

llvm-svn: 117424

Critical edges going into a loop are not as bad as critical exits. We can handle
them by splitting the critical edge, or by having both inside and outside
registers live out of the predecessor.

llvm-svn: 117423

Only virtuals should be requires to be connected.

llvm-svn: 117422

memory, so a MachineMemOperand is useful (not propagated
into the MachineInstr yet).  No functional change except
for dump output.

llvm-svn: 117413

them, but hopefully we won't. And this is not the right data structure
to do it anyway.

llvm-svn: 117412

the remainder register.

Example:

bb0:
  x = 1
bb1:
  use(x)
  ...
  x = 2
  jump bb1

When x is isolated in bb1, the inner part breaks into two components, x1 and x2:

bb0:
  x0 = 1
bb1:
  x1 = x0
  use(x1)
  ...
  x2 = 2
  x0 = x2
  jump bb1

llvm-svn: 117408

components, each should get its own virtual register.

llvm-svn: 117407

necessary to get correct hasPHIKill flags.

llvm-svn: 117406

llvm-svn: 117405

llvm-svn: 117404

SlotIndexes when available.

llvm-svn: 117392

llvm-svn: 117391

llvm-svn: 117384

s/endScope/endInstruction/g

llvm-svn: 117376

Magic is happening that we don't understand.

llvm-svn: 117370

llvm-svn: 117348

declarations in !NDEBUG to avoid -Wunused-variable warnings. Patch by
Matt Beaumont-Gay!

llvm-svn: 117345

llvm-svn: 117338

llvm-svn: 117337

do not double-count the duplicate instructions by counting once from the
beginning and again from the end.  Keep track of where the duplicates from
the beginning ended and don't go past that point when counting duplicates
at the end.  Radar 8589805.

This change causes one of the MC/ARM/simple-fp-encoding tests to produce
different (better!) code without the vmovne instruction being tested.
I changed the test to produce vmovne and vmoveq instructions but moving
between register files in the opposite direction.  That's not quite the same
but predicated versions of those instructions weren't being tested before,
so at least the test coverage is not any worse, just different.

llvm-svn: 117333

instructions separately from the count of non-predicated instructions.  The
instruction count is used in places to determine how many instructions to
copy, predicate, etc. and things get confused if that count includes the
extra cost for microcoded ops.

llvm-svn: 117332

llvm-svn: 117329

Do not count use of sdisel for single call instruction.

llvm-svn: 117316