| /src/common/dist/zlib/ |
| deflate.h | 205 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state
349 s->dyn_dtree[d_code(dist)].Freq++; \
369 s->dyn_dtree[d_code(dist)].Freq++; \
|
| deflate.h | 205 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state
349 s->dyn_dtree[d_code(dist)].Freq++; \
369 s->dyn_dtree[d_code(dist)].Freq++; \
|
| /src/sys/net/ |
| zlib.c | 466 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state
596 s->dyn_dtree[d_code(dist)].Freq++; \
1260 ds->d_desc.dyn_tree = ds->dyn_dtree;
2487 s->d_desc.dyn_tree = s->dyn_dtree;
2514 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2898 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2947 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
3091 compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree);
3135 s->dyn_dtree[d_code(dist)].Freq++;
3146 out_length += (ulg)s->dyn_dtree[dcode].Freq
[all...] |
| zlib.c | 466 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state
596 s->dyn_dtree[d_code(dist)].Freq++; \
1260 ds->d_desc.dyn_tree = ds->dyn_dtree;
2487 s->d_desc.dyn_tree = s->dyn_dtree;
2514 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2898 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2947 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
3091 compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree);
3135 s->dyn_dtree[d_code(dist)].Freq++;
3146 out_length += (ulg)s->dyn_dtree[dcode].Freq
[all...] |
