// RUN: -DEXTENDS=BEFORE
// RUN: | %fcheck-generic
// RUN: -DEXTENDS=AFTER
// RUN: | %fcheck-generic
#include <stdio.h>
#define BEFORE 0
#define AFTER 1
#define SIZE 100
#if EXTENDS == BEFORE
#define SMALL_BEG (SIZE - 2)
#define SMALL_END SIZE
#define LARGE_BEG 0
#define LARGE_END SIZE
#elif EXTENDS == AFTER
#define SMALL_BEG 0
#define SMALL_END 2
#define LARGE_BEG 0
#define LARGE_END SIZE
#else
#error EXTENDS undefined
#endif
#define SMALL \
SMALL_BEG: \
(SMALL_END - SMALL_BEG)
#define LARGE \
LARGE_BEG: \
(LARGE_END - LARGE_BEG)
void check_not_present() {
int arr[SIZE];
for (int i = 0; i < SIZE; ++i)
arr[i] = 99;
fprintf(stderr, "checking not present\n");
#pragma omp target data map(tofrom : arr[LARGE])
{
#pragma omp target exit data map(delete : arr[LARGE])
#pragma omp target enter data map(alloc : arr[SMALL])
#pragma omp target map(alloc : arr[SMALL])
for (int i = SMALL_BEG; i < SMALL_END; ++i)
arr[i] = 88;
}
for (int i = 0; i < SIZE; ++i) {
if (arr[i] != 99)
fprintf(stderr, "error: arr[%d]=%d\n", i, arr[i]);
}
}
void check_is_present() {
int arr[SIZE];
for (int i = 0; i < SIZE; ++i)
arr[i] = 99;
fprintf(stderr, "checking is present\n");
#pragma omp target data map(tofrom : arr[SMALL])
{
#pragma omp target exit data map(delete : arr[SMALL])
#pragma omp target enter data map(alloc : arr[LARGE])
#pragma omp target map(alloc : arr[LARGE])
for (int i = LARGE_BEG; i < LARGE_END; ++i)
arr[i] = 88;
}
for (int i = 0; i < SIZE; ++i) {
if (SMALL_BEG <= i && i < SMALL_END) {
if (arr[i] != 88)
fprintf(stderr, "error: arr[%d]=%d\n", i, arr[i]);
} else if (arr[i] != 99) {
fprintf(stderr, "error: arr[%d]=%d\n", i, arr[i]);
}
}
}
int main() {
check_not_present();
check_is_present();
return 0;
}