Lines Matching defs:shift
345 uint32_t shift, int32_t hash,
350 uint32_t shift, int32_t hash,
356 uint32_t shift, int32_t hash,
435 hamt_mask(int32_t hash, uint32_t shift)
437 return (((uint32_t)hash >> shift) & 0x01f);
441 hamt_bitpos(int32_t hash, uint32_t shift)
443 return (uint32_t)1 << hamt_mask(hash, shift);
625 hamt_node_new_bitmap_or_collision(uint32_t shift,
670 n, shift, key1_hash, key1, val1, &added_leaf);
676 n = hamt_node_assoc(n2, shift, key2_hash, key2, val2, &added_leaf);
688 uint32_t shift, int32_t hash,
700 uint32_t bit = hamt_bitpos(hash, shift);
711 `(shift, hash)` pair we can determine:
730 that have the same (hash, shift) pair. */
736 shift + 5, hash, key, val, added_leaf);
757 key in this collection that matches our hash for this shift. */
790 shift + 5,
811 /* There was no key before with the same (shift,hash). */
831 uint32_t jdx = hamt_mask(hash, shift);
855 empty, shift + 5, hash, key, val, added_leaf);
882 empty, shift + 5,
956 uint32_t shift, int32_t hash,
960 uint32_t bit = hamt_bitpos(hash, shift);
980 shift + 5, hash, key, &sub_node);
1096 uint32_t shift, int32_t hash,
1101 uint32_t bit = hamt_bitpos(hash, shift);
1123 /* There are a few keys that have the same hash at the current shift
1127 shift + 5, hash, key, val);
1317 uint32_t shift, int32_t hash,
1416 new_node->b_bitmap = hamt_bitpos(self->c_hash, shift);
1421 new_node, shift, hash, key, val, added_leaf);
1435 uint32_t shift, int32_t hash,
1493 node->b_bitmap = hamt_bitpos(hash, shift);
1529 uint32_t shift, int32_t hash,
1678 uint32_t shift, int32_t hash,
1688 uint32_t idx = hamt_mask(hash, shift);
1710 shift + 5, hash, key, val, added_leaf);
1738 node, shift + 5, hash, key, val, added_leaf);
1762 uint32_t shift, int32_t hash,
1766 uint32_t idx = hamt_mask(hash, shift);
1776 shift + 5, hash, key, &sub_node);
1920 uint32_t shift, int32_t hash,
1926 uint32_t idx = hamt_mask(hash, shift);
1935 return hamt_node_find(node, shift + 5, hash, key, val);
2022 uint32_t shift, int32_t hash,
2025 /* Set key/value to the 'node' starting with the given shift/hash.
2039 shift, hash, key, val, added_leaf);
2044 shift, hash, key, val, added_leaf);
2050 shift, hash, key, val, added_leaf);
2056 uint32_t shift, int32_t hash,
2063 shift, hash, key,
2069 shift, hash, key,
2076 shift, hash, key,
2083 uint32_t shift, int32_t hash,
2086 /* Find the key in the node starting with the given shift/hash.
2102 shift, hash, key, val);
2108 shift, hash, key, val);
2114 shift, hash, key, val);