Home
last modified time | relevance | path

Searched refs:perturb (Results 1 - 5 of 5) sorted by relevance

/third_party/python/Objects/
H A Dsetobject.c60 size_t perturb = hash; in set_lookkey() local
95 perturb >>= PERTURB_SHIFT; in set_lookkey()
96 i = (i * 5 + 1 + perturb) & mask; in set_lookkey()
108 size_t perturb; in set_add_entry() local
123 perturb = hash; in set_add_entry()
158 perturb >>= PERTURB_SHIFT; in set_add_entry()
159 i = (i * 5 + 1 + perturb) & mask; in set_add_entry()
200 size_t perturb = hash; in set_insert_clean() local
215 perturb >>= PERTURB_SHIFT; in set_insert_clean()
216 i = (i * 5 + 1 + perturb) in set_insert_clean()
[all...]
H A Ddictobject.c196 into play. This is done by initializing a (unsigned) vrbl "perturb" to the
199 perturb >>= PERTURB_SHIFT;
200 j = (5*j) + 1 + perturb;
206 the initial index. Note that because perturb is unsigned, if the recurrence
207 is executed often enough perturb eventually becomes and remains 0. At that
227 (e.g., computing 5*j can go on at the same time as computing 1+perturb in the
228 above, and then shifting perturb can be done while the table index is being
849 size_t perturb = (size_t)hash; in lookdict_index() local
860 perturb >>= PERTURB_SHIFT; in lookdict_index()
861 i = mask & (i*5 + perturb in lookdict_index()
872 size_t perturb = hash; unicodekeys_lookup_generic() local
918 size_t perturb = hash; unicodekeys_lookup_unicode() local
962 size_t perturb = hash; dictkeys_generic_lookup() local
[all...]
/third_party/mksh/
H A Dmain.c1827 size_t i, j, osize, mask, perturb; in tgrow() local
1855 j = perturb = tblp->ua.hval; in tgrow()
1858 j = (j << 2) + j + perturb + 1; in tgrow()
1859 perturb >>= PERTURB_SHIFT; in tgrow()
1888 size_t j, perturb, mask; in ktscan() local
1893 j = perturb = h; in ktscan()
1896 j = (j << 2) + j + perturb + 1; in ktscan()
1897 perturb >>= PERTURB_SHIFT; in ktscan()
/third_party/python/Modules/
H A D_pickle.c825 size_t perturb; in _PyMemoTable_Lookup() local
836 for (perturb = hash; ; perturb >>= PERTURB_SHIFT) { in _PyMemoTable_Lookup()
837 i = (i << 2) + i + perturb + 1; in _PyMemoTable_Lookup()
/third_party/toybox/toys/pending/
H A Dawk.c286 // is borrowed from Python dict, using the "perturb" idea to mix in upper bits
584 enum { PSHIFT = 5 }; // "perturb" shift -- see find_mapslot() below
589 unsigned perturb = *hash = zstring_hash(key); in find_mapslot() local
608 // The addition of 'perturb' greatly improves the probe sequence. See in find_mapslot()
610 *probe = (*probe * 5 + 1 + (perturb >>= PSHIFT)) & m->mask; in find_mapslot()
669 unsigned perturb = hash; in zmap_rehash() local
672 p = (p * 5 + 1 + (perturb >>= PSHIFT)) & mask; in zmap_rehash()

Completed in 23 milliseconds