Home
last modified time | relevance | path

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

/dports/devel/tla/tla-1.3.5/src/hackerlab/bitsets/
H A Dbitset.c275 first_subset = bitset_which_subset (from); in bitset_is_empty_range()
276 last_subset = bitset_which_subset (to); in bitset_is_empty_range()
346 first_subset = bitset_which_subset (from); in bitset_is_full_range()
347 last_subset = bitset_which_subset (to); in bitset_is_full_range()
454 bp = b + bitset_which_subset (from); in bitset_clear_range()
509 bp = b + bitset_which_subset (from); in bitset_fill_range()
805 first_subset = bitset_which_subset (from); in bitset_population_range()
930 s = b[bitset_which_subset (from)]; in bitset_ffs_range()
941 f = bitset_ffs (n_bits, b + bitset_which_subset (from)); in bitset_ffs_range()
1060 s = b[bitset_which_subset (from)]; in bitset_ffc_range()
[all …]
H A Dbitset.h85 #define bitset_which_subset(N) ((N) / bits_per_subset) macro
H A Dbitset-tree.c314 *answer = ((bitset)b)[bitset_which_subset (n)]; in bits_tree_get_subset()
/dports/devel/tla/tla-1.3.5/src/docs-hackerlab/texi/
H A Dbitsets.texi176 @b{* Macro} @code{bitset_which_subset}@maindex bitset_which_subset
180 #define bitset_which_subset(N) ((N) / bits_per_subset)
192 B[bitset_which_subset(N)]