File: bug54082.c

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (54 lines) | stat: -rw-r--r-- 1,301 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
// This test is adapted from test_parallel_for_allocate.c in SOLLVE V&V.
// https://github.com/SOLLVE/sollve_vv/blob/master/tests/5.0/parallel_for/test_parallel_for_allocate.c
// RUN: %libomp-compile-and-run
#include <omp.h>

#include <assert.h>
#include <stdlib.h>

#define N 128

int main(int argc, char *argv[]) {
  int errors = 0;
  int *x;
  int result[N][N];
  int successful_alloc = 0;

  omp_memspace_handle_t x_memspace = omp_default_mem_space;
  omp_alloctrait_t x_traits[1] = {omp_atk_alignment, 64};
  omp_allocator_handle_t x_alloc = omp_init_allocator(x_memspace, 1, x_traits);

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      result[i][j] = -1;
    }
  }

#pragma omp parallel for allocate(x_alloc: x) private(x) shared(result)
  for (int i = 0; i < N; i++) {
    x = (int *)malloc(N * sizeof(int));
    if (x != NULL) {
#pragma omp simd simdlen(16) aligned(x : 64)
      for (int j = 0; j < N; j++) {
        x[j] = j * i;
      }
      for (int j = 0; j < N; j++) {
        result[i][j] = x[j];
      }
      free(x);
      successful_alloc++;
    }
  }

  errors += successful_alloc < 1;

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      errors += result[i][j] != i * j;
    }
  }

  omp_destroy_allocator(x_alloc);

  return errors;
}