Displaying 1 result from an estimated 1 matches for "redfused".
2020 Jan 03
10
Writing loop transformations on the right representation is more productive
...unt())
return;
if (Red1->getPredicate() != Red2->getPredicate())
return;
// Create new loop hierarchy with fused loops.
GreenFused = new GreenLoop({ Red1->getGreen(), Red2->getGreen() },
Red1->getIterationCount());
RedFused = new RedNode(GreenFused, Red1->getParent());
NewRoot = RedFused->getRoot();
// Preserve analysis.
// In this case not really necessary since the green nodes of the
// loop bodies are reused.
DependenceAnalysis->transferAnalysis(Red1->getBody(),...