Searched refs:NumUnreachableBlocks (Results 1 – 1 of 1) sorted by relevance
296 int NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm() local297 if (NumUnreachableBlocks > 0) { in computeNormalForm()299 for (size_t I = NumUnreachableBlocks, E = Blocks.size(); I < E; ++I) { in computeNormalForm()300 size_t NI = I - NumUnreachableBlocks; in computeNormalForm()305 Blocks.drop(NumUnreachableBlocks); in computeNormalForm()