Searched refs:bits (Results 1 - 25 of 74) sorted by relevance

123

/ast/src/lib/libast/stdio/
H A Dfwide.c33 f->bits &= ~SF_MB;
34 f->bits |= SF_WC;
38 f->bits &= ~SF_WC;
39 f->bits |= SF_MB;
41 if (f->bits & SF_MB)
43 if (f->bits & SF_WC)
47 f->bits |= SF_MB;
H A Dvswscanf.c40 f.bits = SF_PRIVATE;
/ast/src/lib/libast/string/
H A Dfmtip4.c28 * and optional prefix bits (if 0 <= bits <= 32)
32 fmtip4(register uint32_t addr, int bits) argument
40 if (bits >= 0 && bits <= 32)
41 sfsprintf(buf + i, z - i, "/%d", bits);
H A Dstrtoip4.c29 * with optional prefix bits
37 * valid bits/masks match the egrep RE:
41 * if pbits!=0 and no bits/mask specified then trailing 0's in addr
52 register unsigned char bits; local
63 bits = 0;
118 bits = z;
128 bits++;
133 bits = 8;
135 bits = 16;
137 bits
[all...]
H A Dfmtip6.c74 * with optional prefix bits if 0 <= bits <= 128
79 fmtip6(const unsigned char* addr, int bits) argument
171 if (bits >= 0 && bits <= 128)
172 s = dec(s, "/", bits);
/ast/src/cmd/dsslib/ip_t/
H A Divfmt.c33 ivfmt(Iv_t* iv, const unsigned char* addr, int bits) argument
42 return fmtip6(addr, bits);
43 n = (iv->size + (bits >= 0)) * 4 + 1;
49 if (bits >= 0 && bits <= iv->size * 8)
50 sfsprintf(s, e - s, "/%d", bits);
H A Divstr.c32 ivstr(Iv_t* iv, const char* s, char** e, unsigned char* addr, unsigned char* bits) argument
40 return strtoip6(s, e, addr, bits);
52 if (bits)
65 *bits = n;
H A Dptvstats.c38 int bits; local
48 bits = a->size * 8;
49 if (!(addresses = (unsigned char**)newof(0, unsigned char, (2 * (bits + 1)) * (sizeof(unsigned char*) + a->size), 0)))
55 prefixes = addresses + bits + 1;
56 total_addresses = (unsigned char*)(prefixes + bits + 1);
59 for (i = 0; i <= bits; i++)
82 for (i = n = 0; i <= bits; i++)
/ast/src/lib/libz/
H A Dinffast.c47 state->bits < 8
57 - The maximum input bits used by a length/distance pair is 15 bits for the
58 length code, 5 bits for the length extra, 15 bits for the distance code,
59 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
86 unsigned bits; /* local strm->bits */ local
92 unsigned op; /* code bits, operatio
[all...]
H A Dinftrees.h14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bit member in struct:__anon451
[all...]
H A Dinfback.c83 unsigned sym, bits; local
94 bits = 9;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
101 bits = 5;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
126 bits = state->bits; \
137 state->bits = bits; \
144 bits
253 unsigned bits; /* bits in bit buffer */ local
[all...]
H A Dinflate.c30 * - Add comments on state->bits assertion in inffast.c
122 state->bits = 0;
128 int ZEXPORT inflatePrime(strm, bits, value)
130 int bits;
137 if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR;
138 value &= (1L << bits) - 1;
139 state->hold += value << state->bits;
140 state->bits
215 unsigned sym, bits; local
563 unsigned bits; /* bits in bit buffer */ local
[all...]
H A Dinftrees.c23 whose indices are 0..2^bits-1. work is a writable array of at least
27 on return points to the next available entry's address. bits is the
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
35 code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work)
37 int inflate_table(type, lens, codes, table, bits, work)
42 unsigned FAR *bits;
46 unsigned len; /* a code's length in bits */
49 unsigned root; /* number of index bits for root table */
50 unsigned curr; /* number of index bits fo
34 inflate_table(codetype type, unsigned short FAR *lens, unsigned codes, code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work) argument
[all...]
H A Dtrees.c47 /* Bit length codes must not exceed MAX_BL_BITS bits */
53 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
56 /* repeat a zero length 3-10 times (3 bits of repeat count) */
59 /* repeat a zero length 11-138 times (7 bits of repeat count) */
61 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
64 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
77 /* Number of bits used within bi_buf. (bi_buf might be implemented on
78 * more than 16 bits on some systems.)
99 * 5 bits
243 int bits; /* bit counter */ local
502 int bits; /* bit length */ local
584 int bits; /* bit index */ local
[all...]
H A Dsfdclzw.c62 #define BITS 16 /* Default bits. */
80 #define INIT_BITS 9 /* Initial number of bits/code. */
89 int zs_n_bits; /* Number of bits/code. */
90 int zs_maxbits; /* User settable max # bits/code. */
203 * Chars are 8 bits long.
218 register int bits, r_off; local
222 bits = n_bits;
229 * Since ocode is always >= 8 bits, only need to mask the first
234 bits -= (8 - r_off);
236 /* Get any 8 bit parts in the middle (<=1 for up to 16 bits)
307 register int r_off, bits; local
[all...]
/ast/src/lib/libvcodex/Vchuff/
H A Dvchbits.c22 /* Construct the code bits given their lengths.
44 ssize_t vchbits(ssize_t nsym, ssize_t* size, Vcbit_t* bits) argument
46 ssize_t vchbits(nsym, size, bits)
49 Vcbit_t* bits; /* encoding bits to be computed */
69 bits[sort[k]-size] = (b++) << (VC_BITSIZE - s);
H A Dvchtrie.c24 ** bits and computing the longest bit-string representing bytes that
33 #define TRIE_TOP 8 /* max #bits for top level */
34 #define TRIE_SUB 4 /* max #bits for sub levels */
42 static int bldtrie(Vchtrie_t* trie, ssize_t* clen, Vcbit_t* bits, argument
45 static int bldtrie(trie, clen, bits, root, len, sort, ns, lev)
48 Vcbit_t* bits; /* table of prefix codes */
62 if((s = clen[sort[k]-bits]) > m)
65 /* # of bits to pick out at this level */
100 z = clen[m = sort[k]-bits];
104 size[s] = z-olen; /* # bits t
150 vchbldtrie(ssize_t nsym, ssize_t* size, Vcbit_t* bits) argument
[all...]
/ast/src/lib/libast/include/
H A Dsfio_t.h39 unsigned short bits; /* private flags */ \
87 0, /* bits */ \
115 (f)->bits = 0, /* bits */ \
128 #define SFDCNEXT(sp,f) (((f)=(sp)->bits&SF_DCDOWN),(sp)->bits|=SF_DCDOWN)
131 #define SFDCPREV(sp,f) ((f)?(0):((sp)->bits&=~SF_DCDOWN))
/ast/src/cmd/vczip/tests/
H A Dtio.c37 vciosetb(&io, io.bits, io.nbits, VC_ENCODE);
54 vcioendb(&io, io.bits, io.nbits, VC_ENCODE);
57 vciosetb(&io, io.bits, io.nbits, VC_DECODE);
74 vcioendb(&io, io.bits, io.nbits, VC_DECODE);
106 vciosetb(&io, io.bits, io.nbits, VC_ENCODE);
109 vcioendb(&io, io.bits, io.nbits, VC_ENCODE);
113 vciosetb(&io, io.bits, io.nbits, VC_DECODE);
117 vcioendb(&io, io.bits, io.nbits, VC_DECODE);
/ast/src/lib/libast/sfio/
H A Dsffilbuf.c54 justseek = f->bits&SF_JUSTSEEK; f->bits &= ~SF_JUSTSEEK;
71 if(!(f->bits&SF_MMAP) && f->next > f->data &&
87 else if(!(f->flags&SF_STRING) && !(f->bits&SF_MMAP) )
90 if(f->bits&SF_MMAP)
H A Dsfmutex.c49 { if(f->bits&SF_PRIVATE)
H A Dsfmove.c109 if(n < 0 && (fr->bits&SF_MMAP) && !(fr->bits&SF_MVSIZE) )
111 fr->bits |= SF_SEQUENTIAL; /* sequentially access data */
129 if(!(fr->flags&SF_STRING) && !(fr->bits&SF_MMAP) &&
224 if(n < 0 && (fr->bits&SF_MMAP) && (fr->bits&SF_MVSIZE))
227 if((fr->bits&SF_SEQUENTIAL) && (fr->data))
229 fr->bits &= ~SF_SEQUENTIAL;
/ast/src/cmd/pack/
H A Dhuffencode.c34 static int bits[END+1]; variable
39 #define putbits(buff,left,bits,n) (left+=(n),buff=((buff<<(n))|(bits)))
74 bits[c] = n++;
106 putbits(buffer,left,bits[c],i);
/ast/src/cmd/dsslib/bgp/
H A Dbgp-table.c50 unsigned char bits; local
77 if (isdigit(*f) && !strtoip4(f, NiL, &addr, &bits) || !strtoip6(f, NiL, prefix, prefix + IP6BITS) && (file->caller = file))
98 state->route[0].bits = -1;
135 rp->bits = 0;
175 if (strtoip4(s, &p, &rp->addr.v4, &rp->bits))
184 if (rp->addr.v4 != op->addr.v4 || rp->bits != op->bits)
213 sfprintf(file->io, "%-16s ", fmtip4(rp->addr.v4, rp->bits));
/ast/src/cmd/codexlib/compress/
H A Dcompress.c69 #define BITS MAXBITS /* Default bits. */
85 #define INIT_BITS 9 /* Initial number of bits/code. */
94 int zs_n_bits; /* Number of bits/code. */
95 int zs_maxbits; /* User settable max # bits/code. */
210 * Chars are 8 bits long.
225 register int bits, r_off; local
229 bits = n_bits;
236 * Since ocode is always >= 8 bits, only need to mask the first
241 bits -= (8 - r_off);
243 /* Get any 8 bit parts in the middle (<=1 for up to 16 bits)
314 register int r_off, bits; local
[all...]

Completed in 270 milliseconds

123