HomeSort by: relevance | last modified time | path
    Searched refs:L_CODES (Results 1 - 4 of 4) sorted by relevancy

  /src/common/dist/zlib/
trees.h 3 local const ct_data static_ltree[L_CODES+2] = {
deflate.h 42 #define L_CODES (LITERALS+1+LENGTH_CODES)
51 #define HEAP_SIZE (2*L_CODES+1)
215 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
222 uch depth[2*L_CODES+1];
trees.c 88 local ct_data static_ltree[L_CODES+2];
90 * need for the L_CODES extra codes used during heap construction. However
134 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
362 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
397 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
398 for (i = 0; i < L_CODES+2; i++) {
400 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
445 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
838 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
  /src/sys/net/
zlib.c 314 #define L_CODES (LITERALS+1+LENGTH_CODES)
323 #define HEAP_SIZE (2*L_CODES+1)
476 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
483 uch depth[2*L_CODES+1];
2060 local ct_data static_ltree[L_CODES+2];
2062 * need for the L_CODES extra codes used during heap construction. However
2092 local const ct_data static_ltree[L_CODES+2] = {
2230 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
2401 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
2437 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n")
    [all...]

Completed in 17 milliseconds