HomeSort by: relevance | last modified time | path
    Searched defs:n_bits (Results 1 - 3 of 3) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_bitvector_test.cc 121 uptr n_bits = ((uptr)my_rand() % bv.size()) + 1; local in function:TestBitVector
123 EXPECT_TRUE(n_bits > 0 && n_bits <= bv.size());
125 for (uptr i = 0; i < n_bits; i++) {
  /src/sys/net/
bsd-comp.c 89 u_char n_bits; /* current bits/code */ member in struct:bsd_db
204 db->n_bits = BSD_INIT_BITS;
461 u_int n_bits = db->n_bits; local in function:bsd_compress
493 bitno -= n_bits; \
596 if (max_ent >= MAXCODE(n_bits))
597 db->n_bits = ++n_bits;
639 if (max_ent >= MAXCODE(n_bits) && max_ent < db->maxmaxcode)
640 db->n_bits++
671 u_int n_bits = db->n_bits; local in function:bsd_incomp
800 u_int n_bits = db->n_bits; local in function:bsd_decompress
    [all...]
  /src/usr.bin/compress/
zopen.c 96 #define MAXCODE(n_bits) ((1 << (n_bits)) - 1)
106 code_int zs_maxcode; /* Maximum code, given n_bits. */
146 #define n_bits zs->zs_n_bits macro
270 maxcode = MAXCODE(n_bits = INIT_BITS);
351 * code: A n_bits-bit integer. If == -1, then EOF. This assumes
352 * that n_bits =< (long)wordsize - 1.
375 bits = n_bits;
398 offset += n_bits;
399 if (offset == (n_bits << 3))
    [all...]

Completed in 13 milliseconds