Lines Matching defs:bitmap
118 we can use bitmap compression and can have just as many pointers
126 2. A 32bit integer -- a bitmap field. If an N-th bit is set in the
127 bitmap, it means that the node has an N-th element.
137 We allocate a three-pointer Bitmap node. Its bitmap field will be
144 bitmap & (1 << I)
150 popcount(bitmap & ((1 << I) - 1))
163 * bitmap & ((1 << 17) - 1) == 0b100000010000 => 2 bits are set => index is 2.
165 * bitmap & ((1 << 11) - 1) == 0b10000 => 1 bit is set => index is 1.
167 * bitmap & ((1 << 4) - 1) == 0b0 => 0 bits are set => index is 0.
171 a number of pointers, but use bitmap compression to eliminate unused
272 BitmapNode(size=4 count=2 bitmap=0b110 id=0x10eb9d9e8):
447 hamt_bitindex(uint32_t bitmap, uint32_t bit)
449 return (uint32_t)_Py_popcount32(bitmap & (bit - 1));
523 /* Create a new bitmap node of size 'size' */
536 /* No freelist; allocate a new bitmap node */
554 /* Since bitmap nodes are immutable, we can cache the instance
555 for size=0 and reuse it whenever we need an empty bitmap node.
573 /* Clone a bitmap node; return a new one with the same child notes. */
691 /* assoc operation for bitmap nodes.
710 The `node->b_bitmap` field is a bitmap. For a given
771 Make a new bitmap node with a replaced value, and return it. */
818 want to use the Bitmap node with bitmap encoding.
845 /* Create an empty bitmap node for the next
852 /* Make a new bitmap node for the key/val we're adding.
853 Set that bitmap node to new-array-node[jdx]. */
910 create a new bitmap node out of this node with the
1008 /* A bitmap node with one key/value pair. Just
1211 if (_hamt_dump_format(writer, "bitmap=%S id=%p):\n", tmp2, node)) {
1835 uint32_t bitmap = 0;
1856 bitmap |= 1U << i;
1908 new->b_bitmap = bitmap;