Searched refs:dyn_dtree (Results 1 – 20 of 20) sorted by relevance
/external/libwebsockets/win32port/zlib/ |
D | deflate.h | 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member 333 s->dyn_dtree[d_code(dist)].Freq++; \
|
D | trees.c | 394 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 *
|
D | deflate.c | 990 ds->d_desc.dyn_tree = ds->dyn_dtree;
|
/external/rust/crates/libz-sys/src/zlib/ |
D | deflate.h | 199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member 340 s->dyn_dtree[d_code(dist)].Freq++; \
|
D | trees.c | 387 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 *
|
D | deflate.c | 1150 ds->d_desc.dyn_tree = ds->dyn_dtree;
|
/external/python/cpython2/Modules/zlib/ |
D | deflate.h | 199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member 340 s->dyn_dtree[d_code(dist)].Freq++; \
|
D | trees.c | 387 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 *
|
D | deflate.c | 1150 ds->d_desc.dyn_tree = ds->dyn_dtree;
|
/external/zlib/ |
D | deflate.h | 199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member 337 s->dyn_dtree[d_code(dist)].Freq++; \
|
D | trees.c | 387 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++;
|
D | deflate.c | 1194 ds->d_desc.dyn_tree = ds->dyn_dtree;
|
/external/angle/third_party/zlib/ |
D | deflate.h | 199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member 337 s->dyn_dtree[d_code(dist)].Freq++; \
|
D | trees.c | 387 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++;
|
D | deflate.c | 1194 ds->d_desc.dyn_tree = ds->dyn_dtree;
|
/external/rust/crates/libz-sys/src/zlib-ng/ |
D | trees.c | 87 s->d_desc.dyn_tree = s->dyn_dtree; in zng_tr_init() 114 s->dyn_dtree[n].Freq = 0; in init_block() 531 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree() 586 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees() 702 compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree);
|
D | deflate_p.h | 52 s->dyn_dtree[d_code(dist)].Freq++; in zng_tr_tally_dist()
|
D | deflate.h | 208 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
|
D | deflate.c | 1130 ds->d_desc.dyn_tree = ds->dyn_dtree; in PREFIX()
|
/external/rust/crates/libz-sys/src/zlib-ng/test/abi/ |
D | zlib-v1.2.11-x86_64-linux-gnu.abi | 333 …<var-decl name='dyn_dtree' type-id='type-id-38' visibility='default' filepath='src.d/deflate.h' li…
|