Parolin 0.7.9 6796
Console (soon DLLs) to do a tar like job
Loading...
Searching...
No Matches
Data Fields
internal_state Struct Reference

#include <deflate.h>

Data Fields

z_streamp strm
 
int status
 
Bytef * pending_buf
 
ulg pending_buf_size
 
Bytef * pending_out
 
ulg pending
 
int wrap
 
gz_headerp gzhead
 
ulg gzindex
 
Byte method
 
int last_flush
 
uInt w_size
 
uInt w_bits
 
uInt w_mask
 
Bytef * window
 
ulg window_size
 
Posf * prev
 
Posf * head
 
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]
 
uchf * l_buf
 
uInt lit_bufsize
 
uInt last_lit
 
ushf * d_buf
 
ulg opt_len
 
ulg static_len
 
uInt matches
 
uInt insert
 
ush bi_buf
 
int bi_valid
 
ulg high_water
 
int dummy
 

Field Documentation

◆ bi_buf

ush bi_buf

◆ bi_valid

int bi_valid

◆ bl_count

ush bl_count[MAX_BITS+1]

◆ bl_desc

struct tree_desc_s bl_desc

◆ bl_tree

struct ct_data_s bl_tree[2 *BL_CODES+1]

◆ block_start

long block_start

◆ d_buf

ushf* d_buf

◆ d_desc

struct tree_desc_s d_desc

◆ depth

uch depth[2 *L_CODES+1]

◆ dummy

int dummy

◆ dyn_dtree

struct ct_data_s dyn_dtree[2 *D_CODES+1]

◆ dyn_ltree

struct ct_data_s dyn_ltree[HEAP_SIZE]

◆ good_match

uInt good_match

◆ gzhead

gz_headerp gzhead

◆ gzindex

ulg gzindex

◆ hash_bits

uInt hash_bits

◆ hash_mask

uInt hash_mask

◆ hash_shift

uInt hash_shift

◆ hash_size

uInt hash_size

◆ head

Posf* head

◆ heap

int heap[2 *L_CODES+1]

◆ heap_len

int heap_len

◆ heap_max

int heap_max

◆ high_water

ulg high_water

◆ ins_h

uInt ins_h

◆ insert

uInt insert

◆ l_buf

uchf* l_buf

◆ l_desc

struct tree_desc_s l_desc

◆ last_flush

int last_flush

◆ last_lit

uInt last_lit

◆ level

int level

◆ lit_bufsize

uInt lit_bufsize

◆ lookahead

uInt lookahead

◆ match_available

int match_available

◆ match_length

uInt match_length

◆ match_start

uInt match_start

◆ matches

uInt matches

◆ max_chain_length

uInt max_chain_length

◆ max_lazy_match

uInt max_lazy_match

◆ method

Byte method

◆ nice_match

int nice_match

◆ opt_len

ulg opt_len

◆ pending

ulg pending

◆ pending_buf

Bytef* pending_buf

◆ pending_buf_size

ulg pending_buf_size

◆ pending_out

Bytef* pending_out

◆ prev

Posf* prev

◆ prev_length

uInt prev_length

◆ prev_match

IPos prev_match

◆ static_len

ulg static_len

◆ status

int status

◆ strategy

int strategy

◆ strm

z_streamp strm

◆ strstart

uInt strstart

◆ w_bits

uInt w_bits

◆ w_mask

uInt w_mask

◆ w_size

uInt w_size

◆ window

Bytef* window

◆ window_size

ulg window_size

◆ wrap

int wrap
The documentation for this struct was generated from the following files:
Generated by doxygen 1.12.0