craycc: dist_schedule(static, 4) on target teams distribute parallel for puts every iteration on team 0

// # Draft finding: omp52-c-clause-dist_schedule-chunk_size on cce19
//
// - compiler: cce19
// - toolchain: cce19; arch: gfx942; machine: tuolumne; memory mode: unified; opt: -O2
// - program: catalog omp52-c-clause-dist_schedule-chunk_size (c, version 52, sha256 47094ef1ef5dfbfa)
// - expected: check=pass (trusted; derivation + model)
// - actual: wrong_answer check=fail (check_fail: ran_on_host=0 check=fail)
// - verdict: compiler_bug by rule R20-runtime-bug: a legal program fails at run time, deterministically, against an expected value from two or more independent sources with an executed witness, and another toolchain, mode, arch or the elision gives the expected value
// - reason: expected trusted check=pass (derivation + model): derivation + model agree; witnesses: afar/gfx942/unified, cce19/gfx942/unified (port:omp52-clause-dist_schedule-chunk_size), cce20/gfx942/unified (port:omp52-clause-dist_schedule-chunk_size), cce21/gfx942/unified (port:omp52-clause-dist_schedule-chunk_size)
// - citations: RUL-DERIVED-NEEDS-EXECUTION (rulings.md); RUL-WITNESS-PER-MODE (rulings.md); RUL-SAME-COMPILER-RUNS (rulings.md)
// - legality: legal (legal by construction: offload.engine.gen / c_gen / acc_gen check every program against the catalog rules and the offload scope as it is built (no compiler))
// - witnesses: afar/gfx942/unified, cce19/gfx942/unified (port:omp52-clause-dist_schedule-chunk_size), cce20/gfx942/unified (port:omp52-clause-dist_schedule-chunk_size), cce21/gfx942/unified (port:omp52-clause-dist_schedule-chunk_size)
// - withdrawn: none
//
// Generated by compliance.c_gen (OpenMP 5.2, C11): the C port (offload.engine.f2c) of omp52-clause-dist_schedule-chunk_size. Do not edit.
// id: omp52-c-clause-dist_schedule-chunk_size
// primary atom: omp.clause.dist_schedule.chunk_size
// legal: yes
// observable: yes
// ran_on_host: inside the target region of interest
// evidence: construct
// needs: none
// std: c11
#include <stdio.h>
#include <stdbool.h>
#include <omp.h>

enum { n = 64 };

int main(void) {
  int a[n];
  int b[n];
  int ref[n];
  int host_flag;
  bool ok;
  int team[n];
  int nt;
  bool dok;
  for (int i = 1; i <= n; i++) {
    a[i - 1] = i;
    b[i - 1] = 0;
    ref[i - 1] = 2 * i + 1;
  }
  host_flag = 1;
  for (int k1_ = 0; k1_ < n; k1_++)
    team[k1_] = -1;
  nt = -1;
  #pragma omp target teams distribute parallel for map(to: a) map(from: b) map(from: team, nt) \
      map(tofrom: host_flag) default(none) shared(a, b, team, nt, host_flag) num_teams(4) \
      dist_schedule(static, 4)
  for (int i = 1; i <= n; i++) {
    b[i - 1] = 2 * a[i - 1] + 1;
    team[i - 1] = omp_get_team_num();
    if (i == 1) nt = omp_get_num_teams();
    if (i == 1) host_flag = (omp_is_initial_device() ? 1 : 0);
  }
  dok = true;
  for (int i = 1; i <= n; i++) {
    dok = dok && (team[i - 1] == ((i - 1) / 4 % nt));
  }
  bool t2_ = true;
  for (int k3_ = 0; k3_ < n; k3_++)
    t2_ = t2_ && (b[k3_] == ref[k3_]);
  ok = t2_ && (nt >= 1) && dok;
  printf("RESULT ran_on_host=%d check=%s\n", host_flag, ok ? "pass" : "fail");
  return 0;
}
// spec (requirement): With a chunk_size, dist_schedule divides the iterations into chunks of that size.
// "If the chunk_size argument is specified, iterations are divided into chunks of size chunk_size." (5.2 §11.6.1
//   p.256 l.18-19)
// spec (requirement): The chunks are assigned to the initial teams of the league round-robin in team-number order.
// "These chunks are assigned to the initial teams of the league in a round-robin fashion in the order of the initial
//   team number." (5.2 §11.6.1 p.256 l.23-24)
// spec (this program): dist_schedule(static, 4) with num_teams(4) puts iterations 1-4 on team 0, 5-8 on team 1, and
//   so on, round robin; craycc places every iteration on team 0.