Lines Matching refs:Blocks
165 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() argument
170 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
175 Blocks[BlockID] = this; in topologicalSort()
189 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort() argument
196 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
198 ID = Pred->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
199 assert(static_cast<size_t>(ID) < Blocks.size()); in topologicalFinalSort()
201 Blocks[BlockID] = this; in topologicalFinalSort()
262 for (auto *Block : Blocks) in renumberInstrs()
292 unsigned NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
295 for (unsigned I = NumUnreachableBlocks, E = Blocks.size(); I < E; ++I) { in computeNormalForm()
297 Blocks[NI] = Blocks[I]; in computeNormalForm()
298 Blocks[NI]->BlockID = NI; in computeNormalForm()
301 Blocks.drop(NumUnreachableBlocks); in computeNormalForm()
305 for (auto *Block : Blocks) in computeNormalForm()
309 unsigned NumBlocks = Exit->topologicalFinalSort(Blocks, 0); in computeNormalForm()
310 assert(static_cast<size_t>(NumBlocks) == Blocks.size()); in computeNormalForm()
318 for (auto *Block : Blocks.reverse()) { in computeNormalForm()
324 for (auto *Block : Blocks) { in computeNormalForm()
329 for (auto *Block : Blocks.reverse()) { in computeNormalForm()