Lines Matching refs:NumOutEdges
782 uint32_t NumOutEdges{0}; // Output edge count used to size OutEdges member
861 CFGNodes[D.Edges[I].FromNode].NumOutEdges++; in Graph()
866 SpanningTreeNodes[D.Edges[I].FromNode].NumOutEdges++; in Graph()
874 if (CFGNodes[I].NumOutEdges > 0) in Graph()
875 CFGNodes[I].OutEdges = new (Alloc) Edge[CFGNodes[I].NumOutEdges]; in Graph()
879 if (SpanningTreeNodes[I].NumOutEdges > 0) in Graph()
881 new (Alloc) Edge[SpanningTreeNodes[I].NumOutEdges]; in Graph()
883 CFGNodes[I].NumOutEdges = 0; in Graph()
885 SpanningTreeNodes[I].NumOutEdges = 0; in Graph()
892 Edge *E = &CFGNodes[Src].OutEdges[CFGNodes[Src].NumOutEdges++]; in Graph()
904 .OutEdges[SpanningTreeNodes[Src].NumOutEdges++]; in Graph()
947 reportNumber(" OutEdges total ", N->NumOutEdges, 10); in dump()
948 for (int J = 0; J < N->NumOutEdges; ++J) in dump()
959 reportNumber(" OutEdges total ", N->NumOutEdges, 10); in dump()
960 for (int J = 0; J < N->NumOutEdges; ++J) in dump()
1137 for (int I = 0, E = SpanningTreeNodes[Cur].NumOutEdges; I < E; ++I) { in computeEdgeFrequencies()
1151 for (int I = 0, E = CFGNodes[Cur].NumOutEdges; I != E; ++I) { in computeEdgeFrequencies()