Geant4  10.00.p02
trees.cc File Reference
#include "deflate.h"
+ Include dependency graph for trees.cc:

Go to the source code of this file.

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

local void tr_static_init OF ((void))
 
local void init_block OF ((deflate_state *s))
 
local void pqdownheap OF ((deflate_state *s, ct_data *tree, int k))
 
local void gen_bitlen OF ((deflate_state *s, tree_desc *desc))
 
local void gen_codes OF ((ct_data *tree, int max_code, ushf *bl_count))
 
local void scan_tree OF ((deflate_state *s, ct_data *tree, int max_code))
 
local void send_all_trees OF ((deflate_state *s, int lcodes, int dcodes, int blcodes))
 
local void compress_block OF ((deflate_state *s, ct_data *ltree, ct_data *dtree))
 
local unsigned bi_reverse OF ((unsigned value, int length))
 
local void copy_block OF ((deflate_state *s, charf *buf, unsigned len, int header))
 
local void tr_static_init ()
 
void ZLIB_INTERNAL _tr_init (deflate_state *s)
 
local void init_block (deflate_state *s)
 
local void pqdownheap (deflate_state *s, ct_data *tree, int k)
 
local void gen_bitlen (deflate_state *s, tree_desc *desc)
 
local void gen_codes (ct_data *tree, int max_code, ushf *bl_count)
 
local void build_tree (deflate_state *s, tree_desc *desc)
 
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 int build_bl_tree (deflate_state *s)
 
local 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)
 
local void compress_block (deflate_state *s, ct_data *ltree, ct_data *dtree)
 
local int detect_data_type (deflate_state *s)
 
local unsigned bi_reverse (unsigned code, int len)
 
local void bi_flush (deflate_state *s)
 
local void bi_windup (deflate_state *s)
 
local void copy_block (deflate_state *s, charf *buf, unsigned len, int header)
 

Variables

local const int extra_lbits [LENGTH_CODES] = {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}
 
local const int extra_dbits [D_CODES] = {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}
 
local const int extra_blbits [BL_CODES] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7}
 
local const uch bl_order [BL_CODES] = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15}
 
local ct_data static_ltree [L_CODES+2]
 
local ct_data static_dtree [D_CODES]
 
uch _dist_code [DIST_CODE_LEN]
 
uch _length_code [MAX_MATCH-MIN_MATCH+1]
 
local int base_length [LENGTH_CODES]
 
local int base_dist [D_CODES]
 
local static_tree_desc static_l_desc
 
local static_tree_desc static_d_desc
 
local static_tree_desc static_bl_desc
 

Macro Definition Documentation

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

Definition at line 81 of file trees.cc.

#define END_BLOCK   256

Definition at line 50 of file trees.cc.

Referenced by _tr_align(), compress_block(), and init_block().

#define MAX_BL_BITS   7

Definition at line 47 of file trees.cc.

#define pqremove (   s,
  tree,
  top 
)
Value:
{\
top = s->heap[SMALLEST]; \
s->heap[SMALLEST] = s->heap[s->heap_len--]; \
}
local void pqdownheap(deflate_state *s, ct_data *tree, int k)
Definition: trees.cc:448
#define SMALLEST
Definition: trees.cc:419
static const double s
Definition: G4SIunits.hh:150

Definition at line 427 of file trees.cc.

Referenced by build_tree().

#define put_short (   s,
 
)
Value:
{ \
put_byte(s, (uch)((w) & 0xff)); \
put_byte(s, (uch)((ush)(w) >> 8)); \
}
static const double s
Definition: G4SIunits.hh:150

Definition at line 176 of file trees.cc.

Referenced by bi_flush(), bi_windup(), and copy_block().

#define REP_3_6   16

Definition at line 53 of file trees.cc.

Referenced by scan_tree(), and send_tree().

#define REPZ_11_138   18

Definition at line 59 of file trees.cc.

Referenced by scan_tree(), and send_tree().

#define REPZ_3_10   17

Definition at line 56 of file trees.cc.

Referenced by scan_tree(), and send_tree().

#define send_bits (   s,
  value,
  length 
)
Value:
{ int len = length;\
if (s->bi_valid > (int)Buf_size - len) {\
int val = 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;\
}\
}
static const double s
Definition: G4SIunits.hh:150
#define put_short(s, w)
Definition: trees.cc:176

