source stringlengths 3 92 | c stringlengths 26 2.25M |
|---|---|
utility.h | /**@copyright 2016 Horizon-Robotics Inc. All Rights Reserved.
* @author Degang Yang (degang.yang@horizon-robotics.com)
*
* @file utility.h
* @brief utility.h
*/
#ifndef DEEPROB_CV_STEREO_UTILITY_H_
#define DEEPROB_CV_STEREO_UTILITY_H_
#include <ctime>
#include <stdlib.h>
#include <float.h>
#include ... |
Stmt.h | //===- Stmt.h - Classes for representing statements -------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
YAKL_parallel_for_c.h |
#pragma once
#ifdef YAKL_ARCH_CUDA
#include <nvtx3/nvToolsExt.h>
#endif
namespace c {
template <class T> constexpr T fastmod(T a , T b) {
return a < b ? a : a-b*(a/b);
}
class LBnd {
public:
int l, u, s;
LBnd(int u) {
this->l = 0;
this->u = u-1;
this->s = 1;
}
LBnd... |
GB_binop__pair_int64.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... |
2001.c | // this source is derived from CHILL AST originally from file '/uufs/chpc.utah.edu/common/home/u1142914/lib/ytopt_vinu/polybench/polybench-code/stencils/heat-3d/kernel.c' as parsed by frontend compiler rose
void kernel_heat_3d(int tsteps, int n, double A[120 + 0][120 + 0][120 + 0], double B[120 + 0][120 + 0][120 + 0])... |
3d7pt_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 7 point stencil with variable coefficients
* Adapted from PLUTO and Po... |
perturbation_theory.c | static inline void map_to_triangular_index(u32 k, u32 N, u32* m, u32* n) {
*m = k / N;
*n = k % N;
if (*m > *n) {
*m = N - *m - 0;
*n = N - *n - 1;
}
}
/*
* Holds all information needed to do the PT,
* easy to pass around. Basicly params to
* pt_rayleigh_schroedinger
*/
struct pt_settings {
struct nlse_res... |
displacement_lagrangemultiplier_residual_frictional_contact_criteria.h | // KRATOS ___| | | |
// \___ \ __| __| | | __| __| | | __| _` | |
// | | | | | ( | | | | ( | |
// _____/ \__|_| \__,_|\___|\__|\__,_|_| \__,_|_| MECHANICS
//
// License: BSD License
// ... |
colorspace.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... |
ROF_TV_core.c | /*
* This work is part of the Core Imaging Library developed by
* Visual Analytics and Imaging System Group of the Science Technology
* Facilities Council, STFC
*
* Copyright 2017 Daniil Kazantsev
* Copyright 2017 Srikanth Nagella, Edoardo Pasca
*
* Licensed under the Apache License, Version 2.0 (the "License")... |
opencl_geli_fmt_plug.c | /*
* This software is Copyright (c) 2017 Dhiru Kholia, Copyright (c) 2012-2013
* Lukas Odzioba, Copyright (c) 2014 JimF, Copyright (c) 2014 magnum, and it is
* hereby released to the general public under the following terms:
*
* Redistribution and use in source and binary forms, with or without
* modification, ar... |
c-tree.h | /*
* Copyright (C) 2007. QLogic Corporation. All Rights Reserved.
*/
/* Definitions for C parsing and type checking.
Copyright (C) 1987, 1993, 1994, 1995, 1997, 1998,
1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute i... |
GeometryFunctions.h | /*
* File: GeometryFunctions.h
* Author: msantasusana, Chun Feng
*
* Created on 21 de mayo de 2012, 19:40
*/
#ifndef _GEOMETRYFUNCTIONS_H
#define _GEOMETRYFUNCTIONS_H
#include <cmath>
#include "utilities/openmp_utils.h"
#include "utilities/quaternion.h"
#include "includes/model_part.h"
#include "DEM_applicatio... |
private-clauseModificado.c | #include <stdio.h>
#ifdef _OPENMP
#include <omp.h>
#endif
void main(){
int i, n=7;
int a[n], suma;
for(i=0;i<n;i++){
a[i]=i;
}
suma=1;
#pragma omp parallel private(suma)
{
suma=0;
#pragma omp for
for(i=0;i<n;i++){
suma = suma + a[i];
printf("\nthread %d suma a[%d] /\n ", omp_get_thread_num(), ... |
buckets.c | #include "buckets.h"
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <omp.h>
buckets buckets_new(const int n_buckets, const int size) {
buckets r;
r.buckets = malloc(sizeof(struct _dyn_arr) * n_buckets);
r.size = n_buckets;
for(size_t i = 0; i < n_buckets; i++)
dyn_arr_init(... |
cpu.c | /*
* Copyright 2012 INRIA Paris-Rocquencourt
* Copyright 2012 Ecole Normale Superieure
*
* Use of this software is governed by the MIT license
*
* Written by Tobias Grosser, INRIA Paris-Rocquencourt,
* Domaine de Voluceau, Rocquenqourt, B.P. 105,
* 78153 Le Chesnay Cedex France
* and Sven Verdoolaege,
* Ecole... |
scalability.c | /**
* \file
* \brief libbomp test.
*/
/*
* Copyright (c) 2007, 2008, 2009, ETH Zurich.
* All rights reserved.
*
* This file is distributed under the terms in the attached LICENSE file.
* If you do not find this file, copies can be found by writing to:
* ETH Zurich D-INFK, Universitaetstrasse 6, CH-8092 Zurich... |
blas.c | #include "blas.h"
#include "utils.h"
#include <math.h>
#include <assert.h>
#include <float.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void reorg_cpu(float *x, int out_w, int out_h, int out_c, int batch, int stride, int forward, float *out)
{
int b,i,j,k;
int in_c = out_c/(stride*stride);
... |
firstPrivateArray.c | /*
Array typed firstprivate variables:
element-by-element copy.
Contributed by Pranav Tendulkar
pranav@ics.forth.gr
4/12/2010
*/
int array[100];
int main()
{
array[10] = 10;
#pragma omp parallel firstprivate(array)
{
int i;
for(i=0;i<100;i++)
array[i] += i;
}
return 0;
}
|
j3d7pt.gold.h | #include <cstring>
using std::memcpy;
void jacobi_gold(double *fout, const double *fin, double h2inv, double a, double b, int L, int M, int N) {
double (*out)[M][N] = (double (*)[M][N]) fout;
double (*in)[M][N] = (double (*)[M][N]) fin;
auto ftemp1 = new double[L * M * N];
auto ftemp2 = new double[L * M * N];
mem... |
pattern_generator.impl.h | /**
* Copyright (c) 2018, Daniel Thuerck, TU Darmstadt - GCC. All rights reserved.
*
* This software may be modified and distributed under the terms
* of the BSD 3-clause license. See the LICENSE file for details.
*/
#include <libs/staging/pattern_generator.h>
#include <libs/staging/elimination_tree.h>
#include... |
merge.h | #pragma once
#include <cassert>
#include <string>
#include <set>
#include <limits>
#include <filesystem>
#include <vector>
#include <regex>
#include <fstream>
#include "flatten_index.h"
#include "xml_config.h"
#include "enums.h"
#include "polyhedron/glm_ext/glm_extensions.h"
#include "rle/rle.h"
#include "rle/rle_io.... |
par_ilu_solve.c | /******************************************************************************
* Copyright 1998-2019 Lawrence Livermore National Security, LLC and other
* HYPRE Project Developers. See the top-level COPYRIGHT file for details.
*
* SPDX-License-Identifier: (Apache-2.0 OR MIT)
**************************************... |
GB_binop__second_int8.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... |
kmp_taskwait_depend_in.c | // RUN: %libomp-compile-and-run
// test checks IN dep kind in depend clause on taskwait construct
// uses codegen emulation
#include <stdio.h>
#include <omp.h>
// ---------------------------------------------------------------------------
// internal data to emulate compiler codegen
typedef struct DEP {
size_t addr;... |
model.h | #pragma once
#include <util/common/geom/point.h>
#include <util/common/math/vec.h>
#include <util/common/plot/plot.h>
#include <util/common/math/fuzzy.h>
#include <vector>
#include <map>
#include <array>
#include <omp.h>
namespace model
{
/*****************************************************/
/* ... |
omp_for_lastprivate.c | <ompts:test>
<ompts:testdescription>Test which checks the omp for lastprivate clause by counting up a variable in a parallelized loop. Each thread saves the next summand in a lastprivate variable i0. At the end i0 is compared to the value of the expected last summand.</ompts:testdescription>
<ompts:ompversion>2.0</ompt... |
Searching.202007281234.only_gather_top_m.h | //
// Created by Zhen Peng on 7/28/2020.
//
#ifndef BATCH_SEARCHING_SEARCHING_H
#define BATCH_SEARCHING_SEARCHING_H
#include <vector>
#include <boost/dynamic_bitset.hpp>
//#include <boost/sort/sort.hpp>
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <immintrin.h>
#include <cstring>
#include ... |
local_operator.h | // Copyright (c) 2013-2017 Anton Kozhevnikov, Thomas Schulthess
// 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 notic... |
GB_unaryop__lnot_int8_bool.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http... |
partial.c | /******************************************************************************
* Copyright (c) 1998 Lawrence Livermore National Security, LLC and other
* HYPRE Project Developers. See the top-level COPYRIGHT file for details.
*
* SPDX-License-Identifier: (Apache-2.0 OR MIT)
***************************************... |
GB_binop__bxor_int32.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX... |
main.c | #include <stdio.h>
#include<omp.h>
#include<math.h>
#include <stdlib.h>
int main()
{
// Define the domain
double x_len = 2.0;
double y_len = 1.0;
int x_points = 251;
int y_points = 251;
double del_x = x_len/(x_points-1);
double del_y = y_len/(y_points-1);
double x[x_poin... |
GB_unaryop__minv_uint8_fp32.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http... |
GB_unop__identity_fp64_fp32.c | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http://... |
tensor_utils.h | // BEGINLICENSE
//
// This file is part of helPME, which is distributed under the BSD 3-clause license,
// as described in the LICENSE file in the top level directory of this project.
//
// Author: Andrew C. Simmonett
//
// ENDLICENSE
#ifndef _HELPME_TENSOR_UTILS_H_
#define _HELPME_TENSOR_UTILS_H_
#ifdef _MSC_VER
#def... |
a.35.6.c | /* { dg-do compile } */
void work (int, int);
void
wrong6 (int n)
{
#pragma omp parallel
{
#pragma omp single
{
work (n, 0);
/* incorrect nesting of barrier region in a single region */
#pragma omp barrier /* { dg-error "may not be closely nested" } */
work (n, 1);
}
}
}
|
GB_unaryop__lnot_int16_uint32.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http... |
SquareMatrixESBGK.h | // This file os part of FVM
// Copyright (c) 2012 FVM Authors
// See LICENSE file for terms.
#ifndef _SQUAREMATRIXESBGK_H_
#define _SQUAREMATRIXESBGK_H_
#include "Array.h"
#include "MatrixJML.h"
#include <math.h>
#include <omp.h>
template<class T>
class SquareMatrixESBGK : public MatrixJML<T>
{
public:
typedef Ar... |
md2_fmt_plug.c | /* MD2 cracker patch for JtR. Hacked together during May of 2013 by Dhiru
* Kholia <dhiru at openwall.com>.
*
* This software is Copyright (c) 2013 Dhiru Kholia <dhiru at openwall.com> and
* it is hereby released to the general public under the following terms:
*
* Redistribution and use in source and binary form... |
redundant_1.tfm.c | int bar() { return 10; };
void foo(int N, double *A) {
int X, Y;
#pragma omp parallel
{
#pragma omp for default(shared) private(X, Y)
for (int I = 0; I < N; ++I) {
X = I;
if (I > N) {
Y = bar();
X = X + Y + 1;
}
A[I] = X;
}
}
}
|
GB_unaryop__ainv_int64_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... |
convolution_pack1to4_fp16s.h | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2021 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy ... |
tree.h | #ifndef LIGHTGBM_TREE_H_
#define LIGHTGBM_TREE_H_
#include <LightGBM/meta.h>
#include <LightGBM/dataset.h>
#include <string>
#include <vector>
#include <memory>
#include <map>
namespace LightGBM {
#define kCategoricalMask (1)
#define kDefaultLeftMask (2)
/*!
* \brief Tree model
*/
class Tree {
public:
/*!
* \... |
CGOpenMPRuntime.h | //===----- CGOpenMPRuntime.h - Interface to OpenMP Runtimes -----*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
pi-monte.c | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
#include <time.h>
#include <math.h>
#define MOD 10000007
#define MULTIPLIER 1234
#define INCREMENT 12345
long long seed;
#pragma omp threadprivate(seed)
long long leap_multiplier = MULTIPLIER, leap_increment = INCREMENT;
long lcg()
{
seed = (leap_multiplier*seed ... |
c-omp.c | /* This file contains routines to construct OpenACC and OpenMP constructs,
called from parsing in the C and C++ front ends.
Copyright (C) 2005-2017 Free Software Foundation, Inc.
Contributed by Richard Henderson <rth@redhat.com>,
Diego Novillo <dnovillo@redhat.com>.
This file is part of GCC.
GCC is free... |
leet_cc_fmt_plug.c | /* Cracker for leet.cc hashes.
*
* hsh = bin2hex(hash("sha512", $password . $salt, true) ^ hash("whirlpool", $salt . $password, true))
* $salt == username
*
* Input hash format: username:hash
*
* This software is Copyright (c) 2016, Dhiru Kholia <dhiru.kholia at gmail.com>,
* and it is hereby released to the ge... |
oskar_cross_correlate_gaussian_time_smearing_scalar_omp.c | /*
* Copyright (c) 2014-2015, The University of Oxford
* 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 ... |
hello.c | #include<stdio.h>
#include<omp.h>
int main(){
#pragma omp parallel
{
printf("Hello, World from thread #%0X.\n", omp_get_thread_num());
}
return 0;
}
|
ops.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.
*
*... |
mandelbrot.c | /*
* mandelbrot.c: adaptive anti-aliasing [MPI+OpenMP+Vector Version]
* (c)2010-2018 Seiji Nishimura
* $Id: mandelbrot.c,v 1.1.1.8 2018/09/11 00:00:00 seiji Exp seiji $
*/
#ifdef USE_MPI
#include <mpi.h>
#endif
#ifdef BENCHMARK_TEST
#include <wtime.h>
#endif
#if defined(USE_HALTON) || defined(USE_HAMMERSLEY)
#... |
helloMP.c | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
int main (int argc, char **argv) {
//number of parallel threads that OpenMP should use
int NumThreads = 10;
//tell OpenMP to use NumThreads threads
omp_set_num_threads(NumThreads);
float *val = (float*) malloc(NumThreads*sizeof(float));
int winner = 0;
... |
GB_binop__le_int64.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http:... |
cq_fmt_plug.c | /*
* This software is Copyright (c) Peter Kasza <peter.kasza at itinsight.hu>,
* and it is hereby released to the general public under the following terms:
* Redistribution and use in source and binary forms, with or without
* modification, are permitted.
*/
#if FMT_EXTERNS_H
extern struct fmt_main fmt_cq;
#elif... |
nowait.c | #include<stdio.h>
#include<omp.h>
#define TAM 1000
int nthrds;
int work1(int id){
int i, ac=0;
for (i=0; i<TAM; i++)
ac += (i+id);
return ac;
}
int work2(int i,int A[]){
int cont, res=0;
for (cont=0; cont<nthrds; cont++){
res += (i+cont);
A[cont] = res;
}
return res;
}
int work3(int C[],int i){
int co... |
deconvolution_pack4to1.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 ... |
firFilter.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <ipps.h>
#ifndef MIN
#define MIN(x,y) (((x) < (y)) ? (x) : (y))
#endif
/*!
* @brief Computes the envelope of a set of signals. It is assumed that the
* Hilbert transformer is a Type III FIR filter.
* @param[in] lds ... |
sparselu.c | /**********************************************************************************************/
/* This program is part of the Barcelona OpenMP Tasks Suite */
/* Copyright (C) 2009 Barcelona Supercomputing Center - Centro Nacional de Supercomputacion */
/* Copyright (C) 2009 Univer... |
convolution_sgemm_bf16s.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 ... |
mkldnn_quantize_v2-inl.h | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you ... |
VolumetricAveragePooling.c | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/VolumetricAveragePooling.c"
#else
static inline void THNN_(VolumetricAveragePooling_shapeCheck)(
THNNState *state,
THTensor *input,
THTensor *gradOutput,
int kT,
... |
y_solve.c | //-------------------------------------------------------------------------//
// //
// This benchmark is an OpenMP C version of the NPB SP code. This OpenMP //
// C version is developed by the Center for Manycore Programming at Seoul //
// Nati... |
reports.h | /*
* Copyright 2013-2020, Derrick Wood <dwood@cs.jhu.edu>
*
* This file is part of the Kraken 2 taxonomic sequence classification system.
*/
#ifndef KRAKEN2_REPORTS_H_
#define KRAKEN2_REPORTS_H_
#include <unordered_map>
#include <iomanip>
#include "kraken2_headers.h"
#include "taxonomy.h"
#include "kraken2_data.h... |
fast_sum.c | #include "fast_sum.h"
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
static const double dunavant_x[4][6] = {
{0.333333333333333, 0, 0, 0, 0, 0},
{0.666666666666667, 0.166666666666667, 0.166666666666667, 0, 0, 0},
{0.333333333333333, 0.600000000000000, 0.200000000000000, 0.20... |
omp_parallel_copyin.c | <ompts:test>
<ompts:testdescription>Test which checks the omp parallel copyin directive.</ompts:testdescription>
<ompts:ompversion>2.0</ompts:ompversion>
<ompts:directive>omp parallel copyin</ompts:directive>
<ompts:dependences>omp critical,omp threadprivate</ompts:dependences>
<ompts:testcode>
#include <stdio.h>
#incl... |
pt_to_pt_pingpong.c | /*****************************************************************************
* *
* Mixed-mode OpenMP/MPI MicroBenchmark Suite - Version 1.0 *
* *
* ... |
mysql_netauth_fmt_plug.c | /* Cracker for MySQL network authentication hashes. Hacked together
* during May of 2012 by Dhiru Kholia <dhiru.kholia at gmail.com>.
*
* This software is Copyright (c) 2012, Dhiru Kholia <dhiru.kholia at gmail.com>,
* and it is hereby released to the general public under the following terms:
* Redistribution and ... |
hybrid_whereami.c | /* hybrid_whereami.c is a driver
1.) Get line arguments (optional): help or number o seconds for load
2.) Start MPI
Option to EASILY set affinity here.
3.) Store map for each rank
4.) Start OpenMP parallel region
5.) Store map for each thread
) MPI call to report
6.) ... |
fw_sr.c | /*
Recursive implementation of the Floyd-Warshall algorithm.
command line arguments: N, B
N = size of graph
B = size of submatrix when recursion stops
works only for N, B = 2^k
*/
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include "util.h"
inline int min(int a, int b);
voi... |
MergeSort.c | /*
Algorithm 2 - Merge Sort
Using OpenMP, implement a parallelized Merge Sort algorithm to sort a given set of elements and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. The... |
3d7pt.lbpar.c | #include <omp.h>
#include <math.h>
#define ceild(n,d) ceil(((double)(n))/((double)(d)))
#define floord(n,d) floor(((double)(n))/((double)(d)))
#define max(x,y) ((x) > (y)? (x) : (y))
#define min(x,y) ((x) < (y)? (x) : (y))
/*
* Order-1, 3D 7 point stencil
* Adapted from PLUTO and Pochoir test bench
*
* Tare... |
parallel_master_taskloop_simd_misc_messages.c | // RUN: %clang_cc1 -fsyntax-only -fopenmp -triple x86_64-unknown-unknown -verify %s -Wuninitialized
// RUN: %clang_cc1 -fsyntax-only -fopenmp-simd -triple x86_64-unknown-unknown -verify %s -Wuninitialized
void xxx(int argc) {
int x; // expected-note {{initialize the variable 'x' to silence this warning}}
#pragma om... |
ast-dump-openmp-for-simd.c | // RUN: %clang_cc1 -triple x86_64-unknown-unknown -fopenmp -ast-dump %s | FileCheck --match-full-lines -implicit-check-not=openmp_structured_block %s
void test_one(int x) {
#pragma omp for simd
for (int i = 0; i < x; i++)
;
}
void test_two(int x, int y) {
#pragma omp for simd
for (int i = 0; i < x; i++)
f... |
GB_unaryop__lnot_int16_fp64.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_unop__isnan_bool_fc32.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... |
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.
//
//===-------------------------------------------------------... |
iterative.c | /*******************************************************************
*** poisson2D: Numerical solution of the Poisson PDE in 2D.
*** Iterative method functions, called by solvePoisson2D function
*** in poisson2D.c
***
*** Author: Nikos Tryfonidis, December 2015
*** The MIT License (MIT)
*** Copyright (c... |
GB_unaryop__abs_fp64_uint8.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http... |
pr60534.c | /* PR middle-end/60534 */
/* { dg-do compile } */
/* { dg-options "-fopenmp -O -fno-tree-loop-optimize" } */
extern int d[];
int
foo (int a)
{
int c = 0;
int l;
#pragma omp simd reduction(+: c)
for (l = 0; l < a; ++l)
c += d[l];
return c;
}
|
rose_test2.c | #pragma wave trace ( enable )
int a[100UL][100UL];
void foo()
{
int i;
int j;
int hypre__nx;
int hypre__ny;
#define HYPRE_BOX_SMP_PRIVATE i,j
#define HYPRE_SMP_PRIVATE HYPRE_BOX_SMP_PRIVATE,hypre__nx,hypre__ny
#pragma omp parallel for private ( HYPRE_SMP_PRIVATE )
for (i = 0; i < 100; i++)
for (j = 0... |
GB_unop__tanh_fp64_fp64.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_unaryop__abs_uint8_int32.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http... |
GxB_BinaryOp_ytype_name.c | //------------------------------------------------------------------------------
// GxB_BinaryOp_ytype_name: return the type_name of y for z=f(x,y)
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-Li... |
GB_unaryop__minv_fp32_uint32.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http... |
Example_declare_variant.2.c | /*
* @@name: declare_variant.2c
* @@type: C
* @@compilable: yes
* @@linkable: no
* @@expect: success
* @@version: omp_5.0
*/
#include <omp.h>
void base_saxpy(int, float, float *, float *);
void avx512_saxpy(int, float, float *, float *);
#pragma omp declare variant( avx512_saxpy ) \
match( dev... |
GB_unop__sqrt_fc64_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... |
nn_index.h | /***********************************************************************
* Software License Agreement (BSD License)
*
* Copyright 2008-2009 Marius Muja (mariusm@cs.ubc.ca). All rights reserved.
* Copyright 2008-2009 David G. Lowe (lowe@cs.ubc.ca). All rights reserved.
*
* THE BSD LICENSE
*
* Redistribution an... |
transformfxd-impl.h | //==================================================================================
// BSD 2-Clause License
//
// Copyright (c) 2014-2022, NJIT, Duality Technologies Inc. and other contributors
//
// All rights reserved.
//
// Author TPOC: contact@openfhe.org
//
// Redistribution and use in source and binary forms, wi... |
GB_unaryop__ainv_uint8_uint64.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http... |
threading_utils.h | /*!
* Copyright 2015-2019 by Contributors
* \file common.h
* \brief Threading utilities
*/
#ifndef XGBOOST_COMMON_THREADING_UTILS_H_
#define XGBOOST_COMMON_THREADING_UTILS_H_
#include <dmlc/common.h>
#include <vector>
#include <algorithm>
#include "xgboost/logging.h"
namespace xgboost {
namespace common {
// Rep... |
omploopstatic.h | // -*- C++ -*-
// Copyright (C) 2007-2016 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library 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... |
deconvolution_pack4to1.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 ... |
bt_single.c | /*--------------------------------------------------------------------
NAS Parallel Benchmarks 2.3 OpenMP C versions - BT
This benchmark is an OpenMP C version of the NPB BT code.
The OpenMP C versions are developed by RWCP and derived from the serial
Fortran versions in "NPB 2.3-serial" developed by NAS... |
ClassNLLCriterion.c | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/ClassNLLCriterion.c"
#else
void THNN_(ClassNLLCriterion_updateOutput)(
THNNState *state,
THTensor *input,
THIndexTensor *target,
THTensor *output,
bool sizeAverage,
THTensor *weights,
THTensor... |
mapped_avg_pool.h | #ifndef MAPPED_AVG_POOL_H_
#define MAPPED_AVG_POOL_H_
#include <math.h>
#include <omp.h>
#include <torch/extension.h>
#include <limits>
#include "common/mapped_avg_pool.h"
#include "core/resample.h"
namespace spherical {
namespace cpu {
template <typename T>
void MappedAvgPool2D(const int num_kernels, torch::Tensor... |
softmax-inl.h | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you ... |
gamma2v.c | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "compearth.h"
/*!
* @brief Computes v from lune longitude \f$ \gamma \f$ as in
* Equation 24b of Tape and Tape 2015.
*
* @param[in] n Number of points in arrays.
* @param[in] gamma Lune longitudes (radians) such that
* ... |
helloworld.c | #include <stdio.h>
#include <omp.h>
int main(){
int numthreads = omp_get_num_threads();
int id = omp_get_thread_num();
int count = 0;
printf("Hilos en ejecucion: %i, su ID es: %i\n", numthreads, id); //Numero de hilos en ejecucion en esta funcion y el ID de dicho hilo
printf("-------------------------------------... |
task_early_fulfill.c | // RUN: %libarcher-compile -fopenmp-version=50 && env OMP_NUM_THREADS='3' \
// RUN: %libarcher-run
//| FileCheck %s
// Checked gcc 9.2 still does not support detach clause on task construct.
// UNSUPPORTED: gcc-4, gcc-5, gcc-6, gcc-7, gcc-8, gcc-9
// clang supports detach clause since version 11.
// UNSUPPORTED: cl... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.