#include <stdint.h>
#include <limits.h>
Go to the source code of this file.
|
| int | gen_graph_edges (graph_gen_data_t *ggi, graph_gen_aux_data_t *ggaux) |
| |
| int | run_bfs (dist_graph_t *g, uint64_t root, uint64_t *pred, uint64_t *pred_array_size_ptr, uint64_t *nvisited) |
| |
| int | run_bfs_threaded (dist_graph_t *g, uint64_t root, uint64_t *pred, uint64_t *pred_array_size_ptr, uint64_t *nvisited) |
| |
| int | run_bfs_2Dgraph (dist_graph_t *g, uint64_t root, uint64_t *pred, uint64_t *pred_array_size_ptr, uint64_t *nvisited) |
| |
| int | run_bfs_2Dgraph_threaded (dist_graph_t *g, uint64_t root, uint64_t *pred, uint64_t *pred_array_size_ptr, uint64_t *nvisited) |
| |
| int | create_dist_graph (const uint64_t num_edges, uint32_t *edges, dist_graph_t *g) |
| |
| int | create_2Ddist_graph (const uint64_t num_edges, uint32_t *edges, dist_graph_t *g) |
| |
| int | free_graph (dist_graph_t *g) |
| |
| int | validate_bfs_result (dist_graph_t *g, uint64_t root, uint64_t *pred, uint64_t pred_array_size) |
| |
| int | validate_bfs_result_threaded (dist_graph_t *g, uint64_t root, uint64_t *pred, uint64_t pred_array_size) |
| |
| int | find_bfs_start_vertices (int num_bfs_roots, dist_graph_t *g, uint64_t *bfs_roots) |
| |
| double | get_seconds () |
| |
| int | local_parallel_quicksort (void *data, int64_t n, size_t elem_size, int(*cmpfn)(const void *x, const void *y)) |
| |
| void | get_statistics (const double *x, int n, double *r) |
| |
◆ _mm_free
| #define _mm_free |
( |
|
a | ) |
free((a)) |
◆ _mm_malloc
| #define _mm_malloc |
( |
|
a, |
|
|
|
b |
|
) |
| malloc((a)) |
◆ IDEAL_ALIGNMENT
| #define IDEAL_ALIGNMENT 16 |
◆ LOCAL_QUEUE_SIZE
| #define LOCAL_QUEUE_SIZE 512 |
◆ LOCAL_SENDBUF_SIZE
| #define LOCAL_SENDBUF_SIZE 64 |
◆ MAX_NUMPROCS
| #define MAX_NUMPROCS 1024 |
◆ PRED_CACHE_BYPASS
| #define PRED_CACHE_BYPASS 1 |
◆ PROC_ASSERT_CHECK
| #define PROC_ASSERT_CHECK 1 |
◆ REPLICATE_D
◆ ROOT_VERT_RNG_SEED
| #define ROOT_VERT_RNG_SEED 2323232 |
◆ SAMEPROC_NOREAD
| #define SAMEPROC_NOREAD 1 |
◆ STORE_PRED
◆ TIME_BFS_SUBROUTINES
| #define TIME_BFS_SUBROUTINES 1 |
◆ eid_t
◆ vid_t
◆ create_2Ddist_graph()
◆ create_dist_graph()
◆ find_bfs_start_vertices()
◆ free_graph()
◆ gen_graph_edges()
◆ get_seconds()
◆ get_statistics()
| void get_statistics |
( |
const double * |
x, |
|
|
int |
n, |
|
|
double * |
r |
|
) |
| |
◆ local_parallel_quicksort()
| int local_parallel_quicksort |
( |
void * |
data, |
|
|
int64_t |
n, |
|
|
size_t |
elem_size, |
|
|
int(*)(const void *x, const void *y) |
cmpfn |
|
) |
| |
◆ run_bfs()
◆ run_bfs_2Dgraph()
◆ run_bfs_2Dgraph_threaded()
◆ run_bfs_threaded()
◆ validate_bfs_result()
◆ validate_bfs_result_threaded()
◆ nprocs
◆ rank