source stringlengths 3 92 | original_c stringlengths 26 2.25M | no_omp_formatted stringlengths 0 2.25M | omp_formatted stringlengths 0 2.25M |
|---|---|---|---|
GB_unaryop__identity_bool_int32.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http... | //------------------------------------------------------------------------------
// GB_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... |
progressbar.h | // The MIT License (MIT)
//
// Copyright (c) 2019 Luigi Pertoldi
//
// 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, ... | // The MIT License (MIT)
//
// Copyright (c) 2019 Luigi Pertoldi
//
// 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, ... | // The MIT License (MIT)
//
// Copyright (c) 2019 Luigi Pertoldi
//
// 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, ... |
project2_Delaunoy_Crasset_EXPLICIT.c | #include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <mpi.h>
#include <omp.h>
#include "project2_Delaunoy_Crasset_EXPLICIT.h"
#include "project2_Delaunoy_Crasset_IO.h"
#define M_PI 3.14159265358979323... | #include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <mpi.h>
#include <omp.h>
#include "project2_Delaunoy_Crasset_EXPLICIT.h"
#include "project2_Delaunoy_Crasset_IO.h"
#define M_PI 3.14159265358979323... | #include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <mpi.h>
#include <omp.h>
#include "project2_Delaunoy_Crasset_EXPLICIT.h"
#include "project2_Delaunoy_Crasset_IO.h"
#define M_PI 3.14159265358979323... |
conv_kernel_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) 2020, OPEN AI LAB Author: quanwang@openailab.com
*/
#include <stdint.h>
#include <stdlib.h>
#include <math.h>
#include "conv_kernel_x86.h"
#include "wino_conv_kernel_x86.h"
#if __AVX__
#include <immintrin.h>
#endif
#ifndef _MSC_VER
#include <sys/time.h>
#define max(a, b) ((a) > (b) ? (a) : (b))... |
/*
* Copyright (c) 2020, OPEN AI LAB Author: quanwang@openailab.com
*/
#include <stdint.h>
#include <stdlib.h>
#include <math.h>
#include "conv_kernel_x86.h"
#include "wino_conv_kernel_x86.h"
#if __AVX__
#include <immintrin.h>
#endif
#ifndef _MSC_VER
#include <sys/time.h>
#define max(a, b) ((a) > (b) ? (a) : (b))... |
lu.c |
/*[]*/
typedef long long __int64_t;
/*[]*/
typedef __int64_t __darwin_off_t;
/*[]*/
typedef __darwin_off_t fpos_t;
/*[]*/
struct __sbuf {
unsigned char *_base;
int _size;
} ;
/*[]*/
struct __sFILEX ;
/*[]*/
struct __sFILE {
unsigned char *_p;
int _r;
int _w;
short _flags;
short _file;
s... |
/* [] */
typedef long long __int64_t;
/* [] */
typedef __int64_t __darwin_off_t;
/* [] */
typedef __darwin_off_t fpos_t;
/* [] */
struct __sbuf
{
unsigned char *_base;
int _size;
};
/* [] */
struct __sFILEX;
/* [] */
struct __sFILE
{
unsigned char *_p;
int _r;
int _w;
short _flags;
short _... |
/* [] */
typedef long long __int64_t;
/* [] */
typedef __int64_t __darwin_off_t;
/* [] */
typedef __darwin_off_t fpos_t;
/* [] */
struct __sbuf
{
unsigned char *_base;
int _size;
};
/* [] */
struct __sFILEX;
/* [] */
struct __sFILE
{
unsigned char *_p;
int _r;
int _w;
short _flags;
short _... |
XSHA_fmt_plug.c | /*
* This file is part of John the Ripper password cracker,
* Copyright (c) 2008,2011 by Solar Designer
*
* Intrinsics support added by magnum 2011.
*/
#if FMT_EXTERNS_H
extern struct fmt_main fmt_XSHA;
#elif FMT_REGISTERS_H
john_register_one(&fmt_XSHA);
#else
#include <string.h>
#include "arch.h"
#ifdef SIMD_... |
#if FMT_EXTERNS_H
extern struct fmt_main fmt_XSHA;
#elif FMT_REGISTERS_H
john_register_one(&fmt_XSHA);
#else
#include <string.h>
#include "arch.h"
#ifdef SIMD_COEF_32
#define NBKEYS (SIMD_COEF_32 * SIMD_PARA_SHA1)
#endif
#include "simd-intrinsics.h"
#include "params.h"
#include "common.h"
#include "formats.h"
... |
#if FMT_EXTERNS_H
extern struct fmt_main fmt_XSHA;
#elif FMT_REGISTERS_H
john_register_one(&fmt_XSHA);
#else
#include <string.h>
#include "arch.h"
#ifdef SIMD_COEF_32
#define NBKEYS (SIMD_COEF_32 * SIMD_PARA_SHA1)
#ifdef _OPENMP
static unsigned int omp_t = 1;
#include <omp.h>
#ifndef OMP_SCALE
#define OMP_SCAL... |
fill_r_3c.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 requi... |
#include <stdlib.h>
#include <stdio.h>
#include <complex.h>
#include "config.h"
#include "cint.h"
int GTOmax_shell_dim(int *ao_loc, int *shls_slice, int ncenter);
int GTOmax_cache_size(int (*intor) (), int *shls_slice, int ncenter,
int *atm, int natm, int *bas, int nbas, double *env);
/*
* o... |
#include <stdlib.h>
#include <stdio.h>
#include <complex.h>
#include "config.h"
#include "cint.h"
int GTOmax_shell_dim(int *ao_loc, int *shls_slice, int ncenter);
int GTOmax_cache_size(int (*intor) (), int *shls_slice, int ncenter,
int *atm, int natm, int *bas, int nbas, double *env);
/*
* o... |
_phonopy.c | /* Copyright (C) 2011 Atsushi Togo */
/* All rights reserved. */
/* This file is part of phonopy. */
/* 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 abo... |
/* All rights reserved. */
/* This file is part of phonopy. */
/* 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 ... |
/* All rights reserved. */
/* This file is part of phonopy. */
/* 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 ... |
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... |
#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 {
// Represent simple range of indexes [begin, end)
// Inspired by tbb::blocked_range
class Range1d {
... |
#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 {
// Represent simple range of indexes [begin, end)
// Inspired by tbb::blocked_range
class Range1d {
... |
test.c | // RUN: %libomptarget-compile-run-and-check-aarch64-unknown-linux-gnu
// RUN: %libomptarget-compile-run-and-check-powerpc64-ibm-linux-gnu
// RUN: %libomptarget-compile-run-and-check-powerpc64le-ibm-linux-gnu
// RUN: %libomptarget-compile-run-and-check-x86_64-pc-linux-gnu
#define IN_PARALLEL 0
#include <omp.h>
#includ... | // RUN: %libomptarget-compile-run-and-check-aarch64-unknown-linux-gnu
// RUN: %libomptarget-compile-run-and-check-powerpc64-ibm-linux-gnu
// RUN: %libomptarget-compile-run-and-check-powerpc64le-ibm-linux-gnu
// RUN: %libomptarget-compile-run-and-check-x86_64-pc-linux-gnu
#define IN_PARALLEL 0
#include <omp.h>
#includ... | // RUN: %libomptarget-compile-run-and-check-aarch64-unknown-linux-gnu
// RUN: %libomptarget-compile-run-and-check-powerpc64-ibm-linux-gnu
// RUN: %libomptarget-compile-run-and-check-powerpc64le-ibm-linux-gnu
// RUN: %libomptarget-compile-run-and-check-x86_64-pc-linux-gnu
#define IN_PARALLEL 0
#include <omp.h>
#includ... |
format_trans.h | #ifndef FORMAT_TRANS
#define FORMAT_TRANS
#include"common.h"
#include"mmio_highlevel.h"
//#include"mmio.h"
#include"utils.h"
//calculate the number of non-empty tiles of matrix A
void step1_kernel(Beidou_Tile_Matrix *matrix)
// (int m, int n, MAT_PTR_TYPE *rowpointer, int *columnidx,
// int tilem,... | #ifndef FORMAT_TRANS
#define FORMAT_TRANS
#include"common.h"
#include"mmio_highlevel.h"
//#include"mmio.h"
#include"utils.h"
//calculate the number of non-empty tiles of matrix A
void step1_kernel(Beidou_Tile_Matrix *matrix)
// (int m, int n, MAT_PTR_TYPE *rowpointer, int *columnidx,
// int tilem,... | #ifndef FORMAT_TRANS
#define FORMAT_TRANS
#include"common.h"
#include"mmio_highlevel.h"
//#include"mmio.h"
#include"utils.h"
//calculate the number of non-empty tiles of matrix A
void step1_kernel(Beidou_Tile_Matrix *matrix)
// (int m, int n, MAT_PTR_TYPE *rowpointer, int *columnidx,
// int tilem,... |
GB_unop__identity_uint64_uint8.c | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-Li... | //------------------------------------------------------------------------------
// 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... |
simd-7.c | /* { dg-do run } */
/* { dg-additional-options "-msse2" { target sse2_runtime } } */
/* { dg-additional-options "-mavx" { target avx_runtime } } */
extern void abort ();
int a[1024] __attribute__((aligned (32))) = { 1 };
int b[1024] __attribute__((aligned (32))) = { 1 };
int k, m;
struct U { int u; };
struct V { int v... | /* { dg-do run } */
/* { dg-additional-options "-msse2" { target sse2_runtime } } */
/* { dg-additional-options "-mavx" { target avx_runtime } } */
extern void abort();
int a[1024]
__attribute__((aligned(32))) =
{
1
};
int b[1024]
__attribute__((aligned(32))) =
{
1
};
int k, m;
struct U
{
int u;
};
struc... | /* { dg-do run } */
/* { dg-additional-options "-msse2" { target sse2_runtime } } */
/* { dg-additional-options "-mavx" { target avx_runtime } } */
extern void abort();
int a[1024]
__attribute__((aligned(32))) =
{
1
};
int b[1024]
__attribute__((aligned(32))) =
{
1
};
int k, m;
struct U
{
int u;
};
struc... |
GxB_Vector_Option_get.c | //------------------------------------------------------------------------------
// GxB_Vector_Option_get: get an option in a vector
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifie... | // ------------------------------------------------------------------------------
//GxB_Vector_Option_get:get an option in a vector
// ------------------------------------------------------------------------------
//SuiteSparse:GraphBLAS, Timothy A.Davis, (c) 2017 - 2022, All Rights Reserved.
// SPDX - License - Ident... | // ------------------------------------------------------------------------------
//GxB_Vector_Option_get:get an option in a vector
// ------------------------------------------------------------------------------
//SuiteSparse:GraphBLAS, Timothy A.Davis, (c) 2017 - 2022, All Rights Reserved.
// SPDX - License - Ident... |
convolutiondepthwise_3x3_int8.h | // SenseNets is pleased to support the open source community by supporting ncnn available.
//
// Copyright (C) 2018 SenseNets Technology Ltd. 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 of t... | // SenseNets is pleased to support the open source community by supporting ncnn available.
//
//Copyright(C)
2018 SenseNets Technology Ltd.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... | // SenseNets is pleased to support the open source community by supporting ncnn available.
//
//Copyright(C)
2018 SenseNets Technology Ltd.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... |
convolution_3x3_pack8to4_fp16s.h | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy ... | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy ... | // Tencent is pleased to support the open source community by making ncnn available.
//
//Copyright(C)
2020 THL A29 Limited, a Tencent company.All rights reserved.
//
//Licensed under the BSD 3 - Clause License(the "License");
you may not use this file except
// in compliance with the License.You... |
deconv_2d.h | // Copyright 2018 Xiaomi, Inc. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicab... | // Copyright 2018 Xiaomi, Inc.All rights reserved.
//
//Licensed under the Apache License, Version 2.0(the "License");
//you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//http://www.apache.org / licenses / LICENSE - 2.0
//
//Unless required by applicable la... | // Copyright 2018 Xiaomi, Inc.All rights reserved.
//
//Licensed under the Apache License, Version 2.0(the "License");
//you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//http://www.apache.org / licenses / LICENSE - 2.0
//
//Unless required by applicable la... |
bezier_classical_post_utility.h | //
// Project Name: Kratos
// Last Modified by: $Author: hbui $
// Date: $Date: 2013-10-12 $
// Revision: $Revision: 1.0 $
//
//
#if !defined(KRATOS_BEZIER_CLASSICAL_POST_UTILITY_H_INCLUDED )
#define KRATOS_BEZIER_CLASSICAL_POST_UTILITY_H_INCLUDED
// System includes
#inclu... | //
// Project Name: Kratos
// Last Modified by: $Author: hbui $
// Date: $Date: 2013-10-12 $
// Revision: $Revision: 1.0 $
//
//
#if !defined(KRATOS_BEZIER_CLASSICAL_POST_UTILITY_H_INCLUDED )
#define KRATOS_BEZIER_CLASSICAL_POST_UTILITY_H_INCLUDED
// System includes
#inclu... | //
// Project Name: Kratos
// Last Modified by: $Author: hbui $
// Date: $Date: 2013-10-12 $
// Revision: $Revision: 1.0 $
//
//
#if !defined(KRATOS_BEZIER_CLASSICAL_POST_UTILITY_H_INCLUDED )
#define KRATOS_BEZIER_CLASSICAL_POST_UTILITY_H_INCLUDED
// System includes
#inclu... |
LAGraph_dense_relabel.c | //------------------------------------------------------------------------------
// LAGraph_dense_relabel: dense relabeling of ids to matrix indices
//------------------------------------------------------------------------------
/*
LAGraph: graph algorithms based on GraphBLAS
Copyright 2019 LAGraph Contribu... | //------------------------------------------------------------------------------
// LAGraph_dense_relabel: dense relabeling of ids to matrix indices
//------------------------------------------------------------------------------
/*
LAGraph: graph algorithms based on GraphBLAS
Copyright 2019 LAGraph Contribu... | //------------------------------------------------------------------------------
// LAGraph_dense_relabel: dense relabeling of ids to matrix indices
//------------------------------------------------------------------------------
/*
LAGraph: graph algorithms based on GraphBLAS
Copyright 2019 LAGraph Contribu... |
Graph.h | #ifndef BasicGraph
#define BasicGraph
/*
* Graph.h:
* manage nodes in a neural network model
*
* Created on: Apr 21, 2017
* Author: mszhang
*/
#include "Eigen/Dense"
#include "Node.h"
#include "MyLib.h"
using namespace Eigen;
// one Node means a vector
// the col should be 1, because we aimed for NLP only... | #ifndef BasicGraph
#define BasicGraph
/*
* Graph.h: manage nodes in a neural network model
*
* Created on: Apr 21, 2017 Author: mszhang
*/
#include "Eigen/Dense"
#include "Node.h"
#include "MyLib.h"
using namespace Eigen;
//one Node means a vector
// the col should be 1, because we aimed for NLP
only
... | #ifndef BasicGraph
#define BasicGraph
/*
* Graph.h: manage nodes in a neural network model
*
* Created on: Apr 21, 2017 Author: mszhang
*/
#include "Eigen/Dense"
#include "Node.h"
#include "MyLib.h"
using namespace Eigen;
//one Node means a vector
// the col should be 1, because we aimed for NLP
only
... |
GB_binop__pow_uint16.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX... |
//------------------------------------------------------------------------------
// 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... |
gesummv.c | /**
* gesummv.c: This file was adapted from PolyBench/GPU 1.0 test
* suite to run on GPU with OpenMP 4.0 pragmas and OpenCL driver.
*
* http://www.cse.ohio-state.edu/~pouchet/software/polybench/GPU
*
* Contacts: Marcio M Pereira <mpereira@ic.unicamp.br>
* Rafael Cardoso F Sousa <rafael.cardoso@students... | /**
* gesummv.c: This file was adapted from PolyBench/GPU 1.0 test
* suite to run on GPU with OpenMP 4.0 pragmas and OpenCL driver.
*
* http://www.cse.ohio-state.edu/~pouchet/software/polybench/GPU
*
* Contacts: Marcio M Pereira <mpereira@ic.unicamp.br>
* Rafael Cardoso F Sousa <rafael.cardoso@students... | /**
* gesummv.c: This file was adapted from PolyBench/GPU 1.0 test
* suite to run on GPU with OpenMP 4.0 pragmas and OpenCL driver.
*
* http://www.cse.ohio-state.edu/~pouchet/software/polybench/GPU
*
* Contacts: Marcio M Pereira <mpereira@ic.unicamp.br>
* Rafael Cardoso F Sousa <rafael.cardoso@students... |
aux.c | #include "aux.h"
int *stacks_list;
int *stacks_cnts;
int cnt, cnt2;
long usecs (){
struct timeval t;
gettimeofday(&t,NULL);
return t.tv_sec*1000000+t.tv_usec;
}
void mysleep(double sec){
long s, e;
s=0; e=0;
s = usecs();
while(((double) e-s)/1000000 < sec)
{
e = usecs();
}
return;
}
... | #include "aux.h"
int *stacks_list;
int *stacks_cnts;
int cnt, cnt2;
long
usecs()
{
struct timeval t;
gettimeofday(&t, NULL);
return t.tv_sec * 1000000 + t.tv_usec;
}
void
mysleep(double sec)
{
long s, e;
s = 0;
e = 0;
s = usecs();
while (((double)e - s) / 1000000 < sec)
{
... | #include "aux.h"
int *stacks_list;
int *stacks_cnts;
int cnt, cnt2;
long
usecs()
{
struct timeval t;
gettimeofday(&t, NULL);
return t.tv_sec * 1000000 + t.tv_usec;
}
void
mysleep(double sec)
{
long s, e;
s = 0;
e = 0;
s = usecs();
while (((double)e - s) / 1000000 < sec)
{
... |
GB_unaryop__lnot_fp64_int64.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http... | //------------------------------------------------------------------------------
// 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... |
WaterSurfaceMesh.h | #pragma once
#include <Magnum/GL/Buffer.h>
#include <Magnum/DefaultFramebuffer.h>
#include <Magnum/Image.h>
#include <Magnum/ImageView.h>
#include <Magnum/Math/Color.h>
#include <Magnum/Mesh.h>
#include <Magnum/MeshTools/Compile.h>
#include <Magnum/MeshTools/CompressIndices.h>
#include <Magnum/MeshTools/Interleave.h>
... | #pragma once
#include <Magnum/GL/Buffer.h>
#include <Magnum/DefaultFramebuffer.h>
#include <Magnum/Image.h>
#include <Magnum/ImageView.h>
#include <Magnum/Math/Color.h>
#include <Magnum/Mesh.h>
#include <Magnum/MeshTools/Compile.h>
#include <Magnum/MeshTools/CompressIndices.h>
#include <Magnum/MeshTools/Interleave.h>
... | #pragma once
#include <Magnum/GL/Buffer.h>
#include <Magnum/DefaultFramebuffer.h>
#include <Magnum/Image.h>
#include <Magnum/ImageView.h>
#include <Magnum/Math/Color.h>
#include <Magnum/Mesh.h>
#include <Magnum/MeshTools/Compile.h>
#include <Magnum/MeshTools/CompressIndices.h>
#include <Magnum/MeshTools/Interleave.h>
... |
omp_parallel_for_lastprivate.c | <ompts:test>
<ompts:testdescription>Test which checks the omp parallel for lastprivate directive.</ompts:testdescription>
<ompts:ompversion>2.0</ompts:ompversion>
<ompts:directive>omp parallel for lastprivate</ompts:directive>
<ompts:dependences>omp parallel for reduction,omp parallel for private</ompts:dependences>
<o... | < ompts:test >
<ompts:testdescription > Test which checks the omp parallel for lastprivate
directive.< /ompts:testdescription >
<ompts: ompversion > 2.0 < /ompts:ompversion >
<ompts:directive > omp parallel for lastprivate
</ompts:directive >
<ompts: dependences > omp parallel for reduction
,omp parallel... | < ompts:test >
<ompts:testdescription > Test which checks the omp parallel for lastprivate
directive.< /ompts:testdescription >
<ompts: ompversion > 2.0 < /ompts:ompversion >
<ompts:directive > omp parallel for lastprivate
</ompts:directive >
<ompts: dependences > omp parallel for reduction
,omp parallel... |
test-math-vector-sincos.h | /* Wrappers definitions for tests of ABI of vector sincos/sincosf having
vector declaration "#pragma omp declare simd notinbranch".
Copyright (C) 2016-2017 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it ... |
#define INIT_VEC_PTRS_LOOP(vec, val, len) \
do \
{ \
for (i = 0; i < len; i++) \
{ \
vec[i] = &val[i]; \
} \
} \
while (0)
/*
* Wrapper for vector sincos/sincosf compatible with x86_64 and x32 variants
* of _ZGVbN2vvv_sincos, _Z... |
#define INIT_VEC_PTRS_LOOP(vec, val, len) \
do \
{ \
for (i = 0; i < len; i++) \
{ \
vec[i] = &val[i]; \
} \
} \
while (0)
/*
* Wrapper for vector sincos/sincosf compatible with x86_64 and x32 variants
* of _ZGVbN2vvv_sincos, _Z... |
general_basis_rep.h | #ifndef _GENERAL_BASIS_REP_H
#define _GENERAL_BASIS_REP_H
#include <complex>
#include <limits>
#include <iostream>
#include "general_basis_core.h"
#include "numpy/ndarraytypes.h"
#include "misc.h"
#include "openmp.h"
namespace basis_general {
template<class I,class J,class P=signed char>
int general_normalization(ge... | #ifndef _GENERAL_BASIS_REP_H
#define _GENERAL_BASIS_REP_H
#include <complex>
#include <limits>
#include <iostream>
#include "general_basis_core.h"
#include "numpy/ndarraytypes.h"
#include "misc.h"
#include "openmp.h"
namespace basis_general
{
template < class I, class J, class P = signed char >
int general_n... | #ifndef _GENERAL_BASIS_REP_H
#define _GENERAL_BASIS_REP_H
#include <complex>
#include <limits>
#include <iostream>
#include "general_basis_core.h"
#include "numpy/ndarraytypes.h"
#include "misc.h"
#include "openmp.h"
namespace basis_general
{
template < class I, class J, class P = signed char >
int general_n... |
threads.c | // RUN: %libomp-compile-and-run | %sort-threads | FileCheck %s
// REQUIRES: ompt
#include "callback.h"
#include <omp.h>
int main() {
int x = 0;
#pragma omp parallel num_threads(4)
{
#pragma omp atomic
x++;
}
// CHECK: 0: NULL_POINTER=[[NULL:.*$]]
// CHECK: {{^}}[[MASTER_ID:[0-9]+]]: ompt_event_thread_b... | // RUN:%libomp - compile - and - run | %sort - threads | FileCheck % s
// REQUIRES:ompt
#include "callback.h"
#include <omp.h>
int
main()
{
int x = 0;
x++;
//CHECK: 0: NULL_POINTER =[[NULL:.* $]]
// CHECK:{
{
^
}
}[[MASTER_ID: [0 - 9] +]]: ompt_event_thread_begin:
//CHECK - SAME... | // RUN:%libomp - compile - and - run | %sort - threads | FileCheck % s
// REQUIRES:ompt
#include "callback.h"
#include <omp.h>
int
main()
{
int x = 0;
#pragma omp parallel num_threads(4)
{
#pragma omp atomic
x++;
}
//CHECK: 0: NULL_POINTER =[[NULL:.* $]]
// CHECK:{
{
^
... |
fprintf.c | #include <stdio.h>
#include <omp.h>
void write_index(int*a, int N, FILE* fileptr ){
printf(" ===> Encounter target pragma fileptr:%p \n", fileptr);
// fileptr is host pointer, but set is_device_ptr so openmp does not map it.
#pragma omp target teams distribute parallel for map(tofrom: a[0:N]) is_device_p... | #include <stdio.h>
#include <omp.h>
void write_index(int*a, int N, FILE* fileptr ){
printf(" ===> Encounter target pragma fileptr:%p \n", fileptr);
// fileptr is host pointer, but set is_device_ptr so openmp does not map it.
for(int i=0;i<N;i++) {
fprintf(fileptr, "fprintf: updating a[%d] addr:%p fi... | #include <stdio.h>
#include <omp.h>
void write_index(int*a, int N, FILE* fileptr ){
printf(" ===> Encounter target pragma fileptr:%p \n", fileptr);
// fileptr is host pointer, but set is_device_ptr so openmp does not map it.
#pragma omp target teams distribute parallel for map(tofrom: a[0:N]) is_device_p... |
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... |
maxpool_with_mask.h | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
/*
* Highly specialized code, only works for TP3 L1
*/
#pragma once
#include "core/common/common.h"
#include "core/framework/op_kernel.h"
#include "core/framework/tensor.h"
#include "core/providers/cpu/nn/pool_base.h"
#i... | #include "alphasparse/kernel.h"
#include "alphasparse/util.h"
#include "alphasparse/opt.h"
alphasparse_status_t
ONAME(const ALPHA_Number alpha, const ALPHA_SPMAT_CSR * mat, const ALPHA_Number * x, const ALPHA_INT columns, const ALPHA_INT ldx, const ALPHA_Number beta, ALPHA_Number * y, const ALPHA_INT ldy)
{
ALPHA... | #include "alphasparse/kernel.h"
#include "alphasparse/util.h"
#include "alphasparse/opt.h"
alphasparse_status_t
ONAME(const ALPHA_Number alpha, const ALPHA_SPMAT_CSR * mat, const ALPHA_Number * x, const ALPHA_INT columns, const ALPHA_INT ldx, const ALPHA_Number beta, ALPHA_Number * y, const ALPHA_INT ldy)
{
ALPHA... |
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... | //------------------------------------------------------------------------------
// 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... |
gen2DTorus.c | #include "defs.h"
#define PARALLEL_SDG
/* Set this variable to zero to run the data generator
on one thread (for debugging purposes) */
double gen2DTorus(graphSDG* SDGdata) {
VERT_T *src, *dest;
WEIGHT_T *wt;
#ifdef _OPENMP
omp_lock_t* vLock;
#endif
double elapsed_time;
int seed;
... | #include "defs.h"
#define PARALLEL_SDG
/*
* Set this variable to zero to run the data generator on one thread (for
* debugging purposes)
*/
double
gen2DTorus(graphSDG * SDGdata)
{
VERT_T *src, *dest;
WEIGHT_T *wt;
double elapsed_time;
int seed;
elapsed_time = get_seconds();
/* allocate... | #include "defs.h"
#define PARALLEL_SDG
/*
* Set this variable to zero to run the data generator on one thread (for
* debugging purposes)
*/
double
gen2DTorus(graphSDG * SDGdata)
{
VERT_T *src, *dest;
WEIGHT_T *wt;
#ifdef _OPENMP
omp_lock_t *vLock;
#endif
double elapsed_time;
int seed;
... |
c-tree.h | /* Definitions for C parsing and type checking.
Copyright (C) 1987-2019 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at yo... |
#ifndef GCC_C_TREE_H
#define GCC_C_TREE_H
#include "c-family/c-common.h"
#include "diagnostic.h"
/*
* struct lang_identifier is private to c-decl.c, but langhooks.c needs to
* know how big it is. This is sanity-checked in c-decl.c.
*/
#define C_SIZEOF_STRUCT_LANG_IDENTIFIER \
(sizeof (struct c_common_identifi... |
#ifndef GCC_C_TREE_H
#define GCC_C_TREE_H
#include "c-family/c-common.h"
#include "diagnostic.h"
/*
* struct lang_identifier is private to c-decl.c, but langhooks.c needs to
* know how big it is. This is sanity-checked in c-decl.c.
*/
#define C_SIZEOF_STRUCT_LANG_IDENTIFIER \
(sizeof (struct c_common_identifi... |
GB_unop__floor_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... | //------------------------------------------------------------------------------
// 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... |
dataset.h | #ifndef LIGHTGBM_DATASET_H_
#define LIGHTGBM_DATASET_H_
#include <LightGBM/utils/random.h>
#include <LightGBM/utils/text_reader.h>
#include <LightGBM/utils/openmp_wrapper.h>
#include <LightGBM/meta.h>
#include <LightGBM/config.h>
#include <LightGBM/feature_group.h>
#include <vector>
#include <utility>
#include <func... | #ifndef LIGHTGBM_DATASET_H_
#define LIGHTGBM_DATASET_H_
#include <LightGBM/utils/random.h>
#include <LightGBM/utils/text_reader.h>
#include <LightGBM/utils/openmp_wrapper.h>
#include <LightGBM/meta.h>
#include <LightGBM/config.h>
#include <LightGBM/feature_group.h>
#include <vector>
#include <utility>
#include <func... | #ifndef LIGHTGBM_DATASET_H_
#define LIGHTGBM_DATASET_H_
#include <LightGBM/utils/random.h>
#include <LightGBM/utils/text_reader.h>
#include <LightGBM/utils/openmp_wrapper.h>
#include <LightGBM/meta.h>
#include <LightGBM/config.h>
#include <LightGBM/feature_group.h>
#include <vector>
#include <utility>
#include <func... |
rose_heat_serial_OpenMP.c | #include <omp.h>
/* This code si contributed by Richard T. Evans at the Texas Advanced computing Center
* The University of Texas at Austin
*
* To compile: icc -o heat heat_serial.c calc_up.c
*/
#include <stdio.h>
#include <sys/time.h>
#include "calc_up.h"
int main()
{
int Nx;
int Ny;
int Nt;
int t;
int ... | #include <omp.h>
/*
* This code si contributed by Richard T. Evans at the Texas Advanced
* computing Center The University of Texas at Austin
*
* To compile: icc -o heat heat_serial.c calc_up.c
*/
#include <stdio.h>
#include <sys/time.h>
#include "calc_up.h"
int
main()
{
int Nx;
int Ny;
int Nt;
... | #include <omp.h>
/*
* This code si contributed by Richard T. Evans at the Texas Advanced
* computing Center The University of Texas at Austin
*
* To compile: icc -o heat heat_serial.c calc_up.c
*/
#include <stdio.h>
#include <sys/time.h>
#include "calc_up.h"
int
main()
{
int Nx;
int Ny;
int Nt;
... |
rk4.c | #include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <sys/time.h>
#define SIZE 9600
struct timeval startTime;
struct timeval finishTime;
double timeIntervalLength;
__sw_global__ double *yt;
__sw_global__ double *k1;
__sw_global__ double *k2;
__sw_global__ double *k3;
__sw_global__ dou... | #include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <sys/time.h>
#define SIZE 9600
struct timeval startTime;
struct timeval finishTime;
double timeIntervalLength;
__sw_global__ double *yt;
__sw_global__ double *k1;
__sw_global__ double *k2;
__sw_global__ double *k3;
__sw_global__ double *k4;
... | #include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <sys/time.h>
#define SIZE 9600
struct timeval startTime;
struct timeval finishTime;
double timeIntervalLength;
__sw_global__ double *yt;
__sw_global__ double *k1;
__sw_global__ double *k2;
__sw_global__ double *k3;
__sw_global__ double *k4;
... |
profile.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... |
/*
Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/cache.h"
#include "MagickCore/color.h"
#include "MagickCore/colorspace-private.h"
#include "MagickCore/configure.h"
#include "MagickCore/exception.h"
#include "MagickCo... |
/*
Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/cache.h"
#include "MagickCore/color.h"
#include "MagickCore/colorspace-private.h"
#include "MagickCore/configure.h"
#include "MagickCore/exception.h"
#include "MagickCo... |
reduction-task-2.c | int v;
extern void foo (int);
void
bar (void)
{
int i;
#pragma omp for reduction (task, +: v) nowait /* { dg-error "'task' reduction modifier on a construct with a 'nowait' clause" } */
for (i = 0; i < 64; i++)
foo (i);
#pragma omp sections nowait reduction (task, +: v) /* { dg-error "'task' reduction modi... | int v;
extern void foo (int);
void
bar (void)
{
int i;
for (i = 0; i < 64; i++)
foo (i);
foo (-2);
foo (-3);
}
for (i = 0; i < 64; i++)
v++;
for (i = 0; i < 64; i++)
v++;
for (i = 0; i < 64; i++)
v++;
for (i = 0; i < 64; i++)
v++;
for (i = 0; i < 64; i++)
foo (i);
for ... | int v;
extern void foo(int);
void
bar(void)
{
int i;
#pragma omp for reduction (task, +: v) nowait /* { dg-error "'task'
* reduction modifier on a
* construct with a 'nowait'
... |
multiple_2dvariables_simple_omp.c | #include <stdlib.h>
#include <stdio.h>
#include <omp.h>
int main()
{
int** a = (int**)malloc(sizeof(int*));
int** b = (int**)malloc(sizeof(int*));
a[0] = (int*)malloc(sizeof(int)*4);
b[0] = (int*)malloc(sizeof(int)*4);
a[0][0] = 0;
b[0][0] = 0;
#pragma omp parallel
{
a[0][0] ... | #include <stdlib.h>
#include <stdio.h>
#include <omp.h>
int
main()
{
int **a = (int **)malloc(sizeof(int *));
int **b = (int **)malloc(sizeof(int *));
a[0] = (int *)malloc(sizeof(int) * 4);
b[0] = (int *)malloc(sizeof(int) * 4);
a[0][0] = 0;
b[0][0] = 0;
a[0][0] = 42;
b[0][0] = a[0][... | #include <stdlib.h>
#include <stdio.h>
#include <omp.h>
int
main()
{
int **a = (int **)malloc(sizeof(int *));
int **b = (int **)malloc(sizeof(int *));
a[0] = (int *)malloc(sizeof(int) * 4);
b[0] = (int *)malloc(sizeof(int) * 4);
a[0][0] = 0;
b[0][0] = 0;
#pragma omp parallel
{
a... |
GB_unop__exp2_fp32_fp32.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... |
donde.c | /* donde.c
* A hybrid MPI / OpenMP program that reports the CPU where each thread
* of each rank is executing. Used to assist in determining correct
* binding behavior.
* Rory Kelly
* 3 May 2017
*/
#define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <sched.h>
#include <unistd.h>
#include <mpi.h>
... | /*
* donde.c A hybrid MPI / OpenMP program that reports the CPU where each
* thread of each rank is executing. Used to assist in determining correct
* binding behavior. Rory Kelly 3 May 2017
*/
#define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <sched.h>
#include <unistd.h>
#include <mpi.h>
#includ... | /*
* donde.c A hybrid MPI / OpenMP program that reports the CPU where each
* thread of each rank is executing. Used to assist in determining correct
* binding behavior. Rory Kelly 3 May 2017
*/
#define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <sched.h>
#include <unistd.h>
#include <mpi.h>
#includ... |
matrix_sum_omp.c | /* --- File matrix_sum_omp.c --- */
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <omp.h>
int main(int argc, char **argv)
{
struct timespec ts_start, ts_end;
int size = 1e4;
int **a, *c;
int i, j;
float time_total;
/* Allocate memory */
c = malloc(size * sizeof(int));
a = (int **)malloc(si... | /* --- File matrix_sum_omp.c --- */
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <omp.h>
int
main(int argc, char **argv)
{
struct timespec ts_start, ts_end;
int size = 1e4;
int **a, *c;
int i, j;
float time_total;
/* Allocate memory */
c = malloc(size * sizeof(int));
... | /* --- File matrix_sum_omp.c --- */
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <omp.h>
int
main(int argc, char **argv)
{
struct timespec ts_start, ts_end;
int size = 1e4;
int **a, *c;
int i, j;
float time_total;
/* Allocate memory */
c = malloc(size * sizeof(int));
... |
GB_unaryop__ainv_fp32_int8.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... |
GB_binop__bxnor_int16.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-... | //------------------------------------------------------------------------------
// 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-... |
devito-kernel-omp-trivial.c | #define _POSIX_C_SOURCE 200809L
#include "stdlib.h"
#include "math.h"
#include "sys/time.h"
#include "xmmintrin.h"
#include "pmmintrin.h"
struct dataobj
{
void *restrict data;
int * size;
int * npsize;
int * dsize;
int * hsize;
int * hofs;
int * oofs;
} ;
struct profiler
{
double section0;
} ;
int K... | #define _POSIX_C_SOURCE 200809L
#include "stdlib.h"
#include "math.h"
#include "sys/time.h"
#include "xmmintrin.h"
#include "pmmintrin.h"
struct dataobj
{
void *restrict data;
int *size;
int *npsize;
int *dsize;
int *hsize;
int *hofs;
int *oofs;
};
struct profiler
{
double section0;
}... | #define _POSIX_C_SOURCE 200809L
#include "stdlib.h"
#include "math.h"
#include "sys/time.h"
#include "xmmintrin.h"
#include "pmmintrin.h"
struct dataobj
{
void *restrict data;
int *size;
int *npsize;
int *dsize;
int *hsize;
int *hofs;
int *oofs;
};
struct profiler
{
double section0;
}... |
GB_unaryop__abs_int32_int64.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http... | //------------------------------------------------------------------------------
// 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... |
_kdtree_core.c | /*
pykdtree, Fast kd-tree implementation with OpenMP-enabled queries
Copyright (C) 2013 - present Esben S. Nielsen
This program is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License as published by the Free
Software Foundation, either version 3 of the Lic... |
/*
* This kd-tree implementation is based on the scipy.spatial.cKDTree by Anne
* M. Archibald and libANN by David M. Mount and Sunil Arya.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <float.h>
#define PA(i,d) (pa[no_dims * pidx[i] + d])
#define PASWAP(a,b) { uint32_t tmp = pidx[a]; ... |
/*
* This kd-tree implementation is based on the scipy.spatial.cKDTree by Anne
* M. Archibald and libANN by David M. Mount and Sunil Arya.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <float.h>
#define PA(i,d) (pa[no_dims * pidx[i] + d])
#define PASWAP(a,b) { uint32_t tmp = pidx[a]; ... |
attribute.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/cache-private.h"
#include "MagickCore/cache-view.h"
#include "MagickCo... |
/*
* 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/cache-private.h"
#include "MagickCore/cache-view.h"
#include "MagickCo... |
aux_cnn.h |
#include <dirent.h>
#include <sys/types.h>
#include <cvpp/containers/matrix.h>
#include <cvpp/containers/vector.h>
#include <cvpp/containers/image.h>
#include <cvpp/properties/pose.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
using namespace cvpp;
Seq<String>
get_files( const String& dir , co... |
#include <dirent.h>
#include <sys/types.h>
#include <cvpp/containers/matrix.h>
#include <cvpp/containers/vector.h>
#include <cvpp/containers/image.h>
#include <cvpp/properties/pose.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
using namespace cvpp;
Seq < String >
get_files(const String & dir, ... |
#include <dirent.h>
#include <sys/types.h>
#include <cvpp/containers/matrix.h>
#include <cvpp/containers/vector.h>
#include <cvpp/containers/image.h>
#include <cvpp/properties/pose.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
using namespace cvpp;
Seq < String >
get_files(const String & dir, ... |
omp_app.c | /* for affinity functions */
#define _GNU_SOURCE
#include <sched.h>
#include <stdlib.h>
#include <unistd.h>
#include <assert.h>
#include <omp.h>
#include <stdio.h>
void debug_affinity(void);
int main(int argc, char **argv) {
printf("omp_num_procs: %d (available cpus)\n", omp_get_num_procs());
printf("omp_max_thr... | /* for affinity functions */
#define _GNU_SOURCE
#include <sched.h>
#include <stdlib.h>
#include <unistd.h>
#include <assert.h>
#include <omp.h>
#include <stdio.h>
void debug_affinity(void);
int
main(int argc, char **argv)
{
printf("omp_num_procs: %d (available cpus)\n", omp_get_num_procs());
printf("omp_... | /* for affinity functions */
#define _GNU_SOURCE
#include <sched.h>
#include <stdlib.h>
#include <unistd.h>
#include <assert.h>
#include <omp.h>
#include <stdio.h>
void debug_affinity(void);
int
main(int argc, char **argv)
{
printf("omp_num_procs: %d (available cpus)\n", omp_get_num_procs());
printf("omp_... |
composite.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... |
/*
* Include declarations.
*/
#include "magick/studio.h"
#include "magick/accelerate-private.h"
#include "magick/artifact.h"
#include "magick/cache-view.h"
#include "magick/channel.h"
#include "magick/client.h"
#include "magick/color.h"
#include "magick/color-private.h"
#include "magick/colorspace.h"
#include "mag... |
/*
* Include declarations.
*/
#include "magick/studio.h"
#include "magick/accelerate-private.h"
#include "magick/artifact.h"
#include "magick/cache-view.h"
#include "magick/channel.h"
#include "magick/client.h"
#include "magick/color.h"
#include "magick/color-private.h"
#include "magick/colorspace.h"
#include "mag... |
GB_unaryop__lnot_uint32_int8.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_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http... | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http... |
8850.c | /* POLYBENCH/GPU-OPENMP
*
* This file is a part of the Polybench/GPU-OpenMP suite
*
* Contact:
* William Killian <killian@udel.edu>
*
* Copyright 2013, The University of Delaware
*/
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <math.h>
/* Include polybench common header. */
#include <po... |
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <math.h>
/* Include polybench common header. */
#include <polybench.h>
/* Include benchmark-specific header. */
/* Default data type is double, default size is 4096x4096. */
#include "convolution-2d.h"
/* Array initialization. */
static
void
init... |
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <math.h>
/* Include polybench common header. */
#include <polybench.h>
/* Include benchmark-specific header. */
/* Default data type is double, default size is 4096x4096. */
#include "convolution-2d.h"
/* Array initialization. */
static
void
init... |
ej2.c | #include <stdio.h>
#include <math.h>
#include <float.h>
#include <stdlib.h>
#include <omp.h>
#include "ctimer.h"
main(int argc, char**argv)
{
////// PRODUCTO MATRIZ-VECTOR x=A*b //////
// DECLARACION DE VARIABLES // // DECLARACION DE VARIABLES //
double t1,t2,tucpu,tscpu;
const long int M= 1048576;
... | #include <stdio.h>
#include <math.h>
#include <float.h>
#include <stdlib.h>
#include <omp.h>
#include "ctimer.h"
main(int argc, char**argv)
{
////// PRODUCTO MATRIZ-VECTOR x=A*b //////
// DECLARACION DE VARIABLES // // DECLARACION DE VARIABLES //
double t1,t2,tucpu,tscpu;
const long int M= 1048576;
... | #include <stdio.h>
#include <math.h>
#include <float.h>
#include <stdlib.h>
#include <omp.h>
#include "ctimer.h"
main(int argc, char**argv)
{
////// PRODUCTO MATRIZ-VECTOR x=A*b //////
// DECLARACION DE VARIABLES // // DECLARACION DE VARIABLES //
double t1,t2,tucpu,tscpu;
const long int M= 1048576;
... |
mlp_mnist_bf16_amx_fused_trans_fused_sgd_numa.c | /******************************************************************************
* Copyright (c) Intel Corporation - All rights reserved. *
* This file is part of the LIBXSMM library. *
* *
... |
/*
* Evangelos Georganas, Alexander Heinecke (Intel Corp.) ****************************************************************************
*/
#include <libxsmm.h>
#include <libxsmm_sync.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <math.h>
/* include c-based dnn library */
#include "../commo... |
/*
* Evangelos Georganas, Alexander Heinecke (Intel Corp.) ****************************************************************************
*/
#include <libxsmm.h>
#include <libxsmm_sync.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <math.h>
#if defined(_OPENMP)
#include <omp.h>
#endif
/* incl... |
o10glogon_fmt_plug.c | /*
* This software was written by JimF jfoug AT cox dot net
* in 2016. No copyright is claimed, and the software is hereby
* placed in the public domain. In case this attempt to disclaim
* copyright and place the software in the public domain is deemed
* null and void, then the software is Copyright (c) 2016 JimF
... |
#if FMT_EXTERNS_H
extern struct fmt_main fmt_o10glogon;
#elif FMT_REGISTERS_H
john_register_one(&fmt_o10glogon);
#else
#include <string.h>
#include <openssl/des.h>
#include "arch.h"
#include "misc.h"
#include "common.h"
#include "formats.h"
#include "aes.h"
#include "md5.h"
#include "unicode.h"
#include "base64_con... |
#if FMT_EXTERNS_H
extern struct fmt_main fmt_o10glogon;
#elif FMT_REGISTERS_H
john_register_one(&fmt_o10glogon);
#else
#include <string.h>
#include <openssl/des.h>
#ifdef _OPENMP
static int omp_t = 1;
#include <omp.h>
#ifndef OMP_SCALE
#define OMP_SCALE 2048
#endif
#endif
#include "arch.h"
#include "m... |
convolution_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... |
convolution_packnto1_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 ... | // 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... |
GB_binop__eq_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-... | //------------------------------------------------------------------------------
// 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-... |
cpu.c | /**
* @file main.c
* @brief This file contains the source code of the application to parallelise.
* @details This application is a classic heat spread simulation.
* @author Ludovic Capelli
**/
#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>
#include <omp.h>
#include <inttypes.h>
#include <math.h>
#include... | /**
* @file main.c
* @brief This file contains the source code of the application to parallelise.
* @details This application is a classic heat spread simulation.
* @author Ludovic Capelli
**/
#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>
#include <omp.h>
#include <inttypes.h>
#include <math.h>
#include... | /**
* @file main.c
* @brief This file contains the source code of the application to parallelise.
* @details This application is a classic heat spread simulation.
* @author Ludovic Capelli
**/
#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>
#include <omp.h>
#include <inttypes.h>
#include <math.h>
#include... |
query-veb.h | /*
* Copyright 2018-2021 Kyle Berney, Ben Karsin
*
* 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 o... |
#ifndef QUERY_VEB_H
#define QUERY_VEB_H
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <math.h>
#include <omp.h>
#include <time.h>
#include "params.h"
#include "common.h"
struct vEB_table {
uint64_t L; //size of the bottom/leaf tree
uint64_t R; //size of the corresponding top/root tree
... |
#ifndef QUERY_VEB_H
#define QUERY_VEB_H
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <math.h>
#include <omp.h>
#include <time.h>
#include "params.h"
#include "common.h"
struct vEB_table {
uint64_t L; //size of the bottom/leaf tree
uint64_t R; //size of the corresponding top/root tree
... |
omp_for_dynamic_large_chunk.c | // RUN: %libomp-compile
// RUN: env OMP_WAIT_POLICY=passive OMP_NUM_THREADS=32 %libomp-run 0 134217728 1 134217728
//
// This test makes sure that large chunks sizes are handled correctly
// including internal runtime calculations which incorporate the chunk size
// Only one thread should execute all iterations.
#inclu... | // RUN:%libomp - compile
// RUN:env OMP_WAIT_POLICY = passive OMP_NUM_THREADS = 32 % libomp - run 0 134217728 1 134217728
//
//This test makes sure that large chunks sizes are handled correctly
// including internal runtime calculations which incorporate the chunk size
// Only one thread should execute all iterations.
... | // RUN:%libomp - compile
// RUN:env OMP_WAIT_POLICY = passive OMP_NUM_THREADS = 32 % libomp - run 0 134217728 1 134217728
//
//This test makes sure that large chunks sizes are handled correctly
// including internal runtime calculations which incorporate the chunk size
// Only one thread should execute all iterations.
... |
Contractor.h | /*
open source routing machine
Copyright (C) Dennis Luxen, others 2010
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU AFFERO General Public License as published by
the Free Software Foundation; either version 3 of the License, or
any later version.
This prog... |
#ifndef CONTRACTOR_H_INCLUDED
#define CONTRACTOR_H_INCLUDED
#ifdef _GLIBCXX_PARALLEL
#include <parallel/algorithm>
#else
#include <algorithm>
#endif
#include "../DataStructures/DynamicGraph.h"
#include "../DataStructures/Percent.h"
#include "../DataStructures/BinaryHeap.h"
#include <ctime>
#include <vector>
#include ... |
#ifndef CONTRACTOR_H_INCLUDED
#define CONTRACTOR_H_INCLUDED
#ifdef _GLIBCXX_PARALLEL
#include <parallel/algorithm>
#else
#include <algorithm>
#endif
#include "../DataStructures/DynamicGraph.h"
#include "../DataStructures/Percent.h"
#include "../DataStructures/BinaryHeap.h"
#include <ctime>
#include <vector>
#include ... |
GB_binop__isle_uint8.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-... |
GB_unaryop__abs_int32_uint64.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... |
fast_math.c | /* Generated by Cython 0.29.12 */
/* BEGIN: Cython Metadata
{
"distutils": {
"depends": [],
"extra_compile_args": [
"/openmp"
],
"name": "quantas.utils.math.fast_math",
"sources": [
"quantas/utils/math/fast_math.pyx"
]
},
"module_name"... |
__pyx_t_1 = __Pyx_PyDict_NewPresized(0); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1, __pyx_L1_error)
__Pyx_GOTREF(__pyx_t_1);
if (PyDict_SetItem(__pyx_d, __pyx_n_s_test, __pyx_t_1) < 0) __PYX_ERR(0, 1, __pyx_L1_error)
__Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
/* "View.MemoryView":209
* info.obj = self
... |
__pyx_t_1 = __Pyx_PyDict_NewPresized(0); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1, __pyx_L1_error)
__Pyx_GOTREF(__pyx_t_1);
if (PyDict_SetItem(__pyx_d, __pyx_n_s_test, __pyx_t_1) < 0) __PYX_ERR(0, 1, __pyx_L1_error)
__Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
/* "View.MemoryView":209
* info.obj = self
... |
GB_binop__minus_fp32.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... |
GB_binop__times_uint8.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-... |
rmsprop_op.h | #pragma once
#include "caffe2/core/operator.h"
namespace caffe2 {
template <typename Context>
void rmsprop_update(
int N,
const float* g,
const float* ms,
const float* mom,
float* ng,
float* nms,
float* nmom,
float decay,
float momentum,
float epsilon,
const float* lr,
... | #pragma once
#include "caffe2/core/operator.h"
namespace caffe2
{
template < typename Context >
void rmsprop_update(
int N,
const float *g,
const float *ms,
const float *mom,
... | #pragma once
#include "caffe2/core/operator.h"
namespace caffe2
{
template < typename Context >
void rmsprop_update(
int N,
const float *g,
const float *ms,
const float *mom,
... |
base_contact_search.h | // KRATOS ___| | | |
// \___ \ __| __| | | __| __| | | __| _` | |
// | | | | | ( | | | | ( | |
// _____/ \__|_| \__,_|\___|\__|\__,_|_| \__,_|_| MECHANICS
//
// License: BSD License
// license: StructuralMechanicsApplicat... | // KRATOS ___| | | |
// \___ \ __| __| | | __| __| | | __| _` | |
// | | | | | ( | | | | ( | |
// _____/ \__|_| \__,_|\___|\__|\__,_|_| \__,_|_| MECHANICS
//
// License: BSD License
// license: StructuralMechanicsApplicat... | // KRATOS ___| | | |
// \___ \ __| __| | | __| __| | | __| _` | |
// | | | | | ( | | | | ( | |
// _____/ \__|_| \__,_|\___|\__|\__,_|_| \__,_|_| MECHANICS
//
// License: BSD License
// license: StructuralMechanicsApplicat... |
GB_binop__iseq_fc32.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... |
fox_floats_timer_caching_omp_fileIO_benchmark.c | /* fox_floats_timer_caching_omp_fileIO_benchmark.c -- uses Fox's algorithm to multiply two square matrices
*
* Implementation of parallel matrix multiplication:
* LaTeX: $C_{i,j} = \sum_{k} A_{i,k}B_{k,j}$
*
* Input:
* Input Matrix file name: A.dat, B.dat
*
* Output:
* Output Matrix file name: C.dat... | /* fox_floats_timer_caching_omp_fileIO_benchmark.c -- uses Fox's algorithm to multiply two square matrices
*
* Implementation of parallel matrix multiplication:
* LaTeX: $C_{i,j} = \sum_{k} A_{i,k}B_{k,j}$
*
* Input:
* Input Matrix file name: A.dat, B.dat
*
* Output:
* Output Matrix file name: C.dat... | /* fox_floats_timer_caching_omp_fileIO_benchmark.c -- uses Fox's algorithm to multiply two square matrices
*
* Implementation of parallel matrix multiplication:
* LaTeX: $C_{i,j} = \sum_{k} A_{i,k}B_{k,j}$
*
* Input:
* Input Matrix file name: A.dat, B.dat
*
* Output:
* Output Matrix file name: C.dat... |
3d25pt.c | /*
* Order-2, 3D 25 point stencil
* Adapted from PLUTO and Pochoir test bench
*
* Tareq Malas
*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#ifdef LIKWID_PERFMON
#include <likwid.h>
#endif
#include "print_utils.h"
#define TESTS 2
#define MAX(a,b) ((a) > (b) ? a : b)
#define MIN(a,b) ((a) < (b)... | /*
* Order-2, 3D 25 point stencil Adapted from PLUTO and Pochoir test bench
*
* Tareq Malas
*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#ifdef LIKWID_PERFMON
#include <likwid.h>
#endif
#include "print_utils.h"
#define TESTS 2
#define MAX(a,b) ((a) > (b) ? a : b)
#define MIN(a,b) ((a) < (b) ?... | /*
* Order-2, 3D 25 point stencil Adapted from PLUTO and Pochoir test bench
*
* Tareq Malas
*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#ifdef LIKWID_PERFMON
#include <likwid.h>
#endif
#include "print_utils.h"
#define TESTS 2
#define MAX(a,b) ((a) > (b) ? a : b)
#define MIN(a,b) ((a) < (b) ?... |
GB_binop__first_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-... |
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... | #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... | #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... |
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... |
perfect_number.c | /* vim: set ft=c sw=4 ts=4: */
/* perfect_number.c
* Perfect number calculation in C */
#include "perfect_number.h"
#include <stdio.h>
#include "dynarr/DG_dynarr.h"
/** perfect number predicate */
bool is_perfect(unsigned n) {
unsigned sum = 0;
for (unsigned i = 1; i < n; i++) {
if (n % i == 0)
... | /* vim: set ft=c sw=4 ts=4: */
/*
* perfect_number.c Perfect number calculation in C
*/
#include "perfect_number.h"
#include <stdio.h>
#include "dynarr/DG_dynarr.h"
/** perfect number predicate */
bool
is_perfect(unsigned n)
{
unsigned sum = 0;
for (unsigned i = 1; i < n; i++)
{
if (n % i == ... | /* vim: set ft=c sw=4 ts=4: */
/*
* perfect_number.c Perfect number calculation in C
*/
#include "perfect_number.h"
#include <stdio.h>
#include "dynarr/DG_dynarr.h"
/** perfect number predicate */
bool
is_perfect(unsigned n)
{
unsigned sum = 0;
for (unsigned i = 1; i < n; i++)
{
if (n % i == ... |
top_k_v2_op.h | /* Copyright (c) 2016 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... |
/*
The reason why we need the topk v2 is because the compatibility. We redefine
the NaN is maximum value
in the process of comparing. If do not add the topk v2, will affect the
inference result of model that traing
by the older version paddlepaddle.
*/
#pragma once
#include <algorithm>
#include <iostream>... |
/*
The reason why we need the topk v2 is because the compatibility. We redefine
the NaN is maximum value
in the process of comparing. If do not add the topk v2, will affect the
inference result of model that traing
by the older version paddlepaddle.
*/
#pragma once
#include <algorithm>
#include <iostream>... |
GB_binop__isgt_uint8.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http:... | //------------------------------------------------------------------------------
// 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:... |
CSRMatrix.h | /*
* CSRMatrix.h
*
* Created on: May 6, 2015
* Author: Michael Wegner (michael.wegner@student.kit.edu)
*/
#ifndef CSRMATRIX_H_
#define CSRMATRIX_H_
#include <vector>
#include "../Globals.h"
#include "AlgebraicGlobals.h"
#include "Vector.h"
#include "../graph/Graph.h"
#include "../algebraic/SparseAccumulato... | /*
* CSRMatrix.h
*
* Created on: May 6, 2015
* Author: Michael Wegner (michael.wegner@student.kit.edu)
*/
#ifndef CSRMATRIX_H_
#define CSRMATRIX_H_
#include <vector>
#include "../Globals.h"
#include "AlgebraicGlobals.h"
#include "Vector.h"
#include "../graph/Graph.h"
#include "../algebraic/SparseAccumulato... | /*
* CSRMatrix.h
*
* Created on: May 6, 2015
* Author: Michael Wegner (michael.wegner@student.kit.edu)
*/
#ifndef CSRMATRIX_H_
#define CSRMATRIX_H_
#include <vector>
#include "../Globals.h"
#include "AlgebraicGlobals.h"
#include "Vector.h"
#include "../graph/Graph.h"
#include "../algebraic/SparseAccumulato... |
munit.c | /* Copyright (c) 2013-2017 Evan Nemerson <evan@nemerson.com>
*
* 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, copy... |
/*** Configuration ***/
/*
* This is just where the output from the test goes. It's really just meant
* to let you choose stdout or stderr, but if anyone really want to direct it
* to a file let me know, it would be fairly easy to support.
*/
#if !defined(MUNIT_OUTPUT_FILE)
#define MUNIT_OUTPUT_FILE stdout
#end... |
/*** Configuration ***/
/*
* This is just where the output from the test goes. It's really just meant
* to let you choose stdout or stderr, but if anyone really want to direct it
* to a file let me know, it would be fairly easy to support.
*/
#if !defined(MUNIT_OUTPUT_FILE)
#define MUNIT_OUTPUT_FILE stdout
#end... |
rose_circuit_OpenMP.c | #include <omp.h>
# include <stdlib.h>
# include <stdio.h>
# include <time.h>
int main(int argc,char *argv[]);
int circuit_value(int n,int bvec[]);
void i4_to_bvec(int i4,int n,int bvec[]);
void timestamp();
/******************************************************************************/
int main(int argc,char *argv[]... | #include <omp.h>
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
int main(int argc, char *argv[]);
int circuit_value(int n, int bvec[]);
void i4_to_bvec(int i4, int n, int bvec[]);
void timestamp();
/******************************************************************************/
int
main(int argc, char *argv... | #include <omp.h>
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
int main(int argc, char *argv[]);
int circuit_value(int n, int bvec[]);
void i4_to_bvec(int i4, int n, int bvec[]);
void timestamp();
/******************************************************************************/
int
main(int argc, char *argv... |
convolution_sgemm.h | // BUG1989 is pleased to support the open source community by supporting ncnn available.
//
// Copyright (C) 2019 BUG1989. 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 of the License at
//
//... | // BUG1989 is pleased to support the open source community by supporting ncnn available.
//
// Copyright (C) 2019 BUG1989. 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 of the License at
//
//... | // BUG1989 is pleased to support the open source community by supporting ncnn available.
//
// Copyright (C) 2019 BUG1989. 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 of the License at
//
//... |
GB_binop__div_fc32.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-... |
ExSHalosLC4.c | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
#include <fftw3.h>
#include <gsl/gsl_errno.h>
#include <gsl/gsl_spline.h>
#include <gsl/gsl_rng.h>
#include <gsl/gsl_randist.h>
#include "fftlog.h"
#define check_memory(p, name) if(p == NULL){printf("Problems to alloc %s.\n", name); return 0;}
... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
#include <fftw3.h>
#include <gsl/gsl_errno.h>
#include <gsl/gsl_spline.h>
#include <gsl/gsl_rng.h>
#include <gsl/gsl_randist.h>
#include "fftlog.h"
#define check_memory(p, name) if(p == NULL){printf("Problems to alloc %s.\n", name); return 0;}
... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
#include <fftw3.h>
#include <gsl/gsl_errno.h>
#include <gsl/gsl_spline.h>
#include <gsl/gsl_rng.h>
#include <gsl/gsl_randist.h>
#include "fftlog.h"
#define check_memory(p, name) if(p == NULL){printf("Problems to alloc %s.\n", name); return 0;}
... |
GB_binop__minus_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... |
convolution_sgemm_int8.h | // BUG1989 is pleased to support the open source community by supporting ncnn available.
//
// Copyright (C) 2019 BUG1989. 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 of the License at
//
//... | // BUG1989 is pleased to support the open source community by supporting ncnn available.
//
//Copyright(C)
2019 BUG1989.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 of t... | // BUG1989 is pleased to support the open source community by supporting ncnn available.
//
//Copyright(C)
2019 BUG1989.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 of t... |
GB_unop__identity_fp32_fp32.c | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http://... | //------------------------------------------------------------------------------
// 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://... |
mxnet_op.h | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you ... |
/*!
* Copyright (c) 2017 by Contributors
* \file mxnet_op.h
* \brief
* \author Junyuan Xie
*/
#ifndef MXNET_OPERATOR_MXNET_OP_H_
#define MXNET_OPERATOR_MXNET_OP_H_
#include <dmlc/omp.h>
#include <mxnet/base.h>
#include <mxnet/engine.h>
#include <mxnet/op_attr_types.h>
#include <algorithm>
#include "./operator_tu... |
/*!
* Copyright (c) 2017 by Contributors
* \file mxnet_op.h
* \brief
* \author Junyuan Xie
*/
#ifndef MXNET_OPERATOR_MXNET_OP_H_
#define MXNET_OPERATOR_MXNET_OP_H_
#include <dmlc/omp.h>
#include <mxnet/base.h>
#include <mxnet/engine.h>
#include <mxnet/op_attr_types.h>
#include <algorithm>
#include "./operator_tu... |
parallel_for_wrapper.h | #pragma once
#include <omp.h>
#include <thread>
#include <opencv2/opencv.hpp>
/*
On OpenCV 3.2.0, cv::parallel_for_ combined with lambda function is not supported (occurring below error).
If version of the library is greater than 3.2.0.
"parallel_for_omp" can be replaced by cv::parallel_for_ without loss o... | #pragma once
#include <omp.h>
#include <thread>
#include <opencv2/opencv.hpp>
/*
On OpenCV 3.2.0, cv::parallel_for_ combined with lambda function is not supported (occurring below error).
If version of the library is greater than 3.2.0.
"parallel_for_omp" can be replaced by cv::parallel_for_ without loss o... | #pragma once
#include <omp.h>
#include <thread>
#include <opencv2/opencv.hpp>
/*
On OpenCV 3.2.0, cv::parallel_for_ combined with lambda function is not supported (occurring below error).
If version of the library is greater than 3.2.0.
"parallel_for_omp" can be replaced by cv::parallel_for_ without loss o... |
drift.c | /*
* clockperf
*
* Copyright (c) 2016-2021, Steven Noonan <steven@uplinklabs.net>
*
* 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 all copies.
*
* THE SOF... |
#include "prefix.h"
#include "affinity.h"
#include "clock.h"
#include "drift.h"
#ifdef HAVE_DRIFT_TESTS
#include <assert.h>
#include <stdbool.h>
#include <omp.h>
struct global_cfg
{
struct clockspec clk;
struct clockspec ref;
};
typedef enum
{
UNSTARTED = 0, //not yet spawned
WAITING = 1, //waitin... |
#include "prefix.h"
#include "affinity.h"
#include "clock.h"
#include "drift.h"
#ifdef HAVE_DRIFT_TESTS
#include <assert.h>
#include <stdbool.h>
#include <omp.h>
struct global_cfg
{
struct clockspec clk;
struct clockspec ref;
};
typedef enum
{
UNSTARTED = 0, //not yet spawned
WAITING = 1, //waitin... |
memdbg.h | /* ****** NOTE ******
* This header file should be the LAST header file included within every
* .c file within the project. If there are .h files that have actual
* code in them, then this header should be the last include within that
* .h file, and that .h file should be the last one included within the
* ... |
/*
* memdbg.h
* Memory management debugging (at runtime)
*
* memdbg contains routines detect, and report memory
* problems, such as double frees, passing bad pointers to
* free, most buffer overwrites. Also, tracking of non-freed
* data, showing memory leaks, can also be shown.
*
* Compilation Op... |
/*
* memdbg.h
* Memory management debugging (at runtime)
*
* memdbg contains routines detect, and report memory
* problems, such as double frees, passing bad pointers to
* free, most buffer overwrites. Also, tracking of non-freed
* data, showing memory leaks, can also be shown.
*
* Compilation Op... |
GB_unop__trunc_fc32_fc32.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... |
sgemm.c | #include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <math.h>
#include <sys/time.h>
#include <omp.h>
/*
* C = [n, q] = A[n, m] * B[m, q]
*/
enum {
N = 1000,
M = 1000,
Q = 1000,
NREPS = 5,
};
double wtime()
{
struct timeval t;
gettimeofday(&t, NULL);
return (dou... | #include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <math.h>
#include <sys/time.h>
#include <omp.h>
/*
* C = [n, q] = A[n, m] * B[m, q]
*/
enum
{
N = 1000,
M = 1000,
Q = 1000,
NREPS = 5,
};
double
wtime()
{
struct timeval t;
gettimeofday(&t, NULL);
return (double)t.tv... | #include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <math.h>
#include <sys/time.h>
#include <omp.h>
/*
* C = [n, q] = A[n, m] * B[m, q]
*/
enum
{
N = 1000,
M = 1000,
Q = 1000,
NREPS = 5,
};
double
wtime()
{
struct timeval t;
gettimeofday(&t, NULL);
return (double)t.tv... |
GB_unop__lnot_int16_int16.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... |
dropout-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 ... |
/*!
* Copyright (c) 2015 by Contributors
* \file dropout-inl.h
* \brief
* \author Bing Xu, Da Zheng, Hang Zhang
*/
#ifndef MXNET_OPERATOR_NN_DROPOUT_INL_H_
#define MXNET_OPERATOR_NN_DROPOUT_INL_H_
#include <dmlc/logging.h>
#include <dmlc/parameter.h>
#include <mxnet/operator.h>
#include <map>
#include <vector>
#... |
/*!
* Copyright (c) 2015 by Contributors
* \file dropout-inl.h
* \brief
* \author Bing Xu, Da Zheng, Hang Zhang
*/
#ifndef MXNET_OPERATOR_NN_DROPOUT_INL_H_
#define MXNET_OPERATOR_NN_DROPOUT_INL_H_
#include <dmlc/logging.h>
#include <dmlc/parameter.h>
#include <mxnet/operator.h>
#include <map>
#include <vector>
#... |
server.c | // C99
// Start program: mpirun -np 1 server
#include <mpi.h>
#include <omp.h>
#include <stdio.h>
#include <stdbool.h>
#include <unistd.h> // needed for sleep() on POSIX system
#define MAX_DATA 100
int main( int argc, char **argv )
{
int providedThreadSupport;
bool terminateListening = false;
char portNa... | // C99
// Start program: mpirun -np 1 server
#include <mpi.h>
#include <omp.h>
#include <stdio.h>
#include <stdbool.h>
#include <unistd.h> // needed for sleep() on POSIX system
#define MAX_DATA 100
int main( int argc, char **argv )
{
int providedThreadSupport;
bool terminateListening = false;
char portNa... | // C99
// Start program: mpirun -np 1 server
#include <mpi.h>
#include <omp.h>
#include <stdio.h>
#include <stdbool.h>
#include <unistd.h> // needed for sleep() on POSIX system
#define MAX_DATA 100
int main( int argc, char **argv )
{
int providedThreadSupport;
bool terminateListening = false;
char portNa... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.