Gecko [ www.bigdataconsulting.fr ]

Name	Size	Permission	Date
clinic	[ DIR ]	drwxr-xr-x	2024-03-19 22:46
Python-ast.c	403.1 KB	-rw-r--r--	2024-03-19 22:46
Python-ast.gcda	73.55 KB	-rw-r--r--	2025-06-04 09:21
Python-ast.o	1.64 MB	-rw-r--r--	2025-06-04 09:22
README	62 B	-rw-r--r--	2024-03-19 22:46
_warnings.c	37.47 KB	-rw-r--r--	2024-03-19 22:46
_warnings.gcda	10.5 KB	-rw-r--r--	2025-06-04 09:21
_warnings.o	274.36 KB	-rw-r--r--	2025-06-04 09:22
asdl.c	188 B	-rw-r--r--	2024-03-19 22:46
asdl.gcda	3.98 KB	-rw-r--r--	2025-06-04 09:21
asdl.o	41.46 KB	-rw-r--r--	2025-06-04 09:22
ast.c	33.83 KB	-rw-r--r--	2024-03-19 22:46
ast.gcda	8.98 KB	-rw-r--r--	2025-06-04 09:21
ast.o	162 KB	-rw-r--r--	2025-06-04 09:22
ast_opt.c	29.15 KB	-rw-r--r--	2024-03-19 22:46
ast_opt.gcda	10.67 KB	-rw-r--r--	2025-06-04 09:21
ast_opt.o	464.67 KB	-rw-r--r--	2025-06-04 09:22
ast_unparse.c	25.85 KB	-rw-r--r--	2024-03-19 22:46
ast_unparse.gcda	9.81 KB	-rw-r--r--	2025-06-04 09:21
ast_unparse.o	204.5 KB	-rw-r--r--	2025-06-04 09:22
bltinmodule.c	88.5 KB	-rw-r--r--	2024-03-19 22:46
bltinmodule.gcda	17.87 KB	-rw-r--r--	2025-06-04 09:21
bltinmodule.o	611.81 KB	-rw-r--r--	2025-06-04 09:22
bootstrap_hash.c	18.18 KB	-rw-r--r--	2024-03-19 22:46
bootstrap_hash.gcda	4.34 KB	-rw-r--r--	2025-06-04 09:21
bootstrap_hash.o	63.27 KB	-rw-r--r--	2025-06-04 09:22
ceval.c	206.97 KB	-rw-r--r--	2024-03-19 22:46
ceval.gcda	29.57 KB	-rw-r--r--	2025-06-04 09:21
ceval.o	1.21 MB	-rw-r--r--	2025-06-04 09:22
ceval_gil.h	12.19 KB	-rw-r--r--	2024-03-19 22:46
codecs.c	45.02 KB	-rw-r--r--	2024-03-19 22:46
codecs.gcda	12.75 KB	-rw-r--r--	2025-06-04 09:21
codecs.o	329.38 KB	-rw-r--r--	2025-06-04 09:22
compile.c	233.08 KB	-rw-r--r--	2024-03-19 22:46
compile.gcda	43.95 KB	-rw-r--r--	2025-06-04 09:21
compile.o	1.79 MB	-rw-r--r--	2025-06-04 09:22
condvar.h	8.44 KB	-rw-r--r--	2024-03-19 22:46
context.c	30.93 KB	-rw-r--r--	2024-03-19 22:46
context.gcda	9.95 KB	-rw-r--r--	2025-06-04 09:21
context.o	200.97 KB	-rw-r--r--	2025-06-04 09:22
dtoa.c	78.28 KB	-rw-r--r--	2024-03-19 22:46
dtoa.gcda	10.32 KB	-rw-r--r--	2025-06-04 09:21
dtoa.o	658.92 KB	-rw-r--r--	2025-06-04 09:22
dup2.c	759 B	-rw-r--r--	2024-03-19 22:46
dynamic_annotations.c	6.59 KB	-rw-r--r--	2024-03-19 22:46
dynamic_annotations.o	2.16 KB	-rw-r--r--	2025-06-04 09:22
dynload_hpux.c	2.12 KB	-rw-r--r--	2024-03-19 22:46
dynload_shlib.c	3.47 KB	-rw-r--r--	2024-03-19 22:46
dynload_shlib.gcda	3.77 KB	-rw-r--r--	2025-06-04 09:21
dynload_shlib.o	78.03 KB	-rw-r--r--	2025-06-04 09:22
dynload_stub.c	186 B	-rw-r--r--	2024-03-19 22:46
dynload_win.c	9.97 KB	-rw-r--r--	2024-03-19 22:46
errors.c	49.3 KB	-rw-r--r--	2024-03-19 22:46
errors.gcda	11.97 KB	-rw-r--r--	2025-06-04 09:21
errors.o	604.46 KB	-rw-r--r--	2025-06-04 09:22
fileutils.c	65.03 KB	-rw-r--r--	2024-03-19 22:46
fileutils.gcda	9.9 KB	-rw-r--r--	2025-06-04 09:21
fileutils.o	235.27 KB	-rw-r--r--	2025-06-04 09:22
formatter_unicode.c	50.35 KB	-rw-r--r--	2024-03-19 22:46
formatter_unicode.gcda	7.99 KB	-rw-r--r--	2025-06-04 09:21
formatter_unicode.o	352.49 KB	-rw-r--r--	2025-06-04 09:22
frozen.c	1.31 KB	-rw-r--r--	2024-03-19 22:46
frozen.o	122.48 KB	-rw-r--r--	2025-06-04 09:22
frozen_hello.h	547 B	-rw-r--r--	2024-03-19 22:46
frozenmain.c	3.12 KB	-rw-r--r--	2024-03-19 22:46
frozenmain.o	55.7 KB	-rw-r--r--	2025-06-04 09:22
future.c	4.35 KB	-rw-r--r--	2024-03-19 22:46
future.gcda	3.91 KB	-rw-r--r--	2025-06-04 09:21
future.o	69.3 KB	-rw-r--r--	2025-06-04 09:22
getargs.c	83.81 KB	-rw-r--r--	2024-03-19 22:46
getargs.gcda	14.68 KB	-rw-r--r--	2025-06-04 09:21
getargs.o	702.23 KB	-rw-r--r--	2025-06-04 09:22
getcompiler.c	534 B	-rw-r--r--	2024-03-19 22:46
getcompiler.gcda	3.48 KB	-rw-r--r--	2025-06-04 09:21
getcompiler.o	31.86 KB	-rw-r--r--	2025-06-04 09:22
getcopyright.c	511 B	-rw-r--r--	2024-03-19 22:46
getcopyright.gcda	3.48 KB	-rw-r--r--	2025-06-04 09:21
getcopyright.o	32.27 KB	-rw-r--r--	2025-06-04 09:22
getopt.c	4.6 KB	-rw-r--r--	2024-03-19 22:46
getopt.gcda	3.82 KB	-rw-r--r--	2025-06-04 09:21
getopt.o	43.34 KB	-rw-r--r--	2025-06-04 09:22
getplatform.c	133 B	-rw-r--r--	2024-03-19 22:46
getplatform.gcda	3.48 KB	-rw-r--r--	2025-06-04 09:21
getplatform.o	31.85 KB	-rw-r--r--	2025-06-04 09:22
getversion.c	308 B	-rw-r--r--	2024-03-19 22:46
getversion.gcda	3.5 KB	-rw-r--r--	2025-06-04 09:21
getversion.o	32.93 KB	-rw-r--r--	2025-06-04 09:22
hamt.c	78.82 KB	-rw-r--r--	2024-03-19 22:46
hamt.gcda	11.18 KB	-rw-r--r--	2025-06-04 09:21
hamt.o	257.84 KB	-rw-r--r--	2025-06-04 09:22
hashtable.c	11.17 KB	-rw-r--r--	2024-03-19 22:46
hashtable.gcda	5.66 KB	-rw-r--r--	2025-06-04 09:21
hashtable.o	84.36 KB	-rw-r--r--	2025-06-04 09:22
import.c	62.01 KB	-rw-r--r--	2024-03-19 22:46
import.gcda	17.11 KB	-rw-r--r--	2025-06-04 09:21
import.o	461.4 KB	-rw-r--r--	2025-06-04 09:22
importdl.c	7.32 KB	-rw-r--r--	2024-03-19 22:46
importdl.gcda	4.35 KB	-rw-r--r--	2025-06-04 09:21
importdl.h	487 B	-rw-r--r--	2024-03-19 22:46
importdl.o	71.44 KB	-rw-r--r--	2025-06-04 09:22
importlib.h	99.12 KB	-rw-r--r--	2024-03-19 22:46
importlib_external.h	147.15 KB	-rw-r--r--	2024-03-19 22:46
importlib_zipimport.h	57.35 KB	-rw-r--r--	2024-03-19 22:46
initconfig.c	89.33 KB	-rw-r--r--	2024-03-19 22:46
initconfig.gcda	20.45 KB	-rw-r--r--	2025-06-04 09:21
initconfig.o	482.04 KB	-rw-r--r--	2025-06-04 09:22
makeopcodetargets.py	1.55 KB	-rwxr-xr-x	2024-03-19 22:46
marshal.c	48.33 KB	-rw-r--r--	2024-03-19 22:46
marshal.gcda	13.91 KB	-rw-r--r--	2025-06-04 09:21
marshal.o	325.08 KB	-rw-r--r--	2025-06-04 09:22
modsupport.c	18.12 KB	-rw-r--r--	2024-03-19 22:46
modsupport.gcda	6.66 KB	-rw-r--r--	2025-06-04 09:21
modsupport.o	243.86 KB	-rw-r--r--	2025-06-04 09:22
mysnprintf.c	2.49 KB	-rw-r--r--	2024-03-19 22:46
mysnprintf.gcda	3.56 KB	-rw-r--r--	2025-06-04 09:21
mysnprintf.o	39.3 KB	-rw-r--r--	2025-06-04 09:22
mystrtoul.c	8.09 KB	-rw-r--r--	2024-03-19 22:46
mystrtoul.gcda	3.93 KB	-rw-r--r--	2025-06-04 09:21
mystrtoul.o	64.22 KB	-rw-r--r--	2025-06-04 09:22
opcode_targets.h	6.31 KB	-rw-r--r--	2024-03-19 22:46
pathconfig.c	19.75 KB	-rw-r--r--	2024-03-19 22:46
pathconfig.gcda	7.42 KB	-rw-r--r--	2025-06-04 09:21
pathconfig.o	110.59 KB	-rw-r--r--	2025-06-04 09:22
preconfig.c	25.21 KB	-rw-r--r--	2024-03-19 22:46
preconfig.gcda	6.76 KB	-rw-r--r--	2025-06-04 09:21
preconfig.o	140.21 KB	-rw-r--r--	2025-06-04 09:22
pyarena.c	5.52 KB	-rw-r--r--	2024-03-19 22:46
pyarena.gcda	3.97 KB	-rw-r--r--	2025-06-04 09:21
pyarena.o	48.03 KB	-rw-r--r--	2025-06-04 09:22
pyctype.c	7.73 KB	-rw-r--r--	2024-03-19 22:46
pyctype.o	32.77 KB	-rw-r--r--	2025-06-04 09:22
pyfpe.c	345 B	-rw-r--r--	2024-03-19 22:46
pyfpe.o	4.01 KB	-rw-r--r--	2025-06-04 09:22
pyhash.c	13.45 KB	-rw-r--r--	2024-03-19 22:46
pyhash.gcda	4.16 KB	-rw-r--r--	2025-06-04 09:21
pyhash.o	70.6 KB	-rw-r--r--	2025-06-04 09:22
pylifecycle.c	80.77 KB	-rw-r--r--	2024-03-19 22:46
pylifecycle.gcda	15.06 KB	-rw-r--r--	2025-06-04 09:21
pylifecycle.o	390.44 KB	-rw-r--r--	2025-06-04 09:22
pymath.c	1.6 KB	-rw-r--r--	2024-03-19 22:46
pymath.gcda	3.54 KB	-rw-r--r--	2025-06-04 09:21
pymath.o	32.34 KB	-rw-r--r--	2025-06-04 09:22
pystate.c	56.36 KB	-rw-r--r--	2024-03-19 22:46
pystate.gcda	12.61 KB	-rw-r--r--	2025-06-04 09:21
pystate.o	238.3 KB	-rw-r--r--	2025-06-04 09:22
pystrcmp.c	753 B	-rw-r--r--	2024-03-19 22:46
pystrcmp.gcda	3.62 KB	-rw-r--r--	2025-06-04 09:21
pystrcmp.o	37.12 KB	-rw-r--r--	2025-06-04 09:22
pystrhex.c	5.24 KB	-rw-r--r--	2024-03-19 22:46
pystrhex.gcda	4.09 KB	-rw-r--r--	2025-06-04 09:21
pystrhex.o	55.29 KB	-rw-r--r--	2025-06-04 09:22
pystrtod.c	40.06 KB	-rw-r--r--	2024-03-19 22:46
pystrtod.gcda	5.14 KB	-rw-r--r--	2025-06-04 09:21
pystrtod.o	96.01 KB	-rw-r--r--	2025-06-04 09:22
pythonrun.c	42.71 KB	-rw-r--r--	2024-03-19 22:46
pythonrun.gcda	11.89 KB	-rw-r--r--	2025-06-04 09:21
pythonrun.o	282.42 KB	-rw-r--r--	2025-06-04 09:22
pytime.c	28.68 KB	-rw-r--r--	2024-03-19 22:46
pytime.gcda	7.47 KB	-rw-r--r--	2025-06-04 09:21
pytime.o	120.86 KB	-rw-r--r--	2025-06-04 09:22
stdlib_module_names.h	3.49 KB	-rw-r--r--	2024-03-19 22:46
structmember.c	8.83 KB	-rw-r--r--	2024-03-19 22:46
structmember.gcda	4.83 KB	-rw-r--r--	2025-06-04 09:21
structmember.o	73.16 KB	-rw-r--r--	2025-06-04 09:22
suggestions.c	8.46 KB	-rw-r--r--	2024-03-19 22:46
suggestions.gcda	4.29 KB	-rw-r--r--	2025-06-04 09:21
suggestions.o	57.27 KB	-rw-r--r--	2025-06-04 09:22
symtable.c	72.25 KB	-rw-r--r--	2024-03-19 22:46
symtable.gcda	15.05 KB	-rw-r--r--	2025-06-04 09:21
symtable.o	638.03 KB	-rw-r--r--	2025-06-04 09:22
sysmodule.c	94.57 KB	-rw-r--r--	2024-03-19 22:46
sysmodule.gcda	19.89 KB	-rw-r--r--	2025-06-04 09:21
sysmodule.o	579.73 KB	-rw-r--r--	2025-06-04 09:22
thread.c	5.8 KB	-rw-r--r--	2024-03-19 22:46
thread.gcda	6.58 KB	-rw-r--r--	2025-06-04 09:21
thread.o	133.44 KB	-rw-r--r--	2025-06-04 09:22
thread_nt.h	12.16 KB	-rw-r--r--	2024-03-19 22:46
thread_pthread.h	25.32 KB	-rw-r--r--	2024-03-19 22:46
traceback.c	25.55 KB	-rw-r--r--	2024-03-19 22:46
traceback.gcda	8.3 KB	-rw-r--r--	2025-06-04 09:21
traceback.o	169.99 KB	-rw-r--r--	2025-06-04 09:22
wordcode_helpers.h	1.25 KB	-rw-r--r--	2024-03-19 22:46

