Home
last modified time | relevance | path

Searched refs:dyn_dtree (Results 1 - 15 of 15) sorted by relevance

/third_party/node/deps/zlib/
H A Ddeflate.h203 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
350 s->dyn_dtree[d_code(dist)].Freq++; \
370 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dtrees.c444 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
461 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
803 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
851 send_tree(s, (ct_data *)s->dyn_dtree, dcodes - 1); /* distance tree */ in send_all_trees()
1069 (const ct_data *)s->dyn_dtree);
1115 s->dyn_dtree[d_code(dist)].Freq++;
H A Ddeflate.c1378 ds->d_desc.dyn_tree = ds->dyn_dtree; in deflateCopy()
/third_party/zlib/
H A Ddeflate.h203 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
347 s->dyn_dtree[d_code(dist)].Freq++; \
367 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dtrees.c461 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
478 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
826 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
875 send_tree(s, (ct_data *)s->dyn_dtree, dcodes - 1); /* distance tree */ in send_all_trees()
1094 (const ct_data *)s->dyn_dtree);
1140 s->dyn_dtree[d_code(dist)].Freq++;
H A Ddeflate.c1339 ds->d_desc.dyn_tree = ds->dyn_dtree; in deflateCopy()
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
H A 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 */
990 (const ct_data *)s->dyn_dtree);
1035 s->dyn_dtree[d_code(dist)].Freq++;
H A Ddeflate.c1202 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/libwebsockets/win32port/zlib/
H A Ddeflate.h193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
330 s->dyn_dtree[d_code(dist)].Freq++; \
H A 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);
1046 s->dyn_dtree[d_code(dist)].Freq++;
H A Ddeflate.c1024 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
H A 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++;
H A Ddeflate.c1194 ds->d_desc.dyn_tree = ds->dyn_dtree;

Completed in 28 milliseconds