174     int n;        /* iterates over tree elements */  in tr_static_init()  local
188         for (n = 0; n < (1<<extra_lbits[code]); n++) {  in tr_static_init()
203         for (n = 0; n < (1<<extra_dbits[code]); n++) {  in tr_static_init()
211         for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {  in tr_static_init()
219     n = 0;  in tr_static_init()
220     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
221     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;  in tr_static_init()
222     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;  in tr_static_init()
223     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
231     for (n = 0; n < D_CODES; n++) {  in tr_static_init()
232         static_dtree[n].Len = 5;  in tr_static_init()
233         static_dtree[n].Code = bitrev32((u32)n) >> (32 - 5);  in tr_static_init()
276     int n; /* iterates over tree elements */  in init_block()  local
279     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;  in init_block()
280     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;  in init_block()
281     for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;  in init_block()
307 #define smaller(tree, n, m, depth) \  argument
308    (tree[n].Freq < tree[m].Freq || \
309    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
365     int n, m;           /* iterate over the tree elements */  in gen_bitlen()  local
379         n = s->heap[h];  in gen_bitlen()
380         bits = tree[tree[n].Dad].Len + 1;  in gen_bitlen()
382         tree[n].Len = (ush)bits;  in gen_bitlen()
385         if (n > max_code) continue; /* not a leaf node */  in gen_bitlen()
389         if (n >= base) xbits = extra[n-base];  in gen_bitlen()
390         f = tree[n].Freq;  in gen_bitlen()
392         if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);  in gen_bitlen()
418         n = s->bl_count[bits];  in gen_bitlen()
419         while (n != 0) {  in gen_bitlen()
428             n--;  in gen_bitlen()
450     int n;                     /* code index */  in gen_codes()  local
465     for (n = 0;  n <= max_code; n++) {  in gen_codes()
466         int len = tree[n].Len;  in gen_codes()
469         tree[n].Code = bitrev32((u32)(next_code[len]++)) >> (32 - len);  in gen_codes()
472              n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));  in gen_codes()
492     int n, m;          /* iterate over heap elements */  in build_tree()  local
502     for (n = 0; n < elems; n++) {  in build_tree()
503         if (tree[n].Freq != 0) {  in build_tree()
504             s->heap[++(s->heap_len)] = max_code = n;  in build_tree()
505             s->depth[n] = 0;  in build_tree()
507             tree[n].Len = 0;  in build_tree()
528     for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);  in build_tree()
535         pqremove(s, tree, n);  /* n = node of least frequency */  in build_tree()
538         s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */  in build_tree()
542         tree[node].Freq = tree[n].Freq + tree[m].Freq;  in build_tree()
543         s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1);  in build_tree()
544         tree[n].Dad = tree[m].Dad = (ush)node;  in build_tree()
548                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);  in build_tree()
578     int n;                     /* iterates over all tree elements */  in scan_tree()  local
589     for (n = 0; n <= max_code; n++) {  in scan_tree()
590         curlen = nextlen; nextlen = tree[n+1].Len;  in scan_tree()
624     int n;                     /* iterates over all tree elements */  in send_tree()  local
635     for (n = 0; n <= max_code; n++) {  in send_tree()
636         curlen = nextlen; nextlen = tree[n+1].Len;  in send_tree()
1022     int n = 0;  local
1025     while (n < 7)        bin_freq += s->dyn_ltree[n++].Freq;
1026     while (n < 128)    ascii_freq += s->dyn_ltree[n++].Freq;
1027     while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;