6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-06-13 22:24:07 +00:00
Code Issues Projects Releases Wiki Activity

* Move InstructionSelection Pass here instead of living in Sparc.cpp. It

Browse Source 
is platform independant afterall.
* Object orientize the functions, cleanup code a bit.  Instead of static
  global functions, the helpers for instruction selection are now part of
  the InstructionSelection Pass class.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3147 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2002-07-30 03:57:36 +00:00
parent 057430d207
commit 2e1749bbf8
2 changed files with 302 additions and 348 deletions
Download Patch File Download Diff File Expand all files Collapse all files

325
lib/CodeGen/InstrSelection/InstrSelection.cpp
View File

@ -1,18 +1,11 @@
// $Id$ -*-c++-*- //===- InstrSelection.cpp - Machine Independant Inst Selection Driver -----===//
//*************************************************************************** //
// File: // Machine-independent driver file for instruction selection. This file
// InstrSelection.cpp // constructs a forest of BURG instruction trees and then uses the
// // BURG-generated tree grammar (BURM) to find the optimal instruction sequences
// Purpose: // for a given machine.
// Machine-independent driver file for instruction selection.
// This file constructs a forest of BURG instruction trees and then
// uses the BURG-generated tree grammar (BURM) to find the optimal
// instruction sequences for a given machine.
// //
// History: //===----------------------------------------------------------------------===//
// 7/02/01 - Vikram Adve - Created
//**************************************************************************/
#include "llvm/CodeGen/InstrSelection.h" #include "llvm/CodeGen/InstrSelection.h"
#include "llvm/CodeGen/InstrSelectionSupport.h" #include "llvm/CodeGen/InstrSelectionSupport.h"
@ -22,79 +15,76 @@
#include "llvm/CodeGen/MachineCodeForMethod.h" #include "llvm/CodeGen/MachineCodeForMethod.h"
#include "llvm/Target/MachineRegInfo.h" #include "llvm/Target/MachineRegInfo.h"
#include "llvm/Target/TargetMachine.h" #include "llvm/Target/TargetMachine.h"
#include "llvm/BasicBlock.h"
#include "llvm/Function.h" #include "llvm/Function.h"
#include "llvm/iPHINode.h" #include "llvm/iPHINode.h"
#include "llvm/Pass.h"
#include "Support/CommandLine.h" #include "Support/CommandLine.h"
using std::cerr; using std::cerr;
using std::vector; using std::vector;
//******************** Internal Data Declarations ************************/ namespace {
//===--------------------------------------------------------------------===//
// SelectDebugLevel - Allow command line control over debugging.
enum SelectDebugLevel_t { //
Select_NoDebugInfo, enum SelectDebugLevel_t {
Select_PrintMachineCode, Select_NoDebugInfo,
Select_DebugInstTrees, Select_PrintMachineCode,
Select_DebugBurgTrees, Select_DebugInstTrees,
}; Select_DebugBurgTrees,
};
// Enable Debug Options to be specified on the command line
static cl::opt<SelectDebugLevel_t>
SelectDebugLevel("dselect", cl::Hidden,
cl::desc("enable instruction selection debugging information"),
cl::values(
clEnumValN(Select_NoDebugInfo, "n", "disable debug output"),
clEnumValN(Select_PrintMachineCode, "y", "print generated machine code"),
clEnumValN(Select_DebugInstTrees, "i",
"print debugging info for instruction selection"),
clEnumValN(Select_DebugBurgTrees, "b", "print burg trees"),
0));
//******************** Forward Function Declarations ***********************/
static bool SelectInstructionsForTree (InstrTreeNode* treeRoot,
int goalnt,
TargetMachine &target);
static void PostprocessMachineCodeForTree(InstructionNode* instrNode,
int ruleForNode,
short* nts,
TargetMachine &target);
static void InsertCode4AllPhisInMeth(Function *F, TargetMachine &target);
//******************* Externally Visible Functions *************************/
//---------------------------------------------------------------------------
// Entry point for instruction selection using BURG.
// Returns true if instruction selection failed, false otherwise.
//---------------------------------------------------------------------------
bool
SelectInstructionsForMethod(Function *F, TargetMachine &target)
{
bool failed = false;
// Enable Debug Options to be specified on the command line
cl::opt<SelectDebugLevel_t>
SelectDebugLevel("dselect", cl::Hidden,
cl::desc("enable instruction selection debug information"),
cl::values(
clEnumValN(Select_NoDebugInfo, "n", "disable debug output"),
clEnumValN(Select_PrintMachineCode, "y", "print generated machine code"),
clEnumValN(Select_DebugInstTrees, "i",
"print debugging info for instruction selection"),
clEnumValN(Select_DebugBurgTrees, "b", "print burg trees"),
0));
//===--------------------------------------------------------------------===//
// InstructionSelection Pass
//
// This is the actual pass object that drives the instruction selection
// process.
//
class InstructionSelection : public FunctionPass {
TargetMachine &Target;
void InsertCodeForPhis(Function &F);
void InsertPhiElimInstructions(BasicBlock *BB,
const std::vector<MachineInstr*>& CpVec);
void SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt);
void PostprocessMachineCodeForTree(InstructionNode* instrNode,
int ruleForNode, short* nts);
public:
InstructionSelection(TargetMachine &T) : Target(T) {}
bool runOnFunction(Function &F);
};
}
// Register the pass...
static RegisterLLC<InstructionSelection>
X("instselect", "Instruction Selection", createInstructionSelectionPass);
bool InstructionSelection::runOnFunction(Function &F)
{
// //
// Build the instruction trees to be given as inputs to BURG. // Build the instruction trees to be given as inputs to BURG.
// //
InstrForest instrForest(F); InstrForest instrForest(&F);
if (SelectDebugLevel >= Select_DebugInstTrees) if (SelectDebugLevel >= Select_DebugInstTrees)
{ {
cerr << "\n\n*** Input to instruction selection for function " cerr << "\n\n*** Input to instruction selection for function "
<< F->getName() << "\n\n"; << F.getName() << "\n\n" << F
F->dump(); << "\n\n*** Instruction trees for function "
<< F.getName() << "\n\n";
cerr << "\n\n*** Instruction trees for function "
<< F->getName() << "\n\n";
instrForest.dump(); instrForest.dump();
} }
@ -118,69 +108,29 @@ SelectInstructionsForMethod(Function *F, TargetMachine &target)
} }
// Then recursively walk the tree to select instructions // Then recursively walk the tree to select instructions
if (SelectInstructionsForTree(basicNode, /*goalnt*/1, target)) SelectInstructionsForTree(basicNode, /*goalnt*/1);
{
failed = true;
break;
}
} }
// //
// Record instructions in the vector for each basic block // Record instructions in the vector for each basic block
// //
for (Function::iterator BI = F->begin(), BE = F->end(); BI != BE; ++BI) for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI)
for (BasicBlock::iterator II = BI->begin(); II != BI->end(); ++II) { for (BasicBlock::iterator II = BI->begin(); II != BI->end(); ++II) {
MachineCodeForInstruction &mvec =MachineCodeForInstruction::get(II); MachineCodeForInstruction &mvec = MachineCodeForInstruction::get(II);
for (unsigned i=0; i < mvec.size(); i++) MachineCodeForBasicBlock &MCBB = MachineCodeForBasicBlock::get(BI);
MachineCodeForBasicBlock::get(BI).push_back(mvec[i]); MCBB.insert(MCBB.end(), mvec.begin(), mvec.end());
} }
// Insert phi elimination code -- added by Ruchira // Insert phi elimination code
InsertCode4AllPhisInMeth(F, target); InsertCodeForPhis(F);
if (SelectDebugLevel >= Select_PrintMachineCode) if (SelectDebugLevel >= Select_PrintMachineCode)
{ {
cerr << "\n*** Machine instructions after INSTRUCTION SELECTION\n"; cerr << "\n*** Machine instructions after INSTRUCTION SELECTION\n";
MachineCodeForMethod::get(F).dump(); MachineCodeForMethod::get(&F).dump();
} }
return false; return true;
}
//*********************** Private Functions *****************************/
//-------------------------------------------------------------------------
// Thid method inserts a copy instruction to a predecessor BB as a result
// of phi elimination.
//-------------------------------------------------------------------------
void
InsertPhiElimInstructions(BasicBlock *BB, const std::vector<MachineInstr*>& CpVec)
{
Instruction *TermInst = (Instruction*)BB->getTerminator();
MachineCodeForInstruction &MC4Term =MachineCodeForInstruction::get(TermInst);
MachineInstr *FirstMIOfTerm = *( MC4Term.begin() );
assert( FirstMIOfTerm && "No Machine Instrs for terminator" );
// get an iterator to machine instructions in the BB
MachineCodeForBasicBlock& bbMvec = MachineCodeForBasicBlock::get(BB);
MachineCodeForBasicBlock::iterator MCIt = bbMvec.begin();
// find the position of first machine instruction generated by the
// terminator of this BB
for( ; (MCIt != bbMvec.end()) && (*MCIt != FirstMIOfTerm) ; ++MCIt )
;
assert( MCIt != bbMvec.end() && "Start inst of terminator not found");
// insert the copy instructions just before the first machine instruction
// generated for the terminator
bbMvec.insert(MCIt, CpVec.begin(), CpVec.end());
//cerr << "\nPhiElimination copy inst: " << *CopyInstVec[0];
} }
@ -189,11 +139,11 @@ InsertPhiElimInstructions(BasicBlock *BB, const std::vector<MachineInstr*>& CpVe
//------------------------------------------------------------------------- //-------------------------------------------------------------------------
void void
InsertCode4AllPhisInMeth(Function *F, TargetMachine &target) InstructionSelection::InsertCodeForPhis(Function &F)
{ {
// for all basic blocks in function // for all basic blocks in function
// //
for (Function::iterator BB = F->begin(); BB != F->end(); ++BB) { for (Function::iterator BB = F.begin(); BB != F.end(); ++BB) {
BasicBlock::InstListType &InstList = BB->getInstList(); BasicBlock::InstListType &InstList = BB->getInstList();
for (BasicBlock::iterator IIt = InstList.begin(); for (BasicBlock::iterator IIt = InstList.begin();
PHINode *PN = dyn_cast<PHINode>(&*IIt); ++IIt) { PHINode *PN = dyn_cast<PHINode>(&*IIt); ++IIt) {
@ -205,12 +155,12 @@ InsertCode4AllPhisInMeth(Function *F, TargetMachine &target)
for (unsigned i = 0; i < PN->getNumIncomingValues(); ++i) { for (unsigned i = 0; i < PN->getNumIncomingValues(); ++i) {
// insert the copy instruction to the predecessor BB // insert the copy instruction to the predecessor BB
vector<MachineInstr*> mvec, CpVec; vector<MachineInstr*> mvec, CpVec;
target.getRegInfo().cpValue2Value(PN->getIncomingValue(i), PhiCpRes, Target.getRegInfo().cpValue2Value(PN->getIncomingValue(i), PhiCpRes,
mvec); mvec);
for (vector<MachineInstr*>::iterator MI=mvec.begin(); for (vector<MachineInstr*>::iterator MI=mvec.begin();
MI != mvec.end(); ++MI) { MI != mvec.end(); ++MI) {
vector<MachineInstr*> CpVec2 = vector<MachineInstr*> CpVec2 =
FixConstantOperandsForInstr(PN, *MI, target); FixConstantOperandsForInstr(PN, *MI, Target);
CpVec2.push_back(*MI); CpVec2.push_back(*MI);
CpVec.insert(CpVec.end(), CpVec2.begin(), CpVec2.end()); CpVec.insert(CpVec.end(), CpVec2.begin(), CpVec2.end());
} }
@ -219,7 +169,7 @@ InsertCode4AllPhisInMeth(Function *F, TargetMachine &target)
} }
vector<MachineInstr*> mvec; vector<MachineInstr*> mvec;
target.getRegInfo().cpValue2Value(PhiCpRes, PN, mvec); Target.getRegInfo().cpValue2Value(PhiCpRes, PN, mvec);
// get an iterator to machine instructions in the BB // get an iterator to machine instructions in the BB
MachineCodeForBasicBlock& bbMvec = MachineCodeForBasicBlock::get(BB); MachineCodeForBasicBlock& bbMvec = MachineCodeForBasicBlock::get(BB);
@ -229,36 +179,36 @@ InsertCode4AllPhisInMeth(Function *F, TargetMachine &target)
} // for all BBs in function } // for all BBs in function
} }
//-------------------------------------------------------------------------
// Thid method inserts a copy instruction to a predecessor BB as a result
// of phi elimination.
//-------------------------------------------------------------------------
//--------------------------------------------------------------------------- void
// Function PostprocessMachineCodeForTree InstructionSelection::InsertPhiElimInstructions(BasicBlock *BB,
// const std::vector<MachineInstr*>& CpVec)
// Apply any final cleanups to machine code for the root of a subtree {
// after selection for all its children has been completed. Instruction *TermInst = (Instruction*)BB->getTerminator();
//--------------------------------------------------------------------------- MachineCodeForInstruction &MC4Term = MachineCodeForInstruction::get(TermInst);
MachineInstr *FirstMIOfTerm = MC4Term.front();
assert (FirstMIOfTerm && "No Machine Instrs for terminator");
MachineCodeForBasicBlock &bbMvec = MachineCodeForBasicBlock::get(BB);
static void // find the position of first machine instruction generated by the
PostprocessMachineCodeForTree(InstructionNode* instrNode, // terminator of this BB
int ruleForNode, MachineCodeForBasicBlock::iterator MCIt =
short* nts, std::find(bbMvec.begin(), bbMvec.end(), FirstMIOfTerm);
TargetMachine &target)
{ assert( MCIt != bbMvec.end() && "Start inst of terminator not found");
// Fix up any constant operands in the machine instructions to either
// use an immediate field or to load the constant into a register // insert the copy instructions just before the first machine instruction
// Walk backwards and use direct indexes to allow insertion before current // generated for the terminator
// bbMvec.insert(MCIt, CpVec.begin(), CpVec.end());
Instruction* vmInstr = instrNode->getInstruction();
MachineCodeForInstruction &mvec = MachineCodeForInstruction::get(vmInstr);
for (int i = (int) mvec.size()-1; i >= 0; i--)
{
std::vector<MachineInstr*> loadConstVec =
FixConstantOperandsForInstr(vmInstr, mvec[i], target);
if (loadConstVec.size() > 0)
mvec.insert(mvec.begin()+i, loadConstVec.begin(), loadConstVec.end());
}
} }
//--------------------------------------------------------------------------- //---------------------------------------------------------------------------
// Function SelectInstructionsForTree // Function SelectInstructionsForTree
// //
@ -275,20 +225,18 @@ PostprocessMachineCodeForTree(InstructionNode* instrNode,
// may be used by multiple instructions). // may be used by multiple instructions).
//--------------------------------------------------------------------------- //---------------------------------------------------------------------------
bool void
SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt, InstructionSelection::SelectInstructionsForTree(InstrTreeNode* treeRoot,
TargetMachine &target) int goalnt)
{ {
// Get the rule that matches this node. // Get the rule that matches this node.
// //
int ruleForNode = burm_rule(treeRoot->state, goalnt); int ruleForNode = burm_rule(treeRoot->state, goalnt);
if (ruleForNode == 0) if (ruleForNode == 0) {
{ cerr << "Could not match instruction tree for instr selection\n";
cerr << "Could not match instruction tree for instr selection\n"; abort();
assert(0); }
return true;
}
// Get this rule's non-terminals and the corresponding child nodes (if any) // Get this rule's non-terminals and the corresponding child nodes (if any)
// //
@ -305,7 +253,7 @@ SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt,
InstructionNode* instrNode = (InstructionNode*)treeRoot; InstructionNode* instrNode = (InstructionNode*)treeRoot;
assert(instrNode->getNodeType() == InstrTreeNode::NTInstructionNode); assert(instrNode->getNodeType() == InstrTreeNode::NTInstructionNode);
GetInstructionsByRule(instrNode, ruleForNode, nts, target, minstrVec); GetInstructionsByRule(instrNode, ruleForNode, nts, Target, minstrVec);
MachineCodeForInstruction &mvec = MachineCodeForInstruction &mvec =
MachineCodeForInstruction::get(instrNode->getInstruction()); MachineCodeForInstruction::get(instrNode->getInstruction());
@ -333,16 +281,13 @@ SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt,
// Now we have the first non-chain rule so we have found // Now we have the first non-chain rule so we have found
// the actual child nodes. Recursively compile them. // the actual child nodes. Recursively compile them.
// //
for (int i = 0; nts[i]; i++) for (unsigned i = 0; nts[i]; i++)
{ {
assert(i < 2); assert(i < 2);
InstrTreeNode::InstrTreeNodeType nodeType = kids[i]->getNodeType(); InstrTreeNode::InstrTreeNodeType nodeType = kids[i]->getNodeType();
if (nodeType == InstrTreeNode::NTVRegListNode || if (nodeType == InstrTreeNode::NTVRegListNode ||
nodeType == InstrTreeNode::NTInstructionNode) nodeType == InstrTreeNode::NTInstructionNode)
{ SelectInstructionsForTree(kids[i], nts[i]);
if (SelectInstructionsForTree(kids[i], nts[i], target))
return true; // failure
}
} }
} }
@ -350,11 +295,43 @@ SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt,
// have been translated // have been translated
// //
if (treeRoot->opLabel != VRegListOp) if (treeRoot->opLabel != VRegListOp)
{ PostprocessMachineCodeForTree((InstructionNode*)treeRoot, ruleForNode, nts);
InstructionNode* instrNode = (InstructionNode*)treeRoot; }
PostprocessMachineCodeForTree(instrNode, ruleForNode, nts, target);
} //---------------------------------------------------------------------------
// Function PostprocessMachineCodeForTree
return false; // success //
// Apply any final cleanups to machine code for the root of a subtree
// after selection for all its children has been completed.
//
void
InstructionSelection::PostprocessMachineCodeForTree(InstructionNode* instrNode,
int ruleForNode,
short* nts)
{
// Fix up any constant operands in the machine instructions to either
// use an immediate field or to load the constant into a register
// Walk backwards and use direct indexes to allow insertion before current
//
Instruction* vmInstr = instrNode->getInstruction();
MachineCodeForInstruction &mvec = MachineCodeForInstruction::get(vmInstr);
for (int i = (int) mvec.size()-1; i >= 0; i--)
{
std::vector<MachineInstr*> loadConstVec =
FixConstantOperandsForInstr(vmInstr, mvec[i], Target);
if (loadConstVec.size() > 0)
mvec.insert(mvec.begin()+i, loadConstVec.begin(), loadConstVec.end());
}
}
//===----------------------------------------------------------------------===//
// createInstructionSelectionPass - Public entrypoint for instruction selection
// and this file as a whole...
//
Pass *createInstructionSelectionPass(TargetMachine &T) {
return new InstructionSelection(T);
} }

325
lib/Target/SparcV9/InstrSelection/InstrSelection.cpp
View File

@ -1,18 +1,11 @@
// $Id$ -*-c++-*- //===- InstrSelection.cpp - Machine Independant Inst Selection Driver -----===//
//*************************************************************************** //
// File: // Machine-independent driver file for instruction selection. This file
// InstrSelection.cpp // constructs a forest of BURG instruction trees and then uses the
// // BURG-generated tree grammar (BURM) to find the optimal instruction sequences
// Purpose: // for a given machine.
// Machine-independent driver file for instruction selection.
// This file constructs a forest of BURG instruction trees and then
// uses the BURG-generated tree grammar (BURM) to find the optimal
// instruction sequences for a given machine.
// //
// History: //===----------------------------------------------------------------------===//
// 7/02/01 - Vikram Adve - Created
//**************************************************************************/
#include "llvm/CodeGen/InstrSelection.h" #include "llvm/CodeGen/InstrSelection.h"
#include "llvm/CodeGen/InstrSelectionSupport.h" #include "llvm/CodeGen/InstrSelectionSupport.h"
@ -22,79 +15,76 @@
#include "llvm/CodeGen/MachineCodeForMethod.h" #include "llvm/CodeGen/MachineCodeForMethod.h"
#include "llvm/Target/MachineRegInfo.h" #include "llvm/Target/MachineRegInfo.h"
#include "llvm/Target/TargetMachine.h" #include "llvm/Target/TargetMachine.h"
#include "llvm/BasicBlock.h"
#include "llvm/Function.h" #include "llvm/Function.h"
#include "llvm/iPHINode.h" #include "llvm/iPHINode.h"
#include "llvm/Pass.h"
#include "Support/CommandLine.h" #include "Support/CommandLine.h"
using std::cerr; using std::cerr;
using std::vector; using std::vector;
//******************** Internal Data Declarations ************************/ namespace {
//===--------------------------------------------------------------------===//
// SelectDebugLevel - Allow command line control over debugging.
enum SelectDebugLevel_t { //
Select_NoDebugInfo, enum SelectDebugLevel_t {
Select_PrintMachineCode, Select_NoDebugInfo,
Select_DebugInstTrees, Select_PrintMachineCode,
Select_DebugBurgTrees, Select_DebugInstTrees,
}; Select_DebugBurgTrees,
};
// Enable Debug Options to be specified on the command line
static cl::opt<SelectDebugLevel_t>
SelectDebugLevel("dselect", cl::Hidden,
cl::desc("enable instruction selection debugging information"),
cl::values(
clEnumValN(Select_NoDebugInfo, "n", "disable debug output"),
clEnumValN(Select_PrintMachineCode, "y", "print generated machine code"),
clEnumValN(Select_DebugInstTrees, "i",
"print debugging info for instruction selection"),
clEnumValN(Select_DebugBurgTrees, "b", "print burg trees"),
0));
//******************** Forward Function Declarations ***********************/
static bool SelectInstructionsForTree (InstrTreeNode* treeRoot,
int goalnt,
TargetMachine &target);
static void PostprocessMachineCodeForTree(InstructionNode* instrNode,
int ruleForNode,
short* nts,
TargetMachine &target);
static void InsertCode4AllPhisInMeth(Function *F, TargetMachine &target);
//******************* Externally Visible Functions *************************/
//---------------------------------------------------------------------------
// Entry point for instruction selection using BURG.
// Returns true if instruction selection failed, false otherwise.
//---------------------------------------------------------------------------
bool
SelectInstructionsForMethod(Function *F, TargetMachine &target)
{
bool failed = false;
// Enable Debug Options to be specified on the command line
cl::opt<SelectDebugLevel_t>
SelectDebugLevel("dselect", cl::Hidden,
cl::desc("enable instruction selection debug information"),
cl::values(
clEnumValN(Select_NoDebugInfo, "n", "disable debug output"),
clEnumValN(Select_PrintMachineCode, "y", "print generated machine code"),
clEnumValN(Select_DebugInstTrees, "i",
"print debugging info for instruction selection"),
clEnumValN(Select_DebugBurgTrees, "b", "print burg trees"),
0));
//===--------------------------------------------------------------------===//
// InstructionSelection Pass
//
// This is the actual pass object that drives the instruction selection
// process.
//
class InstructionSelection : public FunctionPass {
TargetMachine &Target;
void InsertCodeForPhis(Function &F);
void InsertPhiElimInstructions(BasicBlock *BB,
const std::vector<MachineInstr*>& CpVec);
void SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt);
void PostprocessMachineCodeForTree(InstructionNode* instrNode,
int ruleForNode, short* nts);
public:
InstructionSelection(TargetMachine &T) : Target(T) {}
bool runOnFunction(Function &F);
};
}
// Register the pass...
static RegisterLLC<InstructionSelection>
X("instselect", "Instruction Selection", createInstructionSelectionPass);
bool InstructionSelection::runOnFunction(Function &F)
{
// //
// Build the instruction trees to be given as inputs to BURG. // Build the instruction trees to be given as inputs to BURG.
// //
InstrForest instrForest(F); InstrForest instrForest(&F);
if (SelectDebugLevel >= Select_DebugInstTrees) if (SelectDebugLevel >= Select_DebugInstTrees)
{ {
cerr << "\n\n*** Input to instruction selection for function " cerr << "\n\n*** Input to instruction selection for function "
<< F->getName() << "\n\n"; << F.getName() << "\n\n" << F
F->dump(); << "\n\n*** Instruction trees for function "
<< F.getName() << "\n\n";
cerr << "\n\n*** Instruction trees for function "
<< F->getName() << "\n\n";
instrForest.dump(); instrForest.dump();
} }
@ -118,69 +108,29 @@ SelectInstructionsForMethod(Function *F, TargetMachine &target)
} }
// Then recursively walk the tree to select instructions // Then recursively walk the tree to select instructions
if (SelectInstructionsForTree(basicNode, /*goalnt*/1, target)) SelectInstructionsForTree(basicNode, /*goalnt*/1);
{
failed = true;
break;
}
} }
// //
// Record instructions in the vector for each basic block // Record instructions in the vector for each basic block
// //
for (Function::iterator BI = F->begin(), BE = F->end(); BI != BE; ++BI) for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI)
for (BasicBlock::iterator II = BI->begin(); II != BI->end(); ++II) { for (BasicBlock::iterator II = BI->begin(); II != BI->end(); ++II) {
MachineCodeForInstruction &mvec =MachineCodeForInstruction::get(II); MachineCodeForInstruction &mvec = MachineCodeForInstruction::get(II);
for (unsigned i=0; i < mvec.size(); i++) MachineCodeForBasicBlock &MCBB = MachineCodeForBasicBlock::get(BI);
MachineCodeForBasicBlock::get(BI).push_back(mvec[i]); MCBB.insert(MCBB.end(), mvec.begin(), mvec.end());
} }
// Insert phi elimination code -- added by Ruchira // Insert phi elimination code
InsertCode4AllPhisInMeth(F, target); InsertCodeForPhis(F);
if (SelectDebugLevel >= Select_PrintMachineCode) if (SelectDebugLevel >= Select_PrintMachineCode)
{ {
cerr << "\n*** Machine instructions after INSTRUCTION SELECTION\n"; cerr << "\n*** Machine instructions after INSTRUCTION SELECTION\n";
MachineCodeForMethod::get(F).dump(); MachineCodeForMethod::get(&F).dump();
} }
return false; return true;
}
//*********************** Private Functions *****************************/
//-------------------------------------------------------------------------
// Thid method inserts a copy instruction to a predecessor BB as a result
// of phi elimination.
//-------------------------------------------------------------------------
void
InsertPhiElimInstructions(BasicBlock *BB, const std::vector<MachineInstr*>& CpVec)
{
Instruction *TermInst = (Instruction*)BB->getTerminator();
MachineCodeForInstruction &MC4Term =MachineCodeForInstruction::get(TermInst);
MachineInstr *FirstMIOfTerm = *( MC4Term.begin() );
assert( FirstMIOfTerm && "No Machine Instrs for terminator" );
// get an iterator to machine instructions in the BB
MachineCodeForBasicBlock& bbMvec = MachineCodeForBasicBlock::get(BB);
MachineCodeForBasicBlock::iterator MCIt = bbMvec.begin();
// find the position of first machine instruction generated by the
// terminator of this BB
for( ; (MCIt != bbMvec.end()) && (*MCIt != FirstMIOfTerm) ; ++MCIt )
;
assert( MCIt != bbMvec.end() && "Start inst of terminator not found");
// insert the copy instructions just before the first machine instruction
// generated for the terminator
bbMvec.insert(MCIt, CpVec.begin(), CpVec.end());
//cerr << "\nPhiElimination copy inst: " << *CopyInstVec[0];
} }
@ -189,11 +139,11 @@ InsertPhiElimInstructions(BasicBlock *BB, const std::vector<MachineInstr*>& CpVe
//------------------------------------------------------------------------- //-------------------------------------------------------------------------
void void
InsertCode4AllPhisInMeth(Function *F, TargetMachine &target) InstructionSelection::InsertCodeForPhis(Function &F)
{ {
// for all basic blocks in function // for all basic blocks in function
// //
for (Function::iterator BB = F->begin(); BB != F->end(); ++BB) { for (Function::iterator BB = F.begin(); BB != F.end(); ++BB) {
BasicBlock::InstListType &InstList = BB->getInstList(); BasicBlock::InstListType &InstList = BB->getInstList();
for (BasicBlock::iterator IIt = InstList.begin(); for (BasicBlock::iterator IIt = InstList.begin();
PHINode *PN = dyn_cast<PHINode>(&*IIt); ++IIt) { PHINode *PN = dyn_cast<PHINode>(&*IIt); ++IIt) {
@ -205,12 +155,12 @@ InsertCode4AllPhisInMeth(Function *F, TargetMachine &target)
for (unsigned i = 0; i < PN->getNumIncomingValues(); ++i) { for (unsigned i = 0; i < PN->getNumIncomingValues(); ++i) {
// insert the copy instruction to the predecessor BB // insert the copy instruction to the predecessor BB
vector<MachineInstr*> mvec, CpVec; vector<MachineInstr*> mvec, CpVec;
target.getRegInfo().cpValue2Value(PN->getIncomingValue(i), PhiCpRes, Target.getRegInfo().cpValue2Value(PN->getIncomingValue(i), PhiCpRes,
mvec); mvec);
for (vector<MachineInstr*>::iterator MI=mvec.begin(); for (vector<MachineInstr*>::iterator MI=mvec.begin();
MI != mvec.end(); ++MI) { MI != mvec.end(); ++MI) {
vector<MachineInstr*> CpVec2 = vector<MachineInstr*> CpVec2 =
FixConstantOperandsForInstr(PN, *MI, target); FixConstantOperandsForInstr(PN, *MI, Target);
CpVec2.push_back(*MI); CpVec2.push_back(*MI);
CpVec.insert(CpVec.end(), CpVec2.begin(), CpVec2.end()); CpVec.insert(CpVec.end(), CpVec2.begin(), CpVec2.end());
} }
@ -219,7 +169,7 @@ InsertCode4AllPhisInMeth(Function *F, TargetMachine &target)
} }
vector<MachineInstr*> mvec; vector<MachineInstr*> mvec;
target.getRegInfo().cpValue2Value(PhiCpRes, PN, mvec); Target.getRegInfo().cpValue2Value(PhiCpRes, PN, mvec);
// get an iterator to machine instructions in the BB // get an iterator to machine instructions in the BB
MachineCodeForBasicBlock& bbMvec = MachineCodeForBasicBlock::get(BB); MachineCodeForBasicBlock& bbMvec = MachineCodeForBasicBlock::get(BB);
@ -229,36 +179,36 @@ InsertCode4AllPhisInMeth(Function *F, TargetMachine &target)
} // for all BBs in function } // for all BBs in function
} }
//-------------------------------------------------------------------------
// Thid method inserts a copy instruction to a predecessor BB as a result
// of phi elimination.
//-------------------------------------------------------------------------
//--------------------------------------------------------------------------- void
// Function PostprocessMachineCodeForTree InstructionSelection::InsertPhiElimInstructions(BasicBlock *BB,
// const std::vector<MachineInstr*>& CpVec)
// Apply any final cleanups to machine code for the root of a subtree {
// after selection for all its children has been completed. Instruction *TermInst = (Instruction*)BB->getTerminator();
//--------------------------------------------------------------------------- MachineCodeForInstruction &MC4Term = MachineCodeForInstruction::get(TermInst);
MachineInstr *FirstMIOfTerm = MC4Term.front();
assert (FirstMIOfTerm && "No Machine Instrs for terminator");
MachineCodeForBasicBlock &bbMvec = MachineCodeForBasicBlock::get(BB);
static void // find the position of first machine instruction generated by the
PostprocessMachineCodeForTree(InstructionNode* instrNode, // terminator of this BB
int ruleForNode, MachineCodeForBasicBlock::iterator MCIt =
short* nts, std::find(bbMvec.begin(), bbMvec.end(), FirstMIOfTerm);
TargetMachine &target)
{ assert( MCIt != bbMvec.end() && "Start inst of terminator not found");
// Fix up any constant operands in the machine instructions to either
// use an immediate field or to load the constant into a register // insert the copy instructions just before the first machine instruction
// Walk backwards and use direct indexes to allow insertion before current // generated for the terminator
// bbMvec.insert(MCIt, CpVec.begin(), CpVec.end());
Instruction* vmInstr = instrNode->getInstruction();
MachineCodeForInstruction &mvec = MachineCodeForInstruction::get(vmInstr);
for (int i = (int) mvec.size()-1; i >= 0; i--)
{
std::vector<MachineInstr*> loadConstVec =
FixConstantOperandsForInstr(vmInstr, mvec[i], target);
if (loadConstVec.size() > 0)
mvec.insert(mvec.begin()+i, loadConstVec.begin(), loadConstVec.end());
}
} }
//--------------------------------------------------------------------------- //---------------------------------------------------------------------------
// Function SelectInstructionsForTree // Function SelectInstructionsForTree
// //
@ -275,20 +225,18 @@ PostprocessMachineCodeForTree(InstructionNode* instrNode,
// may be used by multiple instructions). // may be used by multiple instructions).
//--------------------------------------------------------------------------- //---------------------------------------------------------------------------
bool void
SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt, InstructionSelection::SelectInstructionsForTree(InstrTreeNode* treeRoot,
TargetMachine &target) int goalnt)
{ {
// Get the rule that matches this node. // Get the rule that matches this node.
// //
int ruleForNode = burm_rule(treeRoot->state, goalnt); int ruleForNode = burm_rule(treeRoot->state, goalnt);
if (ruleForNode == 0) if (ruleForNode == 0) {
{ cerr << "Could not match instruction tree for instr selection\n";
cerr << "Could not match instruction tree for instr selection\n"; abort();
assert(0); }
return true;
}
// Get this rule's non-terminals and the corresponding child nodes (if any) // Get this rule's non-terminals and the corresponding child nodes (if any)
// //
@ -305,7 +253,7 @@ SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt,
InstructionNode* instrNode = (InstructionNode*)treeRoot; InstructionNode* instrNode = (InstructionNode*)treeRoot;
assert(instrNode->getNodeType() == InstrTreeNode::NTInstructionNode); assert(instrNode->getNodeType() == InstrTreeNode::NTInstructionNode);
GetInstructionsByRule(instrNode, ruleForNode, nts, target, minstrVec); GetInstructionsByRule(instrNode, ruleForNode, nts, Target, minstrVec);
MachineCodeForInstruction &mvec = MachineCodeForInstruction &mvec =
MachineCodeForInstruction::get(instrNode->getInstruction()); MachineCodeForInstruction::get(instrNode->getInstruction());
@ -333,16 +281,13 @@ SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt,
// Now we have the first non-chain rule so we have found // Now we have the first non-chain rule so we have found
// the actual child nodes. Recursively compile them. // the actual child nodes. Recursively compile them.
// //
for (int i = 0; nts[i]; i++) for (unsigned i = 0; nts[i]; i++)
{ {
assert(i < 2); assert(i < 2);
InstrTreeNode::InstrTreeNodeType nodeType = kids[i]->getNodeType(); InstrTreeNode::InstrTreeNodeType nodeType = kids[i]->getNodeType();
if (nodeType == InstrTreeNode::NTVRegListNode || if (nodeType == InstrTreeNode::NTVRegListNode ||
nodeType == InstrTreeNode::NTInstructionNode) nodeType == InstrTreeNode::NTInstructionNode)
{ SelectInstructionsForTree(kids[i], nts[i]);
if (SelectInstructionsForTree(kids[i], nts[i], target))
return true; // failure
}
} }
} }
@ -350,11 +295,43 @@ SelectInstructionsForTree(InstrTreeNode* treeRoot, int goalnt,
// have been translated // have been translated
// //
if (treeRoot->opLabel != VRegListOp) if (treeRoot->opLabel != VRegListOp)
{ PostprocessMachineCodeForTree((InstructionNode*)treeRoot, ruleForNode, nts);
InstructionNode* instrNode = (InstructionNode*)treeRoot; }
PostprocessMachineCodeForTree(instrNode, ruleForNode, nts, target);
} //---------------------------------------------------------------------------
// Function PostprocessMachineCodeForTree
return false; // success //
// Apply any final cleanups to machine code for the root of a subtree
// after selection for all its children has been completed.
//
void
InstructionSelection::PostprocessMachineCodeForTree(InstructionNode* instrNode,
int ruleForNode,
short* nts)
{
// Fix up any constant operands in the machine instructions to either
// use an immediate field or to load the constant into a register
// Walk backwards and use direct indexes to allow insertion before current
//
Instruction* vmInstr = instrNode->getInstruction();
MachineCodeForInstruction &mvec = MachineCodeForInstruction::get(vmInstr);
for (int i = (int) mvec.size()-1; i >= 0; i--)
{
std::vector<MachineInstr*> loadConstVec =
FixConstantOperandsForInstr(vmInstr, mvec[i], Target);
if (loadConstVec.size() > 0)
mvec.insert(mvec.begin()+i, loadConstVec.begin(), loadConstVec.end());
}
}
//===----------------------------------------------------------------------===//
// createInstructionSelectionPass - Public entrypoint for instruction selection
// and this file as a whole...
//
Pass *createInstructionSelectionPass(TargetMachine &T) {
return new InstructionSelection(T);
} }