| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
|
|
|
| |
non-profitable commute using outdated info. The test case would still fail
because of poor pre-RA schedule. That will be fixed by MI scheduler.
rdar://11472010
llvm-svn: 157038
|
| |
|
|
| |
llvm-svn: 157033
|
| |
|
|
|
|
| |
this fixes the missed optimization I was seeing in the CorrelatedValuePropagation pass
llvm-svn: 157032
|
| |
|
|
| |
llvm-svn: 157024
|
| |
|
|
| |
llvm-svn: 157020
|
| |
|
|
|
|
|
|
|
|
| |
the 0b10 mask encoding bits. Make MSR APSR writes without a _<bits> qualifier
an alias for MSR APSR_nzcvq even though ARM as deprecated it use. Also add
support for suffixes (_nzcvq, _g, _nzcvqg) for APSR versions. Some FIXMEs in
the code for better error checking when versions shouldn't be used.
rdar://11457025
llvm-svn: 157019
|
| |
|
|
| |
llvm-svn: 157011
|
| |
|
|
| |
llvm-svn: 157007
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Introduce the basic strategy for register pressure scheduling.
1) Respect target limits at all times.
2) Indentify critical register classes (pressure sets).
Track pressure within the scheduled region.
Avoid increasing scheduled pressure for critical registers.
3) Avoid exceeding the max pressure of the region prior to scheduling.
Added logic for picking between the top and bottom ready Q's based on
regpressure heuristics.
Status: functional but needs to be asjusted to achieve good results.
llvm-svn: 157006
|
| |
|
|
| |
llvm-svn: 157005
|
| |
|
|
| |
llvm-svn: 157004
|
| |
|
|
| |
llvm-svn: 157003
|
| |
|
|
| |
llvm-svn: 157002
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
RegisterCoalescer set <undef> flags on all operands of copy instructions
that are scheduled to be removed. This is so they won't affect
shrinkToUses() by introducing false register reads.
Make sure those <undef> flags are never cleared, or shrinkToUses() could
cause live intervals to end at instructions about to be deleted.
This would be a lot simpler if RegisterCoalescer could just erase joined
copies immediately instead of keeping all the to-be-deleted instructions
around.
This fixes PR12862. Unfortunately, bugpoint can't create a sane test
case for this. Like many other coalescer problems, this failure depends
of a very fragile series of events.
<rdar://problem/11474428>
llvm-svn: 157001
|
| |
|
|
|
|
| |
Make sure useless (def-only) intervals also get verified.
llvm-svn: 157000
|
| |
|
|
|
|
| |
bugpoint-ing, it may turn into something else.
llvm-svn: 156998
|
| |
|
|
|
|
|
|
|
| |
into a
separate side table, using the handy SequenceToOffsetTable class. This encodes all
these weird things into another 256 bytes, allowing all intrinsics to be encoded this way.
llvm-svn: 156995
|
| |
|
|
|
|
| |
Patch by Meador Inge.
llvm-svn: 156989
|
| |
|
|
| |
llvm-svn: 156986
|
| |
|
|
|
|
| |
representation of Low and High from signed to unsigned. Since unsigned ints usually simpler, faster and allows to reduce some extra signed bit checks needed before <,>,<=,>= comparisons.
llvm-svn: 156985
|
| |
|
|
|
|
| |
for future expansion, no functionality change yet though.
llvm-svn: 156979
|
| |
|
|
|
|
|
| |
are only rejected because they can't be encoded into a 32-bit unit, not because
they contain an unencodable feature.
llvm-svn: 156978
|
| |
|
|
|
|
|
|
| |
other
intrinsics that use passed-in arguments.
llvm-svn: 156977
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
llc to recognize MIPS16 as a MIPS ASE extension. -mips16 will mean the
mips16 ASE for mips32 by default.
As part of fixing of adding this we discovered some small changes that
need to be made to MipsInstrInfo::storeRegToStackSLot and
MipsInstrInfo::loadRegFromStackSlot. We were using some "==" equality tests
where in fact we should have been using Mips::<regclas>.hasSubClassEQ instead,
per suggestion of Jakob Stoklund Olesen.
Patch by Reed Kotler.
llvm-svn: 156958
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
When widening an existing <def,reads-undef> operand to a super-register,
it may be necessary to clear the <undef> flag because the wider register
is now read-modify-write through the instruction.
Conversely, it may be necessary to add an <undef> flag when the
coalescer turns a full-register def into a sub-register def, but the
larger register wasn't live before the instruction.
This happens in test/CodeGen/ARM/coalesce-subregs.ll, but the test
is too small for the <undef> flags to affect the generated code.
llvm-svn: 156951
|
| |
|
|
|
|
|
|
| |
instead of DefaultJIMMemoryManager.
It's more flexible for MCJIT tasks, in addition it's provides a invalidation instruction cache for code sections which will be used before JIT code will be executed.
llvm-svn: 156933
|
| |
|
|
| |
llvm-svn: 156917
|
| |
|
|
| |
llvm-svn: 156909
|
| |
|
|
|
|
|
|
|
|
| |
blob of tblgen
generated code (for Intrinsic::getType) into a table. This handles common cases right now,
but I plan to extend it to handle all cases and merge in type verification logic as well
in follow-on patches.
llvm-svn: 156905
|
| |
|
|
|
|
| |
rdar://11451474
llvm-svn: 156896
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
It is now possible to coalesce weird skewed sub-register copies by
picking a super-register class larger than both original registers. The
included test case produces code like this:
vld2.32 {d16, d17, d18, d19}, [r0]!
vst2.32 {d18, d19, d20, d21}, [r0]
We still perform interference checking as if it were a normal full copy
join, so this is still quite conservative. In particular, the f1 and f2
functions in the included test case still have remaining copies because
of false interference.
llvm-svn: 156878
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
It is possible to coalesce two overlapping registers to a common
super-register that it larger than both of the original registers.
The important difference is that it may be necessary to rewrite DstReg
operands as well as SrcReg operands because the sub-register index has
changed.
This behavior is still disabled by CoalescerPair.
llvm-svn: 156869
|
| |
|
|
|
|
|
| |
This can happen when widening a virtual register to a super-register
class.
llvm-svn: 156867
|
| |
|
|
|
|
| |
There is no need to look at an always null SrcIdx.
llvm-svn: 156866
|
| |
|
|
|
|
|
|
| |
getZeroExtendExpr()
this gives a speedup of > 80 in a debug build in the test case of PR12825 (php_sha512_crypt_r)
llvm-svn: 156849
|
| |
|
|
|
|
|
|
|
|
| |
Now both SrcReg and DstReg can be sub-registers of the final coalesced
register.
CoalescerPair::setRegisters still rejects such copies because
RegisterCoalescer doesn't yet handle them.
llvm-svn: 156848
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
MachineScheduler.
This feature avoids creating edges in the scheduler's dependence graph
for non-aliasing memory operations according to whichever alias
analysis is available. It has been fully tested in Hexagon. Before
making this default, it needs to be extended to handle multiple
MachineMemOperands, compile time needs more evaluation, and
benchmarking on X86 and ARM is needed.
Patch by Sergei Larin!
llvm-svn: 156842
|
| |
|
|
|
|
|
|
| |
Add the MCRegisterInfo to the factories and constructors.
Patch by Tom Stellard <Tom.Stellard@amd.com>.
llvm-svn: 156828
|
| |
|
|
|
|
| |
getEffectiveSCEVType() twice
llvm-svn: 156823
|
| |
|
|
| |
llvm-svn: 156815
|
| |
|
|
| |
llvm-svn: 156808
|
| |
|
|
|
|
| |
CRSBuilder::optimize, so big part of Clusterify's code was reduced.
llvm-svn: 156804
|
| |
|
|
|
|
| |
resolved.
llvm-svn: 156801
|
| |
|
|
| |
llvm-svn: 156791
|
| |
|
|
|
|
|
|
|
|
| |
The purpose of this option is to silence error messages issued by machine
verifier passes and enable them to run to the end. If this option is not
provided, -verify-machineinstrs complains when it discovers there is a
non-terminator instruction (an instruction that is in a delay slot) after the
first terminator in a basic block.
llvm-svn: 156790
|
| |
|
|
| |
llvm-svn: 156787
|
| |
|
|
|
|
| |
Found by GCC's maybe-uninitialized.
llvm-svn: 156780
|
| |
|
|
|
|
| |
This should unbreak llvm-x86_64-linux.
llvm-svn: 156778
|
| |
|
|
|
|
|
| |
RAFast must add an <imp-def> operand when it is rewriting a sub-register
def that isn't a read-modify-write.
llvm-svn: 156777
|
| |
|
|
|
|
|
|
|
| |
so that it can be reused in MemCpyOptimizer. This analysis is needed to remove
an unnecessary memcpy when returning a struct into a local variable.
rdar://11341081
PR12686
llvm-svn: 156776
|