107 	ulong	bits;				/* bit shift register */  member
135 	short	bits;				/* length of the code */  member
159 static	void	lzput(LZstate*, ulong bits, int nbits);
231 		litlentab[i].bits = 8;  in deflateinit()
233 		litlentab[i].bits = 9;  in deflateinit()
235 		litlentab[i].bits = 7;  in deflateinit()
237 		litlentab[i].bits = 8;  in deflateinit()
250 		offtab[i].bits = 5;  in deflateinit()
308 	lz->bits = 0;  in deflatereset()
503 		lzput(lz, dlitlentab[DeflateEob].encode, dlitlentab[DeflateEob].bits);  in deflateb()
515 		lzput(lz, hlitlentab[DeflateEob].encode, hlitlentab[DeflateEob].bits);  in deflateb()
520 		lzput(lz, litlentab[DeflateEob].encode, litlentab[DeflateEob].bits);  in deflateb()
553 lzput(LZstate *lz, ulong bits, int nbits)  in lzput()  argument
555 	bits = (bits << lz->nbits) | lz->bits;  in lzput()
557 		*lz->out++ = bits;  in lzput()
560 		bits >>= 8;  in lzput()
562 	lz->bits = bits;  in lzput()
616 				lzput(out, litlentab[lit].encode, litlentab[lit].bits);  in wrblock()
631 		lzput(out, litlentab[c].encode, litlentab[c].bits);  in wrblock()
640 		lzput(out, offtab[c].encode, offtab[c].bits);  in wrblock()
923 	for(nlit = Nlitlen; nlit > 257 && littab[nlit-1].bits == 0; nlit--)  in huffcodes()
925 	for(noff = Noff; noff > 1 && offtab[noff-1].bits == 0; noff--)  in huffcodes()
932 		codes[i] = littab[i].bits;  in huffcodes()
934 		codes[i + nlit] = offtab[i].bits;  in huffcodes()
986 	for(nclen = Nclen; nclen > 4 && codetab[clenorder[nclen-1]].bits == 0; nclen--)  in huffcodes()
1014 		lzput(out, codetab[clenorder[i]].bits, 3);  in wrdyncode()
1021 		lzput(out, codetab[v].encode, codetab[v].bits);  in wrdyncode()
1041 		tot += count[i] * tab[i].bits;  in bitcost()
1053 		if(tab[i].bits == -1)  in mkgzprecode()
1054 			tab[i].bits = 0;  in mkgzprecode()
1055 		else if(tab[i].bits == 0){  in mkgzprecode()
1061 			tab[i].bits = 1;  in mkgzprecode()
1073 	int i, bits;  in hufftabinit()  local
1076 	for(bits = 1; bits <= nbits; bits++){  in hufftabinit()
1077 		code = (code + bitcount[bits-1]) << 1;  in hufftabinit()
1078 		nc[bits] = code;  in hufftabinit()
1082 		bits = tab[i].bits;  in hufftabinit()
1083 		if(bits){  in hufftabinit()
1084 			code = nc[bits]++ << (16 - bits);  in hufftabinit()
1133 	int i, m, em, bits;  in mkprecode()  local
1140 		tab[i].bits = -1;  in mkprecode()
1150 			tab[cs.leafmap[0]].bits = 0;  in mkprecode()
1191 	bits = 0;  in mkprecode()
1195 		bitcount[bits++] -= m;  in mkprecode()
1196 		bitcount[bits] = m;  in mkprecode()
1199 	for(i = bits; i >= 0; i--)  in mkprecode()
1201 			tab[cs.leafmap[m]].bits = i;  in mkprecode()
1203 	return bits;  in mkprecode()