Searched refs:DstEdges (Results 1 – 4 of 4) sorted by relevance
316 DstEdges(), Lines() {} in GCOVBlock()331 if (DstEdges.size() && DstEdges.back()->Dst.Number > Edge->Dst.Number) in addDstEdge()333 DstEdges.push_back(Edge); in addDstEdge()336 size_t getNumDstEdges() const { return DstEdges.size(); } in getNumDstEdges()345 EdgeIterator dst_begin() const { return DstEdges.begin(); } in dst_begin()346 EdgeIterator dst_end() const { return DstEdges.end(); } in dst_end()360 SmallVector<GCOVEdge *, 16> DstEdges; variable
343 if (DstEdges.size() && DstEdges.back()->Dst.Number > Edge->Dst.Number) in addDstEdge()345 DstEdges.push_back(Edge); in addDstEdge()349 size_t getNumDstEdges() const { return DstEdges.size(); } in getNumDstEdges()358 EdgeIterator dst_begin() const { return DstEdges.begin(); } in dst_begin()359 EdgeIterator dst_end() const { return DstEdges.end(); } in dst_end()374 SmallVector<GCOVEdge *, 16> DstEdges; variable
374 DstEdges.clear(); in ~GCOVBlock()381 assert(DstEdgeNo < DstEdges.size()); // up to caller to ensure EdgeNo is valid in addCount()382 DstEdges[DstEdgeNo]->Count = N; in addCount()384 if (!DstEdges[DstEdgeNo]->Dst.getNumDstEdges()) in addCount()385 DstEdges[DstEdgeNo]->Dst.Counter += N; in addCount()393 std::stable_sort(DstEdges.begin(), DstEdges.end(), SortEdges); in sortDstEdges()413 if (!DstEdges.empty()) { in dump()415 for (const GCOVEdge *Edge : DstEdges) in dump()
386 DstEdges.clear(); in ~GCOVBlock()393 assert(DstEdgeNo < DstEdges.size()); // up to caller to ensure EdgeNo is valid in addCount()394 DstEdges[DstEdgeNo]->Count = N; in addCount()396 if (!DstEdges[DstEdgeNo]->Dst.getNumDstEdges()) in addCount()397 DstEdges[DstEdgeNo]->Dst.Counter += N; in addCount()405 std::stable_sort(DstEdges.begin(), DstEdges.end(), SortEdges); in sortDstEdges()424 if (!DstEdges.empty()) { in print()426 for (const GCOVEdge *Edge : DstEdges) in print()