[flang-commits] [flang] [llvm] [flang][OpenMP] Decompose compound constructs, do recursive lowering (PR #90098)

[Krzysztof Parzyszek via flang-commits]

================
@@ -60,18 +60,18 @@ subroutine test_tp()
 
 !CHECK-LABEL: func @_QPtest_scalar
 !CHECK:         omp.parallel
-!CHECK:           %[[I1:.*]]:2 = hlfir.declare %{{.*}} {uniq_name = "_QFtest_scalarEi1"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
----------------
kparzysz wrote:

It's getting reordered in re-composition.  The DSA clauses get collapsed, i.e. `private(x) private(y)` is replaced with `private(x, y)`, or `private(y, x)`, the order there is the result of how the implementation handles the clauses---there is no predefined order.

Maybe we should sort object lists in clauses that have them...

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