Coverage Report

Created: 2019-07-24 05:18

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/lib/Transforms/Utils/Mem2Reg.cpp
Line
Count
Source
1
//===- Mem2Reg.cpp - The -mem2reg pass, a wrapper around the Utils lib ----===//
2
//
3
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4
// See https://llvm.org/LICENSE.txt for license information.
5
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6
//
7
//===----------------------------------------------------------------------===//
8
//
9
// This pass is a simple pass wrapper around the PromoteMemToReg function call
10
// exposed by the Utils library.
11
//
12
//===----------------------------------------------------------------------===//
13
14
#include "llvm/Transforms/Utils/Mem2Reg.h"
15
#include "llvm/ADT/Statistic.h"
16
#include "llvm/Analysis/AssumptionCache.h"
17
#include "llvm/IR/BasicBlock.h"
18
#include "llvm/IR/Dominators.h"
19
#include "llvm/IR/Function.h"
20
#include "llvm/IR/Instructions.h"
21
#include "llvm/IR/PassManager.h"
22
#include "llvm/Pass.h"
23
#include "llvm/Support/Casting.h"
24
#include "llvm/Transforms/Utils.h"
25
#include "llvm/Transforms/Utils/PromoteMemToReg.h"
26
#include <vector>
27
28
using namespace llvm;
29
30
#define DEBUG_TYPE "mem2reg"
31
32
STATISTIC(NumPromoted, "Number of alloca's promoted");
33
34
static bool promoteMemoryToRegister(Function &F, DominatorTree &DT,
35
472k
                                    AssumptionCache &AC) {
36
472k
  std::vector<AllocaInst *> Allocas;
37
472k
  BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
38
472k
  bool Changed = false;
39
472k
40
479k
  while (
true479k
) {
41
479k
    Allocas.clear();
42
479k
43
479k
    // Find allocas that are safe to promote, by looking at all instructions in
44
479k
    // the entry node
45
3.01M
    for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; 
++I2.53M
)
46
2.53M
      if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) // Is it an alloca?
47
148k
        if (isAllocaPromotable(AI))
48
29.5k
          Allocas.push_back(AI);
49
479k
50
479k
    if (Allocas.empty())
51
472k
      break;
52
6.61k
53
6.61k
    PromoteMemToReg(Allocas, DT, &AC);
54
6.61k
    NumPromoted += Allocas.size();
55
6.61k
    Changed = true;
56
6.61k
  }
57
472k
  return Changed;
58
472k
}
59
60
1.16k
PreservedAnalyses PromotePass::run(Function &F, FunctionAnalysisManager &AM) {
61
1.16k
  auto &DT = AM.getResult<DominatorTreeAnalysis>(F);
62
1.16k
  auto &AC = AM.getResult<AssumptionAnalysis>(F);
63
1.16k
  if (!promoteMemoryToRegister(F, DT, AC))
64
1.16k
    return PreservedAnalyses::all();
65
2
66
2
  PreservedAnalyses PA;
67
2
  PA.preserveSet<CFGAnalyses>();
68
2
  return PA;
69
2
}
70
71
namespace {
72
73
struct PromoteLegacyPass : public FunctionPass {
74
  // Pass identification, replacement for typeid
75
  static char ID;
76
77
13.5k
  PromoteLegacyPass() : FunctionPass(ID) {
78
13.5k
    initializePromoteLegacyPassPass(*PassRegistry::getPassRegistry());
79
13.5k
  }
80
81
  // runOnFunction - To run this pass, first we calculate the alloca
82
  // instructions that are safe for promotion, then we promote each one.
83
471k
  bool runOnFunction(Function &F) override {
84
471k
    if (skipFunction(F))
85
80
      return false;
86
471k
87
471k
    DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
88
471k
    AssumptionCache &AC =
89
471k
        getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F);
90
471k
    return promoteMemoryToRegister(F, DT, AC);
91
471k
  }
92
93
13.5k
  void getAnalysisUsage(AnalysisUsage &AU) const override {
94
13.5k
    AU.addRequired<AssumptionCacheTracker>();
95
13.5k
    AU.addRequired<DominatorTreeWrapperPass>();
96
13.5k
    AU.setPreservesCFG();
97
13.5k
  }
98
};
99
100
} // end anonymous namespace
101
102
char PromoteLegacyPass::ID = 0;
103
104
23.9k
INITIALIZE_PASS_BEGIN(PromoteLegacyPass, "mem2reg", "Promote Memory to "
105
23.9k
                                                    "Register",
106
23.9k
                      false, false)
107
23.9k
INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)
108
23.9k
INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
109
23.9k
INITIALIZE_PASS_END(PromoteLegacyPass, "mem2reg", "Promote Memory to Register",
110
                    false, false)
111
112
// createPromoteMemoryToRegister - Provide an entry point to create this pass.
113
13.4k
FunctionPass *llvm::createPromoteMemoryToRegisterPass() {
114
13.4k
  return new PromoteLegacyPass();
115
13.4k
}