Homec4science
Diffusion Gear (master) Browse

Gear/src/peano_sub.c
73a76d71691cmaster

Last Change
Raw File

peano_sub.c
View Options

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <mpi.h>
#include "allvars.h"
#include "proto.h"
#ifdef PY_INTERFACE
static struct peano_hilbert_data
{
peanokey key;
int index;
}
*mp;
static int *Id;
/*! This function puts the particles into Peano-Hilbert order by sorting them
* according to their keys. The latter half already been computed in the
* domain decomposition. Since gas particles need to stay at the beginning of
* the particle list, they are sorted as a separate block.
*/
void peano_hilbert_orderQ(void)
{
int i;
if(ThisTask == 0)
printf("begin Peano-Hilbert order...\n");
if(N_gasQ)
{
mp = malloc(sizeof(struct peano_hilbert_data) * N_gasQ);
Id = malloc(sizeof(int) * N_gasQ);
for(i = 0; i < N_gasQ; i++)
{
mp[i].index = i;
mp[i].key = Key[i];
}
qsort(mp, N_gasQ, sizeof(struct peano_hilbert_data), compare_key);
for(i = 0; i < N_gasQ; i++)
Id[mp[i].index] = i;
reorder_gasQ();
free(Id);
free(mp);
}
if(NumPartQ - N_gasQ > 0)
{
mp = malloc(sizeof(struct peano_hilbert_data) * (NumPartQ - N_gasQ));
mp -= (N_gasQ);
Id = malloc(sizeof(int) * (NumPartQ - N_gasQ));
Id -= (N_gasQ);
for(i = N_gasQ; i < NumPartQ; i++)
{
mp[i].index = i;
mp[i].key = Key[i];
}
qsort(mp + N_gasQ, NumPartQ - N_gasQ, sizeof(struct peano_hilbert_data), compare_key);
for(i = N_gasQ; i < NumPartQ; i++)
Id[mp[i].index] = i;
reorder_particlesQ();
Id += N_gasQ;
free(Id);
mp += N_gasQ;
free(mp);
}
if(ThisTask == 0)
printf("Peano-Hilbert done.\n");
}
/*! This function brings the gas particles into the same order as the sorted
* keys. (The sort is first done only on the keys themselves and done
* directly on the gas particles in order to reduce the amount of data that
* needs to be moved in memory. Only once the order is established, the gas
* particles are rearranged, such that each particle has to be moved at most
* once.)
*/
void reorder_gasQ(void)
{
int i;
struct particle_data Psave, Psource;
struct sph_particle_data SphPsave, SphPsource;
int idsource, idsave, dest;
for(i = 0; i < N_gasQ; i++)
{
if(Id[i] != i)
{
Psource = Q[i];
SphPsource = SphQ[i];
idsource = Id[i];
dest = Id[i];
do
{
Psave = Q[dest];
SphPsave = SphQ[dest];
idsave = Id[dest];
Q[dest] = Psource;
SphQ[dest] = SphPsource;
Id[dest] = idsource;
if(dest == i)
break;
Psource = Psave;
SphPsource = SphPsave;
idsource = idsave;
dest = idsource;
}
while(1);
}
}
}
/*! This function brings the collisionless particles into the same order as
* the sorted keys. (The sort is first done only on the keys themselves and
* done directly on the particles in order to reduce the amount of data that
* needs to be moved in memory. Only once the order is established, the
* particles are rearranged, such that each particle has to be moved at most
* once.)
*/
void reorder_particlesQ(void)
{
int i;
struct particle_data Psave, Psource;
int idsource, idsave, dest;
for(i = N_gasQ; i < NumPartQ; i++)
{
if(Id[i] != i)
{
Psource = Q[i];
idsource = Id[i];
dest = Id[i];
do
{
Psave = Q[dest];
idsave = Id[dest];
Q[dest] = Psource;
Id[dest] = idsource;
if(dest == i)
break;
Psource = Psave;
idsource = idsave;
dest = idsource;
}
while(1);
}
}
}
#endif /*PY_INTERFACE*/
c4science · Help