mirror of
https://https.git.savannah.gnu.org/git/gzip.git
synced 2026-01-26 07:37:53 +00:00
215 lines
6.0 KiB
C
215 lines
6.0 KiB
C
/* bits.c -- output variable-length bit strings
|
|
|
|
Copyright (C) 1999, 2009-2026 Free Software Foundation, Inc.
|
|
Copyright (C) 1992-1993 Jean-loup Gailly
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 3, or (at your option)
|
|
any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>. */
|
|
|
|
|
|
/*
|
|
* PURPOSE
|
|
*
|
|
* Output variable-length bit strings. Compression can be done
|
|
* to a file or to memory. (The latter is not supported in this version.)
|
|
*
|
|
* DISCUSSION
|
|
*
|
|
* The PKZIP "deflate" file format interprets compressed file data
|
|
* as a sequence of bits. Multi-bit strings in the file may cross
|
|
* byte boundaries without restriction.
|
|
*
|
|
* The first bit of each byte is the low-order bit.
|
|
*
|
|
* The routines in this file allow a variable-length bit value to
|
|
* be output right-to-left (useful for literal values). For
|
|
* left-to-right output (useful for code strings from the tree routines),
|
|
* the bits must have been reversed first with bi_reverse().
|
|
*
|
|
* For in-memory compression, the compressed bit stream goes directly
|
|
* into the requested output buffer. The input data is read in blocks
|
|
* by the mem_read() function. The buffer is limited to 64K on 16 bit
|
|
* machines.
|
|
*
|
|
* INTERFACE
|
|
*
|
|
* void bi_init (FILE *zipfile)
|
|
* Initialize the bit string routines.
|
|
*
|
|
* void send_bits (int value, int length)
|
|
* Write out a bit string, taking the source bits right to
|
|
* left.
|
|
*
|
|
* int bi_reverse (int value, int length)
|
|
* Reverse the bits of a bit string, taking the source bits left to
|
|
* right and emitting them right to left.
|
|
*
|
|
* void bi_windup ()
|
|
* Write out any remaining bits in an incomplete byte.
|
|
*
|
|
* void copy_block(char *buf, unsigned len, int header)
|
|
* Copy a stored block to the zip file, storing first the length and
|
|
* its one's complement if requested.
|
|
*
|
|
*/
|
|
|
|
#include <config.h>
|
|
#include "tailor.h"
|
|
#include "gzip.h"
|
|
|
|
#ifdef DEBUG
|
|
# include <stdio.h>
|
|
#endif
|
|
|
|
/* ===========================================================================
|
|
* Local data used by the "bit string" routines.
|
|
*/
|
|
|
|
static file_t zfile; /* output gzip file */
|
|
|
|
#ifndef IBM_Z_DFLTCC
|
|
static
|
|
#endif
|
|
unsigned short bi_buf;
|
|
/* Output buffer. bits are inserted starting at the bottom (least significant
|
|
* bits).
|
|
*/
|
|
|
|
#define Buf_size (8 * 2*sizeof(char))
|
|
/* Number of bits used within bi_buf. (bi_buf might be implemented on
|
|
* more than 16 bits on some systems.)
|
|
*/
|
|
|
|
#ifndef IBM_Z_DFLTCC
|
|
static
|
|
#endif
|
|
int bi_valid;
|
|
/* Number of valid bits in bi_buf. All bits above the last valid bit
|
|
* are always zero.
|
|
*/
|
|
|
|
int (*read_buf) (char *buf, unsigned size);
|
|
/* Current input function. Set to mem_read for in-memory compression */
|
|
|
|
#ifdef DEBUG
|
|
off_t bits_sent; /* bit length of the compressed data */
|
|
#endif
|
|
|
|
/* ===========================================================================
|
|
* Initialize the bit string routines.
|
|
* ZIPFILE is the output zip file; it is NO_FILE for in-memory compression.
|
|
*/
|
|
void
|
|
bi_init (file_t zipfile)
|
|
{
|
|
zfile = zipfile;
|
|
bi_buf = 0;
|
|
bi_valid = 0;
|
|
#ifdef DEBUG
|
|
bits_sent = 0L;
|
|
#endif
|
|
|
|
/* Set the defaults for file compression. They are set by memcompress
|
|
* for in-memory compression.
|
|
*/
|
|
if (zfile != NO_FILE) {
|
|
read_buf = file_read;
|
|
}
|
|
}
|
|
|
|
/* ===========================================================================
|
|
* Send VALUE on LENGTH bits.
|
|
* IN assertion: LENGTH <= 16 and VALUE fits in LENGTH bits.
|
|
*/
|
|
void
|
|
send_bits (int value, int length)
|
|
{
|
|
#ifdef DEBUG
|
|
Tracev ((stderr, " l %2d v %4x ", length, value + 0u));
|
|
Assert(length > 0 && length <= 15, "invalid length");
|
|
bits_sent += (off_t)length;
|
|
#endif
|
|
/* If not enough room in bi_buf, use (valid) bits from bi_buf and
|
|
* (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
|
|
* unused bits in value.
|
|
*/
|
|
if (bi_valid > (int)Buf_size - length) {
|
|
bi_buf |= (value << bi_valid);
|
|
put_short(bi_buf);
|
|
bi_buf = (ush)value >> (Buf_size - bi_valid);
|
|
bi_valid += length - Buf_size;
|
|
} else {
|
|
bi_buf |= value << bi_valid;
|
|
bi_valid += length;
|
|
}
|
|
}
|
|
|
|
/* ===========================================================================
|
|
* Reverse the first LEN bits of CODE, using straightforward code (a faster
|
|
* method would use a table)
|
|
* IN assertion: 1 <= LEN <= 15
|
|
*/
|
|
unsigned
|
|
bi_reverse (unsigned code, int len)
|
|
{
|
|
register unsigned res = 0;
|
|
do {
|
|
res |= code & 1;
|
|
code >>= 1, res <<= 1;
|
|
} while (--len > 0);
|
|
return res >> 1;
|
|
}
|
|
|
|
/* ===========================================================================
|
|
* Write out any remaining bits in an incomplete byte.
|
|
*/
|
|
void
|
|
bi_windup ()
|
|
{
|
|
if (bi_valid > 8) {
|
|
put_short(bi_buf);
|
|
} else if (bi_valid > 0) {
|
|
put_byte(bi_buf);
|
|
}
|
|
bi_buf = 0;
|
|
bi_valid = 0;
|
|
#ifdef DEBUG
|
|
bits_sent = (bits_sent+7) & ~7;
|
|
#endif
|
|
}
|
|
|
|
/* ===========================================================================
|
|
* Copy a stored block to the zip file, storing first the length and its
|
|
* one's complement if requested. BUF is the input data of length
|
|
* LEN; HEADER is true if block header must be written.
|
|
*/
|
|
void
|
|
copy_block (char *buf, unsigned len, int header)
|
|
{
|
|
bi_windup(); /* align on byte boundary */
|
|
|
|
if (header) {
|
|
put_short((ush)len);
|
|
put_short((ush)~len);
|
|
#ifdef DEBUG
|
|
bits_sent += 2*16;
|
|
#endif
|
|
}
|
|
#ifdef DEBUG
|
|
bits_sent += (off_t)len<<3;
|
|
#endif
|
|
while (len--) {
|
|
put_byte(*buf++);
|
|
}
|
|
}
|