had its address taken.

llvm-svn: 111058

This fixes another part of PR7792.

llvm-svn: 111057

The earliestStart argument is entirely specific to linear scan allocation, and
can be easily calculated by RegAllocLinearScan.

Replace std::vector with SmallVector.

llvm-svn: 111055

llvm-svn: 111050

instruction opcode.  This fixes part of PR7792.

llvm-svn: 111047

when they are the same loop. Don't compare two instructions'
loop depths when they are in the same block.

llvm-svn: 111045

When a live range is contained a single block, we can split it around
instruction clusters. The current approach is very primitive, splitting before
and after the largest gap between uses.

llvm-svn: 111043

ScalarEvolution::getAddExpr, which can be pretty expensive, when nothing
has changed, which is pretty common.

llvm-svn: 111042

llvm-svn: 111041

rather than testing whether the loop contains the other's header.

llvm-svn: 111039

llvm-svn: 111038

the constant operand on the left, as that's where ScalarEvolution
will end up canonicalizing to.

llvm-svn: 111037

associated loop. This avoids potentially expensive traversals
of the add recurrence's operands.

llvm-svn: 111034

same lines as the change I made for ARM saturate instructions.

llvm-svn: 111029

misanalysis and is undesirable.

llvm-svn: 111028

llvm-svn: 111022

llvm-svn: 111021

llvm-svn: 111019

llvm-svn: 111001

llvm-svn: 111000

numbers match. The old check could accidentally leave holes in openli.

Also let useIntv add all ranges for the phi-def value inserted by
enterIntvAtEnd. This works as long at the value mapping is established in
enterIntvAtEnd.

llvm-svn: 110995

function to do it.

llvm-svn: 110994

llvm-svn: 110987

Move some code from Verifier into SVI::isValidOperands.  This allows us to catch bad shufflevector operations when they are created, rather than waiting for someone to notice later on.

llvm-svn: 110986

llvm-svn: 110983

llvm-svn: 110982

llvm-svn: 110981

This can happen if the original interval has been broken into two disconnected
parts. Ideally, we should be able to detect when the graph is disconnected and
create separate intervals, but that code is not implemented yet.

Example:

Two basic blocks are both branching to a loop header. Our interval is defined in
both basic blocks, and live into the loop along both edges.

We decide to split the interval around the loop. The interval is split into an
inside part and an outside part. The outside part now has two disconnected
segments, one in each basic block.

If we later decide to split the outside interval into single blocks, we get one
interval per basic block and an empty dupli for the remainder.

llvm-svn: 110976

split intervals. THis means the analysis can be used for multiple splits as long
as curli doesn't shrink.

llvm-svn: 110975

before it rewrites the code, we need to use that in the post-rewrite pass.

llvm-svn: 110962

llvm-svn: 110954

the memory barrier variants (other than 'SY' full system domain read and write)
are treated as one instruction with option operand.

llvm-svn: 110951

If a phi-def value were removed from the interval, the phi-kill flags are no
longer valid.

llvm-svn: 110949

Make sure ARM constant island pass does not break up an IT block. If the split point is in the middle of an IT block, it should move it up to just above the IT instruction. rdar://8302637

llvm-svn: 110947

- Teach SSEDomainFix to switch between different levels of AVX instructions. Here we guess that AVX will have domain issues, so just implement them for consistency  and in the future we remove if it's unnecessary.
- Make foldMemoryOperandImpl aware of 256-bit zero vectors folding and support the 128-bit counterparts of AVX too.
- Make sure MOV[AU]PS instructions are only selected when SSE1 is enabled, and duplicate the patterns to match AVX.
- Add a testcase for a simple 128-bit zero vector creation.

llvm-svn: 110946

llvm-svn: 110944

llvm-svn: 110940

llvm-svn: 110937

Before spilling a live range, we split it into a separate range for each basic
block where it is used. That way we only get one reload per basic block if the
new smaller ranges can allocate to a register.

This type of splitting is already present in the standard spiller.

llvm-svn: 110934

having it finish processing all of the muliply operands before
starting the whole getAddExpr process over again, instead of
immediately after the first simplification.

llvm-svn: 110916