HomeSort by: relevance | last modified time | path
    Searched refs:nbits (Results 1 - 25 of 46) sorted by relevancy

1 2

  /src/sys/external/bsd/drm2/include/linux/
bitmap.h 42 * bitmap_zero(bitmap, nbits)
44 * Zero a bitmap that was allocated to have nbits bits. Yes, this
45 * zeros bits past nbits.
48 bitmap_zero(unsigned long *bitmap, size_t nbits)
51 size_t n = howmany(nbits, bpl);
57 * bitmap_empty(bitmap, nbits)
59 * Return true if all bits at 0, 1, 2, ..., nbits-2, nbits-1 are
63 bitmap_empty(const unsigned long *bitmap, size_t nbits)
67 for (; nbits >= bpl; nbits -= bpl)
    [all...]
dma-mapping.h 60 DMA_BIT_MASK(unsigned nbits)
63 if (nbits == CHAR_BIT*sizeof(uintmax_t))
65 return ~(~(uintmax_t)0 << nbits);
  /src/include/
bitstring.h 66 /* bytes in a bitstring of nbits bits */
67 #define bitstr_size(nbits) \
68 (size_t)((uint32_t)((nbits) + 7) >> 3)
71 #define bit_alloc(nbits) \
72 calloc(bitstr_size(nbits), sizeof(bitstr_t))
75 #define bit_decl(name, nbits) \
76 ((name)[bitstr_size(nbits)])
114 #define bit_ffc(name, nbits, value) do { \
116 size_t _bit, _nbits = nbits; \
127 #define bit_ffs(name, nbits, value) do {
    [all...]
  /src/sys/arch/ia64/stand/common/
bitstring.h 50 /* bytes in a bitstring of nbits bits */
51 #define bitstr_size(nbits) \
52 (((nbits) + 7) >> 3)
55 #define bit_alloc(nbits) \
56 (bitstr_t *)calloc((size_t)bitstr_size(nbits), sizeof(bitstr_t))
59 #define bit_decl(name, nbits) \
60 ((name)[bitstr_size(nbits)])
109 #define bit_ffc(name, nbits, value) do { \
111 register int _byte, _nbits = (nbits); \
122 if (_value >= nbits) \
    [all...]
  /src/lib/libc/gdtoa/