Rename

#include "Python.h"
#include "frameobject.h"

#include "pycore_pyerrors.h"

#define MAX_CANDIDATE_ITEMS 750
#define MAX_STRING_SIZE 40

#define MOVE_COST 2
#define CASE_COST 1

#define LEAST_FIVE_BITS(n) ((n) & 31)

static inline int
substitution_cost(char a, char b)
{
    if (LEAST_FIVE_BITS(a) != LEAST_FIVE_BITS(b)) {
        // Not the same, not a case flip.
        return MOVE_COST;
    }
    if (a == b) {
        return 0;
    }
    if ('A' <= a && a <= 'Z') {
        a += ('a' - 'A');
    }
    if ('A' <= b && b <= 'Z') {
        b += ('a' - 'A');
    }
    if (a == b) {
        return CASE_COST;
    }
    return MOVE_COST;
}

/* Calculate the Levenshtein distance between string1 and string2 */
static Py_ssize_t
levenshtein_distance(const char *a, size_t a_size,
                     const char *b, size_t b_size,
                     size_t max_cost)
{
    static size_t buffer[MAX_STRING_SIZE];

// Both strings are the same (by identity)
    if (a == b) {
        return 0;
    }

// Trim away common affixes.
    while (a_size && b_size && a[0] == b[0]) {
        a++; a_size--;
        b++; b_size--;
    }
    while (a_size && b_size && a[a_size-1] == b[b_size-1]) {
        a_size--;
        b_size--;
    }
    if (a_size == 0 || b_size == 0) {
        return (a_size + b_size) * MOVE_COST;
    }
    if (a_size > MAX_STRING_SIZE || b_size > MAX_STRING_SIZE) {
        return max_cost + 1;
    }

// Prefer shorter buffer
    if (b_size < a_size) {
        const char *t = a; a = b; b = t;
        size_t t_size = a_size; a_size = b_size; b_size = t_size;
    }

// quick fail when a match is impossible.
    if ((b_size - a_size) * MOVE_COST > max_cost) {
        return max_cost + 1;
    }

// Instead of producing the whole traditional len(a)-by-len(b)
    // matrix, we can update just one row in place.
    // Initialize the buffer row
    for (size_t i = 0; i < a_size; i++) {
        // cost from b[:0] to a[:i+1]
        buffer[i] = (i + 1) * MOVE_COST;
    }

size_t result = 0;
    for (size_t b_index = 0; b_index < b_size; b_index++) {
        char code = b[b_index];
        // cost(b[:b_index], a[:0]) == b_index * MOVE_COST
        size_t distance = result = b_index * MOVE_COST;
        size_t minimum = SIZE_MAX;
        for (size_t index = 0; index < a_size; index++) {

// cost(b[:b_index+1], a[:index+1]) = min(
            //     // 1) substitute
            //     cost(b[:b_index], a[:index])
            //         + substitution_cost(b[b_index], a[index]),
            //     // 2) delete from b
            //     cost(b[:b_index], a[:index+1]) + MOVE_COST,
            //     // 3) delete from a
            //     cost(b[:b_index+1], a[index]) + MOVE_COST
            // )

// 1) Previous distance in this row is cost(b[:b_index], a[:index])
            size_t substitute = distance + substitution_cost(code, a[index]);
            // 2) cost(b[:b_index], a[:index+1]) from previous row
            distance = buffer[index];
            // 3) existing result is cost(b[:b_index+1], a[index])

size_t insert_delete = Py_MIN(result, distance) + MOVE_COST;
            result = Py_MIN(insert_delete, substitute);

// cost(b[:b_index+1], a[:index+1])
            buffer[index] = result;
            if (result < minimum) {
                minimum = result;
            }
        }
        if (minimum > max_cost) {
            // Everything in this row is too big, so bail early.
            return max_cost + 1;
        }
    }
    return result;
}

