sys/net/zlib.c

356     int     max_code;            /* largest code with non zero frequency */
2246 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count);
2248 local void scan_tree(deflate_state *s, ct_data *tree, int max_code);
2249 local void send_tree(deflate_state *s, ct_data *tree, int max_code);
2589     int max_code         = desc->max_code;
2615         if (n > max_code) continue; /* not a leaf node */
2651             if (m > max_code) continue;
2672 	int max_code,			/* largest code with non zero frequency */
2691     Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
2693     for (n = 0;  n <= max_code; n++) {
2710  *     also updated if stree is not null. The field max_code is set.
2719     int max_code = -1; /* largest code with non zero frequency */
2730             s->heap[++(s->heap_len)] = max_code = n;
2743         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2749     desc->max_code = max_code;
2791     gen_codes ((ct_data *)tree, max_code, s->bl_count);
2800 	int max_code)	/* and its largest code of non zero frequency */
2811     tree[max_code+1].Len = (ush)0xffff; /* guard */
2813     for (n = 0; n <= max_code; n++) {
2844 	int max_code)	/* and its largest code of non zero frequency */
2854     /* tree[max_code+1].Len = -1; */  /* guard already set */
2857     for (n = 0; n <= max_code; n++) {
2897     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2898     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
3089         send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,