Home
last modified time | relevance | path

Searched refs:sortsched (Results 1 – 8 of 8) sorted by relevance

/dports/math/fftw3-float/fftw-3.3.9/mpi/
H A Dtestsched.c247 int *sortsched, i; in sort1_comm_sched() local
248 sortsched = (int *) malloc(npes * sizeof(int) * 2); in sort1_comm_sched()
249 fill1_comm_sched(sortsched, sortpe, npes); in sort1_comm_sched()
252 sortsched[npes + sortsched[i]] = sched[i]; in sort1_comm_sched()
255 sortsched[2*npes - 1 - sortsched[i]] = sched[i]; in sort1_comm_sched()
257 sched[i] = sortsched[npes + i]; in sort1_comm_sched()
258 free(sortsched); in sort1_comm_sched()
H A Dtranspose-pairwise.c255 int *sortsched, i; in sort1_comm_sched() local
256 sortsched = (int *) MALLOC(npes * sizeof(int) * 2, OTHER); in sort1_comm_sched()
257 fill1_comm_sched(sortsched, sortpe, npes); in sort1_comm_sched()
260 sortsched[npes + sortsched[i]] = sched[i]; in sort1_comm_sched()
263 sortsched[2*npes - 1 - sortsched[i]] = sched[i]; in sort1_comm_sched()
265 sched[i] = sortsched[npes + i]; in sort1_comm_sched()
266 X(ifree)(sortsched); in sort1_comm_sched()
/dports/math/fftw3/fftw-3.3.9/mpi/
H A Dtestsched.c247 int *sortsched, i; in sort1_comm_sched() local
248 sortsched = (int *) malloc(npes * sizeof(int) * 2); in sort1_comm_sched()
249 fill1_comm_sched(sortsched, sortpe, npes); in sort1_comm_sched()
252 sortsched[npes + sortsched[i]] = sched[i]; in sort1_comm_sched()
255 sortsched[2*npes - 1 - sortsched[i]] = sched[i]; in sort1_comm_sched()
257 sched[i] = sortsched[npes + i]; in sort1_comm_sched()
258 free(sortsched); in sort1_comm_sched()
H A Dtranspose-pairwise.c255 int *sortsched, i; in sort1_comm_sched() local
256 sortsched = (int *) MALLOC(npes * sizeof(int) * 2, OTHER); in sort1_comm_sched()
257 fill1_comm_sched(sortsched, sortpe, npes); in sort1_comm_sched()
260 sortsched[npes + sortsched[i]] = sched[i]; in sort1_comm_sched()
263 sortsched[2*npes - 1 - sortsched[i]] = sched[i]; in sort1_comm_sched()
265 sched[i] = sortsched[npes + i]; in sort1_comm_sched()
266 X(ifree)(sortsched); in sort1_comm_sched()
/dports/math/fftw3-long/fftw-3.3.9/mpi/
H A Dtestsched.c247 int *sortsched, i; in sort1_comm_sched() local
248 sortsched = (int *) malloc(npes * sizeof(int) * 2); in sort1_comm_sched()
249 fill1_comm_sched(sortsched, sortpe, npes); in sort1_comm_sched()
252 sortsched[npes + sortsched[i]] = sched[i]; in sort1_comm_sched()
255 sortsched[2*npes - 1 - sortsched[i]] = sched[i]; in sort1_comm_sched()
257 sched[i] = sortsched[npes + i]; in sort1_comm_sched()
258 free(sortsched); in sort1_comm_sched()
H A Dtranspose-pairwise.c255 int *sortsched, i; in sort1_comm_sched() local
256 sortsched = (int *) MALLOC(npes * sizeof(int) * 2, OTHER); in sort1_comm_sched()
257 fill1_comm_sched(sortsched, sortpe, npes); in sort1_comm_sched()
260 sortsched[npes + sortsched[i]] = sched[i]; in sort1_comm_sched()
263 sortsched[2*npes - 1 - sortsched[i]] = sched[i]; in sort1_comm_sched()
265 sched[i] = sortsched[npes + i]; in sort1_comm_sched()
266 X(ifree)(sortsched); in sort1_comm_sched()
/dports/math/fftw3-quad/fftw-3.3.9/mpi/
H A Dtestsched.c247 int *sortsched, i; in sort1_comm_sched() local
248 sortsched = (int *) malloc(npes * sizeof(int) * 2); in sort1_comm_sched()
249 fill1_comm_sched(sortsched, sortpe, npes); in sort1_comm_sched()
252 sortsched[npes + sortsched[i]] = sched[i]; in sort1_comm_sched()
255 sortsched[2*npes - 1 - sortsched[i]] = sched[i]; in sort1_comm_sched()
257 sched[i] = sortsched[npes + i]; in sort1_comm_sched()
258 free(sortsched); in sort1_comm_sched()
H A Dtranspose-pairwise.c255 int *sortsched, i; in sort1_comm_sched() local
256 sortsched = (int *) MALLOC(npes * sizeof(int) * 2, OTHER); in sort1_comm_sched()
257 fill1_comm_sched(sortsched, sortpe, npes); in sort1_comm_sched()
260 sortsched[npes + sortsched[i]] = sched[i]; in sort1_comm_sched()
263 sortsched[2*npes - 1 - sortsched[i]] = sched[i]; in sort1_comm_sched()
265 sched[i] = sortsched[npes + i]; in sort1_comm_sched()
266 X(ifree)(sortsched); in sort1_comm_sched()