source stringlengths 3 92 | c stringlengths 26 2.25M |
|---|---|
ten_tusscher_2004_epi_S1_18.c | //Original Ten Tusscher
#include <assert.h>
#include <stdlib.h>
#include "ten_tusscher_2004_epi_S1_18.h"
GET_CELL_MODEL_DATA(init_cell_model_data) {
assert(cell_model);
if(get_initial_v)
cell_model->initial_v = INITIAL_V;
if(get_neq)
cell_model->number_of_ode_equations = NEQ;
}
//TODO... |
prop3DAcoVTIDenQ_DEO2_FDTD.h | #ifndef PROP3DACOVTIDENQ_DEO2_FDTD_H
#define PROP3DACOVTIDENQ_DEO2_FDTD_H
#include <omp.h>
#include <stddef.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <fftw3.h>
#include <complex>
#include "propagatorStaticFunctions.h"
#define MIN(x,y) ((x)<(y)?(x):(y))
class Prop3DAcoVTIDenQ_DEO2_FDTD {
... |
derivative.h | #ifndef OPENMC_TALLIES_DERIVATIVE_H
#define OPENMC_TALLIES_DERIVATIVE_H
#include "openmc/particle.h"
#include <unordered_map>
#include <vector>
#include "pugixml.hpp"
//==============================================================================
//! Describes a first-order derivative that can be applied to tallie... |
ImplicitMIA.h | // Copyright (c) 2013, Adam Harrison*
// http://www.ualberta.ca/~apharris/
// All rights reserved.
// Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
// -Redistributions of source code must retain the above copyright ... |
GB_sort.c | //------------------------------------------------------------------------------
// GB_sort: sort all vectors in a matrix
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2... |
c-omp.c | /* This file contains routines to construct GNU OpenMP constructs,
called from parsing in the C and C++ front ends.
Copyright (C) 2005, 2007, 2008, 2009, 2010 Free Software Foundation, Inc.
Contributed by Richard Henderson <rth@redhat.com>,
Diego Novillo <dnovillo@redhat.com>.
This file is part of GCC.
... |
zeroslike_ref.c | /*
* 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 ma... |
otfft_avxdit8omp.h | // Copyright (c) 2015, OK おじさん(岡久卓也)
// Copyright (c) 2015, OK Ojisan(Takuya OKAHISA)
// Copyright (c) 2017 to the present, DEWETRON GmbH
// OTFFT Implementation Version 9.5
// based on Stockham FFT algorithm
// from OK Ojisan(Takuya OKAHISA), source: http://www.moon.sannet.ne.jp/okahisa/stockham/stockham.html
#pragma... |
conv3x3s1_sse.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) 2019 BUG1989. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in... |
constr.c | /*
* This file is part of the GROMACS molecular simulation package.
*
* Copyright (c) 1991-2000, University of Groningen, The Netherlands.
* Copyright (c) 2001-2004, The GROMACS development team,
* check out http://www.gromacs.org for more information.
* Copyright (c) 2012,2013, by the GROMACS development team, l... |
474.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[200 + 0][200 + 0][200 + 0], double B[200 + 0][200 + 0][200 + 0])... |
elemwise_binary_op.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 ... |
pr89235.c | /* { dg-require-effective-target fopenmp } */
/* { dg-options "-S -fopenmp -fsave-optimization-record -ftree-parallelize-loops=2 -fno-tree-vectorize --param ggc-min-expand=0" } */
int a1, dr, xm, ly, zb, g9, il;
long int wt;
unsigned int mq;
int br, e7, rm, t4, jb, ry;
int
fi (void);
int
z5 (int fl)
{
while (br <... |
otfft_sixstepnr.h | /******************************************************************************
* OTFFT Sixstep of Normalized Rectangle Version 6.5
*
* Copyright (c) 2015 OK Ojisan(Takuya OKAHISA)
* Released under the MIT license
* http://opensource.org/licenses/mit-license.php
*****************************************************... |
fci_graph.c | /*
Copyright 2021 Google LLC
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 applicable law or agreed to i... |
sparseOverlappingJacobi.h | //
// Created by mbarb on 05/02/2018.
//
#ifndef PARALLELITERATIVE_SPARSEOVERLAPPINGJACOBI_H
#define PARALLELITERATIVE_SPARSEOVERLAPPINGJACOBI_H
#include "Eigen"
#include "utils.h"
#include "sparseParallelJacobi.h"
#include <typeinfo>
namespace Iterative {
template <typename Scalar>
class sparseOverlappi... |
for.c | #include <omp.h>
#include <stdio.h>
#define CHUNKSIZE 10
#define N 100
main ()
{
int i, chunk;
float a[N], b[N], c[N];
/* Some initializations */
for (i=0; i < N; i++)
a[i] = b[i] = i * 1.0;
chunk = CHUNKSIZE;
#pragma omp parallel shared(a,b,c,chunk) private(i)
{
#pragma omp for schedule(dynamic,chunk)... |
dense_ops.c | #include "common.h"
#include "cblas.h"
#ifndef DISABLE_OPENMP
#include "threads.h"
#endif
int dense_op_s(const int n_1,
const int d_1,
const double * const X,
const int n_2,
const int k,
const double * const Z,
const int * cons... |
cachebw.c | /******************************************************************************
** Copyright (c) 2013-2020, Alexander Heinecke **
** All rights reserved. **
** **
... |
ddot_kahan_omp_reduce.c | #include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <omp.h>
#include "immintrin.h"
__attribute__((optimize("no-tree-vectorize")))
void ddot_kahan_omp_scalar_comp_reduce(
int N,
const double* a,
const double* b,
double* r)
{
int i;
double sum = 0.0;
#pragma omp pa... |
vars0-omp.c | #include <stdio.h>
#include <omp.h>
int gvar = 0;
int main( int argc, char **argv ) {
int lvar = 0;
int tid;
#pragma omp parallel private(tid)
{
tid = omp_get_thread_num();
printf( "<%d> gvar:%p lvar:%p tid:%p\n",
tid, &gvar, &lvar );
}
return 0;
}
|
DarthTon.h | #ifndef DARTHTON_H
#define DARTHTON_H
// Boyer-Moore-Horspool with wildcards implementation
void FillShiftTable( const uint8_t* pPattern, size_t patternSize, uint8_t wildcard, size_t* bad_char_skip )
{
size_t idx = 0;
size_t last = patternSize - 1;
// Get last wildcard position
for (idx = last; idx > ... |
GB_unop__isinf_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://... |
integrate.c | #include <stdio.h>
#include <math.h>
#include <sys/time.h>
#include <omp.h>
const double PI = 3.14159265358979323846;
const double a = -4.0;
const double b = 4.0;
const int nsteps = 100000000;
double wtime()
{
struct timeval t;
gettimeofday(&t, NULL);
return (double)t.tv_sec + (double)t.tv_usec * 1E-6;
}... |
rhs_term.c | #include "mex.h"
#include "blas.h"
#include "conv2d.h"
#define DEBUG 0
/*
*/
void rhs_parall(size_t Np, size_t K, size_t Nfp,
double *Dr, double *Ds, double *LIFT,
double *rx, double *ry, double *sx, double *sy,
double *J, double *Js,
double *dflux, dou... |
kernel_iq.c | /*
##########################################################
# #
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! #
# !! !! #
# !! KEEP THIS CODE CONSISTENT WITH KERNELPY.PY !! #
... |
sincos2.c | #include<Python.h>
#include<numpy/arrayobject.h>
#include<math.h>
#include<omp.h>
#define IND(a,i) *((double *)(a->data+i*a->strides[0]))
static PyObject *sincos2(PyObject *self, PyObject *args, PyObject *keywds);
static PyObject *sincos2(PyObject *self, PyObject *args, PyObject *keywds)
{
PyObject *etc;
PyArray... |
matvec_double.c | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/timeb.h>
#include <malloc.h>
#include <math.h>
#define N_RUNS 20
#define N 10240
// read timer in second
double read_timer() {
struct timeb tm;
ftime(&tm);
return (double) tm.time + (double) tm.millitm / 1000.0;
}
//Create a matrix an... |
for-5.c | /* { dg-additional-options "-std=gnu99" } */
extern void abort ();
#define M(x, y, z) O(x, y, z)
#define O(x, y, z) x ## _ ## y ## _ ## z
#pragma omp declare target
#define F for
#define G f
#define S
#define N(x) M(x, G, normal)
#include "for-2.h"
#undef S
#undef N
#undef F
#undef G
#pragma omp end declare target... |
DRB114-if-orig-yes.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... |
formatter.c | /*
This source file is part of real2GAME, which is released under the MIT license.
Github repository: https://github.com/OpenNWP/real2GAME
*/
/*
This tool reads the output from other models / data assimilation systems and brings it into a standardized format.
*/
#include <netcdf.h>
#include <stdio.h>
#include <string... |
pi_omp.c | /*
* Compute pi by approximating the area under the curve f(x) = 4 / (1 + x*x)
* between 0 and 1.
*
* Parallel version using OpenMP
*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <omp.h> /* OpenMP */
#if _EXTRAE_
#include "extrae_user_events.h"
// Extrae Constants
#define PROGRAM 100... |
collector-example.c | /* Collector API Usage Example.
*
* © 2017 ETH Zurich,
* [Integrated System Laboratory, D-ITET],
* [Antonio Libri, a.libri@iis.ee.ethz.ch]
*
* © 2017 University of Bologna,
* [Department of Electrical, Electronic and Information Engineering, DEI],
* [Andrea Bartolini, a.bartolini@unibo.it]
*/
#incl... |
Example_nested_loop.2.c | /*
* @@name: nested_loop.2c
* @@type: C
* @@compilable: yes
* @@linkable: no
* @@expect: success
*/
void work(int i, int j) {}
void work1(int i, int n)
{
int j;
#pragma omp parallel default(shared)
{
#pragma omp for
for (j=0; j<n; j++)
work(i, j);
}
}
void good_nesting2(int n)
{
int i;
#pr... |
duplex.c | /*
* compute the duplex structure of two RNA strands,
* allowing only inter-strand base pairs.
* see cofold() for computing hybrid structures without
* restriction.
*
* Ivo Hofacker
* Vienna RNA package
*/
#if... |
par_interp.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)
**************************************... |
matmult_initialize.c | #include "matmult_initialize.h"
void initialize(double **matrix, int rows, int cols) {
int i,j;
#pragma omp parallel private(i,j) shared(matrix)
{
//set_num_threads();
/*** Initialize matrices ***/
#pragma omp for nowait
for (i=0; i<rows; i++) {
for (j=0; j<cols; j++) {
matrix[i][j]= i+j;... |
gm_map.h | #ifndef GM_MAP_H_
#define GM_MAP_H_
#include <map>
#include "gm_internal.h"
#include "gm_limits.h"
#include "gm_lock.h"
using namespace std;
//map-interface
template<class Key, class Value>
class gm_map
{
public:
virtual ~gm_map() {
}
;
virtual bool hasKey_seq(const Key key) = 0;
virtual bool... |
proc_bind.c | // RUN: %libomp-compile && env OMP_DISPLAY_AFFINITY=true OMP_PLACES='{0},{0,1},{0},{0,1},{0},{0,1},{0},{0,1},{0},{0,1},{0}' %libomp-run | %python %S/check.py -c 'CHECK' %s
// REQUIRES: affinity
#include <stdio.h>
#include <stdlib.h>
#include <omp.h>
int main(int argc, char** argv) {
omp_set_affinity_format("TESTER:... |
GB_binop__lt_uint16.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http:... |
test.c | #include <stdio.h>
#pragma omp requires unified_shared_memory
int main()
{
int a[100];
int *p = &a[0];
int i;
for(i=0; i<100; i++) a[i] = i;
#pragma omp target data map(tofrom: a, p[0:100])
{
#pragma omp target map(tofrom: a, p[0:100])
{
int *q = p;
for(i=0; i<100; i++) {
a[i... |
gemm.c | #include "gemm.h"
#include "utils.h"
#include "im2col.h"
#include "dark_cuda.h"
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <float.h>
#include <string.h>
#include <stdint.h>
#ifdef _WIN32
#include <intrin.h>
#endif
#if defined(_OPENMP)
#include <omp.h>
#endif
#define TILE_M 4 // 4 ops
#define TIL... |
GB_dense_subassign_05d_template.c | //------------------------------------------------------------------------------
// GB_dense_subassign_05d_template: C<M> = x where C is dense
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http://suite... |
feature_group.h | /*!
* Copyright (c) 2017 Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See LICENSE file in the project root for license information.
*/
#ifndef LIGHTGBM_FEATURE_GROUP_H_
#define LIGHTGBM_FEATURE_GROUP_H_
#include <LightGBM/bin.h>
#include <LightGBM/meta.h>
#include <LightGBM/utils/ra... |
threading_utils.h | /*!
* Copyright 2015-2019 by Contributors
* \file common.h
* \brief Threading utilities
*/
#ifndef XGBOOST_COMMON_THREADING_UTILS_H_
#define XGBOOST_COMMON_THREADING_UTILS_H_
#include <dmlc/common.h>
#include <vector>
#include <algorithm>
#include "xgboost/logging.h"
namespace xgboost {
namespace common {
// Rep... |
simd6.c | /* { dg-do compile } */
/* { dg-options "-fopenmp" } */
extern int a[1024];
struct S { int i; } s;
void
f1 (int x, float f, int *p)
{
int i;
#pragma omp simd aligned(x : 32) /* { dg-error "neither a pointer nor an array" } */
for (i = 0; i < 1024; i++)
a[i]++;
#pragma omp simd aligned(f) /* { dg-error "... |
openmp_wrapper.h | /*!
* Copyright (c) 2017 Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See LICENSE file in the project root for license information.
*/
#ifndef LIGHTGBM_OPENMP_WRAPPER_H_
#define LIGHTGBM_OPENMP_WRAPPER_H_
#ifdef _OPENMP
#include <omp.h>
#include <LightGBM/utils/log.h>
#include <mem... |
BF_std.c | /*
* This file is part of John the Ripper password cracker,
* Copyright (c) 1996-2001,2008,2010,2011 by Solar Designer
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted.
*
* There's ABSOLUTELY NO WARRANTY, express or implied.
*
* A public domain version of thi... |
GB_binop__second_fp64.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... |
multind.c | /* Copyright 2013-2015 The Regents of the University of California.
* Copyright 2016-2020. Uecker Lab. University Medical Center Göttingen.
* Copyright 2017. Intel Corporation.
* All rights reserved. Use of this source code is governed by
* a BSD-style license which can be found in the LICENSE file.
*
* Authors:
... |
GB_unop__identity_bool_uint32.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... |
8.norace1.c | // RUN: clang %loadLLOV %s -o /dev/null 2>&1 | FileCheck %s
#include <omp.h>
#define M 200
#define N 200
int main() {
double A[M], B[M][N], C[N], sum0 = 0.0;
for (int i = 0; i < M; i++) {
#pragma omp parallel for reduction(+ : sum0)
for (int j = 0; j < N; j++) {
sum0 += B[i][j] * C[j];
}
A[i] = s... |
metrics.h | /*
* Created on: Feb 06, 2017
* Author: Steffen Rechner <steffen.rechner@informatik.uni-halle.de>
*
* This file is part of the marathon software.
*
* Copyright (c) 2016, Steffen Rechner
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation... |
LevelElimination.h | /*
* LevelElimination.h
*
* Created on: 10.01.2015
* Author: Michael
*/
#ifndef LEVELELIMINATION_H_
#define LEVELELIMINATION_H_
#include "Level.h"
#include "EliminationStage.h"
namespace NetworKit {
/**
* @ingroup numerics
*/
template<class Matrix>
class LevelElimination : public Level<Matrix> {
privat... |
Example_ordered.3.c | /*
* @@name: ordered.3c
* @@type: C
* @@compilable: yes
* @@linkable: no
* @@expect: success
*/
void work(int i) {}
void ordered_good(int n)
{
int i;
#pragma omp for ordered
for (i=0; i<n; i++) {
if (i <= 10) {
#pragma omp ordered
work(i);
}
if (i > 10) {
#pragma omp ordered
... |
cpu_stream.h | /*
Copyright 2020 The OneFlow Authors. 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 applicable law or agre... |
math.h | /*===---- openmp_wrapper/math.h -------- OpenMP math.h intercept ------ 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
*
*===---------------------------... |
Pstd.h | #pragma once
#include "Constants.h"
#include "FieldSolver.h"
#include "Grid.h"
#include "Vectors.h"
#include "PmlPstd.h"
namespace pfc {
class PSTD : public SpectralFieldSolver<PSTDGridType>
{
public:
PSTD(PSTDGrid * grid, double dt);
void updateFields();
void updateHalfB();
... |
GB_unaryop__identity_uint32_int32.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http... |
calculate_pi.c | #include<stdio.h>
#include<stdlib.h>
#include<omp.h>
#include<stdint.h>
#include<time.h>
uint32_t __GetTickCount(void) {
struct timespec ts;
uint32_t tick = 0U;
clock_gettime(CLOCK_REALTIME, &ts);
tick = ts.tv_nsec / 1000000;
tick += ts.tv_sec * 1000;
return tick;
}
void PI(double a, double b, int numIntervals... |
launch_latency.c | #include <stdio.h>
#include <time.h>
#include <omp.h>
#define MAX_TEAMS 2048
#define TRIALS (1000)
int n =1024;
int main(void) {
struct timespec t0,t1,t2;
int fail = 0;
int a = -1;
//
clock_gettime(CLOCK_REALTIME, &t0);
#pragma omp target
{ //nothing
}
clock_gettime(CLOCK_REALTIME, &t1);
doubl... |
GB_binop__bset_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-... |
fastwavesuv.h | #ifndef FASTWAVESUV_H
#define FASTWAVESUV_H
void fastwavesuv(Storage3D& uout, Storage3D& vout, const Storage3D& uin, const Storage3D& vin, const Storage3D& utens,
const Storage3D& vtens, const Storage3D& wgtfac, const Storage3D& ppuv, const Storage3D& hhl,
const Storage3D& rho, const ... |
gimple-pretty-print.c | /* Pretty formatting of GIMPLE statements and expressions.
Copyright (C) 2001-2018 Free Software Foundation, Inc.
Contributed by Aldy Hernandez <aldyh@redhat.com> and
Diego Novillo <dnovillo@google.com>
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms o... |
GB_binop__rminus_fp64.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
getStartLists.c | #include "defs.h"
double getStartLists(graph* G, edge** maxIntWtListPtr,
INT_T* maxIntWtListSizePtr) {
LONG_T *local_max, maxWeight;
edge *maxIntWtList;
LONG_T maxIntWtListSize;
LONG_T *p_start, *p_end;
double elapsed_time;
elapsed_time = get_seconds();
#ifdef _OPENMP
o... |
spinless_fermion_basis_core.h | #ifndef _SPINLESS_FERMION_BASIS_OP_H
#define _SPINLESS_FERMION_BASIS_OP_H
#include <complex>
#include "hcb_basis_core.h"
#include "numpy/ndarraytypes.h"
npy_uint32 bit_count(npy_uint32 I, int l){
I &= (0x7FFFFFFF >> (31-l));
I = I - ((I >> 1) & 0x55555555);
I = (I & 0x33333333) + ((I >> 2) & 0x33333333);
return (... |
GB_binop__eq_bool.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... |
main.c | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <omp.h>
#include <limits.h>
#include <string.h>
#include "libconvcodes.h"
#include "libturbocodes.h"
#include "utilities.h"
#include <getopt.h>
#include "colors.h"
#define MAX_COMPONENTS 4
// puncturing function: return 1 if bit k ha... |
aux_interp.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)
**************************************... |
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... |
ark_heat1D_adapt_ompdev.c | /*---------------------------------------------------------------
* Programmer(s): Shelby Lockhart @ LLNL
*---------------------------------------------------------------
* Based on the serial code ark_heat1D_adapt.c developed
* by Daniel R. Reynolds and parallelized with OpenMP 4.5
*------------------------------... |
McBuilder.h | #pragma once
#include <algorithm>
#include "../../../DataStructures/RAPTOR/Data.h"
#include "../../../Helpers/MultiThreading.h"
#include "../../../Helpers/Timer.h"
#include "../../../Helpers/Console/Progress.h"
#include "McShortcutSearch.h"
namespace RAPTOR::ULTRA {
template<bool DEBUG = false, bool USE_TIEBREAKIN... |
matrix.h | /****************************************************************************************************************/
/* */
/* OpenNN: Open Neural Networks Library ... |
gdal_r_net.c | #include<stdio.h>
#include<omp.h>
#include<math.h>
#include "gdal.h"
#include "r_net.h"
void usage()
{
printf( "-----------------------------------------\n");
printf( "--Modis Processing chain--Serial code----\n");
printf( "-----------------------------------------\n");
printf( "./r_net inAlbedo inSunza inEmis31 i... |
GB_binop__div_uint16.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... |
_fast1dcorr.h | //
// Created by Eric Wu on 11/4/21.
//
#ifndef FASTCONV__FAST1DCORR_H
#define FASTCONV__FAST1DCORR_H
#include "NDContigArrayWrapper.h"
#include "_conv_engine.h"
#include <pybind11/numpy.h>
#include <pybind11/stl.h>
#include <stdlib.h>
#include <stdint.h>
#include <immintrin.h>
#if defined(ENABLE_OPENMP)
#include ... |
example_11-StructOfArrays-CellLinkedList-OuterLoop-SymmLB-quickerSort.c | /*
* SPDX-License-Identifier: BSD-3-Clause
*
* example_10-StructOfArrays-CellLinkedList-OuterLoop-SymmetricalLoadBalancing.c :
* Example of SPH Density Calculation using
* fast neighbor search the main density loop via
* Cell Linked List method, Struct of Arrays (SoA)
* data layout, Open... |
3d25pt.c | /*
* Order-2, 3D 25 point stencil
* 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)
#define MIN(a,b) ((a) < (b)... |
core_ztrtri.c | /**
*
* @file
*
* PLASMA is a software package provided by:
* University of Tennessee, US,
* University of Manchester, UK.
*
* @precisions normal z -> c d s
*
**/
#include <plasma_core_blas.h>
#include "plasma_types.h"
#include "core_lapack.h"
/************************************************************... |
SSDIndex.h | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
#pragma once
#include <limits>
#include "inc/Core/Common.h"
#include "inc/Core/Common/DistanceUtils.h"
#include "inc/Core/Common/QueryResultSet.h"
#include "inc/Core/SPANN/Index.h"
#include "inc/Core/SPANN/ExtraFullGraphSe... |
sincos_scalar.c | /*************************************************************************************/
/* Copyright (C) 2021 Intel Corporation */
/* */
/* Redistribution and use in source and binary forms, w... |
task_late_fulfill.c | // RUN: %libomp-compile -fopenmp-version=50 && env OMP_NUM_THREADS='3' \
// RUN: %libomp-run | %sort-threads | FileCheck %s
// Checked gcc 9.2 still does not support detach clause on task construct.
// UNSUPPORTED: gcc-4, gcc-5, gcc-6, gcc-7, gcc-8, gcc-9
// clang supports detach clause since version 11.
// UNSUPPO... |
VolumetricMaxPooling.c | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/VolumetricMaxPooling.c"
#else
static void nn_(VolumetricMaxPooling_updateOutput_frame)(
real *input_p, real *output_p, real *indz_p,
long nslices, long itime, long iwidth, long iheight,
long otime, long owidth, long oheight,
int kT, int kW, int kH, int d... |
4.c | #include<stdio.h>
#include<gd.h>
#include<omp.h>
void main(int argc,char* argv[]){
int x,y,w,h,c,r,g,b,t,tid;
t=r=g=b=c=x=w=h=y=0;
gdImagePtr img;
FILE *fp = NULL;
char *in = NULL,*on = NULL;
if(argc!=3){
printf("\nerror argc ! 3\n");
exit(0);
}
else{
in = argv[1]; on = argv[2];
}
if( ( fp = fopen(in,"r")) == NULL){... |
dufu-64-128-18r.c | /*
* Date: 11 December 2015
* Contact: Thomas Peyrin - thomas.peyrin@gmail.com
*/
/*
* Simmulation of boomerang analysis for Skinny
* Date: March 21, 2020
* Author: Hosein Hadipour
* Contact: hsn.hadipour@gmail.com
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#inc... |
main.c | #include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <string.h>
#include <math.h>
#include "omp.h"
#include "aux.h"
void sequential_product(block **a, block **b, block **c, int n, int nb);
void parallel_product(block **a, block **b, block **c, int n, int nb);
int main(int argc, char **argv){
int ... |
Parallel.h | #pragma once
#include <ATen/ATen.h>
#include <atomic>
#include <cstddef>
#include <exception>
#ifdef _OPENMP
#include <omp.h>
#endif
namespace at {
namespace internal {
// This parameter is heuristically chosen to determine the minimum number of
// work that warrants paralellism. For example, when summing an array, i... |
ParallelOpenMP.h | #pragma once
#include <atomic>
#include <cstddef>
#include <exception>
#ifdef _OPENMP
#define INTRA_OP_PARALLEL
#include <omp.h>
#endif
namespace at {
#ifdef _OPENMP
namespace internal {
template <typename F>
inline void invoke_parallel(
int64_t begin,
int64_t end,
int64_t grain_size,
const F& f) {... |
mitchell_shaeffer_2003.c | #include <stdio.h>
#include "mitchell_shaeffer_2003.h"
GET_CELL_MODEL_DATA(init_cell_model_data)
{
if(get_initial_v)
cell_model->initial_v = INITIAL_V;
if(get_neq)
cell_model->number_of_ode_equations = NEQ;
}
SET_ODE_INITIAL_CONDITIONS_CPU(set_model_initial_conditions_cpu)
{
/*
static ... |
GB_unaryop__lnot_uint64_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... |
parallel.c | // gcc -o omp_helloc -fopenmp omp_hello.c
// export OMP_NUM_THREADS=2
// ./omp_helloc
// Hello World from thread = 0
// Hello World from thread = 1
// Number of threads = 2
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <sys/time.h>
#include <omp.h>
int main(void) {
int n = 55... |
collective_broadcast.c | /*****************************************************************************
* *
* Mixed-mode OpenMP/MPI MicroBenchmark Suite - Version 1.0 *
* *
* ... |
core_ztrmm.c | /**
*
* @file
*
* PLASMA is a software package provided by:
* University of Tennessee, US,
* University of Manchester, UK.
*
* @precisions normal z -> c d s
*
**/
#include <plasma_core_blas.h>
#include "plasma_types.h"
#include "core_lapack.h"
/************************************************************... |
AwFmParallelSearch.c | #include "AwFmIndex.h"
#include "AwFmIndexStruct.h"
#include "AwFmParallelSearch.h"
#include "AwFmSearch.h"
#include "AwFmKmerTable.h"
#include "AwFmFile.h"
#include "AwFmLetter.h"
#include "AwFmSuffixArray.h"
#include <stdint.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#define NUM_CONCURRENT_QUER... |
TemporalReflectionPadding.c | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/TemporalReflectionPadding.c"
#else
static void THNN_(TemporalReflectionPadding_updateOutput_frame)(
real *input_p, real *output_p,
long nslices,
long iwidth,
long owidth,
int pad_l, int pad_r)
{
int iStartX = fmax(0, -pad_l);
int oStartX = fmax(0, ... |
task.c | /* Copyright (C) 2007-2017 Free Software Foundation, Inc.
Contributed by Richard Henderson <rth@redhat.com>.
This file is part of the GNU Offloading and Multi Processing Library
(libgomp).
Libgomp is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public Licen... |
tally.h | #ifndef OPENMC_TALLIES_TALLY_H
#define OPENMC_TALLIES_TALLY_H
#include "openmc/constants.h"
#include "openmc/tallies/filter.h"
#include "openmc/tallies/trigger.h"
#include <gsl/gsl>
#include "pugixml.hpp"
#include "xtensor/xfixed.hpp"
#include "xtensor/xtensor.hpp"
#include <memory> // for unique_ptr
#include <unord... |
declare_variant_ast_print.c | // RUN: %clang_cc1 -verify -fopenmp -x c -std=c99 -ast-print %s -o - -Wno-openmp-clauses | FileCheck %s
// RUN: %clang_cc1 -verify -fopenmp-simd -x c -std=c99 -ast-print %s -o - -Wno-openmp-clauses | FileCheck %s
// expected-no-diagnostics
int foo(void);
#pragma omp declare variant(foo) match(construct={target})
#p... |
GB_assign_zombie4.c | //------------------------------------------------------------------------------
// GB_assign_zombie4: delete entries in C(i,:) for C_replace_phase
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-Li... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.