Lines Matching refs:BITS_PER_ENTRY
324 sc->sc_map_size = roundup(size / secsize, BITS_PER_ENTRY); in g_union_ctl_create()
325 needed = sc->sc_map_size / BITS_PER_ENTRY; in g_union_ctl_create()
333 sc->sc_bits_per_leaf = sc->sc_leaf_size * BITS_PER_ENTRY; in g_union_ctl_create()
334 sc->sc_leafused = g_malloc(roundup(sc->sc_root_size, BITS_PER_ENTRY), in g_union_ctl_create()
342 sizeof(uint64_t) + roundup(sc->sc_root_size, BITS_PER_ENTRY); in g_union_ctl_create()
595 memset(sc->sc_leafused, 0, roundup(sc->sc_root_size, BITS_PER_ENTRY)); in g_union_revert()
1094 [(start % sc->sc_bits_per_leaf) / BITS_PER_ENTRY]; in g_union_setmap()
1095 *wordp |= 1ULL << (start % BITS_PER_ENTRY); in g_union_setmap()
1096 sc->sc_leafused[root_idx / BITS_PER_ENTRY] |= in g_union_setmap()
1097 1ULL << (root_idx % BITS_PER_ENTRY); in g_union_setmap()
1136 if (((sc->sc_leafused[root_idx / BITS_PER_ENTRY]) & in g_union_getmap()
1137 (1ULL << (root_idx % BITS_PER_ENTRY))) == 0) { in g_union_getmap()
1150 word = leaf[(start % sc->sc_bits_per_leaf) / BITS_PER_ENTRY]; in g_union_getmap()
1151 bitloc = start % BITS_PER_ENTRY; in g_union_getmap()
1163 numsec -= BITS_PER_ENTRY; in g_union_getmap()
1164 start += BITS_PER_ENTRY; in g_union_getmap()
1167 for ( ; bitloc < BITS_PER_ENTRY; bitloc ++) { in g_union_getmap()