Home
last modified time | relevance | path

Searched refs:static_ltree (Results 1 – 4 of 4) sorted by relevance

/external/qemu/distrib/zlib-1.2.3/
Dtrees.c90 local ct_data static_ltree[L_CODES+2]; variable
130 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
253 static_l_desc.static_tree = static_ltree; in tr_static_init()
295 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
296 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
297 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
298 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
303 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
341 fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code, in gen_trees_header()
342 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
[all …]
Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = { variable
/external/zlib/
Dtrees.c91 local ct_data static_ltree[L_CODES+2]; variable
131 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
255 static_l_desc.static_tree = static_ltree; in tr_static_init()
298 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
299 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
300 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
301 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
306 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
344 fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code, in gen_trees_header()
345 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
[all …]
Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = { variable