static inline PyObject *
calculate_suggestions(PyObject *dir,
                      PyObject *name)
{
    assert(!PyErr_Occurred());
    assert(PyList_CheckExact(dir));

Py_ssize_t dir_size = PyList_GET_SIZE(dir);
    if (dir_size >= MAX_CANDIDATE_ITEMS) {
        return NULL;
    }

Py_ssize_t suggestion_distance = PY_SSIZE_T_MAX;
    PyObject *suggestion = NULL;
    Py_ssize_t name_size;
    const char *name_str = PyUnicode_AsUTF8AndSize(name, &name_size);
    if (name_str == NULL) {
        return NULL;
    }

for (int i = 0; i < dir_size; ++i) {
        PyObject *item = PyList_GET_ITEM(dir, i);
        Py_ssize_t item_size;
        const char *item_str = PyUnicode_AsUTF8AndSize(item, &item_size);
        if (item_str == NULL) {
            return NULL;
        }
        if (PyUnicode_CompareWithASCIIString(name, item_str) == 0) {
            continue;
        }
        // No more than 1/3 of the involved characters should need changed.
        Py_ssize_t max_distance = (name_size + item_size + 3) * MOVE_COST / 6;
        // Don't take matches we've already beaten.
        max_distance = Py_MIN(max_distance, suggestion_distance - 1);
        Py_ssize_t current_distance =
            levenshtein_distance(name_str, name_size,
                                 item_str, item_size, max_distance);
        if (current_distance > max_distance) {
            continue;
        }
        if (!suggestion || current_distance < suggestion_distance) {
            suggestion = item;
            suggestion_distance = current_distance;
        }
    }
    Py_XINCREF(suggestion);
    return suggestion;
}

