Lines Matching defs:mask
61 size_t mask = so->mask;
62 size_t i = (size_t)hash & mask; /* Unsigned for defined overflow behavior */
68 probes = (i + LINEAR_PROBES <= mask) ? LINEAR_PROBES: 0;
91 mask = so->mask;
96 i = (i * 5 + 1 + perturb) & mask;
109 size_t mask;
120 mask = so->mask;
121 i = (size_t)hash & mask;
127 probes = (i + LINEAR_PROBES <= mask) ? LINEAR_PROBES: 0;
150 mask = so->mask;
159 i = (i * 5 + 1 + perturb) & mask;
175 if ((size_t)so->fill*5 < mask*3)
197 set_insert_clean(setentry *table, size_t mask, PyObject *key, Py_hash_t hash)
201 size_t i = (size_t)hash & mask;
208 if (i + LINEAR_PROBES <= mask) {
216 i = (i * 5 + 1 + perturb) & mask;
235 Py_ssize_t oldmask = so->mask;
284 so->mask = newsize - 1;
289 newmask = (size_t)so->mask;
391 so->mask = PySet_MINSIZE - 1;
462 Py_ssize_t mask;
468 mask = so->mask;
470 while (i <= mask && (entry->key == NULL || entry->key == dummy)) {
475 if (i > mask)
577 if ((so->fill + other->used)*5 >= so->mask*3) {
586 if (so->fill == 0 && so->mask == other->mask && other->fill == other->used) {
587 for (i = 0; i <= other->mask; i++, so_entry++, other_entry++) {
604 size_t newmask = (size_t)so->mask;
607 for (i = other->mask + 1; i > 0 ; i--, other_entry++) {
618 for (i = 0; i <= other->mask; i++) {
633 setentry *entry = so->table + (so->finger & so->mask);
634 setentry *limit = so->table + so->mask;
705 for (entry = so->table; entry <= &so->table[so->mask]; entry++)
709 if ((so->mask + 1 - so->fill) & 1)
797 Py_ssize_t i, mask;
815 mask = so->mask;
816 while (i <= mask && (entry[i].key == NULL || entry[i].key == dummy))
819 if (i > mask)
900 if ((so->fill + dictsize)*5 >= so->mask*3) {
963 so->mask = PySet_MINSIZE - 1;
1068 t = a->mask; a->mask = b->mask; b->mask = t;
1458 if ((size_t)(so->fill - so->used) <= (size_t)so->mask / 4)
1976 res = res + (so->mask + 1) * sizeof(setentry);