Lines Matching refs:bestDstLoopDepth
1130 Optional<unsigned> bestDstLoopDepth = None; in isFusionProfitable() local
1228 bestDstLoopDepth = i; in isFusionProfitable()
1236 if (!bestDstLoopDepth) { in isFusionProfitable()
1244 if (!bestDstLoopDepth) { in isFusionProfitable()
1250 *dstLoopDepth = *bestDstLoopDepth; in isFusionProfitable()
1254 << "\n best loop depth: " << bestDstLoopDepth in isFusionProfitable()
1549 unsigned bestDstLoopDepth = maxLegalFusionDepth; in fuseProducerConsumerNodes() local
1570 maxLegalFusionDepth, &bestDstLoopDepth, in fuseProducerConsumerNodes()
1575 assert(bestDstLoopDepth > 0 && "Unexpected loop fusion depth"); in fuseProducerConsumerNodes()
1577 depthSliceUnions[bestDstLoopDepth - 1]; in fuseProducerConsumerNodes()
1625 << " at depth " << bestDstLoopDepth << ":\n" in fuseProducerConsumerNodes()
1657 dstAffineForOp, storesForMemref[0], bestDstLoopDepth, in fuseProducerConsumerNodes()
1776 unsigned bestDstLoopDepth = maxLegalFusionDepth; in fuseWithSiblingNodes() local
1781 &bestDstLoopDepth, computeToleranceThreshold)) in fuseWithSiblingNodes()
1785 assert(bestDstLoopDepth > 0 && "Unexpected loop fusion depth"); in fuseWithSiblingNodes()
1786 assert(!depthSliceUnions[bestDstLoopDepth - 1].isEmpty() && in fuseWithSiblingNodes()
1791 bool isInnermostInsertion = (bestDstLoopDepth == dstLoopDepthTest); in fuseWithSiblingNodes()
1794 depthSliceUnions[bestDstLoopDepth - 1], in fuseWithSiblingNodes()