file_path stringlengths 19 84 | content stringlengths 235 1.29M |
|---|---|
./openacc-vv/serial_loop_reduction_multiply_general.F90 | #ifndef T1
!T1:serial,reduction,combined-constructs,loop,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
REAL(8),DIMENSION(10):: a, b
REAL(8):: reduced, host_reduced
INTEGER:: errors, x, y
errors = 0
SEEDDIM(1) = 1
# ifdef SEED
SEEDDIM(1) = SEED
# endif
CALL RANDOM_S... |
./openacc-vv/atomic_x_eqv_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-npb/CG/CG/cg.c | //-------------------------------------------------------------------------//
// //
// This benchmark is a serial C version of the NPB CG code. This C //
// version is developed by the Center for Manycore Programming at Seoul //
// Nati... |
./openacc-vv/wait_if.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,wait,async,if,V:2.7-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];
real_t *d = new real_t[n];
real_t *e = new real_t[n];
real_t *f = new real_t[n];
for (... |
./openacc-vv/atomic_expr_minus_x.cpp | #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/parallel_reduction.F90 | #ifndef T1
!T1:parallel,reduction,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a !Data
REAL(8) :: results = 0
INTEGER :: errors = 0
!Initilization
SEEDDIM(1) = 1
#... |
./openacc-vv/atomic_plus_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((n/10 + 1) * sizeof(real_t));
real_t *tot... |
./openacc-vv/atomic_update_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/exit_data_copyout_reference_counts.F90 | #ifndef T1
!T1:data,executable-data,devonly,construct-independent,V:2.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
INTEGER,DIMENSION(1):: devtest
... |
./openacc-vv/atomic_update_preincrement.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... |
./SPECaccel/benchspec/ACCEL/557.pcsp/src/error.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/serial_loop_reduction_bitxor_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);
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_c... |
./openacc-vv/serial_loop_seq.c | #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 = (real_t *)malloc(n * sizeof(real_t));
real_t * b = (real_t *)malloc(n * sizeof(real_t));
real_t temp = 0.0;
for (int x = 0; x < n; ++x){
a[x] = rand()... |
./openacc-vv/serial_loop_reduction_bitor_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);
unsigned int * a = (unsigned int *)malloc(n * sizeof(unsigned int));
unsigned int b = 0;
unsigned int host_b;
real_t false_margin = pow(exp(1), log(.5)/n);
un... |
./PhysiCell_GPU/sample_projects/virus_macrophage/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: #
# ... |
./SPECaccel/benchspec/ACCEL/551.ppalm/data/test/input/ENVPAR | &envpar run_identifier = 'acc_small', host = 'unknown',
write_binary = 'false', tasks_per_node = 1,
maximum_cpu_time_allowed = 999999.,
revision = 'Rev: ',
local_dvrserver_running = .FALSE. /
|
./openacc-vv/atomic_structured_divided_equals_assign.cpp | #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 = new real_t[(length - 1)];
real_t *passed_b = new real_t[(length - 1)];
real_t *passed_c = new real_t[(length - 1)];
for (int x = 0; x... |
./openacc-vv/atomic_capture_rshift_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){
... |
./PhysiCell_GPU/unit_tests/substrate_internalization/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/benchspec/HPC/628.pot3d_s/src/hdf5/H5HFiblock.c | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* ... |
./openacc-vv/serial_copy.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 * a_host = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10)... |
./openacc-vv/acc_async_test.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:async,runtime,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 = new real_t[n];
real_t *e = new real_t[n];
for (int x = 0; x < n; ++x){
a[x]... |
./openacc-vv/kernels_loop_vector_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-vv/atomic_structured_predecrement_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_capture_expr_minus_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... |
./SPECaccel/benchspec/ACCEL/351.palm/src/cpu_statistics.F90 | SUBROUTINE cpu_statistics
!--------------------------------------------------------------------------------!
! 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 versi... |
./openacc-vv/set_device_type_num_nvidia.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,set,nonvalidating,V:2.5-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: device_num
INTEGER :: device_type
INTEGER :: errors = 0
device_type = a... |
./openacc-vv/serial_loop_reduction_bitand_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,reduction,combined-constructs,V:2.6-3.2
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_c... |
./openacc-vv/exit_data_finalize.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:data,executable-data,reference-counting,construct-independent,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 * c = new real_t[n];
int * devtest = (int *)malloc(sizeof(int));
devtest[0... |
./SPECaccel/benchspec/ACCEL/357.csp/src/sp.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_structured_expr_bitand_x_assign.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] == (pre... |
./openacc-vv/kernels_num_workers.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,V:2.5-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * restrict a = new real_t[n];
real_t * restrict 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 d... |
./openacc-vv/atomic_structured_expr_bitor_x_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/kernels_loop_reduction_multiply_vector_loop.F90 | #ifndef T1
!T1:kernels,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) :: c
REAL(8) :: temp
... |
./openacc-vv/acc_get_device_num.c | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,devonly,internal-control-values,syntactic,V:1.0-2.7
int test1(){
int err = 0;
if (acc_get_device_type() != acc_device_none){
for (int x = 0; x < acc_get_num_devices(acc_get_device_type()); ++x){
acc_set_device_num(x, acc_get_device_type());... |
./openacc-vv/data_create.cpp | #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 = 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);
... |
./SPEChpc/benchspec/HPC/628.pot3d_s/src/hdf5/H5HFdtable.c | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* ... |
./openacc-vv/kernels_loop_reduction_bitxor_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);
unsigned int * a = (unsigned int *)malloc(n * sizeof(unsigned int));
unsigned int b = 0;
for (int x = 0; x < n; ++x){
a[x] = (unsigned int) rand() / (real_t... |
./openacc-vv/kernels_loop_reduction_and_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);
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));
re... |
./openacc-vv/serial_loop_worker_blocking.F90 | #ifndef T1
!T1:loop,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c
INTEGER:: multiplier
INTEGER:: x
INTEGER:: errors
errors = 0
SEEDDIM(1) = 1
# ifdef SEED
SEEDDIM(1) = SEED
# endif
CALL RANDOM_SEED(PUT=SEEDDIM)
CALL RAND... |
./openacc-vv/parallel_create_zero.c | #include "acc_testsuite.h"
#ifndef T1
//#T1:parallel,data,data_region,V:3.0-3.2
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);
... |
./PhysiCell_GPU/main.cpp | /*
###############################################################################
# If you use PhysiCell in your project, please cite PhysiCell and the version #
# number, such as below: #
# ... |
./openacc-vv/parallel_copyin.F90 | #ifndef T1
!T1:parallel,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, a_copy, b !Data
INTEGER :: errors = 0
INTEGER,DIMENSION(1):: hasDevice
hasDevice(1) = 1
!In... |
./openacc-vv/parallel_loop_reduction_bitand_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);
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_on_device.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,present,V:1.0-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: errors
INTEGER :: device_type
errors = 0
device_type = acc_get_device_type()
... |
./openacc-vv/init.c | #include "acc_testsuite.h"
#ifndef T1
//T1:init,V:2.5-2.7
int test1(){
int err = 0;
srand(SEED);
#pragma acc init
return err;
}
#endif
int main(){
int failcode = 0;
int failed;
#ifndef T1
failed = 0;
for (int x = 0; x < NUM_TEST_CALLS; ++x){
failed = failed + test1();
}
... |
./PhysiCell_GPU/examples/PhysiCell_test_mechanics_2.cpp | /*
###############################################################################
# If you use PhysiCell in your project, please cite PhysiCell and the version #
# number, such as below: #
# ... |
./openacc-vv/atomic_update_x_plus_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):: a !Data
REAL(8),DIMENSION(LOOPCOUNT):: totals, totals_comparison
INTEGER :: errors =... |
./SPECaccel/tools/src/tar-1.25/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, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free
Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Isamu... |
./openacc-vv/kernels_loop_reduction_bitand_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/serial_loop_reduction_max_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"
REAL(8),DIMENSION(LOOPCOUNT, 10):: a, b
REAL(8),DIMENSION(10):: maximums, host_maximums
REAL(8):: temp
INTEGER:: errors, x, y
errors = 0
SEEDDIM(1) = 1
# i... |
./openacc-vv/kernels_loop_seq.F90 | #ifndef T1
!T1:kernels,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
INTEGER :: errors = 0
!Initilization
SEEDDIM(1) = 1
# ifdef S... |
./SPECaccel/tools/src/perl-5.12.3/regcomp.c | /* regcomp.c
*/
/*
* 'A fair jaw-cracker dwarf-language must be.' --Samwise Gamgee
*
* [p.285 of _The Lord of the Rings_, II/iii: "The Ring Goes South"]
*/
/* This file contains functions for compiling a regular expression. See
* also regexec.c which funnily enough, contains functions for exe... |
./openacc-vv/data_create.F90 | #ifndef T1
!T1:data,data_region,construct-independent,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
# ... |
./openacc-vv/parallel_loop_reduction_bitand_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);
n = 10;
unsigned int * a = (unsigned int *)malloc(n * sizeof(unsigned int));
real_t false_margin = pow(exp(1), log(.5)/n);
unsigned int temp = 1;
unsigned i... |
./openacc-npb/BT/BT/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/parallel_implicit_data_attributes.c | #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/atomic_x_neqv_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/atomic_structured_x_multiply_expr_assign.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... |
./SPEChpc/benchspec/HPC/618.tealeaf_s/src/2d/c_kernels/diffuse_overload.c | #include "../drivers/drivers.h"
#include "../application.h"
#include "../comms.h"
void solve(Chunk* chunks, Settings* settings, int tt, double* wallclock_prev);
// An implementation specific overload of the main timestep loop
void diffuse_overload(Chunk* chunks, Settings* settings)
{
int n = chunks->x*chunks->y;
... |
./openacc-vv/atomic_structured_assign_x_plus_expr.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/kernels_loop_reduction_bitand_vector_loop.F90 | #ifndef T1
!T1:kernels,private,reduction,combined-constructs,loop,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y, z, i !Iterators
INTEGER,DIMENSION(10*LOOPCOUNT):: a !Data
INTEGER,DIMENSION(10):: b
INTEGER :: c
RE... |
./openacc-vv/parallel_loop_auto.F90 | #ifndef T1
!T1:parallel,combined-constructs,loop,auto,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, a_copy, b !Data
REAL(8) :: temp
INTEGER :: errors = 0
!Initilization
... |
./openacc-vv/atomic_update_expr_divided_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/parallel_scalar_default_firstprivate.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,data,data-region,default-mapping,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 scalar = rand() / (real_t)(RAND_MAX / 10);
real_t scalar_copy = scalar;
for (int x = 0; x < n;... |
./openacc-vv/atomic_capture_x_times_expr_assign.F90 | RECURSIVE FUNCTION IS_POSSIBLE(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) ::... |
./SPEChpc/benchspec/HPC/613.soma_s/src/polymer.c | /* Copyright (C) 2016-2017 Ludwig Schneider
This file is part of SOMA.
SOMA is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
S... |
./SPECaccel/benchspec/ACCEL/551.ppalm/src/modules.F90 | MODULE advection
!--------------------------------------------------------------------------------!
! 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 t... |
./SPEChpc/benchspec/HPC/613.soma_s/src/rng.c | /* Copyright (C) 2016 Ludwig Schneider
Copyright (C) 2016 Ulrich Welling
Copyright (C) 2016 Marcel Langenberg
Copyright (C) 2016 Fabien Leonforte
Copyright (C) 2016 Juan Orozco
Copyright (C) 2016 Yongzhi Ren
This file is part of SOMA.
SOMA is free software: you can redistribute it and/or modify
it u... |
./openacc-vv/kernels_loop_reduction_and_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
REAL(8),DIMENSION(LOOPCOUNT):: randoms
LOGICAL,DIMENSION(LOOPCOUNT):: a !Data
LOGICAL :: results = .TRUE.
... |
./openacc-vv/serial.c | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,V:2.6-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_x_bitand_expr.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_copy.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,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 * a_host = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 1... |
./openacc-vv/parallel_loop_reduction_max_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, c !Data
REAL(8),DIMENSION(10):: maximum
REAL(8) :: tem... |
./openacc-vv/atomic_structured_postdecrement_assign.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 *c = new int[n];
int *distribution = new int[10];
int *distribution_comparison = new int[10];
bool found = fa... |
./openacc-vv/atomic_structured_assign_expr_bitxor_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] == prev... |
./openacc-vv/acc_delete_finalize.F90 | #ifndef T1
!T1:runtime,data,executable-data,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 !Data
INTEGER :: errors = 0
!Initilizati... |
./openacc-vv/acc_memcpy_from_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... |
./openacc-vv/serial_present.c | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,present,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){
... |
./SPECaccel/bin/runspec | #!/spec/accel/bin/specperl
#!/spec/accel/bin/specperl -d
#!/usr/bin/perl
#
# runspec - a tool for running SPEC benchmarks.
# Copyright 1995-2015 Standard Performance Evaluation Corporation
#
# Authors: Christopher Chan-Nui
# Cloyce D. Spradling
#
# $Id: runspec 2989 2015-03-03 18:59:03Z CloyceS $
# Note... |
./openacc-vv/atomic_update_max_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
REAL(8),DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT/10 + 1):: totals, totals_comparison
INTEGER :: error... |
./SPECaccel/benchspec/ACCEL/370.bt/src/y_solve.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... |
./SPEChpc/benchspec/HPC/613.soma_s/src/soma_util.c | /* Copyright (C) 2016-2017 Ludwig Schneider
This file is part of SOMA.
SOMA is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
S... |
./MURaM_main/include/muramacc.H | #ifndef __MURAMACC__
#define __MURAMACC__
#define STRINGIFY(a) #a
// NVIDIA NV TOOLS Profiler Push/Pop
#ifdef USE_NVTX
#include "nvToolsExt.h"
const uint32_t ProfilerColors[] = { 0xff00ff00, 0xff0000ff, 0xffffff00, 0xffff00ff, 0xff00ffff, 0xffff0000, 0xffffffff };
#define NVPROF_PUSH_RANGE(name,cid) { \
int color... |
./openacc-vv/parallel_independent_atomic_write.c | #include "acc_testsuite.h"
#ifndef T1
//T1:atomic,construct-independent,V:2.7-3.2
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_rshift_expr.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(n * sizeof(int));
unsigned int *b = (unsigned int *)malloc(n * sizeof(int));
for (int x = 0; x < n; ++x){
a[x] = 1<<7;
fo... |
./openacc-vv/kernels_loop_reduction_bitand_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 * n * sizeof(unsigned int));
unsigned int * b_... |
./openacc-vv/atomic_structured_assign_preincrement.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/init_if.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:init,if,V:2.7-3.0
int test1(){
int err = 0;
srand(SEED);
int device_num = acc_get_device_num(acc_get_device_type());
#pragma acc init if(device_num == device_num)
return err;
}
#endif
#ifndef T2
//T2:init,if,V:2.7-3.0
int test2(){
int err = 0;
srand(SEED);
int d... |
./openacc-vv/serial_loop_reduction_and_general.F90 | #ifndef T1
!T1:serial,reduction,combined-constructs,loop,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER:: errors
INTEGER:: x
LOGICAL,DIMENSION(LOOPCOUNT):: a
LOGICAL:: result, host_result
REAL(8),DIMENSION(LOOPCOUNT):: randoms
REAL(8):: false_margin = EXP(LOG(.... |
./openacc-vv/atomic_update_expr_divided_x.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 :... |
./SPECaccel/benchspec/ACCEL/122.cfd/src/util.h | #ifndef _C_UTIL_
#define _C_UTIL_
#include <math.h>
#include <iostream>
#include <omp.h>
#ifdef _WIN32
#include <stdlib.h>
#ifdef __MINGW32__
#include <sys/time.h>
#else
#error "no supported time libraries are available on this platform"
#endif
#else
#include <sys/time.h>
#endif
#ifdef SPEC_ACCEL_WG_SIZE_0_0
#define... |
./openacc-vv/kernels_num_workers.c | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,V:2.5-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * restrict a = (real_t *)malloc(n * sizeof(real_t));
real_t * restrict b = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 1... |
./openacc-vv/parallel_wait.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,wait,async,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);
b... |
./openacc-vv/kernels_loop_reduction_or_vector_loop.F90 | #ifndef T1
!T1:kernels,private,reduction,combined-constructs,loop,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
LOGICAL,DIMENSION(10*LOOPCOUNT):: a !Data
LOGICAL,DIMENSION(10) :: b
LOGICAL :: temp
REAL... |
./openacc-vv/acc_deviceptr.c | #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 = (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_ptr;
r... |
./openacc-vv/shutdown_device_type_num.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,shutdown,nonvalidating,V:2.5-3.2
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: device_num
INTEGER :: device_type
INTEGER :: errors = 0
device_typ... |
./openacc-vv/declare_copyin.cpp | #define DECLARE_TEST
#define DECLARE_COPYIN
int mult_copyin = 2;
#include "acc_testsuite_declare.h"
#include "acc_testsuite.h"
#pragma acc declare copyin(fixed_size_array)
#pragma acc declare copyin(scalar)
#pragma acc declare copyin(datapointer)
#pragma acc declare copyin(n)
#pragma acc routine vector
void multiplyDa... |
./openacc-vv/enter_data_copyin_no_lower_bound.F90 | #ifndef T1
!T1:data,executable-data,construct-independent,V:2.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
# ... |
./openacc-vv/acc_copyout_async.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,data,executable-data,async,construct-independent,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 *c = new real_t[n];
real_t *d = new real_t[n];
real_t *e = new real_t[n];
real... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.