#include "deflate.h"

Include dependency graph for trees.c:

Classes
struct	static_tree_desc_s

Macros
#define	MAX_BL_BITS 7

#define	END_BLOCK 256

#define	REP_3_6 16

#define	REPZ_3_10 17

#define	REPZ_11_138 18

#define	DIST_CODE_LEN 512 /* see definition of array dist_code below */

#define	send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

#define	put_short(s, w)

#define	send_bits(s, value, length)

#define	SMALLEST 1

#define	pqremove(s, tree, top)

#define	smaller(tree, n, m, depth)

Functions
void tr_static_init	OF ((void))

void init_block	OF ((deflate_state *s))

void pqdownheap	OF ((deflate_state s, ct_data tree, int k))

void gen_bitlen	OF ((deflate_state s, tree_desc desc))

void gen_codes	OF ((ct_data tree, int max_code, ushf bl_count))

void scan_tree	OF ((deflate_state s, ct_data tree, int max_code))

void send_all_trees	OF ((deflate_state *s, int lcodes, int dcodes, int blcodes))

void compress_block	OF ((deflate_state s, const ct_data ltree, const ct_data *dtree))

unsigned bi_reverse	OF ((unsigned code, int len))

void	tr_static_init ()

void ZLIB_INTERNAL	_tr_init (deflate_state *s)

void	init_block (deflate_state *s)

void	pqdownheap (deflate_state s, ct_data tree, int k)

void	gen_bitlen (deflate_state s, tree_desc desc)

void	gen_codes (ct_data tree, int max_code, ushf bl_count)

void	build_tree (deflate_state s, tree_desc desc)

void	scan_tree (deflate_state s, ct_data tree, int max_code)

void	send_tree (deflate_state s, ct_data tree, int max_code)

int	build_bl_tree (deflate_state *s)

void	send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes)

void ZLIB_INTERNAL	_tr_stored_block (deflate_state s, charf buf, ulg stored_len, int last)

void ZLIB_INTERNAL	_tr_flush_bits (deflate_state *s)

void ZLIB_INTERNAL	_tr_align (deflate_state *s)

void ZLIB_INTERNAL	_tr_flush_block (deflate_state s, charf buf, ulg stored_len, int last)

int ZLIB_INTERNAL	_tr_tally (deflate_state *s, unsigned dist, unsigned lc)

void	compress_block (deflate_state s, const ct_data ltree, const ct_data *dtree)

int	detect_data_type (deflate_state *s)

unsigned	bi_reverse (unsigned code, int len)

void	bi_flush (deflate_state *s)

void	bi_windup (deflate_state *s)

Variables
const int	extra_lbits [29] = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0}

const int	extra_dbits [30] = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13}

const int	extra_blbits [19] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7}

const uch	bl_order [19] = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15}

ct_data	static_ltree [(256+1+29)+2]

ct_data	static_dtree [30]

uch	_dist_code [512]

uch	_length_code [MAX_MATCH-MIN_MATCH+1]

int	base_length [29]

int	base_dist [30]

const static_tree_desc	static_l_desc

const static_tree_desc	static_d_desc

const static_tree_desc	static_bl_desc

Macro Definition Documentation

◆ DIST_CODE_LEN

#define DIST_CODE_LEN 512 /* see definition of array dist_code below */

Definition at line 81 of file trees.c.

◆ END_BLOCK

#define END_BLOCK 256

Definition at line 50 of file trees.c.

◆ MAX_BL_BITS

#define MAX_BL_BITS 7

Definition at line 47 of file trees.c.

◆ pqremove

#define pqremove	(	s,
		tree,
		top
	)

Value:

{\
    top = s->heap[SMALLEST]; \
    s->heap[SMALLEST] = s->heap[s->heap_len--]; \
    pqdownheap(s, tree, SMALLEST); \
}

Definition at line 430 of file trees.c.

◆ put_short

#define put_short	(	s,
		w
	)

Value:

    { \
    put_byte(s, (uch)((w) & 0xff)); \
    put_byte(s, (uch)((ush)(w) >> 8)); \
}

Definition at line 174 of file trees.c.

◆ REP_3_6

#define REP_3_6 16

Definition at line 53 of file trees.c.

◆ REPZ_11_138

#define REPZ_11_138 18

Definition at line 59 of file trees.c.

◆ REPZ_3_10

#define REPZ_3_10 17

Definition at line 56 of file trees.c.

◆ send_bits

#define send_bits	(	s,
		value,
		length
	)

Value:

{ int len = length;\
  if (s->bi_valid > (int)Buf_size - len) {\
    int val = (int)value;\
    s->bi_buf |= (ush)val << s->bi_valid;\
    put_short(s, s->bi_buf);\
    s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
    s->bi_valid += len - Buf_size;\
  } else {\
    s->bi_buf |= (ush)(value) << s->bi_valid;\
    s->bi_valid += len;\
  }\
}