file_path stringlengths 19 84 | content stringlengths 235 1.29M |
|---|---|
./openacc-vv/kernels_loop_reduction_max_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[10 * n];
real_t * b = new real_t[10 * n];
real_t * c = new real_t[10 * n];
real_t * maximum = new real_t[10];
real_t temp = 0;
re... |
./openacc-vv/kernels_copyin.F90 | #ifndef T1
!T1:devonly,kernels,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b !Data
INTEGER :: errors = 0
INTEGER,DIMENSION(1):: devtest
devtest(1) = 1
!$acc en... |
./openacc-vv/atomic_update_iand_expr_x.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
INTEGER,DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT, 8):: randoms
INTEGER,DIMENSION(LOOPCOUNT/10 + 1):: ... |
./openacc-vv/parallel_loop_reduction_add_loop.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = (real_t *)malloc(10 * n * sizeof(real_t));
real_t* b = (real_t*)malloc(10 * n * sizeof(real_t));
real_t* c = (real_t*)malloc(10 * n * sizeof(real_t));
... |
./PhysiCell_GPU/sample_projects/biorobots/main-biorobots.cpp | /*
###############################################################################
# If you use PhysiCell in your project, please cite PhysiCell and the version #
# number, such as below: #
# ... |
./openacc-vv/acc_async_test_all.c | #include "acc_testsuite.h"
#ifndef T1
//T1:async,runtime,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
real_t **a = (real_t **)malloc(10 * sizeof(real_t*));
real_t **b = (real_t **)malloc(10 * sizeof(real_t*));
real_t **c = (real_t **)malloc(10 * sizeof(real_t*));
real_t **d = (real_t **... |
./openacc-vv/atomic_minus_equals.c | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t *a = (real_t *)malloc(n * sizeof(real_t));
real_t *b = (real_t *)malloc(n * sizeof(real_t));
real_t *totals = (real_t *)malloc(10 * sizeof(real_t));
real_t *totals_host... |
./openacc-vv/atomic_update_postincrement.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t *a = new real_t[n];
real_t *b = new real_t[n];
int *distribution = new int[10];
int *distribution_comparison = new int[10];
for (int x = 0; x < n; ++x){
a[... |
./openacc-vv/init_device_type_num.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:init,runtime,V:2.5-3.2
int test1(){
int err = 0;
srand(SEED);
int device_num = acc_get_device_num(acc_get_device_type());
#pragma acc init device_type(host) device_num(device_num)
return err;
}
#endif
#ifndef T2
//T1:init,runtime,V:2.5-3.2
int test2(){
... |
./openacc-vv/declare_function_scope_create.F90 | FUNCTION create_test(a, b, c, d, LOOPCOUNT)
REAL(8),DIMENSION(LOOPCOUNT),INTENT(IN) :: a, b
REAL(8),DIMENSION(LOOPCOUNT),INTENT(INOUT) :: c, d
INTEGER,INTENT(IN) :: LOOPCOUNT
INTEGER :: x
!$acc declare create(c(1:LOOPCOUNT))
!$acc parallel present(a(1:LOOPCOUNT), b(1:LOOPCOUNT), d(1:LOOPCOUNT))
!$acc l... |
./openacc-vv/atomic_capture_assign_iand_x_expr.F90 | RECURSIVE FUNCTION IS_POSSIBLE(a, b, length, init) RESULT(POSSIBLE)
INTEGER, INTENT(IN) :: length
INTEGER, INTENT(IN) :: init
INTEGER,DIMENSION(length), INTENT(IN) :: a
INTEGER,DIMENSION(length), INTENT(IN) :: b
INTEGER,DIMENSION(length - 1) :: passed_a
INTEGER,DIMENSION(length - 1) :: passed_b
INTEGER ::... |
./SPECaccel/benchspec/ACCEL/570.pbt/src/initialize.c | //-------------------------------------------------------------------------//
// //
// This benchmark is a serial C version of the NPB BT code. This C //
// version is developed by the Center for Manycore Programming at Seoul //
// Nati... |
./openacc-vv/acc_memcpy_to_device_async.c | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,data,executable-data,async,construct-independent,V:2.5-2.7
int test1(){
int err = 0;
real_t *a = (real_t *)malloc(n * sizeof(real_t));
real_t *b = (real_t *)malloc(n * sizeof(real_t));
real_t *c = (real_t *)malloc(n * sizeof(real_t));
real_t *d = (r... |
./SPECaccel/benchspec/ACCEL/351.palm/data/ref/output/RUN_CONTROL |
****************************** ------------------------------------------
* PALM 3.9 Rev: * atmosphere - 3D - run without 1D - prerun
****************************** ------------------------------------------
Date: Run: acc_large
Time: ... |
./openacc-vv/atomic_expr_rshift_x.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
unsigned int *a = (unsigned int *)malloc(3 * n * sizeof(int));
unsigned int *b = (unsigned int *)malloc(n * sizeof(int));
int orders[18] = {1, 2, 0, 1, 0, 2, 2, 1, 0, 2, 0, 1, 0, ... |
./openacc-vv/kernels_copyout_zero.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,data,data-region,V:3.0-3.2
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[n];
real_t * b = new real_t[n];
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
b[x] = 0;
}
#pragma acc data co... |
./openacc-vv/atomic_capture_expr_and_x_assign.F90 | RECURSIVE FUNCTION IS_POSSIBLE(a, b, length, init) RESULT(POSSIBLE)
INTEGER, INTENT(IN) :: length
LOGICAL,DIMENSION(length), INTENT(IN) :: a
LOGICAL,DIMENSION(length), INTENT(IN) :: b
LOGICAL, INTENT(IN) :: init
LOGICAL,DIMENSION(length - 1) :: passed_a
LOGICAL,DIME... |
./openacc-vv/parallel_loop_async.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,async,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[10 * n];
real_t * b = new real_t[10 * n];
real_t * c = new real_t[10 * n];
real_t * d = new real_t[10 * n];
int * errors = new int[10];
f... |
./openacc-vv/serial_if.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,if,V:2.6-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[n];
real_t * b = new real_t[n];
real_t * c = new real_t[n];
int accel = 1;
int host = 0;
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX /... |
./PhysiCell_GPU/sample_projects/cancer_immune/scripts/CI_script.cpp | /*
###############################################################################
# If you use PhysiCell in your project, please cite PhysiCell and the version #
# number, such as below: #
# ... |
./openacc-vv/atomic_capture_max_x_expr_list_assign.F90 | RECURSIVE FUNCTION IS_POSSIBLE(a, b, c, length, init) RESULT(POSSIBLE)
INTEGER, INTENT(IN) :: length
REAL(8), INTENT(IN) :: init
REAL(8),DIMENSION(length), INTENT(IN) :: a
REAL(8),DIMENSION(length), INTENT(IN) :: b
REAL(8),DIMENSION(length), INTENT(IN) :: c
REAL(8),DIMENSION(length - 1) :: passed_a
REAL(8),DIMENSION(le... |
./openacc-vv/init_device_type_num_nvidia.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:init,runtime,V:2.5-3.2
int test1(){
int err = 0;
srand(SEED);
int device_num = acc_get_device_num(acc_get_device_type());
#pragma acc init device_type(nvidia) device_num(device_num)
return err;
}
#endif
int main(){
int failcode = 0;
int failed;
#... |
./openacc-vv/atomic_bitor_equals.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
int *a = new int[n];
int *totals = new int[(n/10 + 1)];
int *totals_comparison = new int[(n/10 + 1)];
for (int x = 0; x < n; ++x){
for (int y = 0; y < 8; ++y){
... |
./openacc-vv/atomic_structured_assign_bitxor_equals.cpp | #include "acc_testsuite.h"
bool is_possible(int* a, int* b, int length, int prev){
if (length == 0){
return true;
}
int *passed_a = new int[(length - 1)];
int *passed_b = new int[(length - 1)];
for (int x = 0; x < length; ++x){
if (b[x] == prev){
for (int y = 0; y < x; ++... |
./openacc-vv/parallel_loop_reduction_bitand_general.F90 | #ifndef T1
!T1:parallel,reduction,combined-constructs,loop,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y, z !Iterators
INTEGER,DIMENSION(LOOPCOUNT):: a !Data
INTEGER :: b
REAL(8),DIMENSION(16 * LOOPCOUNT):: randoms
... |
./openacc-vv/atomic_structured_postincrement_assign.c | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t *a = (real_t *)malloc(n * sizeof(real_t));
real_t *b = (real_t *)malloc(n * sizeof(real_t));
int *c = (int *)malloc(n * sizeof(int));
int *distribution = (int *)malloc(... |
./openacc-vv/atomic_min_expr_x_end.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT/10 + 1):: totals, totals_comparison
INTEGER :: error... |
./openacc-vv/atomic_update_expr_plus_x.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t *a = new real_t[n];
real_t *b = new real_t[n];
real_t *totals = new real_t[10];
real_t *totals_comparison = new real_t[10];
for (int x = 0; x < n; ++x){
a[... |
./openacc-vv/parallel_loop_reduction_or_general.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
char * a = new char[n];
real_t false_margin = pow(exp(1), log(.5)/n);
char result = 0;
char found = 0;
for (int x = 0; x < n; ++x){
if(rand() / (re... |
./openacc-vv/parallel_loop_reduction_add_general_type_check_pt1.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,reduction,combined-constructs,loop,V:1.0-2.7
int test1() {
int err = 0;
srand(SEED);
bool* a = new bool[n];
bool* b = new bool[n];
bool total = 1;
bool host_total = 1;
for (int x = 0; x < n; ++x) {
if ((rand()/((real_t) RAND_MAX)) ... |
./openacc-vv/serial_switch.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,V:2.6-2.7
int test1(){
int err = 0;
srand(SEED);
int * a = new int[n];
real_t * b = new real_t[n];
real_t * b_host = new real_t[n];
real_t * c = new real_t[n];
for (int x = 0; x < n; ++x){
a[x] = floor(rand() / (real_t)(RAND_MAX / 10... |
./openacc-vv/atomic_structured_bitand_equals_assign.cpp | #include "acc_testsuite.h"
bool is_possible(int* a, int* b, int length, int prev){
if (length == 0){
return true;
}
int *passed_a = new int[(length - 1)];
int *passed_b = new int[(length - 1)];
for (int x = 0; x < length; ++x){
if (b[x] == (prev & a[x])){
for (int y = 0; ... |
./openacc-vv/atomic_update_ixor_x_expr.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
INTEGER,DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT, 8):: randoms
INTEGER,DIMENSION(LOOPCOUNT/10 + 1):: ... |
./openacc-vv/serial_loop_seq.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,combined-constructs,V:2.6-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[n];
real_t * b = new real_t[n];
real_t temp = 0.0;
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
b[x] = 0.0... |
./openacc-vv/serial_loop_reduction_bitor_vector_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,reduction,combined-constructs,V:2.6-2.7
int test1(){
int err = 0;
srand(SEED);
unsigned int* a = (unsigned int *)malloc(10 * n * sizeof(unsigned int));
unsigned int* b = (unsigned int *)malloc(10 * sizeof(unsigned int));
unsigned int b_host;
... |
./openacc-vv/kernels_loop_reduction_bitor_loop.c | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
unsigned int * a = (unsigned int *)malloc(10 * n * sizeof(unsigned int));
unsigned int * b = (unsigned int *)malloc(10 * n * sizeof(unsigned int));
unsigned int * b_... |
./openacc-vv/acc_wait_async.F90 | #ifndef T1
!T1:runtime,async,construct-independent,V:2.0-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c, d, e, f, g, h, i !Data
REAL(8) :: RAND
INTEGER :: error... |
./openacc-vv/atomic_capture_ior_expr_x_assign.F90 | RECURSIVE FUNCTION IS_POSSIBLE(a, b, length, init) RESULT(POSSIBLE)
INTEGER, INTENT(IN) :: length
INTEGER, INTENT(IN) :: init
INTEGER,DIMENSION(length), INTENT(IN) :: a
INTEGER,DIMENSION(length), INTENT(IN) :: b
INTEGER,DIMENSION(length - 1) :: passed_a
INTEGER,DIMENSION(length - 1) :: passed_b
INTEGER ::... |
./openacc-vv/parallel_loop_reduction_bitxor_vector_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
unsigned int* a = (unsigned int *)malloc(10 * n * sizeof(unsigned int));
unsigned int* b = (unsigned int *)malloc(10 * sizeof(unsigned int));
unsigned int temp = 0... |
./openacc-vv/declare_function_scope_copy.cpp | #include "acc_testsuite.h"
void copyin_copyout_test(real_t *a, real_t *b, real_t *c){
#pragma acc declare copy(c[0:n])
#pragma acc parallel present(a[0:n], b[0:n])
{
#pragma acc loop
for (int x = 0; x < n; ++x){
c[x] = c[x] + a[x] + b[x];
}
}
}
#ifndef T1
//T1:declar... |
./openacc-vv/atomic_structured_assign_expr_multiply_x.c | #include "acc_testsuite.h"
bool is_possible(real_t* a, real_t* b, int length, real_t prev){
if (length == 0){
return true;
}
real_t *passed_a = (real_t *)malloc((length - 1) * sizeof(real_t));
real_t *passed_b = (real_t *)malloc((length - 1) * sizeof(real_t));
for (int x = 0; x < length; ++x... |
./openacc-vv/set_default_async.F90 | #ifndef T1
!T1:async,construct-independent,internal-control-values,set,V:2.5-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c, a_host, b_host !Data
REAL(8) :: RAND
... |
./openacc-vv/kernels_default_present.c | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,data,data-region,default,V:2.5-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = (real_t *)malloc(n * sizeof(real_t));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX /... |
./openacc-vv/atomic_update_expr_and_x_end.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT, 10):: randoms
LOGICAL,DIMENSION(LOOPCOUNT, 10):: a !Data
LOGICAL,DIMENSION(LOOPCOUNT):: to... |
./openacc-vv/atomic_update_predecrement.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t *a = new real_t[n];
real_t *b = new real_t[n];
int *distribution = new int[10];
int *distribution_comparison = new int[10];
for (int x = 0; x < n; ++x){
a[... |
./openacc-vv/acc_update_self_async.c | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,data,executable-data,async,construct-independent,V:2.5-2.7
int test1(){
int err = 0;
real_t *a = (real_t *)malloc(n * sizeof(real_t));
real_t *b = (real_t *)malloc(n * sizeof(real_t));
real_t *c = (real_t *)malloc(n * sizeof(real_t));
real_t *d = (r... |
./openacc-vv/data_async.c | #include "acc_testsuite.h"
#ifndef T1
//T1:async,data,V:3.2-3.3
int test1(){
int err = 0;
srand(SEED);
real_t * a = (real_t *)malloc(n * sizeof(real_t));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
real_t * c = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x < n; ++x){
a[... |
./openacc-vv/atomic_expr_or_x.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT, 10):: randoms
LOGICAL,DIMENSION(LOOPCOUNT, 10):: a !Data
LOGICAL,DIMENSION(LOOPCOUNT):: to... |
./openacc-vv/parallel_wait_queue.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,wait,async,V:2.0-3.2
int test1(){
int err = 0;
srand(time(NULL));
real_t * a = (real_t *)malloc(n * sizeof(real_t));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
real_t * c = (real_t *)malloc(n * sizeof(real_t));
real_t * d = (real_t *)... |
./openacc-vv/atomic_x_or_expr.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT, 10):: randoms
LOGICAL,DIMENSION(LOOPCOUNT, 10):: a !Data
LOGICAL,DIMENSION(LOOPCOUNT):: to... |
./openacc-vv/atomic_capture_expr_plus_x.cpp | #include "acc_testsuite.h"
bool is_possible(real_t* a, real_t* b, int length, real_t prev){
if (length == 0){
return true;
}
real_t *passed_a = new real_t[(length - 1)];
real_t *passed_b = new real_t[(length - 1)];
for (int x = 0; x < length; ++x){
if (fabs(b[x] - (a[x] + prev)) < PR... |
./openacc-vv/routine_bind_nonprototype_function_string_function.cpp | #include "acc_testsuite.h"
//test 1 host function
#pragma acc routine vector bind("device_array_array")
real_t host_array_array(real_t * a, long long n){
#pragma acc loop reduction(+:returned)
real_t returned = 0.0;
for (int x = 0; x < n; ++x){
returned += a[x];
}
return returned;
}
//test... |
./openacc-vv/atomic_capture_expr_bitxor_x.cpp | #include "acc_testsuite.h"
bool is_possible(int* a, int* b, int length, int prev){
if (length == 0){
return true;
}
int *passed_a = new int[(length - 1)];
int *passed_b = new int[(length - 1)];
for (int x = 0; x < length; ++x){
if (b[x] == (a[x]^prev)){
for (int y = 0; y ... |
./openacc-npb/SP/SP/rhs.c | //-------------------------------------------------------------------------//
// //
// This benchmark is a serial C version of the NPB SP code. This C //
// version is developed by the Center for Manycore Programming at Seoul //
// Nati... |
./openacc-vv/routine_worker.c | #include "acc_testsuite.h"
void test_routine_worker_loop_named(real_t ** a, real_t * b, long long n);
void test_routine_worker_worker_named(real_t ** a, real_t * b, long long n);
void test_routine_worker_vector_named(real_t ** a, real_t * b, long long n);
void test_routine_worker_seq_named(real_t ** a, real_t * b, long... |
./openacc-vv/kernels_loop_reduction_min_vector_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[10 * n];
real_t * b = new real_t[10 * n];
real_t * min = new real_t[10];
real_t temp = 100;
real_t temp_min;
for (int x = 0; x <... |
./openacc-vv/parallel_loop_reduction_bitxor_loop.F90 | #ifndef T1
!T1:parallel,private,reduction,combined-constructs,loop,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
INTEGER,DIMENSION(10*LOOPCOUNT):: a, b, b_copy !Data
REAL(8),DIMENSION(10*LOOPCOUNT):: randoms, randoms2... |
./openacc-vv/kernels_scalar_default_copy.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,data,data-region,default-mapping,V:2.5-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[n];
real_t * b = new real_t[n];
real_t sum = 0.0;
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
b[... |
./openacc-vv/acc_copyout_async.F90 | #ifndef T1
!T1:runtime,data,executable-data,async,construct-independent,V:2.5-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c, d, e, f !Data
REAL(8) :: RAND
INTE... |
./openacc-vv/parallel_loop_reduction_add_general_type_check_pt3.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,reduction,combined-constructs,loop,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
double _Complex * a = (double _Complex *)malloc(n * sizeof(double _Complex));
double _Complex * b = (double _Complex *)malloc(n * sizeof(double _Complex));
double _... |
./openacc-vv/data_with_structs.c | #include "acc_testsuite.h"
typedef struct multi_item {
real_t a;
real_t b;
real_t c;
} multi_item;
#ifndef T1
//T1:data,data-region,construct-independent,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
multi_item * a = (multi_item *)malloc(n * sizeof(multi_item));
for (int x = 0; x < n; +... |
./openacc-vv/kernels_loop_tile.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,tile,reduction,combined-constructs,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[n];
real_t * b = new real_t[n];
real_t * c = new real_t[n];
real_t * d2 = new real_t[n * n];
real_t * d3 = new real_t[n * n * n];
real_t tem... |
./openacc-vv/parallel_loop_vector.F90 | #ifndef T1
!T1:parallel,combined-constructs,loop,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c !Data
INTEGER :: errors = 0
!Initilization
SEEDDIM(1) = 1
# ifd... |
./openacc-vv/kernels_copy.c | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,data,data-region,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = (real_t *)malloc(n * sizeof(real_t));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
real_t * c = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x < n; ++... |
./openacc-vv/atomic_update_x_minus_expr.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t *a = new real_t[n];
real_t *b = new real_t[n];
real_t *totals = new real_t[10];
real_t *totals_host = new real_t[10];
for (int x = 0; x < n; ++x){
a[x] = r... |
./openacc-vv/atomic_max_x_expr_list.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b !Data
REAL(8),DIMENSION(LOOPCOUNT/10 + 1):: totals, totals_comparison
INTEGER :: er... |
./openacc-vv/gang_dimensions.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,gang,dim,V:3.3
int test1(){
int err = 0;
srand(SEED);
real_t arr1[n][n];
real_t arr2[n][n];
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
arr1[i][j] = rand() / (real_t)(RAND_MAX / 10);
arr2[i][j] = arr... |
./openacc-vv/loop_collapse.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:loop,construct-independent,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[10 * n];
real_t * b = new real_t[10 * n];
real_t * c = new real_t[10 * n];
for (int x = 0; x < 10 * n; ++x){
a[x] = rand() / (real_t)(RAND_MAX /... |
./SPECaccel/benchspec/ACCEL/551.ppalm/src/package_parin.F90 | SUBROUTINE package_parin
!--------------------------------------------------------------------------------!
! This file is part of PALM.
!
! PALM is free software: you can redistribute it and/or modify it under the terms
! of the GNU General Public License as published by the Free Software Foundation,
! either versio... |
./openacc-vv/atomic_postdecrement.c | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t *a = (real_t *)malloc(n * sizeof(real_t));
real_t *b = (real_t *)malloc(n * sizeof(real_t));
int *distribution = (int *)malloc(10 * sizeof(int));
int *distribution_comp... |
./SPEChpc/tools/src/perl-5.24.0/proto.h | /* -*- buffer-read-only: t -*-
*
* proto.h
*
* Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
* 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by Larry Wall and others
*
* You may distribute under the terms of either the GNU General Public
* License or the Artistic License, a... |
./SPECaccel/benchspec/ACCEL/357.csp/src/txinvr.c | //-------------------------------------------------------------------------//
// //
// This benchmark is a serial C version of the NPB SP code. This C //
// version is developed by the Center for Manycore Programming at Seoul //
// Nati... |
./openacc-vv/data_create.c | #include "acc_testsuite.h"
#ifndef T1
//T1:data,data-region,construct-independent,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = (real_t *)malloc(n * sizeof(real_t));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
real_t * c = (real_t *)malloc(n * sizeof(real_t));
for (int x ... |
./openacc-vv/parallel_loop_reduction_min_general.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[n];
real_t * b = new real_t[n];
real_t min = 1000.0;
int found = 0;
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(... |
./openacc-vv/kernels_loop_reduction_bitxor_general.F90 | #ifndef T1
!T1:kernels,reduction,combined-constructs,loop,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
INTEGER,DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT):: randoms
INTEGER :: errors = 0
... |
./SPEChpc/tools/src/perl-5.24.0/t/porting/diag.t | #!/usr/bin/perl
BEGIN {
@INC = '..' if -f '../TestInit.pm';
}
use TestInit qw(T); # T is chdir to the top level
use warnings;
use strict;
use Config;
require 't/test.pl';
if ( $Config{usecrosscompile} ) {
skip_all( "Not all files are available during cross-compilation" );
}
plan('no_plan');
# --make-exception... |
./openacc-vv/serial_loop_reduction_bitxor_vector_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,reduction,combined-constructs,V:2.6-2.7
int test1(){
int err = 0;
srand(SEED);
unsigned int* a = (unsigned int *)malloc(10 * n * sizeof(unsigned int));
unsigned int* b = (unsigned int *)malloc(10 * sizeof(unsigned int));
unsigned int temp = 0;
... |
./openacc-vv/shutdown_device_type_nvidia.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:shutdown,runtime,syntactic,V:2.5-3.2
int test1(){
int err = 0;
#pragma acc shutdown device_type(nvidia)
return err;
}
#endif
int main(){
int failcode = 0;
int failed;
#ifndef T1
failed = 0;
for (int x = 0; x < NUM_TEST_CALLS; ++x){
failed... |
./openacc-vv/parallel_loop_reduction_max_general.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = (real_t *)malloc(n * sizeof(real_t));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
real_t max = 0.0;
int found = 0;
for (int x = 0; x < ... |
./openacc-vv/atomic_capture_assign_x_minus_expr.F90 | RECURSIVE FUNCTION IS_POSSIBLE_2(a, b, length, init) RESULT(POSSIBLE)
INTEGER, INTENT(IN) :: length
REAL(8), INTENT(IN) :: init
REAL(8),DIMENSION(length), INTENT(IN) :: a
REAL(8),DIMENSION(length), INTENT(IN) :: b
REAL(8),DIMENSION(length - 1) :: passed_a
REAL(8),DIMENSION(length - 1) :: passed_b
REAL(8) ... |
./openacc-vv/routine_bind_nonprototype_function_string_lambda.cpp | #include "acc_testsuite.h"
//test 1 host function
#pragma acc routine vector bind("device_array_array")
real_t host_array_array(real_t * a, long long n){
#pragma acc loop reduction(+:returned)
real_t returned = 0.0;
for (int x = 0; x < n; ++x){
returned += a[x];
}
return returned;
}
//test... |
./openacc-vv/parallel_loop_reduction_min_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[10 * n];
real_t * b = new real_t[10 * n];
real_t * c = new real_t[10 * n];
real_t * minimum = new real_t[10];
real_t temp = 0;
... |
./openmp-spec/OpenMP-Spec-5-2.txt | OpenMP
Application Programming
Interface
Version 5.2 November 2021
Copyright c⃝1997-2021 OpenMP Architecture Review Board.
Permission to copy without fee all or part of this material is granted, provided the OpenMP
Architecture Review Board copyright notice and the title of this document appear. Notice is
given that co... |
./openacc-vv/copyin_copyout.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:, V:1.0-2.7
int test1(){
int err = 0;
real_t test = 0;
#pragma acc parallel loop copyin(test) copyout(test) reduction(+:test)
for( int x = 0; x <n; ++x){
test += 1;
}
if(fabs(test - n) > PRECISION){
err++;
}
return err;
}
#endi... |
./openacc-vv/atomic_capture_divided_equals.c | #include "acc_testsuite.h"
bool is_possible(real_t* a, real_t* b, real_t* c, int length, real_t prev){
if (length == 0){
return true;
}
real_t *passed_a = (real_t *)malloc((length - 1) * sizeof(real_t));
real_t *passed_b = (real_t *)malloc((length - 1) * sizeof(real_t));
real_t *passed_c = (... |
./PhysiCell_GPU/sample_projects/template3D/config/PhysiCell_settings.xml | <?xml version="1.0" encoding="UTF-8"?>
<!--
/*
###############################################################################
# If you use PhysiCell in your project, please cite PhysiCell and the version #
# number, such as below: #
# ... |
./SPEChpc/tools/src/perl-5.24.0/hints/aix_4.sh | # hints/aix.sh
#
# Split off from aix.sh on 04 Feb 2004 by H.Merijn Brand
#
# AIX 4.1 hints thanks to Christopher Chan-Nui <channui@austin.ibm.com>.
# AIX 4.1 pthreading by Christopher Chan-Nui <channui@austin.ibm.com> and
# Jarkko Hietaniemi <jhi@iki.fi>.
# AIX 4.3.x LP64 build by Steven Hirsch <hirschs@btv.ibm.com>... |
./openacc-vv/atomic_update_min_x_expr_end.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT/10 + 1):: totals, totals_comparison
INTEGER :: error... |
./openacc-vv/parallel_loop_reduction_min_general.F90 | #ifndef T1
!T1:parallel,reduction,combined-constructs,loop,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b !Data
REAL(8):: minimum = 1000
REAL(8):: temp = 1000
INTEGER ::... |
./SPEChpc/benchspec/HPC/632.sph_exa_s/src/include/sph/timestep.hpp | #pragma once
#include <vector>
#include <math.h>
#include <algorithm>
#include "kernels.hpp"
#ifdef USE_MPI
#include "mpi.h"
#endif
namespace sphexa
{
namespace sph
{
template <typename T, class Dataset>
void computeTimestep(const std::vector<int> &l, Dataset &d)
{
const int n = l.size();
const int *clist =... |
./openacc-vv/data_create_no_lower_bound.c | #include "acc_testsuite.h"
#ifndef T1
//T1:data,data-region,construct-independent,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = (real_t *)malloc(n * sizeof(real_t));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
real_t * c = (real_t *)malloc(n * sizeof(real_t));
real_t * d =... |
./SPEChpc/tools/src/perl-5.24.0/ext/re/Makefile.PL | use ExtUtils::MakeMaker;
use File::Spec;
use Config;
my $object = 're_exec$(OBJ_EXT) re_comp$(OBJ_EXT) re$(OBJ_EXT)';
my $defines = '-DPERL_EXT_RE_BUILD -DPERL_EXT_RE_DEBUG -DPERL_EXT';
WriteMakefile(
NAME => 're',
VERSION_FROM => 're.pm',
XSPROTOARG => '-noprototypes',
OBJECT => $object,
DEFI... |
./SPEChpc/benchspec/HPC/605.lbm_s/src/packunpack.h | /*****************************************************************************
*
* Copyright (c) 2018, University of Ferrara, University of Rome and INFN. All rights reserved.
*
*
* Authors listed in alphabetic order:
* ----------------------------------
* Luca Biferale (University of Rome "Tor Vergata" and INFN)
* ... |
./openacc-npb/SP/SP/adi.c | //-------------------------------------------------------------------------//
// //
// This benchmark is a serial C version of the NPB SP code. This C //
// version is developed by the Center for Manycore Programming at Seoul //
// Nati... |
./openacc-vv/atomic_update_rshift_equals.c | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
unsigned int *a = (unsigned int *)malloc(n * sizeof(int));
unsigned int *b = (unsigned int *)malloc(n * sizeof(int));
for (int x = 0; x < n; ++x){
a[x] = 1<<7;
fo... |
./SPECaccel/benchspec/ACCEL/314.omriq/src/computeQ.c | /***************************************************************************
*cr
*cr (C) Copyright 2007 The Board of Trustees of the
*cr University of Illinois
*cr All Rights Reserved
*cr
********************************************************************... |
./SPEChpc/benchspec/HPC/628.pot3d_s/src/pot3d.F90 | !
!-----------------------------------------------------------------------
!
! ****** POT3D: Find the 3D potential magnetic field outside a sphere.
!
! ****** This program can find the classical potential field, the
! ****** fully open field, the source-surface field, and the
! ****** source-surface plus current-sheet ... |
./openacc-vv/atomic_update_expr_multiply_x.c | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t *a = (real_t *)malloc(n * sizeof(real_t));
real_t *b = (real_t *)malloc(n * sizeof(real_t));
real_t *totals = (real_t *)malloc((n/10 + 1) * sizeof(real_t));
real_t *tot... |
./openacc-vv/atomic_update_expr_bitor_x.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
int *a = new int[n];
int *totals = new int[(n/10 + 1)];
int *totals_comparison = new int[(n/10 + 1)];
for (int x = 0; x < n; ++x){
for (int y = 0; y < 8; ++y){
... |
./SPECaccel/benchspec/ACCEL/551.ppalm/src/header.F90 | SUBROUTINE header
!--------------------------------------------------------------------------------!
! This file is part of PALM.
!
! PALM is free software: you can redistribute it and/or modify it under the terms
! of the GNU General Public License as published by the Free Software Foundation,
! either version 3 of ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.