file_path stringlengths 19 84 | content stringlengths 235 1.29M |
|---|---|
./openacc-vv/atomic_structured_assign_x_minus_expr.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] - prev) < PRECISION){... |
./openacc-vv/atomic_capture_lshift_equals.cpp | #include "acc_testsuite.h"
bool is_possible(unsigned int a, unsigned int* b, int length, unsigned int prev){
if (length == 0){
return true;
}
unsigned int passed_a = 0;
unsigned int *passed_b = (unsigned int *)malloc((length - 1) * sizeof(unsigned int));
for (int x = 0; x < length; ++x){
... |
./openacc-vv/parallel_loop.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,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 * c = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; ... |
./openacc-vv/declare_function_scope_create.c | #include "acc_testsuite.h"
void create_test(real_t *a, real_t *b, real_t *c, real_t *d){
#pragma acc declare create(c[0:n])
#pragma acc parallel present(a[0:n], b[0:n], d[0:n])
{
#pragma acc loop
for (int x = 0; x < n; ++x){
c[x] = a[x] + b[x];
}
#pragma acc loop
... |
./openacc-vv/atomic_update_x_bitand_expr.c | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
int *a = (int *)malloc(n * sizeof(int));
int *totals = (int *)malloc((n/10 + 1) * sizeof(int));
int *totals_comparison = (int *)malloc((n/10 + 1) * sizeof(int));
for (int x ... |
./openacc-vv/serial_copy.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,data,data-region,V:2.6-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[n];
real_t * a_host = new real_t[n];
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
a_host[x] = a[x];
}
#pragma... |
./openacc-vv/atomic_capture_minus_equals.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... |
./SPEChpc/benchspec/HPC/628.pot3d_s/src/hdf5/include/H5Lpublic.h | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* ... |
./openacc-vv/kernels_if.F90 | #ifndef T1
!T1:devonly,kernels,if,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
LOGICAL,DIMENSION(1):: devtest
LOGICAL:: data_on_device = .F... |
./SPEChpc/benchspec/HPC/605.lbm_s/src/main.c | /*****************************************************************************
*
* 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-vv/atomic_capture_assign_x_eqv_expr.F90 | RECURSIVE FUNCTION IS_POSSIBLE(a, b, length, init) RESULT(POSSIBLE)
INTEGER, INTENT(IN) :: length
LOGICAL, INTENT(IN) :: init
LOGICAL,DIMENSION(length), INTENT(IN) :: a
LOGICAL,DIMENSION(length), INTENT(IN) :: b
LOGICAL,DIMENSION(length - 1) :: passed_a
LOGICAL,DIMENSION(length - 1) :: passed_b
LOGICAL ::... |
./openacc-vv/serial_default_present.F90 | #ifndef T1
!T1:serial,default,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER:: errors
REAL(8),DIMENSION(LOOPCOUNT):: a
INTEGER:: x
errors = 0
a = 0
!$acc enter data copyin(a(1:LOOPCOUNT))
!$acc serial default(present)
!$acc loop
DO x = 1, LOOPCOUNT
... |
./openacc-vv/serial_private.F90 | #ifndef T1
!T1:serial,private,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
REAL(8),DIMENSION(LOOPCOUNT, 10):: a, b
REAL(8),DIMENSION(LOOPCOUNT):: c
REAL(8),DIMENSION(10):: d
REAL(8):: temp
INTEGER:: x, y
INTEGER:: errors
errors = 0
SEEDDIM(1) = 1
# ifdef SEED
... |
./openacc-vv/atomic_update_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... |
./openacc-vv/atomic_update_expr_bitand_x.c | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
int *a = (int *)malloc(n * sizeof(int));
int *totals = (int *)malloc((n/10 + 1) * sizeof(int));
int *totals_comparison = (int *)malloc((n/10 + 1) * sizeof(int));
for (int x ... |
./SPECaccel/benchspec/ACCEL/503.postencil/src/kernels.c | /***************************************************************************
*cr
*cr (C) Copyright 2010 The Board of Trustees of the
*cr University of Illinois
*cr All Rights Reserved
*cr
********************************************************************... |
./openacc-vv/atomic_capture_assign_x_or_expr.F90 | RECURSIVE FUNCTION IS_POSSIBLE(a, b, length, init) RESULT(POSSIBLE)
INTEGER, INTENT(IN) :: length
LOGICAL, INTENT(IN) :: init
LOGICAL,DIMENSION(length), INTENT(IN) :: a
LOGICAL,DIMENSION(length), INTENT(IN) :: b
LOGICAL,DIMENSION(length - 1) :: passed_a
LOGICAL,DIMENSION(length - 1) :: passed_b
LOGICAL ::... |
./openacc-vv/atomic_capture_expr_bitand_x.c | #include "acc_testsuite.h"
bool is_possible(int* a, int* b, int length, int prev){
if (length == 0){
return true;
}
int *passed_a = (int *)malloc((length - 1) * sizeof(int));
int *passed_b = (int *)malloc((length - 1) * sizeof(int));
for (int x = 0; x < length; ++x){
if (b[x] == (a[x... |
./openacc-vv/serial_loop_reduction_and_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);
char * a = new char[10 * n];
char * b = new char[10];
char * has_false = new char[10];
char temp = 1;
real_t false_margin = pow(exp(1), log(.5)/n);
for (... |
./openacc-vv/atomic_capture_assign_min_x_expr_list.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(le... |
./openacc-vv/serial_create.c | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,data,data-region,V:2.6-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; ++x... |
./SPEChpc/benchspec/HPC/628.pot3d_s/src/hdf5/H5Dcompact.c | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* ... |
./openacc-vv/serial_loop_reduction_and_vector_loop.F90 | #ifndef T1
!T1:serial,private,reduction,combined-constructs,loop,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
LOGICAL,DIMENSION(LOOPCOUNT, 10):: a
LOGICAL,DIMENSION(10):: b, has_false
LOGICAL:: temp
REAL(8),DIMENSION(LOOPCOUNT, 10):: randoms
REAL(8):: false_margin
IN... |
./openacc-vv/atomic_capture_expr_bitand_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; ... |
./openacc-vv/set_device_type_num.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:set,runtime,syntactic,V:2.5-3.2
int test1(){
int err = 0;
int device_num;
device_num = acc_get_device_num(acc_get_device_type());
#pragma acc set device_type(host) device_num(device_num)
return err;
}
#endif
#ifndef T2
//T2:set,runtime,syntactic,V:2.5-3.2
int test2(){
... |
./openacc-vv/parallel_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,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 * c = new real_t[n];
for (int x = 0; x < n; ++x){
a[x] = 0;
}
#pragma acc data copy(a[0:n... |
./openacc-vv/parallel_loop_seq.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,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 temp = 0.0;
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
b[x] = 0... |
./openacc-vv/atomic_capture_assign_iand_expr_x.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,DIME... |
./openacc-vv/acc_delete_finalize_async.c | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,data,executable-data,reference-counting,syntactic,construct-independent,async,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));
real_t *c = (real_t *)... |
./openacc-vv/init_device_type.c | #include "acc_testsuite.h"
#ifndef T1
//T1:init,runtime,V:2.5-3.2
int test1(){
int err = 0;
srand(SEED);
#pragma acc init device_type(host)
return err;
}
#endif
#ifndef T2
//T2:init,runtime,V:2.5-3.2
int test2(){
int err = 0;
srand(SEED);
#pragma acc init device_type(multicore)
retur... |
./openacc-vv/atomic_update_expr_minus_x_end.F90 | RECURSIVE FUNCTION IS_POSSIBLE(subset, destination, length, init) RESULT(POSSIBLE)
INTEGER, INTENT(IN) :: length
REAL(8),DIMENSION(length), INTENT(IN) :: subset
REAL(8), INTENT(IN) :: destination
REAL(8), INTENT(IN) :: init
REAL(8),ALLOCATABLE :: passed(:)
LOGICAL :... |
./openacc-vv/acc_wait_all_async.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,async,construct-independent,wait,V:2.0-2.7
int test1(){
int err = 0;
real_t *a = new real_t[n];
real_t *b = new real_t[n];
real_t *c = new real_t[n];
real_t *d = new real_t[n];
real_t *e = new real_t[n];
real_t *f = new real_t[n];
real_t... |
./openacc-vv/serial_loop_reduction_and_loop.c | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,reduction,combined-constructs,V:2.6-3.2
int test1(){
int err = 0;
srand(SEED);
char * a = (char *)malloc(10 * n * sizeof(char));
char * a_copy = (char *)malloc(10 * n * sizeof(char));
char * has_false = (char *)malloc(10 * sizeof(char));
rea... |
./openacc-vv/atomic_capture_bitand_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] == (a[x] & prev)){
for (int y = 0; ... |
./openacc-vv/atomic_ixor_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_switch.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,syntactic,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
int * a = (int *)malloc(n * sizeof(int));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
real_t * b_host = (real_t *)malloc(n * sizeof(real_t));
real_t * c = (real_t *)malloc(n * si... |
./openacc-vv/atomic_x_or_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, 10):: randoms
LOGICAL,DIMENSION(LOOPCOUNT, 10):: a !Data
LOGICAL,DIMENSION(LOOPCOUNT):: to... |
./openacc-vv/serial_loop.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 * c = new real_t[n];
for (int x = 0; x < n; ++x){
a[x] = 0;
}
#pragma acc data copy(a[0:n])... |
./openacc-vv/acc_get_default_async.c | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,async,construct-independent,internal-control-values,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));
int holder ... |
./SPEChpc/benchspec/HPC/618.tealeaf_s/src/2d/c_kernels/cg.c | #include <stdlib.h>
#include "../shared.h"
/*
* CONJUGATE GRADIENT SOLVER KERNEL
*/
// Initialises the CG solver
void cg_init(
const int x,
const int y,
const int halo_depth,
const int coefficient,
double rx,
double ry,
double* rro,
double* density,
... |
./SPECaccel/benchspec/ACCEL/557.pcsp/src/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/kernels_loop_reduction_bitor_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);
unsigned int* a = (unsigned int *)malloc(10 * n * sizeof(unsigned int));
unsigned int* b = (unsigned int *)malloc(10 * sizeof(unsigned int));
real_t false_margin = ... |
./openacc-vv/acc_set_default_async.c | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,async,construct-independent,set,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 *a_host = (real_t *)mall... |
./SPECaccel/benchspec/ACCEL/557.pcsp/src/set_constants.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/parallel_implicit_data_attributes.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,data,data-region,V:2.0-3.3
int test1(){
int err = 0;
srand(SEED);
int test = rand()/(real_t)(RAND_MAX/10);
int host = test;
#pragma acc parallel default(none) reduction(+:test)
for(int x = 0; x < n; ++x){
test += 1;
}
if(fabs( test ... |
./openacc-vv/kernels_present.c | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,data,structured-data,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));
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10)... |
./openacc-vv/atomic_x_divided_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):: a !Data
REAL(8),DIMENSION(LOOPCOUNT):: totals, totals_comparison
INTEGER :: errors =... |
./SPECaccel/benchspec/ACCEL/370.bt/src/exact_rhs.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/atomic_structured_assign_x_multiply_expr.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] - prev) < PRECISION){... |
./openacc-vv/parallel_loop_reduction_bitand_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 * n * sizeof(unsigned int));
unsigned int * b... |
./openacc-vv/parallel_copyin.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,data,data-region,V:2.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[n];
real_t * a_copy = new real_t[n];
real_t * b = new real_t[n];
int* hasDevice = (int *) malloc(sizeof(int));
hasDevice[0] = 1;
#pragma acc enter... |
./openacc-vv/kernels_loop_reduction_bitand_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, y, z !Iterators
INTEGER,DIMENSION(LOOPCOUNT):: a !Data
INTEGER :: b
REAL(8),DIMENSION(16 * LOOPCOUNT):: randoms
... |
./SPEChpc/benchspec/HPC/613.soma_s/src/cmdline.h | #include "soma_config.h"
/** @file cmdline.h
* @brief The header file for the command line option parser
* generated by GNU Gengetopt version 2.22.6
* http://www.gnu.org/software/gengetopt.
* DO NOT modify this file, since it can be overwritten
* @author GNU Gengetopt by Lorenzo Bettini */
#ifndef CMDLINE_H
... |
./openacc-vv/acc_wait.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 !Data
REAL(8) :: RAND
INTEGER :: errors = 0
... |
./openacc-vv/atomic_max_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
REAL(8),DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT/10 + 1):: totals, totals_comparison
INTEGER :: error... |
./openacc-vv/serial_scalar_default_firstprivate.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:data,default-mapping,serial,firstprivate,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 scalar = rand() / (real_t)(RAND_MAX / 10);
real_t scalar_copy = scalar;
for (int x = 0; x < n; ... |
./openacc-vv/reference_count_zero.c | #include "acc_testsuite.h"
#ifndef T1
//T1:reference-counting,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... |
./openacc-vv/kernels_loop_worker_blocking.c | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,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 multiplyer = 1;
for (int x = 0; x < n; +... |
./openacc-npb/BT/BT/bt.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/declare_function_scope_deviceptr.c | #include "acc_testsuite.h"
void declare_deviceptr(real_t *a, real_t *b, real_t *c, real_t *d){
#pragma acc declare deviceptr(c)
#pragma acc parallel present(a[0:n], b[0:n], d[0:n])
{
#pragma acc loop
for (int x = 0; x < n; ++x){
c[x] = c[x] + a[x] + b[x];
}
#pragm... |
./openacc-vv/atomic_capture_minus_equals.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] - (prev - a[x])) < PR... |
./openacc-vv/kernels_loop_reduction_max_general.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);
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 < n... |
./SPECaccel/benchspec/ACCEL/514.pomriq/src/computeQ.c | /***************************************************************************
*cr
*cr (C) Copyright 2007 The Board of Trustees of the
*cr University of Illinois
*cr All Rights Reserved
*cr
********************************************************************... |
./openacc-vv/acc_set_device_num.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,set,V:2.0-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(:, :),ALLOCATABLE :: ... |
./SPEChpc/benchspec/HPC/618.tealeaf_s/src/2d/c_kernels/store_energy.c | #include "../shared.h"
// Store original energy state
void store_energy(
int x,
int y,
double* energy0,
double* energy)
{
#if defined(SPEC_OPENMP) || defined(SPEC_OPENMP_TARGET)
#pragma omp parallel for
#endif
for(int ii = 0; ii < x*y; ++ii)
{
energy[ii] = energy0[ii];
... |
./SPECaccel/benchspec/ACCEL/350.md/src/g.f | !*******************************************************************************
!
! MD 6.0.7
! ---------------------------------------------------------------------
! Copyright 2009, The Trustees of Indiana University
! Authors: Charles J. Horowitz, Don Berry
! Last modified by: Don Berry... |
./openacc-vv/atomic_structured_assign_predecrement.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/acc_map_data.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,data,executable-data,construct-independent,V:2.0-2.7
int test1(){
int err = 0;
real_t *a = new real_t[n];
real_t *b = new real_t[n];
real_t *c = new real_t[n];
real_t *d;
real_t *e = new real_t[n];
d = (real_t *)acc_malloc(n * sizeof(real_t... |
./SPEChpc/tools/src/perl-5.24.0/cpan/IO-Compress/t/compress/generic.pl |
use strict;
use warnings;
use bytes;
use Test::More ;
use IO::Handle qw(SEEK_SET SEEK_CUR SEEK_END);
use CompTestUtils;
our ($UncompressClass);
BEGIN
{
# use Test::NoWarnings, if available
my $extra = 0 ;
my $st = eval { require Test::NoWarnings ; import Test::NoWarnings; 1; };
$extra = 1
... |
./SPEChpc/benchspec/HPC/605.lbm_s/src/bc_kernel.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-vv/atomic_update_expr_minus_x.c | #include "acc_testsuite.h"
bool possible_result(real_t * remaining_combinations, int length, real_t current_value, real_t test_value){
if (length == 0){
if (fabs(current_value - test_value) > PRECISION){
return true;
}
else {
return false;
}
}
real_t *... |
./openacc-vv/kernels_async.F90 | #ifndef T1
!T1:async,kernels,update,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c, d, e, f, g !Data
INTEGER :: errors = 0
!Initilization
SEEDDIM(1) = 1
# ifde... |
./openacc-vv/serial_loop_reduction_and_general.c | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,reduction,combined-constructs,V:2.6-2.7
int test1(){
int err = 0;
srand(SEED);
char * a = (char *)malloc(n * sizeof(char));
real_t false_margin = pow(exp(1), log(.5)/n);
char result = 1;
char found = 0;
for (int x = 0; x < n; ++x){
... |
./openacc-vv/kernels_loop_reduction_multiply_general.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
int multiplicitive_n = 128;
srand(SEED);
real_t * a = new real_t[multiplicitive_n];
real_t * b = new real_t[multiplicitive_n];
real_t multiplied_total = 1.0;
for (int x... |
./SPEChpc/tools/src/tar-1.28/gnu/regexec.c | /* -*- buffer-read-only: t -*- vi: set ro: */
/* DO NOT EDIT! GENERATED AUTOMATICALLY! */
/* Extended regular expression matching and search library.
Copyright (C) 2002-2014 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
The GNU ... |
./openacc-vv/serial_loop_reduction_bitor_vector_loop.c | #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/serial_loop_reduction_bitor_loop.F90 | #ifndef T1
!T1:serial,private,reduction,combined-constructs,loop,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER:: errors, x, y, z, temp
INTEGER,DIMENSION(LOOPCOUNT, 10):: a, b, b_copy
INTEGER,DIMENSION(10):: c
REAL(8):: false_margin
REAL(8),DIMENSION(LOOPCOUNT, 1... |
./openacc-vv/atomic_min_expr_list_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, b !Data
REAL(8),DIMENSION(LOOPCOUNT/10 + 1):: totals, totals_comparison
INTEGER :: er... |
./openacc-vv/acc_delete_finalize_async_with_len.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
INTEGER :: errors = 0
... |
./openacc-vv/atomic_structured_lshift_equals_assign.cpp | #include "acc_testsuite.h"
bool is_possible(unsigned int a, unsigned int* b, int length, unsigned int prev){
if (length == 0){
return true;
}
unsigned int passed_a = 0;
unsigned int *passed_b = (unsigned int *)malloc((length - 1) * sizeof(unsigned int));
for (int x = 0; x < length; ++x){
... |
./openacc-vv/acc_copyin.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,data,executable-data,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 * c = new real_t[n];
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_M... |
./PhysiCell_GPU/sample_projects/beta_testing/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: #
# ... |
./openacc-vv/parallel.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t* a = (real_t *) malloc(1024 * sizeof(real_t));
real_t* b = (real_t *) malloc(1024 * sizeof(real_t));
real_t* c = (real_t *) malloc(1024 * sizeof(real_t));
for(int x = 0; x < 1024; ++x){
... |
./openacc-vv/atomic_structured_assign_lshift_equals.c | #include "acc_testsuite.h"
bool is_possible(unsigned int a, unsigned int* b, int length, unsigned int prev){
if (length == 0){
return true;
}
unsigned int passed_a = 0;
unsigned int *passed_b = (unsigned int *)malloc((length - 1) * sizeof(unsigned int));
for (int x = 0; x < length; ++x){
... |
./openacc-vv/kernels_loop_vector_blocking.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,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 * c = new real_t[n];
real_t multiplyer = 1;
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
b[x] = rand... |
./SPEChpc/benchspec/HPC/634.hpgmgfv_s/src/operators/problem.fv.c | //------------------------------------------------------------------------------------------------------------------------------
// Samuel Williams
// SWWilliams@lbl.gov
// Lawrence Berkeley National Lab
//------------------------------------------------------------------------------------------------------------------... |
./openacc-vv/kernels_loop_reduction_add_general.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);
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)(... |
./openacc-vv/kernels_default_present.F90 | #ifndef T1
!T1:kernels,default,V:2.5-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b !Data
INTEGER :: errors = 0
!Initilization
SEEDDIM(1) = 1
# ifdef SEED
SEEDD... |
./openacc-vv/atomic_update_expr_plus_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):: a !Data
REAL(8),DIMENSION(LOOPCOUNT):: totals, totals_comparison
INTEGER :: errors =... |
./SPEChpc/tools/src/perl-5.24.0/t/re/recompile.t | #!./perl
# Check that we don't recompile runtime patterns when the pattern hasn't
# changed
#
# Works by checking the debugging output of 'use re debug' and, if
# available, -Dr. We use both to check that the different code paths
# with Perl_foo() versus the my_foo() under ext/re/ don't cause any
# changes.
$| = 1;
... |
./openacc-vv/parallel_loop_reduction_bitor_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));
real_t false_margin =... |
./openacc-vv/kernels_loop_reduction_multiply_vector_loop.c | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,reduction,combined-constructs,V:1.0-2.7
int test1(){
int err = 0;
int multiplicitive_n = 128;
srand(SEED);
real_t * a = (real_t *)malloc(10 * multiplicitive_n * sizeof(real_t));
real_t * b = (real_t *)malloc(10 * multiplicitive_n * sizeof(real_... |
./openacc-vv/acc_init.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,init,nonvalidating,V:1.0-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
IF (acc_get_device_type() .ne. acc_device_none) THEN
CALL acc_init(acc_get_device_type())
... |
./openacc-vv/serial_loop_reduction_and_general.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);
char * a = new char[n];
real_t false_margin = pow(exp(1), log(.5)/n);
char result = 1;
char found = 0;
for (int x = 0; x < n; ++x){
if(rand() / (real... |
./openacc-vv/parallel_loop_reduction_min_vector_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
REAL(8),DIMENSION(10*LOOPCOUNT):: a, b !Data
REAL(8),DIMENSION(10):: minimum
REAL(8):: temp = 100... |
./openacc-vv/data_wait.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:async,data,wait,V:3.2-3.3
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];
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
b[x] = rand() / (... |
./openacc-vv/acc_free.F90 | #ifndef T1
!T1:runtime,data,executable-data,V:3.3
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
REAL(8),DIMENSION(LOOPCOUNT):: initial_memory, final_memory !Data
INTEGER, POINTER :: a(:)
INTEGER :: errors = 0
initial_memory =... |
./SPEChpc/benchspec/HPC/632.sph_exa_s/src/include/sph/momentumAndEnergyIAD.hpp | #pragma once
#include <vector>
#include <cmath>
#include "math.hpp"
#include "kernels.hpp"
namespace sphexa
{
namespace sph
{
template <typename T, class Dataset>
void computeIADImpl(const std::vector<int> &l, Dataset &d)
{
const int64_t n = l.size();
const int64_t ngmax = d.ngmax;
const int *clist = l.... |
./openacc-vv/atomic_x_divided_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[(n/10 + 1)];
real_t *totals_comparison = new real_t[(n/10 + 1)];
for (int x = 0; x < n; ... |
./openacc-vv/data_copyout_zero.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:data,executable-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 a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.