ct_data
ct_data *dyn_tree; /* the dynamic tree */
compress_block(s, (const ct_data *)static_ltree,
(const ct_data *)static_dtree);
compress_block(s, (const ct_data *)s->dyn_ltree,
(const ct_data *)s->dyn_dtree);
const ct_data *static_tree; /* static tree or NULL */
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
local void pqdownheap(deflate_state *s, ct_data *tree, int k) {
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
gen_codes ((ct_data *)tree, max_code, s->bl_count);
local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {
local void send_tree(deflate_state *s, ct_data *tree, int max_code) {
scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
send_tree(s, (ct_data *)s->dyn_ltree, lcodes - 1); /* literal tree */
send_tree(s, (ct_data *)s->dyn_dtree, dcodes - 1); /* distance tree */
local ct_data static_ltree[L_CODES+2];
local void compress_block(deflate_state *s, const ct_data *ltree,
const ct_data *dtree) {
local ct_data static_dtree[D_CODES];
local const ct_data static_ltree[L_CODES+2] = {
local const ct_data static_dtree[D_CODES] = {
struct ct_data *ct = NULL;
mem_free(ct, sizeof(struct ct_data));
struct ct_data *ct;
ct = (struct ct_data *) h->cl_private;
struct ct_data *ct;
ct = (struct ct_data *) h->cl_private;
struct ct_data *ct;
ct = (struct ct_data *)cl->cl_private;
struct ct_data *ct;
ct = (struct ct_data *)cl->cl_private;
struct ct_data *ct;
ct = (struct ct_data *) cl->cl_private;
mem_free(ct, sizeof(struct ct_data));
struct ct_data *ct = (struct ct_data *)(void *)ctp;
struct ct_data *ct = (struct ct_data *)(void *)ctp;
uint64_t data_pa = (uint64_t)(uintptr_t)ct->ct_data;
{ .ct_uuid = EFI_TABLE_ACPI20, .ct_data = &acpi_root },
{ .ct_uuid = EFI_TABLE_SAL, .ct_data = &sal_systab },
(uintptr_t)ct[i].ct_data;
(uintptr_t)ct[i].ct_data;
uint32_t ct_data; /* void * */
uint64_t ct_data; /* void * */
aprint_debug("efi: %08" PRIx32, ct32->ct_data);
aprint_debug("efi: %016" PRIx64, ct64->ct_data);
aprint_debug("efi: %p", ct->ct_data);
return ct32->ct_data;
if (!(ct64->ct_data & 0xffffffff00000000ULL))
return ct64->ct_data;
return (paddr_t)(u_long) ct->ct_data;
void *ct_data;
local ct_data static_ltree[L_CODES+2];
local ct_data static_dtree[D_CODES];
local const ct_data static_ltree[L_CODES+2] = {
local const ct_data static_dtree[D_CODES] = {
const ct_data *static_tree; /* static tree or NULL */
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
local void pqdownheap(deflate_state *s, ct_data *tree, int k);
local void gen_codes(ct_data *tree, int max_code, ushf *bl_count);
local void scan_tree(deflate_state *s, ct_data *tree, int max_code);
local void send_tree(deflate_state *s, ct_data *tree, int max_code);
local void compress_block(deflate_state *s, const ct_data *ltree,
const ct_data *dtree);
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
ct_data *tree, /* the tree to restore */
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
local void gen_codes (ct_data *tree, /* the tree to decorate */
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
gen_codes ((ct_data *)tree, max_code, s->bl_count);
ct_data *tree, /* the tree to be scanned */
ct_data *tree, /* the tree to be scanned */
scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
compress_block(s, (const ct_data *)static_ltree, (const ct_data *)static_dtree);
compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree);
const ct_data *ltree, /* literal tree */
const ct_data *dtree) /* distance tree */
ct_data *dyn_tree; /* the dynamic tree */