Lines Matching refs:Blocks
166 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() argument
171 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
176 Blocks[BlockID] = this; in topologicalSort()
190 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort() argument
197 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
199 ID = Pred->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
200 assert(static_cast<size_t>(ID) < Blocks.size()); in topologicalFinalSort()
202 Blocks[BlockID] = this; in topologicalFinalSort()
263 for (auto *Block : Blocks) in renumberInstrs()
293 unsigned NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
296 for (unsigned I = NumUnreachableBlocks, E = Blocks.size(); I < E; ++I) { in computeNormalForm()
298 Blocks[NI] = Blocks[I]; in computeNormalForm()
299 Blocks[NI]->BlockID = NI; in computeNormalForm()
302 Blocks.drop(NumUnreachableBlocks); in computeNormalForm()
306 for (auto *Block : Blocks) in computeNormalForm()
310 unsigned NumBlocks = Exit->topologicalFinalSort(Blocks, 0); in computeNormalForm()
311 assert(static_cast<size_t>(NumBlocks) == Blocks.size()); in computeNormalForm()
319 for (auto *Block : Blocks.reverse()) { in computeNormalForm()
325 for (auto *Block : Blocks) { in computeNormalForm()
330 for (auto *Block : Blocks.reverse()) { in computeNormalForm()