Lines Matching full:triangle
196 // Heuristic for triangle chains.
198 "triangle-chain-count",
199 cl::desc("Number of triangle-shaped-CFG's that need to be in a row for the "
200 "triangle tail duplication heuristic to kick in. 0 to disable."),
985 // Allow triangle successors, but don't count them. in isTrellis()
987 // Make sure that it is actually a triangle. in isTrellis()
1109 // Did we pick the triangle edge? If tail-duplication is profitable, do in getBestTrellisSuccessor()
1110 // that instead. Otherwise merge the triangle edge now while we know it is in getBestTrellisSuccessor()
1265 /// fixed cost, unlike the standard triangle layout where the cost of being
1294 LLVM_DEBUG(dbgs() << "Pre-computing triangle chains.\n"); in precomputeTriangleChains()
1299 // If BB doesn't have 2 successors, it doesn't start a triangle. in precomputeTriangleChains()
1310 // triangle. in precomputeTriangleChains()
1313 // If PDom has a hint that it is low probability, skip this triangle. in precomputeTriangleChains()
1316 // If PDom isn't eligible for duplication, this isn't the kind of triangle in precomputeTriangleChains()
1322 // isn't the kind of triangle we're looking for. in precomputeTriangleChains()
1332 // triangle. in precomputeTriangleChains()
1336 // Now we have an interesting triangle. Insert it if it's not part of an in precomputeTriangleChains()
1382 // When profile is available, we need to handle the triangle-shape CFG.
1567 // prob(BB->Succ) > HotProb. (freq(Succ) = freq(BB) for a triangle) in hasBetterLayoutPredecessor()