Home
last modified time | relevance | path

Searched refs:D_CODES (Results 1 – 5 of 5) sorted by relevance

/openbmc/u-boot/lib/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
98 local ct_data static_dtree[D_CODES];
115 local int base_dist[D_CODES];
134 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
287 for ( ; code < D_CODES; code++) { in tr_static_init()
309 for (n = 0; n < D_CODES; n++) { in tr_static_init()
349 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
351 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
374 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
376 SEPARATOR(i, D_CODES-1, 10)); in gen_trees_header()
[all …]
H A Ddeflate.h39 #define D_CODES 30 macro
193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/openbmc/linux/lib/zlib_deflate/
H A Ddeftree.c67 static const int extra_dbits[D_CODES] /* extra bits for each distance code */
90 static ct_data static_dtree[D_CODES];
107 static int base_dist[D_CODES];
122 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
209 for ( ; code < D_CODES; code++) { in tr_static_init()
231 for (n = 0; n < D_CODES; n++) { in tr_static_init()
280 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
716 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
932 (ush)d_code(dist) < (ush)D_CODES, "zlib_tr_tally: bad match");
944 for (dcode = 0; dcode < D_CODES; dcode++) {
[all …]
H A Ddefutil.h23 #define D_CODES 30 macro
171 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */