484 static void put_32bit(ulg n)  in put_32bit()  argument
491 			*dst32 = n; /* unaligned LSB 32-bit store */  in put_32bit()
497 	put_16bit(n);  in put_32bit()
498 	put_16bit(n >> 16);  in put_32bit()
512 static void updcrc(uch *s, unsigned n)  in updcrc()  argument
514 	G1.crc = crc32_block_endian0(G1.crc, s, n, global_crc32_table /*G1.crc_32_tab*/);  in updcrc()
643 	unsigned n, m;  in fill_window()  local
667 		for (n = 0; n < HASH_SIZE; n++) {  in fill_window()
668 			m = head[n];  in fill_window()
669 			head[n] = (Pos) (m >= WSIZE ? m - WSIZE : 0);  in fill_window()
671 		for (n = 0; n < WSIZE; n++) {  in fill_window()
672 			m = G1.prev[n];  in fill_window()
673 			G1.prev[n] = (Pos) (m >= WSIZE ? m - WSIZE : 0);  in fill_window()
682 		n = file_read(G1.window + G1.strstart + G1.lookahead, more);  in fill_window()
683 		if (n == 0 || n == (unsigned) -1) {  in fill_window()
686 			G1.lookahead += n;  in fill_window()
1097 	int n; /* iterates over tree elements */  in init_block()  local
1100 	for (n = 0; n < L_CODES; n++)  in init_block()
1101 		G2.dyn_ltree[n].Freq = 0;  in init_block()
1102 	for (n = 0; n < D_CODES; n++)  in init_block()
1103 		G2.dyn_dtree[n].Freq = 0;  in init_block()
1104 	for (n = 0; n < BL_CODES; n++)  in init_block()
1105 		G2.bl_tree[n].Freq = 0;  in init_block()
1123 #define SMALLER(tree, n, m) \  argument
1124 	(tree[n].Freq < tree[m].Freq \
1125 	|| (tree[n].Freq == tree[m].Freq && G2.depth[n] <= G2.depth[m]))
1165 	int n, m;       /* iterate over the tree elements */  in gen_bitlen()  local
1182 		n = G2.heap[h];  in gen_bitlen()
1183 		bits = tree[tree[n].Dad].Len + 1;  in gen_bitlen()
1188 		tree[n].Len = (ush) bits;  in gen_bitlen()
1191 		if (n > desc->max_code)  in gen_bitlen()
1196 		if (n >= desc->extra_base)  in gen_bitlen()
1197 			xbits = desc->extra_bits[n - desc->extra_base];  in gen_bitlen()
1198 		f = tree[n].Freq;  in gen_bitlen()
1202 			G2.static_len += f * (desc->static_tree[n].Len + xbits);  in gen_bitlen()
1230 		n = G2.bl_count[bits];  in gen_bitlen()
1231 		while (n != 0) {  in gen_bitlen()
1240 			n--;  in gen_bitlen()
1260 	int n;                  /* code index */  in gen_codes()  local
1275 	for (n = 0; n <= max_code; n++) {  in gen_codes()
1276 		int len = tree[n].Len;  in gen_codes()
1281 		tree[n].Code = bi_reverse(next_code[len]++, len);  in gen_codes()
1284 			   (stderr, "\nn %3d %c l %2d c %4x (%x) ", n,  in gen_codes()
1285 				(n > ' ' ? n : ' '), len, tree[n].Code,  in gen_codes()
1317 	int n, m;			/* iterate over heap elements */  in build_tree()  local
1328 	for (n = 0; n < elems; n++) {  in build_tree()
1329 		if (tree[n].Freq != 0) {  in build_tree()
1330 			G2.heap[++G2.heap_len] = max_code = n;  in build_tree()
1331 			G2.depth[n] = 0;  in build_tree()
1333 			tree[n].Len = 0;  in build_tree()
1357 	for (n = G2.heap_len / 2; n >= 1; n--)  in build_tree()
1358 		pqdownheap(tree, n);  in build_tree()
1364 		PQREMOVE(tree, n);	/* n = node of least frequency */  in build_tree()
1367 		G2.heap[--G2.heap_max] = n;	/* keep the nodes sorted by frequency */  in build_tree()
1371 		tree[node].Freq = tree[n].Freq + tree[m].Freq;  in build_tree()
1372 		G2.depth[node] = MAX(G2.depth[n], G2.depth[m]) + 1;  in build_tree()
1373 		tree[n].Dad = tree[m].Dad = (ush) node;  in build_tree()
1377 					node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);  in build_tree()
1404 	int n;				/* iterates over all tree elements */  in scan_tree()  local
1418 	for (n = 0; n <= max_code; n++) {  in scan_tree()
1420 		nextlen = tree[n + 1].Len;  in scan_tree()
1456 	int n;				/* iterates over all tree elements */  in send_tree()  local
1468 	for (n = 0; n <= max_code; n++) {  in send_tree()
1470 		nextlen = tree[n + 1].Len;  in send_tree()
1971 	int n;				/* iterates over tree elements */  in ct_init()  local
1987 		for (n = 0; n < (1 << extra_lbits[code]); n++) {  in ct_init()
2002 		for (n = 0; n < (1 << extra_dbits[code]); n++) {  in ct_init()
2010 		for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {  in ct_init()
2020 	n = 0;  in ct_init()
2021 	while (n <= 143) {  in ct_init()
2022 		G2.static_ltree[n++].Len = 8;  in ct_init()
2026 	while (n <= 255) {  in ct_init()
2027 		G2.static_ltree[n++].Len = 9;  in ct_init()
2031 	while (n <= 279) {  in ct_init()
2032 		G2.static_ltree[n++].Len = 7;  in ct_init()
2036 	while (n <= 287) {  in ct_init()
2037 		G2.static_ltree[n++].Len = 8;  in ct_init()
2051 	for (n = 0; n < D_CODES; n++) {  in ct_init()
2052 		G2.static_dtree[n].Len = 5;  in ct_init()
2053 		G2.static_dtree[n].Code = bi_reverse(n, 5);  in ct_init()