Home
last modified time | relevance | path

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

/third_party/node/deps/zlib/
H A Ddeflate.h202 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
340 s->dyn_ltree[cc].Freq++; \
349 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
359 s->dyn_ltree[cc].Freq++; \
369 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
H A Dtrees.c443 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
447 s->dyn_ltree[END_BLOCK].Freq = 1; in init_block()
458 s->l_desc.dyn_tree = s->dyn_ltree; in _tr_init()
802 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); in build_bl_tree()
848 send_tree(s, (ct_data *)s->dyn_ltree, lcodes - 1); /* literal tree */ in send_all_trees()
963 * IN assertion: the fields Freq of dyn_ltree are set.
975 if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0)) in detect_data_type()
979 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0 in detect_data_type()
980 || s->dyn_ltree[1 in detect_data_type()
[all...]
H A Ddeflate.c1377 ds->l_desc.dyn_tree = ds->dyn_ltree; in deflateCopy()
/third_party/zlib/
H A Ddeflate.h202 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
337 s->dyn_ltree[cc].Freq++; \
346 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
356 s->dyn_ltree[cc].Freq++; \
366 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
H A Dtrees.c460 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
464 s->dyn_ltree[END_BLOCK].Freq = 1; in init_block()
475 s->l_desc.dyn_tree = s->dyn_ltree; in _tr_init()
825 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); in build_bl_tree()
872 send_tree(s, (ct_data *)s->dyn_ltree, lcodes - 1); /* literal tree */ in send_all_trees()
987 * IN assertion: the fields Freq of dyn_ltree are set.
1000 if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0)) in detect_data_type()
1004 if (s->dyn_ltree[INDEX_9].Freq != 0 || s->dyn_ltree[10].Freq != 0 in detect_data_type()
1005 || s->dyn_ltree[INDEX_1 in detect_data_type()
[all...]
H A Ddeflate.c1338 ds->l_desc.dyn_tree = ds->dyn_ltree; in deflateCopy()
/third_party/node/deps/v8/third_party/zlib/
H A 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++;
1101 * IN assertion: the fields Freq of dyn_ltree are set.
1115 if ((black_mask & 1) && (s->dyn_ltree[
[all...]
H A 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++; \
H A Ddeflate.c1201 ds->l_desc.dyn_tree = ds->dyn_ltree;
/third_party/libwebsockets/win32port/zlib/
H A 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);
1036 s->dyn_ltree[lc].Freq++;
1045 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1113 * IN assertion: the fields Freq of dyn_ltree are set.
1127 if ((black_mask & 1) && (s->dyn_ltree[
[all...]
H A Ddeflate.h192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
319 s->dyn_ltree[cc].Freq++; \
329 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
H A Ddeflate.c1023 ds->l_desc.dyn_tree = ds->dyn_ltree;
/third_party/skia/third_party/externals/zlib/
H A 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++;
1100 * IN assertion: the fields Freq of dyn_ltree are set.
1114 if ((black_mask & 1) && (s->dyn_ltree[
[all...]
H A 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++; \
H A Ddeflate.c1193 ds->l_desc.dyn_tree = ds->dyn_ltree;

Completed in 26 milliseconds