8000 bpo-46020: Optimize long_pow for the common case by tim-one · Pull Request #30555 · python/cpython · GitHub
[go: up one dir, main page]
Skip to content

bpo-46020: Optimize long_pow for the common case #30555

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

Merged
merged 1 commit into from
Jan 12, 2022
Merged

bpo-46020: Optimize long_pow for the common case #30555

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
19 changes: 13 additions & 6 deletions Objects/longobject.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4215,8 +4215,13 @@ long_pow(PyObject *v, PyObject *w, PyObject *x)
/* k-ary values. If the exponent is large enough, table is
* precomputed so that table[i] == a**(2*i+1) % c for i in
* range(EXP_TABLE_LEN).
* Note: this is uninitialzed stack trash: don't pay to set it to known
* values unless it's needed. Instead ensure that num_table_entries is
* set to the number of entries actually filled whenever a branch to the
* Error or Done labels is possible.
*/
PyLongObject *table[EXP_TABLE_LEN] = {0};
PyLongObject *table[EXP_TABLE_LEN];
Py_ssize_t num_table_entries = 0;

A2B9 /* a, b, c = v, w, x */
CHECK_BINOP(v, w);
Expand Down Expand Up @@ -4408,10 +4413,14 @@ long_pow(PyObject *v, PyObject *w, PyObject *x)
*/
Py_INCREF(a);
table[0] = a;
num_table_entries = 1;
MULT(a, a, a2);
/* table[i] == a**(2*i + 1) % c */
for (i = 1; i < EXP_TABLE_LEN; ++i)
for (i = 1; i < EXP_TABLE_LEN; ++i) {
table[i] = NULL; /* must set to known value for MULT */
MULT(table[i-1], a2, table[i]);
++num_table_entries; /* incremented iff MULT succeeded */
}
Py_CLEAR(a2);

/* Repeatedly extract the next (no more than) EXP_WINDOW_SIZE bits
Expand Down Expand Up @@ -4472,10 +4481,8 @@ long_pow(PyObject *v, PyObject *w, PyObject *x)
Py_CLEAR(z);
/* fall through */
Done:
if (Py_SIZE(b) > HUGE_EXP_CUTOFF / PyLong_SHIFT) {
for (i = 0; i < EXP_TABLE_LEN; ++i)
Py_XDECREF(table[i]);
}
for (i = 0; i < num_table_entries; ++i)
Py_DECREF(table[i]);
Py_DECREF(a);
Py_DECREF(b);
Py_XDECREF(c);
Expand Down
0