static PyObject *
offer_suggestions_for_attribute_error(PyAttributeErrorObject *exc)
{
    PyObject *name = exc->name; // borrowed reference
    PyObject *obj = exc->obj; // borrowed reference

// Abort if we don't have an attribute name or we have an invalid one
    if (name == NULL || obj == NULL || !PyUnicode_CheckExact(name)) {
        return NULL;
    }

PyObject *dir = PyObject_Dir(obj);
    if (dir == NULL) {
        return NULL;
    }

PyObject *suggestions = calculate_suggestions(dir, name);
    Py_DECREF(dir);
    return suggestions;
}

static PyObject *
offer_suggestions_for_name_error(PyNameErrorObject *exc)
{
    PyObject *name = exc->name; // borrowed reference
    PyTracebackObject *traceback = (PyTracebackObject *) exc->traceback; // borrowed reference
    // Abort if we don't have a variable name or we have an invalid one
    // or if we don't have a traceback to work with
    if (name == NULL || !PyUnicode_CheckExact(name) ||
        traceback == NULL || !Py_IS_TYPE(traceback, &PyTraceBack_Type)
    ) {
        return NULL;
    }

// Move to the traceback of the exception
    while (1) {
        PyTracebackObject *next = traceback->tb_next;
        if (next == NULL || !Py_IS_TYPE(next, &PyTraceBack_Type)) {
            break;
        }
        else {
            traceback = next;
        }
    }

PyFrameObject *frame = traceback->tb_frame;
    assert(frame != NULL);
    PyCodeObject *code = frame->f_code;
    assert(code != NULL && code->co_varnames != NULL);
    PyObject *dir = PySequence_List(code->co_varnames);
    if (dir == NULL) {
        return NULL;
    }

PyObject *suggestions = calculate_suggestions(dir, name);
    Py_DECREF(dir);
    if (suggestions != NULL) {
        return suggestions;
    }

dir = PySequence_List(frame->f_globals);
    if (dir == NULL) {
        return NULL;
    }
    suggestions = calculate_suggestions(dir, name);
    Py_DECREF(dir);
    if (suggestions != NULL) {
        return suggestions;
    }

dir = PySequence_List(frame->f_builtins);
    if (dir == NULL) {
        return NULL;
    }
    suggestions = calculate_suggestions(dir, name);
    Py_DECREF(dir);

return suggestions;
}

