[polly] [Polly] Distribute the innermost point loop of tile over its statements (PR #225844)

[Michael Kruse via llvm-commits]

================
@@ -548,6 +576,114 @@ ScheduleTreeOptimizer::applyTileBandOpt(isl::schedule_node Node) {
   return Node;
 }
 
+isl::schedule_node
+ScheduleTreeOptimizer::distributeInnermostLoop(isl::schedule_node Node,
+                                               const Dependences *D) {
+  if (!isSimpleInnermostBand(Node))
+    return Node;
+
+  // Number the statements in the order of their names, so that the result does
+  // not depend on the order in which isl lists them.
+  isl::union_set Domain = Node.get_domain();
+  SmallVector<isl::set, 8> Stmts;
+  for (isl::set Stmt : Domain.get_set_list())
----------------
Meinersbur wrote:

Since this is called in a max-quota region, operations such as conditions and iterations must be checked for errors beforehand. In this case: `Domain.is_null()`

https://github.com/llvm/llvm-project/pull/225844