1 //===-- BlockCoverageInference.cpp - Minimal Execution Coverage -*- C++ -*-===//
10 // be instrumented. We call these nodes ambiguous because knowing the coverage
11 // of all remaining nodes is not enough to infer their coverage status.
19 // coverage from the coverage of its predecessors, or if condition 2 fails, we
20 // can infer v’s coverage from the coverage of its successors.
41 #define DEBUG_TYPE "pgo-block-coverage"
48           "Number of basic blocks instrumented for coverage");
167     // infer coverage from.  in findDependencies()
253   const DenseMap<const BasicBlock *, bool> *Coverage;  member in llvm::DotFuncBCIInfo
257                  const DenseMap<const BasicBlock *, bool> *Coverage)  in DotFuncBCIInfo()  argument
258       : BCI(BCI), Coverage(Coverage) {}  in DotFuncBCIInfo()
267     return Coverage && Coverage->lookup(BB);  in isCovered()
333     const DenseMap<const BasicBlock *, bool> *Coverage) const {  in viewBlockCoverageGraph()
334   DotFuncBCIInfo Info(this, Coverage);  in viewBlockCoverageGraph()
336              "Block Coverage Inference for " + F.getName());  in viewBlockCoverageGraph()
340   OS << "Minimal block coverage for function \'" << F.getName()  in dump()