Lines Matching defs:jumps

14 // achieved via increasing the number of fall-through jumps and co-locating
71     cl::desc("The weight of conditional forward jumps for ExtTSP value"));
75     cl::desc("The weight of unconditional forward jumps for ExtTSP value"));
79     cl::desc("The weight of conditional backward jumps for ExtTSP value"));
83     cl::desc("The weight of unconditional backward jumps for ExtTSP value"));
87     cl::desc("The weight of conditional fallthrough jumps for ExtTSP value"));
91     cl::desc("The weight of unconditional fallthrough jumps for ExtTSP value"));
231   // The total execution count of outgoing jumps.
234   // The total execution count of incoming jumps.
253   // Outgoing jumps from the node.
255   // Incoming jumps to the node.
362   // Adjacent chains and corresponding edges (lists of jumps).
366 /// An edge in the graph representing jumps between two chains.
385   const std::vector<JumpT *> &jumps() const { return Jumps; }
436   // Original jumps in the binary with corresponding execution counts.
536 /// A wrapper around two concatenated vectors (chains) of jumps.
628     // Initialize jumps between the nodes.
691   /// if (i) all jumps (based on profile) from A goes to B and (ii) all jumps
808       // Iterating in reverse order to make sure original fallthrough jumps are
825   /// Compute the Ext-TSP score for a given node order and a list of jumps.
856     assert(!Edge->jumps().empty() && "trying to merge chains w/o jumps");
857     // Precompute jumps between ChainPred and ChainSucc.
859     MergedJumpsT Jumps(&Edge->jumps(), EdgePP ? &EdgePP->jumps() : nullptr);
967       MergedJumpsT MergedJumps(&SelfEdge->jumps());
1022   /// All jumps between the nodes.
1072     // Initialize jumps between the nodes.
1210     assert(!Edge->jumps().empty() && "trying to merge chains w/o jumps");
1211     // Precompute jumps between ChainPred and ChainSucc.
1212     MergedJumpsT Jumps(&Edge->jumps());
1392   /// All jumps (function calls) between the nodes.