Home
last modified time | relevance | path

Searched refs:dyn_dtree (Results 1 – 24 of 24) sorted by relevance

/third_party/libwebsockets/win32port/zlib/
Ddeflate.h193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
333 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c394 s->d_desc.dyn_tree = s->dyn_dtree;
422 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
864 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
1001 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1045 s->dyn_dtree[d_code(dist)].Freq++;
1056 out_length += (ulg)s->dyn_dtree[dcode].Freq *
Ddeflate.c990 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/uboot/u-boot-2020.01/lib/zlib/
Ddeflate.h193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
333 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c394 s->d_desc.dyn_tree = s->dyn_dtree;
422 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
864 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
1001 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1045 s->dyn_dtree[d_code(dist)].Freq++;
1056 out_length += (ulg)s->dyn_dtree[dcode].Freq *
Ddeflate.c977 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/boost/libs/beast/test/extern/zlib-1.2.11/
Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
340 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
989 (const ct_data *)s->dyn_dtree);
1033 s->dyn_dtree[d_code(dist)].Freq++;
1044 out_length += (ulg)s->dyn_dtree[dcode].Freq *
Ddeflate.c1150 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/boost/tools/boost_install/test/iostreams/zlib-1.2.11/
Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
340 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
989 (const ct_data *)s->dyn_dtree);
1033 s->dyn_dtree[d_code(dist)].Freq++;
1044 out_length += (ulg)s->dyn_dtree[dcode].Freq *
Ddeflate.c1150 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/zlib/
Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
989 (const ct_data *)s->dyn_dtree);
1034 s->dyn_dtree[d_code(dist)].Freq++;
Ddeflate.c1184 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/flutter/skia/third_party/externals/zlib/
Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
989 (const ct_data *)s->dyn_dtree);
1034 s->dyn_dtree[d_code(dist)].Freq++;
Ddeflate.c1234 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/skia/third_party/externals/zlib/
Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
989 (const ct_data *)s->dyn_dtree);
1034 s->dyn_dtree[d_code(dist)].Freq++;
Ddeflate.c1194 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/node/deps/zlib/
Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
989 (const ct_data *)s->dyn_dtree);
1034 s->dyn_dtree[d_code(dist)].Freq++;
Ddeflate.c1185 ds->d_desc.dyn_tree = ds->dyn_dtree;