275     int code;     /* code value */  in tr_static_init()  local
291     for (code = 0; code < LENGTH_CODES-1; code++) {  in tr_static_init()
292         base_length[code] = length;  in tr_static_init()
293         for (n = 0; n < (1<<extra_lbits[code]); n++) {  in tr_static_init()
294             _length_code[length++] = (uch)code;  in tr_static_init()
302     _length_code[length-1] = (uch)code;  in tr_static_init()
306     for (code = 0 ; code < 16; code++) {  in tr_static_init()
307         base_dist[code] = dist;  in tr_static_init()
308         for (n = 0; n < (1<<extra_dbits[code]); n++) {  in tr_static_init()
309             _dist_code[dist++] = (uch)code;  in tr_static_init()
314     for ( ; code < D_CODES; code++) {  in tr_static_init()
315         base_dist[code] = dist << 7;  in tr_static_init()
316         for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {  in tr_static_init()
317             _dist_code[256 + dist++] = (uch)code;  in tr_static_init()
620     ush code = 0;              /* running code value */  in gen_codes()  local
628         next_code[bits] = code = (ush)((code + bl_count[bits-1]) << 1);  in gen_codes()
633     Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,  in gen_codes()
1145     unsigned code;      /* the code to send */  local
1160             code = _length_code[lc];
1161             send_code(s, code+LITERALS+1, ltree); /* send the length code */
1162             extra = extra_lbits[code];
1164                 lc -= base_length[code];
1168             code = d_code(dist);
1169             Assert (code < D_CODES, "bad d_code");
1171             send_code(s, code, dtree);       /* send the distance code */
1172             extra = extra_dbits[code];
1174                 dist -= base_dist[code];
1219 bi_reverse(unsigned code, int len)  argument
1223         res |= code & 1;
1224         code >>= 1;