Definition at line 210 of file trees.cc.

Referenced by _tr_align(), _tr_flush_block(), _tr_stored_block(), compress_block(), send_all_trees(), and send_tree().

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

Definition at line 163 of file trees.cc.

Referenced by _tr_align(), compress_block(), and send_tree().

#define smaller (   tree,
  n,
  m,
  depth 
)
Value:
(tree[n].Freq < tree[m].Freq || \
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
const G4int n
static const double m
Definition: G4SIunits.hh:110

Definition at line 438 of file trees.cc.

Referenced by pqdownheap().

#define SMALLEST   1

Definition at line 419 of file trees.cc.

Referenced by build_tree().

Function Documentation

void ZLIB_INTERNAL _tr_align ( deflate_state *  s)

Definition at line 863 of file trees.cc.

References bi_flush(), END_BLOCK, L, send_bits, send_code, and static_ltree.

Referenced by deflate().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

void ZLIB_INTERNAL _tr_flush_bits ( deflate_state *  s)

Definition at line 854 of file trees.cc.

References bi_flush().

Referenced by deflatePrime(), and flush_pending().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

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

Definition at line 877 of file trees.cc.

References _tr_stored_block(), bi_windup(), build_bl_tree(), build_tree(), compress_block(), detect_data_type(), init_block(), send_all_trees(), send_bits, static_dtree, and static_ltree.

+ Here is the call graph for this function:

void ZLIB_INTERNAL _tr_init ( deflate_state *  s)

Definition at line 378 of file trees.cc.

References init_block(), L, static_bl_desc, static_d_desc, static_l_desc, and tr_static_init().

Referenced by deflateResetKeep().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

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

Definition at line 841 of file trees.cc.

References copy_block(), L, and send_bits.

Referenced by _tr_flush_block(), and deflate().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

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

Definition at line 974 of file trees.cc.

References _length_code, extra_dbits, and L.

local void bi_flush ( deflate_state *  s)

Definition at line 1124 of file trees.cc.

References put_short.

Referenced by _tr_align(), and _tr_flush_bits().

+ Here is the caller graph for this function:

local unsigned bi_reverse ( unsigned  code,
int  len 
)

Definition at line 1111 of file trees.cc.

Referenced by gen_codes(), and tr_static_init().

+ Here is the caller graph for this function:

local void bi_windup ( deflate_state *  s)

Definition at line 1140 of file trees.cc.

References put_short.

Referenced by _tr_flush_block(), and copy_block().

+ Here is the caller graph for this function:

local int build_bl_tree ( deflate_state *  s)

Definition at line 780 of file trees.cc.

References bl_order, build_tree(), and scan_tree().

Referenced by _tr_flush_block().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

local void build_tree ( deflate_state *  s,
tree_desc *  desc 
)

Definition at line 604 of file trees.cc.

References gen_bitlen(), gen_codes(), m, n, pqdownheap(), pqremove, and SMALLEST.

Referenced by _tr_flush_block(), and build_bl_tree().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

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

Definition at line 1021 of file trees.cc.

References _length_code, base_dist, base_length, END_BLOCK, extra_dbits, extra_lbits, send_bits, and send_code.

Referenced by _tr_flush_block().

+ Here is the caller graph for this function:

local void copy_block ( deflate_state *  s,
charf *  buf,
unsigned  len,
int  header 
)

Definition at line 1158 of file trees.cc.

References bi_windup(), and put_short.

Referenced by _tr_stored_block().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

local int detect_data_type ( deflate_state *  s)

Definition at line 1078 of file trees.cc.

References n.

Referenced by _tr_flush_block().

+ Here is the caller graph for this function:

local void gen_bitlen ( deflate_state *  s,
tree_desc *  desc 
)

Definition at line 480 of file trees.cc.

References m, and n.

Referenced by build_tree().

+ Here is the caller graph for this function:

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

Definition at line 565 of file trees.cc.

References bi_reverse(), n, and static_ltree.

Referenced by build_tree(), and tr_static_init().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

local void init_block ( deflate_state *  s)

Definition at line 405 of file trees.cc.

References END_BLOCK, L, and n.

Referenced by _tr_flush_block(), and _tr_init().

+ Here is the caller graph for this function:

local void tr_static_init OF ( (void)  )
local void init_block OF ( (deflate_state *s )
local void pqdownheap OF ( (deflate_state *s, ct_data *tree, int k)  )
local void gen_bitlen OF ( (deflate_state *s, tree_desc *desc)  )
local void gen_codes OF ( (ct_data *tree, int max_code, ushf *bl_count)  )
local void scan_tree OF ( (deflate_state *s, ct_data *tree, int max_code)  )
local void send_all_trees OF ( (deflate_state *s, int lcodes, int dcodes, int blcodes)  )
local void compress_block OF ( (deflate_state *s, ct_data *ltree, ct_data *dtree)  )
local unsigned bi_reverse OF ( (unsigned value, int length)  )
local void copy_block OF ( (deflate_state *s, charf *buf, unsigned len, int header)  )
local void pqdownheap ( deflate_state *  s,
ct_data *  tree,
int  k 
)

Definition at line 448 of file trees.cc.

References smaller.

Referenced by build_tree().

+ Here is the caller graph for this function:

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

Definition at line 690 of file trees.cc.

References n, REP_3_6, REPZ_11_138, and REPZ_3_10.

Referenced by build_bl_tree().

+ Here is the caller graph for this function:

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

Definition at line 814 of file trees.cc.

References bl_order, send_bits, and send_tree().

Referenced by _tr_flush_block().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

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

Definition at line 732 of file trees.cc.

References n, REP_3_6, REPZ_11_138, REPZ_3_10, send_bits, and send_code.

Referenced by send_all_trees().

+ Here is the caller graph for this function:

local void tr_static_init ( )

Definition at line 231 of file trees.cc.

References _dist_code, _length_code, base_dist, base_length, bi_reverse(), extra_blbits, extra_dbits, extra_lbits, gen_codes(), n, static_bl_desc, static_d_desc, static_dtree, static_l_desc, and static_ltree.

Referenced by _tr_init().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

Variable Documentation

uch _dist_code[DIST_CODE_LEN]

Definition at line 98 of file trees.cc.

Referenced by tr_static_init().

uch _length_code[MAX_MATCH-MIN_MATCH+1]

Definition at line 104 of file trees.cc.

Referenced by _tr_tally(), compress_block(), and tr_static_init().

local int base_dist[D_CODES]

Definition at line 110 of file trees.cc.

Referenced by compress_block(), and tr_static_init().

local int base_length[LENGTH_CODES]

Definition at line 107 of file trees.cc.

Referenced by compress_block(), and tr_static_init().

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

Definition at line 72 of file trees.cc.

Referenced by build_bl_tree(), and send_all_trees().

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

Definition at line 69 of file trees.cc.

Referenced by tr_static_init().

local const int extra_dbits[D_CODES] = {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}

Definition at line 66 of file trees.cc.

Referenced by _tr_tally(), compress_block(), and tr_static_init().

local const int extra_lbits[LENGTH_CODES] = {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}

Definition at line 63 of file trees.cc.

Referenced by compress_block(), and tr_static_init().

local static_tree_desc static_bl_desc
Initial value:
=
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}
local const int extra_blbits[BL_CODES]
Definition: trees.cc:69
#define MAX_BL_BITS
Definition: trees.cc:47

Definition at line 131 of file trees.cc.

Referenced by _tr_init(), and tr_static_init().

local static_tree_desc static_d_desc
Initial value:
=
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}
local ct_data static_dtree[D_CODES]
Definition: trees.cc:93
local const int extra_dbits[D_CODES]
Definition: trees.cc:66

Definition at line 128 of file trees.cc.

Referenced by _tr_init(), and tr_static_init().

local ct_data static_dtree[D_CODES]

Definition at line 93 of file trees.cc.

Referenced by _tr_flush_block(), and tr_static_init().

local static_tree_desc static_l_desc
Initial value:
=
{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}
local ct_data static_ltree[L_CODES+2]
Definition: trees.cc:86
local const int extra_lbits[LENGTH_CODES]
Definition: trees.cc:63

Definition at line 125 of file trees.cc.

Referenced by _tr_init(), and tr_static_init().

local ct_data static_ltree[L_CODES+2]

Definition at line 86 of file trees.cc.

Referenced by _tr_align(), _tr_flush_block(), gen_codes(), and tr_static_init().