file_path stringlengths 19 84 | content stringlengths 235 1.29M |
|---|---|
./SPEChpc/benchspec/HPC/628.pot3d_s/src/hdf5/H5Gtraverse.c | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* ... |
./openacc-vv/atomic_update_expr_eqv_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/serial_loop_reduction_max_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);
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;... |
./openacc-vv/parallel_loop_reduction_and_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
LOGICAL,DIMENSION(10*LOOPCOUNT):: a !Data
LOGICAL,DIMENSION(10):: b
LOGICAL,DIMENSION(10):: has_... |
./openacc-vv/parallel_loop_auto.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,loop,combined-constructs,V:2.0-2.7
//data dependent, treated with as a seq clause. Added the num_gangs clause with 1
int test1(){
int err = 0;
srand(SEED);
real_t * device = new real_t[n];
real_t * host = new real_t[n];
for (int x = 0; x < n; ++x... |
./openacc-vv/acc_update_self_with_len.F90 | #ifndef T1
!T1:runtime,data,executable-data,construct-independent,update,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 !Data
REAL(8) :: RAND
INTEGER :: e... |
./openacc-vv/shutdown_device_type_num.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:shutdown,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 shutdown device_type(host) device_num(device_num)
return err;
}
#endif
#ifndef T2
//T2:shutdown,runtime,synt... |
./openacc-vv/atomic_capture_expr_lshift_x.c | #include "acc_testsuite.h"
bool is_possible(unsigned int* a, unsigned int* b, int length, int prev){
if (length == 0){
return true;
}
unsigned int *passed_a = (unsigned int *)malloc((length - 1) * sizeof(int));
unsigned int *passed_b = (unsigned int *)malloc((length - 1) * sizeof(int));
for ... |
./openacc-vv/atomic_structured_x_rshift_expr_assign.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_copyout.cpp | #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 = 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/reference_count_zero.cpp | #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 = 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] = ra... |
./openacc-vv/atomic_capture_x_eqv_expr_assign.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_update_x_bitor_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/parallel_loop_reduction_max_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);
real_t * a = new real_t[10 * n];
real_t * b = new real_t[10 * n];
real_t * max = new real_t[10];
real_t temp = 0;
real_t temp_max;
for (int x = 0; x < ... |
./openacc-vv/kernels_create_zero.c | #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 = (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/serial_loop_reduction_add_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);
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))... |
./openacc-vv/kernels_loop.c | #include "acc_testsuite.h"
#ifndef T1
//T1:kernels,loop,combined-constructs,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));
for (int x = 0; x < 1024; ++x){
a[x] = rand() / (real_t)(... |
./openacc-vv/atomic_update_ior_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
INTEGER,DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT, 8):: randoms
INTEGER,DIMENSION(LOOPCOUNT/10 + 1):: ... |
./openacc-vv/serial_wait.F90 | #ifndef T1
!T1:async,serial,update,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
REAL(8),DIMENSION(LOOPCOUNT):: a, a_copy
INTEGER:: errors, x
errors = 0
SEEDDIM(1) = 1
# ifdef SEED
SEEDDIM(1) = SEED
# endif
CALL RANDOM_SEED(PUT=SEEDDIM)
CALL RANDOM_NUMBER(a)
a_... |
./openacc-vv/set_device_type.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:set,runtime,syntactic,V:2.5-3.2
int test1(){
int err = 0;
int device_type = acc_get_device_type();
#pragma acc set device_type(host)
if (acc_get_device_type() != device_type){
err += 1;
}
return err;
}
#endif
#ifndef T2
//T2:set,runtime,synta... |
./openacc-vv/init_device_type_nvidia.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(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/atomic_min_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_loop_vector.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 * c = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x ... |
./openacc-vv/atomic_update_x_multiply_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/atomic_capture_postincrement.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/parallel_loop_worker.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] = rand() / (real_t)(RAND_MAX / 10);
... |
./MURaM_main/src/analysis_hmean_Corona.C | #include <mpi.h>
#include <fstream>
#include <cmath>
#include <stdlib.h>
#include "analysis.H"
#include "physics.H"
#include "grid.H"
#include "run.H"
#include "rt/rt.h"
#include "comm_split.H"
#include "limit_va.H"
using namespace std;
void AnalyzeSolution_VP(const RunData& Run,const GridData& Grid,
const ... |
./openacc-vv/parallel_loop_reduction_add_general_type_check_pt2.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,reduction,combined-constructs,loop,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
unsigned short int * a = (unsigned short int*)malloc(n * sizeof(unsigned short int));
unsigned short int * b = (unsigned short int *)malloc(n * sizeof(unsigned short in... |
./openacc-vv/init_device_type_num_nvidia.c | #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/parallel_independent_atomic.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_structured_x_divided_expr_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... |
./SPEChpc/tools/src/xz-5.2.2/ChangeLog | commit 9815cdf6987ef91a85493bfcfd1ce2aaf3b47a0a
Author: Lasse Collin <lasse.collin@tukaani.org>
Date: 2015-09-29 13:59:35 +0300
Bump version and soname for 5.2.2.
src/liblzma/Makefile.am | 2 +-
src/liblzma/api/lzma/version.h | 2 +-
2 files changed, 2 insertions(+), 2 deletions(-)
commit cbe0cec8476bd... |
./openacc-vv/shutdown.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:shutdown,V:2.5-2.7
int test1(){
int err = 0;
srand(SEED);
#pragma acc shutdown
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();
... |
./SPECaccel/tools/src/perl-5.12.3/lib/unicore/mktables | #!/usr/bin/perl -w
# !!!!!!!!!!!!!! IF YOU MODIFY THIS FILE !!!!!!!!!!!!!!!!!!!!!!!!!
# Any files created or read by this program should be listed in 'mktables.lst'
# Use -makelist to regenerate it.
# Needs 'no overloading' to run faster on miniperl. Code commented out at the
# subroutine objaddr can be ... |
./openacc-vv/parallel_loop_reduction_or_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);
char * a = (char *)malloc(10 * n * sizeof(char));
char * a_copy = (char *)malloc(10 * n * sizeof(char));
char * results = (char *)malloc(10 * sizeof(char));
cha... |
./openacc-vv/parallel_loop_independent_reduction.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,reduction,V:2.7-3.2
int test1(){
int err = 0;
srand(SEED);
real_t * a = (real_t *)malloc(n * sizeof(real_t));
real_t reduction;
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
}
#pragma acc parallel copyin(a[... |
./openacc-vv/kernels_loop_reduction_bitor_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 !Iterators
INTEGER,DIMENSION(10 * LOOPCOUNT):: a !Data
INTEGER,DIMENSION(10) :: b
REAL(8) :: false_margin... |
./openacc-vv/parallel_present.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,present,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 * c = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x < n; ++x){
... |
./SPEChpc/benchspec/HPC/628.pot3d_s/src/hdf5/H5Ff.c | /****h* H5Ff/H5Ff
* PURPOSE
* This file contains C stubs for H5F Fortran APIs
*
* COPYRIGHT
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illino... |
./openacc-vv/atomic_update_x_plus_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_comparison = new real_t[10];
for (int x = 0; x < n; ++x){
a[... |
./openacc-vv/serial_copyin.F90 | #ifndef T1
!T1:serial,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER:: errors
REAL(8),DIMENSION(LOOPCOUNT):: a, a_copy, b
INTEGER,DIMENSION(1):: hasDevice
INTEGER:: x
errors = 0
SEEDDIM(1) = 1
# ifdef SEED
SEEDDIM(1) = SEED
# endif
CALL RANDOM_SEED(PUT=SEE... |
./openacc-vv/parallel_loop_reduction_max_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):: maximum
INTEGER :: errors... |
./SPECaccel/benchspec/ACCEL/370.bt/src/x_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... |
./openacc-vv/set_device_type_num.c | #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/acc_copyout_finalize.c | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,data,executable-data,construct-independent,reference-counting,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 *)malloc(n * sizeo... |
./openacc-vv/acc_create_with_len.F90 | #ifndef T1
!T1:runtime,data,executable-data,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 !Data
INTEGER :: errors
errors = 0
... |
./SPEChpc/benchspec/HPC/613.soma_s/src/mpiroutines.c | /* Copyright (C) 2016-2017 Ludwig Schneider
Copyright (C) 2016 Ulrich Welling
Copyright (C) 2016-2017 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 mo... |
./openacc-vv/atomic_capture_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/serial_loop_gang_blocking.c | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,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));
real_t multiplyer = 1;
for (int x ... |
./openacc-vv/atomic_capture_x_and_expr_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,DIMENSION(length - 1) :: passed_b
LOGICAL ::... |
./openacc-vv/atomic_structured_expr_multiply_x_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... |
./openacc-vv/parallel_loop_tile.F90 | #ifndef T1
!T1:parallel,reduction,combined-constructs,loop,tile,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y, z !Iterators
REAL(8),DIMENSION(SMALL_LOOPCOUNT):: a, b, c !Data
REAL(8),DIMENSION(SMALL_LOOPCOUNT,SMALL_LOOPCOUNT)::d... |
./SPECaccel/benchspec/ACCEL/351.palm/src/poisfft.F90 | MODULE poisfft_mod
!--------------------------------------------------------------------------------!
! 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... |
./openacc-vv/parallel_firstprivate.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,firstprivate,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[n];
real_t * c_copy = new real_t[n];
real_t * d = new real_t[10 * n];
for (int x = ... |
./openacc-vv/atomic_bitor_equals.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/parallel_loop_reduction_add_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* d = new real_t[10 * n];
real_t avg = 0.0;
real_... |
./openacc-npb/LU/LU-HP/blts.c | //-------------------------------------------------------------------------//
// //
// This benchmark is a serial C version of the NPB LU code. This C //
// version is developed by the Center for Manycore Programming at Seoul //
// Nati... |
./SPEChpc/benchspec/HPC/613.soma_s/src/allocator.h | #pragma once
#include "phase.h"
#include "device.h"
#ifdef SPEC_OPENMP_TARGET
#include <omp.h>
#endif
typedef unsigned int uint_t;
typedef struct Allocator {
#define DECL_TYPE_BUF(TYPE, ...) \
struct { \
size_t capacity, size; \
TYPE* buf, *device_buf; \
} all_ ## TYPE ## __VA_ARGS__ ;
#defi... |
./openacc-vv/kernels_loop_reduction_max_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;
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 * max = (real_t *)malloc(10 * sizeof(real_t));... |
./openacc-vv/acc_wait_all.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, a_host, b_host, c_host !Data
REAL(8) :: RAND
INTEGER... |
./openacc-vv/atomic_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 *distribution = (int *)malloc(10 * sizeof(int));
int *distribution_comp... |
./openacc-vv/atomic_update_expr_neqv_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_min_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... |
./openacc-vv/atomic_x_neqv_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/exit_data_detach.c | #include "acc_testsuite.h"
#ifndef T1
//T1:runtime,data,executable-data,construct-independent,V:3.3
int test1(){
int err = 0;
srand(SEED);
two_d_array data;
data.a = (real_t *)malloc(n * sizeof(real_t));
data.b = (real_t *)malloc(n * sizeof(real_t));
for (int x = 0; x < n; ++x){
da... |
./openacc-vv/atomic_structured_assign_rshift_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){
... |
./SPECaccel/benchspec/ACCEL/357.csp/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... |
./PhysiCell_GPU/sample_projects/cancer_biorobots/main-cancer_biorobots.cpp | /*
###############################################################################
# If you use PhysiCell in your project, please cite PhysiCell and the version #
# number, such as below: #
# ... |
./openacc-npb/EP/EP/ep.c | //-------------------------------------------------------------------------//
// //
// This benchmark is a serial C version of the NPB EP code. This C //
// version is developed by the Center for Manycore Programming at Seoul //
// Nati... |
./openacc-vv/parallel_loop_reduction_or_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
LOGICAL,DIMENSION(10*LOOPCOUNT):: a !Data
LOGICAL,DIMENSION(10) :: b
LOGICAL :: temp
REA... |
./openacc-vv/atomic_structured_assign_x_bitor_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; ++... |
./SPECaccel/benchspec/ACCEL/551.ppalm/src/diffusivities.F90 | SUBROUTINE diffusivities( var, var_reference )
!--------------------------------------------------------------------------------!
! 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 Found... |
./SPECaccel/tools/src/perl-5.12.3/hints/mpeix.sh | # Created for 5.003 by Mark Klein, mklein@dis.com.
# Substantially revised for 5.004_01 by Mark Bixby, markb@cccd.edu.
# Revised again for 5.004_69 by Mark Bixby, markb@cccd.edu.
# Revised for 5.6.0 by Mark Bixby, mbixby@power.net.
# Revised for 5.7.3 by Mark Bixby, mark@bixby.org.
# Revised for 5.8.0 by Mark Bixby, ma... |
./openacc-vv/serial_loop_async.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,async,combined-constructs,V:2.6-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_loop_reduction_add_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"
INTEGER:: errors
REAL(8),DIMENSION(LOOPCOUNT, 10):: a, b
REAL(8),DIMENSION(10):: c
REAL(8):: temp
INTEGER:: x, y
errors = 0
SEEDDIM(1) = 1
# ifdef SEED
... |
./openacc-vv/parallel_loop_reduction_multiply_vector_loop.c | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,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_t)... |
./openacc-vv/shutdown_device_type_nvidia.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,shutdown,nonvalidating,V:2.5-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: errors = 0
!$acc shutdown device_type(nvidia)
IF (errors .eq. 0) THEN
... |
./openacc-vv/parallel_while_loop.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:parallel,syntactic,V:1.0-2.7
int test1(){
int err = 0;
srand(SEED);
real_t * a = new real_t[10 * n];
real_t avg = 0.0;
for (int x = 0; x < 10 * n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
avg += a[x]/(n * 10);
}
#pragma acc d... |
./openacc-vv/data_copy_no_lower_bound.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/atomic_structured_divided_equals_assign.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 = (... |
./SPEChpc/bin/harness/runhpc | #!/$SPEC/bin/specperl
#
# runhpc - a tool for running SPEC benchmarks.
# Copyright 1995-2017 Standard Performance Evaluation Corporation
#
# Authors: Christopher Chan-Nui
# Cloyce D. Spradling
#
# $Id$
if (exists $ENV{'SPECDB_PWD'}) {
chdir($ENV{'SPECDB_PWD'});
} else {
$ENV{'SPECDB_PWD'} = $ENV... |
./openacc-vv/serial_loop_reduction_add_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);
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];
real_t avg = 0.0;
real... |
./openacc-vv/atomic_update_max_x_expr_list_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/data_copyout_reference_counts.c | #include "acc_testsuite.h"
#ifndef T1
//T1:data,data-region,reference-counting,devonly,construct-independent,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 *)malloc(n * sizeof... |
./openacc-vv/atomic_structured_expr_bitor_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/atomic_structured_lshift_equals_assign.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/atomic_update_x_divided_expr.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_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... |
./openacc-vv/wait_if_queue_false.cpp | #include "acc_testsuite.h"
using namespace std;
#ifndef T1
//T1:parallel,wait,async,V:2.7-3.2
int test1(){
int err = 0;
srand(time(NULL));
data_container<real_t> a = *(new data_container<real_t>(n));
data_container<real_t> b = *(new data_container<real_t>(n));
data_container<real_t> c = *(new data... |
./openacc-vv/serial_default_copy.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,data,data-region,default-mapping,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] = rand() / (real_t)(RAND_MAX / 10);
... |
./openacc-vv/serial_async.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,async,wait,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];
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/set_device_type_num.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,set,nonvalidating,V:2.5-3.2
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: device_type
INTEGER :: errors = 0
device_type = acc_get_device_type()
d... |
./openacc-vv/atomic_x_bitxor_expr.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/acc_get_device_num.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,set,V:1.0-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
INTEGER :: errors
errors = 0
IF (acc_get_device_type() .ne. acc_device_n... |
./openacc-vv/acc_copyout_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
REAL(8) :: RAND
INTE... |
./openacc-npb/SP/SP/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/loop_no_collapse_default.c | #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 = (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));
real_t to... |
./SPEChpc/benchspec/HPC/632.sph_exa_s/src/include/sph/findNeighbors.hpp | #pragma once
#include <vector>
#include "Octree.hpp"
#include "LinearOctree.hpp"
namespace sphexa
{
namespace sph
{
namespace kernels
{
template <typename T>
T normalize(T d, T min, T max)
{
return (d - min) / (max - min);
}
#ifdef SPEC_OPENACC
#pragma acc routine
#endif
template <typename T>
void findNeighbors... |
./openacc-vv/kernels_loop_reduction_bitand_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);
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;
for (int x... |
./ppm_one/common/common/supply.h | //
#ifndef SUPPLY
#define SUPPLY
#define PI 3.1415926536
enum bb_carbon {bb_ca,bb_cb,bb_co};
enum methyl {hydrogen,carbon};
struct dihe_group
{
int id;
char code;
int type;
bool bgood;
int x1,x2,x3,x4;
};
struct index_three
{
int x1,x2,x3;
};
struct index_two
{
int x1,x2;
};
struct ring_group
{
i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.