Home
last modified time | relevance | path

Searched refs:ma_used (Results 1 – 4 of 4) sorted by relevance

/external/python/cpython2/Objects/
Ddictobject.c217 (mp)->ma_used = (mp)->ma_fill = 0; \
270 assert (mp->ma_used == 0); in PyDict_New()
532 mp->ma_used++; in insertdict_by_entry()
589 mp->ma_used++; in insertdict_clean()
627 if (mp->ma_fill == mp->ma_used) { in dictresize()
637 assert(mp->ma_fill > mp->ma_used); in dictresize()
655 mp->ma_used = 0; in dictresize()
791 n_used = mp->ma_used; in dict_set_item_by_hash_or_entry()
816 if (!(mp->ma_used > n_used && mp->ma_fill*3 >= (mp->ma_mask+1)*2)) in dict_set_item_by_hash_or_entry()
818 return dictresize(mp, (mp->ma_used > 50000 ? 2 : 4) * mp->ma_used); in dict_set_item_by_hash_or_entry()
[all …]
/external/python/cpython3/Objects/
Ddictobject.c434 #define GROWTH_RATE(d) ((d)->ma_used*3)
482 CHECK(0 <= mp->ma_used && mp->ma_used <= usable); in _PyDict_CheckConsistency()
528 for (i=0; i < mp->ma_used; i++) { in _PyDict_CheckConsistency()
639 mp->ma_used = 0; in new_dict()
701 new->ma_used = orig->ma_used; in clone_combined_dict()
1072 ((ix >= 0 && old_value == NULL && mp->ma_used != ix) || in insertdict()
1073 (ix == DKIX_EMPTY && mp->ma_used != mp->ma_keys->dk_nentries))) { in insertdict()
1099 mp->ma_used++; in insertdict()
1113 assert(ix == mp->ma_used); in insertdict()
1114 mp->ma_used++; in insertdict()
[all …]
/external/python/cpython3/Include/cpython/
Ddictobject.h18 Py_ssize_t ma_used; member
53 #define PyDict_GET_SIZE(mp) (assert(PyDict_Check(mp)),((PyDictObject *)mp)->ma_used)
/external/python/cpython2/Include/
Ddictobject.h73 Py_ssize_t ma_used; /* # Active */ member