gethex.c 45 int big, esign, havedig, irv, j, k, n, n0, nbits, up, zret; local in function:gethex
171 nbits = fpi->nbits;
172 n0 = n = (unsigned int)nbits >> kshift;
173 if (nbits & kmask)
181 b->x[j] = ULbits >> (ULbits - (nbits & kmask));
218 nbits = fpi->nbits;
221 if (n > nbits) {
222 n -= nbits;
    [all...]
hexnan.c 64 int havedig, hd0, i, nbits; local in function:hexnan
68 nbits = fpi->nbits;
69 x = x0 + ((unsigned int)nbits >> kshift);
70 if (nbits & kmask)
140 if ( (i = nbits & (ULbits-1)) !=0)
g_ddfmt.c 157 fpi.nbits = z->wds * 32 - hi0bits(z->x[j = z->wds-1]);
158 if (fpi.nbits < 106) {
159 fpi.nbits = 106;
170 if (bufsize < (int)(fpi.nbits * .301029995664) + 10) {
strtodg.c 191 bdif -= nb = fpi->nbits;
334 int j, k, nbits, nd, nd0, nf, nz, nz0, rd, rvbits, rve, rve1, sign; local in function:strtodg
353 nbits = fpi->nbits;
553 if (nbits <= P && nd <= DBL_DIG) {
670 if ((j = rvbits - nbits) > 0) {
672 rvbits = nbits;
676 e2 = rve + rvbits - nbits;
679 rve1 = rve + rvbits - nbits;
744 j = nbits + 1 - bbbits
    [all...]
gdtoa.c 38 bitstob(bits, nbits, bbits) ULong *bits; int nbits; int *bbits;
40 bitstob(ULong *bits, int nbits, int *bbits)
49 while(i < nbits) {
60 be = bits + (((unsigned int)nbits - 1) >> kshift);
163 int j, jj1, k, k0, k_check, kind, leftright, m2, m5, nbits; local in function:gdtoa
196 b = bitstob(bits, nbits = fpi->nbits, &bbits);
305 i = (int)(nbits * .30103) + 3;
518 i = nbits - bbits
    [all...]
gdtoa.h 97 int nbits; member in struct:FPI
  /src/sys/external/bsd/common/include/linux/
bitops.h 196 __find_next_bit(const unsigned long *ptr, unsigned long nbits,
201 size_t n = howmany(nbits, bpl);
240 return nbits;
249 /* We may have overshot, so clamp down to at most nbits. */
250 return MIN(result, nbits);
254 find_next_bit(const unsigned long *ptr, unsigned long nbits,
257 return __find_next_bit(ptr, nbits, startbit, 0);
261 find_first_bit(const unsigned long *ptr, unsigned long nbits)
263 return find_next_bit(ptr, nbits, 0);
267 find_next_zero_bit(const unsigned long *ptr, unsigned long nbits,
    [all...]
  /src/distrib/acorn32/
mksparkive.sh 175 nbits=$(dd if="$temp" bs=1 count=1 \
177 if [ $nbits -ge 128 ]
179 nbits=$(expr $nbits - 128)
181 printf \\x$(printf %02x $nbits)
  /src/sys/dev/ic/
rtwphyio.c 119 u_int nbits)
124 KASSERT(nbits <= 32);
127 ("%s: %u bits, %#08x, %s\n", __func__, nbits, bits,
137 mask = 1 << (nbits - 1);
139 for (i = 0; i < nbits; i++) {
253 u_int nbits; local in function:rtw_rf_hostwrite
262 nbits = 16;
272 nbits = 32;
279 nbits = 21;
287 nbits = 22
    [all...]
arn5416.c 727 ar5416_reverse_bits(uint8_t v, int nbits)
729 KASSERT(nbits <= 8);
733 return v >> (8 - nbits);
758 * Replace bits "off" to "off+nbits-1" in column "col" with the specified
762 ar5416_rw_rfbits(uint32_t *buf, int col, int off, uint32_t val, int nbits)
766 KASSERT(off >= 1 && col < 4 && nbits <= 32);
769 while (nbits-- > 0) {
773 buf[idx] |= ((val >> nbits) & 1) << (bit + col * 8);
  /src/sys/arch/x86/x86/
cpu_rng.c 270 NBITS = 256,
271 NBYTES = howmany(NBITS, 8),
272 NWORDS = howmany(NBITS, 64),
275 unsigned i, nbits = 0; local in function:cpu_rng_get
285 nbits += cpu_rng(cpu_rng_mode, &buf[i]);
289 nbits = 0;
291 rnd_add_data_sync(&cpu_rng_source, buf, sizeof buf, nbits);
292 nbytes -= MIN(MIN(nbytes, sizeof buf), MAX(1, 8*nbits));
  /src/sys/dev/mii/
mii_bitbang.c 87 int nbits)
95 for (i = 1 << (nbits - 1); i != 0; i >>= 1) {
  /src/sbin/cgdconfig/
utils.c 355 size_t nbits; local in function:bits_decode
370 nbits = ntohl(*tmp);
371 if (nbits > (len - sizeof(*tmp)) * NBBY) {
373 "longer than they are (nbits=%zu, stream len=%zu bytes)",
374 nbits, len);
379 ret = bits_new(tmp + 1, nbits);
  /src/sys/arch/powerpc/fpu/
fpu_explode.c 134 #define mask(nbits) ((1L << (nbits)) - 1)
  /src/sys/arch/arm/rockchip/
rk_v1crypto.c 279 size_t nbits = NBBY*nbytes; local in function:rk_v1crypto_rng_get
281 while (nbits) {
295 nbits -= MIN(nbits, MAX(1, entropybits));
  /src/sys/kern/
kern_entropy.c 431 entropy_enter(extra, sizeof extra, /*nbits*/0, /*count*/false);
855 * entropy_enter_early(buf, len, nbits)
863 entropy_enter_early(const void *buf, size_t len, unsigned nbits)
890 notify |= (E->bitsneeded && E->bitsneeded <= nbits);
891 notify |= (nbits >= MINENTROPYBITS);
899 E->bitsneeded -= MIN(E->bitsneeded, nbits);
909 * entropy_enter(buf, len, nbits, count)
913 * nbits is a lower bound on the number of bits of entropy in the
917 entropy_enter(const void *buf, size_t len, unsigned nbits, bool count)
926 KASSERTMSG(howmany(nbits, NBBY) <= len
2353 unsigned nbits = rs->total; local in function:rndsource_entropybits
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/
drm_print.c 278 * @nbits: Size of bit names array.
281 const char * const bits[], unsigned int nbits)
286 if (WARN_ON_ONCE(nbits > BITS_PER_TYPE(value)))
287 nbits = BITS_PER_TYPE(value);
289 for_each_set_bit(i, &value, nbits) {
  /src/sys/arch/m68k/fpe/
fpu_explode.c 109 #define mask(nbits) ((1 << (nbits)) - 1)
  /src/sys/arch/sparc/fpu/
fpu_explode.c 134 #define mask(nbits) ((1L << (nbits)) - 1)
  /src/lib/libc/rpc/
xdr_float.c 196 #define MASK(nbits) ((1 << nbits) - 1)
  /src/sys/dev/pci/
ubsec.c 2423 u_int nbits, normbits, mbits, shiftbits, ebits; local in function:ubsec_kprocess_modexp_sw
2434 nbits = ubsec_ksigbits(&krp->krp_param[UBS_MODEXP_PAR_N]);
2435 if (nbits <= 512)
2437 else if (nbits <= 768)
2439 else if (nbits <= 1024)
2441 else if (sc->sc_flags & UBS_FLAGS_BIGKEY && nbits <= 1536)
2443 else if (sc->sc_flags & UBS_FLAGS_BIGKEY && nbits <= 2048)
2450 shiftbits = normbits - nbits;
2452 me->me_modbits = nbits;
2457 if (krp->krp_param[krp->krp_iparams].crp_nbits < nbits) {
2628 u_int nbits, normbits, mbits, shiftbits, ebits; local in function:ubsec_kprocess_modexp_hw
    [all...]

Completed in 27 milliseconds

1 2