Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
P
pypocketfft
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
4
Issues
4
List
Boards
Labels
Service Desk
Milestones
Merge Requests
2
Merge Requests
2
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Incidents
Environments
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Martin Reinecke
pypocketfft
Commits
32cb03a0
Commit
32cb03a0
authored
Apr 26, 2019
by
Martin Reinecke
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
avoid some unnecessary copying
parent
09034339
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
25 additions
and
12 deletions
+25
-12
bench_nd.py
bench_nd.py
+1
-1
pocketfft.cc
pocketfft.cc
+24
-11
No files found.
bench_nd.py
View file @
32cb03a0
...
...
@@ -26,7 +26,7 @@ def bench_nd_fftn(ndim, nmax, ntry, tp, nrepeat, filename=""):
t1
=
time
()
tmin_pp
=
min
(
tmin_pp
,
t1
-
t0
)
a2
=
pypocketfft
.
ifftn
(
b
,
fct
=
1.
/
a
.
size
)
assert
(
_l2error
(
a
,
a2
)
<
(
2e-15
if
tp
==
'c16'
else
6e-7
))
assert
(
_l2error
(
a
,
a2
)
<
(
2
.5
e-15
if
tp
==
'c16'
else
6e-7
))
res
.
append
(
tmin_pp
/
tmin_np
)
plt
.
title
(
"t(pypocketfft / numpy 1.17), {}D, {}, max_extent={}"
.
format
(
ndim
,
str
(
tp
),
nmax
))
plt
.
xlabel
(
"time ratio"
)
...
...
pocketfft.cc
View file @
32cb03a0
...
...
@@ -2061,13 +2061,13 @@ template<> struct VTYPE<float>
template
<
typename
T
>
struct
VTYPE
{};
template
<
>
struct
VTYPE
<
double
>
{
using
type
=
double
;
constexpr
int
vlen
=
1
;
using
type
=
double
__attribute__
((
vector_size
(
8
)))
;
static
constexpr
int
vlen
=
1
;
};
template
<
>
struct
VTYPE
<
float
>
{
using
type
=
float
;
constexpr
int
vlen
=
1
;
using
type
=
float
__attribute__
((
vector_size
(
4
)))
;
static
constexpr
int
vlen
=
1
;
};
#endif
...
...
@@ -2147,12 +2147,25 @@ template<typename T> void pocketfft_general_c(const shape_t &shape,
}
while
(
it_in
.
remaining
()
>
0
)
{
for
(
size_t
i
=
0
;
i
<
it_in
.
length
();
++
i
)
tdata
[
i
]
=
data_in
[
it_in
.
offset
()
+
i
*
it_in
.
stride
()];
forward
?
plan
->
forward
((
T
*
)
tdata
,
fct
)
:
plan
->
backward
((
T
*
)
tdata
,
fct
);
for
(
size_t
i
=
0
;
i
<
it_out
.
length
();
++
i
)
data_out
[
it_out
.
offset
()
+
i
*
it_out
.
stride
()]
=
tdata
[
i
];
if
((
data_in
==
data_out
)
&&
it_in
.
stride
()
==
1
)
// fully in-place
forward
?
plan
->
forward
((
T
*
)(
data_in
+
it_in
.
offset
()),
fct
)
:
plan
->
backward
((
T
*
)(
data_in
+
it_in
.
offset
()),
fct
);
else
if
(
it_out
.
stride
()
==
1
)
// compute FFT in output location
{
for
(
size_t
i
=
0
;
i
<
it_out
.
length
();
++
i
)
data_out
[
it_out
.
offset
()
+
i
]
=
data_in
[
it_in
.
offset
()
+
i
*
it_in
.
stride
()];
forward
?
plan
->
forward
((
T
*
)(
data_out
+
it_out
.
offset
()),
fct
)
:
plan
->
backward
((
T
*
)(
data_out
+
it_out
.
offset
()),
fct
);
}
else
{
for
(
size_t
i
=
0
;
i
<
it_in
.
length
();
++
i
)
tdata
[
i
]
=
data_in
[
it_in
.
offset
()
+
i
*
it_in
.
stride
()];
forward
?
plan
->
forward
((
T
*
)
tdata
,
fct
)
:
plan
->
backward
((
T
*
)
tdata
,
fct
);
for
(
size_t
i
=
0
;
i
<
it_out
.
length
();
++
i
)
data_out
[
it_out
.
offset
()
+
i
*
it_out
.
stride
()]
=
tdata
[
i
];
}
it_in
.
advance
();
it_out
.
advance
();
}
...
...
@@ -2658,7 +2671,7 @@ np.ndarray (np.float32 or np.float64)
entries.
)DELIM"
;
const
char
*
hartley_DS
=
R"DELIM(Performs a Hartley
FFT
.
const
char
*
hartley_DS
=
R"DELIM(Performs a Hartley
transform
.
For every requested axis, a 1D forward Fourier transform is carried out,
and the sum of real and imaginary parts of the result is stored in the output
array.
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment