source
stringlengths
3
92
c
stringlengths
26
2.25M
DynamicMatrixSpecialization.h
#pragma once //include cstring for memcpy #include <cstring> #include <math.matrix.dslib/DynamicMatrix.h> namespace nspace{ template<typename T> SpecializeMatrixDynamicSizeColumns(matrix2::DynamicMatrix<T>); template<typename T> SpecializeMatrixDynamicSizeRows(matrix2::DynamicMatrix<T>); template<typen...
crypt-sha1_fmt_plug.c
/* * This file is based on the "cryptsha512_fmt_plug.c" file. * * This software is Copyright (c) 2014 Dhiru Kholia, and it is hereby released * to the general public under the following terms: * * Redistribution and use in source and binary forms, with or without * modification, are permitted. * * Enhanced cod...
GB_resize.c
//------------------------------------------------------------------------------ // GB_resize: change the size of a matrix //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved. // SPDX-License-Identifier: Apache-...
Example_mem_model.2.c
/* * @@name: mem_model.2c * @@type: C * @@compilable: yes * @@linkable: yes * @@expect: rt-error * @@version: omp_3.1 */ #include <omp.h> #include <stdio.h> int main() { int data; int flag=0; #pragma omp parallel num_threads(2) { if (omp_get_thread_num()==0) { /* Write to the data buff...
hcds.h
// // Created by Bangtian Liu on 6/30/19. // #ifndef PROJECT_HCDS_H #define PROJECT_HCDS_H #include "HTree.h" #include "compression.h" //#include "../../../../opt/intel/compilers_and_libraries_2019.4.233/mac/mkl/include/mkl.h" struct hcds{ double *CacheNear; uint64_t *nearoffset; double *CacheFar; uint64_t *far...
MinStep.h
#ifndef MIN_STEP_H #define MIN_STEP_H #define MIN_STEP 0x60 #include "step/TraversalStep.h" #include "traversal/Traverser.h" #include <functional> #include <omp.h> class MinStep : public TraversalStep { private: std::function<int(Traverser*, Traverser*)> compare; public: MinSt...
cp-tree.h
/* Definitions for C++ parsing and type checking. Copyright (C) 1987-2019 Free Software Foundation, Inc. Contributed by Michael Tiemann (tiemann@cygnus.com) This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by ...
ICP.h
/////////////////////////////////////////////////////////////////////////////// /// "Sparse Iterative Closest Point" /// by Sofien Bouaziz, Andrea Tagliasacchi, Mark Pauly /// Copyright (C) 2013 LGG, EPFL /////////////////////////////////////////////////////////////////////////////// /// 1) This file contains ...
3.nowait.c
#include <stdio.h> #include <stdlib.h> #include <sys/time.h> #include <omp.h> /* OpenMP */ #define N 8 /* Q1: How does the sequence of printf change if the nowait clause is */ /* removed from the first for directive? */ /* Q2: If the nowait clause is removed in the second for pragma, ...
vector.c
#include "lib.h" #include <math.h> #include <stdint.h> #include <stdlib.h> void DENSEARRAY_SYMBOL(set_scalar_f32)( float *dst, size_t dim, float c) { #pragma omp parallel for for (size_t idx = 0; idx < dim; idx++) { dst[idx] = c; } } void DENSEARRAY_SYMBOL(set_scalar_i32)( int32_t *dst, ...
3d25pt_var.lbpar.c
#include <omp.h> #include <math.h> #define ceild(n,d) ceil(((double)(n))/((double)(d))) #define floord(n,d) floor(((double)(n))/((double)(d))) #define max(x,y) ((x) > (y)? (x) : (y)) #define min(x,y) ((x) < (y)? (x) : (y)) /* * Order-1, 3D 25 point stencil with axis-symmetric ariable coefficients * Adapted fr...
transforms_mpfr.c
void ft_mpfr_destroy_plan(mpfr_t * A, int n) { for (int j = 0; j < n; j++) for (int i = 0; i < n; i++) mpfr_clear(A[i+j*n]); free(A); } void ft_mpfr_destroy_triangular_banded(ft_mpfr_triangular_banded * A) { for (int j = 0; j < A->n; j++) for (int i = 0; i < A->b+1; i++) ...
CompoundFunctions.h
// // This program 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. // // This program is distributed in the hope that it will...
residual.ompsimd.c
//------------------------------------------------------------------------------------------------------------------------------ // Samuel Williams // SWWilliams@lbl.gov // Lawrence Berkeley National Lab //------------------------------------------------------------------------------------------------------------------...
dz1z3.c
// bmp.h #include "stdio.h" #include "stdlib.h" typedef struct{ unsigned char B; unsigned char G; unsigned char R; } RGB; typedef struct { unsigned int filesz; unsigned short creator1; unsigned short creator2; unsigned int bmp_offset; } bmpfile_header_t; typedef struct { unsigned in...
taskdep_taskgroup_untied_yield_scheduling.c
// RUN: %libomp-compile && env KMP_ABT_NUM_ESS=4 %libomp-run // REQUIRES: abt #include "omp_testsuite.h" #include "bolt_scheduling_util.h" #include <stdio.h> #include <stdlib.h> #include <string.h> int calc_seq(int n) { int i, j, *buffer = (int *)malloc(sizeof(int) * n * n); for (i = 0; i < n; i++) { for (j = ...
GB_binop__max_int64.c
//------------------------------------------------------------------------------ // GB_binop: hard-coded functions for each built-in binary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved. // SPDX-...
3d7pt.lbpar.c
#include <omp.h> #include <math.h> #define ceild(n,d) ceil(((double)(n))/((double)(d))) #define floord(n,d) floor(((double)(n))/((double)(d))) #define max(x,y) ((x) > (y)? (x) : (y)) #define min(x,y) ((x) < (y)? (x) : (y)) /* * Order-1, 3D 7 point stencil * Adapted from PLUTO and Pochoir test bench * * Tare...
GB_unop__identity_bool_fp32.c
//------------------------------------------------------------------------------ // GB_unop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved. // http://...
base.h
#include "callback.h" #include <omp.h> int main() { unsigned int i; #pragma omp parallel for num_threads(4) schedule(SCHEDULE) for (i = 0; i < 4; i++) { } // Check if libomp supports the callbacks for this test. // CHECK-NOT: {{^}}0: Could not register callback 'ompt_event_parallel_begin' // CHECK-NOT:...
rose_Stress-1_47.c
//#include <float.h> //#include <math.h> #define MIN(a, b) ( (a < b) ? a : b) #define MAX(a, b) ( (a > b) ? a : b) #include <omp.h> typedef double real8; void StressCheckEpsFail(real8 *newSxx,real8 *newSyy,real8 *newSzz,real8 *newTxy,real8 *newTxz,real8 *newTyz,real8 *eps,real8 eps_failure_model,const int *zoneset,in...
convolution_pack4to1_fp16s.h
// Tencent is pleased to support the open source community by making ncnn available. // // Copyright (C) 2021 THL A29 Limited, a Tencent company. All rights reserved. // // Licensed under the BSD 3-Clause License (the "License"); you may not use this file except // in compliance with the License. You may obtain a ...
c-decl.c
/* Process declarations and variables for C compiler. Copyright (C) 1988-2019 Free Software Foundation, Inc. This file is part of GCC. GCC 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, or ...
ppp.c
// Producto Escalar de 2 vectores // Calculo en Paralelo con OMP. (Program SPMD) #include <omp.h> #include <stdio.h> #include <math.h> //#include <iostream.h> //#include <iomanip.h> //using namespace std; #define m 100 // Dimension del Vector A y del Vector B int main(int argc, char **argv) // Declar...
GB_unaryop__minv_uint32_uint32.c
//------------------------------------------------------------------------------ // GB_unaryop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved. // http...
loop1.c
#include <stdio.h> #include <omp.h> int main() { int i,j; // int innerreps = 100; #pragma omp parallel private(j) { // for (j=0; j<innerreps; j++) { #pragma omp for schedule(static,2) for (i=0; i<32; i++) { printf ("thread %d is executing %d \n",omp_get_thread_num(),i); // ...
core_ssyr2k.c
/** * * @file * * PLASMA is a software package provided by: * University of Tennessee, US, * University of Manchester, UK. * * @generated from /home/luszczek/workspace/plasma/bitbucket/plasma/core_blas/core_zsyr2k.c, normal z -> s, Fri Sep 28 17:38:23 2018 * **/ #include <plasma_core_blas.h> #include "pla...
Parser.h
//===--- Parser.h - C Language Parser ---------------------------*- C++ -*-===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===---------------------------...
complex-1.c
#include <assert.h> #include <complex.h> #include <math.h> #define uchar unsigned char #define C 123 #define TEST(type) \ type foo_##type (void) \ { ...
serial_tree_learner2.h
/*! * Copyright (c) 2016 Microsoft Corporation. All rights reserved. * Licensed under the MIT License. See LICENSE file in the project root for license information. */ #ifndef LIGHTGBM_TREELEARNER_SERIAL_TREE_LEARNER2_H_ #define LIGHTGBM_TREELEARNER_SERIAL_TREE_LEARNER2_H_ #include <LightGBM/dataset.h> #include <Li...
ef_layout.h
#pragma once #include <folly/experimental/EliasFanoCoding.h> #include <iostream> #include "csr.h" #include "ef_param.h" #include "util.h" #define GET_CHUNK_SIZE(V, S, ...) get_num_chunks_vec<V, S>(__VA_ARGS__) template <size_t kSkipQuantum, size_t kForwardQuantum> class EFGraph; template <size_t kSkipQuantum, size...
CLHelper.h
//------------------------------------------ //--cambine:helper function for OpenCL //--programmer: Jianbin Fang //--date: 27/12/2010 //------------------------------------------ #ifndef _CL_HELPER_ #define _CL_HELPER_ #include <CL/cl.h> #include <fstream> #include <iostream> #include <string> #include <ve...
mandelbrot.c
/* * This example is based on the code of Andrew V. Adinetz * https://github.com/canonizer/mandelbrot-dyn * Licensed under The MIT License */ #include <omp.h> #include <complex.h> #include <stdio.h> #include <stdlib.h> #include "pngwriter.h" // Maximum number of iterations const int MAX_ITER_COUNT = 512; // Mark...
GB_binop__first_uint8.c
//------------------------------------------------------------------------------ // GB_binop: hard-coded functions for each built-in binary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved. // http:...
MPI.h
/** * @file * This file is part of SeisSol. * * @author Sebastian Rettenberger (sebastian.rettenberger AT tum.de, http://www5.in.tum.de/wiki/index.php/Sebastian_Rettenberger) * * @section LICENSE * Copyright (c) 2015-2016, SeisSol Group * All rights reserved. * * Redistribution and use in source and binary fo...
omp_for_collapse_mini.c
// RUN: %libomp-compile-and-run #include <stdio.h> #include <math.h> #include "omp_testsuite.h" /* Utility function to check that i is increasing monotonically with each call */ static int check_i_islarger (int i) { static int last_i; int islarger; if (i==1) last_i=0; islarger = ((i >= last_i)&&(i - las...
diamond_utils.c
#include "data_structures.h" #include <stdio.h> #include <stdlib.h> #include <math.h> void dynamic_intra_diamond_ts(Parameters *p); void init(Parameters *p); void arrays_allocate(Parameters *p); void init_coeff(Parameters *p); void domain_data_fill(Parameters *p); void arrays_free(Parameters *p); void mpi_halo_finaliz...
transfer.c
/** @file transfer.c Documented transfer module. * * Julien Lesgourgues, 28.07.2013 * * This module has two purposes: * * - at the beginning, to compute the transfer functions \f$ * \Delta_l^{X} (q) \f$, and store them in tables used for * interpolation in other modules. * * - at any time in the code, to ...
topology_extractor_utilities.h
// ============================================================================== // KratosTopologyOptimizationApplication // // License: BSD License // license: TopologyOptimizationApplication/license.txt // // Main authors: Baumgärtner Daniel, https://github.com/dbaumgaertner // ...
hermm_c_coo_n_lo_row.c
#include "alphasparse/kernel.h" #include "alphasparse/util.h" alphasparse_status_t ONAME(const ALPHA_Number alpha, const ALPHA_SPMAT_COO *mat, const ALPHA_Number *x, const ALPHA_INT columns, const ALPHA_INT ldx, const ALPHA_Number beta, ALPHA_Number *y, const ALPHA_INT ldy) { ALPHA_INT m = mat->rows; ALPHA_INT...
private.c
#include <stdio.h> #include <stdlib.h> #include <omp.h> int main(int argc, char *argv[]){ int numeroDeHilo=strtol(argv[1],NULL,10); int x=5; #pragma omp parallel num_threads(numeroDeHilo) private(x) { int my_rank=omp_get_thread_num(); //printf("Este es el valor de x=%d en el hilo %d antes de la operación\n",...
gsrb.ompsimd.c
//------------------------------------------------------------------------------------------------------------------------------ // Samuel Williams // SWWilliams@lbl.gov // Lawrence Berkeley National Lab //------------------------------------------------------------------------------------------------------------------...
builder.h
// Copyright (c) 2015, The Regents of the University of California (Regents) // See LICENSE.txt for license details #ifndef BUILDER_H_ #define BUILDER_H_ #include <algorithm> #include <cinttypes> #include <fstream> #include <functional> #include <type_traits> #include <utility> #include "command_line.h" #include "ge...
gravity.h
#pragma once #include "cutfunc.h" template <class Tpsys> void velKick(Tpsys & pp){ const PS::S32 n = pp.getNumberOfParticleLocal(); #pragma omp parallel for for(PS::S32 i=0; i<n; i++){ pp[i].velKick(); } } #ifdef CORRECT_NEIGHBOR template <class Tpsys> void velKick2nd(Tpsys & pp){ const PS::...
smoothness.h
// This program is free software: you can use, modify and/or redistribute it // under the terms of the simplified BSD License. You should have received a // copy of this license along this program. If not, see // <http://www.opensource.org/licenses/bsd-license.html>. // // Copyright (C) 2012, Javier Sánchez Pérez <jsan...
DRB052-indirectaccesssharebase-orig-no.c
/* Copyright (c) 2017, Lawrence Livermore National Security, LLC. Produced at the Lawrence Livermore National Laboratory Written by Chunhua Liao, Pei-Hung Lin, Joshua Asplund, Markus Schordan, and Ian Karlin (email: liao6@llnl.gov, lin32@llnl.gov, asplund1@llnl.gov, schordan1@llnl.gov, karlin1@llnl.gov) LLNL-CODE-73214...
GB_unop__identity_uint8_uint8.c
//------------------------------------------------------------------------------ // GB_unop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved. // SPDX-Li...
convolution_3x3_pack8_fp16s.h
// Tencent is pleased to support the open source community by making ncnn available. // // Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved. // // Licensed under the BSD 3-Clause License (the "License"); you may not use this file except // in compliance with the License. You may obtain a copy ...
scan.c
/** * scan.c * Authors: Yizhao Gao <yizhaotsccsj@gmail.com> * Date: {08/03/2017} */ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <omp.h> void getCCCount4DSph(double * x1, double * y1, double * x2, double * y2, int * nCass, int * nCons, int locCount, double wSize, int wCount, int * casInW, int...
CommonUtils.h
// Copyright (c) Microsoft Corporation. All rights reserved. // Licensed under the MIT License. #ifndef _SPTAG_COMMON_COMMONUTILS_H_ #define _SPTAG_COMMON_COMMONUTILS_H_ #include "../Common.h" #include <unordered_map> #include <exception> #include <algorithm> #include <time.h> #include <omp.h> #include <string.h> ...
kernels.c
/*************************************************************************** *cr *cr (C) Copyright 2010 The Board of Trustees of the *cr University of Illinois *cr All Rights Reserved *cr ********************************************************************...
GB_unaryop__lnot_fp64_fp32.c
//------------------------------------------------------------------------------ // GB_unaryop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved. // http...
simd-1.c
/* { dg-do run } */ /* { dg-additional-options "-msse2" { target sse2_runtime } } */ /* { dg-additional-options "-mavx" { target avx_runtime } } */ extern void abort (); int a[1024] __attribute__((aligned (32))) = { 1 }; int b[1024] __attribute__((aligned (32))) = { 1 }; int k, m; struct U { int u; }; struct V { int v...
omp2-4.c
#include<math.h> #include<stdio.h> #define N 1000000 int main() { int i; double x, area = 0; #pragma omp parallel for private(x) reduction(+:area) for (i = 0; i < N; i++) { x = (i + .5) / N; x = 4 / (1 + x*x); //#pragma omp critical area += x; } printf("%.10lf\n", area/N); return 0; }
linebreak.c
/* * Test for line continuation within pragmas * * Liao 2/5/2010 * * */ void foo1(int a[]) { int i,j; #pragma omp parallel \ private (j) \ shared (a) { a[i]=j; } }
YAKL_reductions.h
#pragma once template <class T, int myMem> class ParallelMin; template <class T, int myMem> class ParallelMax; template <class T, int myMem> class ParallelSum; #ifdef YAKL_ARCH_HIP template <class T> class ParallelMin<T,memDevice> { void *tmp; // Temporary storage size_t nTmp; // Size of temporar...
3d7pt_var.c
/* * Order-1, 3D 7 point stencil with variable coefficients * Adapted from PLUTO and Pochoir test bench * * Tareq Malas */ #include <stdio.h> #include <stdlib.h> #include <sys/time.h> #ifdef LIKWID_PERFMON #include <likwid.h> #endif #include "print_utils.h" #define TESTS 2 #define MAX(a,b) ((a) > (b) ? a : b) #...
GB_binop__ne_fc64.c
//------------------------------------------------------------------------------ // GB_binop: hard-coded functions for each built-in binary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved. // SPDX-...
GB_unaryop__minv_int64_uint32.c
//------------------------------------------------------------------------------ // GB_unaryop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved. // http...
multithreaded_access_queue.c
#include <stdio.h> #include <stdlib.h> #include <stdbool.h> #include <time.h> #include <omp.h> #ifndef TOTAL_THREADS #define TOTAL_THREADS 128 #endif #ifndef TOTAL_SIZE #define TOTAL_SIZE 64 #endif int randomAssignment() { srand(time(0)); return rand(); } int main() { if (!getenv("OMP_NUM_THREADS")) ...
GB_unop__exp2_fp32_fp32.c
//------------------------------------------------------------------------------ // GB_unop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved. // http://...
edep.c
// Utility to parse lost particle data into angle-resolved energy deposition // data // // Usage: // ./edep [species name] // // // icc -fopenmp -o edep edep.c // // Requires OpenMP 4.5 (gcc 6.1 or Intel 17.0), or you may run slowrially // // Note the energy cutoff Ecut below. // // This program must match how th...
ast-dump-openmp-begin-declare-variant_2.c
// RUN: %clang_cc1 -triple x86_64-unknown-unknown -fopenmp -verify -ast-dump %s | FileCheck %s // RUN: %clang_cc1 -triple x86_64-unknown-unknown -fopenmp -verify -ast-dump %s -x c++| FileCheck %s // expected-no-diagnostics #pragma omp begin declare variant match(device={kind(cpu)}) int also_before(void) { retu...
bucle-forModificado.c
#include <stdio.h> #include <stdlib.h> #include <omp.h> int main(int argc, char **argv) { int i, n = 9; if(argc < 2) { fprintf(stderr,"\n[ERROR] - Falta nº iteraciones \n"); exit(-1); } n = atoi(argv[1]); #pragma omp parallel for { for (i=0; i<n; i++) printf("thread %d ejecuta la iteración %d del bucle\n...
singleLooping.c
int bar() { #pragma omp single nowait { } } int foo() { int x = 0; while (x < 10) { #pragma omp single nowait { shared += 1; } x++; bar(); } return 0; } int main() { int shared = 0; #pragma omp parallel { int x = 0; while (x < 10) { #pragma omp single nowait { shared += 1; } x++; ...
GB_binop__minus_fc64.c
//------------------------------------------------------------------------------ // GB_binop: hard-coded functions for each built-in binary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved. // SPDX-...
Diffusion_core.c
/* * This work is part of the Core Imaging Library developed by * Visual Analytics and Imaging System Group of the Science Technology * Facilities Council, STFC * * Copyright 2017 Daniil Kazantsev * Copyright 2017 Srikanth Nagella, Edoardo Pasca * * Licensed under the Apache License, Version 2.0 (the "License")...
GB_unop__identity_uint16_int32.c
//------------------------------------------------------------------------------ // GB_unop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved. // SPDX-Li...
wrtieee.c
#include <stdio.h> #include <stddef.h> #include "wgrib2.h" /* wesley ebisuzaki v1.3 * * write ieee file -- big endian format * * input float *array data to be written * int n size of array * int header 1 for f77 style header 0 for none * (header is 4 byte header * FILE *output output file * * v1.2...
softmax-inl.h
/* * Licensed to the Apache Software Foundation (ASF) under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. The ASF licenses this file * to you under the Apache License, Version 2.0 (the * "License"); you ...
GB_binop__second_uint64.c
//------------------------------------------------------------------------------ // GB_binop: hard-coded functions for each built-in binary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved. // SPDX-...
GB_unop__abs_fp64_fc64.c
//------------------------------------------------------------------------------ // GB_unop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved. // SPDX-Li...
alignment.c
/**********************************************************************************************/ /* This program is part of the Barcelona OpenMP Tasks Suite */ /* Copyright (C) 2009 Barcelona Supercomputing Center - Centro Nacional de Supercomputacion */ /* Copyright (C) 2009 Univer...
IntegratorHPMCMonoImplicit.h
// Copyright (c) 2009-2017 The Regents of the University of Michigan // This file is part of the HOOMD-blue project, released under the BSD 3-Clause License. #ifndef __HPMC_MONO_IMPLICIT__H__ #define __HPMC_MONO_IMPLICIT__H__ #include "IntegratorHPMCMono.h" #include "hoomd/Autotuner.h" #include <random> #include <cf...
flexGradientOperator.h
#ifndef flexGradientOperator_H #define flexGradientOperator_H #include <vector> #include "flexLinearOperator.h" #ifdef __CUDACC__ template<typename T> __global__ void dxp2dCUDA(T* output, const T* input, const size_t sizeX, const size_t sizeY, mySign s) { const size_t x = threadIdx.x + blockIdx.x * blockDim.x; cons...
ndvi.c
#include<stdio.h> #include "gdal.h" #include<omp.h> /* MODLAND QA Bits 500m long int bits[0-1] * 00 -> class 0: Corrected product produced at ideal quality -- all bands * 01 -> class 1: Corrected product produced at less than idel quality -- some or all bands * 10 -> class 2: Corrected product NOT produced due to c...
GB_unop__identity_fp32_bool.c
//------------------------------------------------------------------------------ // GB_unop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved. // http://...
barrDownFork.c
int main() { int X, Y; X = 0; Y = 0; #pragma omp parallel { int diff; diff = 9; while (X < 10) { // while (1) { X = X + 2; #pragma omp barrier if (diff < 10) { break; } Y = Y + 1; X = X + 1; #pragma omp barrier Y = Y + 2; #pragma omp barrier } X = Y + 10; } } //int main() { // int ...
cpu_reducer.h
#ifndef BYTEPS_CPU_REDUCER_H #define BYTEPS_CPU_REDUCER_H #if __AVX__ && __F16C__ #include <cpuid.h> #include <immintrin.h> #endif #include <memory> #include <stdint.h> #include <mxnet/base.h> #include <mxnet/ndarray.h> namespace mxnet { namespace kvstore { enum DataType { BYTEPS_FLOAT32 = 0, BYTEPS_FLOAT64 = ...
4-3t.c
#include <stdio.h> #include <omp.h> int main() { int i; omp_set_num_threads(3); #pragma omp parallel for for (i=0; i<16; i++) { printf("Hello from thread number: %d Iteration: %d \n", omp_get_thread_num(), i); } printf("\n GoodBye – Team Destroyed – Exiting Program \n...
paralelo.c
#include <stdio.h> #include <stdlib.h> #include <time.h> #include <assert.h> #include <omp.h> #define NUM_THREADS 64 #define NUM_REP 100 void heap_sort(int *vet, int N); void cria_heap(int *vetor, int i, int f); int main() { int *vetor, menu, tamanho_vetor, sair = 0, aleatorio = 0; double tempo_medi...
turtle_json_number_parsing.c
#include "turtle_json.h" //Place to put various # parsing algorithms ... //https://github.com/miloyip/rapidjson/blob/03a73910498d784a3a9429202a90d2fb67be910b/include/rapidjson/reader.h#L1118 //=================== Number parsing errors =========================== // We observed only a '-' #define NO_NUMBER_ERROR ...
blas_dh.c
/****************************************************************************** * Copyright 1998-2019 Lawrence Livermore National Security, LLC and other * HYPRE Project Developers. See the top-level COPYRIGHT file for details. * * SPDX-License-Identifier: (Apache-2.0 OR MIT) **************************************...
c_perfect.c
#include <stdio.h> #include <stdlib.h> #include <stdbool.h> #include <omp.h> #define UNCHECKED 0 #define NON_PRIME 1 #define PRIME 2 #define RUNTIME 30 #define RANGE 10 #define NUM_THREADS 32 #define LIMIT 100000000L unsigned long *primes; unsigned long ready_limit; unsigned long last_printed; unsigned long prime_...
bml_add_dense_typed.c
/* Needs to be included before #include <complex.h>. */ #ifdef BML_USE_MAGMA #include "magma_v2.h" #endif #include "../../macros.h" #include "../../typed.h" #include "../blas.h" #include "../bml_add.h" #include "../bml_allocate.h" #include "../bml_logger.h" #include "../bml_parallel.h" #include "../bml_scale.h" #inclu...
GB_binop__ge_int16.c
//------------------------------------------------------------------------------ // GB_binop: hard-coded functions for each built-in binary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved. // SPDX-...
mlpLayer.c
#include <stdio.h> #include <stdlib.h> #include <math.h> #include "popc.h" #include "cell.h" #include "activation.h" #include "loss.h" #include "optimization.h" //#include "activation.h" #include "ann.h" #include "mlp.h" #include "layer.h" #include "mlpLayer.h" mlpLayerSingleton ptr mlpLayerSingletonNew () { stat...
Matrix.h
/* Copyright (c) 2018 Weiming Hu * * File: Matrix.h * Author: Weiming Hu * * Created on September 10, 2018, 1:08 PM */ #ifndef MATRIX_H #define MATRIX_H #include <vector> #include <iostream> #include <exception> struct continuousMatrix { int nrows; int ncols; int length; double *data; }; voi...
Example_affinity_display.1.c
/* * @@name: affinity_display.1.c * @@type: C * @@compilable: yes * @@linkable: yes * @@expect: success * @@version: omp_5.0 */ #include <stdio.h> #include <omp.h> int main(void){ //MAX threads = 8, single socket system omp_display_affinity(NULL); //API call-- Displays Affinity of Master Threa...
GB_unaryop__minv_int32_int64.c
//------------------------------------------------------------------------------ // GB_unaryop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved. // http...
SplineHybridAdoptorReaderP.h
////////////////////////////////////////////////////////////////////////////////////// // This file is distributed under the University of Illinois/NCSA Open Source License. // See LICENSE file in top directory for details. // // Copyright (c) 2016 Jeongnim Kim and QMCPACK developers. // // File developed by: Jeremy Mc...
GB_unaryop__abs_int8_int32.c
//------------------------------------------------------------------------------ // GB_unaryop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved. // http...
GB_dense_subassign_21.c
//------------------------------------------------------------------------------ // GB_dense_subassign_21: C(:,:) = x where x is a scalar //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved. // http://suitespars...
convolution_3x3.h
// Tencent is pleased to support the open source community by making ncnn available. // // Copyright (C) 2017 THL A29 Limited, a Tencent company. All rights reserved. // Copyright (C) 2018 SenseNets Technology Ltd. All rights reserved. // // Licensed under the BSD 3-Clause License (the "License"); you may not use this ...
Sema.h
//===--- Sema.h - Semantic Analysis & AST Building --------------*- C++ -*-===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===---------------------------...
proposal.h
// Copyright 2018 Xiaomi, Inc. All rights reserved. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicab...
8499.c
// this source is derived from CHILL AST originally from file '/uufs/chpc.utah.edu/common/home/u1142914/lib/ytopt_vinu/polybench/polybench-code/stencils/heat-3d/kernel.c' as parsed by frontend compiler rose void kernel_heat_3d(int tsteps, int n, double A[120 + 0][120 + 0][120 + 0], double B[120 + 0][120 + 0][120 + 0])...
matrix_vector_functions_intel_mkl.c
/* high level matrix/vector functions using Intel MKL for blas */ #include "matrix_vector_functions_intel_mkl.h" #include "mkl_scalapack.h" /* initialize new matrix and set all entries to zero */ mat * matrix_new(int nrows, int ncols) { mat *M = malloc(sizeof(mat)); //M->d = (double*)mkl_calloc(nrows*ncols, s...
3d25pt.lbpar.c
#include <omp.h> #include <math.h> #define ceild(n,d) ceil(((double)(n))/((double)(d))) #define floord(n,d) floor(((double)(n))/((double)(d))) #define max(x,y) ((x) > (y)? (x) : (y)) #define min(x,y) ((x) < (y)? (x) : (y)) /* * Order-2, 3D 25 point stencil * Adapted from PLUTO and Pochoir test bench * * Tar...
GB_unaryop__minv_fp32_int64.c
//------------------------------------------------------------------------------ // GB_unaryop: hard-coded functions for each built-in unary operator //------------------------------------------------------------------------------ // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved. // http...