Searched refs:n_bits (Results 1 - 14 of 14) sorted by relevance

/freebsd-11-stable/sys/contrib/ck/include/
H A Dck_bitmap.h57 unsigned int n_bits; \
118 unsigned int n_bits; member in struct:ck_bitmap
131 ck_bitmap_base(unsigned int n_bits) argument
134 return CK_BITMAP_BLOCKS(n_bits) * sizeof(unsigned int);
142 ck_bitmap_size(unsigned int n_bits) argument
145 return ck_bitmap_base(n_bits) + sizeof(struct ck_bitmap);
155 return bitmap->n_bits;
226 unsigned int n_buckets = dst->n_bits;
228 if (src->n_bits < dst->n_bits)
442 ck_bitmap_init(struct ck_bitmap *bitmap, unsigned int n_bits, bool set) argument
[all...]
/freebsd-11-stable/usr.bin/compress/
H A Dzopen.c95 #define MAXCODE(n_bits) ((1 << (n_bits)) - 1)
105 code_int zs_maxcode; /* Maximum code, given n_bits. */
145 #define n_bits zs->zs_n_bits macro
269 maxcode = MAXCODE(n_bits = INIT_BITS);
350 * code: A n_bits-bit integer. If == -1, then EOF. This assumes
351 * that n_bits =< (long)wordsize - 1.
375 bits = n_bits;
398 offset += n_bits;
399 if (offset == (n_bits <<
[all...]
/freebsd-11-stable/contrib/wpa/src/utils/
H A Dradiotap_iter.h22 int n_bits; member in struct:ieee80211_radiotap_namespace
H A Dradiotap.c48 .n_bits = sizeof(rtap_namespace_sizes) / sizeof(rtap_namespace_sizes[0]),
268 iterator->_arg_index >= iterator->current_namespace->n_bits) {
/freebsd-11-stable/contrib/gcc/
H A Dsbitmap.c46 bmap->n_bits = n_elms;
71 if (n_elms > bmap->n_bits)
78 last_bit = bmap->n_bits % SBITMAP_ELT_BITS;
92 else if (n_elms < bmap->n_bits)
101 bmap->n_bits = n_elms;
122 src->n_bits = n_elms;
127 bmap->n_bits = n_elms;
167 b->n_bits = n_elms;
207 last_bit = bmap->n_bits % SBITMAP_ELT_BITS;
285 /* Zero all bits past n_bits, b
[all...]
H A Dsbitmap.h33 unsigned int n_bits; /* Number of bits. */ member in struct:simple_bitmap_def
H A Dtree-into-ssa.c559 return ver < new_ssa_names->n_bits && TEST_BIT (old_ssa_names, ver);
569 return ver < new_ssa_names->n_bits && TEST_BIT (new_ssa_names, ver);
654 if (new_ssa_names->n_bits <= num_ssa_names - 1)
3072 sbitmap tmp = sbitmap_alloc (old_ssa_names->n_bits);
H A Dgcse.c4869 for (i = 0; i < hoist_vbeout[bb->index]->n_bits; i++)
4925 for (i = 0; i < hoist_exprs[bb->index]->n_bits; i++)
H A Dsched-rgn.c1344 sbitmap src = sbitmap_alloc (pot_split[bb_src]->n_bits);
H A Dcalls.c1515 if (i + k < stored_args_map->n_bits
/freebsd-11-stable/sys/dev/ocs_fc/
H A Docs_os.c484 * @param n_bits number of bits in bit map
489 ocs_bitmap_alloc(uint32_t n_bits) argument
492 return malloc(bitstr_size(n_bits), M_OCS, M_ZERO | M_NOWAIT);
511 * @param n_bits number of bits in map
516 ocs_bitmap_find(ocs_bitmap_t *bitmap, uint32_t n_bits) argument
520 bit_ffc(bitmap, n_bits, &position);
534 * @param n_bits number of bits in map
539 ocs_bitmap_search(ocs_bitmap_t *bitmap, uint8_t set, uint32_t n_bits) argument
548 bit_ffs(bitmap, n_bits, &position);
550 bit_ffc(bitmap, n_bits,
[all...]
H A Docs_os.h801 * @param n_bits Minimum number of entries in the bit-map
805 extern ocs_bitmap_t *ocs_bitmap_alloc(uint32_t n_bits);
820 * @param n_bits number of bits in map
824 extern int32_t ocs_bitmap_find(ocs_bitmap_t *bitmap, uint32_t n_bits);
832 * @param n_bits number of bits in map
836 extern int32_t ocs_bitmap_search(ocs_bitmap_t *bitmap, uint8_t set, uint32_t n_bits);
/freebsd-11-stable/contrib/binutils/opcodes/
H A Dcr16-dis.c31 /* Extract 'n_bits' from 'a' starting from offset 'offs'. */
32 #define EXTRACT(a, offs, n_bits) \
33 (n_bits == 32 ? (((a) >> (offs)) & 0xffffffffL) \
34 : (((a) >> (offs)) & ((1 << (n_bits)) -1)))
/freebsd-11-stable/usr.bin/gzip/
H A Dzuncompress.c68 #define MAXCODE(n_bits) ((1 << (n_bits)) - 1)
92 code_int zs_maxcode; /* Maximum code, given n_bits. */

Completed in 308 milliseconds