Searched refs:InEdges (Results 1 – 2 of 2) sorted by relevance
783 Edge *InEdges{nullptr}; // Created and managed by \p Graph member877 SpanningTreeNodes[I].InEdges = in Graph()896 E = &CFGNodes[Dst].InEdges[CFGNodes[Dst].NumInEdges++]; in Graph()909 .InEdges[SpanningTreeNodes[Dst].NumInEdges++]; in Graph()925 if (SpanningTreeNodes[I].InEdges) in ~Graph()926 Alloc.deallocate(SpanningTreeNodes[I].InEdges); in ~Graph()929 if (CFGNodes[I].InEdges) in ~Graph()930 Alloc.deallocate(CFGNodes[I].InEdges); in ~Graph()946 reportNumber(" ", N->InEdges[J].Node, 10); in dump()958 reportNumber(" ", N->InEdges[J].Node, 10); in dump()[all …]
955 DirectEdges InEdges; member984 InEdges.push_back(E); in addInEdge()1170 if (DestInfo.CountValid && DestInfo.InEdges.size() == 1) in setInstrumentedCounts()1322 Count->CountValue = sumEdgeCount(Count->InEdges); in populateCounters()1341 uint64_t InSum = sumEdgeCount(Count->InEdges); in populateCounters()1344 setEdgeCount(Count->InEdges, Total); in populateCounters()