Home
last modified time | relevance | path

Searched refs:isplt (Results 1 – 2 of 2) sorted by relevance

/external/fft2d/src/fft2d/fft2d/
Dfftsg.c807 void cftleaf(int n, int isplt, double *a, int nw, double *w); in cftfsub()
855 void cftleaf(int n, int isplt, double *a, int nw, double *w); in cftbsub()
2244 void cftleaf(int n, int isplt, double *a, int nw, double *w); in cftrec1_th()
2246 int isplt, j, k, m, n, n0, nw; in cftrec1_th() local
2263 isplt = cfttree(m, j, k, a, nw, w); in cftrec1_th()
2264 cftleaf(m, isplt, &a[j - m], nw, w); in cftrec1_th()
2273 void cftleaf(int n, int isplt, double *a, int nw, double *w); in cftrec2_th()
2275 int isplt, j, k, m, n, n0, nw; in cftrec2_th() local
2294 isplt = cfttree(m, j, k, a, nw, w); in cftrec2_th()
2295 cftleaf(m, isplt, &a[j - m], nw, w); in cftrec2_th()
[all …]
Dfftsg.f2007 integer n, nw, cfttree, isplt, j, k, m local
2018 isplt = cfttree(m, j, k, a, nw, w)
2019 call cftleaf(m, isplt, a(j - m), nw, w)
2024 integer n, j, k, nw, i, isplt, m local
2027 isplt = mod(k, 2)
2028 if (isplt .ne. 0) then
2040 isplt = mod(i, 2)
2041 if (isplt .ne. 0) then
2053 cfttree = isplt
2056 subroutine cftleaf(n, isplt, a, nw, w) argument
[all …]