ftn/craycc: constructs documented as unsupported in offload regions (single, masked, task, ordered, scan) give internal compiler errors or device link failures instead of a diagnostic

// # Draft finding: omp52-c-clause-ordered on cce19
//
// - compiler: cce19
// - toolchain: cce19; arch: gfx942; machine: tuolumne; memory mode: unified; opt: -O2
// - program: catalog omp52-c-clause-ordered (c, version 52, sha256 2af75a6f949bff54)
// - expected: None (None; )
// - actual: rejected  (link_undefined_symbol: lld: error: undefined symbol: __kmpc_dispatch_init_4)
// - verdict: compiler_bug by rule R10b-own-link-or-hang: a link failure on symbols the compiler's own generated code needs, or a compile that does not finish, on a legal program: the compiler's defect (never a rejection)
// - reason: 
// - citations: RUL-COMPILE-TIME (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: none
// - withdrawn: none
//
// Generated by compliance.c_gen (OpenMP 5.2, C11): the C port (offload.engine.f2c) of omp52-clause-ordered. Do not edit.
// id: omp52-c-clause-ordered
// primary atom: omp.clause.ordered
// 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 cnt;
  int seq[n];
  for (int i = 1; i <= n; i++) {
    a[i - 1] = i;
    b[i - 1] = 0;
    ref[i - 1] = 2 * i + 1;
  }
  host_flag = 1;
  cnt = 0;
  for (int k1_ = 0; k1_ < n; k1_++)
    seq[k1_] = -1;
  #pragma omp target map(to: a) map(from: b) map(tofrom: cnt) map(from: seq) \
      map(tofrom: host_flag)
  {
    host_flag = (omp_is_initial_device() ? 1 : 0);
    #pragma omp parallel for default(none) shared(a, b, cnt, seq) ordered
    for (int i = 1; i <= n; i++) {
      b[i - 1] = 2 * a[i - 1] + 1;
      #pragma omp ordered
      {
        cnt = cnt + 1;
        seq[i - 1] = cnt;
      }
    }
  }
  bool t2_ = true;
  for (int k3_ = 0; k3_ < n; k3_++)
    t2_ = t2_ && (b[k3_] == ref[k3_]);
  bool t4_ = true;
  for (int k5_ = 0; k5_ < n; k5_++)
    t4_ = t4_ && (2 * seq[k5_] + 1 == ref[k5_]);
  ok = t2_ && t4_;
  printf("RESULT ran_on_host=%d check=%s\n", host_flag, ok ? "pass" : "fail");
  return 0;
}