239     int code;     /* code value */  in tr_static_init()  local
257     for (code = 0; code < LENGTH_CODES-1; code++) {  in tr_static_init()
258         base_length[code] = length;  in tr_static_init()
259         for (n = 0; n < (1<<extra_lbits[code]); n++) {  in tr_static_init()
260             _length_code[length++] = (uch)code;  in tr_static_init()
268     _length_code[length-1] = (uch)code;  in tr_static_init()
272     for (code = 0 ; code < 16; code++) {  in tr_static_init()
273         base_dist[code] = dist;  in tr_static_init()
274         for (n = 0; n < (1<<extra_dbits[code]); n++) {  in tr_static_init()
275             _dist_code[dist++] = (uch)code;  in tr_static_init()
280     for ( ; code < D_CODES; code++) {  in tr_static_init()
281         base_dist[code] = dist << 7;  in tr_static_init()
282         for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {  in tr_static_init()
283             _dist_code[256 + dist++] = (uch)code;  in tr_static_init()
578     unsigned code = 0;         /* running code value */  local
586         code = (code + bl_count[bits-1]) << 1;
587         next_code[bits] = (ush)code;
592     Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
1072     unsigned code;      /* the code to send */  local
1083             code = _length_code[lc];
1084             send_code(s, code+LITERALS+1, ltree); /* send the length code */
1085             extra = extra_lbits[code];
1087                 lc -= base_length[code];
1091             code = d_code(dist);
1092             Assert (code < D_CODES, "bad d_code");
1094             send_code(s, code, dtree);       /* send the distance code */
1095             extra = extra_dbits[code];
1097                 dist -= (unsigned)base_dist[code];
1158 local unsigned bi_reverse(code, len)  in bi_reverse()  argument
1159     unsigned code; /* the value to invert */  in bi_reverse()
1164         res |= code & 1;
1165         code >>= 1, res <<= 1;