mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-09-24 23:28:41 +00:00
Move SimpleRegisterCoalescing.h to lib/CodeGen since there is now a common
register coalescer interface: RegisterCoalescing. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43714 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
184
lib/CodeGen/SimpleRegisterCoalescing.h
Normal file
184
lib/CodeGen/SimpleRegisterCoalescing.h
Normal file
@@ -0,0 +1,184 @@
|
||||
//===-- SimpleRegisterCoalescing.h - Register Coalescing --------*- C++ -*-===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file was developed by the LLVM research group and is distributed under
|
||||
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// This file implements a simple register copy coalescing phase.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
#ifndef LLVM_CODEGEN_SIMPLE_REGISTER_COALESCING_H
|
||||
#define LLVM_CODEGEN_SIMPLE_REGISTER_COALESCING_H
|
||||
|
||||
#include "llvm/CodeGen/MachineFunctionPass.h"
|
||||
#include "llvm/CodeGen/LiveInterval.h"
|
||||
#include "llvm/CodeGen/LiveIntervalAnalysis.h"
|
||||
#include "llvm/CodeGen/RegisterCoalescer.h"
|
||||
#include "llvm/ADT/BitVector.h"
|
||||
#include "llvm/ADT/IndexedMap.h"
|
||||
|
||||
namespace llvm {
|
||||
|
||||
class LiveVariables;
|
||||
class MRegisterInfo;
|
||||
class TargetInstrInfo;
|
||||
class VirtRegMap;
|
||||
|
||||
class SimpleRegisterCoalescing : public MachineFunctionPass,
|
||||
public RegisterCoalescer {
|
||||
MachineFunction* mf_;
|
||||
const TargetMachine* tm_;
|
||||
const MRegisterInfo* mri_;
|
||||
const TargetInstrInfo* tii_;
|
||||
LiveIntervals *li_;
|
||||
LiveVariables *lv_;
|
||||
|
||||
BitVector allocatableRegs_;
|
||||
DenseMap<const TargetRegisterClass*, BitVector> allocatableRCRegs_;
|
||||
|
||||
/// r2rMap_ - Map from register to its representative register.
|
||||
///
|
||||
IndexedMap<unsigned> r2rMap_;
|
||||
|
||||
/// r2rRevMap_ - Reverse of r2rRevMap_, i.e. Map from register to all
|
||||
/// the registers it represent.
|
||||
IndexedMap<std::vector<unsigned> > r2rRevMap_;
|
||||
|
||||
/// JoinedLIs - Keep track which register intervals have been coalesced
|
||||
/// with other intervals.
|
||||
BitVector JoinedLIs;
|
||||
|
||||
/// SubRegIdxes - Keep track of sub-register and indexes.
|
||||
///
|
||||
SmallVector<std::pair<unsigned, unsigned>, 32> SubRegIdxes;
|
||||
|
||||
/// JoinedCopies - Keep track of copies eliminated due to coalescing.
|
||||
///
|
||||
SmallPtrSet<MachineInstr*, 32> JoinedCopies;
|
||||
|
||||
public:
|
||||
static char ID; // Pass identifcation, replacement for typeid
|
||||
SimpleRegisterCoalescing() : MachineFunctionPass((intptr_t)&ID) {}
|
||||
|
||||
struct CopyRec {
|
||||
MachineInstr *MI;
|
||||
unsigned SrcReg, DstReg;
|
||||
};
|
||||
CopyRec getCopyRec(MachineInstr *MI, unsigned SrcReg, unsigned DstReg) {
|
||||
CopyRec R;
|
||||
R.MI = MI;
|
||||
R.SrcReg = SrcReg;
|
||||
R.DstReg = DstReg;
|
||||
return R;
|
||||
}
|
||||
struct InstrSlots {
|
||||
enum {
|
||||
LOAD = 0,
|
||||
USE = 1,
|
||||
DEF = 2,
|
||||
STORE = 3,
|
||||
NUM = 4
|
||||
};
|
||||
};
|
||||
|
||||
virtual void getAnalysisUsage(AnalysisUsage &AU) const;
|
||||
virtual void releaseMemory();
|
||||
|
||||
/// runOnMachineFunction - pass entry point
|
||||
virtual bool runOnMachineFunction(MachineFunction&);
|
||||
|
||||
bool coalesceFunction(MachineFunction &mf, RegallocQuery &) {
|
||||
// This runs as an independent pass, so don't do anything.
|
||||
return(false);
|
||||
};
|
||||
|
||||
/// print - Implement the dump method.
|
||||
virtual void print(std::ostream &O, const Module* = 0) const;
|
||||
void print(std::ostream *O, const Module* M = 0) const {
|
||||
if (O) print(*O, M);
|
||||
}
|
||||
|
||||
private:
|
||||
/// joinIntervals - join compatible live intervals
|
||||
void joinIntervals();
|
||||
|
||||
/// CopyCoalesceInMBB - Coalesce copies in the specified MBB, putting
|
||||
/// copies that cannot yet be coalesced into the "TryAgain" list.
|
||||
void CopyCoalesceInMBB(MachineBasicBlock *MBB,
|
||||
std::vector<CopyRec> &TryAgain);
|
||||
|
||||
/// JoinCopy - Attempt to join intervals corresponding to SrcReg/DstReg,
|
||||
/// which are the src/dst of the copy instruction CopyMI. This returns true
|
||||
/// if the copy was successfully coalesced away. If it is not currently
|
||||
/// possible to coalesce this interval, but it may be possible if other
|
||||
/// things get coalesced, then it returns true by reference in 'Again'.
|
||||
bool JoinCopy(MachineInstr *CopyMI, unsigned SrcReg, unsigned DstReg,
|
||||
bool &Again);
|
||||
|
||||
/// JoinIntervals - Attempt to join these two intervals. On failure, this
|
||||
/// returns false. Otherwise, if one of the intervals being joined is a
|
||||
/// physreg, this method always canonicalizes DestInt to be it. The output
|
||||
/// "SrcInt" will not have been modified, so we can use this information
|
||||
/// below to update aliases.
|
||||
bool JoinIntervals(LiveInterval &LHS, LiveInterval &RHS, bool &Swapped);
|
||||
|
||||
/// SimpleJoin - Attempt to join the specified interval into this one. The
|
||||
/// caller of this method must guarantee that the RHS only contains a single
|
||||
/// value number and that the RHS is not defined by a copy from this
|
||||
/// interval. This returns false if the intervals are not joinable, or it
|
||||
/// joins them and returns true.
|
||||
bool SimpleJoin(LiveInterval &LHS, LiveInterval &RHS);
|
||||
|
||||
/// Return true if the two specified registers belong to different
|
||||
/// register classes. The registers may be either phys or virt regs.
|
||||
bool differingRegisterClasses(unsigned RegA, unsigned RegB) const;
|
||||
|
||||
|
||||
bool AdjustCopiesBackFrom(LiveInterval &IntA, LiveInterval &IntB,
|
||||
MachineInstr *CopyMI);
|
||||
|
||||
/// AddSubRegIdxPairs - Recursively mark all the registers represented by the
|
||||
/// specified register as sub-registers. The recursion level is expected to be
|
||||
/// shallow.
|
||||
void AddSubRegIdxPairs(unsigned Reg, unsigned SubIdx);
|
||||
|
||||
/// lastRegisterUse - Returns the last use of the specific register between
|
||||
/// cycles Start and End. It also returns the use operand by reference. It
|
||||
/// returns NULL if there are no uses.
|
||||
MachineInstr *lastRegisterUse(unsigned Start, unsigned End, unsigned Reg,
|
||||
MachineOperand *&MOU);
|
||||
|
||||
/// findDefOperand - Returns the MachineOperand that is a def of the specific
|
||||
/// register. It returns NULL if the def is not found.
|
||||
MachineOperand *findDefOperand(MachineInstr *MI, unsigned Reg);
|
||||
|
||||
/// unsetRegisterKill - Unset IsKill property of all uses of the specific
|
||||
/// register of the specific instruction.
|
||||
void unsetRegisterKill(MachineInstr *MI, unsigned Reg);
|
||||
|
||||
/// unsetRegisterKills - Unset IsKill property of all uses of specific register
|
||||
/// between cycles Start and End.
|
||||
void unsetRegisterKills(unsigned Start, unsigned End, unsigned Reg);
|
||||
|
||||
/// hasRegisterDef - True if the instruction defines the specific register.
|
||||
///
|
||||
bool hasRegisterDef(MachineInstr *MI, unsigned Reg);
|
||||
|
||||
/// rep - returns the representative of this register
|
||||
unsigned rep(unsigned Reg) {
|
||||
unsigned Rep = r2rMap_[Reg];
|
||||
if (Rep)
|
||||
return r2rMap_[Reg] = rep(Rep);
|
||||
return Reg;
|
||||
}
|
||||
|
||||
void printRegName(unsigned reg) const;
|
||||
};
|
||||
|
||||
} // End llvm namespace
|
||||
|
||||
#endif
|
Reference in New Issue
Block a user