bpo-45753: Make recursion checks more efficient. (GH-29524)

* Uses recursion remaining, instead of recursion depth to speed up check against recursion limit.
This commit is contained in:
Mark Shannon 2021-11-16 11:01:57 +00:00 committed by GitHub
parent 9bf2cbc4c4
commit b931077375
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
10 changed files with 50 additions and 43 deletions

View file

@ -636,9 +636,9 @@ new_threadstate(PyInterpreterState *interp, int init)
tstate->interp = interp;
tstate->recursion_depth = 0;
tstate->recursion_limit = interp->ceval.recursion_limit;
tstate->recursion_remaining = interp->ceval.recursion_limit;
tstate->recursion_headroom = 0;
tstate->stackcheck_counter = 0;
tstate->tracing = 0;
tstate->root_cframe.use_tracing = 0;
tstate->root_cframe.current_frame = NULL;