Home
last modified time | relevance | path

Searched refs:D_CODES (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/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; dcod
[all...]
H A Ddefutil.h23 #define D_CODES 30 macro
171 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/kernel/linux/linux-6.6/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; dcod
[all...]
H A Ddefutil.h23 #define D_CODES 30 macro
171 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */

Completed in 5 milliseconds