Lines Matching refs:Edges
18 // those edges not on the spanning tree. Knuth proves this method instruments
19 // the minimum number of edges.
22 // edges have higher frequencies (more likely to execute). The idea is to
23 // instrument those less frequently executed edges to reduce the runtime
77 STATISTIC(NumOfPGOInstrument, "Number of edges instrumented.");
78 STATISTIC(NumOfPGOEdge, "Number of edges.");
171 // This class implements the CFG edges. Note the CFG can be a multi-graph.
172 // So there might be multiple edges with same SrcBB and DestBB.
203 // This class implements the CFG edges. Note the CFG can be a multi-graph.
225 // Dump edges and BB information.
254 // value of each BB in the CFG. The higher 32 bits record the number of edges.
308 // Visit all edge and instrument the edges not in MST.
309 // Critical edges will be split.
390 // Sum up the count values for all the edges.
391 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) {
393 for (auto &E : Edges) {
422 void setEdgeCount(DirectEdges &Edges, uint64_t Value);
458 // Visit all the edges and assign the count value for the instrumented
459 // edges and the BB.
480 // Need to add two new edges.
495 // unknown edge in Edges vector.
496 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) {
497 for (auto &E : Edges) {
510 // instrumented BB and the edges. This function also updates ProgramMaxCount.
578 // of the instrumented edges are at the end.
622 // Assign the scaled count values to the BB with multiple out edges.
