compiler: prioritize smaller perfect loop over atomics

devitocodes · Oct 10, 2023 · daf671c · daf671c
1 parent 1b6cd88
commit daf671c
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 2 deletions.
diff --git a/devito/passes/iet/parpragma.py b/devito/passes/iet/parpragma.py
@@ -289,10 +289,10 @@ def _score_candidate(self, n0, root, collapsable=()):
         return (
             int(n_fp_iters == n),  # Fully-parallel nest
             n_fp_iters_large,
+            n_fp_iters,
             n_pia_iters_large,
             n_pia_iters,
             -(n0 + 1),  # The outer, the better
-            n_fp_iters,
             n,
         )
 

diff --git a/tests/test_dle.py b/tests/test_dle.py
@@ -905,7 +905,8 @@ def test_incr_perfect_sparse_outer(self):
 
         eqns = s.inject(u, expr=s)
 
-        op = Operator(eqns, opt=('advanced', {'par-collapse-ncores': 0}))
+        op = Operator(eqns, opt=('advanced', {'par-collapse-ncores': 0,
+                                              'openmp': True}))
 
         iters = FindNodes(Iteration).visit(op)
         assert len(iters) == 5