本文整理汇总了C++中BasicBlock::getDfNum方法的典型用法代码示例。如果您正苦于以下问题：C++ BasicBlock::getDfNum方法的具体用法？C++ BasicBlock::getDfNum怎么用？C++ BasicBlock::getDfNum使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BasicBlock的用法示例。
在下文中一共展示了BasicBlock::getDfNum方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: linearizeCfgImpl
void BottomUpLayout::linearizeCfgImpl() {
assert(irManager->getFlowGraph()->isEdgeProfileConsistent());
StlVector<Edge*> sortedEdges(mm);
const Nodes& nodes = irManager->getFlowGraph()->getNodes();
sortedEdges.reserve(nodes.size() * 3);
for (Nodes::const_iterator it = nodes.begin(), end = nodes.end(); it!=end; ++it) {
Node* node = *it;
const Edges& edges = node->getOutEdges();
sortedEdges.insert(sortedEdges.end(), edges.begin(), edges.end());
}
//GCC 3.4 passes NULLs to comparator if usual std::sort is used here..
std::stable_sort(sortedEdges.begin(), sortedEdges.end(), edge_comparator());
for(StlVector<Edge*>::const_iterator it = sortedEdges.begin(), itEnd = sortedEdges.end(); it!=itEnd; it++) {
Edge* edge = *it;
layoutEdge(edge);
}
//create one-block-chains from blocks that was not laid out
//these blocks are dispatch successors or are blocks connected by in/out edges to already laid out chains
for (Nodes::const_iterator it = nodes.begin(), end = nodes.end(); it!=end; ++it) {
Node* node = *it;
if (node->isBlockNode()) {
BasicBlock* block = (BasicBlock*)node;
if (block->getLayoutSucc() == NULL && !lastInChain[block->getDfNum()]) {
firstInChain[block->getDfNum()] = true;
lastInChain[block->getDfNum()] = true;
}
}
}
combineChains();
}示例2: layoutEdge
void BottomUpLayout::layoutEdge(Edge *edge) {
Node* tailNode = edge->getSourceNode();
Node* headNode = edge->getTargetNode();
if (!headNode->isBlockNode() || !tailNode->isBlockNode()) {
return;
}
if (headNode == irManager->getFlowGraph()->getEntryNode()) { //prolog node should be first in layout
return;
}
if (tailNode == headNode) {
return; //backedge to self
}
BasicBlock* tailBlock = (BasicBlock*)tailNode;
if (tailBlock->getLayoutSucc()!=NULL) {
return; //tailBlock is layout predecessor for another successor
}
BasicBlock* headBlock = (BasicBlock*)headNode;
if (prevInLayoutBySuccessorId[headBlock->getDfNum()]!=NULL) {
return; // head was already laid out (in other chain)
}
if (lastInChain[tailBlock->getDfNum()] && firstInChain[headBlock->getDfNum()]) {
BasicBlock* tailOfHeadChain = headBlock;
while (tailOfHeadChain->getLayoutSucc()!=NULL) {
tailOfHeadChain = tailOfHeadChain->getLayoutSucc();
}
if (tailOfHeadChain == tailBlock) {
return; // layout must be acyclic
}
}
tailBlock->setLayoutSucc(headBlock);
prevInLayoutBySuccessorId[headBlock->getDfNum()] = tailBlock;
BasicBlock* tailPred = prevInLayoutBySuccessorId[tailBlock->getDfNum()];
if (tailPred) {
assert(lastInChain[tailBlock->getDfNum()]);
lastInChain[tailBlock->getDfNum()] = false;
} else {
firstInChain[tailBlock->getDfNum()] = true;
}// here we have valid first
firstInChain[headBlock->getDfNum()] = false;
BasicBlock* newLast = headBlock;
while (newLast->getLayoutSucc()!=NULL) {
newLast = newLast->getLayoutSucc();
}
lastInChain[newLast->getDfNum()] = true;
}