Home
last modified time | relevance | path

Searched refs:d_desc (Results 1 – 16 of 16) sorted by relevance

/third_party/node/deps/zlib/
Dtrees.c461 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
462 s->d_desc.stat_desc = &static_d_desc; in _tr_init()
803 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
1013 build_tree(s, (tree_desc *)(&(s->d_desc)));
1066 send_all_trees(s, s->l_desc.max_code + 1, s->d_desc.max_code + 1,
Ddeflate.h207 struct tree_desc_s d_desc; /* desc. for distance tree */ member
Ddeflate.c1378 ds->d_desc.dyn_tree = ds->dyn_dtree; in deflateCopy()
/third_party/skia/third_party/externals/zlib/
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
388 s->d_desc.stat_desc = &static_d_desc;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
932 build_tree(s, (tree_desc *)(&(s->d_desc)));
986 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,
Ddeflate.h203 struct tree_desc_s d_desc; /* desc. for distance tree */ member
Ddeflate.c1194 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/libwebsockets/win32port/zlib/
Dtrees.c394 s->d_desc.dyn_tree = s->dyn_dtree;
395 s->d_desc.stat_desc = &static_d_desc;
814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
946 build_tree(s, (tree_desc *)(&(s->d_desc)));
999 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,
Ddeflate.h197 struct tree_desc_s d_desc; /* desc. for distance tree */ member
Ddeflate.c990 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/zlib/
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
388 s->d_desc.stat_desc = &static_d_desc;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
933 build_tree(s, (tree_desc *)(&(s->d_desc)));
986 send_all_trees(s, s->l_desc.max_code + 1, s->d_desc.max_code + 1,
Ddeflate.h203 struct tree_desc_s d_desc; /* desc. for distance tree */ member
Ddeflate.c1201 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/node/deps/v8/third_party/zlib/
Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
388 s->d_desc.stat_desc = &static_d_desc;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
933 build_tree(s, (tree_desc *)(&(s->d_desc)));
987 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,
Ddeflate.h203 struct tree_desc_s d_desc; /* desc. for distance tree */ member
Ddeflate.c1202 ds->d_desc.dyn_tree = ds->dyn_dtree;
/third_party/rust/crates/libc/src/unix/solarish/
Dsolaris.rs32 pub d_desc: door_desc_t__d_data__d_desc,