llvm-project/llvm/lib/CodeGen
Chris Lattner 401d8db381 memory operands that have a direct operand should have their stores created
before the copies into physregs are done.  This avoids having flag operands
skip the store, causing cycles in the dag at sched time.  This fixes infinite
loops on these tests:

test/CodeGen/Generic/2007-04-08-MultipleFrameIndices.ll for PR1308
test/CodeGen/PowerPC/2007-01-29-lbrx-asm.ll
test/CodeGen/PowerPC/2007-01-31-InlineAsmAddrMode.ll
test/CodeGen/X86/2006-07-12-InlineAsmQConstraint.ll for PR828

llvm-svn: 36547
2007-04-28 21:12:06 +00:00
..
SelectionDAG memory operands that have a direct operand should have their stores created 2007-04-28 21:12:06 +00:00
AsmPrinter.cpp Implement review feedback. Aliasees can be either GlobalValue's or 2007-04-28 13:45:00 +00:00
BranchFolding.cpp maintain LiveIn when splitting blocks (register scavenging needs it) 2007-03-20 21:35:06 +00:00
DwarfWriter.cpp Cleanup: make SetCounter an instance variable 2007-03-07 08:25:02 +00:00
ELFWriter.cpp Generalize TargetData strings, to support more interesting forms of data. 2007-02-14 05:52:17 +00:00
ELFWriter.h Moved from include/llvm/CodeGen to lib/CodeGen. 2007-02-08 01:30:50 +00:00
IntrinsicLowering.cpp Fix problems in the PartSet lowering having to do with incorrect bit width. 2007-04-16 22:21:14 +00:00
LLVMTargetMachine.cpp move a bunch of code out of the sdisel pass into its own opt pass "codegenprepare". 2007-03-31 04:18:03 +00:00
LiveInterval.cpp Add a register allocation preference field; add a method to compute size of a live interval. 2007-04-17 20:25:11 +00:00
LiveIntervalAnalysis.cpp Rename findRegisterUseOperand to findRegisterUseOperandIdx to avoid confusion. 2007-04-26 19:00:32 +00:00
LiveVariables.cpp Rename findRegisterUseOperand to findRegisterUseOperandIdx to avoid confusion. 2007-04-26 19:00:32 +00:00
MachOWriter.cpp Remove unneeded header file. 2007-03-04 04:41:04 +00:00
MachOWriter.h Removed tabs everywhere except autogenerated & external files. Add make 2007-04-16 18:10:23 +00:00
MachineBasicBlock.cpp Print preds / succs BB numbers. 2007-03-09 08:29:08 +00:00
MachineFunction.cpp Change UsedPhysRegs from array bool to BitVector to save some space. Setting / getting its states now go through MachineFunction. 2007-04-25 22:10:09 +00:00
MachineInstr.cpp Rename findRegisterUseOperand to findRegisterUseOperandIdx to avoid confusion. 2007-04-26 19:00:32 +00:00
MachineModuleInfo.cpp Collect eh filter info. 2007-03-01 20:25:32 +00:00
MachinePassRegistry.cpp Final polish on machine pass registries. 2006-08-02 12:30:23 +00:00
Makefile this will work better 2006-11-03 19:15:55 +00:00
PHIElimination.cpp VarInfo::UsedBlocks is no longer used. Remove. 2007-04-18 05:04:38 +00:00
Passes.cpp *** empty log message *** 2006-11-16 20:11:33 +00:00
PhysRegTracker.h Improved PhysRegTracker interface. RegAlloc lazily allocates the register tracker using a std::auto_ptr 2004-02-23 06:10:13 +00:00
PrologEpilogInserter.cpp Match MachineFunction::UsedPhysRegs changes. 2007-04-25 22:13:27 +00:00
README.txt Removed tabs everywhere except autogenerated & external files. Add make 2007-04-16 18:10:23 +00:00
RegAllocLinearScan.cpp Match MachineFunction::UsedPhysRegs changes. 2007-04-25 22:13:27 +00:00
RegAllocLocal.cpp Match MachineFunction::UsedPhysRegs changes. 2007-04-25 22:13:27 +00:00
RegAllocSimple.cpp Match MachineFunction::UsedPhysRegs changes. 2007-04-25 22:13:27 +00:00
RegisterScavenging.cpp Rename findRegisterUseOperand to findRegisterUseOperandIdx to avoid confusion. 2007-04-26 19:00:32 +00:00
TwoAddressInstructionPass.cpp VarInfo::UsedBlocks is no longer used. Remove. 2007-04-18 05:04:38 +00:00
UnreachableBlockElim.cpp eliminate RegisterOpt. It does the same thing as RegisterPass. 2006-08-27 22:42:52 +00:00
VirtRegMap.cpp Rename findRegisterUseOperand to findRegisterUseOperandIdx to avoid confusion. 2007-04-26 19:00:32 +00:00
VirtRegMap.h Re-materialize all loads from fixed stack slots. 2007-04-04 07:40:01 +00:00

