Searched defs:BITS (Results 1 - 7 of 7) sorted by relevance
/ast/src/lib/libz/ |
H A D | infback.c | 181 #define BITS(n) \ macro 291 state->last = BITS(1); 293 switch (BITS(2)) { 352 state->nlen = BITS(5) + 257; 354 state->ndist = BITS(5) + 1; 356 state->ncode = BITS(4) + 4; 371 state->lens[order[state->have++]] = (unsigned short)BITS(3); 392 this = state->lencode[BITS(state->lenbits)]; 411 copy = 3 + BITS(2); 418 copy = 3 + BITS( [all...] |
H A D | inflate.c | 450 #define BITS(n) \ macro 492 the requested bits are not available. The typical use of the BITS macros 496 ... do something with BITS(n) ... 500 input left to load n bits into the accumulator, or it continues. BITS(n) 505 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 521 keep[want++] = BITS(n); 610 ((BITS(8) << 8) + (hold >> 8)) % 31) { 615 if (BITS(4) != Z_DEFLATED) { 621 len = BITS(4) + 8; 782 state->last = BITS( [all...] |
H A D | sfdclzw.c | 62 #define BITS 16 /* Default bits. */ macro 65 /* A code_int must be able to hold 2**BITS values of type int, and also -1. */ 109 char_type zs_buf[BITS]; 122 char_type zs_gbuf[BITS]; 162 * the codetab. The tab_suffix table needs 2**BITS characters. We get this 173 #define de_stack ((char_type *)&tab_suffixof(1 << BITS)) 205 * Maintain a BITS character long buffer (so that 8 codes will 643 if (maxbits > BITS) 770 maxbits = BITS; /* fixed max # bits/code. */
|
/ast/src/lib/libcmd/ |
H A D | stty.c | 101 #define BITS 2 macro 308 { "cr0", BITS, O_FLAG, IG|SS, CRDLY, CR0 }, 309 { "cr1", BITS, O_FLAG, US, CRDLY, CR1 }, 310 { "cr2", BITS, O_FLAG, US, CRDLY, CR2 }, 311 { "cr3", BITS, O_FLAG, US, CRDLY, CR3 }, 314 { "nl0", BITS, O_FLAG, IG|US, NLDLY, NL0 }, 315 { "nl1", BITS, O_FLAG, US, NLDLY, NL1 }, 320 { "tab0", BITS, O_FLAG, IG|SS, TABDLY, TAB0 }, 323 { "tab1", BITS, O_FLAG, US, TABDLY, TAB1 }, 326 { "tab2", BITS, O_FLA [all...] |
/ast/src/cmd/codexlib/compress/ |
H A D | compress.c | 69 #define BITS MAXBITS /* Default bits. */ macro 72 /* A code_int must be able to hold 2**BITS values of type int, and also -1. */ 115 char_type zs_buf[BITS]; 128 char_type zs_gbuf[BITS]; 169 * the codetab. The tab_suffix table needs 2**BITS characters. We get this 180 #define de_stack ((char_type *)&tab_suffixof(1 << BITS)) 212 * Maintain a BITS character long buffer (so that 8 codes will 458 maxbits = BITS; 512 if (maxbits > BITS)
|
/ast/src/lib/libast/vmalloc/ |
H A D | vmhdr.h | 161 /* Blocks are allocated such that their sizes are 0%(BITS+1) 167 #define BITS (07) /* (BUSY|PFREE|JUNK) */ macro 168 #define ALIGNB (8) /* size must be a multiple of BITS+1 */ 170 #define ISBITS(w) ((w) & BITS) 171 #define CLRBITS(w) ((w) &= ~BITS) 172 #define CPYBITS(w,f) ((w) |= ((f)&BITS) ) 204 ** It should also be a multiple of ALIGNB==(BITS+1) so the size field 205 ** of Block_t will always be 0%(BITS+1) as noted above. 395 #define PFDATA(d) ((Head_t*)((Vmuchar_t*)(d)+(SIZE(BLOCK(d))&~BITS)-sizeof(Head_t)) ) 419 #define DBBSIZE(d) (SIZE(DBBLOCK(d)) & ~BITS) [all...] |
/ast/src/cmd/INIT/ |
H A D | ratz.c | 2669 #define BITS(n) \ macro 2711 the requested bits are not available. The typical use of the BITS macros 2715 ... do something with BITS(n) ... 2719 input left to load n bits into the accumulator, or it continues. BITS(n) 2724 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 2740 keep[want++] = BITS(n); 2829 ((BITS(8) << 8) + (hold >> 8)) % 31) { 2834 if (BITS(4) != Z_DEFLATED) { 2840 len = BITS(4) + 8; 3001 state->last = BITS( [all...] |
Completed in 1675 milliseconds