構造体定義書 - internal

構文

typedef struct internal_state

ファイル名

構造体情報

No.	名称	属性	説明
1	internal_state
	strm	z_streamp	pointer back to this zlib stream
	status	int	as the name implies
	pending_buf	Bytef *	output still pending
	pending_buf_size	ulg	size of pending_buf
	pending_out	Bytef *	next pending byte to output to the stream
	pending	int	nb of bytes in the pending buffer
	wrap	int	bit 0 true for zlib, bit 1 true for gzip
	data_type	Byte	UNKNOWN, BINARY or ASCII
	method	Byte	STORED (for zip only) or DEFLATED
	last_flush	int	value of flush param for previous deflate call
	w_size	uInt	LZ77 window size (32K by default)
	w_bits	uInt	log2(w_size) (8..16)
	w_mask	uInt	w_size - 1
	window	Bytef *
	window_size	ulg
	prev	Posf *
	head	Posf *	Heads of the hash chains or NIL.
	ins_h	uInt	hash index of string to be inserted
	hash_size	uInt	number of elements in hash table
	hash_bits	uInt	log2(hash_size)
	hash_mask	uInt	hash_size-1
	hash_shift	uInt
	block_start	long
	match_length	uInt	length of best match
	prev_match	IPos	previous match
	match_available	int	set if previous match exists
	strstart	uInt	start of string to insert
	match_start	uInt	start of matching string
	lookahead	uInt	number of valid bytes ahead in window
	prev_length	uInt
	max_chain_length	uInt
	max_lazy_match	uInt
	level		compression level (1..9)
	strategy	int	favor or force Huffman coding
	good_match	uInt
	nice_match	int	Stop searching when current match exceeds this
	dyn_ltree[HEAP_SIZE]	ct_data_s	literal and length tree
	dyn_dtree[2*D_CODES+1]	ct_data_s	distance tree
	bl_tree[2*BL_CODES+1]	ct_data_s	Huffman tree for bit lengths
	l_desc	tree_desc_s	desc. for literal tree
	d_desc	tree_desc_s	desc. for distance tree
	bl_desc	tree_desc_s	desc. for bit length tree
	bl_count[MAX_BITS+1]	ush
	heap[2*L_CODES+1]	int	heap used to build the Huffman trees
	heap_len	int	number of elements in the heap
	heap_max	int	element of largest frequency
	depth[2*L_CODES+1]	uch
	l_buf	uchf *	buffer for literals or lengths
	lit_bufsize	uInt
	last_lit	uInt	running index in l_buf
	d_buf	ushf *
	opt_len	ulg	bit length of current block with optimal trees
	static_len	ulg	bit length of current block with static trees
	matches	uInt	number of string matches in current block
	last_eob_len	int	bit length of EOB code for last block
	compressed_len	ulg	total bit length of compressed file mod 2^32
	bits_sent	ulg	bit length of compressed data sent mod 2^32
	bi_buf	ush
	bi_valid	int

internal_state

構文

ファイル名

構造体情報

See Also