Home
last modified time | relevance | path

Searched refs:dyn_ltree (Results 1 – 15 of 15) sorted by relevance

/third_party/skia/third_party/externals/zlib/
Dtrees.c384 s->l_desc.dyn_tree = s->dyn_ltree;
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
417 s->dyn_ltree[END_BLOCK].Freq = 1;
805 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
853 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
988 compress_block(s, (const ct_data *)s->dyn_ltree,
1024 s->dyn_ltree[lc].Freq++;
1033 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1114 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1118 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
Ddeflate.h198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
326 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
Ddeflate.c1193 ds->l_desc.dyn_tree = ds->dyn_ltree;
/third_party/node/deps/zlib/
Dtrees.c384 s->l_desc.dyn_tree = s->dyn_ltree;
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
417 s->dyn_ltree[END_BLOCK].Freq = 1;
805 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
853 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
988 compress_block(s, (const ct_data *)s->dyn_ltree,
1024 s->dyn_ltree[lc].Freq++;
1033 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1114 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1118 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
Ddeflate.h198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
326 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
Ddeflate.c1184 ds->l_desc.dyn_tree = ds->dyn_ltree;
/third_party/flutter/skia/third_party/externals/zlib/
Dtrees.c384 s->l_desc.dyn_tree = s->dyn_ltree;
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
417 s->dyn_ltree[END_BLOCK].Freq = 1;
805 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
853 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
988 compress_block(s, (const ct_data *)s->dyn_ltree,
1024 s->dyn_ltree[lc].Freq++;
1033 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1114 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1118 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
Ddeflate.h198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
326 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
Ddeflate.c1233 ds->l_desc.dyn_tree = ds->dyn_ltree;
/third_party/zlib/
Dtrees.c384 s->l_desc.dyn_tree = s->dyn_ltree;
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
417 s->dyn_ltree[END_BLOCK].Freq = 1;
805 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
853 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
989 compress_block(s, (const ct_data *)s->dyn_ltree,
1025 s->dyn_ltree[lc].Freq++;
1034 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1115 if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1119 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
Ddeflate.h198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
326 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
Ddeflate.c1189 ds->l_desc.dyn_tree = ds->dyn_ltree;
/third_party/libwebsockets/win32port/zlib/
Dtrees.c391 s->l_desc.dyn_tree = s->dyn_ltree;
421 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
425 s->dyn_ltree[END_BLOCK].Freq = 1;
813 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
861 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
1001 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1035 s->dyn_ltree[lc].Freq++;
1044 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1149 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1153 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
Ddeflate.h192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
323 s->dyn_ltree[cc].Freq++; \
332 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
Ddeflate.c989 ds->l_desc.dyn_tree = ds->dyn_ltree;