#include "rheolef/distributor.h"
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <stdarg.h>
#include <limits.h>
#include <time.h>
#include <assert.h>
Go to the source code of this file.
Namespaces |
| namespace | rheolef |
| | irheostream, orheostream - large data streams
|
Macros |
| #define | IDX_DATATYPE MPI_INT |
| #define | UNBALANCE_FRACTION 1.05 |
| #define | DBG_INFO 2 /* Perform timing analysis */ |
| #define | PMV3_OPTION_DBGLVL 1 |
| #define | PMV3_OPTION_SEED 2 |
| #define | MAXNCON 12 |
| #define | MAXLINE 8192 |
| #define | amax(a, b) ((a) >= (b) ? (a) : (b)) |
| #define | icopy(n, a, b) memcpy((b), (a), sizeof(int)*(n)) |
| #define | idxcopy(n, a, b) memcpy((b), (a), sizeof(my_idxtype)*(n)) |
| #define | SHIFTCSR(i, n, a) |
Functions |
| void | rheolef::geo_partition_scotch (my_idxtype *elmdist, my_idxtype *eptr, vector< my_idxtype > &eind, my_idxtype *elmwgt, int *ncon, int *ncommonnodes, int *nparts, float *tpwgts, float *ubvec, int *edgecut, my_idxtype *part, const mpi::communicator &comm) |
| template<class Size , class RandomIOIterator > |
| static void | rheolef::init_csr_ptr (Size n, const RandomIOIterator &aptr) |
| template<class Size , class RandomIOIterator > |
| static void | rheolef::shift_csr_ptr (Size n, const RandomIOIterator &aptr) |
| int | rheolef::idxamin (int n, const std::vector< my_idxtype > &x) |
| int | rheolef::idxamax (int n, const std::vector< my_idxtype > &x) |
Macro Definition Documentation
| #define IDX_DATATYPE MPI_INT |
| #define UNBALANCE_FRACTION 1.05 |
| #define DBG_INFO 2 /* Perform timing analysis */ |
| #define PMV3_OPTION_DBGLVL 1 |
| #define PMV3_OPTION_SEED 2 |
| #define amax |
( |
|
a, |
|
|
|
b |
|
) |
| ((a) >= (b) ? (a) : (b)) |
| #define icopy |
( |
|
n, |
|
|
|
a, |
|
|
|
b |
|
) |
| memcpy((b), (a), sizeof(int)*(n)) |
| #define idxcopy |
( |
|
n, |
|
|
|
a, |
|
|
|
b |
|
) |
| memcpy((b), (a), sizeof(my_idxtype)*(n)) |
| #define SHIFTCSR |
( |
|
i, |
|
|
|
n, |
|
|
|
a |
|
) |
| |
Value:do { \
for (i=n; i>0; i--) a[i] = a[i-1]; \
a[0] = 0; \
} while(0)
Definition at line 69 of file geo_partition_scotch.h.