Prusa MINI Firmware overview
internal_state Struct Reference

#include <deflate.h>

Collaboration diagram for internal_state:

Public Attributes

z_streamp strm
 
int status
 
Bytefpending_buf
 
ulg pending_buf_size
 
Bytefpending_out
 
ulg pending
 
int wrap
 
gz_headerp gzhead
 
ulg gzindex
 
Byte method
 
int last_flush
 
uInt w_size
 
uInt w_bits
 
uInt w_mask
 
Bytefwindow
 
ulg window_size
 
Posfprev
 
Posfhead
 
uInt ins_h
 
uInt hash_size
 
uInt hash_bits
 
uInt hash_mask
 
uInt hash_shift
 
long block_start
 
uInt match_length
 
IPos prev_match
 
int match_available
 
uInt strstart
 
uInt match_start
 
uInt lookahead
 
uInt prev_length
 
uInt max_chain_length
 
uInt max_lazy_match
 
int level
 
int strategy
 
uInt good_match
 
int nice_match
 
struct ct_data_s dyn_ltree [HEAP_SIZE]
 
struct ct_data_s dyn_dtree [2 *D_CODES+1]
 
struct ct_data_s bl_tree [2 *BL_CODES+1]
 
struct tree_desc_s l_desc
 
struct tree_desc_s d_desc
 
struct tree_desc_s bl_desc
 
ush bl_count [MAX_BITS+1]
 
int heap [2 *L_CODES+1]
 
int heap_len
 
int heap_max
 
uch depth [2 *L_CODES+1]
 
uchfl_buf
 
uInt lit_bufsize
 
uInt last_lit
 
ushfd_buf
 
ulg opt_len
 
ulg static_len
 
uInt matches
 
uInt insert
 
ush bi_buf
 
int bi_valid
 
ulg high_water
 

Member Data Documentation

◆ strm

z_streamp internal_state::strm

◆ status

int internal_state::status

◆ pending_buf

Bytef* internal_state::pending_buf

◆ pending_buf_size

ulg internal_state::pending_buf_size

◆ pending_out

Bytef* internal_state::pending_out

◆ pending

ulg internal_state::pending

◆ wrap

int internal_state::wrap

◆ gzhead

gz_headerp internal_state::gzhead

◆ gzindex

ulg internal_state::gzindex

◆ method

Byte internal_state::method

◆ last_flush

int internal_state::last_flush

◆ w_size

uInt internal_state::w_size

◆ w_bits

uInt internal_state::w_bits

◆ w_mask

uInt internal_state::w_mask

◆ window

Bytef* internal_state::window

◆ window_size

ulg internal_state::window_size

◆ prev

Posf* internal_state::prev

◆ head

Posf* internal_state::head

◆ ins_h

uInt internal_state::ins_h

◆ hash_size

uInt internal_state::hash_size

◆ hash_bits

uInt internal_state::hash_bits

◆ hash_mask

uInt internal_state::hash_mask

◆ hash_shift

uInt internal_state::hash_shift

◆ block_start

long internal_state::block_start

◆ match_length

uInt internal_state::match_length

◆ prev_match

IPos internal_state::prev_match

◆ match_available

int internal_state::match_available

◆ strstart

uInt internal_state::strstart

◆ match_start

uInt internal_state::match_start

◆ lookahead

uInt internal_state::lookahead

◆ prev_length

uInt internal_state::prev_length

◆ max_chain_length

uInt internal_state::max_chain_length

◆ max_lazy_match

uInt internal_state::max_lazy_match

◆ level

int internal_state::level

◆ strategy

int internal_state::strategy

◆ good_match

uInt internal_state::good_match

◆ nice_match

int internal_state::nice_match

◆ dyn_ltree

struct ct_data_s internal_state::dyn_ltree[HEAP_SIZE]

◆ dyn_dtree

struct ct_data_s internal_state::dyn_dtree[2 *D_CODES+1]

◆ bl_tree

struct ct_data_s internal_state::bl_tree[2 *BL_CODES+1]

◆ l_desc

struct tree_desc_s internal_state::l_desc

◆ d_desc

struct tree_desc_s internal_state::d_desc

◆ bl_desc

struct tree_desc_s internal_state::bl_desc

◆ bl_count

ush internal_state::bl_count[MAX_BITS+1]

◆ heap

int internal_state::heap[2 *L_CODES+1]

◆ heap_len

int internal_state::heap_len

◆ heap_max

int internal_state::heap_max

◆ depth

uch internal_state::depth[2 *L_CODES+1]

◆ l_buf

uchf* internal_state::l_buf

◆ lit_bufsize

uInt internal_state::lit_bufsize

◆ last_lit

uInt internal_state::last_lit

◆ d_buf

ushf* internal_state::d_buf

◆ opt_len

ulg internal_state::opt_len

◆ static_len

ulg internal_state::static_len

◆ matches

uInt internal_state::matches

◆ insert

uInt internal_state::insert

◆ bi_buf

ush internal_state::bi_buf

◆ bi_valid

int internal_state::bi_valid

◆ high_water

ulg internal_state::high_water