Lines Matching refs:NumInEdges
781 uint32_t NumInEdges{0}; // Input edge count used to size InEdge member
862 CFGNodes[D.Edges[I].ToNode].NumInEdges++; in Graph()
867 SpanningTreeNodes[D.Edges[I].ToNode].NumInEdges++; in Graph()
872 if (CFGNodes[I].NumInEdges > 0) in Graph()
873 CFGNodes[I].InEdges = new (Alloc) Edge[CFGNodes[I].NumInEdges]; in Graph()
876 if (SpanningTreeNodes[I].NumInEdges > 0) in Graph()
878 new (Alloc) Edge[SpanningTreeNodes[I].NumInEdges]; in Graph()
882 CFGNodes[I].NumInEdges = 0; in Graph()
884 SpanningTreeNodes[I].NumInEdges = 0; in Graph()
896 E = &CFGNodes[Dst].InEdges[CFGNodes[Dst].NumInEdges++]; in Graph()
909 .InEdges[SpanningTreeNodes[Dst].NumInEdges++]; in Graph()
944 reportNumber(" InEdges total ", N->NumInEdges, 10); in dump()
945 for (int J = 0; J < N->NumInEdges; ++J) in dump()
956 reportNumber(" InEdges total ", N->NumInEdges, 10); in dump()
957 for (int J = 0; J < N->NumInEdges; ++J) in dump()
1093 if (SpanningTreeNodes[I].NumInEdges == 0) in computeEdgeFrequencies()
1179 if (SpanningTreeNodes[Cur].NumInEdges == 0) in computeEdgeFrequencies()
1182 assert(SpanningTreeNodes[Cur].NumInEdges == 1, "must have 1 parent"); in computeEdgeFrequencies()
1188 for (int I = 0, E = CFGNodes[Cur].NumInEdges; I != E; ++I) { in computeEdgeFrequencies()