Lines Matching refs:G2
957 #define G2 (*G2ptr)
983 ((dist) < 256 ? G2.dist_code[dist] : G2.dist_code[256 + ((dist)>>7)])
1000 G2.dyn_ltree[n].Freq = 0;
1002 G2.dyn_dtree[n].Freq = 0;
1004 G2.bl_tree[n].Freq = 0;
1006 G2.dyn_ltree[END_BLOCK].Freq = 1;
1007 G2.opt_len = G2.static_len = 0;
1008 G2.last_lit = G2.last_dist = G2.last_flags = 0;
1009 G2.flags = 0;
1010 G2.flag_bit = 1;
1025 || (tree[n].Freq == tree[m].Freq && G2.depth[n] <= G2.depth[m]))
1029 int v = G2.heap[k];
1032 while (j <= G2.heap_len) {
1034 if (j < G2.heap_len && SMALLER(tree, G2.heap[j + 1], G2.heap[j]))
1038 if (SMALLER(tree, v, G2.heap[j]))
1042 G2.heap[k] = G2.heap[j];
1048 G2.heap[k] = v;
1078 G2.bl_count[bits] = 0;
1083 tree[G2.heap[G2.heap_max]].Len = 0; /* root of the heap */
1085 for (h = G2.heap_max + 1; h < HEAP_SIZE; h++) {
1086 n = G2.heap[h];
1098 G2.bl_count[bits]++;
1103 G2.opt_len += (ulg) f *(bits + xbits);
1106 G2.static_len += (ulg) f * (stree[n].Len + xbits);
1117 while (G2.bl_count[bits] == 0)
1119 G2.bl_count[bits]--; /* move one leaf down the tree */
1120 G2.bl_count[bits + 1] += 2; /* move one overflow item as its brother */
1121 G2.bl_count[max_length]--;
1134 n = G2.bl_count[bits];
1136 m = G2.heap[--h];
1141 G2.opt_len += ((int32_t) bits - tree[m].Len) * tree[m].Freq;
1169 next_code[bits] = code = (code + G2.bl_count[bits - 1]) << 1;
1174 Assert(code + G2.bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
1186 Tracec(tree != G2.static_ltree,
1211 top = G2.heap[SMALLEST]; \
1212 G2.heap[SMALLEST] = G2.heap[G2.heap_len--]; \
1229 G2.heap_len = 0;
1230 G2.heap_max = HEAP_SIZE;
1234 G2.heap[++G2.heap_len] = max_code = n;
1235 G2.depth[n] = 0;
1246 while (G2.heap_len < 2) {
1247 int new = G2.heap[++G2.heap_len] = (max_code < 2 ? ++max_code : 0);
1250 G2.depth[new] = 0;
1251 G2.opt_len--;
1253 G2.static_len -= stree[new].Len;
1261 for (n = G2.heap_len / 2; n >= 1; n--)
1269 m = G2.heap[SMALLEST]; /* m = node of next least frequency */
1271 G2.heap[--G2.heap_max] = n; /* keep the nodes sorted by frequency */
1272 G2.heap[--G2.heap_max] = m;
1276 G2.depth[node] = MAX(G2.depth[n], G2.depth[m]) + 1;
1279 if (tree == G2.bl_tree) {
1285 G2.heap[SMALLEST] = node++;
1288 } while (G2.heap_len >= 2);
1290 G2.heap[--G2.heap_max] = G2.heap[SMALLEST];
1331 G2.bl_tree[curlen].Freq += count;
1334 G2.bl_tree[curlen].Freq++;
1335 G2.bl_tree[REP_3_6].Freq++;
1337 G2.bl_tree[REPZ_3_10].Freq++;
1339 G2.bl_tree[REPZ_11_138].Freq++;
1382 SEND_CODE(curlen, G2.bl_tree);
1386 SEND_CODE(curlen, G2.bl_tree);
1390 SEND_CODE(REP_3_6, G2.bl_tree);
1393 SEND_CODE(REPZ_3_10, G2.bl_tree);
1396 SEND_CODE(REPZ_11_138, G2.bl_tree);
1424 scan_tree(G2.dyn_ltree, G2.l_desc.max_code);
1425 scan_tree(G2.dyn_dtree, G2.d_desc.max_code);
1428 build_tree(&G2.bl_desc);
1438 if (G2.bl_tree[bl_order[max_blindex]].Len != 0)
1442 G2.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
1443 Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", G2.opt_len, G2.static_len));
1467 send_bits(G2.bl_tree[bl_order[rank]].Len, 3);
1471 send_tree((ct_data *) G2.dyn_ltree, lcodes - 1); /* send the literal tree */
1474 send_tree((ct_data *) G2.dyn_dtree, dcodes - 1); /* send the distance tree */
1485 G1.l_buf[G2.last_lit++] = lc;
1488 G2.dyn_ltree[lc].Freq++;
1497 G2.dyn_ltree[G2.length_code[lc] + LITERALS + 1].Freq++;
1498 G2.dyn_dtree[D_CODE(dist)].Freq++;
1500 G1.d_buf[G2.last_dist++] = dist;
1501 G2.flags |= G2.flag_bit;
1503 G2.flag_bit <<= 1;
1506 if ((G2.last_lit & 7) == 0) {
1507 G2.flag_buf[G2.last_flags++] = G2.flags;
1508 G2.flags = 0;
1509 G2.flag_bit = 1;
1512 if ((G2.last_lit & 0xfff) == 0) {
1514 ulg out_length = G2.last_lit * 8L;
1519 out_length += G2.dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]);
1524 G2.last_lit, G2.last_dist, in_length, out_length,
1526 if (G2.last_dist < G2.last_lit / 2 && out_length < in_length / 2)
1529 return (G2.last_lit == LIT_BUFSIZE - 1 || G2.last_dist == DIST_BUFSIZE);
1550 if (G2.last_lit != 0) do {
1552 flag = G2.flag_buf[fx++];
1559 code = G2.length_code[lc];
1563 lc -= G2.base_length[code];
1574 dist -= G2.base_dist[code];
1579 } while (lx < G2.last_lit);
1595 G2.flag_buf[G2.last_flags] = G2.flags; /* Save the flags for the last 8 items */
1598 build_tree(&G2.l_desc);
1599 Tracev((stderr, "\nlit data: dyn %ld, stat %ld", G2.opt_len, G2.static_len));
1601 build_tree(&G2.d_desc);
1602 Tracev((stderr, "\ndist data: dyn %ld, stat %ld", G2.opt_len, G2.static_len));
1613 opt_lenb = (G2.opt_len + 3 + 7) >> 3;
1614 static_lenb = (G2.static_len + 3 + 7) >> 3;
1618 opt_lenb, G2.opt_len, static_lenb, G2.static_len, stored_len,
1619 G2.last_lit, G2.last_dist));
1628 if (stored_len <= opt_lenb && eof && G2.compressed_len == 0L && seekable()) {
1634 G2.compressed_len = stored_len << 3;
1645 G2.compressed_len = (G2.compressed_len + 3 + 7) & ~7L;
1646 G2.compressed_len += (stored_len + 4) << 3;
1652 compress_block((ct_data *) G2.static_ltree, (ct_data *) G2.static_dtree);
1653 G2.compressed_len += 3 + G2.static_len;
1656 send_all_trees(G2.l_desc.max_code + 1, G2.d_desc.max_code + 1,
1658 compress_block((ct_data *) G2.dyn_ltree, (ct_data *) G2.dyn_dtree);
1659 G2.compressed_len += 3 + G2.opt_len;
1661 Assert(G2.compressed_len == G1.bits_sent, "bad compressed size");
1666 G2.compressed_len += 7; /* align on byte boundary */
1668 Tracev((stderr, "\ncomprlen %lu(%lu) ", G2.compressed_len >> 3,
1669 G2.compressed_len - 7 * eof));
1671 return G2.compressed_len >> 3;
1892 G2.compressed_len = 0L;
1895 if (G2.static_dtree[0].Len != 0)
1902 G2.base_length[code] = length;
1904 G2.length_code[length++] = code;
1912 G2.length_code[length - 1] = code;
1917 G2.base_dist[code] = dist;
1919 G2.dist_code[dist++] = code;
1925 G2.base_dist[code] = dist << 7;
1927 G2.dist_code[256 + dist++] = code;
1935 G2.bl_count[n] = 0; */
1939 G2.static_ltree[n++].Len = 8;
1940 G2.bl_count[8]++;
1943 G2.static_ltree[n++].Len = 9;
1944 G2.bl_count[9]++;
1947 G2.static_ltree[n++].Len = 7;
1948 G2.bl_count[7]++;
1951 G2.static_ltree[n++].Len = 8;
1952 G2.bl_count[8]++;
1958 gen_codes((ct_data *) G2.static_ltree, L_CODES + 1);
1962 G2.static_dtree[n].Len = 5;
1963 G2.static_dtree[n].Code = bi_reverse(n, 5);
2048 G2.l_desc.dyn_tree = G2.dyn_ltree;
2049 G2.l_desc.static_tree = G2.static_ltree;
2050 G2.l_desc.extra_bits = extra_lbits;
2051 G2.l_desc.extra_base = LITERALS + 1;
2052 G2.l_desc.elems = L_CODES;
2053 G2.l_desc.max_length = MAX_BITS;
2054 //G2.l_desc.max_code = 0;
2056 G2.d_desc.dyn_tree = G2.dyn_dtree;
2057 G2.d_desc.static_tree = G2.static_dtree;
2058 G2.d_desc.extra_bits = extra_dbits;
2059 //G2.d_desc.extra_base = 0;
2060 G2.d_desc.elems = D_CODES;
2061 G2.d_desc.max_length = MAX_BITS;
2062 //G2.d_desc.max_code = 0;
2064 G2.bl_desc.dyn_tree = G2.bl_tree;
2065 //G2.bl_desc.static_tree = NULL;
2066 G2.bl_desc.extra_bits = extra_blbits,
2067 //G2.bl_desc.extra_base = 0;
2068 G2.bl_desc.elems = BL_CODES;
2069 G2.bl_desc.max_length = MAX_BL_BITS;
2070 //G2.bl_desc.max_code = 0;