static int set_table_resize(PySetObject *, Py_ssize_t);
static int
-set_add_entry(PySetObject *so, PyObject *key, Py_hash_t hash)
+_set_add_entry(PySetObject *so, PyObject *key, Py_hash_t hash)
{
setentry *table = so->table;
setentry *freeslot;
if (cmp < 0) /* unlikely */
return -1;
if (table != so->table || entry->key != startkey) /* unlikely */
- return set_add_entry(so, key, hash);
+ return _set_add_entry(so, key, hash);
if (cmp > 0) /* likely */
goto found_active;
mask = so->mask; /* help avoid a register spill */
if (cmp < 0)
return -1;
if (table != so->table || entry->key != startkey)
- return set_add_entry(so, key, hash);
+ return _set_add_entry(so, key, hash);
if (cmp > 0)
goto found_active;
mask = so->mask;
found_unused_or_dummy:
if (freeslot == NULL)
goto found_unused;
- Py_INCREF(key);
so->used++;
freeslot->key = key;
freeslot->hash = hash;
return 0;
found_unused:
- Py_INCREF(key);
so->fill++;
so->used++;
entry->key = key;
return 0;
}
+static int
+set_add_entry(PySetObject *so, PyObject *key, Py_hash_t hash)
+{
+ Py_INCREF(key);
+ if (!_set_add_entry(so, key, hash))
+ return 0;
+ Py_DECREF(key);
+ return -1;
+}
+
/*
Internal routine used by set_table_resize() to insert an item which is
known to be absent from the set. This routine also assumes that