}
}
-/*
-Internal routine to insert a new key into the table.
-Used by the public insert routine.
-Eats a reference to key.
-*/
static int
set_insert_key(PySetObject *so, PyObject *key, Py_hash_t hash)
{
}
found_null_first:
+ Py_INCREF(key);
so->fill++;
so->used++;
entry->key = key;
return 0;
found_null:
+ Py_INCREF(key);
if (freeslot == NULL) {
/* UNUSED */
so->fill++;
return 0;
found_active:
- Py_DECREF(key);
return 0;
}
assert(so->fill <= so->mask); /* at least one empty slot */
n_used = so->used;
- Py_INCREF(key);
- if (set_insert_key(so, key, hash)) {
- Py_DECREF(key);
+ if (set_insert_key(so, key, hash))
return -1;
- }
if (!(so->used > n_used && so->fill*3 >= (so->mask+1)*2))
return 0;
return set_table_resize(so, so->used>50000 ? so->used*2 : so->used*4);
for (i = 0; i <= other->mask; i++, other_entry++) {
key = other_entry->key;
if (key != NULL && key != dummy) {
- Py_INCREF(key);
- if (set_insert_key(so, key, other_entry->hash)) {
- Py_DECREF(key);
+ if (set_insert_key(so, key, other_entry->hash))
return -1;
- }
}
}
return 0;