mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-16 11:30:51 +00:00
5a09690446
When choosing between constraints with multiple options,
like "ir", test to see if we can use the 'i' constraint and
go with that if possible. This produces more optimal ASM in
all cases (sparing a register and an instruction to load it),
and fixes inline asm like this:
void test () {
asm volatile (" %c0 %1 " : : "imr" (42), "imr"(14));
}
Previously we would dump "42" into a memory location (which
is ok for the 'm' constraint) which would cause a problem
because the 'c' modifier is not valid on memory operands.
Isn't it great how inline asm turns 'missed optimization'
into 'compile failed'??
Incidentally, this was the todo in
PowerPC/2007-04-24-InlineAsm-I-Modifier.ll
Please do NOT pull this into Tak.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@50315 91177308-0d34-0410-b5e6-96231b3b80d8
|
||
|---|---|---|
| .. | ||
| ADCE.cpp | ||
| BasicBlockPlacement.cpp | ||
| CodeGenPrepare.cpp | ||
| CondPropagate.cpp | ||
| ConstantProp.cpp | ||
| DCE.cpp | ||
| DeadStoreElimination.cpp | ||
| GCSE.cpp | ||
| GVN.cpp | ||
| GVNPRE.cpp | ||
| IndVarSimplify.cpp | ||
| InstructionCombining.cpp | ||
| JumpThreading.cpp | ||
| LICM.cpp | ||
| LoopIndexSplit.cpp | ||
| LoopRotation.cpp | ||
| LoopStrengthReduce.cpp | ||
| LoopUnroll.cpp | ||
| LoopUnswitch.cpp | ||
| Makefile | ||
| MemCpyOptimizer.cpp | ||
| PredicateSimplifier.cpp | ||
| Reassociate.cpp | ||
| Reg2Mem.cpp | ||
| Scalar.cpp | ||
| ScalarReplAggregates.cpp | ||
| SCCP.cpp | ||
| SimplifyCFG.cpp | ||
| TailDuplication.cpp | ||
| TailRecursionElimination.cpp | ||