HomeSort by: relevance | last modified time | path
    Searched refs:Covered (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/tools/llvm-cov/
CoverageSummaryInfo.h 25 size_t Covered;
31 RegionCoverageInfo() : Covered(0), NumRegions(0) {}
33 RegionCoverageInfo(size_t Covered, size_t NumRegions)
34 : Covered(Covered), NumRegions(NumRegions) {
35 assert(Covered <= NumRegions && "Covered regions over-counted");
39 Covered += RHS.Covered;
45 Covered = std::max(Covered, RHS.Covered)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachineInstrBundle.cpp 332 bool Covered = TRI->isSuperRegisterEq(Reg, MOReg);
335 if (Covered) {
342 if (Covered)
RDFLiveness.cpp 85 // covered by the defs in the list (see FullChain).
250 // not covered by previously added defs). Check the defs individually,
251 // i.e. first check each def if is covered or not (without adding them
257 // covered if we added A first, and A would be covered
278 // Add phi defs even if they are covered by subsequent defs. This is
279 // for cases where the reached use is not covered by any of the defs
283 // phi d1<R3>(,d2,), ... Phi def d1 is covered by d2.
423 // If the original register is already covered by all the intervening
447 // If this def is already covered, it cannot reach anything new
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/
DWARFVerifier.cpp 72 bool Covered = I1->LowPC <= R.LowPC;
73 if (R.LowPC == R.HighPC || (Covered && R.HighPC <= I1->HighPC)) {
79 if (!Covered)
1015 warn() << formatv("CU @ {0:x} not covered by any Name Index\n", KV.first);
1067 // table is covered in the loop below.
1083 "are not covered by the hash table.\n",
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
RegisterInfoEmitter.cpp 1590 BitVector Covered = RegBank.computeCoveredRegisters(*Regs);
1598 Covered |= RegBank.computeCoveredRegisters(
1604 printBitVectorAsHex(OS, Covered, 32);

Completed in 19 milliseconds