2 //***************************************************************************
7 // Scheduling graph based on SSA graph plus extra dependence edges
8 // capturing dependences due to machine resources (machine registers,
9 // CC registers, and any others).
12 // 7/20/01 - Vikram Adve - Created
13 //**************************************************************************/
15 #include "SchedGraph.h"
16 #include "llvm/InstrTypes.h"
17 #include "llvm/Instruction.h"
18 #include "llvm/BasicBlock.h"
19 #include "llvm/Method.h"
20 #include "llvm/CodeGen/MachineInstr.h"
21 #include "llvm/Target/MachineInstrInfo.h"
22 #include "llvm/Target/MachineRegInfo.h"
23 #include "llvm/Support/StringExtras.h"
24 #include "llvm/iOther.h"
28 //*********************** Internal Data Structures *************************/
30 typedef vector< pair<SchedGraphNode*, unsigned int> > RefVec;
32 // The following needs to be a class, not a typedef, so we can use
33 // an opaque declaration in SchedGraph.h
34 class RegToRefVecMap: public hash_map<int, RefVec> {
35 typedef hash_map<int, RefVec>:: iterator iterator;
36 typedef hash_map<int, RefVec>::const_iterator const_iterator;
40 // class SchedGraphEdge
44 SchedGraphEdge::SchedGraphEdge(SchedGraphNode* _src,
45 SchedGraphNode* _sink,
46 SchedGraphEdgeDepType _depType,
47 DataDepOrderType _depOrderType,
52 depOrderType(_depOrderType),
54 minDelay((_minDelay >= 0)? _minDelay : _src->getLatency())
56 src->addOutEdge(this);
57 sink->addInEdge(this);
62 SchedGraphEdge::SchedGraphEdge(SchedGraphNode* _src,
63 SchedGraphNode* _sink,
65 DataDepOrderType _depOrderType,
70 depOrderType(_depOrderType),
72 minDelay((_minDelay >= 0)? _minDelay : _src->getLatency())
74 src->addOutEdge(this);
75 sink->addInEdge(this);
80 SchedGraphEdge::SchedGraphEdge(SchedGraphNode* _src,
81 SchedGraphNode* _sink,
83 DataDepOrderType _depOrderType,
87 depType(MachineRegister),
88 depOrderType(_depOrderType),
89 minDelay((_minDelay >= 0)? _minDelay : _src->getLatency()),
90 machineRegNum(_regNum)
92 src->addOutEdge(this);
93 sink->addInEdge(this);
98 SchedGraphEdge::SchedGraphEdge(SchedGraphNode* _src,
99 SchedGraphNode* _sink,
100 ResourceId _resourceId,
104 depType(MachineResource),
105 depOrderType(NonDataDep),
106 minDelay((_minDelay >= 0)? _minDelay : _src->getLatency()),
107 resourceId(_resourceId)
109 src->addOutEdge(this);
110 sink->addInEdge(this);
114 SchedGraphEdge::~SchedGraphEdge()
118 void SchedGraphEdge::dump(int indent=0) const {
119 printIndent(indent); cout << *this;
124 // class SchedGraphNode
128 SchedGraphNode::SchedGraphNode(unsigned int _nodeId,
129 const Instruction* _instr,
130 const MachineInstr* _minstr,
131 const TargetMachine& target)
139 MachineOpCode mopCode = minstr->getOpCode();
140 latency = target.getInstrInfo().hasResultInterlock(mopCode)
141 ? target.getInstrInfo().minLatency(mopCode)
142 : target.getInstrInfo().maxLatency(mopCode);
148 SchedGraphNode::~SchedGraphNode()
152 void SchedGraphNode::dump(int indent=0) const {
153 printIndent(indent); cout << *this;
158 SchedGraphNode::addInEdge(SchedGraphEdge* edge)
160 inEdges.push_back(edge);
165 SchedGraphNode::addOutEdge(SchedGraphEdge* edge)
167 outEdges.push_back(edge);
171 SchedGraphNode::removeInEdge(const SchedGraphEdge* edge)
173 assert(edge->getSink() == this);
175 for (iterator I = beginInEdges(); I != endInEdges(); ++I)
184 SchedGraphNode::removeOutEdge(const SchedGraphEdge* edge)
186 assert(edge->getSrc() == this);
188 for (iterator I = beginOutEdges(); I != endOutEdges(); ++I)
203 SchedGraph::SchedGraph(const BasicBlock* bb,
204 const TargetMachine& target)
207 this->buildGraph(target);
212 SchedGraph::~SchedGraph()
214 for (iterator I=begin(); I != end(); ++I)
216 SchedGraphNode* node = (*I).second;
218 // for each node, delete its out-edges
219 for (SchedGraphNode::iterator I = node->beginOutEdges();
220 I != node->endOutEdges(); ++I)
223 // then delete the node itself.
230 SchedGraph::dump() const
232 cout << " Sched Graph for Basic Blocks: ";
233 for (unsigned i=0, N=bbVec.size(); i < N; i++)
235 cout << (bbVec[i]->hasName()? bbVec[i]->getName() : "block")
236 << " (" << bbVec[i] << ")"
237 << ((i == N-1)? "" : ", ");
240 cout << endl << endl << " Actual Root nodes : ";
241 for (unsigned i=0, N=graphRoot->outEdges.size(); i < N; i++)
242 cout << graphRoot->outEdges[i]->getSink()->getNodeId()
243 << ((i == N-1)? "" : ", ");
245 cout << endl << " Graph Nodes:" << endl;
246 for (const_iterator I=begin(); I != end(); ++I)
247 cout << endl << * (*I).second;
254 SchedGraph::eraseIncomingEdges(SchedGraphNode* node, bool addDummyEdges)
256 // Delete and disconnect all in-edges for the node
257 for (SchedGraphNode::iterator I = node->beginInEdges();
258 I != node->endInEdges(); ++I)
260 SchedGraphNode* srcNode = (*I)->getSrc();
261 srcNode->removeOutEdge(*I);
265 srcNode != getRoot() &&
266 srcNode->beginOutEdges() == srcNode->endOutEdges())
267 { // srcNode has no more out edges, so add an edge to dummy EXIT node
268 assert(node != getLeaf() && "Adding edge that was just removed?");
269 (void) new SchedGraphEdge(srcNode, getLeaf(),
270 SchedGraphEdge::CtrlDep, SchedGraphEdge::NonDataDep, 0);
274 node->inEdges.clear();
278 SchedGraph::eraseOutgoingEdges(SchedGraphNode* node, bool addDummyEdges)
280 // Delete and disconnect all out-edges for the node
281 for (SchedGraphNode::iterator I = node->beginOutEdges();
282 I != node->endOutEdges(); ++I)
284 SchedGraphNode* sinkNode = (*I)->getSink();
285 sinkNode->removeInEdge(*I);
289 sinkNode != getLeaf() &&
290 sinkNode->beginInEdges() == sinkNode->endInEdges())
291 { //sinkNode has no more in edges, so add an edge from dummy ENTRY node
292 assert(node != getRoot() && "Adding edge that was just removed?");
293 (void) new SchedGraphEdge(getRoot(), sinkNode,
294 SchedGraphEdge::CtrlDep, SchedGraphEdge::NonDataDep, 0);
298 node->outEdges.clear();
302 SchedGraph::eraseIncidentEdges(SchedGraphNode* node, bool addDummyEdges)
304 this->eraseIncomingEdges(node, addDummyEdges);
305 this->eraseOutgoingEdges(node, addDummyEdges);
310 SchedGraph::addDummyEdges()
312 assert(graphRoot->outEdges.size() == 0);
314 for (const_iterator I=begin(); I != end(); ++I)
316 SchedGraphNode* node = (*I).second;
317 assert(node != graphRoot && node != graphLeaf);
318 if (node->beginInEdges() == node->endInEdges())
319 (void) new SchedGraphEdge(graphRoot, node, SchedGraphEdge::CtrlDep,
320 SchedGraphEdge::NonDataDep, 0);
321 if (node->beginOutEdges() == node->endOutEdges())
322 (void) new SchedGraphEdge(node, graphLeaf, SchedGraphEdge::CtrlDep,
323 SchedGraphEdge::NonDataDep, 0);
329 SchedGraph::addCDEdges(const TerminatorInst* term,
330 const TargetMachine& target)
332 const MachineInstrInfo& mii = target.getInstrInfo();
333 MachineCodeForVMInstr& termMvec = term->getMachineInstrVec();
335 // Find the first branch instr in the sequence of machine instrs for term
338 while (! mii.isBranch(termMvec[first]->getOpCode()))
340 assert(first < termMvec.size() &&
341 "No branch instructions for BR? Ok, but weird! Delete assertion.");
342 if (first == termMvec.size())
345 SchedGraphNode* firstBrNode = this->getGraphNodeForInstr(termMvec[first]);
347 // Add CD edges from each instruction in the sequence to the
348 // *last preceding* branch instr. in the sequence
350 for (int i = (int) termMvec.size()-1; i > (int) first; i--)
352 SchedGraphNode* toNode = this->getGraphNodeForInstr(termMvec[i]);
353 assert(toNode && "No node for instr generated for branch?");
355 for (int j = i-1; j >= 0; j--)
356 if (mii.isBranch(termMvec[j]->getOpCode()))
358 SchedGraphNode* brNode = this->getGraphNodeForInstr(termMvec[j]);
359 assert(brNode && "No node for instr generated for branch?");
360 (void) new SchedGraphEdge(brNode, toNode, SchedGraphEdge::CtrlDep,
361 SchedGraphEdge::NonDataDep, 0);
362 break; // only one incoming edge is enough
366 // Add CD edges from each instruction preceding the first branch
367 // to the first branch
369 for (int i = first-1; i >= 0; i--)
371 SchedGraphNode* fromNode = this->getGraphNodeForInstr(termMvec[i]);
372 assert(fromNode && "No node for instr generated for branch?");
373 (void) new SchedGraphEdge(fromNode, firstBrNode, SchedGraphEdge::CtrlDep,
374 SchedGraphEdge::NonDataDep, 0);
377 // Now add CD edges to the first branch instruction in the sequence
378 // from all preceding instructions in the basic block.
380 const BasicBlock* bb = term->getParent();
381 for (BasicBlock::const_iterator II = bb->begin(); II != bb->end(); ++II)
383 if ((*II) == (const Instruction*) term) // special case, handled above
386 assert(! (*II)->isTerminator() && "Two terminators in basic block?");
388 const MachineCodeForVMInstr& mvec = (*II)->getMachineInstrVec();
389 for (unsigned i=0, N=mvec.size(); i < N; i++)
391 SchedGraphNode* fromNode = this->getGraphNodeForInstr(mvec[i]);
392 if (fromNode == NULL)
393 continue; // dummy instruction, e.g., PHI
395 (void) new SchedGraphEdge(fromNode, firstBrNode,
396 SchedGraphEdge::CtrlDep,
397 SchedGraphEdge::NonDataDep, 0);
399 // If we find any other machine instructions (other than due to
400 // the terminator) that also have delay slots, add an outgoing edge
401 // from the instruction to the instructions in the delay slots.
403 unsigned d = mii.getNumDelaySlots(mvec[i]->getOpCode());
404 assert(i+d < N && "Insufficient delay slots for instruction?");
406 for (unsigned j=1; j <= d; j++)
408 SchedGraphNode* toNode = this->getGraphNodeForInstr(mvec[i+j]);
409 assert(toNode && "No node for machine instr in delay slot?");
410 (void) new SchedGraphEdge(fromNode, toNode,
411 SchedGraphEdge::CtrlDep,
412 SchedGraphEdge::NonDataDep, 0);
420 SchedGraph::addMemEdges(const vector<const Instruction*>& memVec,
421 const TargetMachine& target)
423 const MachineInstrInfo& mii = target.getInstrInfo();
425 for (unsigned im=0, NM=memVec.size(); im < NM; im++)
427 const Instruction* fromInstr = memVec[im];
428 bool fromIsLoad = fromInstr->getOpcode() == Instruction::Load;
430 for (unsigned jm=im+1; jm < NM; jm++)
432 const Instruction* toInstr = memVec[jm];
433 bool toIsLoad = toInstr->getOpcode() == Instruction::Load;
434 SchedGraphEdge::DataDepOrderType depOrderType;
438 if (toIsLoad) continue; // both instructions are loads
439 depOrderType = SchedGraphEdge::AntiDep;
443 depOrderType = (toIsLoad)? SchedGraphEdge::TrueDep
444 : SchedGraphEdge::OutputDep;
447 MachineCodeForVMInstr& fromInstrMvec=fromInstr->getMachineInstrVec();
448 MachineCodeForVMInstr& toInstrMvec = toInstr->getMachineInstrVec();
450 // We have two VM memory instructions, and at least one is a store.
451 // Add edges between all machine load/store instructions.
453 for (unsigned i=0, N=fromInstrMvec.size(); i < N; i++)
455 MachineOpCode fromOpCode = fromInstrMvec[i]->getOpCode();
456 if (mii.isLoad(fromOpCode) || mii.isStore(fromOpCode))
458 SchedGraphNode* fromNode =
459 this->getGraphNodeForInstr(fromInstrMvec[i]);
460 assert(fromNode && "No node for memory instr?");
462 for (unsigned j=0, M=toInstrMvec.size(); j < M; j++)
464 MachineOpCode toOpCode = toInstrMvec[j]->getOpCode();
465 if (mii.isLoad(toOpCode) || mii.isStore(toOpCode))
467 SchedGraphNode* toNode =
468 this->getGraphNodeForInstr(toInstrMvec[j]);
469 assert(toNode && "No node for memory instr?");
471 (void) new SchedGraphEdge(fromNode, toNode,
472 SchedGraphEdge::MemoryDep,
484 SchedGraph::addMachineRegEdges(RegToRefVecMap& regToRefVecMap,
485 const TargetMachine& target)
487 assert(bbVec.size() == 1 && "Only handling a single basic block here");
489 // This assumes that such hardwired registers are never allocated
490 // to any LLVM value (since register allocation happens later), i.e.,
491 // any uses or defs of this register have been made explicit!
492 // Also assumes that two registers with different numbers are
495 for (RegToRefVecMap::iterator I = regToRefVecMap.begin();
496 I != regToRefVecMap.end(); ++I)
498 int regNum = (*I).first;
499 RefVec& regRefVec = (*I).second;
501 // regRefVec is ordered by control flow order in the basic block
502 for (unsigned i=0; i < regRefVec.size(); ++i)
504 SchedGraphNode* node = regRefVec[i].first;
505 unsigned int opNum = regRefVec[i].second;
506 bool isDef = node->getMachineInstr()->operandIsDefined(opNum);
508 for (unsigned p=0; p < i; ++p)
510 SchedGraphNode* prevNode = regRefVec[p].first;
511 if (prevNode != node)
513 unsigned int prevOpNum = regRefVec[p].second;
515 prevNode->getMachineInstr()->operandIsDefined(prevOpNum);
518 new SchedGraphEdge(prevNode, node, regNum,
519 (prevIsDef)? SchedGraphEdge::OutputDep
520 : SchedGraphEdge::AntiDep);
522 new SchedGraphEdge(prevNode, node, regNum,
523 SchedGraphEdge::TrueDep);
532 CreateSSAEdge(SchedGraph* graph,
533 MachineInstr* defInstr,
534 SchedGraphNode* node,
537 // this instruction does define value `val'.
538 // if there is a node for it in the same graph, add an edge.
539 SchedGraphNode* defNode = graph->getGraphNodeForInstr(defInstr);
540 if (defNode != NULL && defNode != node)
541 (void) new SchedGraphEdge(defNode, node, val);
546 SchedGraph::addSSAEdge(SchedGraphNode* node,
548 const TargetMachine& target)
550 if (!isa<Instruction>(val)) return;
552 const Instruction* thisVMInstr = node->getInstr();
553 const Instruction* defVMInstr = cast<const Instruction>(val);
555 // Phi instructions are the only ones that produce a value but don't get
556 // any non-dummy machine instructions. Return here as an optimization.
558 if (isa<PHINode>(defVMInstr))
561 // Now add the graph edge for the appropriate machine instruction(s).
562 // Note that multiple machine instructions generated for the
563 // def VM instruction may modify the register for the def value.
565 MachineCodeForVMInstr& defMvec = defVMInstr->getMachineInstrVec();
566 const MachineInstrInfo& mii = target.getInstrInfo();
568 for (unsigned i=0, N=defMvec.size(); i < N; i++)
570 bool edgeAddedForInstr = false;
572 // First check the explicit operands
573 for (int o=0, N=mii.getNumOperands(defMvec[i]->getOpCode()); o < N; o++)
575 const MachineOperand& defOp = defMvec[i]->getOperand(o);
578 && (defOp.getOperandType() == MachineOperand::MO_VirtualRegister
579 || defOp.getOperandType() == MachineOperand::MO_CCRegister)
580 && (defOp.getVRegValue() == val))
582 CreateSSAEdge(this, defMvec[i], node, val);
583 edgeAddedForInstr = true;
588 // Then check the implicit operands
589 if (! edgeAddedForInstr)
591 for (unsigned o=0, N=defMvec[i]->getNumImplicitRefs(); o < N; ++o)
592 if (defMvec[i]->implicitRefIsDefined(o))
594 CreateSSAEdge(this, defMvec[i], node, val);
595 edgeAddedForInstr = true;
604 SchedGraph::addEdgesForInstruction(const MachineInstr& minstr,
605 RegToRefVecMap& regToRefVecMap,
606 const TargetMachine& target)
608 SchedGraphNode* node = this->getGraphNodeForInstr(&minstr);
612 assert(node->getInstr() && "Should be no dummy nodes here!");
613 const Instruction& instr = * node->getInstr();
615 // Add edges for all operands of the machine instruction.
616 // Also, record all machine register references to add reg. deps. later.
618 for (unsigned i=0, numOps=minstr.getNumOperands(); i < numOps; i++)
620 const MachineOperand& mop = minstr.getOperand(i);
622 // if this writes to a machine register other than the hardwired
623 // "zero" register, record the reference.
624 if (mop.getOperandType() == MachineOperand::MO_MachineRegister
625 && (mop.getMachineRegNum()
626 != (unsigned) target.getRegInfo().getZeroRegNum()))
628 regToRefVecMap[mop.getMachineRegNum()].push_back(make_pair(node, i));
631 // ignore all other def operands
632 if (minstr.operandIsDefined(i))
635 switch(mop.getOperandType())
637 case MachineOperand::MO_VirtualRegister:
638 case MachineOperand::MO_CCRegister:
639 if (mop.getVRegValue())
640 addSSAEdge(node, mop.getVRegValue(), target);
643 case MachineOperand::MO_MachineRegister:
646 case MachineOperand::MO_SignExtendedImmed:
647 case MachineOperand::MO_UnextendedImmed:
648 case MachineOperand::MO_PCRelativeDisp:
649 break; // nothing to do for immediate fields
652 assert(0 && "Unknown machine operand type in SchedGraph builder");
657 // Add edges for values implicitly used by the machine instruction.
658 // Examples include function arguments to a Call instructions or the return
659 // value of a Ret instruction.
661 for (unsigned i=0, N=minstr.getNumImplicitRefs(); i < N; ++i)
662 if (! minstr.implicitRefIsDefined(i))
663 addSSAEdge(node, minstr.getImplicitRef(i), target);
668 SchedGraph::addNonSSAEdgesForValue(const Instruction* instr,
669 const TargetMachine& target)
671 if (isa<PHINode>(instr))
674 MachineCodeForVMInstr& mvec = instr->getMachineInstrVec();
675 const MachineInstrInfo& mii = target.getInstrInfo();
678 for (unsigned i=0, N=mvec.size(); i < N; i++)
679 for (int o=0, N = mii.getNumOperands(mvec[i]->getOpCode()); o < N; o++)
681 const MachineOperand& op = mvec[i]->getOperand(o);
683 if ((op.getOperandType() == MachineOperand::MO_VirtualRegister ||
684 op.getOperandType() == MachineOperand::MO_CCRegister)
685 && op.getVRegValue() == (Value*) instr)
687 // this operand is a definition or use of value `instr'
688 SchedGraphNode* node = this->getGraphNodeForInstr(mvec[i]);
689 assert(node && "No node for machine instruction in this BB?");
690 refVec.push_back(make_pair(node, o));
694 // refVec is ordered by control flow order of the machine instructions
695 for (unsigned i=0; i < refVec.size(); ++i)
697 SchedGraphNode* node = refVec[i].first;
698 unsigned int opNum = refVec[i].second;
699 bool isDef = node->getMachineInstr()->operandIsDefined(opNum);
702 // add output and/or anti deps to this definition
703 for (unsigned p=0; p < i; ++p)
705 SchedGraphNode* prevNode = refVec[p].first;
706 if (prevNode != node)
708 bool prevIsDef = prevNode->getMachineInstr()->
709 operandIsDefined(refVec[p].second);
710 new SchedGraphEdge(prevNode, node, SchedGraphEdge::DefUseDep,
711 (prevIsDef)? SchedGraphEdge::OutputDep
712 : SchedGraphEdge::AntiDep);
720 SchedGraph::buildNodesforVMInstr(const TargetMachine& target,
721 const Instruction* instr)
723 const MachineInstrInfo& mii = target.getInstrInfo();
724 const MachineCodeForVMInstr& mvec = instr->getMachineInstrVec();
725 for (unsigned i=0; i < mvec.size(); i++)
726 if (! mii.isDummyPhiInstr(mvec[i]->getOpCode()))
728 SchedGraphNode* node = new SchedGraphNode(getNumNodes(),
729 instr, mvec[i], target);
730 this->noteGraphNodeForInstr(mvec[i], node);
736 SchedGraph::buildGraph(const TargetMachine& target)
738 const MachineInstrInfo& mii = target.getInstrInfo();
739 const BasicBlock* bb = bbVec[0];
741 assert(bbVec.size() == 1 && "Only handling a single basic block here");
743 // Use this data structures to note all LLVM memory instructions.
744 // We use this to add memory dependence edges without a second full walk.
746 vector<const Instruction*> memVec;
748 // Use this data structures to note any uses or definitions of
749 // machine registers so we can add edges for those later without
750 // extra passes over the nodes.
751 // The vector holds an ordered list of references to the machine reg,
752 // ordered according to control-flow order. This only works for a
753 // single basic block, hence the assertion. Each reference is identified
754 // by the pair: <node, operand-number>.
756 RegToRefVecMap regToRefVecMap;
758 // Make a dummy root node. We'll add edges to the real roots later.
759 graphRoot = new SchedGraphNode(0, NULL, NULL, target);
760 graphLeaf = new SchedGraphNode(1, NULL, NULL, target);
762 //----------------------------------------------------------------
763 // First add nodes for all the machine instructions in the basic block
764 // because this greatly simplifies identifying which edges to add.
765 // Do this one VM instruction at a time since the SchedGraphNode needs that.
766 // Also, remember the load/store instructions to add memory deps later.
767 //----------------------------------------------------------------
769 for (BasicBlock::const_iterator II = bb->begin(); II != bb->end(); ++II)
771 const Instruction *instr = *II;
773 // Build graph nodes for this VM instruction
774 buildNodesforVMInstr(target, instr);
776 // Remember the load/store instructions to add memory deps later.
777 if (instr->getOpcode() == Instruction::Load ||
778 instr->getOpcode() == Instruction::Store)
779 memVec.push_back(instr);
782 //----------------------------------------------------------------
783 // Now add edges for the following (all are incoming edges except (4)):
784 // (1) operands of the machine instruction, including hidden operands
785 // (2) machine register dependences
786 // (3) memory load/store dependences
787 // (3) other resource dependences for the machine instruction, if any
788 // (4) output dependences when multiple machine instructions define the
789 // same value; all must have been generated from a single VM instrn
790 // (5) control dependences to branch instructions generated for the
791 // terminator instruction of the BB. Because of delay slots and
792 // 2-way conditional branches, multiple CD edges are needed
793 // (see addCDEdges for details).
794 // Also, note any uses or defs of machine registers.
796 //----------------------------------------------------------------
798 // First, add edges to the terminator instruction of the basic block.
799 this->addCDEdges(bb->getTerminator(), target);
801 // Then add memory dep edges: store->load, load->store, and store->store
802 this->addMemEdges(memVec, target);
804 // Then add other edges for all instructions in the block.
805 // Do this in machine code order and find all references to machine regs.
806 MachineCodeForBasicBlock& mvec = bb->getMachineInstrVec();
807 for (unsigned i=0, N=mvec.size(); i < N; i++)
808 addEdgesForInstruction(*mvec[i], regToRefVecMap, target);
810 // Since the code is no longer in SSA form, add output dep. edges
811 // between machine instructions that define the same Value, and anti-dep.
812 // edges from those to other machine instructions for the same VM instr.
813 // We assume that all machine instructions that define a value are
814 // generated from the VM instruction corresponding to that value.
816 for (BasicBlock::const_iterator II = bb->begin(); II != bb->end(); ++II)
818 const Instruction *instr = *II;
819 this->addNonSSAEdgesForValue(instr, target);
822 // Then add edges for dependences on machine registers
823 this->addMachineRegEdges(regToRefVecMap, target);
825 // Finally, add edges from the dummy root and to dummy leaf
826 this->addDummyEdges();
831 // class SchedGraphSet
835 SchedGraphSet::SchedGraphSet(const Method* _method,
836 const TargetMachine& target) :
839 buildGraphsForMethod(method, target);
844 SchedGraphSet::~SchedGraphSet()
846 // delete all the graphs
847 for (iterator I=begin(); I != end(); ++I)
853 SchedGraphSet::dump() const
855 cout << "======== Sched graphs for method `"
856 << (method->hasName()? method->getName() : "???")
857 << "' ========" << endl << endl;
859 for (const_iterator I=begin(); I != end(); ++I)
862 cout << endl << "====== End graphs for method `"
863 << (method->hasName()? method->getName() : "")
864 << "' ========" << endl << endl;
869 SchedGraphSet::buildGraphsForMethod(const Method *method,
870 const TargetMachine& target)
872 for (Method::const_iterator BI = method->begin(); BI != method->end(); ++BI)
874 SchedGraph* graph = new SchedGraph(*BI, target);
875 this->noteGraphForBlock(*BI, graph);
882 operator<<(ostream& os, const SchedGraphEdge& edge)
884 os << "edge [" << edge.src->getNodeId() << "] -> ["
885 << edge.sink->getNodeId() << "] : ";
887 switch(edge.depType) {
888 case SchedGraphEdge::CtrlDep: os<< "Control Dep"; break;
889 case SchedGraphEdge::DefUseDep: os<< "Reg Value " << edge.val; break;
890 case SchedGraphEdge::MemoryDep: os<< "Mem Value " << edge.val; break;
891 case SchedGraphEdge::MachineRegister: os<< "Reg " <<edge.machineRegNum;break;
892 case SchedGraphEdge::MachineResource: os<<"Resource "<<edge.resourceId;break;
893 default: assert(0); break;
896 os << " : delay = " << edge.minDelay << endl;
902 operator<<(ostream& os, const SchedGraphNode& node)
905 os << "Node " << node.nodeId << " : "
906 << "latency = " << node.latency << endl;
910 if (node.getMachineInstr() == NULL)
911 os << "(Dummy node)" << endl;
914 os << *node.getMachineInstr() << endl;
917 os << node.inEdges.size() << " Incoming Edges:" << endl;
918 for (unsigned i=0, N=node.inEdges.size(); i < N; i++)
921 os << * node.inEdges[i];
925 os << node.outEdges.size() << " Outgoing Edges:" << endl;
926 for (unsigned i=0, N=node.outEdges.size(); i < N; i++)
929 os << * node.outEdges[i];