source stringlengths 3 92 | original_c stringlengths 26 2.25M | no_omp_formatted stringlengths 0 2.25M | omp_formatted stringlengths 0 2.25M |
|---|---|---|---|
glutils.h | // -*- C++ -*-
#ifndef classutils_h_
#define classutils_h_
#include <unistd.h>
#include <sys/stat.h>
#include <cctype>
#include "glinerec.h"
#ifndef _OPENMP
#define OCRO_THREAD 0
#define OCRO_NTHREADS 1
#else
#include <omp.h>
#define OCRO_THREAD omp_get_thread_num()
#define OCRO_NTHREADS omp_get_num_threads()
#endif... | // -*- C++ -*-
#ifndef classutils_h_
#define classutils_h_
#include <unistd.h>
#include <sys/stat.h>
#include <cctype>
#include "glinerec.h"
#ifndef _OPENMP
#define OCRO_THREAD 0
#define OCRO_NTHREADS 1
#else
#include <omp.h>
#define OCRO_THREAD omp_get_thread_num()
#define OCRO_NTHREADS omp_get_num_threads()
#endif... | // -*- C++ -*-
#ifndef classutils_h_
#define classutils_h_
#include <unistd.h>
#include <sys/stat.h>
#include <cctype>
#include "glinerec.h"
#ifndef _OPENMP
#define OCRO_THREAD 0
#define OCRO_NTHREADS 1
#else
#include <omp.h>
#define OCRO_THREAD omp_get_thread_num()
#define OCRO_NTHREADS omp_get_num_threads()
#endif... |
cudanetworkexecutor.h | #pragma once
#ifndef CUDANETWORKEXECUTOR_H__
#define CUDANETWORKEXECUTOR_H__
#include "networkexecutor.h"
#include "cudanetworkbatch.h"
namespace NEAT {
//---
//--- CLASS CudaNetworkExecutor
//---
template<typename Evaluator>
class CudaNetworkExecutor : public NetworkExecutor<Evaluator> {
... | #pragma once
#ifndef CUDANETWORKEXECUTOR_H__
#define CUDANETWORKEXECUTOR_H__
#include "networkexecutor.h"
#include "cudanetworkbatch.h"
namespace NEAT
{
//---
//---CLASS CudaNetworkExecutor
// ---
template < typename Evaluator >
class CudaNetworkExecutor:public NetworkExecutor < Evaluator >
... | #pragma once
#ifndef CUDANETWORKEXECUTOR_H__
#define CUDANETWORKEXECUTOR_H__
#include "networkexecutor.h"
#include "cudanetworkbatch.h"
namespace NEAT
{
//---
//---CLASS CudaNetworkExecutor
// ---
template < typename Evaluator >
class CudaNetworkExecutor:public NetworkExecutor < Evaluator >
... |
image.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/animate.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/blob-private.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-private.h"
#include "MagickCore/... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/animate.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/blob-private.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-private.h"
#include "MagickCore/... |
mixed_tentusscher_myo_epi_2004_S2_14.c | // Scenario 2 - Mixed-Model TenTusscher 2004 (Myocardium + Epicardium)
// (AP + max:dvdt)
#include <stdio.h>
#include "mixed_tentusscher_myo_epi_2004_S2_14.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... | // Scenario 2 - Mixed-Model TenTusscher 2004 (Myocardium + Epicardium)
// (AP + max:dvdt)
#include <stdio.h>
#include "mixed_tentusscher_myo_epi_2004_S2_14.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... | // Scenario 2 - Mixed-Model TenTusscher 2004 (Myocardium + Epicardium)
// (AP + max:dvdt)
#include <stdio.h>
#include "mixed_tentusscher_myo_epi_2004_S2_14.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... |
GB_binop__lor_uint32.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_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... |
shape.h | /*******************************************************************************
* Copyright (c) 2015-2018 Skymind, Inc.
*
* This program and the accompanying materials are made available under the
* terms of the Apache License, Version 2.0 which is available at
* https://www.apache.org/licenses/LICENSE-2.0.
*
*... |
/*
* shape.h
*
* Created on: Dec 28, 2015
* Author: agibsonccc
*/
#ifndef SHAPE_H_
#define SHAPE_H_
#include <cstring>
#include <cstdio>
#include "../dll.h"
#include "../nd4jmalloc.h"
#include "../templatemath.h"
#include "../helpers/logger.h"
#include "../pointercast.h"
#include "../cnpy/cnpy.h"
#includ... |
/*
* shape.h
*
* Created on: Dec 28, 2015
* Author: agibsonccc
*/
#ifndef SHAPE_H_
#define SHAPE_H_
#include <cstring>
#include <cstdio>
#include "../dll.h"
#include "../nd4jmalloc.h"
#include "../templatemath.h"
#include "../helpers/logger.h"
#include "../pointercast.h"
#include "../cnpy/cnpy.h"
#includ... |
masterNoBarrier.c | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
int main(int argc, char **argv) {
int i, n=20, tid, a[n], suma=0, sumalocal;
if (argc < 2) {
fprintf(stderr,"\nFalta iteraciones\n");
exit(-1);
}
n = atoi(argv[1]);
if (n>20) n=20;
for (i=0; i<n; i++) a[i] = i;
#pragma omp parallel privat... | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
int
main(int argc, char **argv)
{
int i, n = 20, tid, a[n], suma = 0, sumalocal;
if (argc < 2)
{
fprintf(stderr, "\nFalta iteraciones\n");
exit(-1);
}
n = atoi(argv[1]);
if (n > 20)
n = 20;
for (i = 0; i < n; i... | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
int
main(int argc, char **argv)
{
int i, n = 20, tid, a[n], suma = 0, sumalocal;
if (argc < 2)
{
fprintf(stderr, "\nFalta iteraciones\n");
exit(-1);
}
n = atoi(argv[1]);
if (n > 20)
n = 20;
for (i = 0; i < n; i... |
a.15.1.c | /* { dg-do run } */
#include <stdio.h>
void
work (int n)
{
printf ("[%d of %d], nested = %d, n = %d\n", omp_get_thread_num (), omp_get_num_threads(), omp_get_nested (), n);
}
void
sub3 (int n)
{
work (n);
#pragma omp barrier
work (n);
}
void
sub2 (int k)
{
#pragma omp parallel shared(k)
sub3 (k);
}
void
su... | /* { dg-do run } */
#include <stdio.h>
void
work(int n)
{
printf("[%d of %d], nested = %d, n = %d\n", omp_get_thread_num(), omp_get_num_threads(), omp_get_nested(), n);
}
void
sub3(int n)
{
work(n);
work(n);
}
void
sub2(int k)
{
sub3(k);
}
void
sub1(int n)
{
int i;
for (i = 0; i < n; i++)
... | /* { dg-do run } */
#include <stdio.h>
void
work(int n)
{
printf("[%d of %d], nested = %d, n = %d\n", omp_get_thread_num(), omp_get_num_threads(), omp_get_nested(), n);
}
void
sub3(int n)
{
work(n);
#pragma omp barrier
work(n);
}
void
sub2(int k)
{
#pragma omp parallel shared(k)
sub3(k);
}
void
sub... |
gemv_c_coo_conj.c | #include "alphasparse/kernel.h"
#include "alphasparse/kernel_plain.h"
#include "alphasparse/opt.h"
#include "alphasparse/util.h"
#include <string.h>
#ifdef _OPENMP
#include <omp.h>
#endif
static alphasparse_status_t
gemv_c_coo_conj_omp(const ALPHA_Number alpha,
const ALPHA_SPMAT_COO *A,
const ALPHA_Number... | #include "alphasparse/kernel.h"
#include "alphasparse/kernel_plain.h"
#include "alphasparse/opt.h"
#include "alphasparse/util.h"
#include <string.h>
static alphasparse_status_t
gemv_c_coo_conj_omp(const ALPHA_Number alpha,
const ALPHA_SPMAT_COO * A,
const ALPHA_Number * x,
... | #include "alphasparse/kernel.h"
#include "alphasparse/kernel_plain.h"
#include "alphasparse/opt.h"
#include "alphasparse/util.h"
#include <string.h>
#ifdef _OPENMP
#include <omp.h>
#endif
static alphasparse_status_t
gemv_c_coo_conj_omp(const ALPHA_Number alpha,
const ALPHA_SPMAT_COO * A,
... |
GB_binop__bclr_int64.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
GB_unop__ainv_int32_int32.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... | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-Li... | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-Li... |
nstream-memcpy-target.c | ///
/// Copyright (c) 2019, Intel Corporation
///
/// 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
/// notice, this list of conditions ... | ///
/// Copyright (c) 2019, Intel Corporation
///
/// 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
/// notice, this list of conditions ... | ///
/// Copyright (c) 2019, Intel Corporation
///
/// 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
/// notice, this list of conditions ... |
endless.c | #include <time.h>
#include <stdio.h>
#include <hermit/syscall.h>
int main(int argc, char **argv) {
int cnt = 0;
#pragma omp parallel
while(1) {
#pragma omp critical
{
printf("Counter %d\n", ++cnt);
}
sys_msleep(500);
}
return 0;
}
| #include <time.h>
#include <stdio.h>
#include <hermit/syscall.h>
int
main(int argc, char **argv)
{
int cnt = 0;
while (1)
{
printf("Counter %d\n", ++cnt);
sys_msleep(500);
}
return 0;
}
|
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/blob-private.h"
#include "MagickCore/cache.h"
#include "MagickCore/channel.h"
#include "MagickCore/colormap.h"
#include "MagickCore/color... |
Krylov_4d.h | #ifndef BFM_KRY4D_H
#define BFM_KRY4D_H
#include "Krylov.h"
#include <cstdlib>
#include <string>
#include <cmath>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <fstream>
#include <complex>
#include <bfm_qdp_g5d.h>
namespace BFM_Krylov{
//#include "dwf_4d.h"
/**
A 4d eigensolver.
**/
template... | #ifndef BFM_KRY4D_H
#define BFM_KRY4D_H
#include "Krylov.h"
#include <cstdlib>
#include <string>
#include <cmath>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <fstream>
#include <complex>
#include <bfm_qdp_g5d.h>
namespace BFM_Krylov
{
//
#include "dwf_4d.h"
/**
A 4d eigensolver.... | #ifndef BFM_KRY4D_H
#define BFM_KRY4D_H
#include "Krylov.h"
#include <cstdlib>
#include <string>
#include <cmath>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <fstream>
#include <complex>
#include <bfm_qdp_g5d.h>
namespace BFM_Krylov
{
//
#include "dwf_4d.h"
/**
A 4d eigensolver.... |
GB_unaryop__ainv_fp64_uint8.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_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http... | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http... |
ivf.c | /*
Copyright © INRIA 2009-2014.
Authors: Matthijs Douze & Herve Jegou
Contact: matthijs.douze@inria.fr herve.jegou@inria.fr
This file is part of Yael.
Yael 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 Founda... |
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include "ivf.h"
#include "hamming.h"
/* geometric re-allocation add a relative 50% of additional memory */
#define IVF_REALLOC_NEWSIZE(oldsize) (4+((oldsize * 3) / 2))
int
ivf_checksum(const ivf_t * ivf)
{
return (ivf->checksum ... |
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include "ivf.h"
#include "hamming.h"
/* geometric re-allocation add a relative 50% of additional memory */
#define IVF_REALLOC_NEWSIZE(oldsize) (4+((oldsize * 3) / 2))
int
ivf_checksum(const ivf_t * ivf)
{
return (ivf->checksum ... |
atomic.c | /* PMSIS includes */
#include "pmsis.h"
#include "omp.h"
#define ARRAY_SIZE 512
uint32_t a[ARRAY_SIZE] = {0};
uint32_t b[ARRAY_SIZE] = {0};
uint32_t c[ARRAY_SIZE] = {0};
uint32_t errors = 0;
/* Cluster main entry, executed by core 0. */
void cluster_delegate(void *arg)
{
printf("Cluster master core entry\n");
... | /* PMSIS includes */
#include "pmsis.h"
#include "omp.h"
#define ARRAY_SIZE 512
uint32_t a[ARRAY_SIZE] = {0};
uint32_t b[ARRAY_SIZE] = {0};
uint32_t c[ARRAY_SIZE] = {0};
uint32_t errors = 0;
/* Cluster main entry, executed by core 0. */
void
cluster_delegate(void *arg)
{
printf("Cluster master core entry\n");
... | /* PMSIS includes */
#include "pmsis.h"
#include "omp.h"
#define ARRAY_SIZE 512
uint32_t a[ARRAY_SIZE] = {0};
uint32_t b[ARRAY_SIZE] = {0};
uint32_t c[ARRAY_SIZE] = {0};
uint32_t errors = 0;
/* Cluster main entry, executed by core 0. */
void
cluster_delegate(void *arg)
{
printf("Cluster master core entry\n");
... |
ParallelFor.h | // ----------------------------------------------------------------------------
// - Open3D: www.open3d.org -
// ----------------------------------------------------------------------------
// The MIT License (MIT)
//
// Copyright (c) 2018-2021 www.open3d.org
//
// Perm... | // ----------------------------------------------------------------------------
//-Open3D:www.open3d.org -
//----------------------------------------------------------------------------
//The MIT License(MIT)
//
//Copyright(c) 2018 - 2021 www.open3d.org
//
//Permission is hereby granted, free of charge, to any person o... | // ----------------------------------------------------------------------------
//-Open3D:www.open3d.org -
//----------------------------------------------------------------------------
//The MIT License(MIT)
//
//Copyright(c) 2018 - 2021 www.open3d.org
//
//Permission is hereby granted, free of charge, to any person o... |
test.c |
#include <stdio.h>
#include <float.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
#include "../utilities/check.h"
#include "../utilities/utilities.h"
#define TRIALS (1)
#define N (957*3)
#define ZERO(X) ZERO_ARRAY(N, X)
#define INIT() { \
INIT_LOOP(N, { \
Ad[i] = 1 << 16; \
Bd[i] = i << 16; \
Cd... |
#include <stdio.h>
#include <float.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
#include "../utilities/check.h"
#include "../utilities/utilities.h"
#define TRIALS (1)
#define N (957*3)
#define ZERO(X) ZERO_ARRAY(N, X)
#define INIT() { \
INIT_LOOP(N, { \
Ad[i] = 1 << 16; \
Bd[i] = i << 16; \
Cd... |
#include <stdio.h>
#include <float.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
#include "../utilities/check.h"
#include "../utilities/utilities.h"
#define TRIALS (1)
#define N (957*3)
#define ZERO(X) ZERO_ARRAY(N, X)
#define INIT() { \
INIT_LOOP(N, { \
Ad[i] = 1 << 16; \
Bd[i] = i << 16; \
Cd... |
reduction_user_identifier.c |
#include <stdio.h>
#ifdef _OPENMP
#include <omp.h>
#endif
int main()
{
int a, b, c;
#pragma omp parallel reduction (user_iden:a, b) reduction (user_iden:a, c)
{
printf("This is for testing parser and AST construction, which could be only syntax correct.\n");
}
#pragma omp parallel reduction (insc... |
#include <stdio.h>
int
main()
{
int a, b, c;
printf("This is for testing parser and AST construction, which could be only syntax correct.\n");
printf("This is for testing parser and AST construction, which could be only syntax correct.\n");
return 0;
}
|
#include <stdio.h>
#ifdef _OPENMP
#include <omp.h>
#endif
int
main()
{
int a, b, c;
#pragma omp parallel reduction (user_iden:a, b) reduction (user_iden:a, c)
{
printf("This is for testing parser and AST construction, which could be only syntax correct.\n");
}
#pragma omp parallel reduction (i... |
GB_unop__identity_uint16_uint64.c | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http://... | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http://... | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http://... |
reduction_utilities.h | // | / |
// ' / __| _` | __| _ \ __|
// . \ | ( | | ( |\__ `
// _|\_\_| \__,_|\__|\___/ ____/
// Multi-Physics
//
// License: BSD License
// Kratos default license: kratos/license.txt
//
// Main authors: Riccardo Rossi
// Denis Demidov... | // | / |
// ' / __| _` | __| _ \ __|
// . \ | ( | | ( |\__ `
// _|\_\_| \__,_|\__|\___/ ____/
// Multi-Physics
//
// License: BSD License
// Kratos default license: kratos/license.txt
//
// Main authors: Riccardo Rossi
// Denis Demidov... | // | / |
// ' / __| _` | __| _ \ __|
// . \ | ( | | ( |\__ `
// _|\_\_| \__,_|\__|\___/ ____/
// Multi-Physics
//
// License: BSD License
// Kratos default license: kratos/license.txt
//
// Main authors: Riccardo Rossi
// Denis Demidov... |
gbdt.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_BOOSTING_GBDT_H_
#define LIGHTGBM_BOOSTING_GBDT_H_
#include <LightGBM/boosting.h>
#include <LightGBM/objective_function.h>
#include... |
#ifndef LIGHTGBM_BOOSTING_GBDT_H_
#define LIGHTGBM_BOOSTING_GBDT_H_
#include <LightGBM/boosting.h>
#include <LightGBM/objective_function.h>
#include <LightGBM/prediction_early_stop.h>
#include <LightGBM/cuda/vector_cudahost.h>
#include <LightGBM/utils/json11.h>
#include <LightGBM/utils/threading.h>
#include <string>... |
#ifndef LIGHTGBM_BOOSTING_GBDT_H_
#define LIGHTGBM_BOOSTING_GBDT_H_
#include <LightGBM/boosting.h>
#include <LightGBM/objective_function.h>
#include <LightGBM/prediction_early_stop.h>
#include <LightGBM/cuda/vector_cudahost.h>
#include <LightGBM/utils/json11.h>
#include <LightGBM/utils/threading.h>
#include <string>... |
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... | #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... | #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... |
path.c | /********************************************************************[libaroma]*
* Copyright (C) 2011-2015 Ahmad Amarullah (http://amarullz.com/)
*
* 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 Lic... |
#ifndef __libaroma_path_c__
#define __libaroma_path_c__
#include <aroma_internal.h>
#ifdef __cplusplus
extern "C"
{
#endif
/*
* Function : libaroma_path Return Value: LIBAROMA_PATHP
* Descriptions: create new path
*/
LIBAROMA_PATHP libaroma_path(float x, float y)
{
LIBAROMA_PATHP ... |
#ifndef __libaroma_path_c__
#define __libaroma_path_c__
#include <aroma_internal.h>
#ifdef __cplusplus
extern "C"
{
#endif
/*
* Function : libaroma_path Return Value: LIBAROMA_PATHP
* Descriptions: create new path
*/
LIBAROMA_PATHP libaroma_path(float x, float y)
{
LIBAROMA_PATHP ... |
ctl_fragment.c | /********************************************************************[libaroma]*
* Copyright (C) 2011-2015 Ahmad Amarullah (http://amarullz.com/)
*
* 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 Lic... |
#ifndef __libaroma_ctl_fragment_c__
#define __libaroma_ctl_fragment_c__
#include <aroma_internal.h>
#include "../ui/ui_internal.h"
/*************************** CONTROL HANDLERS *********************************/
dword _libaroma_ctl_fragment_msg(LIBAROMA_CONTROLP, LIBAROMA_MSGP);
void _libaroma_ctl_fragment_draw(LIBAR... |
#ifndef __libaroma_ctl_fragment_c__
#define __libaroma_ctl_fragment_c__
#include <aroma_internal.h>
#include "../ui/ui_internal.h"
/*************************** CONTROL HANDLERS *********************************/
dword _libaroma_ctl_fragment_msg(LIBAROMA_CONTROLP, LIBAROMA_MSGP);
void _libaroma_ctl_fragment_draw(LIBAR... |
diffusion.h | //
// diffusion.h
//
//
// Created by Ibrahim Harrane on 11/05/2016.
//
//
#ifndef diffusion_h
#define diffusion_h
/*
*
* L: Desired parameter lenght
* N: Number of nodes
* K: Number of iterations
*
*
* A: N x N
* C: N x N
* w_0 L x N
* u L x N x K
* d ... | //
// diffusion.h
//
//
// Created by Ibrahim Harrane on 11/05/2016.
//
//
#ifndef diffusion_h
#define diffusion_h
/*
*
* L: Desired parameter lenght
* N: Number of nodes
* K: Number of iterations
*
*
* A: N x N
* C: N x N
* w_0 L x N
* u L x N x K
* d ... | //
// diffusion.h
//
//
// Created by Ibrahim Harrane on 11/05/2016.
//
//
#ifndef diffusion_h
#define diffusion_h
/*
*
* L: Desired parameter lenght
* N: Number of nodes
* K: Number of iterations
*
*
* A: N x N
* C: N x N
* w_0 L x N
* u L x N x K
* d ... |
main.c | #include "stdafx.h"
#include "intrin.h"
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <signal.h>
#include <pthread.h>
#include <jansson.h>
//#include <atomic.h>
// Link with ws2_32.lib
#pragma comment(lib, "Ws2_32.lib")
#pragma comment(lib, "CRYPT32.LIB")
#ifdef __x86_64__
//#include <cpuid.h>
#... | #include "stdafx.h"
#include "intrin.h"
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <signal.h>
#include <pthread.h>
#include <jansson.h>
//#include <atomic.h>
// Link with ws2_32.lib
#pragma comment(lib, "Ws2_32.lib")
#pragma comment(lib, "CRYPT32.LIB")
#ifdef __x86_64__
//#include <cpuid.h>
#... | #include "stdafx.h"
#include "intrin.h"
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <signal.h>
#include <pthread.h>
#include <jansson.h>
//#include <atomic.h>
// Link with ws2_32.lib
#pragma comment(lib, "Ws2_32.lib")
#pragma comment(lib, "CRYPT32.LIB")
#ifdef __x86_64__
//#include <cpuid.h>
#... |
GB_binop__rdiv_int8.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http:... | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http:... | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http:... |
sectionModificado.c | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
main(){
int n=9, i,a,b[n];
for(i=0;i<n;i++) b[i]=-1;
#pragma omp parallel
{
#pragma omp single
{
printf("Introduce valor de inicializacion a:");
scanf("%d",&a);
printf("Single ejecutada por el thread%d\n",omp_get_thread_num(... | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
main(){
int n=9, i,a,b[n];
for(i=0;i<n;i++) b[i]=-1;
#pragma omp single
{
printf("Introduce valor de inicializacion a:");
scanf("%d",&a);
printf("Single ejecutada por el thread%d\n",omp_get_thread_num());
}
for(i=0;i<n;i++)... | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
main(){
int n=9, i,a,b[n];
for(i=0;i<n;i++) b[i]=-1;
#pragma omp parallel
{
#pragma omp single
{
printf("Introduce valor de inicializacion a:");
scanf("%d",&a);
printf("Single ejecutada por el thread%d\n",omp_get_thread_num(... |
Example_target_task_reduction.2b.c | /*
* @@name: target_task_reduction.2b.c
* @@type: C
* @@compilable: yes
* @@linkable: yes
* @@expect: success
* @@version: omp_5.0
*/
#include <stdio.h>
#pragma omp declare target to(device_compute)
extern void device_compute(int *);
extern void host_compute(int *);
int main()
{
int sum = 0;
#pragma omp parallel... | /*
* @@name: target_task_reduction.2b.c @@type: C @@compilable: yes @@linkable:
* yes @@expect: success @@version: omp_5.0
*/
#include <stdio.h>
extern void device_compute(int *);
extern void host_compute(int *);
int
main()
{
int sum = 0;
device_compute(&sum);
host_compute(&sum);
printf("sum = %d\... | /*
* @@name: target_task_reduction.2b.c @@type: C @@compilable: yes @@linkable:
* yes @@expect: success @@version: omp_5.0
*/
#include <stdio.h>
#pragma omp declare target to(device_compute)
extern void device_compute(int *);
extern void host_compute(int *);
int
main()
{
int sum = 0;
#pragma omp parallel maste... |
image-view.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% IIIII M M AAA GGGG EEEEE ... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/MagickCore.h"
#include "MagickCore/exception-private.h"
#include "MagickCore/memory-private.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/thread-private.h"
/*
* Typedef declarations.
*/
struct _ImageView
{
c... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/MagickCore.h"
#include "MagickCore/exception-private.h"
#include "MagickCore/memory-private.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/thread-private.h"
/*
* Typedef declarations.
*/
struct _ImageView
{
c... |
Sqrt.c | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/Sqrt.c"
#else
void THNN_(Sqrt_updateOutput)(
THNNState *state,
THTensor *input,
THTensor *output,
accreal eps_)
{
real eps = TH_CONVERT_ACCREAL_TO_REAL(eps_);
THTensor_(resizeAs)(output, input);
THTensor_(sqrt)(outpu... | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/Sqrt.c"
#else
void THNN_(Sqrt_updateOutput)(
THNNState *state,
THTensor *input,
THTensor *output,
accreal eps_)
{
real eps = TH_CONVERT_ACCREAL_TO_REAL(eps_);
THTensor_(resizeAs)(output, input);
THTensor_(sqrt)(outpu... | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/Sqrt.c"
#else
void THNN_(Sqrt_updateOutput)(
THNNState *state,
THTensor *input,
THTensor *output,
accreal eps_)
{
real eps = TH_CONVERT_ACCREAL_TO_REAL(eps_);
THTensor_(resizeAs)(output, input);
THTensor_(sqrt)(outpu... |
yolov2_forward_network.c | #include "additionally.h" // some definitions from: im2col.h, blas.h, list.h, utils.h, activations.h, tree.h, layer.h, network.h
// softmax_layer.h, reorg_layer.h, route_layer.h, region_layer.h, maxpool_layer.h, convolutional_layer.h
#define GEMMCONV
/*
// from: box.h
typedef struct {
float x, y, w, h;
} box;
... | #include "additionally.h" // some definitions from: im2col.h, blas.h, list.h, utils.h, activations.h, tree.h, layer.h, network.h
// softmax_layer.h, reorg_layer.h, route_layer.h, region_layer.h, maxpool_layer.h, convolutional_layer.h
#define GEMMCONV
/*
// from: box.h
typedef struct {
float x, y, w, h;
} box;
... | #include "additionally.h" // some definitions from: im2col.h, blas.h, list.h, utils.h, activations.h, tree.h, layer.h, network.h
// softmax_layer.h, reorg_layer.h, route_layer.h, region_layer.h, maxpool_layer.h, convolutional_layer.h
#define GEMMCONV
/*
// from: box.h
typedef struct {
float x, y, w, h;
} box;
... |
GB_binop__rdiv_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:... | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http:... | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http:... |
utils.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 ... |
/*!
* Copyright (c) 2015 by Contributors
* \file utils.h
* \brief Basic utilility functions.
*/
#ifndef MXNET_COMMON_UTILS_H_
#define MXNET_COMMON_UTILS_H_
#include <dmlc/logging.h>
#include <dmlc/omp.h>
#include <nnvm/graph.h>
#include <mxnet/engine.h>
#include <mxnet/ndarray.h>
#include <mxnet/op_attr_types.h>... |
/*!
* Copyright (c) 2015 by Contributors
* \file utils.h
* \brief Basic utilility functions.
*/
#ifndef MXNET_COMMON_UTILS_H_
#define MXNET_COMMON_UTILS_H_
#include <dmlc/logging.h>
#include <dmlc/omp.h>
#include <nnvm/graph.h>
#include <mxnet/engine.h>
#include <mxnet/ndarray.h>
#include <mxnet/op_attr_types.h>... |
cones.c | #include "cones.h"
#define CONE_RATE (2)
#define CONE_TOL (1e-7)
#define EXP_CONE_MAX_ITERS (100)
#ifdef LAPACK_LIB_FOUND
/* underscore for blas / lapack, single or double precision */
#ifdef NOBLASUNDERSCORE
#ifndef FLOAT
#define BLAS(x) d ## x
#else
#define BLAS(x) s ## x
#endif
#else
#ifndef FLOAT
#define BLAS(x) ... | #include "cones.h"
#define CONE_RATE (2)
#define CONE_TOL (1e-7)
#define EXP_CONE_MAX_ITERS (100)
#ifdef LAPACK_LIB_FOUND
/* underscore for blas / lapack, single or double precision */
#ifdef NOBLASUNDERSCORE
#ifndef FLOAT
#define BLAS(x) d ## x
#else
#define BLAS(x) s ## x
#endif
#else
#ifndef FLOAT
#define BLAS(x) ... | #include "cones.h"
#define CONE_RATE (2)
#define CONE_TOL (1e-7)
#define EXP_CONE_MAX_ITERS (100)
#ifdef LAPACK_LIB_FOUND
/* underscore for blas / lapack, single or double precision */
#ifdef NOBLASUNDERSCORE
#ifndef FLOAT
#define BLAS(x) d ## x
#else
#define BLAS(x) s ## x
#endif
#else
#ifndef FLOAT
#define BLAS(x) ... |
tree-parloops.c | /* Loop autoparallelization.
Copyright (C) 2006, 2007, 2008, 2009, 2010
Free Software Foundation, Inc.
Contributed by Sebastian Pop <pop@cri.ensmp.fr> and
Zdenek Dvorak <dvorakz@suse.cz>.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU Ge... |
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
#include "rtl.h"
#include "tree-flow.h"
#include "cfgloop.h"
#include "ggc.h"
#include "tree-data-ref.h"
#include "diagnostic.h"
#include "tree-pass.h"
#include "tree-scalar-evolution.h"
#include "hashtab.h"
#include "lan... |
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
#include "rtl.h"
#include "tree-flow.h"
#include "cfgloop.h"
#include "ggc.h"
#include "tree-data-ref.h"
#include "diagnostic.h"
#include "tree-pass.h"
#include "tree-scalar-evolution.h"
#include "hashtab.h"
#include "lan... |
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... | // -------------------------------------------------------------------------//
////
//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 //
//National University and derived from the serial Fortran versions in //
/... | // -------------------------------------------------------------------------//
////
//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 //
//National University and derived from the serial Fortran versions in //
/... |
kvstore_dist_server.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 ... |
/*!
* \file mxnet_node.h
* \brief implement mxnet nodes
*/
#ifndef MXNET_KVSTORE_KVSTORE_DIST_SERVER_H_
#define MXNET_KVSTORE_KVSTORE_DIST_SERVER_H_
#include <mxnet/c_api.h>
#include <mxnet/kvstore.h>
#include <ps/ps.h>
#include <queue>
#include <string>
#include <mutex>
#include <condition_variable>
#include <mem... |
/*!
* \file mxnet_node.h
* \brief implement mxnet nodes
*/
#ifndef MXNET_KVSTORE_KVSTORE_DIST_SERVER_H_
#define MXNET_KVSTORE_KVSTORE_DIST_SERVER_H_
#include <mxnet/c_api.h>
#include <mxnet/kvstore.h>
#include <ps/ps.h>
#include <queue>
#include <string>
#include <mutex>
#include <condition_variable>
#include <mem... |
trmv_x_sky_u_hi_conj.c | #include "alphasparse/kernel.h"
#include "alphasparse/opt.h"
#include "alphasparse/util.h"
#include <string.h>
#ifdef _OPENMP
#include <omp.h>
#endif
static alphasparse_status_t ONAME_omp(const ALPHA_Number alpha,
const ALPHA_SPMAT_SKY *A,
const ALPHA_Number *x,
... | #include "alphasparse/kernel.h"
#include "alphasparse/opt.h"
#include "alphasparse/util.h"
#include <string.h>
static alphasparse_status_t
ONAME_omp(const ALPHA_Number alpha,
const ALPHA_SPMAT_SKY * A,
const ALPHA_Number * x,
const ALPHA_Number beta,
ALPHA_Number * y)
{
#ifdef ... | #include "alphasparse/kernel.h"
#include "alphasparse/opt.h"
#include "alphasparse/util.h"
#include <string.h>
#ifdef _OPENMP
#include <omp.h>
#endif
static alphasparse_status_t
ONAME_omp(const ALPHA_Number alpha,
const ALPHA_SPMAT_SKY * A,
const ALPHA_Number * x,
const ALPHA_Number bet... |
noWait.c |
// OpenMP NoWait Example
// Inclusions
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
// Main
int main( int argc, char** argv ) {
int i = 0; // Loop Iterator
int n = 0; // Number of Iterations
double start = 0.0; // Start Time
double middle = 0.0; // Middle Time
double ... |
// OpenMP NoWait Example
// Inclusions
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
// Main
int
main(int argc, char **argv)
{
int i = 0;
//Loop Iterator
int n = 0;
//Number of Iterations
double start = 0.0;
//Start Time
double middle = 0.0;
//Middle Time
... |
// OpenMP NoWait Example
// Inclusions
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
// Main
int
main(int argc, char **argv)
{
int i = 0;
//Loop Iterator
int n = 0;
//Number of Iterations
double start = 0.0;
//Start Time
double middle = 0.0;
//Middle Time
... |
rose_true_l2.c | /*
* Outer loop: no dependence:
* Inner loop: loop-carried dependence
*
* final dependence graph:
* dep SgExprStatement:(a[i])[j] =(((a[i])[j - 1]) + 1);
* SgExprStatement:(a[i])[j] =(((a[i])[j - 1]) + 1);
* 2*2TRUE_DEP; commonlevel = 2 +precise CarryLevel = 1
* SgPntrArrRefExp:(a[i])[j]
* SgP... | /*
* Outer loop: no dependence: Inner loop: loop-carried dependence
*
* final dependence graph: dep SgExprStatement:(a[i])[j] =(((a[i])[j - 1]) + 1);
* SgExprStatement:(a[i])[j] =(((a[i])[j - 1]) + 1); 2*2TRUE_DEP; commonlevel
* = 2 +precise CarryLevel = 1 SgPntrArrRefExp:(a[i])[j]
* SgPntrArrRefExp:((a[i])[j -... | /*
* Outer loop: no dependence: Inner loop: loop-carried dependence
*
* final dependence graph: dep SgExprStatement:(a[i])[j] =(((a[i])[j - 1]) + 1);
* SgExprStatement:(a[i])[j] =(((a[i])[j - 1]) + 1); 2*2TRUE_DEP; commonlevel
* = 2 +precise CarryLevel = 1 SgPntrArrRefExp:(a[i])[j]
* SgPntrArrRefExp:((a[i])[j -... |
convolution_7x7_pack1to4_int8.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 copy ... | // 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... | // 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... |
resize.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/accelerate-private.h"
#include "MagickCore/artifact.h"
#include "MagickCore/blob.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-view.h"
#include "MagickCore/channel.h"
#include "MagickCore/color.h"
#include "MagickCore/c... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/accelerate-private.h"
#include "MagickCore/artifact.h"
#include "MagickCore/blob.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-view.h"
#include "MagickCore/channel.h"
#include "MagickCore/color.h"
#include "MagickCore/c... |
elementwise_add_arm_func.h | /* Copyright (c) 2018 PaddlePaddle 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... |
#ifdef ELEMENTWISEADD_OP
#pragma once
#include "operators/math/elementwise_op_function.h"
#include "operators/op_param.h"
#if defined(__ARM_NEON__) || defined(__ARM_NEON)
#include <arm_neon.h>
#endif
namespace paddle_mobile
{
namespace operators
{
template < typename T >
inline void Elemen... |
#ifdef ELEMENTWISEADD_OP
#pragma once
#include "operators/math/elementwise_op_function.h"
#include "operators/op_param.h"
#if defined(__ARM_NEON__) || defined(__ARM_NEON)
#include <arm_neon.h>
#endif
namespace paddle_mobile
{
namespace operators
{
template < typename T >
inline void Elemen... |
LU-parallele-openmp.c | /**
* Thomas LAFOND, Hecham A.
* This file must be used under the term of the GPLv3
* Decomposition LU parallélisé avec OpenMP
*/
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
#define NRA 10 /* number of rows in matrix A */
// ligne pour compiler
// gcc -fopenmp LU-parallele-openmp.c
//... | /**
* Thomas LAFOND, Hecham A.
* This file must be used under the term of the GPLv3
* Decomposition LU parallélisé avec OpenMP
*/
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
#define NRA 10 /* number of rows in matrix A */
// ligne pour compiler
// gcc -fopenmp LU-parallele-openmp.c
//... | /**
* Thomas LAFOND, Hecham A.
* This file must be used under the term of the GPLv3
* Decomposition LU parallélisé avec OpenMP
*/
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
#define NRA 10 /* number of rows in matrix A */
// ligne pour compiler
// gcc -fopenmp LU-parallele-openmp.c
//... |
helloworld.c | #include <stdio.h>
#include <omp.h>
int main() {
int nthreads, tid;
#pragma omp parallel private(nthreads, tid)
{
tid = omp_get_thread_num();
printf("Hello World I'm thread: %d\n", tid);
if(tid == 0) {
nthreads = omp_get_num_threads();
printf("Num of threads: %d\n", nthreads);
}
}
... | #include <stdio.h>
#include <omp.h>
int
main()
{
int nthreads, tid;
tid = omp_get_thread_num();
printf("Hello World I'm thread: %d\n", tid);
if (tid == 0)
{
nthreads = omp_get_num_threads();
printf("Num of threads: %d\n", nthreads);
}
return 0;
}
| #include <stdio.h>
#include <omp.h>
int
main()
{
int nthreads, tid;
#pragma omp parallel private(nthreads, tid)
{
tid = omp_get_thread_num();
printf("Hello World I'm thread: %d\n", tid);
if (tid == 0)
{
nthreads = omp_get_num_threads();
printf("Num of t... |
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... | #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
*
* Tareq... | #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
*
* Tareq... |
leader_elect_lcr.c | #include <stdio.h>
#include <omp.h>
#include <string.h>
#include <stdlib.h>
#include "ompdist/election.h"
#include "ompdist/utils.h"
#include "ompdist/msr.h"
#include "config.h"
/**
* receive_leaders - Sets the next process' received leader to be the current
* process' candidate.
*
* @processes: the list of proce... | #include <stdio.h>
#include <omp.h>
#include <string.h>
#include <stdlib.h>
#include "ompdist/election.h"
#include "ompdist/utils.h"
#include "ompdist/msr.h"
#include "config.h"
/**
* receive_leaders - Sets the next process' received leader to be the current
* process' candidate.
*
* @processes: the list of proce... | #include <stdio.h>
#include <omp.h>
#include <string.h>
#include <stdlib.h>
#include "ompdist/election.h"
#include "ompdist/utils.h"
#include "ompdist/msr.h"
#include "config.h"
/**
* receive_leaders - Sets the next process' received leader to be the current
* process' candidate.
*
* @processes: the list of proce... |
ft_single.c | /*--------------------------------------------------------------------
NAS Parallel Benchmarks 2.3 OpenMP C versions - FT
This benchmark is an OpenMP C version of the NPB FT code.
The OpenMP C versions are developed by RWCP and derived from the serial
Fortran versions in "NPB 2.3-serial" developed by NAS... | /*--------------------------------------------------------------------
NAS Parallel Benchmarks 2.3 OpenMP C versions - FT
This benchmark is an OpenMP C version of the NPB FT code.
The OpenMP C versions are developed by RWCP and derived from the serial
Fortran versions in "NPB 2.3-serial" developed by NAS.
... | /*--------------------------------------------------------------------
NAS Parallel Benchmarks 2.3 OpenMP C versions - FT
This benchmark is an OpenMP C version of the NPB FT code.
The OpenMP C versions are developed by RWCP and derived from the serial
Fortran versions in "NPB 2.3-serial" developed by NAS.
... |
axpy_simd.c | /*
* AXPY Y[N] = Y[N] + a*X[N]
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <sys/timeb.h>
#include <stdbool.h>
#include <string.h>
#include <omp.h>
#include "../constants.h"
/* read timer in second */
double read_timer() {
struct timeb tm;
ftime(&tm);
return (double) tm.time + ... | /*
* AXPY Y[N] = Y[N] + a*X[N]
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <sys/timeb.h>
#include <stdbool.h>
#include <string.h>
#include <omp.h>
#include "../constants.h"
/* read timer in second */
double
read_timer()
{
struct timeb tm;
ftime(&tm);
return (double)tm.time + ... | /*
* AXPY Y[N] = Y[N] + a*X[N]
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <sys/timeb.h>
#include <stdbool.h>
#include <string.h>
#include <omp.h>
#include "../constants.h"
/* read timer in second */
double
read_timer()
{
struct timeb tm;
ftime(&tm);
return (double)tm.time + ... |
GB_add_phase0.c | //------------------------------------------------------------------------------
// GB_add_phase0: find vectors of C to compute for C=A+B or C<M>=A+B
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-... | //------------------------------------------------------------------------------
// GB_add_phase0: find vectors of C to compute for C=A+B or C<M>=A+B
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-... | //------------------------------------------------------------------------------
// GB_add_phase0: find vectors of C to compute for C=A+B or C<M>=A+B
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-... |
QLA_D3_r1_veq_norm2_V.c | /**************** QLA_D3_r_veq_norm2_V.c ********************/
#include <stdio.h>
#include <qla_config.h>
#include <qla_types.h>
#include <qla_random.h>
#include <qla_cmath.h>
#include <qla_d3.h>
#include <math.h>
static void start_slice(){
__asm__ __volatile__ ("");
}
static void end_slice(){
__asm__ __volatile... | /**************** QLA_D3_r_veq_norm2_V.c ********************/
#include <stdio.h>
#include <qla_config.h>
#include <qla_types.h>
#include <qla_random.h>
#include <qla_cmath.h>
#include <qla_d3.h>
#include <math.h>
static void
start_slice()
{
__asm__ __volatile__("");
}
static void
end_slice()
{
__asm__ __v... | /**************** QLA_D3_r_veq_norm2_V.c ********************/
#include <stdio.h>
#include <qla_config.h>
#include <qla_types.h>
#include <qla_random.h>
#include <qla_cmath.h>
#include <qla_d3.h>
#include <math.h>
static void
start_slice()
{
__asm__ __volatile__("");
}
static void
end_slice()
{
__asm__ __v... |
GB_unop__carg_fp64_fc64.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... | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-Li... | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-Li... |
grid.c | /* Copyright 2014-2015 The Regents of the University of California.
* Copyright 2015-2019 Martin Uecker.
* All rights reserved. Use of this source code is governed by
* a BSD-style license which can be found in the LICENSE file.
*
* 2011-2019 Martin Uecker <martin.uecker@med.uni-goettingen.de>
* 2014 Frank Ong <f... |
#include <math.h>
#include <complex.h>
#include <assert.h>
#include <string.h>
#include "num/multind.h"
#include "num/flpmath.h"
#include "num/specfun.h"
#include "misc/nested.h"
#include "misc/misc.h"
#include "grid.h"
static double
kb(double beta, double x)
{
if (fabs(x) >= 0.5)
return 0.;
... |
#include <math.h>
#include <complex.h>
#include <assert.h>
#include <string.h>
#include "num/multind.h"
#include "num/flpmath.h"
#include "num/specfun.h"
#include "misc/nested.h"
#include "misc/misc.h"
#include "grid.h"
static double
kb(double beta, double x)
{
if (fabs(x) >= 0.5)
return 0.;
... |
Cycle.c | /*
* The MIT License
*
* Copyright 2020 The OpenNARS authors.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use,... |
#include "Cycle.h"
//doing inference within the matched concept, returning whether decisionMaking should continue
static Decision Cycle_ActivateSensorimotorConcept(Concept *c, Event *e, long currentTime)
{
Decision decision = {0};
if(e->truth.confidence > MIN_CONFIDENCE)
{
c->usage = Usage_use(c-... |
#include "Cycle.h"
//doing inference within the matched concept, returning whether decisionMaking should continue
static Decision Cycle_ActivateSensorimotorConcept(Concept *c, Event *e, long currentTime)
{
Decision decision = {0};
if(e->truth.confidence > MIN_CONFIDENCE)
{
c->usage = Usage_use(c-... |
omp-par-scope.c | /* This testcase is part of GDB, the GNU debugger.
Copyright 2017-2020 Free Software Foundation, Inc.
This program 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 the License, or
... |
#include <stdio.h>
#include <omp.h>
omp_lock_t lock;
omp_lock_t lock2;
/* Enforce execution order between two threads using a lock. */
static void
omp_set_lock_in_order(int num, omp_lock_t * lock)
{
/* Ensure that thread num 0 first sets the lock. */
if (num == 0)
omp_set_lock(lock);
/* Bloc... |
#include <stdio.h>
#include <omp.h>
omp_lock_t lock;
omp_lock_t lock2;
/* Enforce execution order between two threads using a lock. */
static void
omp_set_lock_in_order(int num, omp_lock_t * lock)
{
/* Ensure that thread num 0 first sets the lock. */
if (num == 0)
omp_set_lock(lock);
#pragma omp ... |
sgemv.c | /*********************************************************************/
/* Copyright 2009, 2010 The University of Texas at Austin. */
/* All rights reserved. */
/* */
/* Redistribution and use in sou... |
/* All rights reserved. */
/* */
/* Redistribution and use in source and binary forms, with or */
/* without modification, are permitted provided that the following */
/* conditions are met: */
/* */
/* 1. Redistributio... |
/* All rights reserved. */
/* */
/* Redistribution and use in source and binary forms, with or */
/* without modification, are permitted provided that the following */
/* conditions are met: */
/* */
/* 1. Redistributio... |
mtlinpack.c | /*
Translated to C by Bonnie Toy 5/88
- modified on 2/25/94 to fix a problem with daxpy for
unequal increments or equal increments not equal to 1.
Jack Dongarra
- modified on 08/27/09 fix typo line 270, plus set 'ix' to 0
in the case incx is not 1
Julie Langou
To compile single precision version fo... | /*
* Translated to C by Bonnie Toy 5/88 - modified on 2/25/94 to fix a problem
* with daxpy for unequal increments or equal increments not equal to 1.
* Jack Dongarra - modified on 08/27/09 fix typo line 270, plus set 'ix' to 0
* in the case incx is not 1 Julie Langou
*
* To compile single precision version fo... | /*
* Translated to C by Bonnie Toy 5/88 - modified on 2/25/94 to fix a problem
* with daxpy for unequal increments or equal increments not equal to 1.
* Jack Dongarra - modified on 08/27/09 fix typo line 270, plus set 'ix' to 0
* in the case incx is not 1 Julie Langou
*
* To compile single precision version fo... |
cloudsc_driver.c | /*
* (C) Copyright 1988- ECMWF.
*
* This software is licensed under the terms of the Apache Licence Version 2.0
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
* In applying this licence, ECMWF does not waive the privileges and immunities
* granted to it by virtue of its status as an interg... |
#include "cloudsc_driver.h"
#include <omp.h>
#include "mycpu.h"
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define max(a, b) (((a) > (b)) ? (a) : (b))
void
cloudsc_driver(int numthreads, int numcols, int nproma)
{
double *tend_tmp_u;
double *tend_tmp_v;
double *tend_tmp_t;
double *tend_tmp_q;
... |
#include "cloudsc_driver.h"
#include <omp.h>
#include "mycpu.h"
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define max(a, b) (((a) > (b)) ? (a) : (b))
void
cloudsc_driver(int numthreads, int numcols, int nproma)
{
double *tend_tmp_u;
double *tend_tmp_v;
double *tend_tmp_t;
double *tend_tmp_q;
... |
rt.c | /*******************************************************************************
* RT-Flux-PIHM is a finite volume based, reactive transport module that operates
* on top of the hydrological land surface processes described by Flux-PIHM.
* RT-Flux-PIHM tracks the transportation and reaction in a given watershed. It
* u... | /*******************************************************************************
* RT-Flux-PIHM is a finite volume based, reactive transport module that operates
* on top of the hydrological land surface processes described by Flux-PIHM.
* RT-Flux-PIHM tracks the transportation and reaction in a given watershed. It
* u... | /*******************************************************************************
* RT-Flux-PIHM is a finite volume based, reactive transport module that operates
* on top of the hydrological land surface processes described by Flux-PIHM.
* RT-Flux-PIHM tracks the transportation and reaction in a given watershed. It
* u... |
time_dpotrf.c | /**
*
* @generated d Tue Jan 7 11:45:24 2014
*
**/
#define _TYPE double
#define _PREC double
#define _LAMCH LAPACKE_dlamch_work
#define _NAME "PLASMA_dpotrf"
/* See Lawn 41 page 120 */
#define _FMULS FMULS_POTRF( N )
#define _FADDS FADDS_POTRF( N )
#include "./timing.c"
static int
RunTest(int *iparam, double... | /**
*
* @generated d Tue Jan 7 11:45:24 2014
*
**/
#define _TYPE double
#define _PREC double
#define _LAMCH LAPACKE_dlamch_work
#define _NAME "PLASMA_dpotrf"
/* See Lawn 41 page 120 */
#define _FMULS FMULS_POTRF( N )
#define _FADDS FADDS_POTRF( N )
#include "./timing.c"
static int
RunTest(int *iparam, double... | /**
*
* @generated d Tue Jan 7 11:45:24 2014
*
**/
#define _TYPE double
#define _PREC double
#define _LAMCH LAPACKE_dlamch_work
#define _NAME "PLASMA_dpotrf"
/* See Lawn 41 page 120 */
#define _FMULS FMULS_POTRF( N )
#define _FADDS FADDS_POTRF( N )
#include "./timing.c"
static int
RunTest(int *iparam, double... |
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)
#... | /*
* 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)
... | /*
* 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)
... |
forces.c | #include <stdint.h>
#include <omp.h>
#include "geometry.h"
#include "core_kernel.h"
#include "bench.h"
#include "phy.h"
static void
_KRN_ComputeForces(
const size_t snfc,
const uint32_t bsz,
const uint32_t *snfic,
const uint32_t *fptrn0,
const uint32_t *fptrn1,
const uint32_t *fptrn2,
const double* xyzx0... | #include <stdint.h>
#include <omp.h>
#include "geometry.h"
#include "core_kernel.h"
#include "bench.h"
#include "phy.h"
static void
_KRN_ComputeForces(
const size_t snfc,
const uint32_t bsz,
const uint32_t *snfic,
const uint32_t *fptrn0,
const uint32_t *fptrn1,
const uint32_t *fptrn2,
const double* xyzx0... | #include <stdint.h>
#include <omp.h>
#include "geometry.h"
#include "core_kernel.h"
#include "bench.h"
#include "phy.h"
static void
_KRN_ComputeForces(
const size_t snfc,
const uint32_t bsz,
const uint32_t *snfic,
const uint32_t *fptrn0,
const uint32_t *fptrn1,
const uint32_t *fptrn2,
const double* xyzx0... |
parallel-simple.c | /*
* parallel-simple.c -- Archer testcase
*/
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
//
// See tools/archer/LICENSE.txt for details.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
/... | /*
* parallel-simple.c -- Archer testcase
*/
//=== ----------------------------------------------------------------------== = //
//
//Part of the LLVM Project, under the Apache License v2 .0 with LLVM Exceptions.
//
//See tools / archer / LICENSE.txt for details
.
// SPDX - License - Identifier:Apache - 2.0 WITH ... | /*
* parallel-simple.c -- Archer testcase
*/
//=== ----------------------------------------------------------------------== = //
//
//Part of the LLVM Project, under the Apache License v2 .0 with LLVM Exceptions.
//
//See tools / archer / LICENSE.txt for details
.
// SPDX - License - Identifier:Apache - 2.0 WITH ... |
ft_ao.c | /* Copyright 2014-2018 The PySCF Developers. 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 ... |
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <assert.h>
#include <complex.h>
#include "config.h"
#include "cint.h"
#include "gto/ft_ao.h"
#define SQRTPI 1.7724538509055160272981674833411451
#define EXPCUTOFF 100
#define NCTRMAX 72
double CINTsquare_dist(const double *r1... |
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <assert.h>
#include <complex.h>
#include "config.h"
#include "cint.h"
#include "gto/ft_ao.h"
#define SQRTPI 1.7724538509055160272981674833411451
#define EXPCUTOFF 100
#define NCTRMAX 72
double CINTsquare_dist(const double *r1... |
GB_binop__max_int32.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_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX... |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX... |
linked_omp3_tasks.c | #include <omp.h>
#include <stdlib.h>
#include <stdio.h>
#ifndef N
#define N 5
#endif
#ifndef FS
#define FS 38
#endif
struct node {
int data;
int fibdata;
struct node* next;
};
struct node* init_list(struct node* p);
void processwork(struct node* p);
int fib(int n);
int fib(int n)
... | #include <omp.h>
#include <stdlib.h>
#include <stdio.h>
#ifndef N
#define N 5
#endif /*
*/
#ifndef FS
#define FS 38
#endif /*
*/
struct node
{
int data;
int fibdata;
struct node *next;
};
struct node *init_list(struct node *p);
void processwork(struct node *p);
int f... | #include <omp.h>
#include <stdlib.h>
#include <stdio.h>
#ifndef N
#define N 5
#endif /*
*/
#ifndef FS
#define FS 38
#endif /*
*/
struct node
{
int data;
int fibdata;
struct node *next;
};
struct node *init_list(struct node *p);
void processwork(struct node *p);
int f... |
GB_binop__lor_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_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... |
libperf.c | /**
* Copyright (C) Mellanox Technologies Ltd. 2001-2014. ALL RIGHTS RESERVED.
* Copyright (C) UT-Battelle, LLC. 2015. ALL RIGHTS RESERVED.
* Copyright (C) The University of Tennessee and The University
* of Tennessee Research Foundation. 2015-2016. ALL RIGHTS RESERVED.
* Copyright (C) ARM Ltd. 2017. AL... |
#include "libperf_int.h"
#include <ucs/debug/log.h>
#include <string.h>
#include <malloc.h>
#include <unistd.h>
typedef struct
{
union
{
struct
{
size_t dev_addr_len;
size_t iface_addr_len;
size_t ep_addr_len;
} uct;
struct
{
... |
#include "libperf_int.h"
#include <ucs/debug/log.h>
#include <string.h>
#include <malloc.h>
#include <unistd.h>
typedef struct
{
union
{
struct
{
size_t dev_addr_len;
size_t iface_addr_len;
size_t ep_addr_len;
} uct;
struct
{
... |
CALPHADFreeEnergyFunctionsBinary3Ph2Sl.h | #ifndef included_CALPHADFreeEnergyFunctionsBinary3Ph2Sl
#define included_CALPHADFreeEnergyFunctionsBinary3Ph2Sl
#include "CALPHADSpeciesPhaseGibbsEnergy.h"
#include "InterpolationType.h"
#include "Phases.h"
#include "datatypes.h"
#include "functions.h"
#include <boost/property_tree/ptree.hpp>
#include <cassert>
#inc... | #ifndef included_CALPHADFreeEnergyFunctionsBinary3Ph2Sl
#define included_CALPHADFreeEnergyFunctionsBinary3Ph2Sl
#include "CALPHADSpeciesPhaseGibbsEnergy.h"
#include "InterpolationType.h"
#include "Phases.h"
#include "datatypes.h"
#include "functions.h"
#include <boost/property_tree/ptree.hpp>
#include <cassert>
#inc... | #ifndef included_CALPHADFreeEnergyFunctionsBinary3Ph2Sl
#define included_CALPHADFreeEnergyFunctionsBinary3Ph2Sl
#include "CALPHADSpeciesPhaseGibbsEnergy.h"
#include "InterpolationType.h"
#include "Phases.h"
#include "datatypes.h"
#include "functions.h"
#include <boost/property_tree/ptree.hpp>
#include <cassert>
#inc... |
rose_v1_matrixmultiply2.c | /*
Naive matrix-matrix multiplication(mmm)
By C. Liao
*/
#define N 1000
#define M 1000
#define K 1000
#include <omp.h>
int i;
int j;
int k;
double a[1000][1000];
double b[1000][1000];
double c[1000][1000];
int mmm()
{
//#pragma omp parallel for private(i,j,k) shared(a,b,c)
#pragma omp parallel for private (i,j,k)
... | /*
* Naive matrix-matrix multiplication(mmm) By C. Liao
*/
#define N 1000
#define M 1000
#define K 1000
#include <omp.h>
int i;
int j;
int k;
double a[1000][1000];
double b[1000][1000];
double c[1000][1000];
int
mmm()
{
//
for (i = 0; i <= 999; i += 1)
{
for (k = 0; k <= 999; k += 1)
{... | /*
* Naive matrix-matrix multiplication(mmm) By C. Liao
*/
#define N 1000
#define M 1000
#define K 1000
#include <omp.h>
int i;
int j;
int k;
double a[1000][1000];
double b[1000][1000];
double c[1000][1000];
int
mmm()
{
//
#pragma omp parallel for private(i,j,k) shared(a,b,c)
#pragma omp parallel for private (... |
conv_dw_hcl_x86.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... |
/*
* Copyright (c) 2021, OPEN AI LAB Author: qtang@openailab.com
*/
#include "convolution_param.h"
#include "conv_dw_kernel_x86.h"
#include "graph/tensor.h"
#include "graph/node.h"
#include "graph/graph.h"
#include "utility/sys_port.h"
#include "utility/float.h"
#include "utility/log.h"
#include "device/cpu/cpu_... |
/*
* Copyright (c) 2021, OPEN AI LAB Author: qtang@openailab.com
*/
#include "convolution_param.h"
#include "conv_dw_kernel_x86.h"
#include "graph/tensor.h"
#include "graph/node.h"
#include "graph/graph.h"
#include "utility/sys_port.h"
#include "utility/float.h"
#include "utility/log.h"
#include "device/cpu/cpu_... |
lis_matrix_ops.c | /* Copyright (C) 2002-2012 The SSI Project. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright
notice, this list of condition... |
#ifdef HAVE_CONFIG_H
#include "lis_config.h"
#else
#ifdef HAVE_CONFIG_WIN32_H
#include "lis_config_win32.h"
#endif
#endif
#include <stdio.h>
#include <stdlib.h>
#ifdef HAVE_MALLOC_H
#include <malloc.h>
#endif
#include <string.h>
#include <math.h>
#ifdef USE_MPI
#include <mpi.h>
#endif
#include "lislib.h"
#undef __F... |
#ifdef HAVE_CONFIG_H
#include "lis_config.h"
#else
#ifdef HAVE_CONFIG_WIN32_H
#include "lis_config_win32.h"
#endif
#endif
#include <stdio.h>
#include <stdlib.h>
#ifdef HAVE_MALLOC_H
#include <malloc.h>
#endif
#include <string.h>
#include <math.h>
#ifdef _OPENMP
#include <omp.h>
#endif
#ifdef USE_MPI
#include <mpi.h>... |
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... | /*
* 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... | /*
* 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... |
Sema.h | //===--- Sema.h - Semantic Analysis & AST Building --------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | //===--- Sema.h - Semantic Analysis & AST Building --------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | //===--- Sema.h - Semantic Analysis & AST Building --------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
quad.h | #ifndef _QUAD_H_
#define _QUAD_H_
#include "projection.h"
#include <unordered_set>
// Quad3D : an oriented quad in 3D space.
// The class receives the 4 coordinates in CCW order and
// arranges the vertices such that the first coordinate is upper left.
// ulrich.krispel@fraunhofer.at
namespace OrthoGen {
// V[... | #ifndef _QUAD_H_
#define _QUAD_H_
#include "projection.h"
#include <unordered_set>
// Quad3D:an oriented quad in 3 D space.
// The class receives the 4 coordinates in CCW order and
// arranges the vertices such that the first coordinate is upper left.
// ulrich.krispel @ fraunhofer.at
namespace OrthoGen
{
//V[0]... | #ifndef _QUAD_H_
#define _QUAD_H_
#include "projection.h"
#include <unordered_set>
// Quad3D:an oriented quad in 3 D space.
// The class receives the 4 coordinates in CCW order and
// arranges the vertices such that the first coordinate is upper left.
// ulrich.krispel @ fraunhofer.at
namespace OrthoGen
{
//V[0]... |
mypaint-tiled-surface.c | /* brushlib - The MyPaint Brush Library
* Copyright (C) 2007-2014 Martin Renold <martinxyz@gmx.ch> et. al.
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in al... |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "mypaint-tiled-surface.h"
#include "tiled-surface-private.h"
#include "helpers.h"
#include "brushmodes.h"
#include "operationqueue.h"
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
void process_tile(MyPaintTiledSurface *... |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#ifdef _OPENMP
#include <omp.h>
#endif
#include "mypaint-tiled-surface.h"
#include "tiled-surface-private.h"
#include "helpers.h"
#include "brushmodes.h"
#include "operationqueue.h"
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
... |
core_math.h | // == mojo ====================================================================
//
// Copyright (c) gnawice@gnawice.com. All rights reserved.
// See LICENSE in root folder
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentatio... | // == mojo ====================================================================
//
// Copyright (c) gnawice@gnawice.com. All rights reserved.
// See LICENSE in root folder
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentatio... | // == mojo ====================================================================
//
// Copyright (c) gnawice@gnawice.com. All rights reserved.
// See LICENSE in root folder
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentatio... |
GB_unop__identity_fp64_uint8.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... | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-Li... | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-Li... |
mm_funcs.c | /*
* Rectangular matrix multiplication, started from MIT Cilk matmul.cilk example
*
*/
#include "benchmark.h"
//#include "mkl.h"
#include "mkl_types.h"
#include "mkl_cblas.h"
void zero(REAL *A, int n)
{
int i, j;
//#pragma omp for private (i, j)
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
... | /*
* Rectangular matrix multiplication, started from MIT Cilk matmul.cilk
* example
*
*/
#include "benchmark.h"
//
#include "mkl.h"
#include "mkl_types.h"
#include "mkl_cblas.h"
void
zero(REAL * A, int n)
{
int i, j;
//
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
... | /*
* Rectangular matrix multiplication, started from MIT Cilk matmul.cilk
* example
*
*/
#include "benchmark.h"
//
#include "mkl.h"
#include "mkl_types.h"
#include "mkl_cblas.h"
void
zero(REAL * A, int n)
{
int i, j;
//
#pragma omp for private (i, j)
for (i = 0; i < n; i++)
{
for (j... |
enhance.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/accelerate-private.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-private.h"
#include "MagickCore/cache-view.h"
#include "MagickCore/channel.h"
#include ... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/accelerate-private.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-private.h"
#include "MagickCore/cache-view.h"
#include "MagickCore/channel.h"
#include ... |
psd.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/blob-private.h"
#include "MagickCore/cache.h"
#include "MagickCore/channel.h"
#include "MagickCore/colormap.h"
#include "MagickCore/color... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/blob-private.h"
#include "MagickCore/cache.h"
#include "MagickCore/channel.h"
#include "MagickCore/colormap.h"
#include "MagickCore/color... |
PeptideIndexing.h | // --------------------------------------------------------------------------
// OpenMS -- Open-Source Mass Spectrometry
// --------------------------------------------------------------------------
// Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,
// ETH Zurich, and Freie Universit... | // --------------------------------------------------------------------------
// OpenMS -- Open-Source Mass Spectrometry
// --------------------------------------------------------------------------
// Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,
// ETH Zurich, and Freie Universit... | // --------------------------------------------------------------------------
// OpenMS -- Open-Source Mass Spectrometry
// --------------------------------------------------------------------------
// Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,
// ETH Zurich, and Freie Universit... |
ScatterHelper.h | /*******************************************************************************
* Copyright (c) 2015-2018 Skymind, Inc.
*
* This program and the accompanying materials are made available under the
* terms of the Apache License, Version 2.0 which is available at
* https://www.apache.org/licenses/LICENSE-2.0.
*
*... |
//
// @author raver119@gmail.com
// @author Yurii Shyrma (iuriish@yahoo.com)
//
#include <pointercast.h>
#include <op_boilerplate.h>
#include <NDArray.h>
#include <numeric>
namespace nd4j {
namespace ops {
class ScatterHelper {
public:
// static FORCEINLINE Nd4jStatus scatterApply(pairwise::Ops... |
//
// @author raver119@gmail.com
// @author Yurii Shyrma (iuriish@yahoo.com)
//
#include <pointercast.h>
#include <op_boilerplate.h>
#include <NDArray.h>
#include <numeric>
namespace nd4j {
namespace ops {
class ScatterHelper {
public:
// static FORCEINLINE Nd4jStatus scatterApply(pairwise::Ops... |
convolution_pack8_int8.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 copy ... | // 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... | // 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... |
omp_parallel_sections_firstprivate.c | <ompts:test>
<ompts:testdescription>Test which checks the omp parallel sections firstprivate directive.</ompts:testdescription>
<ompts:ompversion>2.0</ompts:ompversion>
<ompts:directive>omp parallel sections firstprivate</ompts:directive>
<ompts:dependences>omp critical</ompts:dependences>
<ompts:testcode>
#include <st... | < ompts:test >
<ompts: testdescription > Test which checks the omp parallel sections firstprivate directive.< /ompts:testdescription >
<ompts: ompversion > 2.0 < /ompts:ompversion >
<ompts: directive > omp parallel sections firstprivate < /ompts:directive >
<ompts: dependences > omp critical < /ompts:dependences >
<omp... | < ompts:test >
<ompts: testdescription > Test which checks the omp parallel sections firstprivate directive.< /ompts:testdescription >
<ompts: ompversion > 2.0 < /ompts:ompversion >
<ompts: directive > omp parallel sections firstprivate < /ompts:directive >
<ompts: dependences > omp critical < /ompts:dependences >
<omp... |
wand-view.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% W W AAA N N DDDD ... |
/*
* Include declarations.
*/
#include "MagickWand/studio.h"
#include "MagickWand/MagickWand.h"
#include "MagickWand/magick-wand-private.h"
#include "MagickWand/wand.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/thread-private.h"
/*
* Define declarations.
*/
#define WandViewId "WandView"
/*
... |
/*
* Include declarations.
*/
#include "MagickWand/studio.h"
#include "MagickWand/MagickWand.h"
#include "MagickWand/magick-wand-private.h"
#include "MagickWand/wand.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/thread-private.h"
/*
* Define declarations.
*/
#define WandViewId "WandView"
/*
... |
test2.c | #include <stdio.h>
#include <omp.h>
#define N (10000000)
int A[N];
int B[N/2];
void g()
{
int i=0;
for (i = 0; i<N; i++) A[i] ++;
}
void h()
{
int i;
for (i = 0; i<N/2; i++) B[i]++;
}
void f()
{
g();
}
int main()
{
#pragma omp parallel num_threads(2)
{
#pragma omp sections
{
#pragma omp section
{
f();... | #include <stdio.h>
#include <omp.h>
#define N (10000000)
int A[N];
int B[N / 2];
void
g()
{
int i = 0;
for (i = 0; i < N; i++)
A[i]++;
}
void
h()
{
int i;
for (i = 0; i < N / 2; i++)
B[i]++;
}
void
f()
{
g();
}
int
main()
{
#pragma omp sections
{
#pragma omp section
... | #include <stdio.h>
#include <omp.h>
#define N (10000000)
int A[N];
int B[N / 2];
void
g()
{
int i = 0;
for (i = 0; i < N; i++)
A[i]++;
}
void
h()
{
int i;
for (i = 0; i < N / 2; i++)
B[i]++;
}
void
f()
{
g();
}
int
main()
{
#pragma omp parallel num_threads(2)
{
#pragma ... |
Parallelizer.h | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2010 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You... | // This file is part of Eigen, a lightweight C++ template library
//for linear
algebra.
//
//Copyright(C) 2010 Gael Guennebaud < gael.guennebaud @ inria.fr >
//
//This Source Code Form is subject to the terms of the Mozilla
//Public License v.2.0.If a copy of the MPL was not dis... | // This file is part of Eigen, a lightweight C++ template library
//for linear
algebra.
//
//Copyright(C) 2010 Gael Guennebaud < gael.guennebaud @ inria.fr >
//
//This Source Code Form is subject to the terms of the Mozilla
//Public License v.2.0.If a copy of the MPL was not dis... |
GB_binop__bor_uint64.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
rt_dplgsy.c | #include "runtime.h"
void RT_CORE_dplgsy( Quark *quark, Quark_Task_Flags *task_flags,
double bump, int m, int n, double *A, int lda,
int bigM, int m0, int n0, unsigned long long int seed )
{
plasma_context_t *plasma;
plasma = plasma_context_self();
if (plasma->runtime... | #include "runtime.h"
void
RT_CORE_dplgsy(Quark * quark, Quark_Task_Flags * task_flags,
double bump, int m, int n, double *A, int lda,
int bigM, int m0, int n0, unsigned long long int seed)
{
plasma_context_t *plasma;
plasma = plasma_context_self();
if (plasma->runtime == PLAS... | #include "runtime.h"
void
RT_CORE_dplgsy(Quark * quark, Quark_Task_Flags * task_flags,
double bump, int m, int n, double *A, int lda,
int bigM, int m0, int n0, unsigned long long int seed)
{
plasma_context_t *plasma;
plasma = plasma_context_self();
if (plasma->runtime == PLAS... |
utils.h | #include <filesystem>
#include <iostream>
#include <fstream>
#include <queue>
#include <chrono>
#include <unordered_set>
#include "hnswlib.h"
#include "stopwatch.h"
using namespace std;
using namespace hnswlib;
/*****************************************************
* I/O functions for fvecs and ivecs
* Reference... | #include <filesystem>
#include <iostream>
#include <fstream>
#include <queue>
#include <chrono>
#include <unordered_set>
#include "hnswlib.h"
#include "stopwatch.h"
using namespace std;
using namespace hnswlib;
/*****************************************************
* I/O functions for fvecs and ivecs
* Reference... | #include <filesystem>
#include <iostream>
#include <fstream>
#include <queue>
#include <chrono>
#include <unordered_set>
#include "hnswlib.h"
#include "stopwatch.h"
using namespace std;
using namespace hnswlib;
/*****************************************************
* I/O functions for fvecs and ivecs
* Reference... |
primo.c | #include <stdio.h>
#include <math.h>
int primo(long num)
{
long d;
if(num <= 1)
return 0;
if(num > 3) {
if(num % 2 == 0) return 0;
long max_divisor = sqrt(num);
for(d = 3; d <= max_divisor; d+=2) {
if(num % d == 0) return 0;
}
}
return 1;
}
int main()
{
long max_num = 5... | #include <stdio.h>
#include <math.h>
int
primo(long num)
{
long d;
if (num <= 1)
return 0;
if (num > 3)
{
if (num % 2 == 0)
return 0;
long max_divisor = sqrt(num);
for (d = 3; d <= max_divisor; d += 2)
{
if (num % d == 0)
... | #include <stdio.h>
#include <math.h>
int
primo(long num)
{
long d;
if (num <= 1)
return 0;
if (num > 3)
{
if (num % 2 == 0)
return 0;
long max_divisor = sqrt(num);
for (d = 3; d <= max_divisor; d += 2)
{
if (num % d == 0)
... |
GB_binop__eq_uint8.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
image.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/animate.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/blob-private.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-private.h"
#include "MagickCore/... |
/*
* Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/animate.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/blob-private.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-private.h"
#include "MagickCore/... |
mdp_vec.h | #pragma once
#include "mdp.h"
#include <omp.h>
#include <unistd.h>
/* Vectorized version of the MDPEnv_cpp env
which uses OpenMP to run on multiple CPUs */
template <typename E,
typename S = typename E::state_type,
typename A = typename E::action_type,
typename O = typename E::obs_type,
typename ... | #pragma once
#include "mdp.h"
#include <omp.h>
#include <unistd.h>
/* Vectorized version of the MDPEnv_cpp env
which uses OpenMP to run on multiple CPUs */
template <typename E,
typename S = typename E::state_type,
typename A = typename E::action_type,
typename O = typename E::obs_type,
typename ... | #pragma once
#include "mdp.h"
#include <omp.h>
#include <unistd.h>
/* Vectorized version of the MDPEnv_cpp env
which uses OpenMP to run on multiple CPUs */
template <typename E,
typename S = typename E::state_type,
typename A = typename E::action_type,
typename O = typename E::obs_type,
typename ... |
pmghosts.c | #include <string.h>
#include <math.h>
#include <mpi.h>
#include <fastpm/libfastpm.h>
#include <fastpm/logging.h>
#include "pmpfft.h"
#include "pmghosts.h"
#ifdef ENABLE_VALGRIND
#include </usr/include/valgrind/memcheck.h>
#endif
typedef void (*pm_iter_ghosts_func)(PM * pm, PMGhostData * ppd, void * userdata);
void ... | #include <string.h>
#include <math.h>
#include <mpi.h>
#include <fastpm/libfastpm.h>
#include <fastpm/logging.h>
#include "pmpfft.h"
#include "pmghosts.h"
#ifdef ENABLE_VALGRIND
#include </usr/include/valgrind/memcheck.h>
#endif
typedef void (*pm_iter_ghosts_func) (PM * pm, PMGhostData * ppd, void *userdata);
void ... | #include <string.h>
#include <math.h>
#include <mpi.h>
#include <fastpm/libfastpm.h>
#include <fastpm/logging.h>
#include "pmpfft.h"
#include "pmghosts.h"
#ifdef ENABLE_VALGRIND
#include </usr/include/valgrind/memcheck.h>
#endif
typedef void (*pm_iter_ghosts_func) (PM * pm, PMGhostData * ppd, void *userdata);
void ... |
pi-v2.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 <omp.h> /* OpenMP */
#if _DEBUG_
#define _DEBUG_ 1
#else
#define _DEBUG_ 0
#include "extrae_user_events.h"
#define PROG... | /*
* 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 <omp.h> /* OpenMP */
#if _DEBUG_
#define _DEBUG_ 1
#else
#define _DEBUG_ 0
#include "extrae_user_events.h"
#define ... | /*
* 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 <omp.h> /* OpenMP */
#if _DEBUG_
#define _DEBUG_ 1
#else
#define _DEBUG_ 0
#include "extrae_user_events.h"
#define ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.