168 int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) {  in topologicalSort()  argument
172     ID = Block->topologicalSort(Blocks, ID);  in topologicalSort()
177   Blocks[BlockID] = this;  in topologicalSort()
191 int BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock*>& Blocks, int ID) {  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()
264   for (auto *Block : Blocks)  in renumberInstrs()
296   int NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size());  in computeNormalForm()
299     for (size_t I = NumUnreachableBlocks, E = Blocks.size(); I < E; ++I) {  in computeNormalForm()
301       Blocks[NI] = Blocks[I];  in computeNormalForm()
302       Blocks[NI]->BlockID = NI;  in computeNormalForm()
305     Blocks.drop(NumUnreachableBlocks);  in computeNormalForm()
309   for (auto *Block : Blocks)  in computeNormalForm()
313   int NumBlocks = Exit->topologicalFinalSort(Blocks, 0);  in computeNormalForm()
314   assert(static_cast<size_t>(NumBlocks) == Blocks.size());  in computeNormalForm()
322   for (auto *Block : Blocks.reverse()) {  in computeNormalForm()
328   for (auto *Block : Blocks) {  in computeNormalForm()
333   for (auto *Block : Blocks.reverse()) {  in computeNormalForm()