#include <QFileInfo>
#include <QDataStream>
#include <QDateTime>
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <fcntl.h>
#include <utime.h>
#include <sys/stat.h>
#include <iostream>
#include "us_gzip.h"
Go to the source code of this file.
|
#define | O_BINARY 0 |
|
#define | wp outcnt |
|
#define | GETBYTE() (inptr < insize ? inbuf[inptr++] : (wp = w, fill_inbuf(0))) |
|
#define | flush_output(w) (wp=(w),flush_window()) |
|
#define | put_byte(c) |
|
#define | put_short(w) |
|
#define | put_long(n) |
|
#define | GZIP_MAGIC "\037\213" /* Magic header for gzip files, 1F 8B */ |
|
#define | DEFLATED 8 |
|
#define | ORIG_NAME 0x08 /* bit 3 set: original file name present */ |
|
#define | SLOW 2 |
|
#define | OS_CODE 0x03 |
|
#define | slide window |
|
#define | NEXTBYTE() (uch)GETBYTE() |
|
#define | NEEDBITS(n) {while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}} |
|
#define | DUMPBITS(n) {b>>=(n);k-=(n);} |
|
#define | lbits 9 |
|
#define | dbits 6 |
|
#define | BMAX 16 /* maximum bit length of any code (16 for explode) */ |
|
#define | N_MAX 288 /* maximum number of codes in any set */ |
|
#define | memzero(s, n) bzero((s), (n)) |
|
#define | PATH_SEP '/' |
|
#define | HASH_BITS 15 |
|
#define | MIN_LOOKAHEAD ( MAX_MATCH + MIN_MATCH + 1 ) |
|
#define | MAX_DIST ( WSIZE - MIN_LOOKAHEAD ) |
|
#define | HASH_SIZE (unsigned) ( 1 << HASH_BITS ) |
|
#define | HASH_MASK ( HASH_SIZE - 1 ) |
|
#define | WMASK ( WSIZE - 1 ) |
|
#define | H_SHIFT ( (HASH_BITS + MIN_MATCH - 1) / MIN_MATCH ) |
|
#define | UPDATE_HASH(h, c) ( h = ( ( (h) << H_SHIFT ) ^ (c)) & HASH_MASK ) |
|
#define | INSERT_STRING(s, match_head) |
|
#define | FLUSH_BLOCK(eof) |
|
#define | TOO_FAR 4096 |
|
#define | pack_level 9 |
|
#define | d_code(dist) ( (dist) < 256 ? dist_code[ dist ] : dist_code[ 256 + ( ( dist ) >> 7 ) ] ) |
|
#define | STORED_BLOCK 0 |
|
#define | STORED STORED_BLOCK |
|
#define | STATIC_TREES 1 |
|
#define | DYN_TREES 2 |
|
#define | level 9 |
|
#define | seekable() 0 /* force sequential output */ |
|
#define | send_code(c, tree) send_bits( tree[ c ].Code, tree[ c ].Len ) |
|
#define | l_buf inbuf |
|
#define | SMALLEST 1 |
|
#define | pqremove(tree, top) |
|
#define | MAX(a, b) ( a >= b ? a : b ) |
|
#define | smaller(tree, n, m) |
|
#define | REP_3_6 16 |
|
#define | REPZ_3_10 17 |
|
#define | REPZ_11_138 18 |
|
#define BMAX 16 /* maximum bit length of any code (16 for explode) */ |
#define d_code |
( |
|
dist | ) |
( (dist) < 256 ? dist_code[ dist ] : dist_code[ 256 + ( ( dist ) >> 7 ) ] ) |
#define DUMPBITS |
( |
|
n | ) |
{b>>=(n);k-=(n);} |
#define FLUSH_BLOCK |
( |
|
eof | ) |
|
Value:flush_block( block_start >= 0L ? (char*) &window[ (unsigned) block_start ] : \
(char*) NULL, (long) strstart - block_start, (eof) )
Definition at line 1759 of file us_gzip.cpp.
#define flush_output |
( |
|
w | ) |
(wp=(w),flush_window()) |
#define GETBYTE |
( |
| ) |
(inptr < insize ? inbuf[inptr++] : (wp = w, fill_inbuf(0))) |
#define GZIP_MAGIC "\037\213" /* Magic header for gzip files, 1F 8B */ |
#define HASH_SIZE (unsigned) ( 1 << HASH_BITS ) |
#define INSERT_STRING |
( |
|
s, |
|
|
|
match_head |
|
) |
| |
#define MAX |
( |
|
a, |
|
|
|
b |
|
) |
| ( a >= b ? a : b ) |
#define memzero |
( |
|
s, |
|
|
|
n |
|
) |
| bzero((s), (n)) |
#define N_MAX 288 /* maximum number of codes in any set */ |
#define NEEDBITS |
( |
|
n | ) |
{while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}} |
#define ORIG_NAME 0x08 /* bit 3 set: original file name present */ |
#define pqremove |
( |
|
tree, |
|
|
|
top |
|
) |
| |
Value:{ \
outbuf[ outcnt++ ] = (
uch)(c); \
}
Value:{ \
put_short( (n) & 0xffff ); \
put_short( ( (
ulg) (n) ) >> 16) ; \
}
Value:{ \
{ \
outbuf[ outcnt++ ] = (
uch) ((w) & 0xff); \
outbuf[ outcnt++ ] = (
uch) ((
ush)(w) >> 8); \
} \
else \
{ \
put_byte( (
uch) ( (w) & 0xff) ); \
put_byte( (
uch) ( (
ush) (w) >> 8 ) ); \
} \
}
#define seekable |
( |
| ) |
0 /* force sequential output */ |
#define send_code |
( |
|
c, |
|
|
|
tree |
|
) |
| send_bits( tree[ c ].Code, tree[ c ].Len ) |
#define smaller |
( |
|
tree, |
|
|
|
n, |
|
|
|
m |
|
) |
| |
Value:( tree[ n ].Freq < tree[ m ].Freq || \
( tree[ n ].Freq == tree[ m ].Freq && depth[ n ] <= depth[ m ] ) )
Definition at line 2962 of file us_gzip.cpp.
#define WMASK ( WSIZE - 1 ) |