Lines Matching full:distance

67 static const int extra_dbits[D_CODES] /* extra bits for each distance code */
91 /* The static distance tree. (Actually a trivial tree since all codes use
96 /* distance codes. The first 256 values correspond to the distances
108 /* First normalized distance for each code (0 = distance of 1) */
161 /* Mapping from a distance to a distance code. dist is the distance - 1 and
178     int dist;     /* distance index */  in tr_static_init()
230     /* The static distance tree is trivial: */  in tr_static_init()
511     /* The pkzip format requires that at least one distance code exists,  in build_tree()
569  * Scan a literal or distance tree to determine the frequencies of the codes
615  * Send a literal or distance tree in compressed form, using the codes in
676     /* Determine the bit length frequencies for literal and distance trees */  in build_bl_tree()
703  * lengths of the bit length codes, the literal tree and the distance tree.
731     send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */  in send_all_trees()
818 	/* Construct the literal and distance trees */
917 	unsigned dist,  /* distance of matched string */
929         dist--;             /* dist = match distance - 1 */
967 	ct_data *dtree  /* distance tree */
970     unsigned dist;      /* distance of matched string */
991             dist--; /* dist is now the match distance - 1 */
995             send_code(s, code, dtree);       /* send the distance code */
999                 send_bits(s, dist, extra);   /* send the extra distance bits */