From 8978318d039cc3b857a3bae40c936e09070863ab Mon Sep 17 00:00:00 2001 From: Triang3l Date: Sun, 11 Jun 2017 21:58:38 +0300 Subject: [PATCH] Build 1 --- README.md | 20 + bs2pc.c | 980 +++++++++++++++++++++++++++++++++++++ gpl-2.0.md | 361 ++++++++++++++ zconf.h | 332 +++++++++++++ zlib.h | 1357 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 5 files changed, 3050 insertions(+) create mode 100644 README.md create mode 100644 bs2pc.c create mode 100644 gpl-2.0.md create mode 100644 zconf.h create mode 100644 zlib.h diff --git a/README.md b/README.md new file mode 100644 index 0000000..a76638d --- /dev/null +++ b/README.md @@ -0,0 +1,20 @@ +BS2PC +===== + +Converts Half-Life PlayStation 2 (`.bs2`) maps to PC (`.bsp`). + +Usage: `bs2pc path_to_map.bs2` or drag and drop. The `.bsp` file will be placed in the `.bs2` directory. + +See the Releases section for the Windows binary. + +Features: +* Converts all sections of PlayStation 2 maps. +* Automatically decompresses the map. +* Changes `.dol` and `.spz` file extensions to `.mdl` and `.spr` in the entities. +* Removes `nodraw`-textured surfaces such as the edges of the handrails near the Sector C entrance. + +Half-Life on PS2 uses DEFLATE compression for its maps and stores its internal structures (like the `m`-prefixed structures in GLQuake as opposed to the `d`-prefixed ones in the software-rendered engines and that are used in Quake and Half-Life `.bsp`) in the map files. This is part of the reason why the PlayStation 2 version loads levels much faster than the Dreamcast one. You can see some differences in the source file, the PC structures have `_id_t` in the name, and the PlayStation 2 ones have `_gbx_t`. Many fields (such as texture animation linked lists) were omitted though because they are not needed in the PC format. Two sections, very similar to clipnodes, are also skipped. + +On the PC maps after playing the PS2 ones or vice versa, some textures may look different (from minor power of 2 scaling artifacts to completely different images) as the textures have common names. If you want to switch between the two versions, restart the game so everything looks correct. + +Licensed under GPLv2 (except for zlib) as it's derived from the Quake engine source. \ No newline at end of file diff --git a/bs2pc.c b/bs2pc.c new file mode 100644 index 0000000..9f5a78b --- /dev/null +++ b/bs2pc.c @@ -0,0 +1,980 @@ +/* +Copyright (C) 1996-1997 Id Software, Inc. +Copyright (C) 2017 Triang3l + +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 2 +of the License, 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, write to the Free Software +Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. + +*/ + +#include +#include +#include +#include +#include +#ifdef _MSC_VER +#include +#define alloca _alloca +#define strcasecmp _stricmp +#define strncasecmp _strnicmp +#else +#include +#endif +#include "zlib.h" +#ifdef _WIN32 +#include +#endif + +/************* + * Structures + *************/ + +typedef unsigned int bspoffset_t; + +#define BSPVERSION_ID 30 +#define BSPVERSION_GBX 40 + +enum { + LUMP_ID_ENTITIES, + LUMP_ID_PLANES, + LUMP_ID_TEXTURES, + LUMP_ID_VERTEXES, + LUMP_ID_VISIBILITY, + LUMP_ID_NODES, + LUMP_ID_TEXINFO, + LUMP_ID_FACES, + LUMP_ID_LIGHTING, + LUMP_ID_CLIPNODES, + LUMP_ID_LEAFS, + LUMP_ID_MARKSURFACES, + LUMP_ID_EDGES, + LUMP_ID_SURFEDGES, + LUMP_ID_MODELS, + + LUMP_ID_COUNT +}; + +enum { + LUMP_GBX_PLANES, + LUMP_GBX_NODES, + LUMP_GBX_LEAFS, + LUMP_GBX_EDGES, + LUMP_GBX_SURFEDGES, + LUMP_GBX_VERTEXES, + LUMP_GBX_UNKNOWN1, + LUMP_GBX_CLIPNODES, + LUMP_GBX_MODELS, + LUMP_GBX_FACES, + LUMP_GBX_MARKSURFACES, + LUMP_GBX_VISIBILITY, + LUMP_GBX_LIGHTING, + LUMP_GBX_TEXTURES, + LUMP_GBX_ENTITIES, + LUMP_GBX_UNKNOWN2, + + LUMP_GBX_COUNT +}; + +#pragma pack(push, 4) + +typedef struct { + bspoffset_t fileofs; + unsigned int filelen; +} dlump_id_t; + +typedef struct { + unsigned int version; + dlump_id_t lumps[LUMP_ID_COUNT]; +} dheader_id_t; + +typedef struct { + unsigned int version; + bspoffset_t lumpofs[LUMP_GBX_COUNT]; + unsigned int lumplen[LUMP_GBX_COUNT]; +} dheader_gbx_t; + +typedef struct { + float normal[3]; + float dist; + unsigned int type; +} dplane_id_t; + +typedef struct { + float normal[3]; + float dist; + unsigned char type; + unsigned char signbits; + unsigned char pad[2]; +} dplane_gbx_t; + +#define MIPLEVELS_ID 4 + +typedef struct { + char name[16]; + unsigned int width, height; + unsigned int offsets[MIPLEVELS_ID]; +} dmiptex_id_t; + +typedef struct { + bspoffset_t offset; + bspoffset_t palette; + unsigned short width, height; + unsigned short scaled_width, scaled_height; + char name[16]; + unsigned char unknown1[3]; + unsigned char miplevels; + unsigned char unknown2[28]; +} dmiptex_gbx_t; + +typedef struct { + float point[3]; +} dvertex_id_t; + +typedef struct { + float point[4]; +} dvertex_gbx_t; + +typedef struct { + unsigned int planenum; + short children[2]; + short mins[3], maxs[3]; + unsigned short firstface, numfaces; +} dnode_id_t; + +typedef struct { + int contents; // 0 + bspoffset_t parent; + unsigned int visframe; + bspoffset_t plane; + float mins[4], maxs[4]; + bspoffset_t children[2]; + unsigned short firstface, numfaces; + unsigned char unknown1[4]; +} dnode_gbx_t; + +#define TEX_SPECIAL 1 + +typedef struct { + float vecs[2][4]; + unsigned int miptex; + unsigned int flags; +} dtexinfo_id_t; + +#define MAX_LIGHTMAPS 4 + +typedef struct { + unsigned short planenum; + unsigned short side; + unsigned int firstedge; + unsigned short numedges; + unsigned short texinfo; + unsigned char styles[MAX_LIGHTMAPS]; + unsigned int lightofs; +} dface_id_t; + +typedef struct { + float vecs[2][4]; + unsigned short side; + unsigned char unknown1[2]; + bspoffset_t miptex; + bspoffset_t lightofs; + bspoffset_t plane; + unsigned char unknown2[4]; + unsigned int firstedge; + unsigned int numedges; + unsigned char unknown3[40]; + unsigned char styles[MAX_LIGHTMAPS]; + unsigned char unknown4[40]; +} dface_gbx_t; + +#define NUM_AMBIENTS 4 + +typedef struct { + int contents; + unsigned int visofs; + short mins[3], maxs[3]; + unsigned short firstmarksurface, nummarksurfaces; + unsigned char ambient_level[NUM_AMBIENTS]; +} dleaf_id_t; + +typedef struct { + int contents; + bspoffset_t parent; + unsigned int visframe; + unsigned char unknown1[4]; + float mins[4], maxs[4]; + bspoffset_t visofs; + unsigned int firstmarksurface, nummarksurfaces; + unsigned char ambient_level[NUM_AMBIENTS]; +} dleaf_gbx_t; + +typedef unsigned short dmarksurface_id_t; +typedef unsigned int dmarksurface_gbx_t; + +#define MAX_MAP_HULLS 4 + +typedef struct { + float mins[3], maxs[3]; + float origin[3]; + unsigned int headnode[MAX_MAP_HULLS]; + unsigned int visleafs; + unsigned int firstface, numfaces; +} dmodel_id_t; + +typedef struct { + float mins[4], maxs[4]; + float origin[4]; + unsigned int headnode[MAX_MAP_HULLS]; + unsigned int visleafs; + unsigned int firstface, numfaces; + unsigned char unknown1[4]; +} dmodel_gbx_t; + +#pragma pack(pop) + +/********* + * Conversion + *********/ + +static unsigned char *bspfile_gbx; +static const dheader_gbx_t *header_gbx; + +inline unsigned int BS2PC_GBXOffsetToIndex(bspoffset_t offset, unsigned int lump, unsigned int lumpSize) { + return (offset - header_gbx->lumpofs[lump]) / lumpSize; +} + +static unsigned char *bspfile_id; +static unsigned int bspfile_size_id; +static dheader_id_t *header_id; + +static unsigned int texture_count; +static unsigned int texture_lump_size; +static bool *textures_special; // Whether textures are special - texinfo needs this. +static unsigned int texture_nodraw = UINT_MAX; + +// Nodraw skipping. +static unsigned int *nodraw_face_map; +static unsigned int nodraw_face_count; +static dmarksurface_gbx_t *nodraw_marksurface_map; +static dmarksurface_id_t *nodraw_marksurface_lump_id; +static unsigned int nodraw_marksurface_count; + +static void BS2PC_PreProcessTextureLump() { + const dmiptex_gbx_t *textureGbx = (const dmiptex_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_TEXTURES]); + unsigned int textureIndex; + + // The first texture's bytes follow the last texture info. + texture_count = (textureGbx->offset - header_gbx->lumpofs[LUMP_GBX_TEXTURES]) / sizeof(dmiptex_gbx_t); + textures_special = calloc(texture_count, sizeof(bool)); + if (textures_special == NULL) { + fputs("Couldn't allocate special texture flags.\n", stderr); + exit(EXIT_FAILURE); + } + + texture_lump_size = sizeof(unsigned int) /* texture count */ + + texture_count * (sizeof(bspoffset_t) /* offset */ + sizeof(dmiptex_id_t) + (2 + 768 + 2)); + + texture_nodraw = UINT_MAX; + for (textureIndex = 0; textureIndex < texture_count; ++textureIndex) { + const char *textureName = textureGbx->name; + unsigned int width, height; + + if (texture_nodraw == UINT_MAX && strncasecmp(textureName, "nodraw", 6) == 0) { + texture_nodraw = textureIndex; + } else if (textureName[0] == '*' || + strncasecmp(textureName, "sky", 3) == 0 || + strncasecmp(textureName, "clip", 4) == 0 || + strncasecmp(textureName, "origin", 6) == 0 || + strncasecmp(textureName, "aaatrigger", 10) == 0) { + textures_special[textureIndex] = true; + } + + width = textureGbx->width; + height = textureGbx->height; + if (width == 0 || height == 0 || (width & 15) != 0 || (height & 15) != 0) { + fprintf(stderr, "Texture %s has non-16-aligned width or height.\n", textureName); + exit(EXIT_FAILURE); + } + texture_lump_size += width * height + + (width >> 1) * (height >> 1) + + (width >> 2) * (height >> 2) + + (width >> 3) * (height >> 3); + + ++textureGbx; + } +} + +static void BS2PC_InitializeNodraw() { + unsigned int faceCount = header_gbx->lumplen[LUMP_GBX_FACES] / sizeof(dface_gbx_t); + unsigned int marksurfaceCount = header_gbx->lumplen[LUMP_GBX_MARKSURFACES] / sizeof(dmarksurface_gbx_t); + unsigned int faceIndex, marksurfaceIndex; + const dface_gbx_t *faces, *face; + const dmarksurface_gbx_t *marksurface; + + if (texture_nodraw == UINT_MAX) { + return; + } + + nodraw_face_map = (unsigned int *) malloc(faceCount * sizeof(unsigned int)); + nodraw_face_count = 0; + nodraw_marksurface_map = (dmarksurface_gbx_t *) malloc(marksurfaceCount * sizeof(dmarksurface_gbx_t)); + nodraw_marksurface_count = 0; + nodraw_marksurface_lump_id = (dmarksurface_id_t *) malloc(marksurfaceCount * sizeof(dmarksurface_id_t)); + + if (nodraw_face_map == NULL || nodraw_marksurface_map == NULL || nodraw_marksurface_lump_id == NULL) { + fputs("Couldn't allocate non-nodraw face and marksurface maps.\n", stderr); + exit(EXIT_FAILURE); + } + + faces = (const dface_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_FACES]); + + for (faceIndex = 0, face = faces; faceIndex < faceCount; ++faceIndex, ++face) { + nodraw_face_map[faceIndex] = nodraw_face_count; + if (BS2PC_GBXOffsetToIndex(face->miptex, LUMP_GBX_TEXTURES, sizeof(dmiptex_gbx_t)) != texture_nodraw) { + ++nodraw_face_count; + } + } + + marksurface = (const dmarksurface_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_MARKSURFACES]); + for (marksurfaceIndex = 0; marksurfaceIndex < marksurfaceCount; ++marksurfaceIndex, ++marksurface) { + nodraw_marksurface_map[marksurfaceIndex] = nodraw_marksurface_count; + if (BS2PC_GBXOffsetToIndex(faces[*marksurface].miptex, LUMP_GBX_TEXTURES, sizeof(dmiptex_gbx_t)) != texture_nodraw) { + nodraw_marksurface_lump_id[nodraw_marksurface_count] = (unsigned short) nodraw_face_map[*marksurface]; + ++nodraw_marksurface_count; + } + } +} + +static void BS2PC_RemapNodrawFaceRange(unsigned int inFirst, unsigned int inCount, unsigned int *outFirst, unsigned int *outCount) { + unsigned int index, count; + const dface_gbx_t *gbxFace; + + if (texture_nodraw == UINT_MAX) { + *outFirst = inFirst; + *outCount = inCount; + return; + } + + *outFirst = nodraw_face_map[inFirst]; + count = 0; + gbxFace = (const dface_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_FACES]) + inFirst; + for (index = 0; index < inCount; ++index, ++gbxFace) { + if (BS2PC_GBXOffsetToIndex(gbxFace->miptex, LUMP_GBX_TEXTURES, sizeof(dmiptex_gbx_t)) != texture_nodraw) { + ++count; + } + } + *outCount = count; +} + +static void BS2PC_RemapMarksurfaceFaceRange(unsigned int inFirst, unsigned int inCount, unsigned int *outFirst, unsigned int *outCount) { + unsigned int index, count; + const dmarksurface_gbx_t *gbxMarksurface; + const dface_gbx_t *gbxFace; + + if (texture_nodraw == UINT_MAX) { + *outFirst = inFirst; + *outCount = inCount; + return; + } + + *outFirst = nodraw_marksurface_map[inFirst]; + count = 0; + gbxMarksurface = (const dmarksurface_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_MARKSURFACES]) + inFirst; + for (index = 0; index < inCount; ++index, ++gbxMarksurface) { + gbxFace = (const dface_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_FACES]) + *gbxMarksurface; + if (BS2PC_GBXOffsetToIndex(gbxFace->miptex, LUMP_GBX_TEXTURES, sizeof(dmiptex_gbx_t)) != texture_nodraw) { + ++count; + } + } + *outCount = count; +} + +static void BS2PC_AllocateIDBSP() { + const dheader_gbx_t *header_gbx = (const dheader_gbx_t *) bspfile_gbx; + dheader_id_t headerId; + unsigned int bspSize; + unsigned int faceCount; + + headerId.version = BSPVERSION_ID; + bspSize = (sizeof(dheader_id_t) + 3) & ~3; + + if (texture_nodraw != UINT_MAX) { + faceCount = nodraw_face_count; + } else { + faceCount = header_gbx->lumplen[LUMP_GBX_FACES] / sizeof(dface_gbx_t); + } + + headerId.lumps[LUMP_ID_PLANES].fileofs = bspSize; + headerId.lumps[LUMP_ID_PLANES].filelen = header_gbx->lumplen[LUMP_GBX_PLANES] / sizeof(dplane_gbx_t) * sizeof(dplane_id_t); + bspSize += (headerId.lumps[LUMP_ID_PLANES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_LEAFS].fileofs = bspSize; + headerId.lumps[LUMP_ID_LEAFS].filelen = header_gbx->lumplen[LUMP_GBX_LEAFS] / sizeof(dleaf_gbx_t) * sizeof(dleaf_id_t); + bspSize += (headerId.lumps[LUMP_ID_LEAFS].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_VERTEXES].fileofs = bspSize; + headerId.lumps[LUMP_ID_VERTEXES].filelen = header_gbx->lumplen[LUMP_GBX_VERTEXES] / sizeof(dvertex_gbx_t) * sizeof(dvertex_id_t); + bspSize += (headerId.lumps[LUMP_ID_VERTEXES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_NODES].fileofs = bspSize; + headerId.lumps[LUMP_ID_NODES].filelen = header_gbx->lumplen[LUMP_GBX_NODES] / sizeof(dnode_gbx_t) * sizeof(dnode_id_t); + bspSize += (headerId.lumps[LUMP_ID_NODES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_TEXINFO].fileofs = bspSize; + headerId.lumps[LUMP_ID_TEXINFO].filelen = faceCount * sizeof(dtexinfo_id_t); + bspSize += (headerId.lumps[LUMP_ID_TEXINFO].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_FACES].fileofs = bspSize; + headerId.lumps[LUMP_ID_FACES].filelen = faceCount * sizeof(dface_id_t); + bspSize += (headerId.lumps[LUMP_ID_FACES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_CLIPNODES].fileofs = bspSize; + headerId.lumps[LUMP_ID_CLIPNODES].filelen = header_gbx->lumplen[LUMP_GBX_CLIPNODES]; + bspSize += (headerId.lumps[LUMP_ID_CLIPNODES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_MARKSURFACES].fileofs = bspSize; + if (texture_nodraw != UINT_MAX) { + headerId.lumps[LUMP_ID_MARKSURFACES].filelen = nodraw_marksurface_count * sizeof(dmarksurface_id_t); + } else { + headerId.lumps[LUMP_ID_MARKSURFACES].filelen = header_gbx->lumplen[LUMP_GBX_MARKSURFACES] / sizeof(dmarksurface_gbx_t) * sizeof(dmarksurface_id_t); + } + bspSize += (headerId.lumps[LUMP_ID_MARKSURFACES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_SURFEDGES].fileofs = bspSize; + headerId.lumps[LUMP_ID_SURFEDGES].filelen = header_gbx->lumplen[LUMP_GBX_SURFEDGES]; + bspSize += (headerId.lumps[LUMP_ID_SURFEDGES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_EDGES].fileofs = bspSize; + headerId.lumps[LUMP_ID_EDGES].filelen = header_gbx->lumplen[LUMP_GBX_EDGES]; + bspSize += (headerId.lumps[LUMP_ID_EDGES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_MODELS].fileofs = bspSize; + headerId.lumps[LUMP_ID_MODELS].filelen = header_gbx->lumplen[LUMP_GBX_MODELS] / sizeof(dmodel_gbx_t) * sizeof(dmodel_id_t); + bspSize += (headerId.lumps[LUMP_ID_MODELS].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_LIGHTING].fileofs = bspSize; + headerId.lumps[LUMP_ID_LIGHTING].filelen = header_gbx->lumplen[LUMP_GBX_LIGHTING]; + bspSize += (headerId.lumps[LUMP_ID_LIGHTING].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_VISIBILITY].fileofs = bspSize; + headerId.lumps[LUMP_ID_VISIBILITY].filelen = header_gbx->lumplen[LUMP_GBX_VISIBILITY]; + bspSize += (headerId.lumps[LUMP_ID_VISIBILITY].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_ENTITIES].fileofs = bspSize; + headerId.lumps[LUMP_ID_ENTITIES].filelen = header_gbx->lumplen[LUMP_GBX_ENTITIES]; + bspSize += (headerId.lumps[LUMP_ID_ENTITIES].filelen + 3) & ~3; + + headerId.lumps[LUMP_ID_TEXTURES].fileofs = bspSize; + headerId.lumps[LUMP_ID_TEXTURES].filelen = texture_lump_size; + bspSize += headerId.lumps[LUMP_ID_TEXTURES].filelen; + + bspfile_size_id = bspSize; + bspfile_id = (unsigned char *) calloc(1, bspfile_size_id); + if (bspfile_id == NULL) { + fputs("Couldn't allocate the .bsp file contents.\n", stderr); + exit(EXIT_FAILURE); + } + header_id = (dheader_id_t *) bspfile_id; + memcpy(header_id, &headerId, sizeof(dheader_id_t)); +} + +static void BS2PC_CopyLump(unsigned int gbxLump, unsigned int idLump) { + memcpy(bspfile_id + header_id->lumps[idLump].fileofs, + bspfile_gbx + header_gbx->lumpofs[gbxLump], + header_gbx->lumplen[gbxLump]); +} + +static void BS2PC_ConvertPlanes() { + const dplane_gbx_t *gbx = (const dplane_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_PLANES]); + dplane_id_t *id = (dplane_id_t *) (bspfile_id + header_id->lumps[LUMP_ID_PLANES].fileofs); + unsigned int index, count = header_gbx->lumplen[LUMP_GBX_PLANES] / sizeof(dplane_gbx_t); + for (index = 0; index < count; ++index, ++gbx, ++id) { + id->normal[0] = gbx->normal[0]; + id->normal[1] = gbx->normal[1]; + id->normal[2] = gbx->normal[2]; + id->dist = gbx->dist; + id->type = gbx->type; + } +} + +static void BS2PC_ConvertLeafs() { + const dleaf_gbx_t *gbx = (const dleaf_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_LEAFS]); + dleaf_id_t *id = (dleaf_id_t *) (bspfile_id + header_id->lumps[LUMP_ID_LEAFS].fileofs); + unsigned int index, count = header_gbx->lumplen[LUMP_GBX_LEAFS] / sizeof(dleaf_gbx_t); + for (index = 0; index < count; ++index, ++gbx, ++id) { + unsigned int firstMarksurface, marksurfaceCount; + id->contents = gbx->contents; + id->mins[0] = (short) gbx->mins[0]; + id->mins[1] = (short) gbx->mins[1]; + id->mins[2] = (short) gbx->mins[2]; + id->maxs[0] = (short) gbx->maxs[0]; + id->maxs[1] = (short) gbx->maxs[1]; + id->maxs[2] = (short) gbx->maxs[2]; + id->visofs = gbx->visofs - (gbx->visofs != UINT_MAX ? header_gbx->lumpofs[LUMP_GBX_VISIBILITY] : 0); + BS2PC_RemapMarksurfaceFaceRange(gbx->firstmarksurface, gbx->nummarksurfaces, &firstMarksurface, &marksurfaceCount); + id->firstmarksurface = (unsigned short) firstMarksurface; + id->nummarksurfaces = (unsigned short) marksurfaceCount; + memcpy(id->ambient_level, gbx->ambient_level, sizeof(id->ambient_level)); + } +} + +static void BS2PC_ConvertVertexes() { + const dvertex_gbx_t *gbx = (const dvertex_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_VERTEXES]); + dvertex_id_t *id = (dvertex_id_t *) (bspfile_id + header_id->lumps[LUMP_ID_VERTEXES].fileofs); + unsigned int index, count = header_gbx->lumplen[LUMP_GBX_VERTEXES] / sizeof(dvertex_gbx_t); + for (index = 0; index < count; ++index, ++gbx, ++id) { + id->point[0] = gbx->point[0]; + id->point[1] = gbx->point[1]; + id->point[2] = gbx->point[2]; + } +} + +static void BS2PC_ConvertNodes() { + const dnode_gbx_t *gbx = (const dnode_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_NODES]); + dnode_id_t *id = (dnode_id_t *) (bspfile_id + header_id->lumps[LUMP_ID_NODES].fileofs); + unsigned int index, count = header_gbx->lumplen[LUMP_GBX_NODES] / sizeof(dnode_gbx_t); + for (index = 0; index < count; ++index, ++gbx, ++id) { + const dnode_gbx_t *child; + unsigned int firstFace, faceCount; + + id->planenum = BS2PC_GBXOffsetToIndex(gbx->plane, LUMP_GBX_PLANES, sizeof(dplane_gbx_t)); + + child = (const dnode_gbx_t *) (bspfile_gbx + gbx->children[0]); + if (child->contents == 0) { + id->children[0] = (short) BS2PC_GBXOffsetToIndex(gbx->children[0], LUMP_GBX_NODES, sizeof(dnode_gbx_t)); + } else { + id->children[0] = -1 - (short) BS2PC_GBXOffsetToIndex(gbx->children[0], LUMP_GBX_LEAFS, sizeof(dleaf_gbx_t)); + } + + child = (const dnode_gbx_t *) (bspfile_gbx + gbx->children[1]); + if (child->contents == 0) { + id->children[1] = (short) BS2PC_GBXOffsetToIndex(gbx->children[1], LUMP_GBX_NODES, sizeof(dnode_gbx_t)); + } else { + id->children[1] = -1 - (short) BS2PC_GBXOffsetToIndex(gbx->children[1], LUMP_GBX_LEAFS, sizeof(dleaf_gbx_t)); + } + + id->mins[0] = (short) gbx->mins[0]; + id->mins[1] = (short) gbx->mins[1]; + id->mins[2] = (short) gbx->mins[2]; + id->maxs[0] = (short) gbx->maxs[0]; + id->maxs[1] = (short) gbx->maxs[1]; + id->maxs[2] = (short) gbx->maxs[2]; + BS2PC_RemapNodrawFaceRange(gbx->firstface, gbx->numfaces, &firstFace, &faceCount); + id->firstface = (unsigned short) firstFace; + id->numfaces = (unsigned short) faceCount; + } +} + +static void BS2PC_ConvertTexinfo() { + const dface_gbx_t *gbx = (const dface_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_FACES]); + dtexinfo_id_t *id = (dtexinfo_id_t *) (bspfile_id + header_id->lumps[LUMP_ID_TEXINFO].fileofs); + unsigned int index, count = header_gbx->lumplen[LUMP_GBX_FACES] / sizeof(dface_gbx_t); + for (index = 0; index < count; ++index, ++gbx) { + unsigned int miptex = BS2PC_GBXOffsetToIndex(gbx->miptex, LUMP_GBX_TEXTURES, sizeof(dmiptex_gbx_t)); + if (texture_nodraw != UINT_MAX && miptex == texture_nodraw) { + continue; + } + memcpy(id->vecs, gbx->vecs, sizeof(id->vecs)); + id->miptex = miptex; + id->flags = (textures_special[miptex] ? TEX_SPECIAL : 0); + ++id; + } +} + +static void BS2PC_ConvertFaces() { + const dface_gbx_t *gbx = (const dface_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_FACES]); + dface_id_t *id = (dface_id_t *) (bspfile_id + header_id->lumps[LUMP_ID_FACES].fileofs); + unsigned int index, count = header_gbx->lumplen[LUMP_GBX_FACES] / sizeof(dface_gbx_t); + unsigned int idIndex = 0; + for (index = 0; index < count; ++index, ++gbx) { + if (texture_nodraw != UINT_MAX && BS2PC_GBXOffsetToIndex(gbx->miptex, LUMP_GBX_TEXTURES, sizeof(dmiptex_gbx_t)) == texture_nodraw) { + continue; + } + id->planenum = (unsigned short) BS2PC_GBXOffsetToIndex(gbx->plane, LUMP_GBX_PLANES, sizeof(dplane_gbx_t)); + id->side = gbx->side; + id->firstedge = gbx->firstedge; + id->numedges = (unsigned short) gbx->numedges; + id->texinfo = (unsigned short) idIndex; + memcpy(id->styles, gbx->styles, sizeof(id->styles)); + id->lightofs = gbx->lightofs - (gbx->lightofs != UINT_MAX ? header_gbx->lumpofs[LUMP_GBX_LIGHTING] : 0); + ++idIndex; + ++id; + } +} + +static void BS2PC_ConvertMarksurfaces() { + const dmarksurface_gbx_t *gbx; + dmarksurface_id_t *id = (dmarksurface_id_t *) (bspfile_id + header_id->lumps[LUMP_ID_MARKSURFACES].fileofs); + unsigned int index, count; + + if (texture_nodraw != UINT_MAX) { + memcpy(id, nodraw_marksurface_lump_id, nodraw_marksurface_count * sizeof(dmarksurface_id_t)); + return; + } + + gbx = (const dmarksurface_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_MARKSURFACES]); + count = header_gbx->lumplen[LUMP_GBX_MARKSURFACES] / sizeof(dmarksurface_gbx_t); + for (index = 0; index < count; ++index, ++id) { + *id = (dmarksurface_id_t) gbx[index]; + } +} + +static void BS2PC_ConvertModels() { + const dmodel_gbx_t *gbx = (const dmodel_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_MODELS]); + dmodel_id_t *id = (dmodel_id_t *) (bspfile_id + header_id->lumps[LUMP_ID_MODELS].fileofs); + unsigned int index, count = header_gbx->lumplen[LUMP_GBX_MODELS] / sizeof(dmodel_gbx_t); + for (index = 0; index < count; ++index, ++gbx, ++id) { + memcpy(id->mins, gbx->mins, 3 * sizeof(float)); + memcpy(id->maxs, gbx->maxs, 3 * sizeof(float)); + memcpy(id->origin, gbx->origin, 3 * sizeof(float)); + memcpy(id->headnode, gbx->headnode, sizeof(id->headnode)); + id->visleafs = gbx->visleafs; + BS2PC_RemapNodrawFaceRange(gbx->firstface, gbx->numfaces, &id->firstface, &id->numfaces); + } +} + +static void BS2PC_ConvertEntities() { + const char *gbx = (const char *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_ENTITIES]); + char *id = (char *) (bspfile_id + header_id->lumps[LUMP_ID_ENTITIES].fileofs); + unsigned int index, count = header_gbx->lumplen[LUMP_GBX_ENTITIES]; + + char *stringStart = NULL; + unsigned int stringLength; + + for (index = 0; index < count; ++index, ++gbx, ++id) { + char character = *gbx; + *id = character; + + if (character == '"') { + if (stringStart != NULL) { + if (stringLength >= 11 && + strncasecmp(stringStart, "models/", 7) == 0 && + strncasecmp(stringStart + stringLength - 4, ".dol", 4) == 0) { + stringStart[stringLength - 3] += 'm' - 'd'; + stringStart[stringLength - 2] += 'd' - 'o'; + // stringStart[stringLength - 1] += 'l' - 'l'; + } else if (stringLength >= 12 && + strncasecmp(stringStart, "sprites/", 8) == 0 && + strncasecmp(stringStart + stringLength - 4, ".spz", 4) == 0) { + // stringStart[stringLength - 3] += 's' - 's'; + // stringStart[stringLength - 2] += 'p' - 'p'; + stringStart[stringLength - 1] += 'r' - 'z'; + } + stringStart = NULL; + } else { + stringStart = id + 1; + stringLength = 0; + } + } else { + if (stringStart != NULL) { + ++stringLength; + } + } + } +} + +// GL_Resample8BitTexture from Quake. +void BS2PC_ResampleTexture(unsigned char *in, int inwidth, int inheight, unsigned char *out, int outwidth, int outheight) +{ + int i, j; + unsigned char *inrow; + unsigned frac, fracstep; + + fracstep = inwidth * 0x10000 / outwidth; + for (i = 0; i < outheight; ++i, out += outwidth) + { + inrow = in + inwidth * (i * inheight / outheight); + frac = fracstep >> 1; + for (j = 0; j < outwidth; j += 4) + { + out[j] = inrow[frac >> 16]; + frac += fracstep; + out[j + 1] = inrow[frac >> 16]; + frac += fracstep; + out[j + 2] = inrow[frac >> 16]; + frac += fracstep; + out[j + 3] = inrow[frac >> 16]; + frac += fracstep; + } + } +} + +void BS2PC_ConvertTextures() { + const dmiptex_gbx_t *texturesGbx = (const dmiptex_gbx_t *) (bspfile_gbx + header_gbx->lumpofs[LUMP_GBX_TEXTURES]); + unsigned char *lumpId = bspfile_id + header_id->lumps[LUMP_ID_TEXTURES].fileofs; + unsigned int *miptexOffsets, miptexOffset; + unsigned int textureIndex; + + // Miptex table + *((unsigned int *) lumpId) = texture_count; + miptexOffsets = (unsigned int *) (lumpId + sizeof(unsigned int)); + miptexOffset = (texture_count + 1) * sizeof(unsigned int); + for (textureIndex = 0; textureIndex < texture_count; ++textureIndex) { + const dmiptex_gbx_t *textureGbx = &texturesGbx[textureIndex]; + miptexOffsets[textureIndex] = miptexOffset; + miptexOffset += sizeof(dmiptex_id_t) + + textureGbx->width * textureGbx->height + + (textureGbx->width >> 1) * (textureGbx->height >> 1) + + (textureGbx->width >> 2) * (textureGbx->height >> 2) + + (textureGbx->width >> 3) * (textureGbx->height >> 3) + + (2 + 768 + 2); + } + + // Texture data + for (textureIndex = 0; textureIndex < texture_count; ++textureIndex) { + const dmiptex_gbx_t *textureGbx = &texturesGbx[textureIndex]; + unsigned char *textureId = lumpId + miptexOffsets[textureIndex]; + dmiptex_id_t *headerId = (dmiptex_id_t *) textureId; + unsigned int width, height; + const unsigned char *paletteGbx; + unsigned char *paletteId; + bool liquid; + unsigned int colorIndex; + + memcpy(headerId->name, textureGbx->name, sizeof(headerId->name)); + width = textureGbx->width; + height = textureGbx->height; + headerId->width = width; + headerId->height = height; + + headerId->offsets[0] = sizeof(dmiptex_id_t); + headerId->offsets[1] = headerId->offsets[0] + width * height; + headerId->offsets[2] = headerId->offsets[1] + (width >> 1) * (height >> 1); + headerId->offsets[3] = headerId->offsets[2] + (width >> 2) * (height >> 2); + + if (textureGbx->scaled_width == width && textureGbx->scaled_height == height) { + memcpy(textureId + headerId->offsets[0], bspfile_gbx + textureGbx->offset, width * height); + } else { + BS2PC_ResampleTexture(bspfile_gbx + textureGbx->offset, textureGbx->scaled_width, textureGbx->scaled_height, + textureId + headerId->offsets[0], width, height); + } + BS2PC_ResampleTexture(textureId + headerId->offsets[0], width, height, + textureId + headerId->offsets[1], width >> 1, height >> 1); + BS2PC_ResampleTexture(textureId + headerId->offsets[1], width >> 1, height >> 1, + textureId + headerId->offsets[2], width >> 2, height >> 2); + BS2PC_ResampleTexture(textureId + headerId->offsets[2], width >> 2, height >> 2, + textureId + headerId->offsets[3], width >> 3, height >> 3); + + paletteGbx = bspfile_gbx + textureGbx->palette; + paletteId = textureId + headerId->offsets[3] + (width >> 3) * (height >> 3); + *((unsigned short *) paletteId) = 256; + paletteId += sizeof(unsigned short); + liquid = (textureGbx->name[0] == '!'); + for (colorIndex = 0; colorIndex < 256; ++colorIndex) { + unsigned int colorIndexGbx, colorIndexLow; + const unsigned char *colorGbx; + + colorIndexGbx = colorIndex; + colorIndexLow = colorIndex & 0x1f; + if (colorIndexLow >= 8 && colorIndexLow <= 15) { + colorIndexGbx += 8; + } else if (colorIndexLow >= 16 && colorIndexLow <= 23) { + colorIndexGbx -= 8; + } + + colorGbx = paletteGbx + (colorIndexGbx * 4); + if (liquid) { + *(paletteId++) = colorGbx[0]; + *(paletteId++) = colorGbx[1]; + *(paletteId++) = colorGbx[2]; + } else { + *(paletteId++) = (unsigned char) (((unsigned int) min(colorGbx[0], 127)) * 255 / 127); + *(paletteId++) = (unsigned char) (((unsigned int) min(colorGbx[1], 127)) * 255 / 127); + *(paletteId++) = (unsigned char) (((unsigned int) min(colorGbx[2], 127)) * 255 / 127); + } + } + } +} + +#ifdef _WIN32 +#define BS2PC_ZLIB_IMPORT WINAPI +#else +#define BS2PC_ZLIB_IMPORT +#endif +typedef int (BS2PC_ZLIB_IMPORT *qinflateInit__t)(z_streamp strm, const char *version, int stream_size); +static qinflateInit__t qinflateInit_; +typedef int (BS2PC_ZLIB_IMPORT *qinflate_t)(z_streamp strm, int flush); +static qinflate_t qinflate; +typedef int (BS2PC_ZLIB_IMPORT *qinflateEnd_t)(z_streamp strm); +static qinflateEnd_t qinflateEnd; + +void BS2PC_InitializeZlib() { + #ifdef _WIN32 + HMODULE module; + module = LoadLibrary(TEXT("zlibwapi.dll")); + if (module == NULL) { + fputs("Couldn't open zlibwapi.dll.\n", stderr); + exit(EXIT_FAILURE); + } + + qinflateInit_ = (qinflateInit__t) GetProcAddress(module, "inflateInit_"); + qinflate = (qinflate_t) GetProcAddress(module, "inflate"); + qinflateEnd = (qinflateEnd_t) GetProcAddress(module, "inflateEnd"); + #else + #error No zlib loading code for this platform. + #endif + + if (qinflateInit_ == NULL || qinflate == NULL || qinflateEnd == NULL) { + fputs("Couldn't get a zlib function.\n", stderr); + exit(EXIT_FAILURE); + } +} + +int main(int argc, const char **argv) { + FILE *bs2File, *idFile; + long bs2FileSize; + unsigned char *bs2FileContents; + unsigned int gbxFileSize; + z_stream stream; + size_t fileNameLength; + char *idFileName; + + fputs("BS2PC build 1 - Half-Life PlayStation 2 to PC map converter.\n", stderr); + if (argc < 2) { + fputs("Specify the .bs2 file path when launching.\n", stderr); + return EXIT_SUCCESS; + } + + fputs("Initializing zlib...\n", stderr); + BS2PC_InitializeZlib(); + + fputs("Loading the .bs2 file...\n", stderr); + + bs2File = fopen(argv[1], "rb"); + if (bs2File == NULL) { + fputs("Couldn't open the .bs2 file.\n", stderr); + return EXIT_FAILURE; + } + + fseek(bs2File, 0, SEEK_END); + bs2FileSize = ftell(bs2File); + if (bs2FileSize <= 4) { + fputs("Couldn't get the .bs2 file size or it's invalid.\n", stderr); + return EXIT_FAILURE; + } + rewind(bs2File); + + bs2FileContents = (unsigned char *) malloc(bs2FileSize); + if (bs2FileContents == NULL) { + fputs("Couldn't allocate the .bs2 file contents.\n", stderr); + return EXIT_FAILURE; + } + + if (fread(bs2FileContents, bs2FileSize, 1, bs2File) == 0) { + fputs("Couldn't read the .bs2 file.\n", stderr); + return EXIT_FAILURE; + } + + fclose(bs2File); + + fputs("Decompressing .bs2...\n", stderr); + + gbxFileSize = *((unsigned int *) bs2FileContents); + bspfile_gbx = (unsigned char *) malloc(gbxFileSize); + if (bspfile_gbx == NULL) { + fputs("Couldn't allocate the uncompressed .bs2 file contents.\n", stderr); + return EXIT_FAILURE; + } + + stream.zalloc = Z_NULL; + stream.zfree = Z_NULL; + stream.opaque = Z_NULL; + stream.avail_in = bs2FileSize - sizeof(unsigned int); + stream.next_in = (Bytef *) (bs2FileContents + sizeof(unsigned int)); + stream.avail_out = gbxFileSize; + stream.next_out = (Bytef *) bspfile_gbx; + if (qinflateInit_(&stream, ZLIB_VERSION, sizeof(stream)) != Z_OK) { + fputs("Couldn't initialize decompression.\n", stderr); + return EXIT_FAILURE; + } + if (qinflate(&stream, Z_NO_FLUSH) != Z_STREAM_END) { + fputs("Couldn't decompress the map.\n", stderr); + return EXIT_FAILURE; + } + qinflateEnd(&stream); + + free(bs2FileContents); + + header_gbx = (const dheader_gbx_t *) bspfile_gbx; + if (header_gbx->version != BSPVERSION_GBX) { + fputs("Invalid .bs2 version.\n", stderr); + return EXIT_FAILURE; + } + + fputs("Processing the texture lump...\n", stderr); + BS2PC_PreProcessTextureLump(); + fputs("Building nodraw skipping info...\n", stderr); + BS2PC_InitializeNodraw(); + fputs("Initializing the .bsp header...\n", stderr); + BS2PC_AllocateIDBSP(); + fputs("Converting planes...\n", stderr); + BS2PC_ConvertPlanes(); + fputs("Converting leaves...\n", stderr); + BS2PC_ConvertLeafs(); + fputs("Converting vertices...\n", stderr); + BS2PC_ConvertVertexes(); + fputs("Converting nodes...\n", stderr); + BS2PC_ConvertNodes(); + fputs("Converting texture info...\n", stderr); + BS2PC_ConvertTexinfo(); + fputs("Converting faces...\n", stderr); + BS2PC_ConvertFaces(); + fputs("Copying clipnodes...\n", stderr); + BS2PC_CopyLump(LUMP_GBX_CLIPNODES, LUMP_ID_CLIPNODES); + fputs("Converting marksurfaces...\n", stderr); + BS2PC_ConvertMarksurfaces(); + fputs("Copying surfedges...\n", stderr); + BS2PC_CopyLump(LUMP_GBX_SURFEDGES, LUMP_ID_SURFEDGES); + fputs("Copying edges...\n", stderr); + BS2PC_CopyLump(LUMP_GBX_EDGES, LUMP_ID_EDGES); + fputs("Converting models...\n", stderr); + BS2PC_ConvertModels(); + fputs("Copying lighting...\n", stderr); + BS2PC_CopyLump(LUMP_GBX_LIGHTING, LUMP_ID_LIGHTING); + fputs("Copying visibility...\n", stderr); + BS2PC_CopyLump(LUMP_GBX_VISIBILITY, LUMP_ID_VISIBILITY); + fputs("Converting entities...\n", stderr); + BS2PC_ConvertEntities(); + fputs("Converting textures...\n", stderr); + BS2PC_ConvertTextures(); + + fputs("Writing the .bsp file...\n", stderr); + + fileNameLength = strlen(argv[1]); + idFileName = alloca(fileNameLength + 5); + strcpy(idFileName, argv[1]); + if (fileNameLength >= 4 && strcasecmp(idFileName + fileNameLength - 4, ".bs2") == 0) { + idFileName[fileNameLength - 1] = (idFileName[fileNameLength - 3] == 'B' ? 'P' : 'p'); + } else { + strcpy(idFileName + fileNameLength, ".bsp"); + } + + idFile = fopen(idFileName, "wb"); + if (idFile == NULL) { + fputs("Couldn't open the .bsp file.\n", stderr); + return EXIT_FAILURE; + } + + if (fwrite(bspfile_id, bspfile_size_id, 1, idFile) == 0) { + fputs("Couldn't write the .bsp file.\n", stderr); + return EXIT_FAILURE; + } + + fclose(idFile); + + fprintf(stderr, "%s converted.\n", argv[1]); + + return EXIT_SUCCESS; +} \ No newline at end of file diff --git a/gpl-2.0.md b/gpl-2.0.md new file mode 100644 index 0000000..af5153d --- /dev/null +++ b/gpl-2.0.md @@ -0,0 +1,361 @@ +### GNU GENERAL PUBLIC LICENSE + +Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +### Preamble + +The licenses for most software are designed to take away your freedom +to share and change it. By contrast, the GNU General Public License is +intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Lesser General Public License instead.) You can apply it to +your programs, too. + +When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + +To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if +you distribute copies of the software, or if you modify it. + +For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + +We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + +Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, +we want its recipients to know that what they have is not the +original, so that any problems introduced by others will not reflect +on the original authors' reputations. + +Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at +all. + +The precise terms and conditions for copying, distribution and +modification follow. + +### TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + +**0.** This License applies to any program or other work which +contains a notice placed by the copyright holder saying it may be +distributed under the terms of this General Public License. The +"Program", below, refers to any such program or work, and a "work +based on the Program" means either the Program or any derivative work +under copyright law: that is to say, a work containing the Program or +a portion of it, either verbatim or with modifications and/or +translated into another language. (Hereinafter, translation is +included without limitation in the term "modification".) Each licensee +is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the Program +(independent of having been made by running the Program). Whether that +is true depends on what the Program does. + +**1.** You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a +fee. + +**2.** You may modify your copy or copies of the Program or any +portion of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + +**a)** You must cause the modified files to carry prominent notices +stating that you changed the files and the date of any change. + + +**b)** You must cause any work that you distribute or publish, that in +whole or in part contains or is derived from the Program or any part +thereof, to be licensed as a whole at no charge to all third parties +under the terms of this License. + + +**c)** If the modified program normally reads commands interactively +when run, you must cause it, when started running for such interactive +use in the most ordinary way, to print or display an announcement +including an appropriate copyright notice and a notice that there is +no warranty (or else, saying that you provide a warranty) and that +users may redistribute the program under these conditions, and telling +the user how to view a copy of this License. (Exception: if the +Program itself is interactive but does not normally print such an +announcement, your work based on the Program is not required to print +an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + +**3.** You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + +**a)** Accompany it with the complete corresponding machine-readable +source code, which must be distributed under the terms of Sections 1 +and 2 above on a medium customarily used for software interchange; or, + + +**b)** Accompany it with a written offer, valid for at least three +years, to give any third party, for a charge no more than your cost of +physically performing source distribution, a complete machine-readable +copy of the corresponding source code, to be distributed under the +terms of Sections 1 and 2 above on a medium customarily used for +software interchange; or, + + +**c)** Accompany it with the information you received as to the offer +to distribute corresponding source code. (This alternative is allowed +only for noncommercial distribution and only if you received the +program in object code or executable form with such an offer, in +accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + +**4.** You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt otherwise +to copy, modify, sublicense or distribute the Program is void, and +will automatically terminate your rights under this License. However, +parties who have received copies, or rights, from you under this +License will not have their licenses terminated so long as such +parties remain in full compliance. + +**5.** You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + +**6.** Each time you redistribute the Program (or any work based on +the Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + +**7.** If, as a consequence of a court judgment or allegation of +patent infringement or for any other reason (not limited to patent +issues), conditions are imposed on you (whether by court order, +agreement or otherwise) that contradict the conditions of this +License, they do not excuse you from the conditions of this License. +If you cannot distribute so as to satisfy simultaneously your +obligations under this License and any other pertinent obligations, +then as a consequence you may not distribute the Program at all. For +example, if a patent license would not permit royalty-free +redistribution of the Program by all those who receive copies directly +or indirectly through you, then the only way you could satisfy both it +and this License would be to refrain entirely from distribution of the +Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + +**8.** If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + +**9.** The Free Software Foundation may publish revised and/or new +versions of the General Public License from time to time. Such new +versions will be similar in spirit to the present version, but may +differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Program does not specify a +version number of this License, you may choose any version ever +published by the Free Software Foundation. + +**10.** If you wish to incorporate parts of the Program into other +free programs whose distribution conditions are different, write to +the author to ask for permission. For software which is copyrighted by +the Free Software Foundation, write to the Free Software Foundation; +we sometimes make exceptions for this. Our decision will be guided by +the two goals of preserving the free status of all derivatives of our +free software and of promoting the sharing and reuse of software +generally. + +**NO WARRANTY** + +**11.** BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + +**12.** IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + +### END OF TERMS AND CONDITIONS + +### How to Apply These Terms to Your New Programs + +If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these +terms. + +To do so, attach the following notices to the program. It is safest to +attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + one line to give the program's name and an idea of what it does. + Copyright (C) yyyy name of author + + 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 2 + of the License, 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, write to the Free Software + Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. + +Also add information on how to contact you by electronic and paper +mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) year name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details + type `show w'. This is free software, and you are welcome + to redistribute it under certain conditions; type `show c' + for details. + +The hypothetical commands \`show w' and \`show c' should show the +appropriate parts of the General Public License. Of course, the +commands you use may be called something other than \`show w' and +\`show c'; they could even be mouse-clicks or menu items--whatever +suits your program. + +You should also get your employer (if you work as a programmer) or +your school, if any, to sign a "copyright disclaimer" for the program, +if necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright + interest in the program `Gnomovision' + (which makes passes at compilers) written + by James Hacker. + + signature of Ty Coon, 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, +you may consider it more useful to permit linking proprietary +applications with the library. If this is what you want to do, use the +[GNU Lesser General Public +License](http://www.gnu.org/licenses/lgpl.html) instead of this +License. \ No newline at end of file diff --git a/zconf.h b/zconf.h new file mode 100644 index 0000000..e3b0c96 --- /dev/null +++ b/zconf.h @@ -0,0 +1,332 @@ +/* zconf.h -- configuration of the zlib compression library + * Copyright (C) 1995-2005 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* @(#) $Id$ */ + +#ifndef ZCONF_H +#define ZCONF_H + +/* + * If you *really* need a unique prefix for all types and library functions, + * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it. + */ +#ifdef Z_PREFIX +# define deflateInit_ z_deflateInit_ +# define deflate z_deflate +# define deflateEnd z_deflateEnd +# define inflateInit_ z_inflateInit_ +# define inflate z_inflate +# define inflateEnd z_inflateEnd +# define deflateInit2_ z_deflateInit2_ +# define deflateSetDictionary z_deflateSetDictionary +# define deflateCopy z_deflateCopy +# define deflateReset z_deflateReset +# define deflateParams z_deflateParams +# define deflateBound z_deflateBound +# define deflatePrime z_deflatePrime +# define inflateInit2_ z_inflateInit2_ +# define inflateSetDictionary z_inflateSetDictionary +# define inflateSync z_inflateSync +# define inflateSyncPoint z_inflateSyncPoint +# define inflateCopy z_inflateCopy +# define inflateReset z_inflateReset +# define inflateBack z_inflateBack +# define inflateBackEnd z_inflateBackEnd +# define compress z_compress +# define compress2 z_compress2 +# define compressBound z_compressBound +# define uncompress z_uncompress +# define adler32 z_adler32 +# define crc32 z_crc32 +# define get_crc_table z_get_crc_table +# define zError z_zError + +# define alloc_func z_alloc_func +# define free_func z_free_func +# define in_func z_in_func +# define out_func z_out_func +# define Byte z_Byte +# define uInt z_uInt +# define uLong z_uLong +# define Bytef z_Bytef +# define charf z_charf +# define intf z_intf +# define uIntf z_uIntf +# define uLongf z_uLongf +# define voidpf z_voidpf +# define voidp z_voidp +#endif + +#if defined(__MSDOS__) && !defined(MSDOS) +# define MSDOS +#endif +#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2) +# define OS2 +#endif +#if defined(_WINDOWS) && !defined(WINDOWS) +# define WINDOWS +#endif +#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__) +# ifndef WIN32 +# define WIN32 +# endif +#endif +#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32) +# if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__) +# ifndef SYS16BIT +# define SYS16BIT +# endif +# endif +#endif + +/* + * Compile with -DMAXSEG_64K if the alloc function cannot allocate more + * than 64k bytes at a time (needed on systems with 16-bit int). + */ +#ifdef SYS16BIT +# define MAXSEG_64K +#endif +#ifdef MSDOS +# define UNALIGNED_OK +#endif + +#ifdef __STDC_VERSION__ +# ifndef STDC +# define STDC +# endif +# if __STDC_VERSION__ >= 199901L +# ifndef STDC99 +# define STDC99 +# endif +# endif +#endif +#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus)) +# define STDC +#endif +#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__)) +# define STDC +#endif +#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32)) +# define STDC +#endif +#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__)) +# define STDC +#endif + +#if defined(__OS400__) && !defined(STDC) /* iSeries (formerly AS/400). */ +# define STDC +#endif + +#ifndef STDC +# ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */ +# define const /* note: need a more gentle solution here */ +# endif +#endif + +/* Some Mac compilers merge all .h files incorrectly: */ +#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__) +# define NO_DUMMY_DECL +#endif + +/* Maximum value for memLevel in deflateInit2 */ +#ifndef MAX_MEM_LEVEL +# ifdef MAXSEG_64K +# define MAX_MEM_LEVEL 8 +# else +# define MAX_MEM_LEVEL 9 +# endif +#endif + +/* Maximum value for windowBits in deflateInit2 and inflateInit2. + * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files + * created by gzip. (Files created by minigzip can still be extracted by + * gzip.) + */ +#ifndef MAX_WBITS +# define MAX_WBITS 15 /* 32K LZ77 window */ +#endif + +/* The memory requirements for deflate are (in bytes): + (1 << (windowBits+2)) + (1 << (memLevel+9)) + that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values) + plus a few kilobytes for small objects. For example, if you want to reduce + the default memory requirements from 256K to 128K, compile with + make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7" + Of course this will generally degrade compression (there's no free lunch). + + The memory requirements for inflate are (in bytes) 1 << windowBits + that is, 32K for windowBits=15 (default value) plus a few kilobytes + for small objects. +*/ + + /* Type declarations */ + +#ifndef OF /* function prototypes */ +# ifdef STDC +# define OF(args) args +# else +# define OF(args) () +# endif +#endif + +/* The following definitions for FAR are needed only for MSDOS mixed + * model programming (small or medium model with some far allocations). + * This was tested only with MSC; for other MSDOS compilers you may have + * to define NO_MEMCPY in zutil.h. If you don't need the mixed model, + * just define FAR to be empty. + */ +#ifdef SYS16BIT +# if defined(M_I86SM) || defined(M_I86MM) + /* MSC small or medium model */ +# define SMALL_MEDIUM +# ifdef _MSC_VER +# define FAR _far +# else +# define FAR far +# endif +# endif +# if (defined(__SMALL__) || defined(__MEDIUM__)) + /* Turbo C small or medium model */ +# define SMALL_MEDIUM +# ifdef __BORLANDC__ +# define FAR _far +# else +# define FAR far +# endif +# endif +#endif + +#if defined(WINDOWS) || defined(WIN32) + /* If building or using zlib as a DLL, define ZLIB_DLL. + * This is not mandatory, but it offers a little performance increase. + */ +# ifdef ZLIB_DLL +# if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500)) +# ifdef ZLIB_INTERNAL +# define ZEXTERN extern __declspec(dllexport) +# else +# define ZEXTERN extern __declspec(dllimport) +# endif +# endif +# endif /* ZLIB_DLL */ + /* If building or using zlib with the WINAPI/WINAPIV calling convention, + * define ZLIB_WINAPI. + * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI. + */ +# ifdef ZLIB_WINAPI +# ifdef FAR +# undef FAR +# endif +# include + /* No need for _export, use ZLIB.DEF instead. */ + /* For complete Windows compatibility, use WINAPI, not __stdcall. */ +# define ZEXPORT WINAPI +# ifdef WIN32 +# define ZEXPORTVA WINAPIV +# else +# define ZEXPORTVA FAR CDECL +# endif +# endif +#endif + +#if defined (__BEOS__) +# ifdef ZLIB_DLL +# ifdef ZLIB_INTERNAL +# define ZEXPORT __declspec(dllexport) +# define ZEXPORTVA __declspec(dllexport) +# else +# define ZEXPORT __declspec(dllimport) +# define ZEXPORTVA __declspec(dllimport) +# endif +# endif +#endif + +#ifndef ZEXTERN +# define ZEXTERN extern +#endif +#ifndef ZEXPORT +# define ZEXPORT +#endif +#ifndef ZEXPORTVA +# define ZEXPORTVA +#endif + +#ifndef FAR +# define FAR +#endif + +#if !defined(__MACTYPES__) +typedef unsigned char Byte; /* 8 bits */ +#endif +typedef unsigned int uInt; /* 16 bits or more */ +typedef unsigned long uLong; /* 32 bits or more */ + +#ifdef SMALL_MEDIUM + /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */ +# define Bytef Byte FAR +#else + typedef Byte FAR Bytef; +#endif +typedef char FAR charf; +typedef int FAR intf; +typedef uInt FAR uIntf; +typedef uLong FAR uLongf; + +#ifdef STDC + typedef void const *voidpc; + typedef void FAR *voidpf; + typedef void *voidp; +#else + typedef Byte const *voidpc; + typedef Byte FAR *voidpf; + typedef Byte *voidp; +#endif + +#if 0 /* HAVE_UNISTD_H -- this line is updated by ./configure */ +# include /* for off_t */ +# include /* for SEEK_* and off_t */ +# ifdef VMS +# include /* for off_t */ +# endif +# define z_off_t off_t +#endif +#ifndef SEEK_SET +# define SEEK_SET 0 /* Seek from beginning of file. */ +# define SEEK_CUR 1 /* Seek from current position. */ +# define SEEK_END 2 /* Set file pointer to EOF plus "offset" */ +#endif +#ifndef z_off_t +# define z_off_t long +#endif + +#if defined(__OS400__) +# define NO_vsnprintf +#endif + +#if defined(__MVS__) +# define NO_vsnprintf +# ifdef FAR +# undef FAR +# endif +#endif + +/* MVS linker does not support external names larger than 8 bytes */ +#if defined(__MVS__) +# pragma map(deflateInit_,"DEIN") +# pragma map(deflateInit2_,"DEIN2") +# pragma map(deflateEnd,"DEEND") +# pragma map(deflateBound,"DEBND") +# pragma map(inflateInit_,"ININ") +# pragma map(inflateInit2_,"ININ2") +# pragma map(inflateEnd,"INEND") +# pragma map(inflateSync,"INSY") +# pragma map(inflateSetDictionary,"INSEDI") +# pragma map(compressBound,"CMBND") +# pragma map(inflate_table,"INTABL") +# pragma map(inflate_fast,"INFA") +# pragma map(inflate_copyright,"INCOPY") +#endif + +#endif /* ZCONF_H */ diff --git a/zlib.h b/zlib.h new file mode 100644 index 0000000..62d0e46 --- /dev/null +++ b/zlib.h @@ -0,0 +1,1357 @@ +/* zlib.h -- interface of the 'zlib' general purpose compression library + version 1.2.3, July 18th, 2005 + + Copyright (C) 1995-2005 Jean-loup Gailly and Mark Adler + + This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + + Jean-loup Gailly Mark Adler + jloup@gzip.org madler@alumni.caltech.edu + + + The data format used by the zlib library is described by RFCs (Request for + Comments) 1950 to 1952 in the files http://www.ietf.org/rfc/rfc1950.txt + (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format). +*/ + +#ifndef ZLIB_H +#define ZLIB_H + +#include "zconf.h" + +#ifdef __cplusplus +extern "C" { +#endif + +#define ZLIB_VERSION "1.2.3" +#define ZLIB_VERNUM 0x1230 + +/* + The 'zlib' compression library provides in-memory compression and + decompression functions, including integrity checks of the uncompressed + data. This version of the library supports only one compression method + (deflation) but other algorithms will be added later and will have the same + stream interface. + + Compression can be done in a single step if the buffers are large + enough (for example if an input file is mmap'ed), or can be done by + repeated calls of the compression function. In the latter case, the + application must provide more input and/or consume the output + (providing more output space) before each call. + + The compressed data format used by default by the in-memory functions is + the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped + around a deflate stream, which is itself documented in RFC 1951. + + The library also supports reading and writing files in gzip (.gz) format + with an interface similar to that of stdio using the functions that start + with "gz". The gzip format is different from the zlib format. gzip is a + gzip wrapper, documented in RFC 1952, wrapped around a deflate stream. + + This library can optionally read and write gzip streams in memory as well. + + The zlib format was designed to be compact and fast for use in memory + and on communications channels. The gzip format was designed for single- + file compression on file systems, has a larger header than zlib to maintain + directory information, and uses a different, slower check method than zlib. + + The library does not install any signal handler. The decoder checks + the consistency of the compressed data, so the library should never + crash even in case of corrupted input. +*/ + +typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size)); +typedef void (*free_func) OF((voidpf opaque, voidpf address)); + +struct internal_state; + +typedef struct z_stream_s { + Bytef *next_in; /* next input byte */ + uInt avail_in; /* number of bytes available at next_in */ + uLong total_in; /* total nb of input bytes read so far */ + + Bytef *next_out; /* next output byte should be put there */ + uInt avail_out; /* remaining free space at next_out */ + uLong total_out; /* total nb of bytes output so far */ + + char *msg; /* last error message, NULL if no error */ + struct internal_state FAR *state; /* not visible by applications */ + + alloc_func zalloc; /* used to allocate the internal state */ + free_func zfree; /* used to free the internal state */ + voidpf opaque; /* private data object passed to zalloc and zfree */ + + int data_type; /* best guess about the data type: binary or text */ + uLong adler; /* adler32 value of the uncompressed data */ + uLong reserved; /* reserved for future use */ +} z_stream; + +typedef z_stream FAR *z_streamp; + +/* + gzip header information passed to and from zlib routines. See RFC 1952 + for more details on the meanings of these fields. +*/ +typedef struct gz_header_s { + int text; /* true if compressed data believed to be text */ + uLong time; /* modification time */ + int xflags; /* extra flags (not used when writing a gzip file) */ + int os; /* operating system */ + Bytef *extra; /* pointer to extra field or Z_NULL if none */ + uInt extra_len; /* extra field length (valid if extra != Z_NULL) */ + uInt extra_max; /* space at extra (only when reading header) */ + Bytef *name; /* pointer to zero-terminated file name or Z_NULL */ + uInt name_max; /* space at name (only when reading header) */ + Bytef *comment; /* pointer to zero-terminated comment or Z_NULL */ + uInt comm_max; /* space at comment (only when reading header) */ + int hcrc; /* true if there was or will be a header crc */ + int done; /* true when done reading gzip header (not used + when writing a gzip file) */ +} gz_header; + +typedef gz_header FAR *gz_headerp; + +/* + The application must update next_in and avail_in when avail_in has + dropped to zero. It must update next_out and avail_out when avail_out + has dropped to zero. The application must initialize zalloc, zfree and + opaque before calling the init function. All other fields are set by the + compression library and must not be updated by the application. + + The opaque value provided by the application will be passed as the first + parameter for calls of zalloc and zfree. This can be useful for custom + memory management. The compression library attaches no meaning to the + opaque value. + + zalloc must return Z_NULL if there is not enough memory for the object. + If zlib is used in a multi-threaded application, zalloc and zfree must be + thread safe. + + On 16-bit systems, the functions zalloc and zfree must be able to allocate + exactly 65536 bytes, but will not be required to allocate more than this + if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS, + pointers returned by zalloc for objects of exactly 65536 bytes *must* + have their offset normalized to zero. The default allocation function + provided by this library ensures this (see zutil.c). To reduce memory + requirements and avoid any allocation of 64K objects, at the expense of + compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h). + + The fields total_in and total_out can be used for statistics or + progress reports. After compression, total_in holds the total size of + the uncompressed data and may be saved for use in the decompressor + (particularly if the decompressor wants to decompress everything in + a single step). +*/ + + /* constants */ + +#define Z_NO_FLUSH 0 +#define Z_PARTIAL_FLUSH 1 /* will be removed, use Z_SYNC_FLUSH instead */ +#define Z_SYNC_FLUSH 2 +#define Z_FULL_FLUSH 3 +#define Z_FINISH 4 +#define Z_BLOCK 5 +/* Allowed flush values; see deflate() and inflate() below for details */ + +#define Z_OK 0 +#define Z_STREAM_END 1 +#define Z_NEED_DICT 2 +#define Z_ERRNO (-1) +#define Z_STREAM_ERROR (-2) +#define Z_DATA_ERROR (-3) +#define Z_MEM_ERROR (-4) +#define Z_BUF_ERROR (-5) +#define Z_VERSION_ERROR (-6) +/* Return codes for the compression/decompression functions. Negative + * values are errors, positive values are used for special but normal events. + */ + +#define Z_NO_COMPRESSION 0 +#define Z_BEST_SPEED 1 +#define Z_BEST_COMPRESSION 9 +#define Z_DEFAULT_COMPRESSION (-1) +/* compression levels */ + +#define Z_FILTERED 1 +#define Z_HUFFMAN_ONLY 2 +#define Z_RLE 3 +#define Z_FIXED 4 +#define Z_DEFAULT_STRATEGY 0 +/* compression strategy; see deflateInit2() below for details */ + +#define Z_BINARY 0 +#define Z_TEXT 1 +#define Z_ASCII Z_TEXT /* for compatibility with 1.2.2 and earlier */ +#define Z_UNKNOWN 2 +/* Possible values of the data_type field (though see inflate()) */ + +#define Z_DEFLATED 8 +/* The deflate compression method (the only one supported in this version) */ + +#define Z_NULL 0 /* for initializing zalloc, zfree, opaque */ + +#define zlib_version zlibVersion() +/* for compatibility with versions < 1.0.2 */ + + /* basic functions */ + +ZEXTERN const char * ZEXPORT zlibVersion OF((void)); +/* The application can compare zlibVersion and ZLIB_VERSION for consistency. + If the first character differs, the library code actually used is + not compatible with the zlib.h header file used by the application. + This check is automatically made by deflateInit and inflateInit. + */ + +/* +ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level)); + + Initializes the internal stream state for compression. The fields + zalloc, zfree and opaque must be initialized before by the caller. + If zalloc and zfree are set to Z_NULL, deflateInit updates them to + use default allocation functions. + + The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9: + 1 gives best speed, 9 gives best compression, 0 gives no compression at + all (the input data is simply copied a block at a time). + Z_DEFAULT_COMPRESSION requests a default compromise between speed and + compression (currently equivalent to level 6). + + deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_STREAM_ERROR if level is not a valid compression level, + Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible + with the version assumed by the caller (ZLIB_VERSION). + msg is set to null if there is no error message. deflateInit does not + perform any compression: this will be done by deflate(). +*/ + + +ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush)); +/* + deflate compresses as much data as possible, and stops when the input + buffer becomes empty or the output buffer becomes full. It may introduce some + output latency (reading input without producing any output) except when + forced to flush. + + The detailed semantics are as follows. deflate performs one or both of the + following actions: + + - Compress more input starting at next_in and update next_in and avail_in + accordingly. If not all input can be processed (because there is not + enough room in the output buffer), next_in and avail_in are updated and + processing will resume at this point for the next call of deflate(). + + - Provide more output starting at next_out and update next_out and avail_out + accordingly. This action is forced if the parameter flush is non zero. + Forcing flush frequently degrades the compression ratio, so this parameter + should be set only when necessary (in interactive applications). + Some output may be provided even if flush is not set. + + Before the call of deflate(), the application should ensure that at least + one of the actions is possible, by providing more input and/or consuming + more output, and updating avail_in or avail_out accordingly; avail_out + should never be zero before the call. The application can consume the + compressed output when it wants, for example when the output buffer is full + (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK + and with zero avail_out, it must be called again after making room in the + output buffer because there might be more output pending. + + Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to + decide how much data to accumualte before producing output, in order to + maximize compression. + + If the parameter flush is set to Z_SYNC_FLUSH, all pending output is + flushed to the output buffer and the output is aligned on a byte boundary, so + that the decompressor can get all input data available so far. (In particular + avail_in is zero after the call if enough output space has been provided + before the call.) Flushing may degrade compression for some compression + algorithms and so it should be used only when necessary. + + If flush is set to Z_FULL_FLUSH, all output is flushed as with + Z_SYNC_FLUSH, and the compression state is reset so that decompression can + restart from this point if previous compressed data has been damaged or if + random access is desired. Using Z_FULL_FLUSH too often can seriously degrade + compression. + + If deflate returns with avail_out == 0, this function must be called again + with the same value of the flush parameter and more output space (updated + avail_out), until the flush is complete (deflate returns with non-zero + avail_out). In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that + avail_out is greater than six to avoid repeated flush markers due to + avail_out == 0 on return. + + If the parameter flush is set to Z_FINISH, pending input is processed, + pending output is flushed and deflate returns with Z_STREAM_END if there + was enough output space; if deflate returns with Z_OK, this function must be + called again with Z_FINISH and more output space (updated avail_out) but no + more input data, until it returns with Z_STREAM_END or an error. After + deflate has returned Z_STREAM_END, the only possible operations on the + stream are deflateReset or deflateEnd. + + Z_FINISH can be used immediately after deflateInit if all the compression + is to be done in a single step. In this case, avail_out must be at least + the value returned by deflateBound (see below). If deflate does not return + Z_STREAM_END, then it must be called again as described above. + + deflate() sets strm->adler to the adler32 checksum of all input read + so far (that is, total_in bytes). + + deflate() may update strm->data_type if it can make a good guess about + the input data type (Z_BINARY or Z_TEXT). In doubt, the data is considered + binary. This field is only for information purposes and does not affect + the compression algorithm in any manner. + + deflate() returns Z_OK if some progress has been made (more input + processed or more output produced), Z_STREAM_END if all input has been + consumed and all output has been produced (only when flush is set to + Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example + if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible + (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not + fatal, and deflate() can be called again with more input and more output + space to continue compressing. +*/ + + +ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm)); +/* + All dynamically allocated data structures for this stream are freed. + This function discards any unprocessed input and does not flush any + pending output. + + deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the + stream state was inconsistent, Z_DATA_ERROR if the stream was freed + prematurely (some input or output was discarded). In the error case, + msg may be set but then points to a static string (which must not be + deallocated). +*/ + + +/* +ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm)); + + Initializes the internal stream state for decompression. The fields + next_in, avail_in, zalloc, zfree and opaque must be initialized before by + the caller. If next_in is not Z_NULL and avail_in is large enough (the exact + value depends on the compression method), inflateInit determines the + compression method from the zlib header and allocates all data structures + accordingly; otherwise the allocation will be deferred to the first call of + inflate. If zalloc and zfree are set to Z_NULL, inflateInit updates them to + use default allocation functions. + + inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_VERSION_ERROR if the zlib library version is incompatible with the + version assumed by the caller. msg is set to null if there is no error + message. inflateInit does not perform any decompression apart from reading + the zlib header if present: this will be done by inflate(). (So next_in and + avail_in may be modified, but next_out and avail_out are unchanged.) +*/ + + +ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush)); +/* + inflate decompresses as much data as possible, and stops when the input + buffer becomes empty or the output buffer becomes full. It may introduce + some output latency (reading input without producing any output) except when + forced to flush. + + The detailed semantics are as follows. inflate performs one or both of the + following actions: + + - Decompress more input starting at next_in and update next_in and avail_in + accordingly. If not all input can be processed (because there is not + enough room in the output buffer), next_in is updated and processing + will resume at this point for the next call of inflate(). + + - Provide more output starting at next_out and update next_out and avail_out + accordingly. inflate() provides as much output as possible, until there + is no more input data or no more space in the output buffer (see below + about the flush parameter). + + Before the call of inflate(), the application should ensure that at least + one of the actions is possible, by providing more input and/or consuming + more output, and updating the next_* and avail_* values accordingly. + The application can consume the uncompressed output when it wants, for + example when the output buffer is full (avail_out == 0), or after each + call of inflate(). If inflate returns Z_OK and with zero avail_out, it + must be called again after making room in the output buffer because there + might be more output pending. + + The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH, + Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much + output as possible to the output buffer. Z_BLOCK requests that inflate() stop + if and when it gets to the next deflate block boundary. When decoding the + zlib or gzip format, this will cause inflate() to return immediately after + the header and before the first block. When doing a raw inflate, inflate() + will go ahead and process the first block, and will return when it gets to + the end of that block, or when it runs out of data. + + The Z_BLOCK option assists in appending to or combining deflate streams. + Also to assist in this, on return inflate() will set strm->data_type to the + number of unused bits in the last byte taken from strm->next_in, plus 64 + if inflate() is currently decoding the last block in the deflate stream, + plus 128 if inflate() returned immediately after decoding an end-of-block + code or decoding the complete header up to just before the first byte of the + deflate stream. The end-of-block will not be indicated until all of the + uncompressed data from that block has been written to strm->next_out. The + number of unused bits may in general be greater than seven, except when + bit 7 of data_type is set, in which case the number of unused bits will be + less than eight. + + inflate() should normally be called until it returns Z_STREAM_END or an + error. However if all decompression is to be performed in a single step + (a single call of inflate), the parameter flush should be set to + Z_FINISH. In this case all pending input is processed and all pending + output is flushed; avail_out must be large enough to hold all the + uncompressed data. (The size of the uncompressed data may have been saved + by the compressor for this purpose.) The next operation on this stream must + be inflateEnd to deallocate the decompression state. The use of Z_FINISH + is never required, but can be used to inform inflate that a faster approach + may be used for the single inflate() call. + + In this implementation, inflate() always flushes as much output as + possible to the output buffer, and always uses the faster approach on the + first call. So the only effect of the flush parameter in this implementation + is on the return value of inflate(), as noted below, or when it returns early + because Z_BLOCK is used. + + If a preset dictionary is needed after this call (see inflateSetDictionary + below), inflate sets strm->adler to the adler32 checksum of the dictionary + chosen by the compressor and returns Z_NEED_DICT; otherwise it sets + strm->adler to the adler32 checksum of all output produced so far (that is, + total_out bytes) and returns Z_OK, Z_STREAM_END or an error code as described + below. At the end of the stream, inflate() checks that its computed adler32 + checksum is equal to that saved by the compressor and returns Z_STREAM_END + only if the checksum is correct. + + inflate() will decompress and check either zlib-wrapped or gzip-wrapped + deflate data. The header type is detected automatically. Any information + contained in the gzip header is not retained, so applications that need that + information should instead use raw inflate, see inflateInit2() below, or + inflateBack() and perform their own processing of the gzip header and + trailer. + + inflate() returns Z_OK if some progress has been made (more input processed + or more output produced), Z_STREAM_END if the end of the compressed data has + been reached and all uncompressed output has been produced, Z_NEED_DICT if a + preset dictionary is needed at this point, Z_DATA_ERROR if the input data was + corrupted (input stream not conforming to the zlib format or incorrect check + value), Z_STREAM_ERROR if the stream structure was inconsistent (for example + if next_in or next_out was NULL), Z_MEM_ERROR if there was not enough memory, + Z_BUF_ERROR if no progress is possible or if there was not enough room in the + output buffer when Z_FINISH is used. Note that Z_BUF_ERROR is not fatal, and + inflate() can be called again with more input and more output space to + continue decompressing. If Z_DATA_ERROR is returned, the application may then + call inflateSync() to look for a good compression block if a partial recovery + of the data is desired. +*/ + + +ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm)); +/* + All dynamically allocated data structures for this stream are freed. + This function discards any unprocessed input and does not flush any + pending output. + + inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state + was inconsistent. In the error case, msg may be set but then points to a + static string (which must not be deallocated). +*/ + + /* Advanced functions */ + +/* + The following functions are needed only in some special applications. +*/ + +/* +ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm, + int level, + int method, + int windowBits, + int memLevel, + int strategy)); + + This is another version of deflateInit with more compression options. The + fields next_in, zalloc, zfree and opaque must be initialized before by + the caller. + + The method parameter is the compression method. It must be Z_DEFLATED in + this version of the library. + + The windowBits parameter is the base two logarithm of the window size + (the size of the history buffer). It should be in the range 8..15 for this + version of the library. Larger values of this parameter result in better + compression at the expense of memory usage. The default value is 15 if + deflateInit is used instead. + + windowBits can also be -8..-15 for raw deflate. In this case, -windowBits + determines the window size. deflate() will then generate raw deflate data + with no zlib header or trailer, and will not compute an adler32 check value. + + windowBits can also be greater than 15 for optional gzip encoding. Add + 16 to windowBits to write a simple gzip header and trailer around the + compressed data instead of a zlib wrapper. The gzip header will have no + file name, no extra data, no comment, no modification time (set to zero), + no header crc, and the operating system will be set to 255 (unknown). If a + gzip stream is being written, strm->adler is a crc32 instead of an adler32. + + The memLevel parameter specifies how much memory should be allocated + for the internal compression state. memLevel=1 uses minimum memory but + is slow and reduces compression ratio; memLevel=9 uses maximum memory + for optimal speed. The default value is 8. See zconf.h for total memory + usage as a function of windowBits and memLevel. + + The strategy parameter is used to tune the compression algorithm. Use the + value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a + filter (or predictor), Z_HUFFMAN_ONLY to force Huffman encoding only (no + string match), or Z_RLE to limit match distances to one (run-length + encoding). Filtered data consists mostly of small values with a somewhat + random distribution. In this case, the compression algorithm is tuned to + compress them better. The effect of Z_FILTERED is to force more Huffman + coding and less string matching; it is somewhat intermediate between + Z_DEFAULT and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as + Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy + parameter only affects the compression ratio but not the correctness of the + compressed output even if it is not set appropriately. Z_FIXED prevents the + use of dynamic Huffman codes, allowing for a simpler decoder for special + applications. + + deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid + method). msg is set to null if there is no error message. deflateInit2 does + not perform any compression: this will be done by deflate(). +*/ + +ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm, + const Bytef *dictionary, + uInt dictLength)); +/* + Initializes the compression dictionary from the given byte sequence + without producing any compressed output. This function must be called + immediately after deflateInit, deflateInit2 or deflateReset, before any + call of deflate. The compressor and decompressor must use exactly the same + dictionary (see inflateSetDictionary). + + The dictionary should consist of strings (byte sequences) that are likely + to be encountered later in the data to be compressed, with the most commonly + used strings preferably put towards the end of the dictionary. Using a + dictionary is most useful when the data to be compressed is short and can be + predicted with good accuracy; the data can then be compressed better than + with the default empty dictionary. + + Depending on the size of the compression data structures selected by + deflateInit or deflateInit2, a part of the dictionary may in effect be + discarded, for example if the dictionary is larger than the window size in + deflate or deflate2. Thus the strings most likely to be useful should be + put at the end of the dictionary, not at the front. In addition, the + current implementation of deflate will use at most the window size minus + 262 bytes of the provided dictionary. + + Upon return of this function, strm->adler is set to the adler32 value + of the dictionary; the decompressor may later use this value to determine + which dictionary has been used by the compressor. (The adler32 value + applies to the whole dictionary even if only a subset of the dictionary is + actually used by the compressor.) If a raw deflate was requested, then the + adler32 value is not computed and strm->adler is not set. + + deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a + parameter is invalid (such as NULL dictionary) or the stream state is + inconsistent (for example if deflate has already been called for this stream + or if the compression method is bsort). deflateSetDictionary does not + perform any compression: this will be done by deflate(). +*/ + +ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest, + z_streamp source)); +/* + Sets the destination stream as a complete copy of the source stream. + + This function can be useful when several compression strategies will be + tried, for example when there are several ways of pre-processing the input + data with a filter. The streams that will be discarded should then be freed + by calling deflateEnd. Note that deflateCopy duplicates the internal + compression state which can be quite large, so this strategy is slow and + can consume lots of memory. + + deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_STREAM_ERROR if the source stream state was inconsistent + (such as zalloc being NULL). msg is left unchanged in both source and + destination. +*/ + +ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm)); +/* + This function is equivalent to deflateEnd followed by deflateInit, + but does not free and reallocate all the internal compression state. + The stream will keep the same compression level and any other attributes + that may have been set by deflateInit2. + + deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent (such as zalloc or state being NULL). +*/ + +ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm, + int level, + int strategy)); +/* + Dynamically update the compression level and compression strategy. The + interpretation of level and strategy is as in deflateInit2. This can be + used to switch between compression and straight copy of the input data, or + to switch to a different kind of input data requiring a different + strategy. If the compression level is changed, the input available so far + is compressed with the old level (and may be flushed); the new level will + take effect only at the next call of deflate(). + + Before the call of deflateParams, the stream state must be set as for + a call of deflate(), since the currently available input may have to + be compressed and flushed. In particular, strm->avail_out must be non-zero. + + deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source + stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR + if strm->avail_out was zero. +*/ + +ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm, + int good_length, + int max_lazy, + int nice_length, + int max_chain)); +/* + Fine tune deflate's internal compression parameters. This should only be + used by someone who understands the algorithm used by zlib's deflate for + searching for the best matching string, and even then only by the most + fanatic optimizer trying to squeeze out the last compressed bit for their + specific input data. Read the deflate.c source code for the meaning of the + max_lazy, good_length, nice_length, and max_chain parameters. + + deflateTune() can be called after deflateInit() or deflateInit2(), and + returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream. + */ + +ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm, + uLong sourceLen)); +/* + deflateBound() returns an upper bound on the compressed size after + deflation of sourceLen bytes. It must be called after deflateInit() + or deflateInit2(). This would be used to allocate an output buffer + for deflation in a single pass, and so would be called before deflate(). +*/ + +ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm, + int bits, + int value)); +/* + deflatePrime() inserts bits in the deflate output stream. The intent + is that this function is used to start off the deflate output with the + bits leftover from a previous deflate stream when appending to it. As such, + this function can only be used for raw deflate, and must be used before the + first deflate() call after a deflateInit2() or deflateReset(). bits must be + less than or equal to 16, and that many of the least significant bits of + value will be inserted in the output. + + deflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent. +*/ + +ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm, + gz_headerp head)); +/* + deflateSetHeader() provides gzip header information for when a gzip + stream is requested by deflateInit2(). deflateSetHeader() may be called + after deflateInit2() or deflateReset() and before the first call of + deflate(). The text, time, os, extra field, name, and comment information + in the provided gz_header structure are written to the gzip header (xflag is + ignored -- the extra flags are set according to the compression level). The + caller must assure that, if not Z_NULL, name and comment are terminated with + a zero byte, and that if extra is not Z_NULL, that extra_len bytes are + available there. If hcrc is true, a gzip header crc is included. Note that + the current versions of the command-line version of gzip (up through version + 1.3.x) do not support header crc's, and will report that it is a "multi-part + gzip file" and give up. + + If deflateSetHeader is not used, the default gzip header has text false, + the time set to zero, and os set to 255, with no extra, name, or comment + fields. The gzip header is returned to the default state by deflateReset(). + + deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent. +*/ + +/* +ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm, + int windowBits)); + + This is another version of inflateInit with an extra parameter. The + fields next_in, avail_in, zalloc, zfree and opaque must be initialized + before by the caller. + + The windowBits parameter is the base two logarithm of the maximum window + size (the size of the history buffer). It should be in the range 8..15 for + this version of the library. The default value is 15 if inflateInit is used + instead. windowBits must be greater than or equal to the windowBits value + provided to deflateInit2() while compressing, or it must be equal to 15 if + deflateInit2() was not used. If a compressed stream with a larger window + size is given as input, inflate() will return with the error code + Z_DATA_ERROR instead of trying to allocate a larger window. + + windowBits can also be -8..-15 for raw inflate. In this case, -windowBits + determines the window size. inflate() will then process raw deflate data, + not looking for a zlib or gzip header, not generating a check value, and not + looking for any check values for comparison at the end of the stream. This + is for use with other formats that use the deflate compressed data format + such as zip. Those formats provide their own check values. If a custom + format is developed using the raw deflate format for compressed data, it is + recommended that a check value such as an adler32 or a crc32 be applied to + the uncompressed data as is done in the zlib, gzip, and zip formats. For + most applications, the zlib format should be used as is. Note that comments + above on the use in deflateInit2() applies to the magnitude of windowBits. + + windowBits can also be greater than 15 for optional gzip decoding. Add + 32 to windowBits to enable zlib and gzip decoding with automatic header + detection, or add 16 to decode only the gzip format (the zlib format will + return a Z_DATA_ERROR). If a gzip stream is being decoded, strm->adler is + a crc32 instead of an adler32. + + inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_STREAM_ERROR if a parameter is invalid (such as a null strm). msg + is set to null if there is no error message. inflateInit2 does not perform + any decompression apart from reading the zlib header if present: this will + be done by inflate(). (So next_in and avail_in may be modified, but next_out + and avail_out are unchanged.) +*/ + +ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm, + const Bytef *dictionary, + uInt dictLength)); +/* + Initializes the decompression dictionary from the given uncompressed byte + sequence. This function must be called immediately after a call of inflate, + if that call returned Z_NEED_DICT. The dictionary chosen by the compressor + can be determined from the adler32 value returned by that call of inflate. + The compressor and decompressor must use exactly the same dictionary (see + deflateSetDictionary). For raw inflate, this function can be called + immediately after inflateInit2() or inflateReset() and before any call of + inflate() to set the dictionary. The application must insure that the + dictionary that was used for compression is provided. + + inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a + parameter is invalid (such as NULL dictionary) or the stream state is + inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the + expected one (incorrect adler32 value). inflateSetDictionary does not + perform any decompression: this will be done by subsequent calls of + inflate(). +*/ + +ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm)); +/* + Skips invalid compressed data until a full flush point (see above the + description of deflate with Z_FULL_FLUSH) can be found, or until all + available input is skipped. No output is provided. + + inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR + if no more input was provided, Z_DATA_ERROR if no flush point has been found, + or Z_STREAM_ERROR if the stream structure was inconsistent. In the success + case, the application may save the current current value of total_in which + indicates where valid compressed data was found. In the error case, the + application may repeatedly call inflateSync, providing more input each time, + until success or end of the input data. +*/ + +ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest, + z_streamp source)); +/* + Sets the destination stream as a complete copy of the source stream. + + This function can be useful when randomly accessing a large stream. The + first pass through the stream can periodically record the inflate state, + allowing restarting inflate at those points when randomly accessing the + stream. + + inflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_STREAM_ERROR if the source stream state was inconsistent + (such as zalloc being NULL). msg is left unchanged in both source and + destination. +*/ + +ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm)); +/* + This function is equivalent to inflateEnd followed by inflateInit, + but does not free and reallocate all the internal decompression state. + The stream will keep attributes that may have been set by inflateInit2. + + inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent (such as zalloc or state being NULL). +*/ + +ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm, + int bits, + int value)); +/* + This function inserts bits in the inflate input stream. The intent is + that this function is used to start inflating at a bit position in the + middle of a byte. The provided bits will be used before any bytes are used + from next_in. This function should only be used with raw inflate, and + should be used before the first inflate() call after inflateInit2() or + inflateReset(). bits must be less than or equal to 16, and that many of the + least significant bits of value will be inserted in the input. + + inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent. +*/ + +ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm, + gz_headerp head)); +/* + inflateGetHeader() requests that gzip header information be stored in the + provided gz_header structure. inflateGetHeader() may be called after + inflateInit2() or inflateReset(), and before the first call of inflate(). + As inflate() processes the gzip stream, head->done is zero until the header + is completed, at which time head->done is set to one. If a zlib stream is + being decoded, then head->done is set to -1 to indicate that there will be + no gzip header information forthcoming. Note that Z_BLOCK can be used to + force inflate() to return immediately after header processing is complete + and before any actual data is decompressed. + + The text, time, xflags, and os fields are filled in with the gzip header + contents. hcrc is set to true if there is a header CRC. (The header CRC + was valid if done is set to one.) If extra is not Z_NULL, then extra_max + contains the maximum number of bytes to write to extra. Once done is true, + extra_len contains the actual extra field length, and extra contains the + extra field, or that field truncated if extra_max is less than extra_len. + If name is not Z_NULL, then up to name_max characters are written there, + terminated with a zero unless the length is greater than name_max. If + comment is not Z_NULL, then up to comm_max characters are written there, + terminated with a zero unless the length is greater than comm_max. When + any of extra, name, or comment are not Z_NULL and the respective field is + not present in the header, then that field is set to Z_NULL to signal its + absence. This allows the use of deflateSetHeader() with the returned + structure to duplicate the header. However if those fields are set to + allocated memory, then the application will need to save those pointers + elsewhere so that they can be eventually freed. + + If inflateGetHeader is not used, then the header information is simply + discarded. The header is always checked for validity, including the header + CRC if present. inflateReset() will reset the process to discard the header + information. The application would need to call inflateGetHeader() again to + retrieve the header from the next gzip stream. + + inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent. +*/ + +/* +ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits, + unsigned char FAR *window)); + + Initialize the internal stream state for decompression using inflateBack() + calls. The fields zalloc, zfree and opaque in strm must be initialized + before the call. If zalloc and zfree are Z_NULL, then the default library- + derived memory allocation routines are used. windowBits is the base two + logarithm of the window size, in the range 8..15. window is a caller + supplied buffer of that size. Except for special applications where it is + assured that deflate was used with small window sizes, windowBits must be 15 + and a 32K byte window must be supplied to be able to decompress general + deflate streams. + + See inflateBack() for the usage of these routines. + + inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of + the paramaters are invalid, Z_MEM_ERROR if the internal state could not + be allocated, or Z_VERSION_ERROR if the version of the library does not + match the version of the header file. +*/ + +typedef unsigned (*in_func) OF((void FAR *, unsigned char FAR * FAR *)); +typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned)); + +ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm, + in_func in, void FAR *in_desc, + out_func out, void FAR *out_desc)); +/* + inflateBack() does a raw inflate with a single call using a call-back + interface for input and output. This is more efficient than inflate() for + file i/o applications in that it avoids copying between the output and the + sliding window by simply making the window itself the output buffer. This + function trusts the application to not change the output buffer passed by + the output function, at least until inflateBack() returns. + + inflateBackInit() must be called first to allocate the internal state + and to initialize the state with the user-provided window buffer. + inflateBack() may then be used multiple times to inflate a complete, raw + deflate stream with each call. inflateBackEnd() is then called to free + the allocated state. + + A raw deflate stream is one with no zlib or gzip header or trailer. + This routine would normally be used in a utility that reads zip or gzip + files and writes out uncompressed files. The utility would decode the + header and process the trailer on its own, hence this routine expects + only the raw deflate stream to decompress. This is different from the + normal behavior of inflate(), which expects either a zlib or gzip header and + trailer around the deflate stream. + + inflateBack() uses two subroutines supplied by the caller that are then + called by inflateBack() for input and output. inflateBack() calls those + routines until it reads a complete deflate stream and writes out all of the + uncompressed data, or until it encounters an error. The function's + parameters and return types are defined above in the in_func and out_func + typedefs. inflateBack() will call in(in_desc, &buf) which should return the + number of bytes of provided input, and a pointer to that input in buf. If + there is no input available, in() must return zero--buf is ignored in that + case--and inflateBack() will return a buffer error. inflateBack() will call + out(out_desc, buf, len) to write the uncompressed data buf[0..len-1]. out() + should return zero on success, or non-zero on failure. If out() returns + non-zero, inflateBack() will return with an error. Neither in() nor out() + are permitted to change the contents of the window provided to + inflateBackInit(), which is also the buffer that out() uses to write from. + The length written by out() will be at most the window size. Any non-zero + amount of input may be provided by in(). + + For convenience, inflateBack() can be provided input on the first call by + setting strm->next_in and strm->avail_in. If that input is exhausted, then + in() will be called. Therefore strm->next_in must be initialized before + calling inflateBack(). If strm->next_in is Z_NULL, then in() will be called + immediately for input. If strm->next_in is not Z_NULL, then strm->avail_in + must also be initialized, and then if strm->avail_in is not zero, input will + initially be taken from strm->next_in[0 .. strm->avail_in - 1]. + + The in_desc and out_desc parameters of inflateBack() is passed as the + first parameter of in() and out() respectively when they are called. These + descriptors can be optionally used to pass any information that the caller- + supplied in() and out() functions need to do their job. + + On return, inflateBack() will set strm->next_in and strm->avail_in to + pass back any unused input that was provided by the last in() call. The + return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR + if in() or out() returned an error, Z_DATA_ERROR if there was a format + error in the deflate stream (in which case strm->msg is set to indicate the + nature of the error), or Z_STREAM_ERROR if the stream was not properly + initialized. In the case of Z_BUF_ERROR, an input or output error can be + distinguished using strm->next_in which will be Z_NULL only if in() returned + an error. If strm->next is not Z_NULL, then the Z_BUF_ERROR was due to + out() returning non-zero. (in() will always be called before out(), so + strm->next_in is assured to be defined if out() returns non-zero.) Note + that inflateBack() cannot return Z_OK. +*/ + +ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm)); +/* + All memory allocated by inflateBackInit() is freed. + + inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream + state was inconsistent. +*/ + +ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void)); +/* Return flags indicating compile-time options. + + Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other: + 1.0: size of uInt + 3.2: size of uLong + 5.4: size of voidpf (pointer) + 7.6: size of z_off_t + + Compiler, assembler, and debug options: + 8: DEBUG + 9: ASMV or ASMINF -- use ASM code + 10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention + 11: 0 (reserved) + + One-time table building (smaller code, but not thread-safe if true): + 12: BUILDFIXED -- build static block decoding tables when needed + 13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed + 14,15: 0 (reserved) + + Library content (indicates missing functionality): + 16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking + deflate code when not needed) + 17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect + and decode gzip streams (to avoid linking crc code) + 18-19: 0 (reserved) + + Operation variations (changes in library functionality): + 20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate + 21: FASTEST -- deflate algorithm with only one, lowest compression level + 22,23: 0 (reserved) + + The sprintf variant used by gzprintf (zero is best): + 24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format + 25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure! + 26: 0 = returns value, 1 = void -- 1 means inferred string length returned + + Remainder: + 27-31: 0 (reserved) + */ + + + /* utility functions */ + +/* + The following utility functions are implemented on top of the + basic stream-oriented functions. To simplify the interface, some + default options are assumed (compression level and memory usage, + standard memory allocation functions). The source code of these + utility functions can easily be modified if you need special options. +*/ + +ZEXTERN int ZEXPORT compress OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen)); +/* + Compresses the source buffer into the destination buffer. sourceLen is + the byte length of the source buffer. Upon entry, destLen is the total + size of the destination buffer, which must be at least the value returned + by compressBound(sourceLen). Upon exit, destLen is the actual size of the + compressed buffer. + This function can be used to compress a whole file at once if the + input file is mmap'ed. + compress returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_BUF_ERROR if there was not enough room in the output + buffer. +*/ + +ZEXTERN int ZEXPORT compress2 OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen, + int level)); +/* + Compresses the source buffer into the destination buffer. The level + parameter has the same meaning as in deflateInit. sourceLen is the byte + length of the source buffer. Upon entry, destLen is the total size of the + destination buffer, which must be at least the value returned by + compressBound(sourceLen). Upon exit, destLen is the actual size of the + compressed buffer. + + compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_BUF_ERROR if there was not enough room in the output buffer, + Z_STREAM_ERROR if the level parameter is invalid. +*/ + +ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen)); +/* + compressBound() returns an upper bound on the compressed size after + compress() or compress2() on sourceLen bytes. It would be used before + a compress() or compress2() call to allocate the destination buffer. +*/ + +ZEXTERN int ZEXPORT uncompress OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen)); +/* + Decompresses the source buffer into the destination buffer. sourceLen is + the byte length of the source buffer. Upon entry, destLen is the total + size of the destination buffer, which must be large enough to hold the + entire uncompressed data. (The size of the uncompressed data must have + been saved previously by the compressor and transmitted to the decompressor + by some mechanism outside the scope of this compression library.) + Upon exit, destLen is the actual size of the compressed buffer. + This function can be used to decompress a whole file at once if the + input file is mmap'ed. + + uncompress returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_BUF_ERROR if there was not enough room in the output + buffer, or Z_DATA_ERROR if the input data was corrupted or incomplete. +*/ + + +typedef voidp gzFile; + +ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode)); +/* + Opens a gzip (.gz) file for reading or writing. The mode parameter + is as in fopen ("rb" or "wb") but can also include a compression level + ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for + Huffman only compression as in "wb1h", or 'R' for run-length encoding + as in "wb1R". (See the description of deflateInit2 for more information + about the strategy parameter.) + + gzopen can be used to read a file which is not in gzip format; in this + case gzread will directly read from the file without decompression. + + gzopen returns NULL if the file could not be opened or if there was + insufficient memory to allocate the (de)compression state; errno + can be checked to distinguish the two cases (if errno is zero, the + zlib error is Z_MEM_ERROR). */ + +ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode)); +/* + gzdopen() associates a gzFile with the file descriptor fd. File + descriptors are obtained from calls like open, dup, creat, pipe or + fileno (in the file has been previously opened with fopen). + The mode parameter is as in gzopen. + The next call of gzclose on the returned gzFile will also close the + file descriptor fd, just like fclose(fdopen(fd), mode) closes the file + descriptor fd. If you want to keep fd open, use gzdopen(dup(fd), mode). + gzdopen returns NULL if there was insufficient memory to allocate + the (de)compression state. +*/ + +ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy)); +/* + Dynamically update the compression level or strategy. See the description + of deflateInit2 for the meaning of these parameters. + gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not + opened for writing. +*/ + +ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len)); +/* + Reads the given number of uncompressed bytes from the compressed file. + If the input file was not in gzip format, gzread copies the given number + of bytes into the buffer. + gzread returns the number of uncompressed bytes actually read (0 for + end of file, -1 for error). */ + +ZEXTERN int ZEXPORT gzwrite OF((gzFile file, + voidpc buf, unsigned len)); +/* + Writes the given number of uncompressed bytes into the compressed file. + gzwrite returns the number of uncompressed bytes actually written + (0 in case of error). +*/ + +ZEXTERN int ZEXPORTVA gzprintf OF((gzFile file, const char *format, ...)); +/* + Converts, formats, and writes the args to the compressed file under + control of the format string, as in fprintf. gzprintf returns the number of + uncompressed bytes actually written (0 in case of error). The number of + uncompressed bytes written is limited to 4095. The caller should assure that + this limit is not exceeded. If it is exceeded, then gzprintf() will return + return an error (0) with nothing written. In this case, there may also be a + buffer overflow with unpredictable consequences, which is possible only if + zlib was compiled with the insecure functions sprintf() or vsprintf() + because the secure snprintf() or vsnprintf() functions were not available. +*/ + +ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s)); +/* + Writes the given null-terminated string to the compressed file, excluding + the terminating null character. + gzputs returns the number of characters written, or -1 in case of error. +*/ + +ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len)); +/* + Reads bytes from the compressed file until len-1 characters are read, or + a newline character is read and transferred to buf, or an end-of-file + condition is encountered. The string is then terminated with a null + character. + gzgets returns buf, or Z_NULL in case of error. +*/ + +ZEXTERN int ZEXPORT gzputc OF((gzFile file, int c)); +/* + Writes c, converted to an unsigned char, into the compressed file. + gzputc returns the value that was written, or -1 in case of error. +*/ + +ZEXTERN int ZEXPORT gzgetc OF((gzFile file)); +/* + Reads one byte from the compressed file. gzgetc returns this byte + or -1 in case of end of file or error. +*/ + +ZEXTERN int ZEXPORT gzungetc OF((int c, gzFile file)); +/* + Push one character back onto the stream to be read again later. + Only one character of push-back is allowed. gzungetc() returns the + character pushed, or -1 on failure. gzungetc() will fail if a + character has been pushed but not read yet, or if c is -1. The pushed + character will be discarded if the stream is repositioned with gzseek() + or gzrewind(). +*/ + +ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush)); +/* + Flushes all pending output into the compressed file. The parameter + flush is as in the deflate() function. The return value is the zlib + error number (see function gzerror below). gzflush returns Z_OK if + the flush parameter is Z_FINISH and all output could be flushed. + gzflush should be called only when strictly necessary because it can + degrade compression. +*/ + +ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file, + z_off_t offset, int whence)); +/* + Sets the starting position for the next gzread or gzwrite on the + given compressed file. The offset represents a number of bytes in the + uncompressed data stream. The whence parameter is defined as in lseek(2); + the value SEEK_END is not supported. + If the file is opened for reading, this function is emulated but can be + extremely slow. If the file is opened for writing, only forward seeks are + supported; gzseek then compresses a sequence of zeroes up to the new + starting position. + + gzseek returns the resulting offset location as measured in bytes from + the beginning of the uncompressed stream, or -1 in case of error, in + particular if the file is opened for writing and the new starting position + would be before the current position. +*/ + +ZEXTERN int ZEXPORT gzrewind OF((gzFile file)); +/* + Rewinds the given file. This function is supported only for reading. + + gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET) +*/ + +ZEXTERN z_off_t ZEXPORT gztell OF((gzFile file)); +/* + Returns the starting position for the next gzread or gzwrite on the + given compressed file. This position represents a number of bytes in the + uncompressed data stream. + + gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR) +*/ + +ZEXTERN int ZEXPORT gzeof OF((gzFile file)); +/* + Returns 1 when EOF has previously been detected reading the given + input stream, otherwise zero. +*/ + +ZEXTERN int ZEXPORT gzdirect OF((gzFile file)); +/* + Returns 1 if file is being read directly without decompression, otherwise + zero. +*/ + +ZEXTERN int ZEXPORT gzclose OF((gzFile file)); +/* + Flushes all pending output if necessary, closes the compressed file + and deallocates all the (de)compression state. The return value is the zlib + error number (see function gzerror below). +*/ + +ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum)); +/* + Returns the error message for the last error which occurred on the + given compressed file. errnum is set to zlib error number. If an + error occurred in the file system and not in the compression library, + errnum is set to Z_ERRNO and the application may consult errno + to get the exact error code. +*/ + +ZEXTERN void ZEXPORT gzclearerr OF((gzFile file)); +/* + Clears the error and end-of-file flags for file. This is analogous to the + clearerr() function in stdio. This is useful for continuing to read a gzip + file that is being written concurrently. +*/ + + /* checksum functions */ + +/* + These functions are not related to compression but are exported + anyway because they might be useful in applications using the + compression library. +*/ + +ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len)); +/* + Update a running Adler-32 checksum with the bytes buf[0..len-1] and + return the updated checksum. If buf is NULL, this function returns + the required initial value for the checksum. + An Adler-32 checksum is almost as reliable as a CRC32 but can be computed + much faster. Usage example: + + uLong adler = adler32(0L, Z_NULL, 0); + + while (read_buffer(buffer, length) != EOF) { + adler = adler32(adler, buffer, length); + } + if (adler != original_adler) error(); +*/ + +ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2, + z_off_t len2)); +/* + Combine two Adler-32 checksums into one. For two sequences of bytes, seq1 + and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for + each, adler1 and adler2. adler32_combine() returns the Adler-32 checksum of + seq1 and seq2 concatenated, requiring only adler1, adler2, and len2. +*/ + +ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len)); +/* + Update a running CRC-32 with the bytes buf[0..len-1] and return the + updated CRC-32. If buf is NULL, this function returns the required initial + value for the for the crc. Pre- and post-conditioning (one's complement) is + performed within this function so it shouldn't be done by the application. + Usage example: + + uLong crc = crc32(0L, Z_NULL, 0); + + while (read_buffer(buffer, length) != EOF) { + crc = crc32(crc, buffer, length); + } + if (crc != original_crc) error(); +*/ + +ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2)); + +/* + Combine two CRC-32 check values into one. For two sequences of bytes, + seq1 and seq2 with lengths len1 and len2, CRC-32 check values were + calculated for each, crc1 and crc2. crc32_combine() returns the CRC-32 + check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and + len2. +*/ + + + /* various hacks, don't look :) */ + +/* deflateInit and inflateInit are macros to allow checking the zlib version + * and the compiler's view of z_stream: + */ +ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level, + const char *version, int stream_size)); +ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm, + const char *version, int stream_size)); +ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int level, int method, + int windowBits, int memLevel, + int strategy, const char *version, + int stream_size)); +ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int windowBits, + const char *version, int stream_size)); +ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits, + unsigned char FAR *window, + const char *version, + int stream_size)); +#define deflateInit(strm, level) \ + deflateInit_((strm), (level), ZLIB_VERSION, sizeof(z_stream)) +#define inflateInit(strm) \ + inflateInit_((strm), ZLIB_VERSION, sizeof(z_stream)) +#define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \ + deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\ + (strategy), ZLIB_VERSION, sizeof(z_stream)) +#define inflateInit2(strm, windowBits) \ + inflateInit2_((strm), (windowBits), ZLIB_VERSION, sizeof(z_stream)) +#define inflateBackInit(strm, windowBits, window) \ + inflateBackInit_((strm), (windowBits), (window), \ + ZLIB_VERSION, sizeof(z_stream)) + + +#if !defined(ZUTIL_H) && !defined(NO_DUMMY_DECL) + struct internal_state {int dummy;}; /* hack for buggy compilers */ +#endif + +ZEXTERN const char * ZEXPORT zError OF((int)); +ZEXTERN int ZEXPORT inflateSyncPoint OF((z_streamp z)); +ZEXTERN const uLongf * ZEXPORT get_crc_table OF((void)); + +#ifdef __cplusplus +} +#endif + +#endif /* ZLIB_H */