// Offer suggestions for a given exception. Returns a python string object containing the
// suggestions. This function returns NULL if no suggestion was found or if an exception happened,
// users must call PyErr_Occurred() to disambiguate.
PyObject *
_Py_Offer_Suggestions(PyObject *exception)
{
    PyObject *result = NULL;
    assert(!PyErr_Occurred());
    if (Py_IS_TYPE(exception, (PyTypeObject*)PyExc_AttributeError)) {
        result = offer_suggestions_for_attribute_error((PyAttributeErrorObject *) exception);
    } else if (Py_IS_TYPE(exception, (PyTypeObject*)PyExc_NameError)) {
        result = offer_suggestions_for_name_error((PyNameErrorObject *) exception);
    }
    return result;
}

Py_ssize_t
_Py_UTF8_Edit_Cost(PyObject *a, PyObject *b, Py_ssize_t max_cost)
{
    assert(PyUnicode_Check(a) && PyUnicode_Check(b));
    Py_ssize_t size_a, size_b;
    const char *utf8_a = PyUnicode_AsUTF8AndSize(a, &size_a);
    if (utf8_a == NULL) {
        return -1;
    }
    const char *utf8_b = PyUnicode_AsUTF8AndSize(b, &size_b);
    if (utf8_b == NULL) {
        return -1;
    }
    if (max_cost == -1) {
        max_cost = MOVE_COST * Py_MAX(size_a, size_b);
    }
    return levenshtein_distance(utf8_a, size_a, utf8_b, size_b, max_cost);
}