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

/freebsd-10.0-release/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-10.0-release/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-10.0-release/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-10.0-release/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 242 milliseconds