HomeSort by relevance Sort by last modified time
    Searched defs:Edges (Results 1 - 5 of 5) sorted by null

  /external/llvm/include/llvm/Support/
GCOV.h 191 void addEdge(uint32_t N) { Edges.push_back(N); }
199 SmallVector<uint32_t, 16> Edges;
  /external/llvm/lib/Analysis/
ProfileEstimatorPass.cpp 113 // weight of the incoming edges must be equal the block weight which must in
114 // turn be equal to the sume of the weights of the outgoing edges.
128 // To get the block weight, read all incoming edges.
146 // If the edges value is missing (and this is no loop header, and this is
159 SmallVector<Edge, 8> Edges;
167 // *) get all the exit edges, read the flow that is already leaving this
168 // loop, remember the edges that do not have any flow on them right now.
169 // (The edges that have already flow on them are most likely exiting edges of
175 // the remaining exiting edges
    [all...]
ProfileInfo.cpp 79 // the sum of the edge frequencies from the incoming edges.
313 /// This checks all edges of the function the blocks reside in and replaces the
375 // Generate edges and read current weight.
384 // First count the edges from FristBB to SecondBB, if there is more than
394 // When the edges are merged anyway, then redirect all flow.
398 // We know now how many edges there are from FirstBB to SecondBB, reroute a
421 std::set<Edge> Edges;
426 Edges.insert(old);
429 for (std::set<Edge>::iterator EI = Edges.begin(), EE = Edges.end();
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 12 // to records the edges between blocks that run and emit a complementary "gcda"
95 // Modify the program to track transitions along edges and call into the
108 // pred block number for certain non-trivial edges.
225 // function, number of lines belonging to each block, and a set of edges to
276 // set of blocks and a map of edges between blocks. This is the only GCOV
329 // Emit edges between blocks.
462 unsigned Edges = 0;
466 ++Edges;
468 Edges += TI->getNumSuccessors();
472 ArrayType::get(Type::getInt64Ty(*Ctx), Edges);
    [all...]
  /external/llvm/lib/Transforms/Scalar/
JumpThreading.cpp 168 // edges which simplifies the CFG.
282 /// edges across a loop header. For example, threading a jump from outside the
291 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges;
292 FindFunctionBackedges(F, Edges);
294 for (unsigned i = 0, e = Edges.size(); i != e; ++i)
295 LoopHeaders.insert(const_cast<BasicBlock*>(Edges[i].second));
    [all...]

Completed in 211 milliseconds