repo stringlengths 1 152 ⌀ | file stringlengths 14 221 | code stringlengths 501 25k | file_length int64 501 25k | avg_line_length float64 20 99.5 | max_line_length int64 21 134 | extension_type stringclasses 2
values |
|---|---|---|---|---|---|---|
MAFAT | MAFAT-master/distriot/src/thread_util.c | #include "thread_util.h"
#include <string.h>
#include <sys/time.h>
#include <sys/types.h>
#include <stdlib.h>
#include <unistd.h>
#include <pthread.h>
#include <errno.h>
#include <stdio.h>
#include <time.h>
#ifndef SYS_ARCH_TIMEOUT
#define SYS_ARCH_TIMEOUT 1000000
#endif
#ifndef ERR_OK
#define ERR_OK 0
#endif
#ifnde... | 4,897 | 21.675926 | 101 | c |
MAFAT | MAFAT-master/distriot/src/data_blob.c | #include "data_blob.h"
#include <stdio.h>
blob* new_blob_and_copy_data(int32_t id, uint32_t size, uint8_t* data)
{
blob *temp = (blob*)malloc(sizeof(blob));
temp->data = (uint8_t*)malloc(sizeof(uint8_t)*size);
temp->meta = NULL;
temp->meta_size = 0;
memcpy(temp->data, data, size);
temp->size = size;
... | 2,501 | 22.828571 | 70 | c |
MAFAT | MAFAT-master/distriot/src/thread_safe_queue.c | #include "thread_safe_queue.h"
static queue_node* new_node_and_copy_item(blob* item)
{
queue_node *temp = (queue_node*)malloc(sizeof(queue_node));
temp->item = new_blob_and_copy_data(item->id, item->size, item->data);
copy_blob_meta(temp->item, item);
temp->next = NULL;
return temp;
}
thread_safe_queu... | 4,189 | 22.149171 | 80 | c |
MAFAT | MAFAT-master/distriot/src/data_blob.h | #ifndef DATA_BLOB_H
#define DATA_BLOB_H
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#ifdef __cplusplus
extern "C" {
#endif
typedef struct ts_blob {
uint8_t *data;
uint32_t size;
uint8_t *meta;
uint32_t meta_size;
int32_t id;
int8_t free_data;
} blob;
blob* new_blob_and_copy_data(int3... | 808 | 22.114286 | 71 | h |
MAFAT | MAFAT-master/distriot/src/exec_ctrl.h | #ifndef EXEC_CTRL_H
#define EXEC_CTRL_H
#include "data_blob.h"
#include "thread_util.h"
#include "thread_safe_queue.h"
#include "network_util.h"
#include "global_context.h"
#ifdef __cplusplus
extern "C" {
#endif
void exec_barrier(int portno, ctrl_proto proto, device_ctxt* ctxt);
void exec_start_gateway(int portno, ctr... | 773 | 27.666667 | 83 | h |
MAFAT | MAFAT-master/include/configure.h | #ifndef CONFIGURE_H
#define CONFIGURE_H
/*Partitioning paramters*/
#define FUSED_LAYERS_MAX 16
#define PARTITIONS_W_MAX 6
#define PARTITIONS_H_MAX 6
#define PARTITIONS_MAX 36
#define THREAD_NUM 1
#define DATA_REUSE 1
/*Generate debugging information in log file*/
#define DEBUG_LOG 1
/*Debugging information for diffe... | 868 | 24.558824 | 117 | h |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/inccomp.c | //---------------------------------------------------------------------------
// inccomp.c
//
// Functions for the incremental computation of the globally best substructure
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue.h"
//-----------------------------... | 13,335 | 34.753351 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/evaluate.c | //---------------------------------------------------------------------------
// evaluate.c
//
// Substructure evaluation functions. The default evaluation is based
// on MDL, but a simpler, size-based evaluation is also available and
// selectable through input parameters.
//
// Subdue 5.
//--------------------------... | 22,803 | 33.921899 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/mdl_main.c | //---------------------------------------------------------------------------
// mdl_main.c
//
// Main functions for standalone MDL computation.
//
// Usage: mdl [-dot <filename>] [-overlap] [-threshold #] g1 g2
//
// Computes the description length of g1, g2 and g2 compressed with g1
// along with the final MDL compre... | 7,235 | 31.16 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/cvtest_main.c | //---------------------------------------------------------------------------
// cvtest_main.c
//
// Main functions to perform a cross-validation experiment using Subdue on
// a set of examples.
//
// Usage: cvtest [<subdue_options>] [-nfolds <n>] <graphfile>
//
// This program first divides the examples from <graphfil... | 12,009 | 30.11399 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/discover.c | //---------------------------------------------------------------------------
// discover.c
//
// Main SUBDUE discovery functions.
//
// SUBDUE 5
//---------------------------------------------------------------------------
#include "subdue.h"
//-----------------------------------------------------------------------... | 12,078 | 34.631268 | 82 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/mpi.c | //---------------------------------------------------------------------------
// mpi.c
//
// Functions for parallel version of Subdue using MPI.
//
// Subdue 5
//---------------------------------------------------------------------------
#include <mpi.h>
#include "subdue.h"
//----- Master Process Functions
//------... | 20,417 | 31.932258 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/graph2dot_main.c | //---------------------------------------------------------------------------
// graph2dot_main.c
//
// Main functions for program to convert a Subdue graph file into
// dot format as specified in AT&T Labs GraphViz package.
//
// Usage: graph2dot <graphfilename> <dotfilename>
//
// Writes the graph defined in <graphfi... | 3,089 | 26.589286 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/test.c | //---------------------------------------------------------------------------
// test.c
//
// Functions to compute FP/FN/TP/TN/Error stats for a given set of
// substructures and a given set of example graphs.
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue... | 6,063 | 31.084656 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/gendata.c | //---------------------------------------------------------------------------
// gendata.c
//
// Generate data for iSubdue
//
// Subdue 5
//
// Independent Data: Increments are completely separate
// Connected Data: Edges span increment boundaries
//
// Generates a specified number of increments and writes each one... | 11,547 | 30.725275 | 102 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/mpi_main.c | //---------------------------------------------------------------------------
// mpi_main.c
//
// Main procedures for initiating the parallel version of SUBDUE using MPI.
//
// SUBDUE 5
//---------------------------------------------------------------------------
#include <time.h>
#include <mpi.h>
#include "subdue.h"
... | 23,938 | 31.176075 | 99 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/sgiso.c | //---------------------------------------------------------------------------
// sgiso.c
//
// These functions implement a subgraph isomorphism algorithm embodied
// in the FindInstances function. This is primarily used to find
// predefined substructures.
//
// Subdue 5
//---------------------------------------------... | 10,734 | 33.7411 | 78 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/avl.c | /* Produced by texiweb from libavl.w on 2004/10/07 at 22:24. */
/* libavl - library for manipulation of binary trees.
Copyright (C) 1998-2002 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
publishe... | 24,586 | 26.594837 | 78 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/sgiso2_main.c | //---------------------------------------------------------------------------
// sgiso_main.c
//
// Main functions for standalone subgraph isomorphism algorithm.
//
// Usage: sgiso [-dot <filename>] [-overlap] [-threshold #] g1 g2
//
// Finds and prints all instances of g1 in g2. If -overlap is given,
// then instance... | 4,853 | 28.065868 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/utility.c | //---------------------------------------------------------------------------
// utility.c
//
// Miscellaneous utility functions.
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue.h"
//------------------------------------------------------------------------... | 1,068 | 22.23913 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/gprune_main.c | //---------------------------------------------------------------------------
// gprune_main.c
//
// Main function for graph pruner, which removes vertices and edges with
// specific labels.
//
// Usage: gprune <label> <inputgraphfile> <outputgraphfile>
//
// Removes all vertices and edges with label equal to <label> i... | 7,105 | 28.363636 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/avl.h | /* Produced by texiweb from libavl.w on 2004/10/07 at 22:24. */
/* libavl - library for manipulation of binary trees.
Copyright (C) 1998-2002 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
publishe... | 4,477 | 37.603448 | 78 | h |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/incutil.c | //---------------------------------------------------------------------------
// incutil.c
//
// Set of functions to deal with adding, retrieving and manipulating data
// increments. It is important to note that the increment list does not store
// the actual data. The graph is stored as it always was, in the posGra... | 20,153 | 31.454106 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/dot.c | //---------------------------------------------------------------------------
// dot.c
//
// Functions for writing Subdue graphs in dot format. The dot format
// is part of AT&T Labs GraphViz project.
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue.h"
//... | 10,533 | 33.090615 | 78 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/subs2dot_main.c | //---------------------------------------------------------------------------
// subs2dot_main.c
//
// Main functions for program to convert a Subdue output file into
// dot format as specified in AT&T Labs GraphViz package.
//
// Usage: subs2dot <subsfilename> <dotfilename>
//
// Writes the substructures defined in <s... | 3,383 | 27.677966 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/incgraphops.c | //---------------------------------------------------------------------------
// incgraphops.c
//
// Functions for managing the reference graphs used in the discovery of
// sub instances that span increment boundaries.
//
// Much of this code was derived from the graphops code.
//
// Subdue 5
//------------------------... | 22,223 | 29.402189 | 90 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/incextend.c | //---------------------------------------------------------------------------
// incextend.c
//
// Functions for extending boundary instances with respect to a reference graph
//
// Much of this code was derived from the standard extend code
//
// Subdue 5
//-------------------------------------------------------------... | 9,129 | 34.115385 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/sgiso_main.c | //---------------------------------------------------------------------------
// sgiso_main.c
//
// Main functions for standalone subgraph isomorphism algorithm.
//
// Usage: sgiso [-dot <filename>] [-overlap] [-threshold #] g1 g2
//
// Finds and prints all instances of g1 in g2. If -overlap is given,
// then instance... | 4,848 | 28.035928 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/gm_main.c | //---------------------------------------------------------------------------
// gm_main.c
//
// Main function for standalone graph matcher.
//
// Usage: gm g1 g2
//
// The inexact graph match program computes the cost of transforming
// the larger of the input graphs into the smaller according to the
// transformation... | 3,285 | 27.824561 | 79 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/labels.c | //---------------------------------------------------------------------------
// labels.c
//
// Storage and lookup of graph vertex and edge labels.
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue.h"
//------------------------------------------------------... | 10,726 | 30.18314 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/subdue/test_main.c | //---------------------------------------------------------------------------
// test_main.c
//
// Main functions to compute FP/FN/TP/TN/Error stats for a given set of
// substructures and a given set of example graphs.
//
// Usage: test <subsfile> <graphfile>
//
// Reads in substructures from <subsfile> and then reads... | 3,788 | 28.372093 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/bter/ccperdegest_mex.c | /* CCPERDEGEST_MEX.C: Estimates clustering coefficient for given bins
using the wedge sampling technique
For computational results for this algorithm, see
C. Seshadhri, A. Pinar, and T.G. Kolda,
Triadic Measures on Graphs: The Power of Wedge Sampling,
Proc. SIAM Data Mining, May 2013.
Tamara G. Kolda, Ali Pinar,... | 8,525 | 28.604167 | 98 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/bter/tricnt_mex.c | /* TRICNT_MEX.C: Computes the number of triangles adjacent to each vertex.
The code uses full enumeration. Each edge is assigned to its lower degree vertex,
and each vertex checks wedges formed by edges assigned to itself.
For computational results for this algorithm, see
C. Seshadhri, A. Pinar, and T.G. Kold... | 6,950 | 28.705128 | 119 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/inccomp.c | //---------------------------------------------------------------------------
// inccomp.c
//
// Functions for the incremental computation of the globally best substructure
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue.h"
//-----------------------------... | 13,335 | 34.753351 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/evaluate.c | //---------------------------------------------------------------------------
// evaluate.c
//
// Substructure evaluation functions. The default evaluation is based
// on MDL, but a simpler, size-based evaluation is also available and
// selectable through input parameters.
//
// Subdue 5.
//--------------------------... | 22,803 | 33.921899 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/mdl_main.c | //---------------------------------------------------------------------------
// mdl_main.c
//
// Main functions for standalone MDL computation.
//
// Usage: mdl [-dot <filename>] [-overlap] [-threshold #] g1 g2
//
// Computes the description length of g1, g2 and g2 compressed with g1
// along with the final MDL compre... | 7,235 | 31.16 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/cvtest_main.c | //---------------------------------------------------------------------------
// cvtest_main.c
//
// Main functions to perform a cross-validation experiment using Subdue on
// a set of examples.
//
// Usage: cvtest [<subdue_options>] [-nfolds <n>] <graphfile>
//
// This program first divides the examples from <graphfil... | 12,009 | 30.11399 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/discover.c | //---------------------------------------------------------------------------
// discover.c
//
// Main SUBDUE discovery functions.
//
// SUBDUE 5
//---------------------------------------------------------------------------
#include "subdue.h"
//-----------------------------------------------------------------------... | 12,078 | 34.631268 | 82 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/mpi.c | //---------------------------------------------------------------------------
// mpi.c
//
// Functions for parallel version of Subdue using MPI.
//
// Subdue 5
//---------------------------------------------------------------------------
#include <mpi.h>
#include "subdue.h"
//----- Master Process Functions
//------... | 20,417 | 31.932258 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/graph2dot_main.c | //---------------------------------------------------------------------------
// graph2dot_main.c
//
// Main functions for program to convert a Subdue graph file into
// dot format as specified in AT&T Labs GraphViz package.
//
// Usage: graph2dot <graphfilename> <dotfilename>
//
// Writes the graph defined in <graphfi... | 3,089 | 26.589286 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/test.c | //---------------------------------------------------------------------------
// test.c
//
// Functions to compute FP/FN/TP/TN/Error stats for a given set of
// substructures and a given set of example graphs.
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue... | 6,063 | 31.084656 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/gendata.c | //---------------------------------------------------------------------------
// gendata.c
//
// Generate data for iSubdue
//
// Subdue 5
//
// Independent Data: Increments are completely separate
// Connected Data: Edges span increment boundaries
//
// Generates a specified number of increments and writes each one... | 11,547 | 30.725275 | 102 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/mpi_main.c | //---------------------------------------------------------------------------
// mpi_main.c
//
// Main procedures for initiating the parallel version of SUBDUE using MPI.
//
// SUBDUE 5
//---------------------------------------------------------------------------
#include <time.h>
#include <mpi.h>
#include "subdue.h"
... | 23,938 | 31.176075 | 99 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/sgiso.c | //---------------------------------------------------------------------------
// sgiso.c
//
// These functions implement a subgraph isomorphism algorithm embodied
// in the FindInstances function. This is primarily used to find
// predefined substructures.
//
// Subdue 5
//---------------------------------------------... | 10,734 | 33.7411 | 78 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/avl.c | /* Produced by texiweb from libavl.w on 2004/10/07 at 22:24. */
/* libavl - library for manipulation of binary trees.
Copyright (C) 1998-2002 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
publishe... | 24,586 | 26.594837 | 78 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/sgiso2_main.c | //---------------------------------------------------------------------------
// sgiso_main.c
//
// Main functions for standalone subgraph isomorphism algorithm.
//
// Usage: sgiso [-dot <filename>] [-overlap] [-threshold #] g1 g2
//
// Finds and prints all instances of g1 in g2. If -overlap is given,
// then instance... | 4,853 | 28.065868 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/utility.c | //---------------------------------------------------------------------------
// utility.c
//
// Miscellaneous utility functions.
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue.h"
//------------------------------------------------------------------------... | 1,068 | 22.23913 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/gprune_main.c | //---------------------------------------------------------------------------
// gprune_main.c
//
// Main function for graph pruner, which removes vertices and edges with
// specific labels.
//
// Usage: gprune <label> <inputgraphfile> <outputgraphfile>
//
// Removes all vertices and edges with label equal to <label> i... | 7,105 | 28.363636 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/avl.h | /* Produced by texiweb from libavl.w on 2004/10/07 at 22:24. */
/* libavl - library for manipulation of binary trees.
Copyright (C) 1998-2002 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
publishe... | 4,477 | 37.603448 | 78 | h |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/incutil.c | //---------------------------------------------------------------------------
// incutil.c
//
// Set of functions to deal with adding, retrieving and manipulating data
// increments. It is important to note that the increment list does not store
// the actual data. The graph is stored as it always was, in the posGra... | 20,153 | 31.454106 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/dot.c | //---------------------------------------------------------------------------
// dot.c
//
// Functions for writing Subdue graphs in dot format. The dot format
// is part of AT&T Labs GraphViz project.
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue.h"
//... | 10,533 | 33.090615 | 78 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/subs2dot_main.c | //---------------------------------------------------------------------------
// subs2dot_main.c
//
// Main functions for program to convert a Subdue output file into
// dot format as specified in AT&T Labs GraphViz package.
//
// Usage: subs2dot <subsfilename> <dotfilename>
//
// Writes the substructures defined in <s... | 3,383 | 27.677966 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/incgraphops.c | //---------------------------------------------------------------------------
// incgraphops.c
//
// Functions for managing the reference graphs used in the discovery of
// sub instances that span increment boundaries.
//
// Much of this code was derived from the graphops code.
//
// Subdue 5
//------------------------... | 22,223 | 29.402189 | 90 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/incextend.c | //---------------------------------------------------------------------------
// incextend.c
//
// Functions for extending boundary instances with respect to a reference graph
//
// Much of this code was derived from the standard extend code
//
// Subdue 5
//-------------------------------------------------------------... | 9,129 | 34.115385 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/sgiso_main.c | //---------------------------------------------------------------------------
// sgiso_main.c
//
// Main functions for standalone subgraph isomorphism algorithm.
//
// Usage: sgiso [-dot <filename>] [-overlap] [-threshold #] g1 g2
//
// Finds and prints all instances of g1 in g2. If -overlap is given,
// then instance... | 4,848 | 28.035928 | 77 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/gm_main.c | //---------------------------------------------------------------------------
// gm_main.c
//
// Main function for standalone graph matcher.
//
// Usage: gm g1 g2
//
// The inexact graph match program computes the cost of transforming
// the larger of the input graphs into the smaller according to the
// transformation... | 3,285 | 27.824561 | 79 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/labels.c | //---------------------------------------------------------------------------
// labels.c
//
// Storage and lookup of graph vertex and edge labels.
//
// Subdue 5
//---------------------------------------------------------------------------
#include "subdue.h"
//------------------------------------------------------... | 10,726 | 30.18314 | 80 | c |
Three_Parts_Tree | Three_Parts_Tree-master/VRG/src/subdue/test_main.c | //---------------------------------------------------------------------------
// test_main.c
//
// Main functions to compute FP/FN/TP/TN/Error stats for a given set of
// substructures and a given set of example graphs.
//
// Usage: test <subsfile> <graphfile>
//
// Reads in substructures from <subsfile> and then reads... | 3,788 | 28.372093 | 77 | c |
null | openfast-main/modules/openfoam/src/OpenFOAM_Types.h | //!STARTOFREGISTRYGENERATEDFILE 'OpenFOAM_Types.h'
//!
//! WARNING This file is generated automatically by the FAST registry.
//! Do not edit. Your changes to this file will be lost.
//!
#ifndef _OpenFOAM_TYPES_H
#define _OpenFOAM_TYPES_H
#ifdef _WIN32 //define something for Windows (32-bit)
# include "stdbool.h"
... | 3,090 | 29.009709 | 70 | h |
null | openfast-main/modules/openfast-registry/src/data.h | #ifndef DATA_H
#include "registry.h"
typedef struct node_struct {
int node_kind ;
int type_type ;
char name[NAMELEN] ;
char mapsto[NAMELEN] ;
char nickname[NAMELEN] ;
struct node_struct * fields ;
struct node_struct * params ;
struct node_struct * type ;
struct ... | 4,097 | 29.355556 | 130 | h |
null | openfast-main/modules/openfast-registry/src/misc.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#ifdef _WIN32
# define rindex(X,Y) strrchr(X,Y)
# define index(X,Y) strchr(X,Y)
# include <process.h>
# define getpid _getpid
#else
# include <strings.h>
# include <sys/types.h>
# include <unistd.h>
#endif
#include "protos.h"
#include "regis... | 19,896 | 26.984529 | 134 | c |
null | openfast-main/modules/openfast-registry/src/sym.h | /***********************************************************************
COPYRIGHT
The following is a notice of limited availability of the code and
Government license and disclaimer which must be included in the
prologue of the code and in all source listings ... | 3,837 | 38.163265 | 76 | h |
null | openfast-main/modules/openfast-registry/src/sym.c | /***********************************************************************
COPYRIGHT
The following is a notice of limited availability of the code and
Government license and disclaimer which must be included in the
prologue of the code and in all source listings ... | 4,790 | 28.213415 | 82 | c |
null | openfast-main/modules/openfast-registry/src/data.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifdef _WIN32
#define rindex(X,Y) strrchr(X,Y)
#define index(X,Y) strchr(X,Y)
#define bzero(X,Y) memset(X,0,Y)
#else
# include <strings.h>
#endif
#include "registry.h"
#include "protos.h"
#include "data.h"
int
init_modname_table()
{
ModNames = NULL ;
ret... | 4,833 | 20.017391 | 123 | c |
null | openfast-main/modules/supercontroller/src/SCDataEx_Types.h | //!STARTOFREGISTRYGENERATEDFILE 'SCDataEx_Types.h'
//!
//! WARNING This file is generated automatically by the FAST registry.
//! Do not edit. Your changes to this file will be lost.
//!
#ifndef _SCDataEx_TYPES_H
#define _SCDataEx_TYPES_H
#ifdef _WIN32 //define something for Windows (32-bit)
# include "stdbool.h"
... | 1,531 | 25.413793 | 70 | h |
null | openfast-main/modules/supercontroller/src/SuperController_Types.h | //!STARTOFREGISTRYGENERATEDFILE 'SuperController_Types.h'
//!
//! WARNING This file is generated automatically by the FAST registry.
//! Do not edit. Your changes to this file will be lost.
//!
#ifndef _SuperController_TYPES_H
#define _SuperController_TYPES_H
#ifdef _WIN32 //define something for Windows (32-bit)
# ... | 2,782 | 26.83 | 70 | h |
null | openfast-main/modules/map/src/MAP_Types.h | //!STARTOFREGISTRYGENERATEDFILE 'MAP_Types.h'
//!
//! WARNING This file is generated automatically by the FAST registry.
//! Do not edit. Your changes to this file will be lost.
//!
#ifndef _MAP_TYPES_H
#define _MAP_TYPES_H
#ifdef _WIN32 //define something for Windows (32-bit)
# include "stdbool.h"
# define CALL ... | 3,524 | 27.427419 | 70 | h |
null | openfast-main/modules/map/src/mapsys.h | /****************************************************************
* Copyright (C) 2014 mdm *
* map[dot]plus[dot]plus[dot]help[at]gmail *
* *
* Licensed to the Apache Software Foundation (ASF) unde... | 6,149 | 33.550562 | 104 | h |
null | openfast-main/modules/map/src/bstring/bstraux.h | /* Copyright 2002-2010 Paul Hsieh
* This file is part of Bstrlib.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list... | 11,341 | 26.133971 | 79 | h |
null | openfast-main/modules/map/src/cminpack/lmder.c | #include "cminpack.h"
#include <math.h>
#include "cminpackP.h"
__cminpack_attr__
int __cminpack_func__(lmder)(__cminpack_decl_fcnder_mn__ void *p, int m, int n, real_mp *x,
real_mp *fvec, real_mp *fjac, int ldfjac, real_mp ftol,
real_mp xtol, real_mp gtol, int maxfev, real_mp *
diag, int mode, real_mp factor, int ... | 17,256 | 31.745731 | 92 | c |
null | openfast-main/modules/map/src/cminpack/qrsolv.c | #include "cminpack.h"
#include <math.h>
#include "cminpackP.h"
__cminpack_attr__
void __cminpack_func__(qrsolv)(int n, real_mp *r, int ldr,
const int *ipvt, const real_mp *diag, const real_mp *qtb, real_mp *x,
real_mp *sdiag, real_mp *wa)
{
/* Initialized data */
#define p5 .5
#define p25 .25
/* Local va... | 7,168 | 31.73516 | 82 | c |
null | openfast-main/modules/map/src/cminpack/enorm.c | #include "cminpack.h"
#include <math.h>
#include "cminpackP.h"
/*
About the values for rdwarf and rgiant.
The original values, both in signe-precision FORTRAN source code and in double-precision code were:
#define rdwarf 3.834e-20
#define rgiant 1.304e19
See for example:
http://www.netlib.org/slatec/src/den... | 4,713 | 28.835443 | 101 | c |
null | openfast-main/modules/map/src/cminpack/enorm_u.c | /* enorm.f -- translated by f2c (version 20020621).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
#include "minpack.h"
#include <math.h>
#define real_mp __minpack_real__
/*
About the values for rdwarf and rgiant.
The original values, both in single-precision FORTR... | 4,563 | 23.406417 | 102 | c |
null | openfast-main/modules/map/src/cminpack/dpmpar.c | #include "cminpack.h"
#include <float.h>
#include "cminpackP.h"
#define double_EPSILON DBL_EPSILON
#define double_MIN DBL_MIN
#define double_MAX DBL_MAX
#define float_EPSILON FLT_EPSILON
#define float_MIN FLT_MIN
#define float_MAX FLT_MAX
#define half_EPSILON HALF_EPSILON
#define half_MIN HALF_NRM_MIN
#define half_MAX... | 6,714 | 32.242574 | 90 | c |
null | openfast-main/modules/map/src/cminpack/lmpar.c | /* lmpar.f -- translated by f2c (version 20020621).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
#include "cminpack.h"
#include <math.h>
#include "cminpackP.h"
__cminpack_attr__
void __cminpack_func__(lmpar)(int n, real_mp *r, int ldr,
const int *ipvt, const real_mp... | 10,184 | 29.044248 | 98 | c |
null | openfast-main/modules/map/src/cminpack/cminpackP.h | /* Internal header file for cminpack, by Frederic Devernay. */
#ifndef __CMINPACKP_H__
#define __CMINPACKP_H__
#ifndef __CMINPACK_H__
#error "cminpackP.h in an internal cminpack header, and must be included after all other headers (including cminpack.h)"
#endif
#if (defined (USE_CBLAS) || defined (USE_LAPACK)) && !de... | 2,320 | 35.84127 | 120 | h |
null | openfast-main/modules/map/src/cminpack/qrfac.c | #include "cminpack.h"
#include <math.h>
#ifdef USE_LAPACK
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#endif
#include "cminpackP.h"
__cminpack_attr__
void __cminpack_func__(qrfac)(int m, int n, real_mp *a, int
lda, int pivot, int *ipvt, int lipvt, real_mp *rdiag,
real_mp *acnorm, real_mp *wa)
{
#ifd... | 8,792 | 29.744755 | 94 | c |
null | openfast-main/glue-codes/openfast/src/FastLibAPI.h | #ifndef FastLibAPI_h
#define FastLibAPI_h
#include "FAST_Library.h"
#include <string>
#include <stdlib.h>
#include <vector>
class FastLibAPI {
private:
std::string input_file_name;
int n_turbines;
int i_turb;
double dt;
double dt_out;
double t_max;
int abo... | 1,403 | 24.527273 | 109 | h |
LAT-Lara-Autotuning-Tool | LAT-Lara-Autotuning-Tool-master/examples/GameOfLife/Src/sse.h | #pragma once
#ifndef _SSE_H_
#define _SSE_H_
#include <emmintrin.h>
#include <string.h>
static const int VEC_SIZE=16;
static const __m128i EPI8_ONE = _mm_set1_epi8(1);
static const __m128i EPI8_TWO = _mm_set1_epi8(2);
static const __m128i EPI8_THREE = _mm_set1_epi8(3);
static const char ON=(char)0xff;
static const ch... | 2,973 | 38.131579 | 105 | h |
LAT-Lara-Autotuning-Tool | LAT-Lara-Autotuning-Tool-master/examples/GameOfLife/Src/Board.h | #ifndef BOARD_H_
#define BOARD_H_
// Base class for game of life study implementations
// @author: Ralf Ratering
class Board
{
public:
Board( int x_size, int y_size );
virtual ~Board() {}
virtual void seed();
virtual void next_gen() = 0;
virtual void print() const;
virtual unsigned char g... | 672 | 20.709677 | 64 | h |
gamer | gamer-master/libraries/triangle/tricall.c | /*****************************************************************************/
/* */
/* (tricall.c) */
/* */
... | 10,300 | 36.594891 | 79 | c |
gamer | gamer-master/libraries/triangle/triangle.h | /*****************************************************************************/
/* */
/* (triangle.h) */
/* */
... | 22,043 | 71.993377 | 79 | h |
gamer | gamer-master/include/gamer/stringutil.h | // This file is part of the GAMer software.
// Copyright (C) 2016-2021
// by Christopher T. Lee and contributors
//
// This library 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 2.... | 3,035 | 27.111111 | 78 | h |
gamer | gamer-master/include/gamer/EigenDiagonalization.h | // This file is part of the GAMer software.
// Copyright (C) 2016-2021
// by Christopher T. Lee and contributors
//
// This library 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 2.... | 3,529 | 31.990654 | 80 | h |
gamer | gamer-master/include/gamer/version.h | // This file is part of the GAMer software.
// Copyright (C) 2016-2021
// by Christopher T. Lee and contributors
//
// This library 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 2.... | 1,200 | 32.361111 | 78 | h |
gamer | gamer-master/include/gamer/TetMesh.h | // This file is part of the GAMer software.
// Copyright (C) 2016-2021
// by Christopher T. Lee and contributors
//
// This library 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 2.... | 9,795 | 24.378238 | 80 | h |
gamer | gamer-master/include/gamer/Vertex.h | // This file is part of the GAMer software.
// Copyright (C) 2016-2021
// by Christopher T. Lee and contributors
//
// This library 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 2.... | 9,478 | 23.814136 | 79 | h |
gamer | gamer-master/include/gamer/gamer.h | // This file is part of the GAMer software.
// Copyright (C) 2016-2021
// by Christopher T. Lee and contributors
//
// This library 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 2.... | 3,964 | 31.5 | 80 | h |
gamer | gamer-master/include/gamer/PDBReader.h | // This file is part of the GAMer software.
// Copyright (C) 2016-2021
// by Christopher T. Lee and contributors
//
// This library 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 2.... | 24,369 | 36.036474 | 80 | h |
PMTD | PMTD-master/maskrcnn_benchmark/csrc/SigmoidFocalLoss.h | #pragma once
#include "cpu/vision.h"
#ifdef WITH_CUDA
#include "cuda/vision.h"
#endif
// Interface for Python
at::Tensor SigmoidFocalLoss_forward(
const at::Tensor& logits,
const at::Tensor& targets,
const int num_classes,
const float gamma,
const float alpha) {
if (logits.type().is_cuda(... | 1,043 | 23.857143 | 96 | h |
PMTD | PMTD-master/maskrcnn_benchmark/csrc/nms.h | // Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
#pragma once
#include "cpu/vision.h"
#ifdef WITH_CUDA
#include "cuda/vision.h"
#endif
at::Tensor nms(const at::Tensor& dets,
const at::Tensor& scores,
const float threshold) {
if (dets.type().is_cuda()) {
#ifdef... | 716 | 23.724138 | 78 | h |
PMTD | PMTD-master/maskrcnn_benchmark/csrc/deform_pool.h | // Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
#pragma once
#include "cpu/vision.h"
#ifdef WITH_CUDA
#include "cuda/vision.h"
#endif
// Interface for Python
void deform_psroi_pooling_forward(
at::Tensor input,
at::Tensor bbox,
at::Tensor trans,
at::Tensor out,
at::Ten... | 1,770 | 23.943662 | 72 | h |
PMTD | PMTD-master/maskrcnn_benchmark/csrc/deform_conv.h | // Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
#pragma once
#include "cpu/vision.h"
#ifdef WITH_CUDA
#include "cuda/vision.h"
#endif
// Interface for Python
int deform_conv_forward(
at::Tensor input,
at::Tensor weight,
at::Tensor offset,
at::Tensor output,
at::Tensor c... | 4,445 | 22.277487 | 85 | h |
PMTD | PMTD-master/maskrcnn_benchmark/csrc/cuda/vision.h | // Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
#pragma once
#include <torch/extension.h>
at::Tensor SigmoidFocalLoss_forward_cuda(
const at::Tensor& logits,
const at::Tensor& targets,
const int num_classes,
const float gamma,
const float alpha);
at::Tensor Sigmoid... | 5,586 | 46.752137 | 80 | h |
PMTD | PMTD-master/maskrcnn_benchmark/csrc/cpu/vision.h | // Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
#pragma once
#include <torch/extension.h>
at::Tensor ROIAlign_forward_cpu(const at::Tensor& input,
const at::Tensor& rois,
const float spatial_scale,
... | 594 | 34 | 72 | h |
Box_Discretization_Network | Box_Discretization_Network-master/maskrcnn_benchmark/csrc/dcn_v2.h | #pragma once
#include "cpu/vision.h"
#ifdef WITH_CUDA
#include "cuda/vision.h"
#endif
at::Tensor
dcn_v2_forward(const at::Tensor &input,
const at::Tensor &weight,
const at::Tensor &bias,
const at::Tensor &offset,
const at::Tensor &mask,
const... | 5,495 | 36.643836 | 69 | h |
Box_Discretization_Network | Box_Discretization_Network-master/maskrcnn_benchmark/csrc/SigmoidFocalLoss.h | #pragma once
#include "cpu/vision.h"
#ifdef WITH_CUDA
#include "cuda/vision.h"
#endif
// Interface for Python
at::Tensor SigmoidFocalLoss_forward(
const at::Tensor& logits,
const at::Tensor& targets,
const int num_classes,
const float gamma,
const float alpha) {
if (logits.type().is_cuda(... | 1,043 | 23.857143 | 96 | h |
Box_Discretization_Network | Box_Discretization_Network-master/maskrcnn_benchmark/csrc/nms.h | // Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
#pragma once
#include "cpu/vision.h"
#ifdef WITH_CUDA
#include "cuda/vision.h"
#endif
at::Tensor nms(const at::Tensor& dets,
const at::Tensor& scores,
const float threshold) {
if (dets.type().is_cuda()) {
#ifdef... | 716 | 23.724138 | 78 | h |
Box_Discretization_Network | Box_Discretization_Network-master/maskrcnn_benchmark/csrc/cuda/vision.h | // Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
#pragma once
#include <torch/extension.h>
at::Tensor SigmoidFocalLoss_forward_cuda(
const at::Tensor& logits,
const at::Tensor& targets,
const int num_classes,
const float gamma,
const float alpha);
at::Tensor Sigmoid... | 5,256 | 42.090164 | 80 | h |
Box_Discretization_Network | Box_Discretization_Network-master/maskrcnn_benchmark/csrc/cpu/vision.h | // Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
#pragma once
#include <torch/extension.h>
at::Tensor ROIAlign_forward_cpu(const at::Tensor& input,
const at::Tensor& rois,
const float spatial_scale,
... | 3,172 | 41.878378 | 72 | h |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.