Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/lib/zlib_deflate/
H A Ddefutil.h20 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
29 #define HEAP_SIZE (2*L_CODES+1)
181 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
188 uch depth[2*L_CODES+1];
H A Ddeftree.c83 static ct_data static_ltree[L_CODES+2];
85 * need for the L_CODES extra codes used during heap construction. However
119 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
228 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
279 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
716 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
/kernel/linux/linux-6.6/lib/zlib_deflate/
H A Ddefutil.h20 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
29 #define HEAP_SIZE (2*L_CODES+1)
181 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
188 uch depth[2*L_CODES+1];
H A Ddeftree.c83 static ct_data static_ltree[L_CODES+2];
85 * need for the L_CODES extra codes used during heap construction. However
119 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
228 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
279 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
716 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()

Completed in 5 milliseconds