file_path stringlengths 19 84 | content stringlengths 235 1.29M |
|---|---|
./openacc-vv/atomic_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/parallel_if.F90 | #ifndef T1
!T1:devonly,parallel,if,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
LOGICAL :: host = .FALSE.
LOGICAL :: device = .TRUE.
... |
./SPECaccel/tools/src/perl-5.12.3/lib/unicore/PropertyAliases.txt | # PropertyAliases-5.2.0.txt
# Date: 2009-08-24, 03:26:46 GMT [MD]
#
# Unicode Character Database
# Copyright (c) 1991-2009 Unicode, Inc.
# For terms of use, see http://www.unicode.org/terms_of_use.html
# For documentation, see http://www.unicode.org/reports/tr44/
#
# This file contains aliases for properties used in th... |
./openacc-vv/atomic_capture_expr_plus_x_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),DIME... |
./openacc-npb/BT/BT/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_multiply_equals_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_worker_blocking.F90 | #ifndef T1
!T1:parallel,loop,V:1.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c !Data
REAL(8) :: multiplyer
INTEGER :: errors = 0
multiplyer = 1
SEEDDIM(1) = 1
#... |
./openacc-vv/exit_data_copyout_reference_counts.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:data,executable-data,devonly,construct-independent,reference-counting,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));
d... |
./openacc-vv/serial_copyin.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_copy = new real_t[n];
real_t * b = new real_t[n];
int* hasDevice = (int *) malloc(sizeof(int));
hasDevice[0] = 1;
#pragma acc enter d... |
./openacc-vv/atomic_capture_assign_expr_eqv_x.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,DIME... |
./openacc-vv/atomic_structured_assign_expr_plus_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-npb/BT/BT/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/atomic_structured_assign_x_lshift_expr.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){
... |
./SPEChpc/benchspec/HPC/628.pot3d_s/src/hdf5/H5FSsection.c | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* ... |
./openacc-vv/atomic_expr_or_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... |
./PhysiCell_GPU/sample_projects/biorobots/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/init_device_type_num.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(host) device_num(device_num)
return err;
}
#endif
#ifndef T2
//T1:init,runtime,V:2.5-3.2
int test2(){
... |
./openacc-vv/routine_bind_prototype_function_string_lambda.cpp | #include "acc_testsuite.h"
//test 1 host function
real_t host_array_array(real_t * a, long long n){
#pragma acc loop reduction(+:returned)
real_t returned = 0.0;
for (int x = 0; x < n; ++x){
returned += a[x];
}
return returned;
}
//test 2 host function
real_t host_object_array(data_contain... |
./openacc-vv/atomic_structured_x_bitxor_expr_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... |
./SPECaccel/tools/src/perl-5.12.3/cpan/Unicode-Normalize/Normalize.pm | package Unicode::Normalize;
BEGIN {
unless ("A" eq pack('U', 0x41)) {
die "Unicode::Normalize cannot stringify a Unicode code point\n";
}
}
use 5.006;
use strict;
use warnings;
use Carp;
no warnings 'utf8';
our $VERSION = '1.03';
our $PACKAGE = __PACKAGE__;
require Exporter;
require DynaLoader;
our @ISA ... |
./openacc-vv/atomic_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 :... |
./ppm_one/lmmin/ann.cpp | #include <iostream>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <string>
#include <cstring>
#include <vector>
#include <math.h>
#include <time.h>
#include <sstream>
using namespace std;
#include <config.h>
#include "ann.h"
CAnn::CAnn()
{
p=NULL;
srand (time(NULL));
};
CAnn::~CAnn()
{
};
v... |
./openacc-vv/acc_get_property_string.F90 | #ifndef T1
!T1:runtime,construct-independent,internal-control-values,nonvalidating,V:2.6-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
CHARACTER(len=:),ALLOCATABLE :: output1
CHARACTER(len=:),ALLOCATABLE :: output2
CHARACTER(len=:... |
./SPEChpc/benchspec/HPC/613.soma_s/src/soma.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... |
./SPEChpc/benchspec/HPC/632.sph_exa_s/src/include/Domain.hpp | #pragma once
#include <vector>
#ifdef USE_MPI
#include "mpi.h"
#endif
#include "config.hpp"
#include "Octree.hpp"
namespace sphexa
{
template <typename T, class Tree = Octree<T>>
class Domain
{
public:
Domain(int64_t ngmin, int64_t ng0, int64_t ngmax, unsigned int bucketSize = 128)
: ngmin(ngmin)
... |
./SPEChpc/benchspec/HPC/613.soma_s/src/mesh.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_structured_expr_multiply_x_assign.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/atomic_update_max_x_expr_list.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b !Data
REAL(8),DIMENSION(LOOPCOUNT/10 + 1):: totals, totals_comparison
INTEGER :: er... |
./SPECaccel/benchspec/ACCEL/557.pcsp/src/add.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/beta_testing/main-beta.cpp | /*
###############################################################################
# If you use PhysiCell in your project, please cite PhysiCell and the version #
# number, such as below: #
# ... |
./openacc-vv/data_copyout_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
# ... |
./SPECaccel/benchspec/ACCEL/551.ppalm/src/prognostic_equations.F90 | MODULE prognostic_equations_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... |
./openacc-vv/serial_loop_vector.F90 | #ifndef T1
!T1:serial,combined-constructs,loop,V:2.6-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c
INTEGER:: x
INTEGER:: errors
errors = 0
SEEDDIM(1) = 1
# ifdef SEED
SEEDDIM(1) = SEED
# endif
CALL RANDOM_SEED(PUT=SEEDDIM)
CALL ... |
./openacc-vv/kernels_loop_reduction_and_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);
char * a = new char[10 * n];
char * b = new char[10];
char * has_false = new char[10];
real_t false_margin = pow(exp(1), log(.5)/n);
for (int x = 0; x < 10;... |
./SPEChpc/benchspec/HPC/628.pot3d_s/src/hdf5/H5Tnative.c | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* ... |
./openacc-vv/atomic_rshift_equals.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/atomic_update_max_expr_x_end.F90 | #ifndef T1
!T1:construct-independent,atomic,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x, y !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a !Data
REAL(8),DIMENSION(LOOPCOUNT/10 + 1):: totals, totals_comparison
INTEGER :: error... |
./openacc-vv/acc_delete_finalize_async.F90 | #ifndef T1
!T1:runtime,data,executable-data,async,construct-independent,V:2.5-2.7
LOGICAL FUNCTION test1()
USE OPENACC
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b, c, d, e, f !Data
INTEGER :: errors
er... |
./openacc-vv/serial_loop_reduction_bitxor_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/atomic_structured_postdecrement_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/enter_data_create_no_lower_bound.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:data,executable-data,syntactic,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... |
./openacc-npb/LU/LU-HP/calcnp.c |
//-------------------------------------------------------------------------//
//// //
//// The OpenACC C version of the NAS LU code is developed by the //
//// HPCTools Group of University of Houston and derived from the serial //
/... |
./SPECaccel/Docs/config.html | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<title>SPEC Config files </title>
<!-- $Id: config.html 1577 2017-02-07 16:36:33Z BrianWhitney $ -->
<!-- Last updated: $Date: 2017... |
./SPECaccel/benchspec/ACCEL/557.pcsp/src/exact_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/serial_loop_tile.cpp | #include "acc_testsuite.h"
#ifndef T1
//T1:serial,loop,tile,combined-constructs,syntactic,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 * d2 = new real_t[n * n];
real_t * d3 = new real_t[n * n * n];... |
./openacc-vv/atomic_update_ior_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/kernels_present.F90 | #ifndef T1
!T1:kernels,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b !Data
INTEGER :: errors = 0
!Initilization
SEEDDIM(1) = 1
# ifdef SEED
SEEDDIM(1) = ... |
./openacc-vv/kernels_loop_reduction_and_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);
char * a = (char *)malloc(n * sizeof(char));
real_t false_margin = pow(exp(1), log(.5)/n);
char result = 1;
for (int x = 0; x < n; ++x){
if(rand() / (r... |
./openacc-vv/kernels_copyout.F90 | #ifndef T1
!T1:devonly,kernels,V:2.0-2.7
LOGICAL FUNCTION test1()
IMPLICIT NONE
INCLUDE "acc_testsuite.Fh"
INTEGER :: x !Iterators
REAL(8),DIMENSION(LOOPCOUNT):: a, b !Data
INTEGER :: errors = 0
INTEGER,DIMENSION(1):: devtest
devtest(1) = 1
!$acc en... |
./openacc-vv/acc_update_self.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];
for (int x = 0; x < n; ++x){
a[x] = rand() / (real_t)(RAND_MAX / 10);
b[... |
./openacc-vv/atomic_structured_assign_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] == prev){
for (int y = 0; y < x; ++... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.