Searched refs:NumEdges (Results 1 – 6 of 6) sorted by relevance
481 uint32_t NumEdges; member571 NumEdges * sizeof(EdgeDescription)); in FunctionDescription()575 NumEdges * sizeof(EdgeDescription)); in FunctionDescription()824 for (int I = 0; I < D.NumEdges; ++I) { in Graph()860 for (int I = 0; I < D.NumEdges; ++I) { in Graph()889 for (int I = 0; I < D.NumEdges; ++I) { in Graph()969 for (int I = 0; I < D.NumEdges; ++I) { in dumpEdgeFreqs()1056 EdgeFreqs = D.NumEdges ? new (Alloc, 0) uint64_t [D.NumEdges] : nullptr; in computeEdgeFrequencies()1114 for (int I = 0; I < D.NumEdges; ++I) { in computeEdgeFrequencies()1239 for (int I = 0; I < F.NumEdges; ++I) { in writeFunctionProfile()[all …]
480 size_t NumEdges = 0; in initialize() local493 NumEdges++; in initialize()521 AllEdges.reserve(NumEdges); in initialize()538 assert(AllEdges.size() <= NumEdges && "Incorrect number of created edges"); in initialize()
303 size_t NumEdges = Last - First; in PrintCoverage() local324 Printf(" edges: %zd/%zd", NumEdges - UncoveredPCs.size(), NumEdges); in PrintCoverage()
908 unsigned NumEdges = llvm::count(successors(Pred), BB); in RenamePass() local909 assert(NumEdges && "Must be at least one edge from Pred to BB!"); in RenamePass()921 for (unsigned i = 0; i != NumEdges; ++i) in RenamePass()
339 auto NumEdges = static_cast<size_type>(AdjList[VI].second.size()); in get() local340 for (size_type VEI = 0; VEI < NumEdges; ++VEI, ++EI) { in get()
788 size_t NumEdges = b->succ.size(); in annotateSource() local789 if (NumEdges > 1) in annotateSource()791 else if (options.UncondBranch && NumEdges == 1) { in annotateSource()