Graph::~Graph()
{
- delete[] m_index;
- delete[] m_edges;
+ delete[] _index;
+ delete[] _edges;
}
Dist_Graph::~Dist_Graph()
{
- delete[] m_in;
- delete[] m_in_weights;
- delete[] m_out;
- delete[] m_out_weights;
+ delete[] _in;
+ delete[] _in_weights;
+ delete[] _out;
+ delete[] _out_weights;
}
/*******************************************************************************
******************************************************************************/
Cart::~Cart()
{
- delete[] m_dims;
- delete[] m_periodic;
- delete[] m_position;
+ delete[] _dims;
+ delete[] _periodic;
+ delete[] _position;
}
Cart::Cart(int ndims)
{
- m_nnodes = 0;
- m_ndims = ndims;
- m_dims = new int[ndims];
- m_periodic = new int[ndims];
- m_position = new int[ndims];
+ _nnodes = 0;
+ _ndims = ndims;
+ _dims = new int[ndims];
+ _periodic = new int[ndims];
+ _position = new int[ndims];
}
/* reorder is ignored, don't know what would be the consequences of a dumb reordering but neither do I see the point of
newGroup->set_mapping(oldGroup->index(i), i);
}
- m_nnodes = newSize;
+ _nnodes = newSize;
// FIXME : code duplication... See coords
nranks = newSize;
for (int i=0; i<ndims; i++) {
- m_dims[i] = dims[i];
- m_periodic[i] = periods[i];
+ _dims[i] = dims[i];
+ _periodic[i] = periods[i];
nranks = nranks / dims[i];
/* FIXME: nranks could be zero (?) */
- m_position[i] = rank / nranks;
+ _position[i] = rank / nranks;
rank = rank % nranks;
}
*comm_cart = MPI_COMM_NULL;
}
}
- m_comm=*comm_cart;
+ _comm=*comm_cart;
}
Cart* Cart::sub(const int remain_dims[], MPI_Comm *newcomm) {
- int oldNDims = m_ndims;
+ int oldNDims = _ndims;
int j = 0;
int *newDims = nullptr;
int *newPeriodic = nullptr;
// that should not segfault
for (int i = 0 ; j < newNDims ; i++) {
if(remain_dims[i]) {
- newDims[j] =m_dims[i];
- newPeriodic[j] =m_periodic[i];
+ newDims[j] =_dims[i];
+ newPeriodic[j] =_periodic[i];
j++;
}
}
}
- return new Cart(m_comm, newNDims, newDims, newPeriodic, 0, newcomm);
+ return new Cart(_comm, newNDims, newDims, newPeriodic, 0, newcomm);
}
int Cart::coords(int rank, int maxdims, int coords[]) {
- int nnodes = m_nnodes;
- for (int i = 0; i< m_ndims; i++ ) {
- nnodes = nnodes /m_dims[i];
+ int nnodes = _nnodes;
+ for (int i = 0; i< _ndims; i++ ) {
+ nnodes = nnodes /_dims[i];
coords[i] = rank / nnodes;
rank = rank % nnodes;
}
}
int Cart::get(int maxdims, int* dims, int* periods, int* coords) {
- int ndims=m_ndims < maxdims ?m_ndims : maxdims;
+ int ndims=_ndims < maxdims ?_ndims : maxdims;
for(int i = 0 ; i < ndims ; i++) {
- dims[i] =m_dims[i];
- periods[i] =m_periodic[i];
- coords[i] =m_position[i];
+ dims[i] =_dims[i];
+ periods[i] =_periodic[i];
+ coords[i] =_position[i];
}
return MPI_SUCCESS;
}
int Cart::rank(int* coords, int* rank) {
- int ndims =m_ndims;
+ int ndims =_ndims;
int coord;
*rank = 0;
int multiplier = 1;
/* The user can give us whatever coordinates he wants. If one of them is out of range, either this dimension is
* periodic, and we consider the equivalent coordinate inside the bounds, or it's not and then it's an error
*/
- if (coord >=m_dims[i]) {
- if (m_periodic[i] ) {
- coord = coord %m_dims[i];
+ if (coord >=_dims[i]) {
+ if (_periodic[i] ) {
+ coord = coord %_dims[i];
} else {
// Should I do that ?
*rank = -1;
return MPI_ERR_ARG;
}
} else if (coord < 0) {
- if(m_periodic[i]) {
- coord = coord %m_dims[i];
+ if(_periodic[i]) {
+ coord = coord %_dims[i];
if (coord)
- coord =m_dims[i] + coord;
+ coord =_dims[i] + coord;
} else {
*rank = -1;
return MPI_ERR_ARG;
}
*rank += multiplier * coord;
- multiplier *=m_dims[i];
+ multiplier *=_dims[i];
}
return MPI_SUCCESS;
}
int Cart::shift(int direction, int disp, int *rank_source, int *rank_dest) {
- int position[m_ndims];
+ int position[_ndims];
- if(m_ndims == 0) {
+ if(_ndims == 0) {
return MPI_ERR_ARG;
}
- if (m_ndims < direction) {
+ if (_ndims < direction) {
return MPI_ERR_DIMS;
}
- this->coords(m_comm->rank(),m_ndims, position);
+ this->coords(_comm->rank(),_ndims, position);
position[direction] += disp;
if(position[direction] < 0 ||
- position[direction] >=m_dims[direction]) {
- if(m_periodic[direction]) {
- position[direction] %=m_dims[direction];
+ position[direction] >=_dims[direction]) {
+ if(_periodic[direction]) {
+ position[direction] %=_dims[direction];
this->rank(position, rank_dest);
} else {
*rank_dest = MPI_PROC_NULL;
this->rank(position, rank_dest);
}
- position[direction] = m_position[direction] - disp;
- if(position[direction] < 0 || position[direction] >=m_dims[direction]) {
- if(m_periodic[direction]) {
- position[direction] %=m_dims[direction];
+ position[direction] = _position[direction] - disp;
+ if(position[direction] < 0 || position[direction] >=_dims[direction]) {
+ if(_periodic[direction]) {
+ position[direction] %=_dims[direction];
this->rank(position, rank_source);
} else {
*rank_source = MPI_PROC_NULL;
}
int Cart::dim_get(int *ndims) {
- *ndims =m_ndims;
+ *ndims =_ndims;
return MPI_SUCCESS;
}
