8000 bpo-46920: Remove code made dead long ago with #if 0 by arhadthedev · Pull Request #31681 · python/cpython · GitHub
[go: up one dir, main page]
Skip to content

bpo-46920: Remove code made dead long ago with #if 0 #31681

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 5 commits into from
Closed

bpo-46920: Remove code made dead long ago with #if 0 #31681

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
a0693cf
Remove code made dead long ago with #if 0
arhadthedev Mar 4, 2022
b4f6f13
Restore an original copy of libmpdec
arhadthedev Mar 5, 2022
f9b4ef0
Restore an original copy of libffi
arhadthedev Mar 5, 2022
e6c3092
Restore dump_* for bytecode debugging
arhadthedev Mar 8, 2022
9927513
Remove code commented out 14-16 years ago
arhadthedev Mar 8, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Restore an original copy of libmpdec
  • Loading branch information
@arhadthedev
arhadthedev committed Mar 5, 2022
commit b4f6f1385f8c46b6f4bbc86648705a4f6e686004
14 changes: 14 additions & 0 deletions Modules/_decimal/libmpdec/fourstep.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -186,6 +186,13 @@ four_step_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
}
}

#if 0
/* An unordered transform is sufficient for convolution. */
/* Transpose the matrix. */
#include "transpose.h"
transpose_3xpow2(a, R, C);
#endif

return 1;
}

Expand All @@ -210,6 +217,13 @@ inv_four_step_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
assert(n <= 3*MPD_MAXTRANSFORM_2N);


#if 0
/* An unordered transform is sufficient for convolution. */
/* Transpose the matrix, producing an R*C matrix. */
#include "transpose.h"
transpose_3xpow2(a, C, R);
#endif

/* Length C transform on the rows. */
for (s = a; s < a+n; s += C) {
if (!inv_six_step_fnt(s, C, modnum)) {
Expand Down
16 changes: 16 additions & 0 deletions Modules/_decimal/libmpdec/sixstep.c
8000
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -117,6 +117,14 @@ six_step_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
}
mpd_free(tparams);

#if 0
/* An unordered transform is sufficient for convolution. */
/* Transpose the matrix. */
if (!transpose_pow2(a, R, C)) {
return 0;
}
#endif

return 1;
}

Expand Down Expand Up @@ -146,6 +154,14 @@ inv_six_step_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
R = ((mpd_size_t)1) << (log2n - (log2n / 2)); /* number of rows */


#if 0
/* An unordered transform is sufficient for convolution. */
/* Transpose the matrix, producing an R*C matrix. */
if (!transpose_pow2(a, C, R)) {
return 0;
}
#endif

/* Length C transform on the rows. */
if ((tparams = _mpd_init_fnt_params(C, 1, modnum)) == NULL) {
return 0;
Expand Down
0