Lines Matching refs:ma_used
460 #define GROWTH_RATE(d) ((d)->ma_used*3)
508 CHECK(0 <= mp->ma_used && mp->ma_used <= usable); in _PyDict_CheckConsistency()
554 for (i=0; i < mp->ma_used; i++) { in _PyDict_CheckConsistency()
674 mp->ma_used = 0; in new_dict()
1091 ((ix >= 0 && old_value == NULL && mp->ma_used != ix) || in insertdict()
1092 (ix == DKIX_EMPTY && mp->ma_used != mp->ma_keys->dk_nentries))) { in insertdict()
1121 mp->ma_used++; in insertdict()
1135 assert(ix == mp->ma_used); in insertdict()
1136 mp->ma_used++; in insertdict()
1184 mp->ma_used++; in insert_to_emptydict()
1248 assert(mp->ma_keys->dk_usable >= mp->ma_used); in dictresize()
1252 numentries = mp->ma_used; in dictresize()
1658 mp->ma_used--; in delitem_common()
1795 mp->ma_used = 0; in PyDict_Clear()
1831 if (i < 0 || i >= mp->ma_used) in _PyDict_Next()
1897 if (mp->ma_used == 0) { in _PyDict_Pop_KnownHash()
1929 mp->ma_used--; in _PyDict_Pop_KnownHash()
1948 if (((PyDictObject *)dict)->ma_used == 0) { in _PyDict_Pop()
1978 if (PyDict_CheckExact(d) && ((PyDictObject *)d)->ma_used == 0) { in _PyDict_FromKeys()
2106 if (mp->ma_used == 0) { in dict_repr()
2114 writer.min_length = 1 + 4 + (2 + 4) * (mp->ma_used - 1) + 1; in dict_repr()
2179 return mp->ma_used; in dict_length()
2244 n = mp->ma_used; in dict_keys()
2248 if (n != mp->ma_used) { in dict_keys()
2287 n = mp->ma_used; in dict_values()
2291 if (n != mp->ma_used) { in dict_values()
2335 n = mp->ma_used; in dict_items()
2347 if (n != mp->ma_used) { in dict_items()
2567 if (other == mp || other->ma_used == 0) in dict_merge()
2570 if (mp->ma_used == 0) { in dict_merge()
2580 other->ma_used == okeys->dk_nentries && in dict_merge()
2582 USABLE_FRACTION(okeys->dk_size/2) < other->ma_used)) { in dict_merge()
2597 mp->ma_used = other->ma_used; in dict_merge()
2613 if (USABLE_FRACTION(mp->ma_keys->dk_size) < other->ma_used) { in dict_merge()
2614 if (dictresize(mp, estimate_keysize(mp->ma_used + other->ma_used))) { in dict_merge()
2761 if (mp->ma_used == 0) { in PyDict_Copy()
2780 split_copy->ma_used = mp->ma_used; in PyDict_Copy()
2795 (mp->ma_used >= (mp->ma_keys->dk_nentries * 2) / 3)) in PyDict_Copy()
2822 new->ma_used = mp->ma_used; in PyDict_Copy()
2848 return ((PyDictObject *)mp)->ma_used; in PyDict_Size()
2890 if (a->ma_used != b->ma_used) in dict_equal()
3055 ((ix >= 0 && value == NULL && mp->ma_used != ix) || in PyDict_SetDefault()
3056 (ix == DKIX_EMPTY && mp->ma_used != mp->ma_keys->dk_nentries))) { in PyDict_SetDefault()
3090 mp->ma_used++; in PyDict_SetDefault()
3099 assert(ix == mp->ma_used); in PyDict_SetDefault()
3103 mp->ma_used++; in PyDict_SetDefault()
3191 if (self->ma_used == 0) { in dict_popitem_impl()
3225 self->ma_used--; in dict_popitem_impl()
3470 d->ma_used = 0; in dict_new()
3662 di->di_used = dict->ma_used; in dictiter_new()
3663 di->len = dict->ma_used; in dictiter_new()
3668 di->di_pos = dict->ma_used - 1; in dictiter_new()
3714 if (di->di_dict != NULL && di->di_used == di->di_dict->ma_used) in dictiter_len()
3747 if (di->di_used != d->ma_used) { in dictiter_iternextkey()
3758 if (i >= d->ma_used) in dictiter_iternextkey()
3835 if (di->di_used != d->ma_used) { in dictiter_iternextvalue()
3845 if (i >= d->ma_used) in dictiter_iternextvalue()
3922 if (di->di_used != d->ma_used) { in dictiter_iternextitem()
3932 if (i >= d->ma_used) in dictiter_iternextitem()
4036 if (di->di_used != d->ma_used) { in dictreviter_iternext()
4209 len = dv->dv_dict->ma_used; in dictview_len()