README.txt

//===---------------------------------------------------------------------===//

Common register allocation / spilling problem:

        mul lr, r4, lr
        str lr, [sp, #+52]
        ldr lr, [r1, #+32]
        sxth r3, r3
        ldr r4, [sp, #+52]
        mla r4, r3, lr, r4

can be:

        mul lr, r4, lr
        mov r4, lr
        str lr, [sp, #+52]
        ldr lr, [r1, #+32]
        sxth r3, r3
        mla r4, r3, lr, r4

and then "merge" mul and mov:

        mul r4, r4, lr
        str lr, [sp, #+52]
        ldr lr, [r1, #+32]
        sxth r3, r3
        mla r4, r3, lr, r4

It also increase the likelyhood the store may become dead.

//===---------------------------------------------------------------------===//

I think we should have a "hasSideEffects" flag (which is automatically set for
stuff that "isLoad" "isCall" etc), and the remat pass should eventually be able
to remat any instruction that has no side effects, if it can handle it and if
profitable.

For now, I'd suggest having the remat stuff work like this:

1. I need to spill/reload this thing.
2. Check to see if it has side effects.
3. Check to see if it is simple enough: e.g. it only has one register
destination and no register input.
4. If so, clone the instruction, do the xform, etc.

Advantages of this are:

1. the .td file describes the behavior of the instructions, not the way the
   algorithm should work.
2. as remat gets smarter in the future, we shouldn't have to be changing the .td
   files.
3. it is easier to explain what the flag means in the .td file, because you
   don't have to pull in the explanation of how the current remat algo works.

Some potential added complexities:

1. Some instructions have to be glued to it's predecessor or successor. All of
   the PC relative instructions and condition code setting instruction. We could
   mark them as hasSideEffects, but that's not quite right. PC relative loads
   from constantpools can be remat'ed, for example. But it requires more than
   just cloning the instruction. Some instructions can be remat'ed but it
   expands to more than one instruction. But allocator will have to make a
   decision.

4. As stated in 3, not as simple as cloning in some cases. The target will have
   to decide how to remat it. For example, an ARM 2-piece constant generation
   instruction is remat'ed as a load from constantpool.

//===---------------------------------------------------------------------===//

bb27 ...
        ...
        %reg1037 = ADDri %reg1039, 1
        %reg1038 = ADDrs %reg1032, %reg1039, %NOREG, 10
    Successors according to CFG: 0x8b03bf0 (#5)

bb76 (0x8b03bf0, LLVM BB @0x8b032d0, ID#5):
    Predecessors according to CFG: 0x8b0c5f0 (#3) 0x8b0a7c0 (#4)
        %reg1039 = PHI %reg1070, mbb<bb76.outer,0x8b0c5f0>, %reg1037, mbb<bb27,0x8b0a7c0>

Note ADDri is not a two-address instruction. However, its result %reg1037 is an
operand of the PHI node in bb76 and its operand %reg1039 is the result of the
PHI node. We should treat it as a two-address code and make sure the ADDri is
scheduled after any node that reads %reg1039.

//===---------------------------------------------------------------------===//

Re-Materialize load from frame index.