From c4a35ed88f36c86159ee72f61edbb5024d8103ca Mon Sep 17 00:00:00 2001 From: Taewook Oh Date: Thu, 26 Jan 2017 04:32:40 +0000 Subject: [PATCH] test commit git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@293148 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Transforms/Scalar/ADCE.cpp | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/lib/Transforms/Scalar/ADCE.cpp b/lib/Transforms/Scalar/ADCE.cpp index 5b2fb7e7a0b..ec0c39a859e 100644 --- a/lib/Transforms/Scalar/ADCE.cpp +++ b/lib/Transforms/Scalar/ADCE.cpp @@ -234,7 +234,7 @@ void AggressiveDeadCodeElimination::initialize() { return Iter != end() && Iter->second; } } State; - + State.reserve(F.size()); // Iterate over blocks in depth-first pre-order and // treat all edges to a block already seen as loop back edges @@ -594,12 +594,12 @@ void AggressiveDeadCodeElimination::updateDeadRegions() { // reverse top-sort order void AggressiveDeadCodeElimination::computeReversePostOrder() { - + // This provides a post-order numbering of the reverse conrtol flow graph // Note that it is incomplete in the presence of infinite loops but we don't // need numbers blocks which don't reach the end of the functions since // all branches in those blocks are forced live. - + // For each block without successors, extend the DFS from the bloack // backward through the graph SmallPtrSet Visited; @@ -681,3 +681,4 @@ INITIALIZE_PASS_END(ADCELegacyPass, "adce", "Aggressive Dead Code Elimination", false, false) FunctionPass *llvm::createAggressiveDCEPass() { return new ADCELegacyPass(); } + -- 2.40.0