diff --git a/ExternalLibs/minihttp.cpp b/ExternalLibs/minihttp.cpp new file mode 100644 index 0000000..257049e --- /dev/null +++ b/ExternalLibs/minihttp.cpp @@ -0,0 +1,841 @@ +// minihttp.cpp - All functionality required for a minimal TCP/HTTP client packed in one file. +// Released under the WTFPL (See minihttp.h) + +#ifdef _MSC_VER +# ifndef _CRT_SECURE_NO_WARNINGS +# define _CRT_SECURE_NO_WARNINGS +# endif +# ifndef _CRT_SECURE_NO_DEPRECATE +# define _CRT_SECURE_NO_DEPRECATE +# endif +#endif + +#include +#include +#include +#include +#include +#include +#include + +#ifdef _WIN32 +# ifndef _WIN32_WINNT +# define _WIN32_WINNT 0x0501 +# endif +# include +# include +# define EWOULDBLOCK WSAEWOULDBLOCK +# define ETIMEDOUT WSAETIMEDOUT +# define ECONNRESET WSAECONNRESET +# define ENOTCONN WSAENOTCONN +#else +# include +# include +# include +# include +# include +# define SOCKET_ERROR (-1) +# define INVALID_SOCKET (SOCKET)(~0) + typedef intptr_t SOCKET; +#endif + +#include "minihttp.h" + +#define SOCKETVALID(s) ((s) != INVALID_SOCKET) + +#ifdef _MSC_VER +# define STRNICMP _strnicmp +#else +# define STRNICMP strncasecmp +#endif + +#ifdef _DEBUG +# define traceprint(...) {printf(__VA_ARGS__);} +#else +# define traceprint(...) {} +#endif + +namespace minihttp { + +#define DEFAULT_BUFSIZE 4096 + +inline int _GetError() +{ +#ifdef _WIN32 + return WSAGetLastError(); +#else + return errno; +#endif +} + +inline std::string _GetErrorStr(int e) +{ +#ifdef _WIN32 + LPTSTR s; + ::FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM, NULL, e, 0, (LPTSTR)&s, 0, NULL); + std::string ret = s; + ::LocalFree(s); + return ret; +#endif + return strerror(e); +} + +bool InitNetwork() +{ +#ifdef _WIN32 + WSADATA wsadata; + if(WSAStartup(MAKEWORD(2,2), &wsadata)) + { + traceprint("WSAStartup ERROR: %s", _GetErrorStr(_GetError()).c_str()); + return false; + } +#endif + return true; +} + +void StopNetwork() +{ +#ifdef _WIN32 + WSACleanup(); +#endif +} + +static bool _Resolve(const char *host, unsigned int port, struct sockaddr_in *addr) +{ + char port_str[15]; + sprintf(port_str, "%u", port); + + struct addrinfo hnt, *res = 0; + memset(&hnt, 0, sizeof(hnt)); + hnt.ai_family = AF_INET; + hnt.ai_socktype = SOCK_STREAM; + if (getaddrinfo(host, port_str, &hnt, &res)) + { + traceprint("RESOLVE ERROR: %s", _GetErrorStr(_GetError()).c_str()); + return false; + } + if (res) + { + if (res->ai_family != AF_INET) + { + traceprint("RESOLVE WTF: %s", _GetErrorStr(_GetError()).c_str()); + freeaddrinfo(res); + return false; + } + memcpy(addr, res->ai_addr, res->ai_addrlen); + freeaddrinfo(res); + return true; + } + return false; +} + +// FIXME: this does currently not handle links like: +// http://example.com/index.html#pos + +bool SplitURI(const std::string& uri, std::string& host, std::string& file, int& port) +{ + const char *p = uri.c_str(); + const char *sl = strstr(p, "//"); + unsigned int offs = 0; + if(sl) + { + offs = 7; + if(strncmp(p, "http://", offs)) + return false; + p = sl + 2; + } + sl = strchr(p, '/'); + if(!sl) + { + host = p; + file = "/"; + } + else + { + host = uri.substr(offs, sl - p); + file = sl; + } + + port = -1; + size_t colon = host.find(':'); + if(colon != std::string::npos) + { + port = atoi(host.c_str() + colon); + host.erase(port); + } + + return true; +} + +static bool _SetNonBlocking(SOCKET s, bool nonblock) +{ + if(!SOCKETVALID(s)) + return false; +#ifdef _WIN32 + ULONG tmp = !!nonblock; + if(::ioctlsocket(s, FIONBIO, &tmp) == SOCKET_ERROR) + return false; +#else + int tmp = ::fcntl(s, F_GETFL); + if(tmp < 0) + return false; + if(::fcntl(s, F_SETFL, nonblock ? (tmp|O_NONBLOCK) : (tmp|=~O_NONBLOCK)) < 0) + return false; +#endif + return true; +} + +TcpSocket::TcpSocket() +: _s(INVALID_SOCKET), _inbuf(NULL), _inbufSize(0), _recvSize(0), + _readptr(NULL), _lastport(0) +{ +} + +TcpSocket::~TcpSocket() +{ + close(); + if(_inbuf) + free(_inbuf); +} + +bool TcpSocket::isOpen(void) +{ + return SOCKETVALID(_s); +} + +void TcpSocket::close(void) +{ + if(!SOCKETVALID(_s)) + return; + + _OnCloseInternal(); + +#ifdef _WIN32 + ::closesocket((SOCKET)_s); +#else + ::close(_s); +#endif + _s = INVALID_SOCKET; +} + +void TcpSocket::_OnCloseInternal() +{ + _OnClose(); +} + +bool TcpSocket::SetNonBlocking(bool nonblock) +{ + _nonblocking = nonblock; + return _SetNonBlocking(_s, nonblock); +} + +void TcpSocket::SetBufsizeIn(unsigned int s) +{ + if(s < 512) + s = 512; + if(s != _inbufSize) + _inbuf = (char*)realloc(_inbuf, s); + _inbufSize = s; + _writeSize = s - 1; + _readptr = _writeptr = _inbuf; +} + +bool TcpSocket::open(const char *host /* = NULL */, unsigned int port /* = 0 */) +{ + if(isOpen()) + { + if( (host && host != _host) || (port && port != _lastport) ) + close(); + // ... and continue connecting to new host/port + else + return true; // still connected, to same host and port. + } + + sockaddr_in addr; + + if(host) + _host = host; + else + host = _host.c_str(); + + if(port) + _lastport = port; + else + { + port = _lastport; + if(!port) + return false; + } + + if(!_Resolve(host, port, &addr)) + { + traceprint("RESOLV ERROR: %s\n", _GetErrorStr(_GetError()).c_str()); + return false; + } + + SOCKET s = socket(AF_INET, SOCK_STREAM, 0); + + if(!SOCKETVALID(s)) + { + traceprint("SOCKET ERROR: %s\n", _GetErrorStr(_GetError()).c_str()); + return false; + } + + if (::connect(s, (sockaddr*)&addr, sizeof(sockaddr))) + { + traceprint("CONNECT ERROR: %s\n", _GetErrorStr(_GetError()).c_str()); + return false; + } + + _SetNonBlocking(s, _nonblocking); // restore setting if it was set in invalid state. static call because _s is intentionally still invalid here. + _s = s; // set the socket handle when we are really sure we are connected, and things are set up + + _OnOpen(); + + return true; +} + +bool TcpSocket::SendBytes(const char *str, unsigned int len) +{ + if(!SOCKETVALID(_s)) + return false; + //traceprint("SEND: '%s'\n", str); + return ::send(_s, str, len, 0) >= 0; + // TODO: check _GetError() +} + +void TcpSocket::_ShiftBuffer(void) +{ + size_t by = _readptr - _inbuf; + memmove(_inbuf, _readptr, by); + _readptr = _inbuf; + _writeptr = _inbuf + by; + _writeSize = _inbufSize - by - 1; +} + +void TcpSocket::_OnData() +{ + _OnRecv(_readptr, _recvSize); +} + +bool TcpSocket::update(void) +{ + if(!_OnUpdate()) + return false; + + if(!isOpen()) + return false; + + if(!_inbuf) + SetBufsizeIn(DEFAULT_BUFSIZE); + + int bytes = recv(_s, _writeptr, _writeSize, 0); // last char is used as string terminator + + if(bytes > 0) // we received something + { + _inbuf[bytes] = 0; + _recvSize = bytes; + + // reset pointers for next read + _writeSize = _inbufSize - 1; + _readptr = _writeptr = _inbuf; + + _OnData(); + return true; + } + else if(bytes == 0) // remote has closed the connection + { + _recvSize = 0; + close(); + return true; + } + else // whoops, error? + { + int e = _GetError(); + switch(e) + { + case ECONNRESET: + case ENOTCONN: + case ETIMEDOUT: +#ifdef _WIN32 + case WSAECONNABORTED: + case WSAESHUTDOWN: +#endif + close(); + break; + + case EWOULDBLOCK: +#if defined(EAGAIN) && (EWOULDBLOCK != EAGAIN) + case EAGAIN: // linux man pages say this can also happen instead of EWOULDBLOCK +#endif + return false; + } + traceprint("SOCKET UPDATE ERROR: (%d): %s\n", e, _GetErrorStr(e).c_str()); + } + return true; +} + + +// ========================== +// ===== HTTP SPECIFIC ====== +// ========================== +#ifdef MINIHTTP_SUPPORT_HTTP + +static void strToLower(std::string& s) +{ + std::transform(s.begin(), s.end(), s.begin(), tolower); +} + +HttpSocket::HttpSocket() +: TcpSocket(), +_keep_alive(0), _remaining(0), _chunkedTransfer(false), _mustClose(true), _inProgress(false), +_followRedir(true), _alwaysHandle(false), _status(0) +{ +} + +HttpSocket::~HttpSocket() +{ +} + +void HttpSocket::_OnOpen() +{ + TcpSocket::_OnOpen(); + _chunkedTransfer = false; +} + +void HttpSocket::_OnCloseInternal() +{ + if(!IsRedirecting() || _alwaysHandle) + _OnClose(); +} + +bool HttpSocket::_OnUpdate() +{ + if(!TcpSocket::_OnUpdate()) + return false; + + if(_inProgress && !_chunkedTransfer && !_remaining && _status) + _FinishRequest(); + + // initiate transfer if queue is not empty, but the socket somehow forgot to proceed + if(_requestQ.size() && !_remaining && !_chunkedTransfer && !_inProgress) + _DequeueMore(); + + return true; +} + +bool HttpSocket::Download(const std::string& url, void *user /* = NULL */) +{ + Request req; + req.user = user; + SplitURI(url, req.host, req.resource, req.port); + if(req.port < 0) + req.port = 80; + return SendGet(req, false); +} + +bool HttpSocket::SendGet(const std::string what, void *user /* = NULL */) +{ + Request req(what, _host, _lastport, user); + return SendGet(req, false); +} + +bool HttpSocket::QueueGet(const std::string what, void *user /* = NULL */) +{ + Request req(what, _host, _lastport, user); + return SendGet(req, true); +} + +bool HttpSocket::SendGet(Request& req, bool enqueue) +{ + if(req.host.empty() || !req.port) + return false; + + std::stringstream r; + const char *crlf = "\r\n"; + r << "GET " << req.resource << " HTTP/1.1" << crlf; + r << "Host: " << req.host << crlf; + if(_keep_alive) + { + r << "Connection: Keep-Alive" << crlf; + r << "Keep-Alive: " << _keep_alive << crlf; + } + else + r << "Connection: close" << crlf; + + if(_user_agent.length()) + r << "User-Agent: " << _user_agent << crlf; + + if(_accept_encoding.length()) + r << "Accept-Encoding: " << _accept_encoding << crlf; + + r << crlf; // header terminator + + req.header = r.str(); + + return _EnqueueOrSend(req, enqueue); +} + +bool HttpSocket::_EnqueueOrSend(const Request& req, bool forceQueue /* = false */) +{ + if(_inProgress || forceQueue) // do not send while receiving other data + { + traceprint("HTTP: Transfer pending; putting into queue. Now %u waiting.\n", (unsigned int)_requestQ.size()); // DEBUG + _requestQ.push(req); + return true; + } + // ok, we can send directly + if(!_OpenRequest(req)) + return false; + _inProgress = SendBytes(req.header.c_str(), req.header.length()); + return _inProgress; +} + +// called whenever a request is finished completely and the socket checks for more things to send +void HttpSocket::_DequeueMore(void) +{ + _FinishRequest(); // In case this was not done yet. + + // _inProgress is known to be false here + if(_requestQ.size()) // still have other requests queued? + if(_EnqueueOrSend(_requestQ.front(), false)) // could we send? + _requestQ.pop(); // if so, we are done with this request + + // otherwise, we are done for now. socket is kept alive for future sends. Nothing to do. +} + +bool HttpSocket::_OpenRequest(const Request& req) +{ + if(_inProgress) + { + traceprint("HttpSocket::_OpenRequest(): _inProgress == true, should not be called."); + return false; + } + if(!open(req.host.c_str(), req.port)) + return false; + _inProgress = true; + _curRequest = req; + _status = 0; + return true; +} + +void HttpSocket::_FinishRequest(void) +{ + if(_inProgress) + { + if(!IsRedirecting() || _alwaysHandle) + _OnRequestDone(); // notify about finished request + _inProgress = false; + _hdrs.clear(); + } +} + +void HttpSocket::_ProcessChunk(void) +{ + if(!_chunkedTransfer) + return; + + unsigned int chunksize = -1; + + while(true) + { + // less data required until chunk end than received, means the new chunk starts somewhere in the middle + // of the received data block. finish this chunk first. + if(_remaining) + { + if(_remaining <= _recvSize) // it contains the rest of the chunk, including CRLF + { + _OnRecvInternal(_readptr, _remaining - 2); // implicitly skip CRLF + _readptr += _remaining; + _recvSize -= _remaining; + _remaining = 0; // done with this one. + if(!chunksize) // and if chunksize was 0, we are done with all chunks. + break; + } + else // buffer did not yet arrive completely + { + _OnRecvInternal(_readptr, _recvSize); + _remaining -= _recvSize; + _recvSize = 0; // done with the whole buffer, but not with the chunk + return; // nothing else to do here + } + } + + // each chunk identifier ends with CRLF. + // if we don't find that, we hit the corner case that the chunk identifier was not fully received. + // in that case, adjust the buffer and wait for the rest of the data to be appended + char *term = strstr(_readptr, "\r\n"); + if(!term) + { + if(_recvSize) // if there is still something queued, move it to the left of the buffer and append on next read + _ShiftBuffer(); + return; + } + term += 2; // skip CRLF + + // when we are here, the (next) chunk header was completely received. + chunksize = strtoul(_readptr, NULL, 16); + _remaining = chunksize + 2; // the http protocol specifies that each chunk has a trailing CRLF + _recvSize -= (term - _readptr); + _readptr = term; + } + + if(!chunksize) // this was the last chunk, no further data expected unless requested + { + _chunkedTransfer = false; + _DequeueMore(); + if(_recvSize) + traceprint("_ProcessChunk: There are %u bytes left in the buffer, huh?\n", _recvSize); + if(_mustClose) + close(); + } +} + +void HttpSocket::_ParseHeaderFields(const char *s, size_t size) +{ + // Field: Entry data\r\n + + const char *maxs = s + size; + const char *colon, *entry; + const char *entryEnd = s; // last char of entry data + while(s < maxs) + { + while(isspace(*s)) + { + ++s; + if(s >= maxs) + return; + } + colon = strchr(s, ':'); + if(!colon) + return; + entryEnd = strchr(colon, '\n'); + if(!entryEnd) + return; + while(entryEnd[-1] == '\n' || entryEnd[-1] == '\r') + --entryEnd; + entry = colon + 1; + while(isspace(*entry)) + { + ++entry; + if(entry > entryEnd) // Field, but no entry? (Field: \n\r) + { + s = entryEnd; + continue; + } + } + std::string field(s, colon - s); + strToLower(field); + _hdrs[field] = std::string(entry, entryEnd - entry); + s = entryEnd; + } +} + +const char *HttpSocket::Hdr(const char *h) const +{ + std::map::const_iterator it = _hdrs.find(h); + return it == _hdrs.end() ? NULL : it->second.c_str(); +} + +static int safeatoi(const char *s) +{ + return s ? atoi(s) : 0; +} + +bool HttpSocket::_HandleStatus() +{ + _remaining = _contentLen = safeatoi(Hdr("content-length")); + + const char *encoding = Hdr("transfer-encoding"); + _chunkedTransfer = encoding && !STRNICMP(encoding, "chunked", 7); + + const char *conn = Hdr("connection"); // if its not keep-alive, server will close it, so we can too + _mustClose = !conn || STRNICMP(conn, "keep-alive", 10); + + if(!(_chunkedTransfer || _contentLen) && _status == 200) + traceprint("_ParseHeader: Not chunked transfer and content-length==0, this will go fail"); + + switch(_status) + { + case 200: + return true; + + case 301: + case 302: + case 303: + case 307: + case 308: + if(_followRedir) + if(const char *loc = Hdr("location")) + { + traceprint("Following HTTP redirect to: %s\n", loc); + Download(loc, _curRequest.user); + } + return false; + + default: + return false; + } +} + +bool HttpSocket::IsRedirecting() const +{ + switch(_status) + { + case 301: + case 302: + case 303: + case 307: + case 308: + return true; + } + return false; +} + + +void HttpSocket::_ParseHeader(void) +{ + _tmpHdr += _inbuf; + const char *hptr = _tmpHdr.c_str(); + + if((_recvSize >= 5 || _tmpHdr.size() >= 5) && memcmp("HTTP/", hptr, 5)) + { + traceprint("_ParseHeader: not HTTP stream\n"); + return; + } + + const char *hdrend = strstr(hptr, "\r\n\r\n"); + if(!hdrend) + { + traceprint("_ParseHeader: could not find end-of-header marker, or incomplete buf; delaying.\n"); + return; + } + + //traceprint(hptr); + + hptr = strchr(hptr + 5, ' '); // skip "HTTP/", already known + if(!hptr) + return; // WTF? + ++hptr; // number behind first space is the status code + _status = atoi(hptr); + + // Default values + _chunkedTransfer = false; + _contentLen = 0; // yet unknown + + hptr = strstr(hptr, "\r\n"); + _ParseHeaderFields(hptr + 2, hdrend - hptr); + + // FIXME: return value indicates success. + // Bail out on non-success, or at least make it so that _OnRecv() is not called. + // (Unless an override bool is given that even non-successful answers get their data delivered!) + _HandleStatus(); + + // get ready + _readptr = strstr(_inbuf, "\r\n\r\n") + 4; // skip double newline. must have been found in hptr earlier. + _recvSize -= (_readptr - _inbuf); // skip the header part + _tmpHdr.clear(); +} + +// generic http header parsing +void HttpSocket::_OnData(void) +{ + if(!(_chunkedTransfer || (_remaining && _recvSize))) + _ParseHeader(); + + if(_chunkedTransfer) + { + _ProcessChunk(); // first, try to finish one or more chunks + } + else if(_remaining && _recvSize) // something remaining? if so, we got a header earlier, but not all data + { + _remaining -= _recvSize; + _OnRecvInternal(_readptr, _recvSize); + + if(int(_remaining) < 0) + { + traceprint("_OnRecv: _remaining wrap-around, huh??\n"); + _remaining = 0; + } + if(!_remaining) // received last block? + { + if(_mustClose) + close(); + else + _DequeueMore(); + } + + // nothing else to do here. + } + + // otherwise, the server sent just the header, with the data following in the next packet +} + +void HttpSocket::_OnClose() +{ + if(!ExpectMoreData()) + _FinishRequest(); +} + +void HttpSocket::_OnRecvInternal(char *buf, unsigned int size) +{ + if(_status == 200 || _alwaysHandle) + _OnRecv(buf, size); +} + +#endif + +// =========================== +// ===== SOCKET SET ========== +// =========================== +#ifdef MINIHTTP_SUPPORT_SOCKET_SET + +SocketSet::~SocketSet() +{ + deleteAll(); +} + +void SocketSet::deleteAll(void) +{ + for(Store::iterator it = _store.begin(); it != _store.end(); ++it) + delete it->first; + _store.clear(); +} + +bool SocketSet::update(void) +{ + bool interesting = false; + Store::iterator it = _store.begin(); + for( ; it != _store.end(); ) + { + TcpSocket *sock = it->first; + SocketSetData& sdata = it->second; + interesting = sock->update() || interesting; + if(sdata.deleteWhenDone && !sock->isOpen() && !sock->HasPendingTask()) + { + delete sock; + _store.erase(it++); + } + else + ++it; + } + return interesting; +} + +void SocketSet::remove(TcpSocket *s) +{ + _store.erase(s); +} + +void SocketSet::add(TcpSocket *s, bool deleteWhenDone /* = true */) +{ + s->SetNonBlocking(true); + SocketSetData sdata; + sdata.deleteWhenDone = deleteWhenDone; + _store[s] = sdata; +} + +#endif + + +} // namespace minihttp diff --git a/ExternalLibs/minihttp.h b/ExternalLibs/minihttp.h new file mode 100644 index 0000000..443ef4b --- /dev/null +++ b/ExternalLibs/minihttp.h @@ -0,0 +1,230 @@ +/* This program is free software. It comes without any warranty, to +* the extent permitted by applicable law. You can redistribute it +* and/or modify it under the terms of the Do What The Fuck You Want +* To Public License, Version 2, as published by Sam Hocevar. +* See http://sam.zoy.org/wtfpl/COPYING for more details. */ + +#ifndef MINIHTTPSOCKET_H +#define MINIHTTPSOCKET_H + + +// ---- Compile config ----- +#define MINIHTTP_SUPPORT_HTTP +#define MINIHTTP_SUPPORT_SOCKET_SET +// ------------------------- + + + +#include + +namespace minihttp +{ + +bool InitNetwork(); +void StopNetwork(); + +bool SplitURI(const std::string& uri, std::string& host, std::string& file, int& port); + + +class TcpSocket +{ +public: + TcpSocket(); + virtual ~TcpSocket(); + + virtual bool HasPendingTask() const { return false; } + + bool open(const char *addr = NULL, unsigned int port = 0); + void close(); + bool update(); // returns true if something interesting happened (incoming data, closed connection, etc) + + bool isOpen(void); + + void SetBufsizeIn(unsigned int s); + bool SetNonBlocking(bool nonblock); + unsigned int GetBufSize() { return _inbufSize; } + const char *GetHost(void) { return _host.c_str(); } + bool SendBytes(const char *str, unsigned int len); + +protected: + virtual void _OnCloseInternal(); + virtual void _OnData(); // data received callback. Internal, should only be overloaded to call _OnRecv() + + virtual void _OnRecv(char *buf, unsigned int size) = 0; + virtual void _OnClose() {}; // close callback + virtual void _OnOpen() {} // called when opened + virtual bool _OnUpdate() { return true; } // called before reading from the socket + + void _ShiftBuffer(); + + char *_inbuf; + char *_readptr; // part of inbuf, optionally skipped header + char *_writeptr; // passed to recv(). usually equal to _inbuf, but may point inside the buffer in case of a partial transfer. + + unsigned int _inbufSize; // size of internal buffer + unsigned int _writeSize; // how many bytes can be written to _writeptr; + unsigned int _recvSize; // incoming size, max _inbufSize - 1 + + unsigned int _lastport; // port used in last open() call + + bool _nonblocking; // Default true. If false, the current thread is blocked while waiting for input. + + intptr_t _s; // socket handle. really an int, but to be sure its 64 bit compatible as it seems required on windows, we use this. + + std::string _host; +}; + +} // end namespace minihttp + + +// ------------------------------------------------------------------------ + +#ifdef MINIHTTP_SUPPORT_HTTP + +#include +#include + +namespace minihttp +{ + +enum HttpCode +{ + HTTP_OK = 200, + HTTP_NOTFOUND = 404, +}; + +struct Request +{ + Request() : port(80), user(NULL) {} + Request(const std::string& h, const std::string& res, int p = 80, void *u = NULL) + : host(h), resource(res), port(80), user(u) {} + + std::string host; + std::string header; // set by socket + std::string resource; + int port; + void *user; +}; + +class HttpSocket : public TcpSocket +{ +public: + + HttpSocket(); + virtual ~HttpSocket(); + + virtual bool HasPendingTask() const + { + return ExpectMoreData() || _requestQ.size(); + } + + void SetKeepAlive(unsigned int secs) { _keep_alive = secs; } + void SetUserAgent(const std::string &s) { _user_agent = s; } + void SetAcceptEncoding(const std::string& s) { _accept_encoding = s; } + void SetFollowRedirect(bool follow) { _followRedir = follow; } + void SetAlwaysHandle(bool h) { _alwaysHandle = h; } + + bool Download(const std::string& url, void *user = NULL); + bool SendGet(Request& what, bool enqueue); + bool SendGet(const std::string what, void *user = NULL); + bool QueueGet(const std::string what, void *user = NULL); + + unsigned int GetRemaining() const { return _remaining; } + + unsigned int GetStatusCode() const { return _status; } + unsigned int GetContentLen() const { return _contentLen; } + bool ChunkedTransfer() const { return _chunkedTransfer; } + bool ExpectMoreData() const { return _remaining || _chunkedTransfer; } + + const Request &GetCurrentRequest() const { return _curRequest; } + const char *Hdr(const char *h) const; + + bool IsRedirecting() const; + +protected: + virtual void _OnCloseInternal(); + virtual void _OnClose(); + virtual void _OnData(); // data received callback. Internal, should only be overloaded to call _OnRecv() + virtual void _OnRecv(char *buf, unsigned int size) = 0; + virtual void _OnOpen(); // called when opene + virtual bool _OnUpdate(); // called before reading from the socket + + // new ones: + virtual void _OnRequestDone() {} + + void _ProcessChunk(); + bool _EnqueueOrSend(const Request& req, bool forceQueue = false); + void _DequeueMore(); + bool _OpenRequest(const Request& req); + void _ParseHeader(); + void _ParseHeaderFields(const char *s, size_t size); + bool _HandleStatus(); // Returns whether the processed request was successful, or not + void _FinishRequest(); + void _OnRecvInternal(char *buf, unsigned int size); + + std::string _user_agent; + std::string _accept_encoding; // Default empty. + std::string _tmpHdr; // used to save the http header if the incoming buffer was not large enough + + unsigned int _keep_alive; // http related + unsigned int _remaining; // http "Content-Length: X" - already recvd. 0 if ready for next packet. + // For chunked transfer encoding, this holds the remaining size of the current chunk + unsigned int _contentLen; // as reported by server + unsigned int _status; // http status code, HTTP_OK if things are good + + std::queue _requestQ; + std::map _hdrs; // Maps HTTP header fields to their values + + Request _curRequest; + + bool _inProgress; + bool _chunkedTransfer; + bool _mustClose; // keep-alive specified, or not + bool _followRedir; // Default true. Follow 3xx redirects if this is set. + bool _alwaysHandle; // Also deliver to _OnRecv() if a non-success code was received. +}; + +} // end namespace minihttp + +#endif + +// ------------------------------------------------------------------------ + +#ifdef MINIHTTP_SUPPORT_SOCKET_SET + +#include + +namespace minihttp +{ + +class SocketSet +{ +public: + virtual ~SocketSet(); + void deleteAll(); + bool update(); + void add(TcpSocket *s, bool deleteWhenDone = true); + bool has(TcpSocket *s); + void remove(TcpSocket *s); + inline size_t size() { return _store.size(); } + +//protected: + + struct SocketSetData + { + bool deleteWhenDone; + // To be extended + }; + + typedef std::map Store; + + Store _store; +}; + +#endif + + +} // end namespace minihttp + + +#endif diff --git a/ExternalLibs/ttvfs/CMakeLists.txt b/ExternalLibs/ttvfs/CMakeLists.txt new file mode 100644 index 0000000..4bb5797 --- /dev/null +++ b/ExternalLibs/ttvfs/CMakeLists.txt @@ -0,0 +1,29 @@ + +set(ttvfs_SRC + VFS.h + VFSArchiveLoader.h + VFSAtomic.cpp + VFSAtomic.h + VFSBase.cpp + VFSBase.h + VFSDefines.h + VFSDir.cpp + VFSDir.h + VFSFile.cpp + VFSFile.h + VFSFileFuncs.cpp + VFSFileFuncs.h + VFSHashmap.h + VFSHelper.cpp + VFSHelper.h + VFSInternal.h + VFSLoader.cpp + VFSLoader.h + VFSSelfRefCounter.h + VFSSystemPaths.cpp + VFSSystemPaths.h + VFSTools.cpp + VFSTools.h +) + +add_library(ttvfs ${ttvfs_SRC}) diff --git a/ExternalLibs/ttvfs/VFS.h b/ExternalLibs/ttvfs/VFS.h new file mode 100644 index 0000000..c9c8ff2 --- /dev/null +++ b/ExternalLibs/ttvfs/VFS.h @@ -0,0 +1,80 @@ +/* ttvfs -- tiny tree virtual file system + +// VFS.h - all the necessary includes to get a basic VFS working +// Only include externally, not inside the library. + +See VFSDefines.h for compile configration. + + +---------[ License ]---------- +MIT License + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. +*/ + + +#ifndef TTVFS_VFS_H +#define TTVFS_VFS_H + +#include "VFSDefines.h" + +VFS_NAMESPACE_START +bool _checkCompatInternal(bool large, bool nocase, bool hashmap, unsigned int vfspos_size); + +/** It is recommended to call this function early in your code + and ensure it returns true - if it does not, compiler settings + are inconsistent, which may cause otherwise hard to detect problems. */ +inline static bool checkCompat(void) +{ +#ifdef VFS_LARGEFILE_SUPPORT + bool largefile = true; +#else + bool largefile = false; +#endif + +#ifdef VFS_IGNORE_CASE + bool nocase = true; +#else + bool nocase = false; +#endif + +#ifdef VFS_USE_HASHMAP + bool hashmap = true; +#else + bool hashmap = false; +#endif + return _checkCompatInternal(largefile, nocase, hashmap, sizeof(vfspos)); +} +VFS_NAMESPACE_END + + +#include +#include +#include "VFSHelper.h" +#include "VFSFile.h" +#include "VFSDir.h" +#include "VFSSystemPaths.h" + + +// Check to enforce correct including. +#ifdef VFS_INTERNAL_H +#error Oops, VFS_INTERNAL_H is defined, someone messed up and included VFSInternal.h wrongly. +#endif + +#endif diff --git a/ExternalLibs/ttvfs/VFSArchiveLoader.h b/ExternalLibs/ttvfs/VFSArchiveLoader.h new file mode 100644 index 0000000..948e19f --- /dev/null +++ b/ExternalLibs/ttvfs/VFSArchiveLoader.h @@ -0,0 +1,68 @@ +#ifndef VFS_ARCHIVE_LOADER_H +#define VFS_ARCHIVE_LOADER_H + +#include "VFSDefines.h" + +VFS_NAMESPACE_START + +class VFSDir; +class VFSFile; +class VFSLoader; + +// Generic Archive loader interface that is supposed to return a valid VFSDir pointer when it +// was able to load 'arch' as an archive, and NULL if there was an error or the loader is +// unable to load that file type. +// 'asSubdir' - if this is true, the archive will be accessible as a folder (as in "test.zip/file.dat"), +// otherwise the files are mounted in place of the archive. +// 'ldr' - can be set to an external file loader in case the file/folder tree can not be fully generated +// at load time. +// 'opaque' - a POD struct which *must* have a `void (*)(void*, void*, const char*)` +// function pointer as first member (at offset 0). +// The struct pointer is then passed to that function, along with a pointer to an internal object, +// whatever this is. The derived loader knows what this object is - something that this callback +// will be interested in modifying, anyways. The rest of the struct can carry the data required to +// modify this object. +// The const char parameter is a string unique for each loader (to prevent accessing the pointer +// in a wrong way by the wrong loader). Example below. +class VFSArchiveLoader +{ +public: + virtual ~VFSArchiveLoader() {} + + virtual VFSDir *Load(VFSFile *arch, VFSLoader **ldr, void *opaque = NULL) = 0; +}; + +/* A possible struct for 'opaque' would be: + +struct ExampleLoadParams +{ + void (*callback)(void *, void *, const char *); + const char *key; + unsigned int keylen; +}; + +And then the call would look like: +(Assuming PakFile is an archive file class that represents an archive) + +void pakSetup(void *data, void *arch, const char *id) +{ + if(strcmp(id, "pak")) // Be sure we're in the right loader. + return; + ExampleLoadParams *pm = (ExampleLoadParams*)p; + PakArchive *pak = (PakArchive*)arch; + pak->SetKey(pm->key, pm->keylen); +} + +ExampleLoadParams p; +p.callback = &pakSetup; +p.key = "123456"; +p.keylen = 6; +vfs.AddArchive("data.pak", false, "", &p); + +Where p in turn will be passed to the PAK loader. + +*/ + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs/VFSAtomic.cpp b/ExternalLibs/ttvfs/VFSAtomic.cpp new file mode 100644 index 0000000..8cf50ff --- /dev/null +++ b/ExternalLibs/ttvfs/VFSAtomic.cpp @@ -0,0 +1,103 @@ +// VFSAtomic.cpp - atomic operations and thread locking +// For conditions of distribution and use, see copyright notice in VFS.h + +/** --- Atomic operations and thread safety --- + * You may want to add your own implementation if thread safety is needed. + * If not, just leave everything like it is. + + * If you are on windows, Interlocked[In/De]crement is faster than + explicit mutex locking for integer operations. + + * TODO: The actual locking that is done in the tree when VFS_THREADSAFE is defined + is rather crude for the time beeing; a somewhat more efficient ReadWriteLock + implementation would be nice to have, someday. + + * If you can, leave VFS_THREADSAFE undefined and do the locking externally, + it will probably have much better performance than if each and every operation + does a lock and unlock call. + (For a rather I/O based library this should not really make a difference, anyway. + But don't say you haven't been warned :) ) +*/ + +#include "VFSInternal.h" +#include "VFSAtomic.h" + +// for Interlocked[In/De]crement, if required +#if defined(_WIN32) && defined(VFS_THREADSAFE) +# define WIN32_LEAN_AND_MEAN +# include +#endif + +VFS_NAMESPACE_START + +#ifdef VFS_THREADSAFE +static Mutex mtx; +#endif + +int Atomic_Incr(volatile int &i) +{ +#ifdef VFS_THREADSAFE +# ifdef _WIN32 + volatile LONG* dp = (volatile LONG*) &i; + return InterlockedIncrement( dp ); +# else + Guard g(mtx); +# endif +#endif + return ++i; +} + +int Atomic_Decr(volatile int &i) +{ +#ifdef VFS_THREADSAFE +# ifdef _WIN32 + volatile LONG* dp = (volatile LONG*) &i; + return InterlockedDecrement( dp ); +# else + Guard g(mtx); +# endif +#endif + return --i; +} + +/* Implement your Mutex class here. + Important: The mutex must be re-entrant/recursive, + means it must be possible to lock it from the same thread multiple times. +*/ +Mutex::Mutex() +{ + // implement your own if needed. Remove the trap below when you are done. + // This is to prevent people from defining VFS_THREADSAFE and expecting everything to work just like that :) +#ifdef VFS_THREADSAFE +#error VFSAtomic: Hey, you forgot to implement the mutex class, cant guarantee thread safety! Either undef VFS_THREADSAFE or read the docs and get your hands dirty. +#endif +} + +Mutex::~Mutex() +{ + // implement your own if needed +} + +void Mutex::Lock(void) +{ + // implement your own if needed +} + +void Mutex::Unlock(void) +{ + // implement your own if needed +} + +Guard::Guard(Mutex& m) +: _m(m) +{ + _m.Lock(); +} + +Guard::~Guard() +{ + _m.Unlock(); +} + + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSAtomic.h b/ExternalLibs/ttvfs/VFSAtomic.h new file mode 100644 index 0000000..76665f0 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSAtomic.h @@ -0,0 +1,39 @@ +// VFSAtomic.h - atomic operations and thread locking +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFS_ATOMIC_H +#define VFS_ATOMIC_H + +#include "VFSDefines.h" + +VFS_NAMESPACE_START + +int Atomic_Incr(volatile int &i); +int Atomic_Decr(volatile int &i); + +// generic Mutex class, needs to be reentrant/recursive. +class Mutex +{ +public: + Mutex(); + ~Mutex(); + void Lock(); + void Unlock(); + +protected: + // add own stuff if needed +}; + +class Guard +{ +public: + Guard(Mutex& m); + ~Guard(); + +protected: + Mutex& _m; +}; + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs/VFSBase.cpp b/ExternalLibs/ttvfs/VFSBase.cpp new file mode 100644 index 0000000..0963b86 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSBase.cpp @@ -0,0 +1,32 @@ +// VFSBase.cpp - common code for VFSDir and VFSFile +// For conditions of distribution and use, see copyright notice in VFS.h + +#include "VFSBase.h" +#include "VFSInternal.h" +#include "VFSTools.h" + +VFS_NAMESPACE_START + +VFSBase::VFSBase() +: ref(this) +#ifdef VFS_USE_HASHMAP + , _hash(0) +#endif + , _origin(NULL) +{ +} + +// call this only with a lock held! +void VFSBase::_setName(const char *n) +{ + if(!n) + return; + _fullname = FixPath(n); + _name = PathToFileName(_fullname.c_str()); +#ifdef VFS_USE_HASHMAP + _hash = STRINGHASH(_name); +#endif +} + + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSBase.h b/ExternalLibs/ttvfs/VFSBase.h new file mode 100644 index 0000000..b5a5a3c --- /dev/null +++ b/ExternalLibs/ttvfs/VFSBase.h @@ -0,0 +1,83 @@ +// VFSBase.h - bass class for VFSDir and VFSFile +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFS_BASE_H +#define VFS_BASE_H + +#include +#include "VFSDefines.h" +#include "VFSSelfRefCounter.h" + +VFS_NAMESPACE_START + +// Used internally. No special properties, just holds some common code. +class VFSBase +{ +public: + virtual ~VFSBase() {} + + /** Returns the plain file name. Never NULL. */ + inline const char *name() const { VFS_GUARD_OPT(this); return _name; } + + /** Returns the file name with full path. Never NULL. */ + inline const char *fullname() const { VFS_GUARD_OPT(this); return _fullname.c_str(); } + + /** To avoid strlen() */ + inline size_t fullnameLen() const { VFS_GUARD_OPT(this); return _fullname.length(); } + // We know that mem addr of _name > _fullname: + // _fullname: "abc/def/ghi/hjk.txt" (length = 19) + // _name: "hjk.txt" <-- want that length + // ptr diff: 12 + // so in total: 19 - 12 == 7 + inline size_t nameLen() const { VFS_GUARD_OPT(this); return _fullname.length() - (_name - _fullname.c_str()); } + + /** Basic RTTI, for debugging purposes */ + virtual const char *getType() const { return ""; } + + /** Can be overloaded to close resources this object keeps open */ + virtual bool close() { return true; } + + /** Returns an object this object depends on. (used internally, by extensions) */ + inline VFSBase *getOrigin() const { return _origin; } + + inline void lock() const { _mtx.Lock(); } + inline void unlock() const { _mtx.Unlock(); } + inline Mutex& mutex() const { return _mtx; } + +#ifdef VFS_USE_HASHMAP + inline size_t hash() const { return _hash; } +#endif + + // For internal use + inline void _setOrigin(VFSBase *origin) { _origin = origin; } + +protected: + VFSBase(); + void _setName(const char *n); + +private: + +#ifdef VFS_USE_HASHMAP + size_t _hash; +#endif + + const char *_name; // must point to an address constant during object lifetime (like _fullname.c_str() + N) + // (not necessary to have an additional string copy here, just wastes memory) + std::string _fullname; + + mutable Mutex _mtx; + + VFSBase *_origin; // May store a pointer if necessary. NOT ref-counted, because this would create cycles in almost all cases. + +public: + + /** Reference count, if the pointer to this file is stored somewhere it is advisable to increase + (ref++) it. If it reaches 0, this file is deleted automatically. */ + SelfRefCounter ref; +}; + + + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs/VFSDefines.h b/ExternalLibs/ttvfs/VFSDefines.h new file mode 100644 index 0000000..4439bda --- /dev/null +++ b/ExternalLibs/ttvfs/VFSDefines.h @@ -0,0 +1,101 @@ +// VFSDefines.h - compile config and basic setup +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFS_DEFINES_H +#define VFS_DEFINES_H + +/* --- Config section -- modify as needed --- */ + +// choose a namespace name, or comment out to disable namespacing completely (not recommended) +#define VFS_NAMESPACE ttvfs + +// Define this to allow dealing with files > 4 GB, using non-standard functions. +// This may or may not work with your platform/compiler, good luck. +//#define VFS_LARGEFILE_SUPPORT + +// Define this to make all operations case insensitive. +// Windows systems generally don't care much, but for Linux and Mac this can be used +// to get the same behavior as on windows. +// Additionally, this achieves full case insensitivity within the library, +// if the the same files are accessed multiple times by the program, but with not-uniform case. +// (no sane programmer should do this, anyway). +// However, on non-windows systems this will decrease performance when checking for files +// on disk (see VFSLoader.cpp). +#define VFS_IGNORE_CASE + +// Define this to make all VFSFile, VFSDir, VFSHelper operations thread-safe. +// If you do, do not forget to add your own implementation to VFSAtomic.cpp/.h ! +// If this is not defined, you can still do manual locking if you know what you're doing, +// performance matters, and you implemented actual locking into the Mutex class. +// If no Mutex implementation is provided, its operations are no-ops, beware! +// Note: This adds a *lot* of overhead. Better ensure thread safety yourself, externally. Really! +//#define VFS_THREADSAFE + +// By default, ttvfs uses a std::map to store stuff. +// Uncomment the line below to use an (experimental!) hashmap. +// With std::map, iterating over entries will always deliver them in sorted order. +// The hashmap will deliver entries in random order, but lookup will be much faster +// (especially if VFS_IGNORE_CASE is set!) +//#define VFS_USE_HASHMAP + +// These are used for small, temporary memory allocations that can remain on the stack. +// If alloca is available, this is the preferred way. +#include +#ifdef _WIN32 +# include // MSVC/MinGW still need this for alloca. Seems to be windows-specific failure +#endif +#define VFS_STACK_ALLOC(size) alloca(size) +#define VFS_STACK_FREE(ptr) /* no need to free anything here */ +// Fail-safe: +//#define VFS_STACK_ALLOC(size) malloc(size) +//#define VFS_STACK_FREE(ptr) free(ptr) + +/* --- End of config section --- */ + + +#ifdef VFS_NAMESPACE +# define VFS_NAMESPACE_START namespace VFS_NAMESPACE { +# define VFS_NAMESPACE_END } +# define VFS_NAMESPACE_IMPL VFS_NAMESPACE:: +#else +# define VFS_NAMESPACE_START +# define VFS_NAMESPACE_END +# define VFS_NAMESPACE_IMPL +#endif + +VFS_NAMESPACE_START + +#ifdef VFS_LARGEFILE_SUPPORT +# if defined(_MSC_VER) + typedef __int64 vfspos; +# else + typedef long long vfspos; +# endif +#else + typedef unsigned int vfspos; +#endif + +// simple guard wrapper, works also if VFS_THREADSAFE is not defined +#define VFS_GUARD(obj) VFS_NAMESPACE_IMPL Guard __vfs_stack_guard((obj)->mutex()) + +// defines for optional auto-locking; only if VFS_THREADSAFE is defined +#ifdef VFS_THREADSAFE +# define VFS_GUARD_OPT(obj) VFS_GUARD(obj) +#else +# define VFS_GUARD_OPT(obj) +#endif + +#if defined(_MSC_VER) || defined(__MINGW32__) || defined(__MINGW64__) +# define VFS_STRICMP stricmp +#else +# define VFS_STRICMP strcasecmp +#endif + +static const vfspos npos = vfspos(-1); + +typedef void *(*allocator_func)(size_t); +typedef void (*delete_func)(void*); + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs/VFSDir.cpp b/ExternalLibs/ttvfs/VFSDir.cpp new file mode 100644 index 0000000..940b87d --- /dev/null +++ b/ExternalLibs/ttvfs/VFSDir.cpp @@ -0,0 +1,441 @@ +// VFSDir.cpp - basic directory interface + classes +// For conditions of distribution and use, see copyright notice in VFS.h + +#include + +#include "VFSInternal.h" +#include "VFSTools.h" +#include "VFSFile.h" +#include "VFSDir.h" + +VFS_NAMESPACE_START + + +VFSDir::VFSDir(const char *fullpath) +{ + _setName(fullpath); +} + +VFSDir::~VFSDir() +{ + for(Files::iterator it = _files.begin(); it != _files.end(); ++it) + it->second.ptr->ref--; + for(Dirs::iterator it = _subdirs.begin(); it != _subdirs.end(); ++it) + it->second.ptr->ref--; +} + +unsigned int VFSDir::load(bool recursive) +{ + return 0; +} + +VFSDir *VFSDir::createNew(const char *dir) const +{ + VFSDir *vd = new VFSDir(dir); + vd->_setOrigin(getOrigin()); + return vd; +} + +bool VFSDir::add(VFSFile *f, bool overwrite, EntryFlags flag) +{ + if(!f) + return false; + + VFS_GUARD_OPT(this); + + Files::iterator it = _files.find(f->name()); + + if(it != _files.end()) + { + if(overwrite) + { + VFSFile *oldf = it->second.ptr; + if(oldf == f) + return false; + + _files.erase(it); + oldf->ref--; + } + else + return false; + } + + f->ref++; + _files[f->name()] = MapEntry(f, flag); + return true; +} + +bool VFSDir::addRecursive(VFSFile *f, bool overwrite, EntryFlags flag) +{ + if(!f) + return false; + + VFS_GUARD_OPT(this); + + // figure out directory from full file name + VFSDir *vdir; + size_t prefixLen = f->fullnameLen() - f->nameLen(); + if(prefixLen) + { + char *dirname = (char*)VFS_STACK_ALLOC(prefixLen); + --prefixLen; // -1 to strip the trailing '/'. That's the position where to put the terminating null byte. + memcpy(dirname, f->fullname(), prefixLen); // copy trailing null byte + dirname[prefixLen] = 0; + vdir = getDir(dirname, true); + VFS_STACK_FREE(dirname); + } + else + vdir = this; + + return vdir->add(f, true, flag); +} + +bool VFSDir::merge(VFSDir *dir, bool overwrite, EntryFlags flag) +{ + if(!dir) + return false; + if(dir == this) + return true; // nothing to do then + + bool result = false; + VFS_GUARD_OPT(this); + + for(Files::iterator it = dir->_files.begin(); it != dir->_files.end(); ++it) + result = add(it->second.ptr, overwrite, flag) || result; + + for(Dirs::iterator it = dir->_subdirs.begin(); it != dir->_subdirs.end(); ++it) + result = insert(it->second.ptr, overwrite, flag) || result; + return result; +} + +bool VFSDir::insert(VFSDir *subdir, bool overwrite, EntryFlags flag) +{ + if(!subdir) + return false; + + VFS_GUARD_OPT(this); + + // With load() cleaning up the tree, it is ok to add subsequent VFSDirs directly. + // This will be very useful at some point when files can be mounted into a directory + // belonging to an archive, and this way adding files to the archive. + Dirs::iterator it = _subdirs.find(subdir->name()); + if(it == _subdirs.end()) + { + subdir->ref++; + _subdirs[subdir->name()] = MapEntry(subdir, flag); + return true; + } + else + { + it->second.ptr->merge(subdir, overwrite, flag); + return false; + } +} + +VFSFile *VFSDir::getFile(const char *fn) +{ + while(fn[0] == '.' && fn[1] == '/') // skip ./ + fn += 2; + + char *slashpos = (char *)strchr(fn, '/'); + + // if there is a '/' in the string, descend into subdir and continue there + if(slashpos) + { + // "" (the empty directory name) is allowed, so we can't return 'this' when hitting an empty string the first time. + // This whole mess is required for absolute unix-style paths ("/home/foo/..."), + // which, to integrate into the tree properly, sit in the root directory's ""-subdir. + // FIXME: Bad paths (double-slashes and the like) need to be normalized elsewhere, currently! + + size_t len = strlen(fn); + char *dup = (char*)VFS_STACK_ALLOC(len + 1); + memcpy(dup, fn, len + 1); // also copy the null-byte + slashpos = dup + (slashpos - fn); // use direct offset, not to have to recount again the first time + VFSDir *subdir = this; + const char *ptr = dup; + Dirs::iterator it; + VFS_GUARD_OPT(this); + + goto pos_known; + do + { + ptr = slashpos + 1; + while(ptr[0] == '.' && ptr[1] == '/') // skip ./ + ptr += 2; + slashpos = (char *)strchr(ptr, '/'); + if(!slashpos) + break; + + pos_known: + *slashpos = 0; + it = subdir->_subdirs.find(ptr); + if(it != subdir->_subdirs.end()) + subdir = it->second.ptr; // found it + else + subdir = NULL; // bail out + } + while(subdir); + VFS_STACK_FREE(dup); + if(!subdir) + return NULL; + // restore pointer into original string, by offset + ptr = fn + (ptr - dup); + + Files::iterator ft = subdir->_files.find(ptr); + return ft != subdir->_files.end() ? ft->second.ptr : NULL; + } + + // no subdir? file must be in this dir now. + VFS_GUARD_OPT(this); + Files::iterator it = _files.find(fn); + return it != _files.end() ? it->second.ptr : NULL; +} + +VFSDir *VFSDir::getDir(const char *subdir, bool forceCreate /* = false */) +{ + if(!subdir[0] || (subdir[0] == '.' && (!subdir[1] || subdir[1] == '/'))) // empty string or "." or "./" ? use this. + return this; + + VFSDir *ret = NULL; + char *slashpos = (char *)strchr(subdir, '/'); + + // if there is a '/' in the string, descend into subdir and continue there + if(slashpos) + { + // from a/b/c, cut out the a, without the trailing '/'. + const char *sub = slashpos + 1; + size_t copysize = slashpos - subdir; + char * const t = (char*)VFS_STACK_ALLOC(copysize + 1); + memcpy(t, subdir, copysize); + t[copysize] = 0; + VFS_GUARD_OPT(this); + Dirs::iterator it = _subdirs.find(t); + if(it != _subdirs.end()) + { + ret = it->second.ptr->getDir(sub, forceCreate); // descend into subdirs + } + else if(forceCreate) + { + // -> newname = fullname() + '/' + t + size_t fullLen = fullnameLen(); + VFSDir *ins; + if(fullLen) + { + char * const newname = (char*)VFS_STACK_ALLOC(fullLen + copysize + 2); + char *ptr = newname; + memcpy(ptr, fullname(), fullLen); + ptr += fullLen; + *ptr++ = '/'; + memcpy(ptr, t, copysize); + ptr[copysize] = 0; + ins = createNew(newname); + VFS_STACK_FREE(newname); + } + else + ins = createNew(t); + + _subdirs[ins->name()] = ins; + ret = ins->getDir(sub, true); // create remaining structure + } + } + else + { + VFS_GUARD_OPT(this); + Dirs::iterator it = _subdirs.find(subdir); + if(it != _subdirs.end()) + ret = it->second.ptr; + else if(forceCreate) + { + size_t fullLen = fullnameLen(); + if(fullLen) + { + // -> newname = fullname() + '/' + subdir + size_t subdirLen = strlen(subdir); + char * const newname = (char*)VFS_STACK_ALLOC(fullLen + subdirLen + 2); + char *ptr = newname; + memcpy(ptr, fullname(), fullLen); + ptr += fullLen; + *ptr++ = '/'; + memcpy(ptr, subdir, subdirLen); + ptr[subdirLen] = 0; + + ret = createNew(newname); + VFS_STACK_FREE(newname); + } + else + { + ret = createNew(subdir); + } + + _subdirs[ret->name()] = ret; + } + } + + return ret; +} + +void VFSDir::clearMounted() +{ + for(FileIter it = _files.begin(); it != _files.end(); ) + { + MapEntry& e = it->second; + if(e.isMounted()) + { + e.ptr->ref--; + _files.erase(it++); + } + else + ++it; + } + for(DirIter it = _subdirs.begin(); it != _subdirs.end(); ) + { + MapEntry& e = it->second; + if(e.isMounted()) + { + e.ptr->ref--; + _subdirs.erase(it++); + } + else + { + it->second.ptr->clearMounted(); + ++it; + } + } +} + +template static void iterIncref(T *b, void*) { ++(b->ref); } +template static void iterDecref(T *b, void*) { --(b->ref); } + +static void _iterDirs(VFSDir::Dirs &m, DirEnumCallback f, void *user) +{ + for(DirIter it = m.begin(); it != m.end(); ++it) + f(it->second.ptr, user); +} + +void VFSDir::forEachDir(DirEnumCallback f, void *user /* = NULL */, bool safe /* = false */) +{ + VFS_GUARD_OPT(this); + if(safe) + { + Dirs cp = _subdirs; + _iterDirs(cp, iterIncref, NULL); + _iterDirs(cp, f, user); + _iterDirs(cp, iterDecref, NULL); + } + else + _iterDirs(_subdirs, f, user); +} + +static void _iterFiles(VFSDir::Files &m, FileEnumCallback f, void *user) +{ + for(FileIter it = m.begin(); it != m.end(); ++it) + f(it->second.ptr, user); +} + +void VFSDir::forEachFile(FileEnumCallback f, void *user /* = NULL */, bool safe /* = false */) +{ + VFS_GUARD_OPT(this); + if(safe) + { + Files cp = _files; + _iterFiles(cp, iterIncref, NULL); + _iterFiles(cp, f, user); + _iterFiles(cp, iterDecref, NULL); + } + else + _iterFiles(_files, f, user); +} + + +// ----- VFSDirReal start here ----- + + +VFSDirReal::VFSDirReal(const char *dir) : VFSDir(dir) +{ +} + +VFSDir *VFSDirReal::createNew(const char *dir) const +{ + return new VFSDirReal(dir); +} + +unsigned int VFSDirReal::load(bool recursive) +{ + VFS_GUARD_OPT(this); + + Files remainF; + Dirs remainD; + + remainF.swap(_files); + remainD.swap(_subdirs); + + // _files, _subdirs now empty + + StringList li; + GetFileList(fullname(), li); + for(StringList::iterator it = li.begin(); it != li.end(); ++it) + { + // file was already present, move over and erase + FileIter fi = remainF.find(it->c_str()); + if(fi != remainF.end()) + { + _files[fi->first] = fi->second; + remainF.erase(fi); + continue; + } + + // TODO: use stack alloc + std::string tmp = fullname(); + tmp += '/'; + tmp += *it; + VFSFileReal *f = new VFSFileReal(tmp.c_str()); + _files[f->name()] = f; + } + unsigned int sum = li.size(); + + li.clear(); + GetDirList(fullname(), li, false); + for(std::deque::iterator it = li.begin(); it != li.end(); ++it) + { + // subdir was already present, move over and erase + DirIter fi = remainD.find(it->c_str()); + if(fi != remainD.end()) + { + if(recursive) + sum += fi->second.ptr->load(true); + ++sum; + + _subdirs[fi->first] = fi->second; + remainD.erase(fi); + continue; + } + + // TODO: use stack alloc + std::string full(fullname()); + full += '/'; + full += *it; // GetDirList() always returns relative paths + + VFSDir *d = createNew(full.c_str()); + if(recursive) + sum += d->load(true); + ++sum; + _subdirs[d->name()] = d; + } + + // clean up & remove no longer existing files & dirs, + // and move over entries mounted here. + for(FileIter it = remainF.begin(); it != remainF.end(); ++it) + if(it->second.isMounted()) + _files[it->first] = it->second; + else + it->second.ptr->ref--; + for(DirIter it = remainD.begin(); it != remainD.end(); ++it) + if(it->second.isMounted()) + _subdirs[it->first] = it->second; + else + it->second.ptr->ref--; + + return sum; +} + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSDir.h b/ExternalLibs/ttvfs/VFSDir.h new file mode 100644 index 0000000..f84836f --- /dev/null +++ b/ExternalLibs/ttvfs/VFSDir.h @@ -0,0 +1,213 @@ +// VFSDir.h - basic directory interface + classes +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFSDIR_H +#define VFSDIR_H + +#include "VFSBase.h" +#include +#include + +#ifdef VFS_USE_HASHMAP +# include "VFSHashmap.h" +# include "VFSTools.h" +#endif + +VFS_NAMESPACE_START + + +#ifdef VFS_IGNORE_CASE +# ifdef _MSC_VER +# pragma warning(push) +# pragma warning(disable: 4996) +# endif + +struct ci_less +{ + inline bool operator() (const char *a, const char *b) const + { + return VFS_STRICMP(a, b) < 0; + } +}; + +struct ci_equal +{ + inline bool operator() (const char *a, const char *b) const + { + return !VFS_STRICMP(a, b); + } +}; + +inline int casecmp(const char *a, const char *b) +{ + return VFS_STRICMP(a, b); +} + +# ifdef _MSC_VER +# pragma warning(pop) +# endif + +#else // VFS_IGNORE_CASE + +struct cs_less +{ + inline bool operator() (const char *a, const char *b) const + { + return strcmp(a, b) < 0; + } +}; + +inline int casecmp(const char *a, const char *b) +{ + return strcmp(a, b); +} + + +#endif // VFS_IGNORE_CASE + + +#ifdef VFS_USE_HASHMAP + +struct hashmap_eq +{ + inline bool operator() (const char *a, const char *b, size_t h, const VFSBase *itm) const + { + // quick check - instead of just comparing the strings, + // check the hashes first. If they don't match there is no + // need to check the strings at all. + return itm->hash() == h && !casecmp(a, b); + } +}; + +struct charptr_hash +{ + inline size_t operator()(const char *s) + { + // case sensitive or in-sensitive, depending on config + return STRINGHASH(s); + } +}; + +#endif // VFS_USE_HASHMAP + + +class VFSDir; +class VFSFile; + +typedef void (*FileEnumCallback)(VFSFile *vf, void *user); +typedef void (*DirEnumCallback)(VFSDir *vd, void *user); + + +class VFSDir : public VFSBase +{ +public: + + // bitmask + enum EntryFlags + { + NONE = 0, + MOUNTED = 1 + }; + + template struct MapEntry + { + MapEntry() {} + MapEntry(T *p, EntryFlags flg = NONE) : ptr(p), flags(flg) {} + inline bool isMounted() { return flags & MOUNTED; } + + T *ptr; + EntryFlags flags; + }; + + // Avoid using std::string as key. + // The file names are known to remain constant during each object's lifetime, + // so just keep the pointers and use an appropriate comparator function. +#ifdef VFS_USE_HASHMAP + // VFS_IGNORE_CASE already handled in hash generation + typedef HashMap, charptr_hash, hashmap_eq> Dirs; + typedef HashMap, charptr_hash, hashmap_eq> Files; +#else +# ifdef VFS_IGNORE_CASE + typedef std::map, ci_less> Dirs; + typedef std::map, ci_less> Files; +# else + typedef std::map, cs_less> Dirs; + typedef std::map, cs_less> Files; +# endif +#endif + + VFSDir(const char *fullpath); + virtual ~VFSDir(); + + /** Enumerate directory with given path. Keeps previously loaded entries. + Returns the amount of files found. */ + virtual unsigned int load(bool recursive); + + /** Creates a new virtual directory of an internally specified type. */ + virtual VFSDir *createNew(const char *dir) const; + + /** For debugging. Does never return NULL. */ + virtual const char *getType() const { return "VFSDir"; } + + /** Can be overloaded if necessary. Called by VFSHelper::ClearGarbage() */ + virtual void clearGarbage() {} + + /** Can be overloaded to close resources this dir keeps open */ + virtual bool close() { return true; } + + /** Returns a file for this dir's subtree. Descends if necessary. + Returns NULL if the file is not found. */ + VFSFile *getFile(const char *fn); + + /** Returns a subdir, descends if necessary. If forceCreate is true, + create directory tree if it does not exist, and return the originally requested + subdir. Otherwise return NULL if not found. */ + VFSDir *getDir(const char *subdir, bool forceCreate = false); + + /** Recursively drops all files/dirs that were mounted into this directory (and subdirs) */ + void clearMounted(); + + /** Iterate over all files or directories, calling a callback function, + optionally with additional userdata. If safe is true, iterate over a copy. + This is useful if the callback function modifies the tree, e.g. + adds or removes files. */ + void forEachFile(FileEnumCallback f, void *user = NULL, bool safe = false); + void forEachDir(DirEnumCallback f, void *user = NULL, bool safe = false); + + + /* Below is for internal use -- take care if using these externally! */ + bool insert(VFSDir *subdir, bool overwrite, EntryFlags flag); + bool merge(VFSDir *dir, bool overwrite, EntryFlags flag); + + /** Adds a file directly to this directory, allows any name. + If another file with this name already exists, optionally drop the old one out. + Returns whether the file was actually added. */ + bool add(VFSFile *f, bool overwrite, EntryFlags flag); + + /** Like add(), but if the file name contains a path, descend the tree to the target dir. + Not-existing subdirs are created on the way. */ + bool addRecursive(VFSFile *f, bool overwrite, EntryFlags flag); + +protected: + + // std::map or ttvfs::HashMap stores for files and subdirs. + Files _files; + Dirs _subdirs; +}; + +typedef VFSDir::Files::iterator FileIter; +typedef VFSDir::Dirs::iterator DirIter; + +class VFSDirReal : public VFSDir +{ +public: + VFSDirReal(const char *dir); + virtual ~VFSDirReal() {}; + virtual unsigned int load(bool recursive); + virtual VFSDir *createNew(const char *dir) const; + virtual const char *getType(void) const { return "VFSDirReal"; } +}; + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs/VFSFile.cpp b/ExternalLibs/ttvfs/VFSFile.cpp new file mode 100644 index 0000000..74a328f --- /dev/null +++ b/ExternalLibs/ttvfs/VFSFile.cpp @@ -0,0 +1,237 @@ +// VFSFile.cpp - basic file interface + classes +// For conditions of distribution and use, see copyright notice in VFS.h + +#include "VFSInternal.h" +#include "VFSFile.h" +#include "VFSTools.h" +#include "VFSFileFuncs.h" + +#include + +VFS_NAMESPACE_START + +VFSFile::VFSFile(const char *name) +: _buf(NULL), _delfunc(NULL) +{ + _setName(name); +} + +VFSFile::~VFSFile() +{ + close(); + dropBuf(true); +} + +void VFSFile::delBuf(void *mem) +{ + deleteHelper(_delfunc, (char*) mem); +} + +const void *VFSFile::getBuf(allocator_func alloc /* = NULL */, delete_func del /* = NULL */) +{ + assert(!alloc == !del); // either both or none may be defined. Checked extra early to prevent possible errors later. + + VFS_GUARD_OPT(this); + if(_buf) + return _buf; + + bool op = isopen(); + + if(!op && !open()) // open with default params if not open + return NULL; + + unsigned int s = (unsigned int)size(); + _buf = allocHelper(alloc, s + 4); // a bit extra padding + if(!_buf) + return NULL; + + _delfunc = del; + + vfspos offs; + if(op) + { + vfspos oldpos = getpos(); + seek(0); + offs = read(_buf, s); + seek(oldpos); + } + else + { + offs = read(_buf, s); + close(); + } + // Might as well be text mode reading, which means less actual bytes than size() said, + // so this can't be done earlier. + memset((char*)_buf + offs, 0, 4); + + return _buf; +} + +void VFSFile::dropBuf(bool del) +{ + VFS_GUARD_OPT(this); + if(del) + delBuf(_buf); + _buf = NULL; +} + +VFSFileReal::VFSFileReal(const char *name /* = NULL */) +: VFSFile(name), _fh(NULL), _size(npos), _buf(NULL) +{ +} + +VFSFileReal::~VFSFileReal() +{ +} + +bool VFSFileReal::open(const char *mode /* = NULL */) +{ + VFS_GUARD_OPT(this); + + if(isopen()) + close(); + + dropBuf(true); + + _fh = real_fopen(fullname(), mode ? mode : "rb"); + if(!_fh) + return false; + + real_fseek((FILE*)_fh, 0, SEEK_END); + _size = getpos(); + real_fseek((FILE*)_fh, 0, SEEK_SET); + + return true; +} + +bool VFSFileReal::isopen(void) const +{ + VFS_GUARD_OPT(this); + return !!_fh; +} + +bool VFSFileReal::iseof(void) const +{ + VFS_GUARD_OPT(this); + return !_fh || real_feof((FILE*)_fh); +} + +bool VFSFileReal::close(void) +{ + VFS_GUARD_OPT(this); + if(_fh) + { + real_fclose((FILE*)_fh); + _fh = NULL; + } + return true; +} + +bool VFSFileReal::seek(vfspos pos) +{ + VFS_GUARD_OPT(this); + if(!_fh) + return false; + return real_fseek((FILE*)_fh, pos, SEEK_SET) == 0; +} + +bool VFSFileReal::seekRel(vfspos offs) +{ + VFS_GUARD_OPT(this); + if(!_fh) + return false; + return real_fseek((FILE*)_fh, offs, SEEK_CUR) == 0; +} + +bool VFSFileReal::flush(void) +{ + VFS_GUARD_OPT(this); + if(!_fh) + return false; + return real_fflush((FILE*)_fh) == 0; +} + +vfspos VFSFileReal::getpos(void) const +{ + VFS_GUARD_OPT(this); + if(!_fh) + return npos; + return real_ftell((FILE*)_fh); +} + +unsigned int VFSFileReal::read(void *dst, unsigned int bytes) +{ + VFS_GUARD_OPT(this); + if(!_fh) + return npos; + return real_fread(dst, 1, bytes, (FILE*)_fh); +} + +unsigned int VFSFileReal::write(const void *src, unsigned int bytes) +{ + VFS_GUARD_OPT(this); + if(!_fh) + return npos; + return real_fwrite(src, 1, bytes, (FILE*)_fh); +} + +vfspos VFSFileReal::size(void) +{ + VFS_GUARD_OPT(this); + if(_size != npos) + return _size; + open(); + close(); + // now size is known. + return _size; +} + +// ------------- VFSFileMem ----------------------- + +VFSFileMem::VFSFileMem(const char *name, void *buf, unsigned int size, Mode mode /* = COPY */, + allocator_func alloc /* = NULL */, delete_func delfunc /* = NULL */) +: VFSFile(name), _pos(0), _size(size), _mybuf(mode == TAKE_OVER || mode == COPY) +{ + if(mode == COPY) + { + assert(!alloc == !delfunc); + _buf = alloc ? alloc(size+1) : (void*)(new char[size+1]); + memcpy(_buf, buf, size); + ((char*)_buf)[size] = 0; + } + else + { + _buf = buf; + } + _delfunc = delfunc; +} + +VFSFileMem::~VFSFileMem() +{ + if(_mybuf) + VFSFile::dropBuf(true); +} + +unsigned int VFSFileMem::read(void *dst, unsigned int bytes) +{ + VFS_GUARD_OPT(this); + if(iseof()) + return 0; + unsigned int rem = std::min((unsigned int)(_size - _pos), bytes); + + memcpy(dst, (char*)_buf + _pos, rem); + return rem; +} + +unsigned int VFSFileMem::write(const void *src, unsigned int bytes) +{ + VFS_GUARD_OPT(this); + if(iseof()) + return 0; + unsigned int rem = std::min((unsigned int)(_size - _pos), bytes); + + memcpy((char*)_buf + _pos, src, rem); + return rem; +} + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSFile.h b/ExternalLibs/ttvfs/VFSFile.h new file mode 100644 index 0000000..2ed3273 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSFile.h @@ -0,0 +1,165 @@ +// VFSFile.h - basic file interface + classes +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFSFILE_H +#define VFSFILE_H + +#include "VFSBase.h" +#include + +VFS_NAMESPACE_START + + +/** -- VFSFile basic interface -- + * All functions that return bool should return true on success and false on failure. + * If an operation is not necessary or irrelevant (for example, files in memory can't be closed), + * it is useful to return true anyways, because this operation did not fail, technically. + * (Common sense here!) + * An int/vfspos value of 0 indicates failure, except the size/seek/getpos functions, where npos means failure. + * Only the functions required or applicable need to be implemented, for unsupported operations + * the default implementation should be sufficient. + **/ +class VFSFile : public VFSBase +{ +public: + + /** The ctor is expected to set both name() and fullname(); + The name must remain static throughout the object's lifetime. */ + VFSFile(const char *fn); + + virtual ~VFSFile(); + + /** Open a file. + Mode can be "r", "w", "rb", "rb", and possibly other things that fopen supports. + It is the subclass's choice to support other modes. Default is "rb". + If the file still has a buffer (as returned by getBuf()), it is deleted. + Closes and reopens if already open (even in the same mode). */ + virtual bool open(const char *mode = NULL) { return false; } + + virtual bool isopen(void) const { return false; } + virtual bool iseof(void) const { return true; } + virtual bool close(void) { return true; } + virtual bool seek(vfspos pos) { return false; } + + /** Seek relative to current position. Negative numbers will seek backwards. + (In most cases, the default implementation does not have to be changed) */ + virtual bool seekRel(vfspos offs) { VFS_GUARD_OPT(this); return seek(getpos() + offs); } + + virtual bool flush(void) { return true; } + + /** Current offset in file. Return npos if NA. */ + virtual vfspos getpos(void) const { return npos; } + + virtual unsigned int read(void *dst, unsigned int bytes) { return 0; } + virtual unsigned int write(const void *src, unsigned int bytes) { return 0; } + + /** Return file size. If NA, return npos. If size is not yet known, + open() and close() may be called (with default args) to find out the size. + The file is supposed to be in its old state when the function returns, + that is in the same open state and seek position. + The pointer returned by getBuf() must not change. */ + virtual vfspos size(void) { return npos; } + + /** Return full file content in memory. Like size(), this may do other operations on the file, + but after the function returns the file is expected to be in the same state it was before. + If the file is not open before the call, it will be opened with default parameters (that is, "rb"). + Additional EOL mangling my happen if the file is opened in text mode before (= not binary). + Calls to open() should delete this memory if the file was previously opened in a different mode. + In the default implementation, the returned memory is not guaranteed to be writable without problems, + so don't do it. Don't cast the const away. You have been warned. + Supply your own allocator and deletor functions if required. + NULL means new[] and delete[], respectively. + Either both must be a valid function, or both NULL. Only one of them NULL will cause assertion fail. */ + virtual const void *getBuf(allocator_func alloc = NULL, delete_func del = NULL); + + /** If del is true, delete internal buffer. If false, unregister internal buffer from the file, + but do not delete. Use free() or an appropriate deletion function later. */ + virtual void dropBuf(bool del); + + /** Basic RTTI, for debugging purposes */ + virtual const char *getType(void) const { return "virtual"; } + + + // ---- non-virtual part ---- + + /** Uses the deletion function earlier given to getBuf() to free the given memory, + or delete [] if the function is NULL. Useful if the original function + that was used to allocate the buffer is no longer known. */ + void delBuf(void *mem); + + +protected: + + void *_buf; + delete_func _delfunc; +}; + +class VFSFileReal : public VFSFile +{ +public: + VFSFileReal(const char *name); + virtual ~VFSFileReal(); + virtual bool open(const char *mode = NULL); + virtual bool isopen(void) const; + virtual bool iseof(void) const; + virtual bool close(void); + virtual bool seek(vfspos pos); + virtual bool seekRel(vfspos offs); + virtual bool flush(void); + virtual vfspos getpos(void) const; + virtual unsigned int read(void *dst, unsigned int bytes); + virtual unsigned int write(const void *src, unsigned int bytes); + virtual vfspos size(void); + virtual const char *getType(void) const { return "disk"; } + + inline void *getFP() { return _fh; } + +protected: + + void *_fh; // FILE* + vfspos _size; + void *_buf; +}; + +class VFSFileMem : public VFSFile +{ +public: + enum Mode + { + COPY, //- Make a copy of the buffer (default action). + REUSE, //- Use the passed-in buffer as is. Requires the pointer + // to remain valid over the life of this object. + TAKE_OVER, //- Take over the passed-in buffer; it will be deleted on object destruction. + }; + + /* Creates a virtual file from a memory buffer. By default, the memory is copied. + A deletor function can be passed optionally, if its NULL (the default), + delete[] (char*)buf will be used. For malloc()'d memory, pass free. (Only used if mode is TAKE_OVER) */ + VFSFileMem(const char *name, void *buf, unsigned int size, Mode m = COPY, + allocator_func alloc = NULL, delete_func delfunc = NULL); + virtual ~VFSFileMem(); + virtual bool open(const char *mode = NULL) { return true; } + virtual bool isopen(void) const { return true; } // always open + virtual bool iseof(void) const { VFS_GUARD_OPT(this); return _pos >= _size; } + virtual bool close(void) { return true; } // cant close, but not a problem + virtual bool seek(vfspos pos) { VFS_GUARD_OPT(this); _pos = pos; return true; } + virtual bool seekRel(vfspos offs) { VFS_GUARD_OPT(this); _pos += offs; return true; } + virtual bool flush(void) { return false; } // can't flush, if a successful file write is expected, this IS a problem. + virtual vfspos getpos(void) const { VFS_GUARD_OPT(this); return _pos; } + virtual unsigned int read(void *dst, unsigned int bytes); + virtual unsigned int write(const void *src, unsigned int bytes); + virtual vfspos size(void) { VFS_GUARD_OPT(this); return _size; } + virtual const void *getBuf(allocator_func alloc = NULL, delete_func del = NULL) { VFS_GUARD_OPT(this); return _buf; } + virtual void dropBuf(bool) {} // we can't simply drop the internal buffer, as the file is entirely memory based + virtual const char *getType(void) const { return "mem"; } + +protected: + + vfspos _pos; + vfspos _size; + bool _mybuf; +}; + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs/VFSFileFuncs.cpp b/ExternalLibs/ttvfs/VFSFileFuncs.cpp new file mode 100644 index 0000000..fe30b3b --- /dev/null +++ b/ExternalLibs/ttvfs/VFSFileFuncs.cpp @@ -0,0 +1,78 @@ +#include "VFSFileFuncs.h" + +// this is for POSIX - define before including any stdio headers +#ifdef VFS_LARGEFILE_SUPPORT +# ifndef _MSC_VER +# define _FILE_OFFSET_BITS 64 +# endif +#endif + +#include "VFSInternal.h" + +#include + +// Compile time assertion to make sure things work as expected +#if defined(VFS_LARGEFILE_SUPPORT) && !defined(_MSC_VER) +static void _dummy_() { switch(0) { case 4: case sizeof(off_t): ; } } +#endif + +VFS_NAMESPACE_START + +void *real_fopen(const char *name, const char *mode) +{ + return fopen(name, mode); +} + +int real_fclose(void *fh) +{ + return fclose((FILE*)fh); +} + +int real_fseek(void *fh, vfspos offset, int origin) +{ +#ifdef VFS_LARGEFILE_SUPPORT +# ifdef _MSC_VER + return _fseeki64((FILE*)fh, offset, origin); +# else + return fseeko((FILE*)fh, offset, origin); +# endif +#else + return fseek((FILE*)fh, offset, origin); +#endif +} + +vfspos real_ftell(void *fh) +{ +#ifdef VFS_LARGEFILE_SUPPORT +# ifdef _MSC_VER + return _ftelli64((FILE*)fh); +# else + return ftello((FILE*)fh); +# endif +#else + return ftell((FILE*)fh); +#endif +} + +size_t real_fread(void *ptr, size_t size, size_t count, void *fh) +{ + return fread(ptr, size, count, (FILE*)fh); +} + +size_t real_fwrite(const void *ptr, size_t size, size_t count, void *fh) +{ + return fwrite(ptr, size, count, (FILE*)fh); +} + +int real_feof(void *fh) +{ + return feof((FILE*)fh); +} + +int real_fflush(void *fh) +{ + return fflush((FILE*)fh); +} + + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSFileFuncs.h b/ExternalLibs/ttvfs/VFSFileFuncs.h new file mode 100644 index 0000000..0e00661 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSFileFuncs.h @@ -0,0 +1,15 @@ +#include "VFSDefines.h" + + +VFS_NAMESPACE_START + +void *real_fopen(const char *name, const char *mode); +int real_fclose(void *fh); +int real_fseek(void *fh, vfspos offset, int origin); +vfspos real_ftell(void *fh); +size_t real_fread(void *ptr, size_t size, size_t count, void *fh); +size_t real_fwrite(const void *ptr, size_t size, size_t count, void *fh); +int real_feof(void *fh); +int real_fflush(void *fh); + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSHashmap.h b/ExternalLibs/ttvfs/VFSHashmap.h new file mode 100644 index 0000000..3ca7898 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSHashmap.h @@ -0,0 +1,394 @@ +// VFSHashmap.h - minimalist but fast STL compatible hashmap implementation. +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFS_HASHMAP_H +#define VFS_HASHMAP_H + +#include +#include "VFSDefines.h" + +VFS_NAMESPACE_START + + +template struct hash_cast +{ + inline size_t operator()(const KEY& t) const + { + return (size_t)t; + } + inline size_t operator()(const KEY *t) const + { + return (size_t)*t; + } +}; + +template struct equal +{ + inline bool operator()(const KEY& a, const KEY& b, size_t /*hash*/, const T& /*value*/) const + { + return a == b; + } +}; + +// (http://graphics.stanford.edu/~seander/bithacks.html) +inline size_t nextPowerOf2(size_t v) +{ + v--; + v |= v >> 1; + v |= v >> 2; + v |= v >> 4; + v |= v >> 8; + v |= v >> 16; + v++; + v += (v == 0); + return v; +} + +template +< + typename KEY, + typename T, + typename HASH, + typename CMP, + typename BucketType +> +class _HashMapBase +{ + // ---- supplemental stuff ---- + +public: + + typedef T value_type; + typedef std::size_t size_type; + typedef typename BucketType::iterator ITR; + + class iterator : public std::iterator + { + public: + + typedef typename ITR::value_type value_type; + typedef typename ITR::reference reference; + typedef typename ITR::pointer pointer; + + + iterator() + : _bucket(-1), _hm(NULL) + { + } + + iterator(size_t bucket, const ITR& it, _HashMapBase *hm) + : _bucket(bucket), _it(it), _hm(hm) + { + _nextbucket(); + } + + iterator(const iterator& it) + : _bucket(it._bucket), _it(it._it), _hm(it._hm) + { + _nextbucket(); + } + + iterator& operator=(const iterator& o) + { + if(this == &o) + return *this; + _bucket = o._bucket; + _it = o._it; + _hm = o._hm; + return *this; + } + + void _nextbucket() + { + while(_bucket+1 < _hm->v.size() && _it == _hm->v[_bucket].end()) + _it = _hm->v[++_bucket].begin(); + } + + void _prevbucket() + { + while(_bucket > 0 && _it == _hm->v[_bucket].begin()) + _it = _hm->v[--_bucket].back(); + } + + iterator& operator++(void) // pre-increment + { + ++_it; + _nextbucket(); + return *this; + } + + iterator operator++(int) // post-increment + { + iterator it = *this; + ++*this; + return it; + } + + iterator& operator--(void) // pre-decrement + { + --_it; + _prevbucket(); + return *this; + } + + iterator operator--(int) // post-decrement + { + iterator it = *this; + --*this; + return it; + } + + bool operator==(const iterator& o) const + { + return _hm == o._hm && _bucket == o._bucket && _it == o._it; + } + + bool operator!=(const iterator& o) const + { + return !(*this == o); + } + + bool operator<(const iterator& o) const + { + return _bucket < o._bucket || (_bucket == o._bucket && _it < o._it); + } + + bool operator<=(const iterator& o) const + { + return !(*this > o); + } + + bool operator>(const iterator& o) const + { + return _bucket > o._bucket || (_bucket == o._bucket && _it > o._it); + } + + bool operator>=(const iterator& o) const + { + return !(*this < o); + } + + reference operator*() + { + return _it.operator*(); + } + + pointer operator->() + { + return _it.operator->(); + } + + size_t _bucket; + ITR _it; + _HashMapBase *_hm; + }; + + +protected: + + // ---- Main class start ---- + + _HashMapBase(size_t buckets, int loadFactor, const CMP& c, const HASH& h) + : v(nextPowerOf2(buckets)), _size(0), _loadFactor(loadFactor), cmp(c), hash(h) + {} + + _HashMapBase(const _HashMapBase& o) + : v(o.v), _size(o._size), _loadFactor(o._loadFactor), cmp(o.cmp), hash(o.hash) + {} + +public: + + _HashMapBase& operator=(const _HashMapBase& o) + { + if(this == &o) + return *this; + v = o.v; + cmp = o.cmp; + hash = o.hash; + _size = o._size; + _loadFactor = o._loadFactor; + } + + + inline iterator begin() + { + return _MakeIter(0, v[0].begin()); + } + + inline iterator end() + { + return _MakeIter(v.size()-1, v[v.size()-1].end()); + } + + iterator find(const KEY& k) + { + size_t h = hash(k); + size_t i = h & (v.size()-1); // assume power of 2 + BucketType& b = v[i]; + for(typename BucketType::iterator it = b.begin(); it != b.end(); ++it) + if(cmp(k, it->first, h, it->second)) + return _MakeIter(i, it); + + return end(); + } + + void erase(const KEY& k) + { + size_t h = hash(k); + BucketType& b = v[h & (v.size()-1)]; // assume power of 2 + for(typename BucketType::iterator it = b.begin(); it != b.end(); ++it) + { + if(cmp(k, it->first, h, it->second)) + { + b.erase(it); + --_size; + return; + } + } + } + + inline iterator erase(const iterator& it) + { + --_size; + return _MakeIter(it._bucket, v[it._bucket].erase(it._it)); + } + + T& operator[] (const KEY& k) + { + size_t h = hash(k); + size_t i = h & (v.size()-1); // assume power of 2 + { + BucketType& b = v[i]; + for(typename BucketType::iterator it = b.begin(); it != b.end(); ++it) + if(cmp(k, it->first, h, it->second)) + return it->second; + } + ++_size; + if(_enlargeIfNecessary()) + i = h & (v.size()-1); + v[i].push_back(std::make_pair(k, T())); + return v[i].back().second; + } + + inline size_t size() const + { + return _size; + } + + /* "Because map containers do not allow for duplicate key values, the insertion operation + checks for each element inserted whether another element exists already in the container + with the same key value, if so, the element is not inserted and its mapped value + is not changed in any way." */ // Oh well. + /*void insert(std::pair& p) + { + size_t h = hash(p.first); + size_t i = h & (v.size()-1); + { + BucketType& b = v[i]; // assume power of 2 + for(typename BucketType::iterator it = b.begin(); it != b.end(); ++it) + if(cmp(p.first, it->first, h, it->second)) + return _MakeIter(i, it); + } + ++_size; + if(_enlargeIfNecessary()) + i = h & (v.size()-1); + v[i].push_back(std::make_pair(k, T())); + return _MakeIter(i, b.end()-1); + }*/ // -- not used in ttvfs currently + + + +private: + + inline iterator _MakeIter(size_t bucket, const typename BucketType::iterator& it) + { + return iterator(bucket, it, this); + } + + inline bool _enlargeIfNecessary() + { + if(_loadFactor < 0) + return false; + + if(_size > v.size() * _loadFactor) + { + _enlarge(); + return true; + } + return false; + } + + void _enlarge() + { + size_t oldsize = v.size(); + v.resize(oldsize * 2); + BucketType cp; + for(size_t i = 0; i < oldsize; ++i) + { + cp.clear(); + std::swap(cp, v[i]); // use efficient swap + // v[i] is now empty + // this way can possibly copy elements 2 times, but means less container copying overall + for(typename BucketType::iterator it = cp.begin(); it != cp.end(); ++it) + v[hash(it->first) & (v.size()-1)].push_back(*it); // assume power of 2 + } + } + + inline void swap(_HashMapBase& hm) + { + if(this == &hm) + return; + std::swap(v, hm.v); + std::swap(_size, hm._size); + std::swap(_loadFactor, hm._loadFactor); + std::swap(hash, hm.hash); + std::swap(cmp, hm.cmp); + } + + std::vector v; + size_t _size; + int _loadFactor; + + HASH hash; // hash functor + CMP cmp; // compare functor +}; + +template +< + typename KEY, + typename T, + typename HASH = hash_cast, + typename CMP = equal, + typename BucketType = std::vector > +> +class HashMap : public _HashMapBase +{ +public: + HashMap(size_t buckets = 16, int loadFactor = 5) + : _HashMapBase(buckets, loadFactor, CMP(), HASH()) + { + } + + +}; + +VFS_NAMESPACE_END + +namespace std +{ + template + < + typename KEY, + typename T, + typename HASH, + typename CMP, + typename BucketType + > + inline static void swap(VFS_NAMESPACE_IMPL HashMap& a, + VFS_NAMESPACE_IMPL HashMap& b) + { + a.swap(b); + } +}; + +#endif diff --git a/ExternalLibs/ttvfs/VFSHelper.cpp b/ExternalLibs/ttvfs/VFSHelper.cpp new file mode 100644 index 0000000..2df6cbf --- /dev/null +++ b/ExternalLibs/ttvfs/VFSHelper.cpp @@ -0,0 +1,483 @@ +// VFSHelper.cpp - glues it all together and makes use simple +// For conditions of distribution and use, see copyright notice in VFS.h + +#include // for debug only, see EOF + +#include "VFSInternal.h" +#include "VFSHelper.h" +#include "VFSAtomic.h" +#include "VFSTools.h" + +#include "VFSDir.h" +#include "VFSFile.h" +#include "VFSLoader.h" +#include "VFSArchiveLoader.h" + +#ifdef _DEBUG +# include +# define DEBUG_ASSERT(x) assert(x) +#else +# define DEBUG_ASSERT(x) +#endif + + +VFS_NAMESPACE_START + +// predecl is in VFS.h +bool _checkCompatInternal(bool large, bool nocase, bool hashmap, unsigned int vfspos_size) +{ +#ifdef VFS_LARGEFILE_SUPPORT + bool largefile_i = true; +#else + bool largefile_i = false; +#endif + +#ifdef VFS_IGNORE_CASE + bool nocase_i = true; +#else + bool nocase_i = false; +#endif + +#ifdef VFS_USE_HASHMAP + bool hashmap_i = true; +#else + bool hashmap_i = false; +#endif + + return (large == largefile_i) + && (nocase == nocase_i) + && (hashmap == hashmap_i) + && (sizeof(vfspos) == vfspos_size); +} + +VFSHelper::VFSHelper() +: filesysRoot(NULL), merged(NULL) +{ +} + +VFSHelper::~VFSHelper() +{ + Clear(); +} + +void VFSHelper::Clear(void) +{ + VFS_GUARD_OPT(this); + _cleanup(); + + if(filesysRoot) + { + filesysRoot->ref--; // this should always delete it... + filesysRoot = NULL; // ...but it may be referenced elsewhere, just in case + } + + _ClearMountPoints(); + + for(LoaderArray::iterator it = loaders.begin(); it != loaders.end(); ++it) + delete *it; + loaders.clear(); + + for(DirArray::iterator it = trees.begin(); it != trees.end(); ++it) + it->dir->ref--; + trees.clear(); + + for(ArchiveLoaderArray::iterator it = archLdrs.begin(); it != archLdrs.end(); ++it) + delete *it; + archLdrs.clear(); +} + +void VFSHelper::_ClearMountPoints(void) +{ + for(VFSMountList::iterator it = vlist.begin(); it != vlist.end(); ++it) + it->vdir->ref--; + vlist.clear(); +} + +void VFSHelper::_cleanup(void) +{ + VFS_GUARD_OPT(this); // be extra safe and ensure this is locked + if(merged) + { + merged->ref--; + merged = NULL; + } +} + +bool VFSHelper::LoadFileSysRoot(bool recursive) +{ + VFS_GUARD_OPT(this); + + if(filesysRoot) + return !!filesysRoot->load(recursive); + + filesysRoot = new VFSDirReal("."); + if(!filesysRoot->load(recursive)) + { + filesysRoot->ref--; + filesysRoot = NULL; + return false; + } + + loaders.push_back(new VFSLoaderDisk); + + BaseTreeEntry bt; + bt.source = ""; + bt.dir = filesysRoot; + trees.push_back(bt); + filesysRoot->ref++; + + AddVFSDir(filesysRoot, ""); + + return true; +} + +// TODO: deprecate this +void VFSHelper::Prepare(bool clear /* = true */) +{ + VFS_GUARD_OPT(this); + + Reload(false, clear, false); // HACK + + //for(DirArray::iterator it = trees.begin(); it != trees.end(); ++it) + // merged->getDir((*it)->fullname(), true)->merge(*it); +} + +void VFSHelper::Reload(bool fromDisk /* = false */, bool clear /* = false */, bool clearMountPoints /* = false */) +{ + VFS_GUARD_OPT(this); + if(clearMountPoints) + _ClearMountPoints(); + if(fromDisk && filesysRoot) + LoadFileSysRoot(true); + if(clear) + _cleanup(); + if(!merged && trees.size()) + { + for(DirArray::iterator it = trees.begin(); it != trees.end(); ++it) + it->dir->clearMounted(); + + // FIXME: not sure if really correct + merged = trees[0].dir; + merged->ref++; + + // FIXME: this is too hogging + //merged->load(true); + } + if(merged) + { + for(VFSMountList::iterator it = vlist.begin(); it != vlist.end(); ++it) + { + //printf("VFS: mount {%s} [%s] -> [%s] (overwrite: %d)\n", it->vdir->getType(), it->vdir->fullname(), it->mountPoint.c_str(), it->overwrite); + GetDir(it->mountPoint.c_str(), true)->merge(it->vdir, it->overwrite, VFSDir::MOUNTED); + } + } +} + +bool VFSHelper::Mount(const char *src, const char *dest, bool overwrite /* = true*/) +{ + VFS_GUARD_OPT(this); + return AddVFSDir(GetDir(src, false), dest, overwrite); +} + +bool VFSHelper::AddVFSDir(VFSDir *dir, const char *subdir /* = NULL */, bool overwrite /* = true */) +{ + if(!dir) + return false; + VFS_GUARD_OPT(this); + if(!subdir) + subdir = dir->fullname(); + + VDirEntry ve(dir, subdir, overwrite); + _StoreMountPoint(ve); + + VFSDir *sd = GetDir(subdir, true); + if(!sd) // may be NULL if Prepare() was not called before + return false; + sd->merge(dir, overwrite, VFSDir::MOUNTED); // merge into specified subdir. will be (virtually) created if not existing + + return true; +} + +bool VFSHelper::Unmount(const char *src, const char *dest) +{ + VFSDir *vd = GetDir(src, false); + if(!vd) + return false; + + VDirEntry ve(vd, dest, true); // last is dummy + if(!_RemoveMountPoint(ve)) + return false; + + // FIXME: this could be done more efficiently by just reloading parts of the tree that were involved. + Reload(false, true, false); + //vd->load(true); + //vd->load(false); + /*VFSDir *dstdir = GetDir(dest, false); + if(dstdir) + dstdir->load(false);*/ + return true; +} + +void VFSHelper::_StoreMountPoint(const VDirEntry& ve) +{ + // increase ref already before it will be added + ve.vdir->ref++; + + // scan through and ensure only one mount point with the same data is present. + // if present, remove and re-add, this ensures the mount point is at the end of the list + for(VFSMountList::iterator it = vlist.begin(); it != vlist.end(); ) + { + const VDirEntry& oe = *it; + if (ve.mountPoint == oe.mountPoint + && (ve.vdir == oe.vdir || !casecmp(ve.vdir->fullname(), oe.vdir->fullname())) + && (ve.overwrite || !oe.overwrite) ) // overwrite definitely, or if other does not overwrite + { + it->vdir->ref--; + vlist.erase(it++); // do not break; just in case there are more (fixme?) + } + else + ++it; + } + + vlist.push_back(ve); +} + +bool VFSHelper::_RemoveMountPoint(const VDirEntry& ve) +{ + for(VFSMountList::iterator it = vlist.begin(); it != vlist.end(); ++it) + { + const VDirEntry& oe = *it; + if(ve.mountPoint == oe.mountPoint + && (ve.vdir == oe.vdir || !casecmp(ve.vdir->fullname(), oe.vdir->fullname())) ) + { + it->vdir->ref--; + vlist.erase(it); + return true; + } + } + return false; +} + +bool VFSHelper::MountExternalPath(const char *path, const char *where /* = "" */, bool loadRec /* = false */, bool overwrite /* = true */) +{ + VFS_GUARD_OPT(this); + VFSDirReal *vfs = new VFSDirReal(path); + if(vfs->load(loadRec)) + AddVFSDir(vfs, where, overwrite); + return !!--(vfs->ref); // 0 if deleted +} + +void VFSHelper::AddLoader(VFSLoader *ldr) +{ + VFS_GUARD_OPT(this); + loaders.push_back(ldr); +} + +void VFSHelper::AddArchiveLoader(VFSArchiveLoader *ldr) +{ + VFS_GUARD_OPT(this); + archLdrs.push_back(ldr); +} + +VFSDir *VFSHelper::AddArchive(const char *arch, bool asSubdir /* = true */, const char *subdir /* = NULL */, void *opaque /* = NULL */) +{ + VFSFile *af = GetFile(arch); + if(!af) + return NULL; + + VFSDir *ad = NULL; + VFSLoader *fileLdr = NULL; + for(ArchiveLoaderArray::iterator it = archLdrs.begin(); it != archLdrs.end(); ++it) + if((ad = (*it)->Load(af, &fileLdr, opaque))) + break; + if(!ad) + return NULL; + + if(fileLdr) + loaders.push_back(fileLdr); + + BaseTreeEntry bt; + bt.source = arch; + bt.dir = ad; + trees.push_back(bt); + + AddVFSDir(ad, subdir, true); + + return ad; +} + +inline static VFSFile *VFSHelper_GetFileByLoader(VFSLoader *ldr, const char *fn, const char *unmangled, VFSDir *root) +{ + if(!ldr) + return NULL; + VFSFile *vf = ldr->Load(fn, unmangled); + if(vf) + { + VFS_GUARD_OPT(vf); + root->addRecursive(vf, true, VFSDir::NONE); + --(vf->ref); + } + return vf; +} + +VFSFile *VFSHelper::GetFile(const char *fn) +{ + const char *unmangled = fn; + std::string fixed = FixPath(fn); + fn = fixed.c_str(); + + VFSFile *vf = NULL; + + + VFS_GUARD_OPT(this); + + if(!merged) // Prepare() called? + return NULL; + + vf = merged->getFile(fn); + + // nothing found? maybe a loader has something. + // if so, add the newly created VFSFile to the tree. + if(!vf) + for(LoaderArray::iterator it = loaders.begin(); it != loaders.end(); ++it) + if((vf = VFSHelper_GetFileByLoader(*it, fn, unmangled, GetDirRoot()))) + break; + + //printf("VFS: GetFile '%s' -> '%s' (%s:%p)\n", fn, vf ? vf->fullname() : "NULL", vf ? vf->getType() : "?", vf); + + return vf; +} + +inline static VFSDir *VFSHelper_GetDirByLoader(VFSLoader *ldr, const char *fn, const char *unmangled, VFSDir *root) +{ + if(!ldr) + return NULL; + VFSDir *vd = ldr->LoadDir(fn, unmangled); + if(vd) + { + std::string parentname = StripLastPath(fn); + + VFS_GUARD_OPT(this); + VFSDir *parent = parentname.empty() ? root : root->getDir(parentname.c_str(), true); + parent->insert(vd, true, VFSDir::NONE); + --(vd->ref); // should delete it + + vd = root->getDir(fn); // can't return vd directly because it is cloned on insert+merge, and already deleted here + } + return vd; +} + +VFSDir *VFSHelper::GetDir(const char* dn, bool create /* = false */) +{ + const char *unmangled = dn; + std::string fixed = FixPath(dn); + dn = fixed.c_str(); + + VFS_GUARD_OPT(this); + if(!merged) + return NULL; + if(!*dn) + return merged; + VFSDir *vd = merged->getDir(dn); + + if(!vd && create) + { + if(!vd) + for(LoaderArray::iterator it = loaders.begin(); it != loaders.end(); ++it) + if((vd = VFSHelper_GetDirByLoader(*it, dn, unmangled, GetDirRoot()))) + break; + + if(!vd) + vd = merged->getDir(dn, true); + } + + //printf("VFS: GetDir '%s' -> '%s' (%s:%p)\n", dn, vd ? vd->fullname() : "NULL", vd ? vd->getType() : "?", vd); + + return vd; +} + +VFSDir *VFSHelper::GetDirRoot(void) +{ + VFS_GUARD_OPT(this); + return merged; +} + +VFSDir *VFSHelper::GetBaseTree(const char *path) +{ + for(DirArray::iterator it = trees.begin(); it != trees.end(); ++it) + if(!casecmp(it->source.c_str(), path)) + return it->dir; + return NULL; +} + +VFSDir *VFSHelper::GetMountPoint(const char *path) +{ + for(VFSMountList::iterator it = vlist.begin(); it != vlist.end(); ++it) + if(!casecmp(it->mountPoint.c_str(), path)) + return it->vdir; + return NULL; +} + + +void VFSHelper::ClearGarbage(void) +{ + for(DirArray::iterator it = trees.begin(); it != trees.end(); ++it) + it->dir->clearGarbage(); +} + + + +// DEBUG STUFF + + +struct _DbgParams +{ + _DbgParams(std::ostream& os_, VFSDir *parent_, const std::string& sp_) + : os(os_), parent(parent_), sp(sp_) {} + + std::ostream& os; + VFSDir *parent; + const std::string& sp; +}; + +static void _DumpFile(VFSFile *vf, void *user) +{ + _DbgParams& p = *((_DbgParams*)user); + + p.os << p.sp << "f|" << vf->name() << " [" << vf->getType() << ", ref " << vf->ref.count() << ", 0x" << vf << "]"; + + if(strncmp(p.parent->fullname(), vf->fullname(), p.parent->fullnameLen())) + p.os << " <-- {" << vf->fullname() << "} ***********"; + + p.os << std::endl; +} + +static void _DumpTreeRecursive(VFSDir *vd, void *user) +{ + _DbgParams& p = *((_DbgParams*)user); + + std::string sub = p.sp + " "; + + p.os << p.sp << "d|" << vd->name() << " [" << vd->getType() << ", ref " << vd->ref.count() << ", 0x" << vd << "]"; + + if(p.parent && strncmp(p.parent->fullname(), vd->fullname(), strlen(p.parent->fullname()))) + p.os << " <-- {" << vd->fullname() << "} ***********"; + p.os << std::endl; + + _DbgParams recP(p.os, vd, sub); + + vd->forEachDir(_DumpTreeRecursive, &recP); + + vd->forEachFile(_DumpFile, &recP); + +} + +void VFSHelper::debugDumpTree(std::ostream& os, VFSDir *start /* = NULL */) +{ + _DbgParams recP(os, NULL, ""); + VFSDir *d = start ? start : GetDirRoot(); + _DumpTreeRecursive(d, &recP); +} + + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSHelper.h b/ExternalLibs/ttvfs/VFSHelper.h new file mode 100644 index 0000000..accfa4a --- /dev/null +++ b/ExternalLibs/ttvfs/VFSHelper.h @@ -0,0 +1,191 @@ +// VFSHelper.h - glues it all together and makes use simple +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFSHELPER_H +#define VFSHELPER_H + +#include +#include +#include +#include + +#include "VFSAtomic.h" + + +VFS_NAMESPACE_START + +class VFSDir; +class VFSDirReal; +class VFSFile; +class VFSLoader; +class VFSArchiveLoader; + + +/** VFSHelper - extensible class to simplify working with the VFS tree */ +class VFSHelper +{ +public: + VFSHelper(); + virtual ~VFSHelper(); + + /** Creates the working tree. Required before any files or directories can be accessed. + Internally, it merges all individual VFS trees into one. If clear is true (default), + an existing merged tree is dropped, and old and previously added files removed. + (This is the recommended setting.) + Mount points and loaders are kept.*/ + virtual void Prepare(bool clear = true); + + /** Re-merges any files in the tree, and optionally reloads files on disk. + This is useful if files on disk were created or removed, and the tree needs to reflect these changes. + Calls Prepare(clear) internally. */ + virtual void Reload(bool fromDisk = false, bool clear = false, bool clearMountPoints = false); + + /** Reset an instance to its initial state. + Drops all archives, loaders, archive loaders, mount points, internal trees, ...*/ + virtual void Clear(void); + + /** Do cleanups from time to time. In base VFSHelper, this is a no-op. + Extensions may wish to override this method do do cleanup jobs. */ + virtual void ClearGarbage(void); + + /** Load all files from working directory (into an internal tree) */ + bool LoadFileSysRoot(bool recursive); + + /** Mount a directory in the tree to a different location. Requires a previous call to Prepare(). + This can be imagined like a symlink pointing to a different location. + Be careful not to create circles, this might technically work, + but confuses the reference counting, causing memory leaks. */ + bool Mount(const char *src, const char *dest, bool overwrite = true); + + /** Drops a directory from the tree. Internally, this calls Reload(false), + which is a heavy operation compared to Mount(). Be warned. */ + bool Unmount(const char *src, const char *dest); + + /** Merges a path into the tree. Requires a previous call to Prepare(). + By default the directory is added into the root directory of the merged tree. + Pass NULL to add the directory to its original location, + or any other path to add it to that explicit location. + If loadRec is true, load all subdirs recursively. + It is advised not to use this to re-add parts already in the tree; use Mount() instead. + Rule of thumb: If you called LoadFileSysRoot(), do not use this for subdirs. + Note: Directories mounted with this will return `where` as their full path if it was set. + Use GetMountPoint() to retrieve the underlying VFSDir object. */ + bool MountExternalPath(const char *path, const char *where = "", bool loadRec = false, bool overwrite = true); + + /** Adds a VFSDir object into the merged tree. If subdir is NULL (the default), + add into the subdir stored in the VFSDir object. The tree will be extended if target dir does not exist. + If overwrite is true (the default), files in the tree will be replaced if already existing. + Requires a previous call to Prepare(). + Like with Mount(); be careful not to create cycles. */ + bool AddVFSDir(VFSDir *dir, const char *subdir = NULL, bool overwrite = true); + + /** Add the contents of an archive file to the tree. By default, the archive can be addressed + like a folder, e.g. "path/to/example.zip/file.txt". + Set asSubdir to false to "unpack" the contents of the archive to the containing folder. + Optionally, the target subdir to mount into can be specified. (See AddVFSDir().) + Returns a pointer to the actual VFSDir object that represents the added archive, or NULL if failed. + The opaque pointer is passed directly to each loader and can contain additional parameters, + such as a password to open the file. + Read the comments in VFSArchiveLoader.h for an explanation how it works. If you have no idea, leave it NULL, + because it can easily cause a crash if not used carefully. */ + VFSDir *AddArchive(const char *arch, bool asSubdir = true, const char *subdir = NULL, void *opaque = NULL); + + /** Add a loader that can look for files on demand. + It is possible (but not a good idea) to add a loader multiple times. */ + void AddLoader(VFSLoader *ldr); + + /** Add an archive loader that can open archives of various types. + Whenever an archive file is requested to be opened by AddArchive(), + it is sent through each registered loader until one of them can recognize + the format and open it. An archive loader stays once registered. */ + void AddArchiveLoader(VFSArchiveLoader *ldr); + + /** Get a file from the merged tree. Requires a previous call to Prepare(). + Asks loaders if the file is not in the tree. If found by a loader, the file will be added to the tree. + The returned pointer is reference counted. In case the file pointer is stored elsewhere, + do ptr->ref++, and later ptr->ref--. This is to prevent the VFS tree from deleting the file when cleaning up. + Not necessary if the pointer is just retrieved and used, or temp. stored while the VFS tree is not modified. */ + VFSFile *GetFile(const char *fn); + + /** Get a directory from the merged tree. If create is true and the directory does not exist, + build the tree structure and return the newly created dir. NULL otherwise. + Requires a previous call to Prepare(). + Reference counted, same as GetFile(), look there for more info. */ + VFSDir *GetDir(const char* dn, bool create = false); + + /** Returns the tree root, which is usually the working directory. */ + VFSDir *GetDirRoot(void); + + /** Returns one of the root tree sources by their internal name. */ + VFSDir *GetBaseTree(const char *path); + + /** Returns one of the mount points' base directory + (The one that is normally not acessible) */ + VFSDir *GetMountPoint(const char *path); + + /** Remove a file or directory from the tree */ + //bool Remove(VFSFile *vf); + //bool Remove(VFSDir *dir); + //bool Remove(const char *name); // TODO: CODE ME + + inline void lock() { _mtx.Lock(); } + inline void unlock() { _mtx.Unlock(); } + inline Mutex& mutex() const { return _mtx; } + + // DEBUG STUFF + void debugDumpTree(std::ostream& os, VFSDir *start = NULL); + +protected: + + /** Drops the merged tree and allows fully re-creating it. + Overload to do additional cleanup if required. Invoked by Clear() and Prepare(true). */ + virtual void _cleanup(void); + + struct VDirEntry + { + VDirEntry() : vdir(NULL), overwrite(false) {} + VDirEntry(VFSDir *v, std::string mp, bool ow) : vdir(v), mountPoint(mp), overwrite(ow) {} + VFSDir *vdir; + std::string mountPoint; + bool overwrite; + }; + + struct BaseTreeEntry + { + std::string source; + VFSDir *dir; + }; + + typedef std::list VFSMountList; + typedef std::vector LoaderArray; + typedef std::vector ArchiveLoaderArray; + typedef std::vector DirArray; + + + void _StoreMountPoint(const VDirEntry& ve); + bool _RemoveMountPoint(const VDirEntry& ve); + void _ClearMountPoints(void); + + // the VFSDirs are merged in their declaration order. + // when merging, files already contained can be overwritten by files merged in later. + VFSDirReal *filesysRoot; // local files on disk (root dir) + + // VFSDirs from various sources are stored here, and will be merged into one final tree + // by Prepare(). + DirArray trees; + + // If files are not in the tree, maybe one of these is able to find it. + LoaderArray loaders; + + VFSDir *merged; // contains the merged virtual/actual file system tree + + mutable Mutex _mtx; + +private: + VFSMountList vlist; // all other trees added later, together with path to mount to + ArchiveLoaderArray archLdrs; +}; + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs/VFSInternal.h b/ExternalLibs/ttvfs/VFSInternal.h new file mode 100644 index 0000000..94c3189 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSInternal.h @@ -0,0 +1,57 @@ +// VFSInternal.h - misc things that are not required to be visible outside of the library. +// For conditions of distribution and use, see copyright notice in VFS.h + +// !! this file is supposed to be included ONLY from VFS*.cpp files. + +#ifndef VFS_INTERNAL_H +#define VFS_INTERNAL_H + +// checks to enforce correct including +#ifdef TTVFS_VFS_H +#error Oops, TTVFS_VFS_H is defined, someone messed up and included VFS.h wrongly. +#endif + +#include "VFSDefines.h" + +#include +#include +#include +#include + +VFS_NAMESPACE_START + +inline char *allocHelper(allocator_func alloc, size_t size) +{ + return alloc ? (char*)alloc(size) : new char[size]; +} + +inline char *allocHelperExtra(allocator_func alloc, size_t size, size_t extra) +{ + char *p = (char*)allocHelper(alloc, size + extra); + memset(p + size, 0, extra); + return p; +} + +template inline void deleteHelper(delete_func deletor, T *mem) +{ + if(deletor) + deletor(mem); + else + delete [] mem; +} + +VFS_NAMESPACE_END + + +#if _MSC_VER +# ifndef _CRT_SECURE_NO_WARNINGS +# define _CRT_SECURE_NO_WARNINGS +# endif +#ifndef _CRT_SECURE_NO_DEPRECATE +# define _CRT_SECURE_NO_DEPRECATE +#endif +# pragma warning(disable: 4355) // 'this' : used in base member initializer list +#endif + + +#endif diff --git a/ExternalLibs/ttvfs/VFSLoader.cpp b/ExternalLibs/ttvfs/VFSLoader.cpp new file mode 100644 index 0000000..5b13bae --- /dev/null +++ b/ExternalLibs/ttvfs/VFSLoader.cpp @@ -0,0 +1,121 @@ +// VFSLoader.cpp - late loading of files not in the tree +// For conditions of distribution and use, see copyright notice in VFS.h + +#include "VFSInternal.h" +#include "VFSTools.h" +#include "VFSFile.h" +#include "VFSDir.h" +#include "VFSLoader.h" + +VFS_NAMESPACE_START + +#if !defined(_WIN32) && defined(VFS_IGNORE_CASE) + +#include + +// based on code in PhysicsFS: http://icculus.org/physfs/ +static bool locateOneElement(char *buf) +{ + char *ptr; + DIR *dirp; + + ptr = strrchr(buf, '/'); // find entry at end of path. + + //printf("locateOneElem: buf='%s' ptr='%s'\n", ptr, buf); + + if (ptr == NULL) + { + dirp = opendir("."); + ptr = buf; + } + else + { + if(ptr != buf) // strip only if not abs path + *ptr = '\0'; + //printf("opendir: '%s'\n", buf); + dirp = opendir(buf); + *ptr = '/'; + ptr++; // point past dirsep to entry itself. + } + + //printf("dirp = %p\n", dirp); + + struct dirent *dent; + while ((dent = readdir(dirp)) != NULL) + { + if (strcasecmp(dent->d_name, ptr) == 0) + { + strcpy(ptr, dent->d_name); // found a match. Overwrite with this case. + closedir(dirp); + return true; + } + } + + // no match at all... + closedir(dirp); + return false; +} + +static bool findFileHarder(char *fn) +{ + char *ptr = fn; + bool found = true; + while ((ptr = strchr(ptr + 1, '/')) != 0) + { + *ptr = '\0'; + found = locateOneElement(fn); + *ptr = '/'; // restore path separator + if (!found) + return false; + } + + // check final element... + found = found && locateOneElement(fn); + + //printf("tt: Fixed case '%s' [%s]\n", fn, found ? "found" : "NOT FOUND"); // TEMP + return found; +} +#endif + + +VFSFile *VFSLoaderDisk::Load(const char *fn, const char * /*ignored*/) +{ + if(FileExists(fn)) + return new VFSFileReal(fn); // must contain full file name + + VFSFileReal *vf = NULL; + +#if !defined(_WIN32) && defined(VFS_IGNORE_CASE) + size_t s = strlen(fn); + char *t = (char*)VFS_STACK_ALLOC(s+1); + memcpy(t, fn, s+1); // copy terminating '\0' as well + if(findFileHarder(&t[0])) // fixes the filename on the way + vf = new VFSFileReal(&t[0]); + VFS_STACK_FREE(t); +#endif + + return vf; +} + +VFSDir *VFSLoaderDisk::LoadDir(const char *fn, const char * /*ignored*/) +{ + if(IsDirectory(fn)) + return new VFSDirReal(fn); // must contain full file name + + VFSDirReal *ret = NULL; + +#if !defined(_WIN32) && defined(VFS_IGNORE_CASE) + size_t s = strlen(fn); + char *t = (char*)VFS_STACK_ALLOC(s+1); + memcpy(t, fn, s+1); // copy terminating '\0' as well + if(findFileHarder(&t[0])) // fixes the filename on the way + { + ret = new VFSDirReal(&t[0]); + } + VFS_STACK_FREE(t); +#endif + + return ret; +} + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSLoader.h b/ExternalLibs/ttvfs/VFSLoader.h new file mode 100644 index 0000000..aac4023 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSLoader.h @@ -0,0 +1,35 @@ +// VFSLoader.h - late loading of files not in the tree +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFSLOADER_H +#define VFSLOADER_H + +#include +#include "VFSDefines.h" + +VFS_NAMESPACE_START + +class VFSFile; +class VFSDir; + +// VFSLoader - to be called if a file is not in the tree. +class VFSLoader +{ +public: + virtual ~VFSLoader() {} + virtual VFSFile *Load(const char *fn, const char *unmangled) = 0; + virtual VFSDir *LoadDir(const char *fn, const char *unmangled) { return NULL; } +}; + +class VFSLoaderDisk : public VFSLoader +{ +public: + virtual ~VFSLoaderDisk() {} + virtual VFSFile *Load(const char *fn, const char *unmangled); + virtual VFSDir *LoadDir(const char *fn, const char *unmangled); +}; + +VFS_NAMESPACE_END + + +#endif diff --git a/ExternalLibs/ttvfs/VFSSelfRefCounter.h b/ExternalLibs/ttvfs/VFSSelfRefCounter.h new file mode 100644 index 0000000..09eb4d1 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSSelfRefCounter.h @@ -0,0 +1,44 @@ +#ifndef SELFREFCOUNTER_H +#define SELFREFCOUNTER_H + +#include "VFSDefines.h" +#include "VFSAtomic.h" + +VFS_NAMESPACE_START + +// self must point to the object that holds the counter. +template class SelfRefCounter +{ +private: + T *self; + volatile int c; + SelfRefCounter(SelfRefCounter& r); // forbid copy constructor + inline unsigned int _deref(void) + { + volatile unsigned int cc = (unsigned int)Atomic_Decr(c); // copy c, in case we get deleted + if(DELSELF && !cc) + { + delete self; + } + + return cc; + } + +public: + SelfRefCounter(T *p): self(p), c(1) {} + ~SelfRefCounter() { /* DEBUG(ASSERT(c <= 1)); */ } // its ok if the last reference calls delete instead of _deref() + inline unsigned int count(void) { return c; } + + // post-increment (dummy int) + inline unsigned int operator++(int) { unsigned int cc = c; Atomic_Incr(c); return cc; } + inline unsigned int operator--(int) { unsigned int cc = c; _deref(); return cc; } + + // pre-increment + inline unsigned int operator++(void) { return (unsigned int)Atomic_Incr(c); } + inline unsigned int operator--(void) { return _deref(); } +}; + +VFS_NAMESPACE_END + + +#endif diff --git a/ExternalLibs/ttvfs/VFSSystemPaths.cpp b/ExternalLibs/ttvfs/VFSSystemPaths.cpp new file mode 100644 index 0000000..bb80209 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSSystemPaths.cpp @@ -0,0 +1,76 @@ +#ifdef _WIN32 +# include +#endif + +#include "VFSSystemPaths.h" +#include "VFSTools.h" +#include "VFSInternal.h" + +VFS_NAMESPACE_START + + +std::string GetUserDir() +{ +#ifdef _WIN32 + TCHAR szPath[MAX_PATH]; + if(SUCCEEDED(SHGetFolderPath(NULL, CSIDL_PROFILE, NULL, 0, szPath))) + { + return szPath; + } + + // Fallback + const char *user = getenv("USERPROFILE"); + if(user) + return user; + + // Sorry, windoze :( + return ""; + +#else // Assume POSIX compliance + const char *user = getenv("HOME"); + if(user) + return user; +#endif +} + +std::string GetAppDir(const char *appname) +{ + std::string ret; + +#ifdef _WIN32 + + TCHAR szPath[MAX_PATH]; + + if(SUCCEEDED(SHGetFolderPath(NULL, CSIDL_APPDATA, NULL, 0, szPath))) + { + ret = szPath; + } + else + { + // Fallback + const char *user = getenv("APPDATA"); + if(user) + ret = user; + else + ret = "."; // Seems we have no other choice + } + + return FixPath(ret + '/' + appname); + +#else // Assume POSIX compliance + + const char *user = getenv("HOME"); + if(user) + ret = user; + else + ret = "."; + + return FixPath(ret + "/." + appname); // just in case + +#endif +} + + + + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSSystemPaths.h b/ExternalLibs/ttvfs/VFSSystemPaths.h new file mode 100644 index 0000000..4488b13 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSSystemPaths.h @@ -0,0 +1,20 @@ +#ifndef VFS_SYSTEM_PATHS_H +#define VFS_SYSTEM_PATHS_H + +#include +#include +#include "VFSDefines.h" + +VFS_NAMESPACE_START + +// Returns the current user's home directory, without terminating '/' +std::string GetUserDir(); + +// Returns a per-user directory suitable to store application specific data, +// without terminating '/' +std::string GetAppDir(const char *appname); + + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs/VFSTools.cpp b/ExternalLibs/ttvfs/VFSTools.cpp new file mode 100644 index 0000000..11165c1 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSTools.cpp @@ -0,0 +1,504 @@ +// VFSTools.cpp - useful functions and misc stuff +// For conditions of distribution and use, see copyright notice in VFS.h + +#include "VFSInternal.h" +#include "VFSFileFuncs.h" + +#include +#include +#include +#include +#include + +#include "VFSTools.h" + + +#if _WIN32 +# define WIN32_LEAN_AND_MEAN +# include +#else +# include +# include +# include +# include +#endif + +VFS_NAMESPACE_START + +std::string stringToLower(std::string s) +{ + std::transform(s.begin(), s.end(), s.begin(), tolower); + return s; +} + +std::string stringToUpper(std::string s) +{ + std::transform(s.begin(), s.end(), s.begin(), toupper); + return s; +} + +void makeLowercase(std::string& s) +{ + std::transform(s.begin(), s.end(), s.begin(), tolower); +} + +void makeUppercase(std::string& s) +{ + std::transform(s.begin(), s.end(), s.begin(), toupper); +} + +#if !_WIN32 +static bool _IsFile(const char *path, dirent *dp) +{ + switch(dp->d_type) + { + case DT_DIR: + return false; + case DT_LNK: + { + std::string fullname = path; + fullname += '/'; + fullname += dp->d_name; + struct stat statbuf; + if(stat(fullname.c_str(), &statbuf)) + return false; // error + return !S_ISDIR(statbuf.st_mode); + } + // TODO: for now, we consider other file types as regular files + default: + ; + } + return true; +} + +static bool _IsDir(const char *path, dirent *dp) +{ + switch(dp->d_type) + { + case DT_DIR: + return true; + case DT_LNK: + { + std::string fullname = path; + fullname += '/'; + fullname += dp->d_name; + struct stat statbuf; + if(stat(fullname.c_str(), &statbuf)) + return false; // error + return S_ISDIR(statbuf.st_mode); + } + default: + ; + } + return false; +} +#endif + +// returns list of *plain* file names in given directory, +// without paths, and without anything else +void GetFileList(const char *path, StringList& files) +{ +#if !_WIN32 + DIR * dirp; + struct dirent * dp; + dirp = opendir(path); + if(dirp) + { + while((dp=readdir(dirp)) != NULL) + { + if (_IsFile(path, dp)) // only add if it is not a directory + { + std::string s(dp->d_name); + files.push_back(s); + } + } + closedir(dirp); + } + +# else + + WIN32_FIND_DATA fil; + std::string search(path); + MakeSlashTerminated(search); + search += "*"; + HANDLE hFil = FindFirstFile(search.c_str(),&fil); + if(hFil != INVALID_HANDLE_VALUE) + { + do + { + if(!(fil.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)) + { + std::string s(fil.cFileName); + files.push_back(s); + } + } + while(FindNextFile(hFil, &fil)); + + FindClose(hFil); + } + +# endif +} + +// returns a list of directory names in the given directory, *without* the source dir. +// if getting the dir list recursively, all paths are added, except *again* the top source dir beeing queried. +void GetDirList(const char *path, StringList &dirs, bool recursive /* = false */) +{ +#if !_WIN32 + DIR * dirp; + struct dirent * dp; + dirp = opendir(path); + if(dirp) + { + while((dp = readdir(dirp))) // assignment is intentional + { + if (_IsDir(path, dp)) // only add if it is a directory + { + if(strcmp(dp->d_name, ".") != 0 && strcmp(dp->d_name, "..") != 0) + { + dirs.push_back(dp->d_name); + if (recursive) // needing a better way to do that + { + std::deque newdirs; + GetDirList(dp->d_name, newdirs, true); + std::string d(dp->d_name); + for(std::deque::iterator it = newdirs.begin(); it != newdirs.end(); ++it) + dirs.push_back(d + *it); + } + } + } + } + closedir(dirp); + } + +#else + + std::string search(path); + MakeSlashTerminated(search); + search += "*"; + WIN32_FIND_DATA fil; + HANDLE hFil = FindFirstFile(search.c_str(),&fil); + if(hFil != INVALID_HANDLE_VALUE) + { + do + { + if( fil.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY ) + { + if (!strcmp(fil.cFileName, ".") || !strcmp(fil.cFileName, "..")) + continue; + + std::string d(fil.cFileName); + dirs.push_back(d); + + if (recursive) // need a better way to do that + { + StringList newdirs; + GetDirList(d.c_str(), newdirs, true); + + for(std::deque::iterator it = newdirs.begin(); it != newdirs.end(); ++it) + dirs.push_back(d + *it); + } + } + } + while(FindNextFile(hFil, &fil)); + + FindClose(hFil); + } + +#endif +} + +bool FileExists(const char *fn) +{ +#ifdef _WIN32 + void *fp = real_fopen(fn, "rb"); + if(fp) + { + real_fclose(fp); + return true; + } + return false; +#else + return access(fn, F_OK) == 0; +#endif +} + +// must return true if creating the directory was successful, or already exists +bool CreateDir(const char *dir) +{ + if(IsDirectory(dir)) // do not try to create if it already exists + return true; + bool result; +# if _WIN32 + result = !!::CreateDirectory(dir, NULL); +# else + result = !mkdir(dir, S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH); +#endif + return result; +} + +bool CreateDirRec(const char *dir) +{ + if(IsDirectory(dir)) + return true; + bool result = true; + StringList li; + StrSplit(dir, "/\\", li, false); + std::string d; + d.reserve(strlen(dir)); + bool last; + for(StringList::iterator it = li.begin(); it != li.end(); ++it) + { + d += *it; + last = CreateDir(d.c_str()); + result = last && result; + d += '/'; + } + return result || last; +} + +vfspos GetFileSize(const char* fn) +{ + if(!fn || !*fn) + return 0; + void *fp = real_fopen(fn, "rb"); + if(!fp) + return 0; + real_fseek(fp, 0, SEEK_END); + vfspos s = real_ftell(fp); + real_fclose(fp); + + return s == npos ? 0 : s; +} + +std::string FixSlashes(const std::string& s) +{ + std::string r; + r.reserve(s.length() + 1); + char last = 0, cur; + for(size_t i = 0; i < s.length(); ++i) + { + cur = s[i]; + if(cur == '\\') + cur = '/'; + if(last == '/' && cur == '/') + continue; + r += cur; + last = cur; + } + return r; +} + +std::string FixPath(const std::string& s) +{ + if(s.empty()) + return s; + const char *p = s.c_str(); + while(p[0] == '.' && (p[1] == '/' || p[1] == '\\')) + p += 2; + if(!*p) + return ""; + char end = s[s.length() - 1]; + if(end == '/' || end == '\\') + { + std::string r(p); + r.erase(r.length() - 1); // strip trailing '/' + return FixSlashes(r); + } + return FixSlashes(p); +} + +bool IsDirectory(const char *s) +{ +#if _WIN32 + DWORD dwFileAttr = GetFileAttributes(s); + if(dwFileAttr == INVALID_FILE_ATTRIBUTES) + return false; + return !!(dwFileAttr & FILE_ATTRIBUTE_DIRECTORY); +#else + if ( access( s, 0 ) == 0 ) + { + struct stat status; + stat( s, &status ); + return status.st_mode & S_IFDIR; // FIXME: what about symlinks here? + } + return false; +#endif +} + +void MakeSlashTerminated(std::string& s) +{ + if(s.length() && s[s.length() - 1] != '/') + s += '/'; +} + +// extracts the file name from a given path +const char *PathToFileName(const char *str) +{ + const char *p = strrchr(str, '/'); + return p ? p+1 : str; +} + +std::string StripFileExtension(const std::string& s) +{ + size_t pos = s.find_last_of('.'); + size_t pos2 = s.find_last_of('/'); + if(pos != std::string::npos && (pos2 < pos || pos2 == std::string::npos)) + return s.substr(0, pos); + + return s; +} + +std::string StripLastPath(const std::string& s) +{ + if(s.empty()) + return ""; + + if(s[s.length() - 1] == '/') + return StripLastPath(s.substr(0, s.length() - 1)); + + size_t pos = s.find_last_of('/'); + if(pos == std::string::npos) + return ""; // nothing remains + + return s.substr(0, pos); +} + +void GetFileListRecursive(std::string dir, StringList& files, bool withQueriedDir /* = false */) +{ + std::stack stk; + + if(withQueriedDir) + { + stk.push(dir); + while(stk.size()) + { + dir = stk.top(); + stk.pop(); + MakeSlashTerminated(dir); + + StringList li; + GetFileList(dir.c_str(), li); + for(std::deque::iterator it = li.begin(); it != li.end(); ++it) + files.push_back(dir + *it); + + li.clear(); + GetDirList(dir.c_str(), li, true); + for(std::deque::iterator it = li.begin(); it != li.end(); ++it) + stk.push(dir + *it); + } + } + else + { + std::string topdir = dir; + MakeSlashTerminated(topdir); + stk.push(""); + while(stk.size()) + { + dir = stk.top(); + stk.pop(); + MakeSlashTerminated(dir); + + StringList li; + dir = topdir + dir; + GetFileList(dir.c_str(), li); + for(std::deque::iterator it = li.begin(); it != li.end(); ++it) + files.push_back(dir + *it); + + li.clear(); + GetDirList(dir.c_str(), li, true); + for(std::deque::iterator it = li.begin(); it != li.end(); ++it) + stk.push(dir + *it); + } + } +} + +// from http://board.byuu.org/viewtopic.php?f=10&t=1089&start=15 +bool WildcardMatch(const char *str, const char *pattern) +{ + const char *cp = 0, *mp = 0; + while(*str && *pattern != '*') + { + if(*pattern != *str && *pattern != '?') + return false; + pattern++, str++; + } + + while(*str) + { + if(*pattern == '*') + { + if(!*++pattern) + return 1; + mp = pattern; + cp = str + 1; + } + else if(*pattern == *str || *pattern == '?') + { + ++pattern; + ++str; + } + else + { + pattern = mp; + str = cp++; + } + } + + while(*pattern++ == '*'); + + return !*pattern; +} + +// copy strings, mangling newlines to system standard +// windows has 13+10 +// *nix has 10 +// exotic systems may have 10+13 +size_t strnNLcpy(char *dst, const char *src, unsigned int n /* = -1 */) +{ + char *olddst = dst; + bool had10 = false, had13 = false; + + --n; // reserve 1 for \0 at end + + while(*src && n) + { + if((had13 && *src == 10) || (had10 && *src == 13)) + { + ++src; // last was already mangled + had13 = had10 = false; // processed one CRLF pair + continue; + } + had10 = *src == 10; + had13 = *src == 13; + + if(had10 || had13) + { + *dst++ = '\n'; + ++src; + } + else + *dst++ = *src++; + + --n; + } + + *dst++ = 0; + + return dst - olddst; +} + +// Directly appends 'add' to 's', ensuring that 's' is null-terminated. +// Returns the next write position for fastcat (the null byte at the end). +char *fastcat(char *s, const char *add) +{ + size_t len = strlen(add); + memcpy(s, add, len); + s += len; + *(s + 1) = 0; + return s; +} + + + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs/VFSTools.h b/ExternalLibs/ttvfs/VFSTools.h new file mode 100644 index 0000000..36d3832 --- /dev/null +++ b/ExternalLibs/ttvfs/VFSTools.h @@ -0,0 +1,100 @@ +// VFSTools.h - useful functions and misc stuff +// For conditions of distribution and use, see copyright notice in VFS.h + +#ifndef VFS_TOOLS_H +#define VFS_TOOLS_H + +#include +#include + +#include "VFSDefines.h" + +VFS_NAMESPACE_START + +typedef std::deque StringList; + +std::string stringToUpper(const std::string& s); +std::string stringToLower(const std::string& s); +void makeUppercase(std::string& s); +void makeLowercase(std::string& s); +void GetFileList(const char *, StringList& files); +void GetDirList(const char *, StringList& dirs, bool recursive = false); +bool FileExists(const char *); +bool IsDirectory(const char *); +bool CreateDir(const char*); +bool CreateDirRec(const char*); +vfspos GetFileSize(const char*); +std::string FixSlashes(const std::string& s); +std::string FixPath(const std::string& s); +const char *PathToFileName(const char *str); +void MakeSlashTerminated(std::string& s); +std::string StripFileExtension(const std::string& s); +std::string StripLastPath(const std::string& s); +void GetFileListRecursive(std::string dir, StringList& files, bool withQueriedDir = false); +bool WildcardMatch(const char *str, const char *pattern); +size_t strnNLcpy(char *dst, const char *src, unsigned int n = -1); +char *fastcat(char *s, const char *add); + +template void StrSplit(const std::string &src, const std::string &sep, T& container, bool keepEmpty = false) +{ + std::string s; + for (std::string::const_iterator i = src.begin(); i != src.end(); i++) + { + if (sep.find(*i) != std::string::npos) + { + if (keepEmpty || s.length()) + container.push_back(s); + s = ""; + } + else + { + s += *i; + } + } + if (keepEmpty || s.length()) + container.push_back(s); +} + +inline static size_t stringhash(const char *s) +{ + size_t h = 0; + for( ; *s; ++s) + { + h += *s; + h += ( h << 10 ); + h ^= ( h >> 6 ); + } + + h += ( h << 3 ); + h ^= ( h >> 11 ); + h += ( h << 15 ); + + return h; +} + +inline static size_t stringhash_nocase(const char *s) +{ + size_t h = 0; + for( ; *s; ++s) + { + h += tolower(*s); + h += ( h << 10 ); + h ^= ( h >> 6 ); + } + + h += ( h << 3 ); + h ^= ( h >> 11 ); + h += ( h << 15 ); + + return h; +} + +#ifdef VFS_IGNORE_CASE +# define STRINGHASH(s) stringhash_nocase(s) +#else +# define STRINGHASH(s) stringhash(s) +#endif + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs_zip/CMakeLists.txt b/ExternalLibs/ttvfs_zip/CMakeLists.txt new file mode 100644 index 0000000..6cc7f5c --- /dev/null +++ b/ExternalLibs/ttvfs_zip/CMakeLists.txt @@ -0,0 +1,15 @@ + +set(ttvfs_zip_SRC + VFSDirZip.cpp + VFSDirZip.h + VFSFileZip.cpp + VFSFileZip.h + VFSZipArchiveLoader.cpp + VFSZipArchiveLoader.h + miniz.c + miniz.h +) + +include_directories(${TTVFS_INCLUDE_DIRS}) + +add_library(ttvfs_zip ${ttvfs_zip_SRC}) diff --git a/ExternalLibs/ttvfs_zip/VFSDirZip.cpp b/ExternalLibs/ttvfs_zip/VFSDirZip.cpp new file mode 100644 index 0000000..4f04b1c --- /dev/null +++ b/ExternalLibs/ttvfs_zip/VFSDirZip.cpp @@ -0,0 +1,107 @@ +#include "VFSFileZip.h" +#include "VFSDirZip.h" +#include "VFSTools.h" + +#include "VFSInternal.h" + +#include "miniz.h" + +VFS_NAMESPACE_START + + +static size_t zip_read_func(void *pOpaque, mz_uint64 file_ofs, void *pBuf, size_t n) +{ + VFSFile *vf = (VFSFile*)pOpaque; + mz_int64 cur_ofs = vf->getpos(); + if((mz_int64)file_ofs < 0) + return 0; + if(cur_ofs != (mz_int64)file_ofs && !vf->seek((vfspos)file_ofs)) + return 0; + return vf->read(pBuf, n); +} + +static bool zip_reader_init_vfsfile(mz_zip_archive *pZip, VFSFile *vf, mz_uint32 flags) +{ + if(!(pZip || vf)) + return false; + vf->open("rb"); + mz_uint64 file_size = vf->size(); + if(!file_size) + { + vf->close(); + return false; + } + pZip->m_pRead = zip_read_func; + pZip->m_pIO_opaque = vf; + if (!mz_zip_reader_init(pZip, file_size, flags)) + { + vf->close(); + return false; + } + return true; +} + + +VFSDirZip::VFSDirZip(VFSFile *zf) +: VFSDir(zf->fullname()), _zf(zf) +{ + _zf->ref++; + _setOrigin(this); + memset(&_zip, 0, sizeof(_zip)); +} + +VFSDirZip::~VFSDirZip() +{ + close(); + _zf->ref--; +} + +bool VFSDirZip::close(void) +{ + mz_zip_reader_end(&_zip); + _zf->close(); + return true; +} + +VFSDir *VFSDirZip::createNew(const char *dir) const +{ + return VFSDir::createNew(dir); // inside a Zip file; only the base dir can be a real VFSDirZip. +} + +unsigned int VFSDirZip::load(bool /*ignored*/) +{ + close(); + + if(!zip_reader_init_vfsfile(&_zip, _zf, 0)) + return 0; + + unsigned int files = mz_zip_reader_get_num_files(&_zip); + + mz_zip_archive_file_stat fs; + for (unsigned int i = 0; i < files; ++i) + { + // FIXME: do we want empty dirs in the tree? + if(mz_zip_reader_is_file_a_directory(&_zip, i)) + continue; + if(mz_zip_reader_is_file_encrypted(&_zip, i)) + continue; + if(!mz_zip_reader_file_stat(&_zip, i, &fs)) + continue; + if(getFile(fs.m_filename)) + continue; + + VFSFileZip *vf = new VFSFileZip(&_zip); + vf->_setOrigin(this); + memcpy(vf->getZipFileStat(), &fs, sizeof(mz_zip_archive_file_stat)); + vf->_init(); + addRecursive(vf, true, VFSDir::NONE); + vf->ref--; + } + + // Not necessary to keep open all the time, VFSFileZip will re-open the archive if needed + //close(); + + return files; +} + +VFS_NAMESPACE_END \ No newline at end of file diff --git a/ExternalLibs/ttvfs_zip/VFSDirZip.h b/ExternalLibs/ttvfs_zip/VFSDirZip.h new file mode 100644 index 0000000..e15adab --- /dev/null +++ b/ExternalLibs/ttvfs_zip/VFSDirZip.h @@ -0,0 +1,32 @@ +#ifndef VFSDIR_ZIP_H +#define VFSDIR_ZIP_H + +#include "VFSDir.h" + +#include "miniz.h" + +VFS_NAMESPACE_START + +class VFSFile; + +class VFSDirZip : public VFSDir +{ +public: + VFSDirZip(VFSFile *zf); + virtual ~VFSDirZip(); + virtual unsigned int load(bool recusive); + virtual VFSDir *createNew(const char *dir) const; + virtual const char *getType() const { return "VFSDirZip"; } + virtual bool close(); + + inline mz_zip_archive *getZip() { return &_zip; } + +protected: + VFSFile *_zf; + mz_zip_archive _zip; + std::string zipfilename; +}; + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs_zip/VFSFileZip.cpp b/ExternalLibs/ttvfs_zip/VFSFileZip.cpp new file mode 100644 index 0000000..9bacaf9 --- /dev/null +++ b/ExternalLibs/ttvfs_zip/VFSFileZip.cpp @@ -0,0 +1,197 @@ +#include "VFSFileZip.h" +#include "VFSInternal.h" +#include "VFSTools.h" +#include "VFSDir.h" + +VFS_NAMESPACE_START + +// From miniz.c +//#define MZ_ZIP_MODE_READING 2 + + +static bool zip_reader_reopen_vfsfile(mz_zip_archive *pZip, mz_uint32 flags) +{ + if(!(pZip && pZip->m_pIO_opaque && pZip->m_pRead)) + return false; + VFSFile *vf = (VFSFile*)pZip->m_pIO_opaque; + if(!vf->isopen()) + if(!vf->open("rb")) + return false; + if(pZip->m_zip_mode == MZ_ZIP_MODE_READING) + return true; + mz_uint64 file_size = vf->size(); + if(!file_size) + { + vf->close(); + return false; + } + if (!mz_zip_reader_init(pZip, file_size, flags)) + { + vf->close(); + return false; + } + return true; +} + + +VFSFileZip::VFSFileZip(mz_zip_archive *zip) +: VFSFile(NULL), _fixedStr(NULL), _zip(zip) +{ + _mode = "b"; // binary mode by default + _pos = 0; +} + +void VFSFileZip::_init() +{ + _setName(_zipstat.m_filename); +} + +VFSFileZip::~VFSFileZip() +{ + dropBuf(true); +} + +bool VFSFileZip::open(const char *mode /* = NULL */) +{ + VFS_GUARD_OPT(this); + + _pos = 0; + if(mode) + { + if(_fixedStr && _mode != mode) + { + delete [] _fixedStr; + _fixedStr = NULL; + } + + _mode = mode; + } + return true; // does not have to be opened +} + +bool VFSFileZip::isopen(void) const +{ + return true; // is always open +} + +bool VFSFileZip::iseof(void) const +{ + VFS_GUARD_OPT(this); + return _pos >= _zipstat.m_uncomp_size; +} + +bool VFSFileZip::close(void) +{ + //return flush(); // TODO: write to zip file on close + + return true; +} + +bool VFSFileZip::seek(vfspos pos) +{ + if(pos >= 0xFFFFFFFF) // zip files have uint32 range only + return false; + + VFS_GUARD_OPT(this); + _pos = (unsigned int)pos; + return true; +} + +bool VFSFileZip::flush(void) +{ + // FIXME: use this to actually write to zip file? + return false; +} + +vfspos VFSFileZip::getpos(void) const +{ + VFS_GUARD_OPT(this); + return _pos; +} + +unsigned int VFSFileZip::read(void *dst, unsigned int bytes) +{ + VFS_GUARD_OPT(this); + char *mem = (char*)getBuf(); + char *startptr = mem + _pos; + char *endptr = mem + size(); + bytes = std::min((unsigned int)(endptr - startptr), bytes); // limit in case reading over buffer size + if(_mode.find('b') == std::string::npos) + strnNLcpy((char*)dst, (const char*)startptr, bytes); // non-binary == text mode + else + memcpy(dst, startptr, bytes); // binary copy + _pos += bytes; + return bytes; +} + +unsigned int VFSFileZip::write(const void *src, unsigned int bytes) +{ + /*VFS_GUARD_OPT(this); + if(getpos() + bytes >= size()) + size(getpos() + bytes); // enlarge if necessary + + memcpy(_buf + getpos(), src, bytes); + + // TODO: implement actually writing to the Zip file. + + return bytes;*/ + + return VFSFile::write(src, bytes); +} + +vfspos VFSFileZip::size(void) +{ + VFS_GUARD_OPT(this); + return (vfspos)_zipstat.m_uncomp_size; +} + +const void *VFSFileZip::getBuf(allocator_func alloc /* = NULL */, delete_func del /* = NULL */) +{ + assert(!alloc == !del); // either both or none may be defined. Checked extra early to prevent possible errors later. + + VFS_GUARD_OPT(this); + // _fixedStr gets deleted on mode change, so doing this check here is fine + if(_fixedStr) + return _fixedStr; + + if(!_buf) + { + size_t sz = (size_t)size(); + _buf = allocHelperExtra(alloc, sz, 4); + if(!_buf) + return NULL; + _delfunc = del; + + if(!zip_reader_reopen_vfsfile(_zip, 0)) + return false; // can happen if the underlying zip file was deleted + if(!mz_zip_reader_extract_to_mem(_zip, _zipstat.m_file_index, _buf, sz, 0)) + return false; // this should not happen + + if(_mode.find("b") == std::string::npos) // text mode? + { + _fixedStr = allocHelperExtra(alloc, sz, 4); + strnNLcpy(_fixedStr, (const char*)_buf); + + // FIXME: is this really correct? + VFSFile::dropBuf(true); + + return _fixedStr; + } + + } + + return _buf; +} + +void VFSFileZip::dropBuf(bool del) +{ + VFSFile::dropBuf(del); + + VFS_GUARD_OPT(this); + if(del) + delBuf(_fixedStr); + _fixedStr = NULL; + +} + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs_zip/VFSFileZip.h b/ExternalLibs/ttvfs_zip/VFSFileZip.h new file mode 100644 index 0000000..b860a94 --- /dev/null +++ b/ExternalLibs/ttvfs_zip/VFSFileZip.h @@ -0,0 +1,41 @@ +#ifndef VFSFILE_ZIP_H +#define VFSFILE_ZIP_H + +#include "VFSFile.h" +#include "miniz.h" + +VFS_NAMESPACE_START + +class VFSFileZip : public VFSFile +{ +public: + VFSFileZip(mz_zip_archive *zip); + virtual ~VFSFileZip(); + virtual bool open(const char *mode = NULL); + virtual bool isopen(void) const; + virtual bool iseof(void) const; + virtual bool close(void); + virtual bool seek(vfspos pos); + virtual bool flush(void); + virtual vfspos getpos(void) const; + virtual unsigned int read(void *dst, unsigned int bytes); + virtual unsigned int write(const void *src, unsigned int bytes); + virtual vfspos size(void); + virtual const void *getBuf(allocator_func alloc = NULL, delete_func del = NULL); + virtual void dropBuf(bool del); + virtual const char *getType(void) const { return "Zip"; } + + inline mz_zip_archive_file_stat *getZipFileStat(void) { return &_zipstat; } + void _init(); + +protected: + unsigned int _pos; + std::string _mode; + mz_zip_archive_file_stat _zipstat; + mz_zip_archive *_zip; + char *_fixedStr; // for \n fixed string in text mode. cleared when mode is changed +}; + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs_zip/VFSZipArchiveLoader.cpp b/ExternalLibs/ttvfs_zip/VFSZipArchiveLoader.cpp new file mode 100644 index 0000000..b12cf14 --- /dev/null +++ b/ExternalLibs/ttvfs_zip/VFSZipArchiveLoader.cpp @@ -0,0 +1,17 @@ +#include "VFSInternal.h" +#include "VFSZipArchiveLoader.h" +#include "VFSDirZip.h" + +VFS_NAMESPACE_START + +VFSDir *VFSZipArchiveLoader::Load(VFSFile *arch, VFSLoader ** /*unused*/, void * /*unused*/) +{ + VFSDirZip *vd = new VFSDirZip(arch); + if(vd->load(true)) + return vd; + + vd->ref--; + return NULL; +} + +VFS_NAMESPACE_END diff --git a/ExternalLibs/ttvfs_zip/VFSZipArchiveLoader.h b/ExternalLibs/ttvfs_zip/VFSZipArchiveLoader.h new file mode 100644 index 0000000..fce91e0 --- /dev/null +++ b/ExternalLibs/ttvfs_zip/VFSZipArchiveLoader.h @@ -0,0 +1,17 @@ +#ifndef VFS_ZIP_ARCHIVE_LOADER_H +#define VFS_ZIP_ARCHIVE_LOADER_H + +#include "VFSArchiveLoader.h" + +VFS_NAMESPACE_START + +class VFSZipArchiveLoader : public VFSArchiveLoader +{ +public: + virtual ~VFSZipArchiveLoader() {} + virtual VFSDir *Load(VFSFile *arch, VFSLoader **ldr, void *opaque = NULL); +}; + +VFS_NAMESPACE_END + +#endif diff --git a/ExternalLibs/ttvfs_zip/miniz.c b/ExternalLibs/ttvfs_zip/miniz.c new file mode 100644 index 0000000..92ccde9 --- /dev/null +++ b/ExternalLibs/ttvfs_zip/miniz.c @@ -0,0 +1,4834 @@ +/* miniz.c v1.14 - public domain deflate/inflate, zlib-subset, ZIP reading/writing/appending, PNG writing + See "unlicense" statement at the end of this file. + Rich Geldreich , last updated May 20, 2012 + Implements RFC 1950: http://www.ietf.org/rfc/rfc1950.txt and RFC 1951: http://www.ietf.org/rfc/rfc1951.txt + + Most API's defined in miniz.c are optional. For example, to disable the archive related functions just define + MINIZ_NO_ARCHIVE_APIS, or to get rid of all stdio usage define MINIZ_NO_STDIO (see the list below for more macros). + + * Change History + 5/20/12 v1.14 - MinGW32/64 GCC 4.6.1 compiler fixes: added MZ_FORCEINLINE, #include (thanks fermtect). + 5/19/12 v1.13 - From jason@cornsyrup.org and kelwert@mtu.edu - Fix mz_crc32() so it doesn't compute the wrong CRC-32's when mz_ulong is 64-bit. + Temporarily/locally slammed in "typedef unsigned long mz_ulong" and re-ran a randomized regression test on ~500k files. + Eliminated a bunch of warnings when compiling with GCC 32-bit/64. + Ran all examples, miniz.c, and tinfl.c through MSVC 2008's /analyze (static analysis) option and fixed all warnings (except for the silly + "Use of the comma-operator in a tested expression.." analysis warning, which I purposely use to work around a MSVC compiler warning). + Created 32-bit and 64-bit Codeblocks projects/workspace. Built and tested Linux executables. The codeblocks workspace is compatible with Linux+Win32/x64. + Added miniz_tester solution/project, which is a useful little app derived from LZHAM's tester app that I use as part of the regression test. + Ran miniz.c and tinfl.c through another series of regression testing on ~500,000 files and archives. + Modified example5.c so it purposely disables a bunch of high-level functionality (MINIZ_NO_STDIO, etc.). (Thanks to corysama for the MINIZ_NO_STDIO bug report.) + Fix ftell() usage in examples so they exit with an error on files which are too large (a limitation of the examples, not miniz itself). + 4/12/12 v1.12 - More comments, added low-level example5.c, fixed a couple minor level_and_flags issues in the archive API's. + level_and_flags can now be set to MZ_DEFAULT_COMPRESSION. Thanks to Bruce Dawson for the feedback/bug report. + 5/28/11 v1.11 - Added statement from unlicense.org + 5/27/11 v1.10 - Substantial compressor optimizations: + Level 1 is now ~4x faster than before. The L1 compressor's throughput now varies between 70-110MB/sec. on a + Core i7 (actual throughput varies depending on the type of data, and x64 vs. x86). + Improved baseline L2-L9 compression perf. Also, greatly improved compression perf. issues on some file types. + Refactored the compression code for better readability and maintainability. + Added level 10 compression level (L10 has slightly better ratio than level 9, but could have a potentially large + drop in throughput on some files). + 5/15/11 v1.09 - Initial stable release. + + * Low-level Deflate/Inflate implementation notes: + + Compression: Use the "tdefl" API's. The compressor supports raw, static, and dynamic blocks, lazy or + greedy parsing, match length filtering, RLE-only, and Huffman-only streams. It performs and compresses + approximately as well as zlib. + + Decompression: Use the "tinfl" API's. The entire decompressor is implemented as a single function + coroutine: see tinfl_decompress(). It supports decompression into a 32KB (or larger power of 2) wrapping buffer, or into a memory + block large enough to hold the entire file. + + The low-level tdefl/tinfl API's do not make any use of dynamic memory allocation. + + * zlib-style API notes: + + miniz.c implements a fairly large subset of zlib. There's enough functionality present for it to be a drop-in + zlib replacement in many apps: + The z_stream struct, optional memory allocation callbacks + deflateInit/deflateInit2/deflate/deflateReset/deflateEnd/deflateBound + inflateInit/inflateInit2/inflate/inflateEnd + compress, compress2, compressBound, uncompress + CRC-32, Adler-32 - Using modern, minimal code size, CPU cache friendly routines. + Supports raw deflate streams or standard zlib streams with adler-32 checking. + + Limitations: + The callback API's are not implemented yet. No support for gzip headers or zlib static dictionaries. + I've tried to closely emulate zlib's various flavors of stream flushing and return status codes, but + there are no guarantees that miniz.c pulls this off perfectly. + + * PNG writing: See the tdefl_write_image_to_png_file_in_memory() function, originally written by + Alex Evans. Supports 1-4 bytes/pixel images. + + * ZIP archive API notes: + + The ZIP archive API's where designed with simplicity and efficiency in mind, with just enough abstraction to + get the job done with minimal fuss. There are simple API's to retrieve file information, read files from + existing archives, create new archives, append new files to existing archives, or clone archive data from + one archive to another. It supports archives located in memory or the heap, on disk (using stdio.h), + or you can specify custom file read/write callbacks. + + - Archive reading: Just call this function to read a single file from a disk archive: + + void *mz_zip_extract_archive_file_to_heap(const char *pZip_filename, const char *pArchive_name, + size_t *pSize, mz_uint zip_flags); + + For more complex cases, use the "mz_zip_reader" functions. Upon opening an archive, the entire central + directory is located and read as-is into memory, and subsequent file access only occurs when reading individual files. + + - Archives file scanning: The simple way is to use this function to scan a loaded archive for a specific file: + + int mz_zip_reader_locate_file(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags); + + The locate operation can optionally check file comments too, which (as one example) can be used to identify + multiple versions of the same file in an archive. This function uses a simple linear search through the central + directory, so it's not very fast. + + Alternately, you can iterate through all the files in an archive (using mz_zip_reader_get_num_files()) and + retrieve detailed info on each file by calling mz_zip_reader_file_stat(). + + - Archive creation: Use the "mz_zip_writer" functions. The ZIP writer immediately writes compressed file data + to disk and builds an exact image of the central directory in memory. The central directory image is written + all at once at the end of the archive file when the archive is finalized. + + The archive writer can optionally align each file's local header and file data to any power of 2 alignment, + which can be useful when the archive will be read from optical media. Also, the writer supports placing + arbitrary data blobs at the very beginning of ZIP archives. Archives written using either feature are still + readable by any ZIP tool. + + - Archive appending: The simple way to add a single file to an archive is to call this function: + + mz_bool mz_zip_add_mem_to_archive_file_in_place(const char *pZip_filename, const char *pArchive_name, + const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags); + + The archive will be created if it doesn't already exist, otherwise it'll be appended to. + Note the appending is done in-place and is not an atomic operation, so if something goes wrong + during the operation it's possible the archive could be left without a central directory (although the local + file headers and file data will be fine, so the archive will be recoverable). + + For more complex archive modification scenarios: + 1. The safest way is to use a mz_zip_reader to read the existing archive, cloning only those bits you want to + preserve into a new archive using using the mz_zip_writer_add_from_zip_reader() function (which compiles the + compressed file data as-is). When you're done, delete the old archive and rename the newly written archive, and + you're done. This is safe but requires a bunch of temporary disk space or heap memory. + + 2. Or, you can convert an mz_zip_reader in-place to an mz_zip_writer using mz_zip_writer_init_from_reader(), + append new files as needed, then finalize the archive which will write an updated central directory to the + original archive. (This is basically what mz_zip_add_mem_to_archive_file_in_place() does.) There's a + possibility that the archive's central directory could be lost with this method if anything goes wrong, though. + + - ZIP archive support limitations: + No zip64 or spanning support. Extraction functions can only handle unencrypted, stored or deflated files. + Requires streams capable of seeking. + + * This is a header file library, like stb_image.c. To get only a header file, either cut and paste the + below header, or create miniz.h, #define MINIZ_HEADER_FILE_ONLY, and then include miniz.c from it. + + * Important: For best perf. be sure to customize the below macros for your target platform: + #define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1 + #define MINIZ_LITTLE_ENDIAN 1 + #define MINIZ_HAS_64BIT_REGISTERS 1 +*/ + +#ifndef MINIZ_HEADER_INCLUDED +#define MINIZ_HEADER_INCLUDED + +#include + +#if !defined(MINIZ_NO_TIME) && !defined(MINIZ_NO_ARCHIVE_APIS) +#include +#endif + +// Defines to completely disable specific portions of miniz.c: +// If all macros here are defined the only functionality remaining will be CRC-32, adler-32, tinfl, and tdefl. + +// Define MINIZ_NO_STDIO to disable all usage and any functions which rely on stdio for file I/O. +#define MINIZ_NO_STDIO + +// If MINIZ_NO_TIME is specified then the ZIP archive functions will not be able to get the current time, or +// get/set file times. +#define MINIZ_NO_TIME + +// Define MINIZ_NO_ARCHIVE_APIS to disable all ZIP archive API's. +//#define MINIZ_NO_ARCHIVE_APIS + +// Define MINIZ_NO_ARCHIVE_APIS to disable all writing related ZIP archive API's. +//#define MINIZ_NO_ARCHIVE_WRITING_APIS + +// Define MINIZ_NO_ZLIB_APIS to remove all ZLIB-style compression/decompression API's. +//#define MINIZ_NO_ZLIB_APIS + +// Define MINIZ_NO_ZLIB_COMPATIBLE_NAME to disable zlib names, to prevent conflicts against stock zlib. +#define MINIZ_NO_ZLIB_COMPATIBLE_NAMES + +// Define MINIZ_NO_MALLOC to disable all calls to malloc, free, and realloc. +// Note if MINIZ_NO_MALLOC is defined then the user must always provide custom user alloc/free/realloc +// callbacks to the zlib and archive API's, and a few stand-alone helper API's which don't provide custom user +// functions (such as tdefl_compress_mem_to_heap() and tinfl_decompress_mem_to_heap()) won't work. +//#define MINIZ_NO_MALLOC + +#if defined(_M_IX86) || defined(_M_X64) || defined(__i386__) || defined(__i386) || defined(__i486__) || defined(__i486) || defined(i386) || defined(__ia64__) || defined(__x86_64__) +// MINIZ_X86_OR_X64_CPU is only used to help set the below macros. +#define MINIZ_X86_OR_X64_CPU 1 +#endif + +#if (__BYTE_ORDER__==__ORDER_LITTLE_ENDIAN__) || MINIZ_X86_OR_X64_CPU +// Set MINIZ_LITTLE_ENDIAN to 1 if the processor is little endian. +#define MINIZ_LITTLE_ENDIAN 1 +#endif + +#if MINIZ_X86_OR_X64_CPU +// Set MINIZ_USE_UNALIGNED_LOADS_AND_STORES to 1 on CPU's that permit efficient integer loads and stores from unaligned addresses. +#define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1 +#endif + +#if defined(_M_X64) || defined(_WIN64) || defined(__MINGW64__) || defined(_LP64) || defined(__LP64__) || defined(__ia64__) || defined(__x86_64__) +// Set MINIZ_HAS_64BIT_REGISTERS to 1 if operations on 64-bit integers are reasonably fast (and don't involve compiler generated calls to helper functions). +#define MINIZ_HAS_64BIT_REGISTERS 1 +#endif + +#ifdef __cplusplus +extern "C" { +#endif + +// ------------------- zlib-style API Definitions. + +// For more compatibility with zlib, miniz.c uses unsigned long for some parameters/struct members. Beware: mz_ulong can be either 32 or 64-bits! +typedef unsigned long mz_ulong; + +// mz_free() internally uses the MZ_FREE() macro (which by default calls free() unless you've modified the MZ_MALLOC macro) to release a block allocated from the heap. +void mz_free(void *p); + +#define MZ_ADLER32_INIT (1) +// mz_adler32() returns the initial adler-32 value to use when called with ptr==NULL. +mz_ulong mz_adler32(mz_ulong adler, const unsigned char *ptr, size_t buf_len); + +#define MZ_CRC32_INIT (0) +// mz_crc32() returns the initial CRC-32 value to use when called with ptr==NULL. +mz_ulong mz_crc32(mz_ulong crc, const unsigned char *ptr, size_t buf_len); + +// Compression strategies. +enum { MZ_DEFAULT_STRATEGY = 0, MZ_FILTERED = 1, MZ_HUFFMAN_ONLY = 2, MZ_RLE = 3, MZ_FIXED = 4 }; + +// Method +#define MZ_DEFLATED 8 + +#ifndef MINIZ_NO_ZLIB_APIS + +// Heap allocation callbacks. +// Note that mz_alloc_func parameter types purpsosely differ from zlib's: items/size is size_t, not unsigned long. +typedef void *(*mz_alloc_func)(void *opaque, size_t items, size_t size); +typedef void (*mz_free_func)(void *opaque, void *address); +typedef void *(*mz_realloc_func)(void *opaque, void *address, size_t items, size_t size); + +#define MZ_VERSION "9.1.14" +#define MZ_VERNUM 0x91E0 +#define MZ_VER_MAJOR 9 +#define MZ_VER_MINOR 1 +#define MZ_VER_REVISION 14 +#define MZ_VER_SUBREVISION 0 + +// Flush values. For typical usage you only need MZ_NO_FLUSH and MZ_FINISH. The other values are for advanced use (refer to the zlib docs). +enum { MZ_NO_FLUSH = 0, MZ_PARTIAL_FLUSH = 1, MZ_SYNC_FLUSH = 2, MZ_FULL_FLUSH = 3, MZ_FINISH = 4, MZ_BLOCK = 5 }; + +// Return status codes. MZ_PARAM_ERROR is non-standard. +enum { MZ_OK = 0, MZ_STREAM_END = 1, MZ_NEED_DICT = 2, MZ_ERRNO = -1, MZ_STREAM_ERROR = -2, MZ_DATA_ERROR = -3, MZ_MEM_ERROR = -4, MZ_BUF_ERROR = -5, MZ_VERSION_ERROR = -6, MZ_PARAM_ERROR = -10000 }; + +// Compression levels: 0-9 are the standard zlib-style levels, 10 is best possible compression (not zlib compatible, and may be very slow), MZ_DEFAULT_COMPRESSION=MZ_DEFAULT_LEVEL. +enum { MZ_NO_COMPRESSION = 0, MZ_BEST_SPEED = 1, MZ_BEST_COMPRESSION = 9, MZ_UBER_COMPRESSION = 10, MZ_DEFAULT_LEVEL = 6, MZ_DEFAULT_COMPRESSION = -1 }; + +// Window bits +#define MZ_DEFAULT_WINDOW_BITS 15 + +struct mz_internal_state; + +// Compression/decompression stream struct. +typedef struct mz_stream_s +{ + const unsigned char *next_in; // pointer to next byte to read + unsigned int avail_in; // number of bytes available at next_in + mz_ulong total_in; // total number of bytes consumed so far + + unsigned char *next_out; // pointer to next byte to write + unsigned int avail_out; // number of bytes that can be written to next_out + mz_ulong total_out; // total number of bytes produced so far + + char *msg; // error msg (unused) + struct mz_internal_state *state; // internal state, allocated by zalloc/zfree + + mz_alloc_func zalloc; // optional heap allocation function (defaults to malloc) + mz_free_func zfree; // optional heap free function (defaults to free) + void *opaque; // heap alloc function user pointer + + int data_type; // data_type (unused) + mz_ulong adler; // adler32 of the source or uncompressed data + mz_ulong reserved; // not used +} mz_stream; + +typedef mz_stream *mz_streamp; + +// Returns the version string of miniz.c. +const char *mz_version(void); + +// mz_deflateInit() initializes a compressor with default options: +// Parameters: +// pStream must point to an initialized mz_stream struct. +// level must be between [MZ_NO_COMPRESSION, MZ_BEST_COMPRESSION]. +// level 1 enables a specially optimized compression function that's been optimized purely for performance, not ratio. +// (This special func. is currently only enabled when MINIZ_USE_UNALIGNED_LOADS_AND_STORES and MINIZ_LITTLE_ENDIAN are defined.) +// Return values: +// MZ_OK on success. +// MZ_STREAM_ERROR if the stream is bogus. +// MZ_PARAM_ERROR if the input parameters are bogus. +// MZ_MEM_ERROR on out of memory. +int mz_deflateInit(mz_streamp pStream, int level); + +// mz_deflateInit2() is like mz_deflate(), except with more control: +// Additional parameters: +// method must be MZ_DEFLATED +// window_bits must be MZ_DEFAULT_WINDOW_BITS (to wrap the deflate stream with zlib header/adler-32 footer) or -MZ_DEFAULT_WINDOW_BITS (raw deflate/no header or footer) +// mem_level must be between [1, 9] (it's checked but ignored by miniz.c) +int mz_deflateInit2(mz_streamp pStream, int level, int method, int window_bits, int mem_level, int strategy); + +// Quickly resets a compressor without having to reallocate anything. Same as calling mz_deflateEnd() followed by mz_deflateInit()/mz_deflateInit2(). +int mz_deflateReset(mz_streamp pStream); + +// mz_deflate() compresses the input to output, consuming as much of the input and producing as much output as possible. +// Parameters: +// pStream is the stream to read from and write to. You must initialize/update the next_in, avail_in, next_out, and avail_out members. +// flush may be MZ_NO_FLUSH, MZ_PARTIAL_FLUSH/MZ_SYNC_FLUSH, MZ_FULL_FLUSH, or MZ_FINISH. +// Return values: +// MZ_OK on success (when flushing, or if more input is needed but not available, and/or there's more output to be written but the output buffer is full). +// MZ_STREAM_END if all input has been consumed and all output bytes have been written. Don't call mz_deflate() on the stream anymore. +// MZ_STREAM_ERROR if the stream is bogus. +// MZ_PARAM_ERROR if one of the parameters is invalid. +// MZ_BUF_ERROR if no forward progress is possible because the input and/or output buffers are empty. (Fill up the input buffer or free up some output space and try again.) +int mz_deflate(mz_streamp pStream, int flush); + +// mz_deflateEnd() deinitializes a compressor: +// Return values: +// MZ_OK on success. +// MZ_STREAM_ERROR if the stream is bogus. +int mz_deflateEnd(mz_streamp pStream); + +// mz_deflateBound() returns a (very) conservative upper bound on the amount of data that could be generated by deflate(), assuming flush is set to only MZ_NO_FLUSH or MZ_FINISH. +mz_ulong mz_deflateBound(mz_streamp pStream, mz_ulong source_len); + +// Single-call compression functions mz_compress() and mz_compress2(): +// Returns MZ_OK on success, or one of the error codes from mz_deflate() on failure. +int mz_compress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len); +int mz_compress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len, int level); + +// mz_compressBound() returns a (very) conservative upper bound on the amount of data that could be generated by calling mz_compress(). +mz_ulong mz_compressBound(mz_ulong source_len); + +// Initializes a decompressor. +int mz_inflateInit(mz_streamp pStream); + +// mz_inflateInit2() is like mz_inflateInit() with an additional option that controls the window size and whether or not the stream has been wrapped with a zlib header/footer: +// window_bits must be MZ_DEFAULT_WINDOW_BITS (to parse zlib header/footer) or -MZ_DEFAULT_WINDOW_BITS (raw deflate). +int mz_inflateInit2(mz_streamp pStream, int window_bits); + +// Decompresses the input stream to the output, consuming only as much of the input as needed, and writing as much to the output as possible. +// Parameters: +// pStream is the stream to read from and write to. You must initialize/update the next_in, avail_in, next_out, and avail_out members. +// flush may be MZ_NO_FLUSH, MZ_SYNC_FLUSH, or MZ_FINISH. +// On the first call, if flush is MZ_FINISH it's assumed the input and output buffers are both sized large enough to decompress the entire stream in a single call (this is slightly faster). +// MZ_FINISH implies that there are no more source bytes available beside what's already in the input buffer, and that the output buffer is large enough to hold the rest of the decompressed data. +// Return values: +// MZ_OK on success. Either more input is needed but not available, and/or there's more output to be written but the output buffer is full. +// MZ_STREAM_END if all needed input has been consumed and all output bytes have been written. For zlib streams, the adler-32 of the decompressed data has also been verified. +// MZ_STREAM_ERROR if the stream is bogus. +// MZ_DATA_ERROR if the deflate stream is invalid. +// MZ_PARAM_ERROR if one of the parameters is invalid. +// MZ_BUF_ERROR if no forward progress is possible because the input buffer is empty but the inflater needs more input to continue, or if the output buffer is not large enough. Call mz_inflate() again +// with more input data, or with more room in the output buffer (except when using single call decompression, described above). +int mz_inflate(mz_streamp pStream, int flush); + +// Deinitializes a decompressor. +int mz_inflateEnd(mz_streamp pStream); + +// Single-call decompression. +// Returns MZ_OK on success, or one of the error codes from mz_inflate() on failure. +int mz_uncompress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len); + +// Returns a string description of the specified error code, or NULL if the error code is invalid. +const char *mz_error(int err); + +// Redefine zlib-compatible names to miniz equivalents, so miniz.c can be used as a drop-in replacement for the subset of zlib that miniz.c supports. +// Define MINIZ_NO_ZLIB_COMPATIBLE_NAMES to disable zlib-compatibility if you use zlib in the same project. +#ifndef MINIZ_NO_ZLIB_COMPATIBLE_NAMES + typedef unsigned char Byte; + typedef unsigned int uInt; + typedef mz_ulong uLong; + typedef Byte Bytef; + typedef uInt uIntf; + typedef char charf; + typedef int intf; + typedef void *voidpf; + typedef uLong uLongf; + typedef void *voidp; + typedef void *const voidpc; + #define Z_NULL 0 + #define Z_NO_FLUSH MZ_NO_FLUSH + #define Z_PARTIAL_FLUSH MZ_PARTIAL_FLUSH + #define Z_SYNC_FLUSH MZ_SYNC_FLUSH + #define Z_FULL_FLUSH MZ_FULL_FLUSH + #define Z_FINISH MZ_FINISH + #define Z_BLOCK MZ_BLOCK + #define Z_OK MZ_OK + #define Z_STREAM_END MZ_STREAM_END + #define Z_NEED_DICT MZ_NEED_DICT + #define Z_ERRNO MZ_ERRNO + #define Z_STREAM_ERROR MZ_STREAM_ERROR + #define Z_DATA_ERROR MZ_DATA_ERROR + #define Z_MEM_ERROR MZ_MEM_ERROR + #define Z_BUF_ERROR MZ_BUF_ERROR + #define Z_VERSION_ERROR MZ_VERSION_ERROR + #define Z_PARAM_ERROR MZ_PARAM_ERROR + #define Z_NO_COMPRESSION MZ_NO_COMPRESSION + #define Z_BEST_SPEED MZ_BEST_SPEED + #define Z_BEST_COMPRESSION MZ_BEST_COMPRESSION + #define Z_DEFAULT_COMPRESSION MZ_DEFAULT_COMPRESSION + #define Z_DEFAULT_STRATEGY MZ_DEFAULT_STRATEGY + #define Z_FILTERED MZ_FILTERED + #define Z_HUFFMAN_ONLY MZ_HUFFMAN_ONLY + #define Z_RLE MZ_RLE + #define Z_FIXED MZ_FIXED + #define Z_DEFLATED MZ_DEFLATED + #define Z_DEFAULT_WINDOW_BITS MZ_DEFAULT_WINDOW_BITS + #define alloc_func mz_alloc_func + #define free_func mz_free_func + #define internal_state mz_internal_state + #define z_stream mz_stream + #define deflateInit mz_deflateInit + #define deflateInit2 mz_deflateInit2 + #define deflateReset mz_deflateReset + #define deflate mz_deflate + #define deflateEnd mz_deflateEnd + #define deflateBound mz_deflateBound + #define compress mz_compress + #define compress2 mz_compress2 + #define compressBound mz_compressBound + #define inflateInit mz_inflateInit + #define inflateInit2 mz_inflateInit2 + #define inflate mz_inflate + #define inflateEnd mz_inflateEnd + #define uncompress mz_uncompress + #define crc32 mz_crc32 + #define adler32 mz_adler32 + #define MAX_WBITS 15 + #define MAX_MEM_LEVEL 9 + #define zError mz_error + #define ZLIB_VERSION MZ_VERSION + #define ZLIB_VERNUM MZ_VERNUM + #define ZLIB_VER_MAJOR MZ_VER_MAJOR + #define ZLIB_VER_MINOR MZ_VER_MINOR + #define ZLIB_VER_REVISION MZ_VER_REVISION + #define ZLIB_VER_SUBREVISION MZ_VER_SUBREVISION + #define zlibVersion mz_version + #define zlib_version mz_version() +#endif // #ifndef MINIZ_NO_ZLIB_COMPATIBLE_NAMES + +#endif // MINIZ_NO_ZLIB_APIS + +// ------------------- Types and macros + +typedef unsigned char mz_uint8; +typedef signed short mz_int16; +typedef unsigned short mz_uint16; +typedef unsigned int mz_uint32; +typedef unsigned int mz_uint; +typedef long long mz_int64; +typedef unsigned long long mz_uint64; +typedef int mz_bool; + +#define MZ_FALSE (0) +#define MZ_TRUE (1) + +// Works around MSVC's spammy "warning C4127: conditional expression is constant" message. +#ifdef _MSC_VER + #define MZ_MACRO_END while (0, 0) +#else + #define MZ_MACRO_END while (0) +#endif + +// ------------------- ZIP archive reading/writing + +#ifndef MINIZ_NO_ARCHIVE_APIS + +enum +{ + MZ_ZIP_MAX_IO_BUF_SIZE = 64*1024, + MZ_ZIP_MAX_ARCHIVE_FILENAME_SIZE = 260, + MZ_ZIP_MAX_ARCHIVE_FILE_COMMENT_SIZE = 256 +}; + +typedef struct +{ + mz_uint32 m_file_index; + mz_uint32 m_central_dir_ofs; + mz_uint16 m_version_made_by; + mz_uint16 m_version_needed; + mz_uint16 m_bit_flag; + mz_uint16 m_method; +#ifndef MINIZ_NO_TIME + time_t m_time; +#endif + mz_uint32 m_crc32; + mz_uint64 m_comp_size; + mz_uint64 m_uncomp_size; + mz_uint16 m_internal_attr; + mz_uint32 m_external_attr; + mz_uint64 m_local_header_ofs; + mz_uint32 m_comment_size; + char m_filename[MZ_ZIP_MAX_ARCHIVE_FILENAME_SIZE]; + char m_comment[MZ_ZIP_MAX_ARCHIVE_FILE_COMMENT_SIZE]; +} mz_zip_archive_file_stat; + +typedef size_t (*mz_file_read_func)(void *pOpaque, mz_uint64 file_ofs, void *pBuf, size_t n); +typedef size_t (*mz_file_write_func)(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n); + +struct mz_zip_internal_state_tag; +typedef struct mz_zip_internal_state_tag mz_zip_internal_state; + +typedef enum +{ + MZ_ZIP_MODE_INVALID = 0, + MZ_ZIP_MODE_READING = 1, + MZ_ZIP_MODE_WRITING = 2, + MZ_ZIP_MODE_WRITING_HAS_BEEN_FINALIZED = 3 +} mz_zip_mode; + +typedef struct +{ + mz_uint64 m_archive_size; + mz_uint64 m_central_directory_file_ofs; + mz_uint m_total_files; + mz_zip_mode m_zip_mode; + + mz_uint m_file_offset_alignment; + + mz_alloc_func m_pAlloc; + mz_free_func m_pFree; + mz_realloc_func m_pRealloc; + void *m_pAlloc_opaque; + + mz_file_read_func m_pRead; + mz_file_write_func m_pWrite; + void *m_pIO_opaque; + + mz_zip_internal_state *m_pState; + +} mz_zip_archive; + +typedef enum +{ + MZ_ZIP_FLAG_CASE_SENSITIVE = 0x0100, + MZ_ZIP_FLAG_IGNORE_PATH = 0x0200, + MZ_ZIP_FLAG_COMPRESSED_DATA = 0x0400, + MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY = 0x0800 +} mz_zip_flags; + +// ZIP archive reading + +// Inits a ZIP archive reader. +// These functions read and validate the archive's central directory. +mz_bool mz_zip_reader_init(mz_zip_archive *pZip, mz_uint64 size, mz_uint32 flags); +mz_bool mz_zip_reader_init_mem(mz_zip_archive *pZip, const void *pMem, size_t size, mz_uint32 flags); + +#ifndef MINIZ_NO_STDIO +mz_bool mz_zip_reader_init_file(mz_zip_archive *pZip, const char *pFilename, mz_uint32 flags); +#endif + +// Returns the total number of files in the archive. +mz_uint mz_zip_reader_get_num_files(mz_zip_archive *pZip); + +// Returns detailed information about an archive file entry. +mz_bool mz_zip_reader_file_stat(mz_zip_archive *pZip, mz_uint file_index, mz_zip_archive_file_stat *pStat); + +// Determines if an archive file entry is a directory entry. +mz_bool mz_zip_reader_is_file_a_directory(mz_zip_archive *pZip, mz_uint file_index); +mz_bool mz_zip_reader_is_file_encrypted(mz_zip_archive *pZip, mz_uint file_index); + +// Retrieves the filename of an archive file entry. +// Returns the number of bytes written to pFilename, or if filename_buf_size is 0 this function returns the number of bytes needed to fully store the filename. +mz_uint mz_zip_reader_get_filename(mz_zip_archive *pZip, mz_uint file_index, char *pFilename, mz_uint filename_buf_size); + +// Attempts to locates a file in the archive's central directory. +// Valid flags: MZ_ZIP_FLAG_CASE_SENSITIVE, MZ_ZIP_FLAG_IGNORE_PATH +// Returns -1 if the file cannot be found. +int mz_zip_reader_locate_file(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags); + +// Extracts a archive file to a memory buffer using no memory allocation. +mz_bool mz_zip_reader_extract_to_mem_no_alloc(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size); +mz_bool mz_zip_reader_extract_file_to_mem_no_alloc(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size); + +// Extracts a archive file to a memory buffer. +mz_bool mz_zip_reader_extract_to_mem(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags); +mz_bool mz_zip_reader_extract_file_to_mem(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags); + +// Extracts a archive file to a dynamically allocated heap buffer. +void *mz_zip_reader_extract_to_heap(mz_zip_archive *pZip, mz_uint file_index, size_t *pSize, mz_uint flags); +void *mz_zip_reader_extract_file_to_heap(mz_zip_archive *pZip, const char *pFilename, size_t *pSize, mz_uint flags); + +// Extracts a archive file using a callback function to output the file's data. +mz_bool mz_zip_reader_extract_to_callback(mz_zip_archive *pZip, mz_uint file_index, mz_file_write_func pCallback, void *pOpaque, mz_uint flags); +mz_bool mz_zip_reader_extract_file_to_callback(mz_zip_archive *pZip, const char *pFilename, mz_file_write_func pCallback, void *pOpaque, mz_uint flags); + +#ifndef MINIZ_NO_STDIO +// Extracts a archive file to a disk file and sets its last accessed and modified times. +// This function only extracts files, not archive directory records. +mz_bool mz_zip_reader_extract_to_file(mz_zip_archive *pZip, mz_uint file_index, const char *pDst_filename, mz_uint flags); +mz_bool mz_zip_reader_extract_file_to_file(mz_zip_archive *pZip, const char *pArchive_filename, const char *pDst_filename, mz_uint flags); +#endif + +// Ends archive reading, freeing all allocations, and closing the input archive file if mz_zip_reader_init_file() was used. +mz_bool mz_zip_reader_end(mz_zip_archive *pZip); + +// ZIP archive writing + +#ifndef MINIZ_NO_ARCHIVE_WRITING_APIS + +// Inits a ZIP archive writer. +mz_bool mz_zip_writer_init(mz_zip_archive *pZip, mz_uint64 existing_size); +mz_bool mz_zip_writer_init_heap(mz_zip_archive *pZip, size_t size_to_reserve_at_beginning, size_t initial_allocation_size); + +#ifndef MINIZ_NO_STDIO +mz_bool mz_zip_writer_init_file(mz_zip_archive *pZip, const char *pFilename, mz_uint64 size_to_reserve_at_beginning); +#endif + +// Converts a ZIP archive reader object into a writer object, to allow efficient in-place file appends to occur on an existing archive. +// For archives opened using mz_zip_reader_init_file, pFilename must be the archive's filename so it can be reopened for writing. If the file can't be reopened, mz_zip_reader_end() will be called. +// For archives opened using mz_zip_reader_init_mem, the memory block must be growable using the realloc callback (which defaults to realloc unless you've overridden it). +// Finally, for archives opened using mz_zip_reader_init, the mz_zip_archive's user provided m_pWrite function cannot be NULL. +// Note: In-place archive modification is not recommended unless you know what you're doing, because if execution stops or something goes wrong before +// the archive is finalized the file's central directory will be hosed. +mz_bool mz_zip_writer_init_from_reader(mz_zip_archive *pZip, const char *pFilename); + +// Adds the contents of a memory buffer to an archive. These functions record the current local time into the archive. +// To add a directory entry, call this method with an archive name ending in a forwardslash with empty buffer. +// level_and_flags - compression level (0-10, see MZ_BEST_SPEED, MZ_BEST_COMPRESSION, etc.) logically OR'd with zero or more mz_zip_flags, or just set to MZ_DEFAULT_COMPRESSION. +mz_bool mz_zip_writer_add_mem(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, mz_uint level_and_flags); +mz_bool mz_zip_writer_add_mem_ex(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags, mz_uint64 uncomp_size, mz_uint32 uncomp_crc32); + +#ifndef MINIZ_NO_STDIO +// Adds the contents of a disk file to an archive. This function also records the disk file's modified time into the archive. +// level_and_flags - compression level (0-10, see MZ_BEST_SPEED, MZ_BEST_COMPRESSION, etc.) logically OR'd with zero or more mz_zip_flags, or just set to MZ_DEFAULT_COMPRESSION. +mz_bool mz_zip_writer_add_file(mz_zip_archive *pZip, const char *pArchive_name, const char *pSrc_filename, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags); +#endif + +// Adds a file to an archive by fully cloning the data from another archive. +// This function fully clones the source file's compressed data (no recompression), along with its full filename, extra data, and comment fields. +mz_bool mz_zip_writer_add_from_zip_reader(mz_zip_archive *pZip, mz_zip_archive *pSource_zip, mz_uint file_index); + +// Finalizes the archive by writing the central directory records followed by the end of central directory record. +// After an archive is finalized, the only valid call on the mz_zip_archive struct is mz_zip_writer_end(). +// An archive must be manually finalized by calling this function for it to be valid. +mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip); +mz_bool mz_zip_writer_finalize_heap_archive(mz_zip_archive *pZip, void **pBuf, size_t *pSize); + +// Ends archive writing, freeing all allocations, and closing the output file if mz_zip_writer_init_file() was used. +// Note for the archive to be valid, it must have been finalized before ending. +mz_bool mz_zip_writer_end(mz_zip_archive *pZip); + +// Misc. high-level helper functions: + +// mz_zip_add_mem_to_archive_file_in_place() efficiently (but not atomically) appends a memory blob to a ZIP archive. +// level_and_flags - compression level (0-10, see MZ_BEST_SPEED, MZ_BEST_COMPRESSION, etc.) logically OR'd with zero or more mz_zip_flags, or just set to MZ_DEFAULT_COMPRESSION. +mz_bool mz_zip_add_mem_to_archive_file_in_place(const char *pZip_filename, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags); + +// Reads a single file from an archive into a heap block. +// Returns NULL on failure. +void *mz_zip_extract_archive_file_to_heap(const char *pZip_filename, const char *pArchive_name, size_t *pSize, mz_uint zip_flags); + +#endif // #ifndef MINIZ_NO_ARCHIVE_WRITING_APIS + +#endif // #ifndef MINIZ_NO_ARCHIVE_APIS + +// ------------------- Low-level Decompression API Definitions + +// Decompression flags used by tinfl_decompress(). +// TINFL_FLAG_PARSE_ZLIB_HEADER: If set, the input has a valid zlib header and ends with an adler32 checksum (it's a valid zlib stream). Otherwise, the input is a raw deflate stream. +// TINFL_FLAG_HAS_MORE_INPUT: If set, there are more input bytes available beyond the end of the supplied input buffer. If clear, the input buffer contains all remaining input. +// TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF: If set, the output buffer is large enough to hold the entire decompressed stream. If clear, the output buffer is at least the size of the dictionary (typically 32KB). +// TINFL_FLAG_COMPUTE_ADLER32: Force adler-32 checksum computation of the decompressed bytes. +enum +{ + TINFL_FLAG_PARSE_ZLIB_HEADER = 1, + TINFL_FLAG_HAS_MORE_INPUT = 2, + TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF = 4, + TINFL_FLAG_COMPUTE_ADLER32 = 8 +}; + +// High level decompression functions: +// tinfl_decompress_mem_to_heap() decompresses a block in memory to a heap block allocated via malloc(). +// On entry: +// pSrc_buf, src_buf_len: Pointer and size of the Deflate or zlib source data to decompress. +// On return: +// Function returns a pointer to the decompressed data, or NULL on failure. +// *pOut_len will be set to the decompressed data's size, which could be larger than src_buf_len on uncompressible data. +// The caller must call mz_free() on the returned block when it's no longer needed. +void *tinfl_decompress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags); + +// tinfl_decompress_mem_to_mem() decompresses a block in memory to another block in memory. +// Returns TINFL_DECOMPRESS_MEM_TO_MEM_FAILED on failure, or the number of bytes written on success. +#define TINFL_DECOMPRESS_MEM_TO_MEM_FAILED ((size_t)(-1)) +size_t tinfl_decompress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags); + +// tinfl_decompress_mem_to_callback() decompresses a block in memory to an internal 32KB buffer, and a user provided callback function will be called to flush the buffer. +// Returns 1 on success or 0 on failure. +typedef int (*tinfl_put_buf_func_ptr)(const void* pBuf, int len, void *pUser); +int tinfl_decompress_mem_to_callback(const void *pIn_buf, size_t *pIn_buf_size, tinfl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags); + +struct tinfl_decompressor_tag; typedef struct tinfl_decompressor_tag tinfl_decompressor; + +// Max size of LZ dictionary. +#define TINFL_LZ_DICT_SIZE 32768 + +// Return status. +typedef enum +{ + TINFL_STATUS_BAD_PARAM = -3, + TINFL_STATUS_ADLER32_MISMATCH = -2, + TINFL_STATUS_FAILED = -1, + TINFL_STATUS_DONE = 0, + TINFL_STATUS_NEEDS_MORE_INPUT = 1, + TINFL_STATUS_HAS_MORE_OUTPUT = 2 +} tinfl_status; + +// Initializes the decompressor to its initial state. +#define tinfl_init(r) do { (r)->m_state = 0; } MZ_MACRO_END +#define tinfl_get_adler32(r) (r)->m_check_adler32 + +// Main low-level decompressor coroutine function. This is the only function actually needed for decompression. All the other functions are just high-level helpers for improved usability. +// This is a universal API, i.e. it can be used as a building block to build any desired higher level decompression API. In the limit case, it can be called once per every byte input or output. +tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_next, size_t *pIn_buf_size, mz_uint8 *pOut_buf_start, mz_uint8 *pOut_buf_next, size_t *pOut_buf_size, const mz_uint32 decomp_flags); + +// Internal/private bits follow. +enum +{ + TINFL_MAX_HUFF_TABLES = 3, TINFL_MAX_HUFF_SYMBOLS_0 = 288, TINFL_MAX_HUFF_SYMBOLS_1 = 32, TINFL_MAX_HUFF_SYMBOLS_2 = 19, + TINFL_FAST_LOOKUP_BITS = 10, TINFL_FAST_LOOKUP_SIZE = 1 << TINFL_FAST_LOOKUP_BITS +}; + +typedef struct +{ + mz_uint8 m_code_size[TINFL_MAX_HUFF_SYMBOLS_0]; + mz_int16 m_look_up[TINFL_FAST_LOOKUP_SIZE], m_tree[TINFL_MAX_HUFF_SYMBOLS_0 * 2]; +} tinfl_huff_table; + +#if MINIZ_HAS_64BIT_REGISTERS + #define TINFL_USE_64BIT_BITBUF 1 +#endif + +#if TINFL_USE_64BIT_BITBUF + typedef mz_uint64 tinfl_bit_buf_t; + #define TINFL_BITBUF_SIZE (64) +#else + typedef mz_uint32 tinfl_bit_buf_t; + #define TINFL_BITBUF_SIZE (32) +#endif + +struct tinfl_decompressor_tag +{ + mz_uint32 m_state, m_num_bits, m_zhdr0, m_zhdr1, m_z_adler32, m_final, m_type, m_check_adler32, m_dist, m_counter, m_num_extra, m_table_sizes[TINFL_MAX_HUFF_TABLES]; + tinfl_bit_buf_t m_bit_buf; + size_t m_dist_from_out_buf_start; + tinfl_huff_table m_tables[TINFL_MAX_HUFF_TABLES]; + mz_uint8 m_raw_header[4], m_len_codes[TINFL_MAX_HUFF_SYMBOLS_0 + TINFL_MAX_HUFF_SYMBOLS_1 + 137]; +}; + +// ------------------- Low-level Compression API Definitions + +// Set TDEFL_LESS_MEMORY to 1 to use less memory (compression will be slightly slower, and raw/dynamic blocks will be output more frequently). +#define TDEFL_LESS_MEMORY 0 + +// tdefl_init() compression flags logically OR'd together (low 12 bits contain the max. number of probes per dictionary search): +// TDEFL_DEFAULT_MAX_PROBES: The compressor defaults to 128 dictionary probes per dictionary search. 0=Huffman only, 1=Huffman+LZ (fastest/crap compression), 4095=Huffman+LZ (slowest/best compression). +enum +{ + TDEFL_HUFFMAN_ONLY = 0, TDEFL_DEFAULT_MAX_PROBES = 128, TDEFL_MAX_PROBES_MASK = 0xFFF +}; + +// TDEFL_WRITE_ZLIB_HEADER: If set, the compressor outputs a zlib header before the deflate data, and the Adler-32 of the source data at the end. Otherwise, you'll get raw deflate data. +// TDEFL_COMPUTE_ADLER32: Always compute the adler-32 of the input data (even when not writing zlib headers). +// TDEFL_GREEDY_PARSING_FLAG: Set to use faster greedy parsing, instead of more efficient lazy parsing. +// TDEFL_NONDETERMINISTIC_PARSING_FLAG: Enable to decrease the compressor's initialization time to the minimum, but the output may vary from run to run given the same input (depending on the contents of memory). +// TDEFL_RLE_MATCHES: Only look for RLE matches (matches with a distance of 1) +// TDEFL_FILTER_MATCHES: Discards matches <= 5 chars if enabled. +// TDEFL_FORCE_ALL_STATIC_BLOCKS: Disable usage of optimized Huffman tables. +// TDEFL_FORCE_ALL_RAW_BLOCKS: Only use raw (uncompressed) deflate blocks. +enum +{ + TDEFL_WRITE_ZLIB_HEADER = 0x01000, + TDEFL_COMPUTE_ADLER32 = 0x02000, + TDEFL_GREEDY_PARSING_FLAG = 0x04000, + TDEFL_NONDETERMINISTIC_PARSING_FLAG = 0x08000, + TDEFL_RLE_MATCHES = 0x10000, + TDEFL_FILTER_MATCHES = 0x20000, + TDEFL_FORCE_ALL_STATIC_BLOCKS = 0x40000, + TDEFL_FORCE_ALL_RAW_BLOCKS = 0x80000 +}; + +// High level compression functions: +// tdefl_compress_mem_to_heap() compresses a block in memory to a heap block allocated via malloc(). +// On entry: +// pSrc_buf, src_buf_len: Pointer and size of source block to compress. +// flags: The max match finder probes (default is 128) logically OR'd against the above flags. Higher probes are slower but improve compression. +// On return: +// Function returns a pointer to the compressed data, or NULL on failure. +// *pOut_len will be set to the compressed data's size, which could be larger than src_buf_len on uncompressible data. +// The caller must free() the returned block when it's no longer needed. +void *tdefl_compress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags); + +// tdefl_compress_mem_to_mem() compresses a block in memory to another block in memory. +// Returns 0 on failure. +size_t tdefl_compress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags); + +// Compresses an image to a compressed PNG file in memory. +// On entry: +// pImage, w, h, and num_chans describe the image to compress. num_chans may be 1, 2, 3, or 4. +// The image pitch in bytes per scanline will be w*num_chans. The leftmost pixel on the top scanline is stored first in memory. +// On return: +// Function returns a pointer to the compressed data, or NULL on failure. +// *pLen_out will be set to the size of the PNG image file. +// The caller must mz_free() the returned heap block (which will typically be larger than *pLen_out) when it's no longer needed. +void *tdefl_write_image_to_png_file_in_memory(const void *pImage, int w, int h, int num_chans, size_t *pLen_out); + +// Output stream interface. The compressor uses this interface to write compressed data. It'll typically be called TDEFL_OUT_BUF_SIZE at a time. +typedef mz_bool (*tdefl_put_buf_func_ptr)(const void* pBuf, int len, void *pUser); + +// tdefl_compress_mem_to_output() compresses a block to an output stream. The above helpers use this function internally. +mz_bool tdefl_compress_mem_to_output(const void *pBuf, size_t buf_len, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags); + +enum { TDEFL_MAX_HUFF_TABLES = 3, TDEFL_MAX_HUFF_SYMBOLS_0 = 288, TDEFL_MAX_HUFF_SYMBOLS_1 = 32, TDEFL_MAX_HUFF_SYMBOLS_2 = 19, TDEFL_LZ_DICT_SIZE = 32768, TDEFL_LZ_DICT_SIZE_MASK = TDEFL_LZ_DICT_SIZE - 1, TDEFL_MIN_MATCH_LEN = 3, TDEFL_MAX_MATCH_LEN = 258 }; + +// TDEFL_OUT_BUF_SIZE MUST be large enough to hold a single entire compressed output block (using static/fixed Huffman codes). +#if TDEFL_LESS_MEMORY +enum { TDEFL_LZ_CODE_BUF_SIZE = 24 * 1024, TDEFL_OUT_BUF_SIZE = (TDEFL_LZ_CODE_BUF_SIZE * 13 ) / 10, TDEFL_MAX_HUFF_SYMBOLS = 288, TDEFL_LZ_HASH_BITS = 12, TDEFL_LEVEL1_HASH_SIZE_MASK = 4095, TDEFL_LZ_HASH_SHIFT = (TDEFL_LZ_HASH_BITS + 2) / 3, TDEFL_LZ_HASH_SIZE = 1 << TDEFL_LZ_HASH_BITS }; +#else +enum { TDEFL_LZ_CODE_BUF_SIZE = 64 * 1024, TDEFL_OUT_BUF_SIZE = (TDEFL_LZ_CODE_BUF_SIZE * 13 ) / 10, TDEFL_MAX_HUFF_SYMBOLS = 288, TDEFL_LZ_HASH_BITS = 15, TDEFL_LEVEL1_HASH_SIZE_MASK = 4095, TDEFL_LZ_HASH_SHIFT = (TDEFL_LZ_HASH_BITS + 2) / 3, TDEFL_LZ_HASH_SIZE = 1 << TDEFL_LZ_HASH_BITS }; +#endif + +// The low-level tdefl functions below may be used directly if the above helper functions aren't flexible enough. The low-level functions don't make any heap allocations, unlike the above helper functions. +typedef enum +{ + TDEFL_STATUS_BAD_PARAM = -2, + TDEFL_STATUS_PUT_BUF_FAILED = -1, + TDEFL_STATUS_OKAY = 0, + TDEFL_STATUS_DONE = 1, +} tdefl_status; + +// Must map to MZ_NO_FLUSH, MZ_SYNC_FLUSH, etc. enums +typedef enum +{ + TDEFL_NO_FLUSH = 0, + TDEFL_SYNC_FLUSH = 2, + TDEFL_FULL_FLUSH = 3, + TDEFL_FINISH = 4 +} tdefl_flush; + +// tdefl's compression state structure. +typedef struct +{ + tdefl_put_buf_func_ptr m_pPut_buf_func; + void *m_pPut_buf_user; + mz_uint m_flags, m_max_probes[2]; + int m_greedy_parsing; + mz_uint m_adler32, m_lookahead_pos, m_lookahead_size, m_dict_size; + mz_uint8 *m_pLZ_code_buf, *m_pLZ_flags, *m_pOutput_buf, *m_pOutput_buf_end; + mz_uint m_num_flags_left, m_total_lz_bytes, m_lz_code_buf_dict_pos, m_bits_in, m_bit_buffer; + mz_uint m_saved_match_dist, m_saved_match_len, m_saved_lit, m_output_flush_ofs, m_output_flush_remaining, m_finished, m_block_index, m_wants_to_finish; + tdefl_status m_prev_return_status; + const void *m_pIn_buf; + void *m_pOut_buf; + size_t *m_pIn_buf_size, *m_pOut_buf_size; + tdefl_flush m_flush; + const mz_uint8 *m_pSrc; + size_t m_src_buf_left, m_out_buf_ofs; + mz_uint8 m_dict[TDEFL_LZ_DICT_SIZE + TDEFL_MAX_MATCH_LEN - 1]; + mz_uint16 m_huff_count[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS]; + mz_uint16 m_huff_codes[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS]; + mz_uint8 m_huff_code_sizes[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS]; + mz_uint8 m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE]; + mz_uint16 m_next[TDEFL_LZ_DICT_SIZE]; + mz_uint16 m_hash[TDEFL_LZ_HASH_SIZE]; + mz_uint8 m_output_buf[TDEFL_OUT_BUF_SIZE]; +} tdefl_compressor; + +// Initializes the compressor. +// There is no corresponding deinit() function because the tdefl API's do not dynamically allocate memory. +// pBut_buf_func: If NULL, output data will be supplied to the specified callback. In this case, the user should call the tdefl_compress_buffer() API for compression. +// If pBut_buf_func is NULL the user should always call the tdefl_compress() API. +// flags: See the above enums (TDEFL_HUFFMAN_ONLY, TDEFL_WRITE_ZLIB_HEADER, etc.) +tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags); + +// Compresses a block of data, consuming as much of the specified input buffer as possible, and writing as much compressed data to the specified output buffer as possible. +tdefl_status tdefl_compress(tdefl_compressor *d, const void *pIn_buf, size_t *pIn_buf_size, void *pOut_buf, size_t *pOut_buf_size, tdefl_flush flush); + +// tdefl_compress_buffer() is only usable when the tdefl_init() is called with a non-NULL tdefl_put_buf_func_ptr. +// tdefl_compress_buffer() always consumes the entire input buffer. +tdefl_status tdefl_compress_buffer(tdefl_compressor *d, const void *pIn_buf, size_t in_buf_size, tdefl_flush flush); + +tdefl_status tdefl_get_prev_return_status(tdefl_compressor *d); +mz_uint32 tdefl_get_adler32(tdefl_compressor *d); + +// Can't use tdefl_create_comp_flags_from_zip_params if MINIZ_NO_ZLIB_APIS isn't defined, because it uses some of its macros. +#ifndef MINIZ_NO_ZLIB_APIS +// Create tdefl_compress() flags given zlib-style compression parameters. +// level may range from [0,10] (where 10 is absolute max compression, but may be much slower on some files) +// window_bits may be -15 (raw deflate) or 15 (zlib) +// strategy may be either MZ_DEFAULT_STRATEGY, MZ_FILTERED, MZ_HUFFMAN_ONLY, MZ_RLE, or MZ_FIXED +mz_uint tdefl_create_comp_flags_from_zip_params(int level, int window_bits, int strategy); +#endif // #ifndef MINIZ_NO_ZLIB_APIS + +#ifdef __cplusplus +} +#endif + +#endif // MINIZ_HEADER_INCLUDED + +// ------------------- End of Header: Implementation follows. (If you only want the header, define MINIZ_HEADER_FILE_ONLY.) + +#ifndef MINIZ_HEADER_FILE_ONLY + +typedef unsigned char mz_validate_uint16[sizeof(mz_uint16)==2 ? 1 : -1]; +typedef unsigned char mz_validate_uint32[sizeof(mz_uint32)==4 ? 1 : -1]; +typedef unsigned char mz_validate_uint64[sizeof(mz_uint64)==8 ? 1 : -1]; + +#include +#include + +#define MZ_ASSERT(x) assert(x) + +#ifdef MINIZ_NO_MALLOC + #define MZ_MALLOC(x) NULL + #define MZ_FREE(x) (void)x, ((void)0) + #define MZ_REALLOC(p, x) NULL +#else + #define MZ_MALLOC(x) malloc(x) + #define MZ_FREE(x) free(x) + #define MZ_REALLOC(p, x) realloc(p, x) +#endif + +#define MZ_MAX(a,b) (((a)>(b))?(a):(b)) +#define MZ_MIN(a,b) (((a)<(b))?(a):(b)) +#define MZ_CLEAR_OBJ(obj) memset(&(obj), 0, sizeof(obj)) + +#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN + #define MZ_READ_LE16(p) *((const mz_uint16 *)(p)) + #define MZ_READ_LE32(p) *((const mz_uint32 *)(p)) +#else + #define MZ_READ_LE16(p) ((mz_uint32)(((const mz_uint8 *)(p))[0]) | ((mz_uint32)(((const mz_uint8 *)(p))[1]) << 8U)) + #define MZ_READ_LE32(p) ((mz_uint32)(((const mz_uint8 *)(p))[0]) | ((mz_uint32)(((const mz_uint8 *)(p))[1]) << 8U) | ((mz_uint32)(((const mz_uint8 *)(p))[2]) << 16U) | ((mz_uint32)(((const mz_uint8 *)(p))[3]) << 24U)) +#endif + +#ifdef _MSC_VER + #define MZ_FORCEINLINE __forceinline +#elif defined(__GNUC__) + #define MZ_FORCEINLINE __attribute__((__always_inline__)) +#else + #define MZ_FORCEINLINE +#endif + +#ifdef __cplusplus + extern "C" { +#endif + +// ------------------- zlib-style API's + +mz_ulong mz_adler32(mz_ulong adler, const unsigned char *ptr, size_t buf_len) +{ + mz_uint32 i, s1 = (mz_uint32)(adler & 0xffff), s2 = (mz_uint32)(adler >> 16); size_t block_len = buf_len % 5552; + if (!ptr) return MZ_ADLER32_INIT; + while (buf_len) { + for (i = 0; i + 7 < block_len; i += 8, ptr += 8) { + s1 += ptr[0], s2 += s1; s1 += ptr[1], s2 += s1; s1 += ptr[2], s2 += s1; s1 += ptr[3], s2 += s1; + s1 += ptr[4], s2 += s1; s1 += ptr[5], s2 += s1; s1 += ptr[6], s2 += s1; s1 += ptr[7], s2 += s1; + } + for ( ; i < block_len; ++i) s1 += *ptr++, s2 += s1; + s1 %= 65521U, s2 %= 65521U; buf_len -= block_len; block_len = 5552; + } + return (s2 << 16) + s1; +} + +// Karl Malbrain's compact CRC-32. See "A compact CCITT crc16 and crc32 C implementation that balances processor cache usage against speed": http://www.geocities.com/malbrain/ +mz_ulong mz_crc32(mz_ulong crc, const mz_uint8 *ptr, size_t buf_len) +{ + static const mz_uint32 s_crc32[16] = { 0, 0x1db71064, 0x3b6e20c8, 0x26d930ac, 0x76dc4190, 0x6b6b51f4, 0x4db26158, 0x5005713c, + 0xedb88320, 0xf00f9344, 0xd6d6a3e8, 0xcb61b38c, 0x9b64c2b0, 0x86d3d2d4, 0xa00ae278, 0xbdbdf21c }; + mz_uint32 crcu32 = (mz_uint32)crc; + if (!ptr) return MZ_CRC32_INIT; + crcu32 = ~crcu32; while (buf_len--) { mz_uint8 b = *ptr++; crcu32 = (crcu32 >> 4) ^ s_crc32[(crcu32 & 0xF) ^ (b & 0xF)]; crcu32 = (crcu32 >> 4) ^ s_crc32[(crcu32 & 0xF) ^ (b >> 4)]; } + return ~crcu32; +} + +void mz_free(void *p) +{ + MZ_FREE(p); +} + +#ifndef MINIZ_NO_ZLIB_APIS + +static void *def_alloc_func(void *opaque, size_t items, size_t size) { (void)opaque, (void)items, (void)size; return MZ_MALLOC(items * size); } +static void def_free_func(void *opaque, void *address) { (void)opaque, (void)address; MZ_FREE(address); } +static void *def_realloc_func(void *opaque, void *address, size_t items, size_t size) { (void)opaque, (void)address, (void)items, (void)size; return MZ_REALLOC(address, items * size); } + +const char *mz_version(void) +{ + return MZ_VERSION; +} + +int mz_deflateInit(mz_streamp pStream, int level) +{ + return mz_deflateInit2(pStream, level, MZ_DEFLATED, MZ_DEFAULT_WINDOW_BITS, 9, MZ_DEFAULT_STRATEGY); +} + +int mz_deflateInit2(mz_streamp pStream, int level, int method, int window_bits, int mem_level, int strategy) +{ + tdefl_compressor *pComp; + mz_uint comp_flags = TDEFL_COMPUTE_ADLER32 | tdefl_create_comp_flags_from_zip_params(level, window_bits, strategy); + + if (!pStream) return MZ_STREAM_ERROR; + if ((method != MZ_DEFLATED) || ((mem_level < 1) || (mem_level > 9)) || ((window_bits != MZ_DEFAULT_WINDOW_BITS) && (-window_bits != MZ_DEFAULT_WINDOW_BITS))) return MZ_PARAM_ERROR; + + pStream->data_type = 0; + pStream->adler = MZ_ADLER32_INIT; + pStream->msg = NULL; + pStream->reserved = 0; + pStream->total_in = 0; + pStream->total_out = 0; + if (!pStream->zalloc) pStream->zalloc = def_alloc_func; + if (!pStream->zfree) pStream->zfree = def_free_func; + + pComp = (tdefl_compressor *)pStream->zalloc(pStream->opaque, 1, sizeof(tdefl_compressor)); + if (!pComp) + return MZ_MEM_ERROR; + + pStream->state = (struct mz_internal_state *)pComp; + + if (tdefl_init(pComp, NULL, NULL, comp_flags) != TDEFL_STATUS_OKAY) + { + mz_deflateEnd(pStream); + return MZ_PARAM_ERROR; + } + + return MZ_OK; +} + +int mz_deflateReset(mz_streamp pStream) +{ + if ((!pStream) || (!pStream->state) || (!pStream->zalloc) || (!pStream->zfree)) return MZ_STREAM_ERROR; + pStream->total_in = pStream->total_out = 0; + tdefl_init((tdefl_compressor*)pStream->state, NULL, NULL, ((tdefl_compressor*)pStream->state)->m_flags); + return MZ_OK; +} + +int mz_deflate(mz_streamp pStream, int flush) +{ + size_t in_bytes, out_bytes; + mz_ulong orig_total_in, orig_total_out; + int mz_status = MZ_OK; + + if ((!pStream) || (!pStream->state) || (flush < 0) || (flush > MZ_FINISH) || (!pStream->next_out)) return MZ_STREAM_ERROR; + if (!pStream->avail_out) return MZ_BUF_ERROR; + + if (flush == MZ_PARTIAL_FLUSH) flush = MZ_SYNC_FLUSH; + + if (((tdefl_compressor*)pStream->state)->m_prev_return_status == TDEFL_STATUS_DONE) + return (flush == MZ_FINISH) ? MZ_STREAM_END : MZ_BUF_ERROR; + + orig_total_in = pStream->total_in; orig_total_out = pStream->total_out; + for ( ; ; ) + { + tdefl_status defl_status; + in_bytes = pStream->avail_in; out_bytes = pStream->avail_out; + + defl_status = tdefl_compress((tdefl_compressor*)pStream->state, pStream->next_in, &in_bytes, pStream->next_out, &out_bytes, (tdefl_flush)flush); + pStream->next_in += (mz_uint)in_bytes; pStream->avail_in -= (mz_uint)in_bytes; + pStream->total_in += (mz_uint)in_bytes; pStream->adler = tdefl_get_adler32((tdefl_compressor*)pStream->state); + + pStream->next_out += (mz_uint)out_bytes; pStream->avail_out -= (mz_uint)out_bytes; + pStream->total_out += (mz_uint)out_bytes; + + if (defl_status < 0) + { + mz_status = MZ_STREAM_ERROR; + break; + } + else if (defl_status == TDEFL_STATUS_DONE) + { + mz_status = MZ_STREAM_END; + break; + } + else if (!pStream->avail_out) + break; + else if ((!pStream->avail_in) && (flush != MZ_FINISH)) + { + if ((flush) || (pStream->total_in != orig_total_in) || (pStream->total_out != orig_total_out)) + break; + return MZ_BUF_ERROR; // Can't make forward progress without some input. + } + } + return mz_status; +} + +int mz_deflateEnd(mz_streamp pStream) +{ + if (!pStream) return MZ_STREAM_ERROR; + if (pStream->state) + { + pStream->zfree(pStream->opaque, pStream->state); + pStream->state = NULL; + } + return MZ_OK; +} + +mz_ulong mz_deflateBound(mz_streamp pStream, mz_ulong source_len) +{ + (void)pStream; + // This is really over conservative. (And lame, but it's actually pretty tricky to compute a true upper bound given the way tdefl's blocking works.) + return MZ_MAX(128 + (source_len * 110) / 100, 128 + source_len + ((source_len / (31 * 1024)) + 1) * 5); +} + +int mz_compress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len, int level) +{ + int status; + mz_stream stream; + memset(&stream, 0, sizeof(stream)); + + // In case mz_ulong is 64-bits (argh I hate longs). + if ((source_len | *pDest_len) > 0xFFFFFFFFU) return MZ_PARAM_ERROR; + + stream.next_in = pSource; + stream.avail_in = (mz_uint32)source_len; + stream.next_out = pDest; + stream.avail_out = (mz_uint32)*pDest_len; + + status = mz_deflateInit(&stream, level); + if (status != MZ_OK) return status; + + status = mz_deflate(&stream, MZ_FINISH); + if (status != MZ_STREAM_END) + { + mz_deflateEnd(&stream); + return (status == MZ_OK) ? MZ_BUF_ERROR : status; + } + + *pDest_len = stream.total_out; + return mz_deflateEnd(&stream); +} + +int mz_compress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len) +{ + return mz_compress2(pDest, pDest_len, pSource, source_len, MZ_DEFAULT_COMPRESSION); +} + +mz_ulong mz_compressBound(mz_ulong source_len) +{ + return mz_deflateBound(NULL, source_len); +} + +typedef struct +{ + tinfl_decompressor m_decomp; + mz_uint m_dict_ofs, m_dict_avail, m_first_call, m_has_flushed; int m_window_bits; + mz_uint8 m_dict[TINFL_LZ_DICT_SIZE]; + tinfl_status m_last_status; +} inflate_state; + +int mz_inflateInit2(mz_streamp pStream, int window_bits) +{ + inflate_state *pDecomp; + if (!pStream) return MZ_STREAM_ERROR; + if ((window_bits != MZ_DEFAULT_WINDOW_BITS) && (-window_bits != MZ_DEFAULT_WINDOW_BITS)) return MZ_PARAM_ERROR; + + pStream->data_type = 0; + pStream->adler = 0; + pStream->msg = NULL; + pStream->total_in = 0; + pStream->total_out = 0; + pStream->reserved = 0; + if (!pStream->zalloc) pStream->zalloc = def_alloc_func; + if (!pStream->zfree) pStream->zfree = def_free_func; + + pDecomp = (inflate_state*)pStream->zalloc(pStream->opaque, 1, sizeof(inflate_state)); + if (!pDecomp) return MZ_MEM_ERROR; + + pStream->state = (struct mz_internal_state *)pDecomp; + + tinfl_init(&pDecomp->m_decomp); + pDecomp->m_dict_ofs = 0; + pDecomp->m_dict_avail = 0; + pDecomp->m_last_status = TINFL_STATUS_NEEDS_MORE_INPUT; + pDecomp->m_first_call = 1; + pDecomp->m_has_flushed = 0; + pDecomp->m_window_bits = window_bits; + + return MZ_OK; +} + +int mz_inflateInit(mz_streamp pStream) +{ + return mz_inflateInit2(pStream, MZ_DEFAULT_WINDOW_BITS); +} + +int mz_inflate(mz_streamp pStream, int flush) +{ + inflate_state* pState; + mz_uint n, first_call, decomp_flags = TINFL_FLAG_COMPUTE_ADLER32; + size_t in_bytes, out_bytes, orig_avail_in; + tinfl_status status; + + if ((!pStream) || (!pStream->state)) return MZ_STREAM_ERROR; + if (flush == MZ_PARTIAL_FLUSH) flush = MZ_SYNC_FLUSH; + if ((flush) && (flush != MZ_SYNC_FLUSH) && (flush != MZ_FINISH)) return MZ_STREAM_ERROR; + + pState = (inflate_state*)pStream->state; + if (pState->m_window_bits > 0) decomp_flags |= TINFL_FLAG_PARSE_ZLIB_HEADER; + orig_avail_in = pStream->avail_in; + + first_call = pState->m_first_call; pState->m_first_call = 0; + if (pState->m_last_status < 0) return MZ_DATA_ERROR; + + if (pState->m_has_flushed && (flush != MZ_FINISH)) return MZ_STREAM_ERROR; + pState->m_has_flushed |= (flush == MZ_FINISH); + + if ((flush == MZ_FINISH) && (first_call)) + { + // MZ_FINISH on the first call implies that the input and output buffers are large enough to hold the entire compressed/decompressed file. + decomp_flags |= TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF; + in_bytes = pStream->avail_in; out_bytes = pStream->avail_out; + status = tinfl_decompress(&pState->m_decomp, pStream->next_in, &in_bytes, pStream->next_out, pStream->next_out, &out_bytes, decomp_flags); + pState->m_last_status = status; + pStream->next_in += (mz_uint)in_bytes; pStream->avail_in -= (mz_uint)in_bytes; pStream->total_in += (mz_uint)in_bytes; + pStream->adler = tinfl_get_adler32(&pState->m_decomp); + pStream->next_out += (mz_uint)out_bytes; pStream->avail_out -= (mz_uint)out_bytes; pStream->total_out += (mz_uint)out_bytes; + + if (status < 0) + return MZ_DATA_ERROR; + else if (status != TINFL_STATUS_DONE) + { + pState->m_last_status = TINFL_STATUS_FAILED; + return MZ_BUF_ERROR; + } + return MZ_STREAM_END; + } + // flush != MZ_FINISH then we must assume there's more input. + if (flush != MZ_FINISH) decomp_flags |= TINFL_FLAG_HAS_MORE_INPUT; + + if (pState->m_dict_avail) + { + n = MZ_MIN(pState->m_dict_avail, pStream->avail_out); + memcpy(pStream->next_out, pState->m_dict + pState->m_dict_ofs, n); + pStream->next_out += n; pStream->avail_out -= n; pStream->total_out += n; + pState->m_dict_avail -= n; pState->m_dict_ofs = (pState->m_dict_ofs + n) & (TINFL_LZ_DICT_SIZE - 1); + return ((pState->m_last_status == TINFL_STATUS_DONE) && (!pState->m_dict_avail)) ? MZ_STREAM_END : MZ_OK; + } + + for ( ; ; ) + { + in_bytes = pStream->avail_in; + out_bytes = TINFL_LZ_DICT_SIZE - pState->m_dict_ofs; + + status = tinfl_decompress(&pState->m_decomp, pStream->next_in, &in_bytes, pState->m_dict, pState->m_dict + pState->m_dict_ofs, &out_bytes, decomp_flags); + pState->m_last_status = status; + + pStream->next_in += (mz_uint)in_bytes; pStream->avail_in -= (mz_uint)in_bytes; + pStream->total_in += (mz_uint)in_bytes; pStream->adler = tinfl_get_adler32(&pState->m_decomp); + + pState->m_dict_avail = (mz_uint)out_bytes; + + n = MZ_MIN(pState->m_dict_avail, pStream->avail_out); + memcpy(pStream->next_out, pState->m_dict + pState->m_dict_ofs, n); + pStream->next_out += n; pStream->avail_out -= n; pStream->total_out += n; + pState->m_dict_avail -= n; pState->m_dict_ofs = (pState->m_dict_ofs + n) & (TINFL_LZ_DICT_SIZE - 1); + + if (status < 0) + return MZ_DATA_ERROR; // Stream is corrupted (there could be some uncompressed data left in the output dictionary - oh well). + else if ((status == TINFL_STATUS_NEEDS_MORE_INPUT) && (!orig_avail_in)) + return MZ_BUF_ERROR; // Signal caller that we can't make forward progress without supplying more input or by setting flush to MZ_FINISH. + else if (flush == MZ_FINISH) + { + // The output buffer MUST be large to hold the remaining uncompressed data when flush==MZ_FINISH. + if (status == TINFL_STATUS_DONE) + return pState->m_dict_avail ? MZ_BUF_ERROR : MZ_STREAM_END; + // status here must be TINFL_STATUS_HAS_MORE_OUTPUT, which means there's at least 1 more byte on the way. If there's no more room left in the output buffer then something is wrong. + else if (!pStream->avail_out) + return MZ_BUF_ERROR; + } + else if ((status == TINFL_STATUS_DONE) || (!pStream->avail_in) || (!pStream->avail_out) || (pState->m_dict_avail)) + break; + } + + return ((status == TINFL_STATUS_DONE) && (!pState->m_dict_avail)) ? MZ_STREAM_END : MZ_OK; +} + +int mz_inflateEnd(mz_streamp pStream) +{ + if (!pStream) + return MZ_STREAM_ERROR; + if (pStream->state) + { + pStream->zfree(pStream->opaque, pStream->state); + pStream->state = NULL; + } + return MZ_OK; +} + +int mz_uncompress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len) +{ + mz_stream stream; + int status; + memset(&stream, 0, sizeof(stream)); + + // In case mz_ulong is 64-bits (argh I hate longs). + if ((source_len | *pDest_len) > 0xFFFFFFFFU) return MZ_PARAM_ERROR; + + stream.next_in = pSource; + stream.avail_in = (mz_uint32)source_len; + stream.next_out = pDest; + stream.avail_out = (mz_uint32)*pDest_len; + + status = mz_inflateInit(&stream); + if (status != MZ_OK) + return status; + + status = mz_inflate(&stream, MZ_FINISH); + if (status != MZ_STREAM_END) + { + mz_inflateEnd(&stream); + return ((status == MZ_BUF_ERROR) && (!stream.avail_in)) ? MZ_DATA_ERROR : status; + } + *pDest_len = stream.total_out; + + return mz_inflateEnd(&stream); +} + +const char *mz_error(int err) +{ + static struct { int m_err; const char *m_pDesc; } s_error_descs[] = + { + { MZ_OK, "" }, { MZ_STREAM_END, "stream end" }, { MZ_NEED_DICT, "need dictionary" }, { MZ_ERRNO, "file error" }, { MZ_STREAM_ERROR, "stream error" }, + { MZ_DATA_ERROR, "data error" }, { MZ_MEM_ERROR, "out of memory" }, { MZ_BUF_ERROR, "buf error" }, { MZ_VERSION_ERROR, "version error" }, { MZ_PARAM_ERROR, "parameter error" } + }; + mz_uint i; for (i = 0; i < sizeof(s_error_descs) / sizeof(s_error_descs[0]); ++i) if (s_error_descs[i].m_err == err) return s_error_descs[i].m_pDesc; + return NULL; +} + +#endif //MINIZ_NO_ZLIB_APIS + +// ------------------- Low-level Decompression (completely independent from all compression API's) + +#define TINFL_MEMCPY(d, s, l) memcpy(d, s, l) +#define TINFL_MEMSET(p, c, l) memset(p, c, l) + +#define TINFL_CR_BEGIN switch(r->m_state) { case 0: +#define TINFL_CR_RETURN(state_index, result) do { status = result; r->m_state = state_index; goto common_exit; case state_index:; } MZ_MACRO_END +#define TINFL_CR_RETURN_FOREVER(state_index, result) do { for ( ; ; ) { TINFL_CR_RETURN(state_index, result); } } MZ_MACRO_END +#define TINFL_CR_FINISH } + +// TODO: If the caller has indicated that there's no more input, and we attempt to read beyond the input buf, then something is wrong with the input because the inflator never +// reads ahead more than it needs to. Currently TINFL_GET_BYTE() pads the end of the stream with 0's in this scenario. +#define TINFL_GET_BYTE(state_index, c) do { \ + if (pIn_buf_cur >= pIn_buf_end) { \ + for ( ; ; ) { \ + if (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) { \ + TINFL_CR_RETURN(state_index, TINFL_STATUS_NEEDS_MORE_INPUT); \ + if (pIn_buf_cur < pIn_buf_end) { \ + c = *pIn_buf_cur++; \ + break; \ + } \ + } else { \ + c = 0; \ + break; \ + } \ + } \ + } else c = *pIn_buf_cur++; } MZ_MACRO_END + +#define TINFL_NEED_BITS(state_index, n) do { mz_uint c; TINFL_GET_BYTE(state_index, c); bit_buf |= (((tinfl_bit_buf_t)c) << num_bits); num_bits += 8; } while (num_bits < (mz_uint)(n)) +#define TINFL_SKIP_BITS(state_index, n) do { if (num_bits < (mz_uint)(n)) { TINFL_NEED_BITS(state_index, n); } bit_buf >>= (n); num_bits -= (n); } MZ_MACRO_END +#define TINFL_GET_BITS(state_index, b, n) do { if (num_bits < (mz_uint)(n)) { TINFL_NEED_BITS(state_index, n); } b = bit_buf & ((1 << (n)) - 1); bit_buf >>= (n); num_bits -= (n); } MZ_MACRO_END + +// TINFL_HUFF_BITBUF_FILL() is only used rarely, when the number of bytes remaining in the input buffer falls below 2. +// It reads just enough bytes from the input stream that are needed to decode the next Huffman code (and absolutely no more). It works by trying to fully decode a +// Huffman code by using whatever bits are currently present in the bit buffer. If this fails, it reads another byte, and tries again until it succeeds or until the +// bit buffer contains >=15 bits (deflate's max. Huffman code size). +#define TINFL_HUFF_BITBUF_FILL(state_index, pHuff) \ + do { \ + temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]; \ + if (temp >= 0) { \ + code_len = temp >> 9; \ + if ((code_len) && (num_bits >= code_len)) \ + break; \ + } else if (num_bits > TINFL_FAST_LOOKUP_BITS) { \ + code_len = TINFL_FAST_LOOKUP_BITS; \ + do { \ + temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; \ + } while ((temp < 0) && (num_bits >= (code_len + 1))); if (temp >= 0) break; \ + } TINFL_GET_BYTE(state_index, c); bit_buf |= (((tinfl_bit_buf_t)c) << num_bits); num_bits += 8; \ + } while (num_bits < 15); + +// TINFL_HUFF_DECODE() decodes the next Huffman coded symbol. It's more complex than you would initially expect because the zlib API expects the decompressor to never read +// beyond the final byte of the deflate stream. (In other words, when this macro wants to read another byte from the input, it REALLY needs another byte in order to fully +// decode the next Huffman code.) Handling this properly is particularly important on raw deflate (non-zlib) streams, which aren't followed by a byte aligned adler-32. +// The slow path is only executed at the very end of the input buffer. +#define TINFL_HUFF_DECODE(state_index, sym, pHuff) do { \ + int temp; mz_uint code_len, c; \ + if (num_bits < 15) { \ + if ((pIn_buf_end - pIn_buf_cur) < 2) { \ + TINFL_HUFF_BITBUF_FILL(state_index, pHuff); \ + } else { \ + bit_buf |= (((tinfl_bit_buf_t)pIn_buf_cur[0]) << num_bits) | (((tinfl_bit_buf_t)pIn_buf_cur[1]) << (num_bits + 8)); pIn_buf_cur += 2; num_bits += 16; \ + } \ + } \ + if ((temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) \ + code_len = temp >> 9, temp &= 511; \ + else { \ + code_len = TINFL_FAST_LOOKUP_BITS; do { temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; } while (temp < 0); \ + } sym = temp; bit_buf >>= code_len; num_bits -= code_len; } MZ_MACRO_END + +tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_next, size_t *pIn_buf_size, mz_uint8 *pOut_buf_start, mz_uint8 *pOut_buf_next, size_t *pOut_buf_size, const mz_uint32 decomp_flags) +{ + static const int s_length_base[31] = { 3,4,5,6,7,8,9,10,11,13, 15,17,19,23,27,31,35,43,51,59, 67,83,99,115,131,163,195,227,258,0,0 }; + static const int s_length_extra[31]= { 0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0 }; + static const int s_dist_base[32] = { 1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193, 257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0}; + static const int s_dist_extra[32] = { 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13}; + static const mz_uint8 s_length_dezigzag[19] = { 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15 }; + static const int s_min_table_sizes[3] = { 257, 1, 4 }; + + tinfl_status status = TINFL_STATUS_FAILED; mz_uint32 num_bits, dist, counter, num_extra; tinfl_bit_buf_t bit_buf; + const mz_uint8 *pIn_buf_cur = pIn_buf_next, *const pIn_buf_end = pIn_buf_next + *pIn_buf_size; + mz_uint8 *pOut_buf_cur = pOut_buf_next, *const pOut_buf_end = pOut_buf_next + *pOut_buf_size; + size_t out_buf_size_mask = (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF) ? (size_t)-1 : ((pOut_buf_next - pOut_buf_start) + *pOut_buf_size) - 1, dist_from_out_buf_start; + + // Ensure the output buffer's size is a power of 2, unless the output buffer is large enough to hold the entire output file (in which case it doesn't matter). + if (((out_buf_size_mask + 1) & out_buf_size_mask) || (pOut_buf_next < pOut_buf_start)) { *pIn_buf_size = *pOut_buf_size = 0; return TINFL_STATUS_BAD_PARAM; } + + num_bits = r->m_num_bits; bit_buf = r->m_bit_buf; dist = r->m_dist; counter = r->m_counter; num_extra = r->m_num_extra; dist_from_out_buf_start = r->m_dist_from_out_buf_start; + TINFL_CR_BEGIN + + bit_buf = num_bits = dist = counter = num_extra = r->m_zhdr0 = r->m_zhdr1 = 0; r->m_z_adler32 = r->m_check_adler32 = 1; + if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER) + { + TINFL_GET_BYTE(1, r->m_zhdr0); TINFL_GET_BYTE(2, r->m_zhdr1); + counter = (((r->m_zhdr0 * 256 + r->m_zhdr1) % 31 != 0) || (r->m_zhdr1 & 32) || ((r->m_zhdr0 & 15) != 8)); + if (!(decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF)) counter |= (((1U << (8U + (r->m_zhdr0 >> 4))) > 32768U) || ((out_buf_size_mask + 1) < (size_t)(1U << (8U + (r->m_zhdr0 >> 4))))); + if (counter) { TINFL_CR_RETURN_FOREVER(36, TINFL_STATUS_FAILED); } + } + + do + { + TINFL_GET_BITS(3, r->m_final, 3); r->m_type = r->m_final >> 1; + if (r->m_type == 0) + { + TINFL_SKIP_BITS(5, num_bits & 7); + for (counter = 0; counter < 4; ++counter) { if (num_bits) TINFL_GET_BITS(6, r->m_raw_header[counter], 8); else TINFL_GET_BYTE(7, r->m_raw_header[counter]); } + if ((counter = (r->m_raw_header[0] | (r->m_raw_header[1] << 8))) != (mz_uint)(0xFFFF ^ (r->m_raw_header[2] | (r->m_raw_header[3] << 8)))) { TINFL_CR_RETURN_FOREVER(39, TINFL_STATUS_FAILED); } + while ((counter) && (num_bits)) + { + TINFL_GET_BITS(51, dist, 8); + while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(52, TINFL_STATUS_HAS_MORE_OUTPUT); } + *pOut_buf_cur++ = (mz_uint8)dist; + counter--; + } + while (counter) + { + size_t n; while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(9, TINFL_STATUS_HAS_MORE_OUTPUT); } + while (pIn_buf_cur >= pIn_buf_end) + { + if (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) + { + TINFL_CR_RETURN(38, TINFL_STATUS_NEEDS_MORE_INPUT); + } + else + { + TINFL_CR_RETURN_FOREVER(40, TINFL_STATUS_FAILED); + } + } + n = MZ_MIN(MZ_MIN((size_t)(pOut_buf_end - pOut_buf_cur), (size_t)(pIn_buf_end - pIn_buf_cur)), counter); + TINFL_MEMCPY(pOut_buf_cur, pIn_buf_cur, n); pIn_buf_cur += n; pOut_buf_cur += n; counter -= (mz_uint)n; + } + } + else if (r->m_type == 3) + { + TINFL_CR_RETURN_FOREVER(10, TINFL_STATUS_FAILED); + } + else + { + if (r->m_type == 1) + { + mz_uint8 *p = r->m_tables[0].m_code_size; mz_uint i; + r->m_table_sizes[0] = 288; r->m_table_sizes[1] = 32; TINFL_MEMSET(r->m_tables[1].m_code_size, 5, 32); + for ( i = 0; i <= 143; ++i) *p++ = 8; for ( ; i <= 255; ++i) *p++ = 9; for ( ; i <= 279; ++i) *p++ = 7; for ( ; i <= 287; ++i) *p++ = 8; + } + else + { + for (counter = 0; counter < 3; counter++) { TINFL_GET_BITS(11, r->m_table_sizes[counter], "\05\05\04"[counter]); r->m_table_sizes[counter] += s_min_table_sizes[counter]; } + MZ_CLEAR_OBJ(r->m_tables[2].m_code_size); for (counter = 0; counter < r->m_table_sizes[2]; counter++) { mz_uint s; TINFL_GET_BITS(14, s, 3); r->m_tables[2].m_code_size[s_length_dezigzag[counter]] = (mz_uint8)s; } + r->m_table_sizes[2] = 19; + } + for ( ; (int)r->m_type >= 0; r->m_type--) + { + int tree_next, tree_cur; tinfl_huff_table *pTable; + mz_uint i, j, used_syms, total, sym_index, next_code[17], total_syms[16]; pTable = &r->m_tables[r->m_type]; MZ_CLEAR_OBJ(total_syms); MZ_CLEAR_OBJ(pTable->m_look_up); MZ_CLEAR_OBJ(pTable->m_tree); + for (i = 0; i < r->m_table_sizes[r->m_type]; ++i) total_syms[pTable->m_code_size[i]]++; + used_syms = 0, total = 0; next_code[0] = next_code[1] = 0; + for (i = 1; i <= 15; ++i) { used_syms += total_syms[i]; next_code[i + 1] = (total = ((total + total_syms[i]) << 1)); } + if ((65536 != total) && (used_syms > 1)) + { + TINFL_CR_RETURN_FOREVER(35, TINFL_STATUS_FAILED); + } + for (tree_next = -1, sym_index = 0; sym_index < r->m_table_sizes[r->m_type]; ++sym_index) + { + mz_uint rev_code = 0, l, cur_code, code_size = pTable->m_code_size[sym_index]; if (!code_size) continue; + cur_code = next_code[code_size]++; for (l = code_size; l > 0; l--, cur_code >>= 1) rev_code = (rev_code << 1) | (cur_code & 1); + if (code_size <= TINFL_FAST_LOOKUP_BITS) { mz_int16 k = (mz_int16)((code_size << 9) | sym_index); while (rev_code < TINFL_FAST_LOOKUP_SIZE) { pTable->m_look_up[rev_code] = k; rev_code += (1 << code_size); } continue; } + if (0 == (tree_cur = pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)])) { pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next; tree_cur = tree_next; tree_next -= 2; } + rev_code >>= (TINFL_FAST_LOOKUP_BITS - 1); + for (j = code_size; j > (TINFL_FAST_LOOKUP_BITS + 1); j--) + { + tree_cur -= ((rev_code >>= 1) & 1); + if (!pTable->m_tree[-tree_cur - 1]) { pTable->m_tree[-tree_cur - 1] = (mz_int16)tree_next; tree_cur = tree_next; tree_next -= 2; } else tree_cur = pTable->m_tree[-tree_cur - 1]; + } + tree_cur -= ((rev_code >>= 1) & 1); pTable->m_tree[-tree_cur - 1] = (mz_int16)sym_index; + } + if (r->m_type == 2) + { + for (counter = 0; counter < (r->m_table_sizes[0] + r->m_table_sizes[1]); ) + { + mz_uint s; TINFL_HUFF_DECODE(16, dist, &r->m_tables[2]); if (dist < 16) { r->m_len_codes[counter++] = (mz_uint8)dist; continue; } + if ((dist == 16) && (!counter)) + { + TINFL_CR_RETURN_FOREVER(17, TINFL_STATUS_FAILED); + } + num_extra = "\02\03\07"[dist - 16]; TINFL_GET_BITS(18, s, num_extra); s += "\03\03\013"[dist - 16]; + TINFL_MEMSET(r->m_len_codes + counter, (dist == 16) ? r->m_len_codes[counter - 1] : 0, s); counter += s; + } + if ((r->m_table_sizes[0] + r->m_table_sizes[1]) != counter) + { + TINFL_CR_RETURN_FOREVER(21, TINFL_STATUS_FAILED); + } + TINFL_MEMCPY(r->m_tables[0].m_code_size, r->m_len_codes, r->m_table_sizes[0]); TINFL_MEMCPY(r->m_tables[1].m_code_size, r->m_len_codes + r->m_table_sizes[0], r->m_table_sizes[1]); + } + } + for ( ; ; ) + { + mz_uint8 *pSrc; + for ( ; ; ) + { + if (((pIn_buf_end - pIn_buf_cur) < 4) || ((pOut_buf_end - pOut_buf_cur) < 2)) + { + TINFL_HUFF_DECODE(23, counter, &r->m_tables[0]); + if (counter >= 256) + break; + while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(24, TINFL_STATUS_HAS_MORE_OUTPUT); } + *pOut_buf_cur++ = (mz_uint8)counter; + } + else + { + int sym2; mz_uint code_len; +#if TINFL_USE_64BIT_BITBUF + if (num_bits < 30) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE32(pIn_buf_cur)) << num_bits); pIn_buf_cur += 4; num_bits += 32; } +#else + if (num_bits < 15) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE16(pIn_buf_cur)) << num_bits); pIn_buf_cur += 2; num_bits += 16; } +#endif + if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) + code_len = sym2 >> 9; + else + { + code_len = TINFL_FAST_LOOKUP_BITS; do { sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)]; } while (sym2 < 0); + } + counter = sym2; bit_buf >>= code_len; num_bits -= code_len; + if (counter & 256) + break; + +#if !TINFL_USE_64BIT_BITBUF + if (num_bits < 15) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE16(pIn_buf_cur)) << num_bits); pIn_buf_cur += 2; num_bits += 16; } +#endif + if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) + code_len = sym2 >> 9; + else + { + code_len = TINFL_FAST_LOOKUP_BITS; do { sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)]; } while (sym2 < 0); + } + bit_buf >>= code_len; num_bits -= code_len; + + pOut_buf_cur[0] = (mz_uint8)counter; + if (sym2 & 256) + { + pOut_buf_cur++; + counter = sym2; + break; + } + pOut_buf_cur[1] = (mz_uint8)sym2; + pOut_buf_cur += 2; + } + } + if ((counter &= 511) == 256) break; + + num_extra = s_length_extra[counter - 257]; counter = s_length_base[counter - 257]; + if (num_extra) { mz_uint extra_bits; TINFL_GET_BITS(25, extra_bits, num_extra); counter += extra_bits; } + + TINFL_HUFF_DECODE(26, dist, &r->m_tables[1]); + num_extra = s_dist_extra[dist]; dist = s_dist_base[dist]; + if (num_extra) { mz_uint extra_bits; TINFL_GET_BITS(27, extra_bits, num_extra); dist += extra_bits; } + + dist_from_out_buf_start = pOut_buf_cur - pOut_buf_start; + if ((dist > dist_from_out_buf_start) && (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF)) + { + TINFL_CR_RETURN_FOREVER(37, TINFL_STATUS_FAILED); + } + + pSrc = pOut_buf_start + ((dist_from_out_buf_start - dist) & out_buf_size_mask); + + if ((MZ_MAX(pOut_buf_cur, pSrc) + counter) > pOut_buf_end) + { + while (counter--) + { + while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(53, TINFL_STATUS_HAS_MORE_OUTPUT); } + *pOut_buf_cur++ = pOut_buf_start[(dist_from_out_buf_start++ - dist) & out_buf_size_mask]; + } + continue; + } +#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES + else if ((counter >= 9) && (counter <= dist)) + { + const mz_uint8 *pSrc_end = pSrc + (counter & ~7); + do + { + ((mz_uint32 *)pOut_buf_cur)[0] = ((const mz_uint32 *)pSrc)[0]; + ((mz_uint32 *)pOut_buf_cur)[1] = ((const mz_uint32 *)pSrc)[1]; + pOut_buf_cur += 8; + } while ((pSrc += 8) < pSrc_end); + if ((counter &= 7) < 3) + { + if (counter) + { + pOut_buf_cur[0] = pSrc[0]; + if (counter > 1) + pOut_buf_cur[1] = pSrc[1]; + pOut_buf_cur += counter; + } + continue; + } + } +#endif + do + { + pOut_buf_cur[0] = pSrc[0]; + pOut_buf_cur[1] = pSrc[1]; + pOut_buf_cur[2] = pSrc[2]; + pOut_buf_cur += 3; pSrc += 3; + } while ((int)(counter -= 3) > 2); + if ((int)counter > 0) + { + pOut_buf_cur[0] = pSrc[0]; + if ((int)counter > 1) + pOut_buf_cur[1] = pSrc[1]; + pOut_buf_cur += counter; + } + } + } + } while (!(r->m_final & 1)); + if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER) + { + TINFL_SKIP_BITS(32, num_bits & 7); for (counter = 0; counter < 4; ++counter) { mz_uint s; if (num_bits) TINFL_GET_BITS(41, s, 8); else TINFL_GET_BYTE(42, s); r->m_z_adler32 = (r->m_z_adler32 << 8) | s; } + } + TINFL_CR_RETURN_FOREVER(34, TINFL_STATUS_DONE); + TINFL_CR_FINISH + +common_exit: + r->m_num_bits = num_bits; r->m_bit_buf = bit_buf; r->m_dist = dist; r->m_counter = counter; r->m_num_extra = num_extra; r->m_dist_from_out_buf_start = dist_from_out_buf_start; + *pIn_buf_size = pIn_buf_cur - pIn_buf_next; *pOut_buf_size = pOut_buf_cur - pOut_buf_next; + if ((decomp_flags & (TINFL_FLAG_PARSE_ZLIB_HEADER | TINFL_FLAG_COMPUTE_ADLER32)) && (status >= 0)) + { + const mz_uint8 *ptr = pOut_buf_next; size_t buf_len = *pOut_buf_size; + mz_uint32 i, s1 = r->m_check_adler32 & 0xffff, s2 = r->m_check_adler32 >> 16; size_t block_len = buf_len % 5552; + while (buf_len) + { + for (i = 0; i + 7 < block_len; i += 8, ptr += 8) + { + s1 += ptr[0], s2 += s1; s1 += ptr[1], s2 += s1; s1 += ptr[2], s2 += s1; s1 += ptr[3], s2 += s1; + s1 += ptr[4], s2 += s1; s1 += ptr[5], s2 += s1; s1 += ptr[6], s2 += s1; s1 += ptr[7], s2 += s1; + } + for ( ; i < block_len; ++i) s1 += *ptr++, s2 += s1; + s1 %= 65521U, s2 %= 65521U; buf_len -= block_len; block_len = 5552; + } + r->m_check_adler32 = (s2 << 16) + s1; if ((status == TINFL_STATUS_DONE) && (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER) && (r->m_check_adler32 != r->m_z_adler32)) status = TINFL_STATUS_ADLER32_MISMATCH; + } + return status; +} + +// Higher level helper functions. +void *tinfl_decompress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags) +{ + tinfl_decompressor decomp; void *pBuf = NULL, *pNew_buf; size_t src_buf_ofs = 0, out_buf_capacity = 0; + *pOut_len = 0; + tinfl_init(&decomp); + for ( ; ; ) + { + size_t src_buf_size = src_buf_len - src_buf_ofs, dst_buf_size = out_buf_capacity - *pOut_len, new_out_buf_capacity; + tinfl_status status = tinfl_decompress(&decomp, (const mz_uint8*)pSrc_buf + src_buf_ofs, &src_buf_size, (mz_uint8*)pBuf, pBuf ? (mz_uint8*)pBuf + *pOut_len : NULL, &dst_buf_size, + (flags & ~TINFL_FLAG_HAS_MORE_INPUT) | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF); + if ((status < 0) || (status == TINFL_STATUS_NEEDS_MORE_INPUT)) + { + MZ_FREE(pBuf); *pOut_len = 0; return NULL; + } + src_buf_ofs += src_buf_size; + *pOut_len += dst_buf_size; + if (status == TINFL_STATUS_DONE) break; + new_out_buf_capacity = out_buf_capacity * 2; if (new_out_buf_capacity < 128) new_out_buf_capacity = 128; + pNew_buf = MZ_REALLOC(pBuf, new_out_buf_capacity); + if (!pNew_buf) + { + MZ_FREE(pBuf); *pOut_len = 0; return NULL; + } + pBuf = pNew_buf; out_buf_capacity = new_out_buf_capacity; + } + return pBuf; +} + +size_t tinfl_decompress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags) +{ + tinfl_decompressor decomp; tinfl_status status; tinfl_init(&decomp); + status = tinfl_decompress(&decomp, (const mz_uint8*)pSrc_buf, &src_buf_len, (mz_uint8*)pOut_buf, (mz_uint8*)pOut_buf, &out_buf_len, (flags & ~TINFL_FLAG_HAS_MORE_INPUT) | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF); + return (status != TINFL_STATUS_DONE) ? TINFL_DECOMPRESS_MEM_TO_MEM_FAILED : out_buf_len; +} + +int tinfl_decompress_mem_to_callback(const void *pIn_buf, size_t *pIn_buf_size, tinfl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags) +{ + int result = 0; + tinfl_decompressor decomp; + mz_uint8 *pDict = (mz_uint8*)MZ_MALLOC(TINFL_LZ_DICT_SIZE); size_t in_buf_ofs = 0, dict_ofs = 0; + if (!pDict) + return TINFL_STATUS_FAILED; + tinfl_init(&decomp); + for ( ; ; ) + { + size_t in_buf_size = *pIn_buf_size - in_buf_ofs, dst_buf_size = TINFL_LZ_DICT_SIZE - dict_ofs; + tinfl_status status = tinfl_decompress(&decomp, (const mz_uint8*)pIn_buf + in_buf_ofs, &in_buf_size, pDict, pDict + dict_ofs, &dst_buf_size, + (flags & ~(TINFL_FLAG_HAS_MORE_INPUT | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF))); + in_buf_ofs += in_buf_size; + if ((dst_buf_size) && (!(*pPut_buf_func)(pDict + dict_ofs, (int)dst_buf_size, pPut_buf_user))) + break; + if (status != TINFL_STATUS_HAS_MORE_OUTPUT) + { + result = (status == TINFL_STATUS_DONE); + break; + } + dict_ofs = (dict_ofs + dst_buf_size) & (TINFL_LZ_DICT_SIZE - 1); + } + MZ_FREE(pDict); + *pIn_buf_size = in_buf_ofs; + return result; +} + +// ------------------- Low-level Compression (independent from all decompression API's) + +// Purposely making these tables static for faster init and thread safety. +static const mz_uint16 s_tdefl_len_sym[256] = { + 257,258,259,260,261,262,263,264,265,265,266,266,267,267,268,268,269,269,269,269,270,270,270,270,271,271,271,271,272,272,272,272, + 273,273,273,273,273,273,273,273,274,274,274,274,274,274,274,274,275,275,275,275,275,275,275,275,276,276,276,276,276,276,276,276, + 277,277,277,277,277,277,277,277,277,277,277,277,277,277,277,277,278,278,278,278,278,278,278,278,278,278,278,278,278,278,278,278, + 279,279,279,279,279,279,279,279,279,279,279,279,279,279,279,279,280,280,280,280,280,280,280,280,280,280,280,280,280,280,280,280, + 281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281,281, + 282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282,282, + 283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283,283, + 284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,284,285 }; + +static const mz_uint8 s_tdefl_len_extra[256] = { + 0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, + 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, + 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,0 }; + +static const mz_uint8 s_tdefl_small_dist_sym[512] = { + 0,1,2,3,4,4,5,5,6,6,6,6,7,7,7,7,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11, + 11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,13, + 13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,14,14,14,14,14,14,14,14,14,14,14,14, + 14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14, + 14,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15, + 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,16,16,16,16,16,16,16,16,16,16,16,16,16, + 16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16, + 16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16, + 16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,17,17,17,17,17,17,17,17,17,17,17,17,17,17, + 17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17, + 17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17, + 17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17 }; + +static const mz_uint8 s_tdefl_small_dist_extra[512] = { + 0,0,0,0,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5, + 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, + 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, + 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7 }; + +static const mz_uint8 s_tdefl_large_dist_sym[128] = { + 0,0,18,19,20,20,21,21,22,22,22,22,23,23,23,23,24,24,24,24,24,24,24,24,25,25,25,25,25,25,25,25,26,26,26,26,26,26,26,26,26,26,26,26, + 26,26,26,26,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28, + 28,28,28,28,28,28,28,28,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29 }; + +static const mz_uint8 s_tdefl_large_dist_extra[128] = { + 0,0,8,8,9,9,9,9,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12, + 12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13, + 13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13 }; + +// Radix sorts tdefl_sym_freq[] array by 16-bit key m_key. Returns ptr to sorted values. +typedef struct { mz_uint16 m_key, m_sym_index; } tdefl_sym_freq; +static tdefl_sym_freq* tdefl_radix_sort_syms(mz_uint num_syms, tdefl_sym_freq* pSyms0, tdefl_sym_freq* pSyms1) +{ + mz_uint32 total_passes = 2, pass_shift, pass, i, hist[256 * 2]; tdefl_sym_freq* pCur_syms = pSyms0, *pNew_syms = pSyms1; MZ_CLEAR_OBJ(hist); + for (i = 0; i < num_syms; i++) { mz_uint freq = pSyms0[i].m_key; hist[freq & 0xFF]++; hist[256 + ((freq >> 8) & 0xFF)]++; } + while ((total_passes > 1) && (num_syms == hist[(total_passes - 1) * 256])) total_passes--; + for (pass_shift = 0, pass = 0; pass < total_passes; pass++, pass_shift += 8) + { + const mz_uint32* pHist = &hist[pass << 8]; + mz_uint offsets[256], cur_ofs = 0; + for (i = 0; i < 256; i++) { offsets[i] = cur_ofs; cur_ofs += pHist[i]; } + for (i = 0; i < num_syms; i++) pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = pCur_syms[i]; + { tdefl_sym_freq* t = pCur_syms; pCur_syms = pNew_syms; pNew_syms = t; } + } + return pCur_syms; +} + +// tdefl_calculate_minimum_redundancy() originally written by: Alistair Moffat, alistair@cs.mu.oz.au, Jyrki Katajainen, jyrki@diku.dk, November 1996. +static void tdefl_calculate_minimum_redundancy(tdefl_sym_freq *A, int n) +{ + int root, leaf, next, avbl, used, dpth; + if (n==0) return; else if (n==1) { A[0].m_key = 1; return; } + A[0].m_key += A[1].m_key; root = 0; leaf = 2; + for (next=1; next < n-1; next++) + { + if (leaf>=n || A[root].m_key=n || (root=0; next--) A[next].m_key = A[A[next].m_key].m_key+1; + avbl = 1; used = dpth = 0; root = n-2; next = n-1; + while (avbl>0) + { + while (root>=0 && (int)A[root].m_key==dpth) { used++; root--; } + while (avbl>used) { A[next--].m_key = (mz_uint16)(dpth); avbl--; } + avbl = 2*used; dpth++; used = 0; + } +} + +// Limits canonical Huffman code table's max code size. +enum { TDEFL_MAX_SUPPORTED_HUFF_CODESIZE = 32 }; +static void tdefl_huffman_enforce_max_code_size(int *pNum_codes, int code_list_len, int max_code_size) +{ + int i; mz_uint32 total = 0; if (code_list_len <= 1) return; + for (i = max_code_size + 1; i <= TDEFL_MAX_SUPPORTED_HUFF_CODESIZE; i++) pNum_codes[max_code_size] += pNum_codes[i]; + for (i = max_code_size; i > 0; i--) total += (((mz_uint32)pNum_codes[i]) << (max_code_size - i)); + while (total != (1UL << max_code_size)) + { + pNum_codes[max_code_size]--; + for (i = max_code_size - 1; i > 0; i--) if (pNum_codes[i]) { pNum_codes[i]--; pNum_codes[i + 1] += 2; break; } + total--; + } +} + +static void tdefl_optimize_huffman_table(tdefl_compressor *d, int table_num, int table_len, int code_size_limit, int static_table) +{ + int i, j, l, num_codes[1 + TDEFL_MAX_SUPPORTED_HUFF_CODESIZE]; mz_uint next_code[TDEFL_MAX_SUPPORTED_HUFF_CODESIZE + 1]; MZ_CLEAR_OBJ(num_codes); + if (static_table) + { + for (i = 0; i < table_len; i++) num_codes[d->m_huff_code_sizes[table_num][i]]++; + } + else + { + tdefl_sym_freq syms0[TDEFL_MAX_HUFF_SYMBOLS], syms1[TDEFL_MAX_HUFF_SYMBOLS], *pSyms; + int num_used_syms = 0; + const mz_uint16 *pSym_count = &d->m_huff_count[table_num][0]; + for (i = 0; i < table_len; i++) if (pSym_count[i]) { syms0[num_used_syms].m_key = (mz_uint16)pSym_count[i]; syms0[num_used_syms++].m_sym_index = (mz_uint16)i; } + + pSyms = tdefl_radix_sort_syms(num_used_syms, syms0, syms1); tdefl_calculate_minimum_redundancy(pSyms, num_used_syms); + + for (i = 0; i < num_used_syms; i++) num_codes[pSyms[i].m_key]++; + + tdefl_huffman_enforce_max_code_size(num_codes, num_used_syms, code_size_limit); + + MZ_CLEAR_OBJ(d->m_huff_code_sizes[table_num]); MZ_CLEAR_OBJ(d->m_huff_codes[table_num]); + for (i = 1, j = num_used_syms; i <= code_size_limit; i++) + for (l = num_codes[i]; l > 0; l--) d->m_huff_code_sizes[table_num][pSyms[--j].m_sym_index] = (mz_uint8)(i); + } + + next_code[1] = 0; for (j = 0, i = 2; i <= code_size_limit; i++) next_code[i] = j = ((j + num_codes[i - 1]) << 1); + + for (i = 0; i < table_len; i++) + { + mz_uint rev_code = 0, code, code_size; if ((code_size = d->m_huff_code_sizes[table_num][i]) == 0) continue; + code = next_code[code_size]++; for (l = code_size; l > 0; l--, code >>= 1) rev_code = (rev_code << 1) | (code & 1); + d->m_huff_codes[table_num][i] = (mz_uint16)rev_code; + } +} + +#define TDEFL_PUT_BITS(b, l) do { \ + mz_uint bits = b; mz_uint len = l; MZ_ASSERT(bits <= ((1U << len) - 1U)); \ + d->m_bit_buffer |= (bits << d->m_bits_in); d->m_bits_in += len; \ + while (d->m_bits_in >= 8) { \ + if (d->m_pOutput_buf < d->m_pOutput_buf_end) \ + *d->m_pOutput_buf++ = (mz_uint8)(d->m_bit_buffer); \ + d->m_bit_buffer >>= 8; \ + d->m_bits_in -= 8; \ + } \ +} MZ_MACRO_END + +#define TDEFL_RLE_PREV_CODE_SIZE() { if (rle_repeat_count) { \ + if (rle_repeat_count < 3) { \ + d->m_huff_count[2][prev_code_size] = (mz_uint16)(d->m_huff_count[2][prev_code_size] + rle_repeat_count); \ + while (rle_repeat_count--) packed_code_sizes[num_packed_code_sizes++] = prev_code_size; \ + } else { \ + d->m_huff_count[2][16] = (mz_uint16)(d->m_huff_count[2][16] + 1); packed_code_sizes[num_packed_code_sizes++] = 16; packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_repeat_count - 3); \ +} rle_repeat_count = 0; } } + +#define TDEFL_RLE_ZERO_CODE_SIZE() { if (rle_z_count) { \ + if (rle_z_count < 3) { \ + d->m_huff_count[2][0] = (mz_uint16)(d->m_huff_count[2][0] + rle_z_count); while (rle_z_count--) packed_code_sizes[num_packed_code_sizes++] = 0; \ + } else if (rle_z_count <= 10) { \ + d->m_huff_count[2][17] = (mz_uint16)(d->m_huff_count[2][17] + 1); packed_code_sizes[num_packed_code_sizes++] = 17; packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_z_count - 3); \ + } else { \ + d->m_huff_count[2][18] = (mz_uint16)(d->m_huff_count[2][18] + 1); packed_code_sizes[num_packed_code_sizes++] = 18; packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_z_count - 11); \ +} rle_z_count = 0; } } + +static mz_uint8 s_tdefl_packed_code_size_syms_swizzle[] = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 }; + +static void tdefl_start_dynamic_block(tdefl_compressor *d) +{ + int num_lit_codes, num_dist_codes, num_bit_lengths; mz_uint i, total_code_sizes_to_pack, num_packed_code_sizes, rle_z_count, rle_repeat_count, packed_code_sizes_index; + mz_uint8 code_sizes_to_pack[TDEFL_MAX_HUFF_SYMBOLS_0 + TDEFL_MAX_HUFF_SYMBOLS_1], packed_code_sizes[TDEFL_MAX_HUFF_SYMBOLS_0 + TDEFL_MAX_HUFF_SYMBOLS_1], prev_code_size = 0xFF; + + d->m_huff_count[0][256] = 1; + + tdefl_optimize_huffman_table(d, 0, TDEFL_MAX_HUFF_SYMBOLS_0, 15, MZ_FALSE); + tdefl_optimize_huffman_table(d, 1, TDEFL_MAX_HUFF_SYMBOLS_1, 15, MZ_FALSE); + + for (num_lit_codes = 286; num_lit_codes > 257; num_lit_codes--) if (d->m_huff_code_sizes[0][num_lit_codes - 1]) break; + for (num_dist_codes = 30; num_dist_codes > 1; num_dist_codes--) if (d->m_huff_code_sizes[1][num_dist_codes - 1]) break; + + memcpy(code_sizes_to_pack, &d->m_huff_code_sizes[0][0], num_lit_codes); + memcpy(code_sizes_to_pack + num_lit_codes, &d->m_huff_code_sizes[1][0], num_dist_codes); + total_code_sizes_to_pack = num_lit_codes + num_dist_codes; num_packed_code_sizes = 0; rle_z_count = 0; rle_repeat_count = 0; + + memset(&d->m_huff_count[2][0], 0, sizeof(d->m_huff_count[2][0]) * TDEFL_MAX_HUFF_SYMBOLS_2); + for (i = 0; i < total_code_sizes_to_pack; i++) + { + mz_uint8 code_size = code_sizes_to_pack[i]; + if (!code_size) + { + TDEFL_RLE_PREV_CODE_SIZE(); + if (++rle_z_count == 138) { TDEFL_RLE_ZERO_CODE_SIZE(); } + } + else + { + TDEFL_RLE_ZERO_CODE_SIZE(); + if (code_size != prev_code_size) + { + TDEFL_RLE_PREV_CODE_SIZE(); + d->m_huff_count[2][code_size] = (mz_uint16)(d->m_huff_count[2][code_size] + 1); packed_code_sizes[num_packed_code_sizes++] = code_size; + } + else if (++rle_repeat_count == 6) + { + TDEFL_RLE_PREV_CODE_SIZE(); + } + } + prev_code_size = code_size; + } + if (rle_repeat_count) { TDEFL_RLE_PREV_CODE_SIZE(); } else { TDEFL_RLE_ZERO_CODE_SIZE(); } + + tdefl_optimize_huffman_table(d, 2, TDEFL_MAX_HUFF_SYMBOLS_2, 7, MZ_FALSE); + + TDEFL_PUT_BITS(2, 2); + + TDEFL_PUT_BITS(num_lit_codes - 257, 5); + TDEFL_PUT_BITS(num_dist_codes - 1, 5); + + for (num_bit_lengths = 18; num_bit_lengths >= 0; num_bit_lengths--) if (d->m_huff_code_sizes[2][s_tdefl_packed_code_size_syms_swizzle[num_bit_lengths]]) break; + num_bit_lengths = MZ_MAX(4, (num_bit_lengths + 1)); TDEFL_PUT_BITS(num_bit_lengths - 4, 4); + for (i = 0; (int)i < num_bit_lengths; i++) TDEFL_PUT_BITS(d->m_huff_code_sizes[2][s_tdefl_packed_code_size_syms_swizzle[i]], 3); + + for (packed_code_sizes_index = 0; packed_code_sizes_index < num_packed_code_sizes; ) + { + mz_uint code = packed_code_sizes[packed_code_sizes_index++]; MZ_ASSERT(code < TDEFL_MAX_HUFF_SYMBOLS_2); + TDEFL_PUT_BITS(d->m_huff_codes[2][code], d->m_huff_code_sizes[2][code]); + if (code >= 16) TDEFL_PUT_BITS(packed_code_sizes[packed_code_sizes_index++], "\02\03\07"[code - 16]); + } +} + +static void tdefl_start_static_block(tdefl_compressor *d) +{ + mz_uint i; + mz_uint8 *p = &d->m_huff_code_sizes[0][0]; + + for (i = 0; i <= 143; ++i) *p++ = 8; + for ( ; i <= 255; ++i) *p++ = 9; + for ( ; i <= 279; ++i) *p++ = 7; + for ( ; i <= 287; ++i) *p++ = 8; + + memset(d->m_huff_code_sizes[1], 5, 32); + + tdefl_optimize_huffman_table(d, 0, 288, 15, MZ_TRUE); + tdefl_optimize_huffman_table(d, 1, 32, 15, MZ_TRUE); + + TDEFL_PUT_BITS(1, 2); +} + +static const mz_uint mz_bitmasks[17] = { 0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F, 0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF, 0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF }; + +#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN && MINIZ_HAS_64BIT_REGISTERS +static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d) +{ + mz_uint flags; + mz_uint8 *pLZ_codes; + mz_uint8 *pOutput_buf = d->m_pOutput_buf; + mz_uint8 *pLZ_code_buf_end = d->m_pLZ_code_buf; + mz_uint64 bit_buffer = d->m_bit_buffer; + mz_uint bits_in = d->m_bits_in; + +#define TDEFL_PUT_BITS_FAST(b, l) { bit_buffer |= (((mz_uint64)(b)) << bits_in); bits_in += (l); } + + flags = 1; + for (pLZ_codes = d->m_lz_code_buf; pLZ_codes < pLZ_code_buf_end; flags >>= 1) + { + if (flags == 1) + flags = *pLZ_codes++ | 0x100; + + if (flags & 1) + { + mz_uint s0, s1, n0, n1, sym, num_extra_bits; + mz_uint match_len = pLZ_codes[0], match_dist = *(const mz_uint16 *)(pLZ_codes + 1); pLZ_codes += 3; + + MZ_ASSERT(d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]); + TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][s_tdefl_len_sym[match_len]], d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]); + TDEFL_PUT_BITS_FAST(match_len & mz_bitmasks[s_tdefl_len_extra[match_len]], s_tdefl_len_extra[match_len]); + + // This sequence coaxes MSVC into using cmov's vs. jmp's. + s0 = s_tdefl_small_dist_sym[match_dist & 511]; + n0 = s_tdefl_small_dist_extra[match_dist & 511]; + s1 = s_tdefl_large_dist_sym[match_dist >> 8]; + n1 = s_tdefl_large_dist_extra[match_dist >> 8]; + sym = (match_dist < 512) ? s0 : s1; + num_extra_bits = (match_dist < 512) ? n0 : n1; + + MZ_ASSERT(d->m_huff_code_sizes[1][sym]); + TDEFL_PUT_BITS_FAST(d->m_huff_codes[1][sym], d->m_huff_code_sizes[1][sym]); + TDEFL_PUT_BITS_FAST(match_dist & mz_bitmasks[num_extra_bits], num_extra_bits); + } + else + { + mz_uint lit = *pLZ_codes++; + MZ_ASSERT(d->m_huff_code_sizes[0][lit]); + TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]); + + if (((flags & 2) == 0) && (pLZ_codes < pLZ_code_buf_end)) + { + flags >>= 1; + lit = *pLZ_codes++; + MZ_ASSERT(d->m_huff_code_sizes[0][lit]); + TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]); + + if (((flags & 2) == 0) && (pLZ_codes < pLZ_code_buf_end)) + { + flags >>= 1; + lit = *pLZ_codes++; + MZ_ASSERT(d->m_huff_code_sizes[0][lit]); + TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]); + } + } + } + + if (pOutput_buf >= d->m_pOutput_buf_end) + return MZ_FALSE; + + *(mz_uint64*)pOutput_buf = bit_buffer; + pOutput_buf += (bits_in >> 3); + bit_buffer >>= (bits_in & ~7); + bits_in &= 7; + } + +#undef TDEFL_PUT_BITS_FAST + + d->m_pOutput_buf = pOutput_buf; + d->m_bits_in = 0; + d->m_bit_buffer = 0; + + while (bits_in) + { + mz_uint32 n = MZ_MIN(bits_in, 16); + TDEFL_PUT_BITS((mz_uint)bit_buffer & mz_bitmasks[n], n); + bit_buffer >>= n; + bits_in -= n; + } + + TDEFL_PUT_BITS(d->m_huff_codes[0][256], d->m_huff_code_sizes[0][256]); + + return (d->m_pOutput_buf < d->m_pOutput_buf_end); +} +#else +static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d) +{ + mz_uint flags; + mz_uint8 *pLZ_codes; + + flags = 1; + for (pLZ_codes = d->m_lz_code_buf; pLZ_codes < d->m_pLZ_code_buf; flags >>= 1) + { + if (flags == 1) + flags = *pLZ_codes++ | 0x100; + if (flags & 1) + { + mz_uint sym, num_extra_bits; + mz_uint match_len = pLZ_codes[0], match_dist = (pLZ_codes[1] | (pLZ_codes[2] << 8)); pLZ_codes += 3; + + MZ_ASSERT(d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]); + TDEFL_PUT_BITS(d->m_huff_codes[0][s_tdefl_len_sym[match_len]], d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]); + TDEFL_PUT_BITS(match_len & mz_bitmasks[s_tdefl_len_extra[match_len]], s_tdefl_len_extra[match_len]); + + if (match_dist < 512) + { + sym = s_tdefl_small_dist_sym[match_dist]; num_extra_bits = s_tdefl_small_dist_extra[match_dist]; + } + else + { + sym = s_tdefl_large_dist_sym[match_dist >> 8]; num_extra_bits = s_tdefl_large_dist_extra[match_dist >> 8]; + } + MZ_ASSERT(d->m_huff_code_sizes[1][sym]); + TDEFL_PUT_BITS(d->m_huff_codes[1][sym], d->m_huff_code_sizes[1][sym]); + TDEFL_PUT_BITS(match_dist & mz_bitmasks[num_extra_bits], num_extra_bits); + } + else + { + mz_uint lit = *pLZ_codes++; + MZ_ASSERT(d->m_huff_code_sizes[0][lit]); + TDEFL_PUT_BITS(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]); + } + } + + TDEFL_PUT_BITS(d->m_huff_codes[0][256], d->m_huff_code_sizes[0][256]); + + return (d->m_pOutput_buf < d->m_pOutput_buf_end); +} +#endif // MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN && MINIZ_HAS_64BIT_REGISTERS + +static mz_bool tdefl_compress_block(tdefl_compressor *d, mz_bool static_block) +{ + if (static_block) + tdefl_start_static_block(d); + else + tdefl_start_dynamic_block(d); + return tdefl_compress_lz_codes(d); +} + +static int tdefl_flush_block(tdefl_compressor *d, int flush) +{ + mz_uint saved_bit_buf, saved_bits_in; + mz_uint8 *pSaved_output_buf; + mz_bool comp_block_succeeded = MZ_FALSE; + int n, use_raw_block = ((d->m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS) != 0) && (d->m_lookahead_pos - d->m_lz_code_buf_dict_pos) <= d->m_dict_size; + mz_uint8 *pOutput_buf_start = ((d->m_pPut_buf_func == NULL) && ((*d->m_pOut_buf_size - d->m_out_buf_ofs) >= TDEFL_OUT_BUF_SIZE)) ? ((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs) : d->m_output_buf; + + d->m_pOutput_buf = pOutput_buf_start; + d->m_pOutput_buf_end = d->m_pOutput_buf + TDEFL_OUT_BUF_SIZE - 16; + + MZ_ASSERT(!d->m_output_flush_remaining); + d->m_output_flush_ofs = 0; + d->m_output_flush_remaining = 0; + + *d->m_pLZ_flags = (mz_uint8)(*d->m_pLZ_flags >> d->m_num_flags_left); + d->m_pLZ_code_buf -= (d->m_num_flags_left == 8); + + if ((d->m_flags & TDEFL_WRITE_ZLIB_HEADER) && (!d->m_block_index)) + { + TDEFL_PUT_BITS(0x78, 8); TDEFL_PUT_BITS(0x01, 8); + } + + TDEFL_PUT_BITS(flush == TDEFL_FINISH, 1); + + pSaved_output_buf = d->m_pOutput_buf; saved_bit_buf = d->m_bit_buffer; saved_bits_in = d->m_bits_in; + + if (!use_raw_block) + comp_block_succeeded = tdefl_compress_block(d, (d->m_flags & TDEFL_FORCE_ALL_STATIC_BLOCKS) || (d->m_total_lz_bytes < 48)); + + // If the block gets expanded, forget the current contents of the output buffer and send a raw block instead. + if ( ((use_raw_block) || ((d->m_total_lz_bytes) && ((d->m_pOutput_buf - pSaved_output_buf + 1U) >= d->m_total_lz_bytes))) && + ((d->m_lookahead_pos - d->m_lz_code_buf_dict_pos) <= d->m_dict_size) ) + { + mz_uint i; d->m_pOutput_buf = pSaved_output_buf; d->m_bit_buffer = saved_bit_buf, d->m_bits_in = saved_bits_in; + TDEFL_PUT_BITS(0, 2); + if (d->m_bits_in) { TDEFL_PUT_BITS(0, 8 - d->m_bits_in); } + for (i = 2; i; --i, d->m_total_lz_bytes ^= 0xFFFF) + { + TDEFL_PUT_BITS(d->m_total_lz_bytes & 0xFFFF, 16); + } + for (i = 0; i < d->m_total_lz_bytes; ++i) + { + TDEFL_PUT_BITS(d->m_dict[(d->m_lz_code_buf_dict_pos + i) & TDEFL_LZ_DICT_SIZE_MASK], 8); + } + } + // Check for the extremely unlikely (if not impossible) case of the compressed block not fitting into the output buffer when using dynamic codes. + else if (!comp_block_succeeded) + { + d->m_pOutput_buf = pSaved_output_buf; d->m_bit_buffer = saved_bit_buf, d->m_bits_in = saved_bits_in; + tdefl_compress_block(d, MZ_TRUE); + } + + if (flush) + { + if (flush == TDEFL_FINISH) + { + if (d->m_bits_in) { TDEFL_PUT_BITS(0, 8 - d->m_bits_in); } + if (d->m_flags & TDEFL_WRITE_ZLIB_HEADER) { mz_uint i, a = d->m_adler32; for (i = 0; i < 4; i++) { TDEFL_PUT_BITS((a >> 24) & 0xFF, 8); a <<= 8; } } + } + else + { + mz_uint i, z = 0; TDEFL_PUT_BITS(0, 3); if (d->m_bits_in) { TDEFL_PUT_BITS(0, 8 - d->m_bits_in); } for (i = 2; i; --i, z ^= 0xFFFF) { TDEFL_PUT_BITS(z & 0xFFFF, 16); } + } + } + + MZ_ASSERT(d->m_pOutput_buf < d->m_pOutput_buf_end); + + memset(&d->m_huff_count[0][0], 0, sizeof(d->m_huff_count[0][0]) * TDEFL_MAX_HUFF_SYMBOLS_0); + memset(&d->m_huff_count[1][0], 0, sizeof(d->m_huff_count[1][0]) * TDEFL_MAX_HUFF_SYMBOLS_1); + + d->m_pLZ_code_buf = d->m_lz_code_buf + 1; d->m_pLZ_flags = d->m_lz_code_buf; d->m_num_flags_left = 8; d->m_lz_code_buf_dict_pos += d->m_total_lz_bytes; d->m_total_lz_bytes = 0; d->m_block_index++; + + if ((n = (int)(d->m_pOutput_buf - pOutput_buf_start)) != 0) + { + if (d->m_pPut_buf_func) + { + *d->m_pIn_buf_size = d->m_pSrc - (const mz_uint8 *)d->m_pIn_buf; + if (!(*d->m_pPut_buf_func)(d->m_output_buf, n, d->m_pPut_buf_user)) + return (d->m_prev_return_status = TDEFL_STATUS_PUT_BUF_FAILED); + } + else if (pOutput_buf_start == d->m_output_buf) + { + int bytes_to_copy = (int)MZ_MIN((size_t)n, (size_t)(*d->m_pOut_buf_size - d->m_out_buf_ofs)); + memcpy((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs, d->m_output_buf, bytes_to_copy); + d->m_out_buf_ofs += bytes_to_copy; + if ((n -= bytes_to_copy) != 0) + { + d->m_output_flush_ofs = bytes_to_copy; + d->m_output_flush_remaining = n; + } + } + else + { + d->m_out_buf_ofs += n; + } + } + + return d->m_output_flush_remaining; +} + +#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES +#define TDEFL_READ_UNALIGNED_WORD(p) *(const mz_uint16*)(p) +static MZ_FORCEINLINE void tdefl_find_match(tdefl_compressor *d, mz_uint lookahead_pos, mz_uint max_dist, mz_uint max_match_len, mz_uint *pMatch_dist, mz_uint *pMatch_len) +{ + mz_uint dist, pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK, match_len = *pMatch_len, probe_pos = pos, next_probe_pos, probe_len; + mz_uint num_probes_left = d->m_max_probes[match_len >= 32]; + const mz_uint16 *s = (const mz_uint16*)(d->m_dict + pos), *p, *q; + mz_uint16 c01 = TDEFL_READ_UNALIGNED_WORD(&d->m_dict[pos + match_len - 1]), s01 = TDEFL_READ_UNALIGNED_WORD(s); + MZ_ASSERT(max_match_len <= TDEFL_MAX_MATCH_LEN); if (max_match_len <= match_len) return; + for ( ; ; ) + { + for ( ; ; ) + { + if (--num_probes_left == 0) return; + #define TDEFL_PROBE \ + next_probe_pos = d->m_next[probe_pos]; \ + if ((!next_probe_pos) || ((dist = (mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist)) return; \ + probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK; \ + if (TDEFL_READ_UNALIGNED_WORD(&d->m_dict[probe_pos + match_len - 1]) == c01) break; + TDEFL_PROBE; TDEFL_PROBE; TDEFL_PROBE; + } + if (!dist) break; q = (const mz_uint16*)(d->m_dict + probe_pos); if (TDEFL_READ_UNALIGNED_WORD(q) != s01) continue; p = s; probe_len = 32; + do { } while ( (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && + (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (--probe_len > 0) ); + if (!probe_len) + { + *pMatch_dist = dist; *pMatch_len = MZ_MIN(max_match_len, TDEFL_MAX_MATCH_LEN); break; + } + else if ((probe_len = ((mz_uint)(p - s) * 2) + (mz_uint)(*(const mz_uint8*)p == *(const mz_uint8*)q)) > match_len) + { + *pMatch_dist = dist; if ((*pMatch_len = match_len = MZ_MIN(max_match_len, probe_len)) == max_match_len) break; + c01 = TDEFL_READ_UNALIGNED_WORD(&d->m_dict[pos + match_len - 1]); + } + } +} +#else +static MZ_FORCEINLINE void tdefl_find_match(tdefl_compressor *d, mz_uint lookahead_pos, mz_uint max_dist, mz_uint max_match_len, mz_uint *pMatch_dist, mz_uint *pMatch_len) +{ + mz_uint dist, pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK, match_len = *pMatch_len, probe_pos = pos, next_probe_pos, probe_len; + mz_uint num_probes_left = d->m_max_probes[match_len >= 32]; + const mz_uint8 *s = d->m_dict + pos, *p, *q; + mz_uint8 c0 = d->m_dict[pos + match_len], c1 = d->m_dict[pos + match_len - 1]; + MZ_ASSERT(max_match_len <= TDEFL_MAX_MATCH_LEN); if (max_match_len <= match_len) return; + for ( ; ; ) + { + for ( ; ; ) + { + if (--num_probes_left == 0) return; + #define TDEFL_PROBE \ + next_probe_pos = d->m_next[probe_pos]; \ + if ((!next_probe_pos) || ((dist = (mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist)) return; \ + probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK; \ + if ((d->m_dict[probe_pos + match_len] == c0) && (d->m_dict[probe_pos + match_len - 1] == c1)) break; + TDEFL_PROBE; TDEFL_PROBE; TDEFL_PROBE; + } + if (!dist) break; p = s; q = d->m_dict + probe_pos; for (probe_len = 0; probe_len < max_match_len; probe_len++) if (*p++ != *q++) break; + if (probe_len > match_len) + { + *pMatch_dist = dist; if ((*pMatch_len = match_len = probe_len) == max_match_len) return; + c0 = d->m_dict[pos + match_len]; c1 = d->m_dict[pos + match_len - 1]; + } + } +} +#endif // #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES + +#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN +static mz_bool tdefl_compress_fast(tdefl_compressor *d) +{ + // Faster, minimally featured LZRW1-style match+parse loop with better register utilization. Intended for applications where raw throughput is valued more highly than ratio. + mz_uint lookahead_pos = d->m_lookahead_pos, lookahead_size = d->m_lookahead_size, dict_size = d->m_dict_size, total_lz_bytes = d->m_total_lz_bytes, num_flags_left = d->m_num_flags_left; + mz_uint8 *pLZ_code_buf = d->m_pLZ_code_buf, *pLZ_flags = d->m_pLZ_flags; + mz_uint cur_pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK; + + while ((d->m_src_buf_left) || ((d->m_flush) && (lookahead_size))) + { + const mz_uint TDEFL_COMP_FAST_LOOKAHEAD_SIZE = 4096; + mz_uint dst_pos = (lookahead_pos + lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK; + mz_uint num_bytes_to_process = (mz_uint)MZ_MIN(d->m_src_buf_left, TDEFL_COMP_FAST_LOOKAHEAD_SIZE - lookahead_size); + d->m_src_buf_left -= num_bytes_to_process; + lookahead_size += num_bytes_to_process; + + while (num_bytes_to_process) + { + mz_uint32 n = MZ_MIN(TDEFL_LZ_DICT_SIZE - dst_pos, num_bytes_to_process); + memcpy(d->m_dict + dst_pos, d->m_pSrc, n); + if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1)) + memcpy(d->m_dict + TDEFL_LZ_DICT_SIZE + dst_pos, d->m_pSrc, MZ_MIN(n, (TDEFL_MAX_MATCH_LEN - 1) - dst_pos)); + d->m_pSrc += n; + dst_pos = (dst_pos + n) & TDEFL_LZ_DICT_SIZE_MASK; + num_bytes_to_process -= n; + } + + dict_size = MZ_MIN(TDEFL_LZ_DICT_SIZE - lookahead_size, dict_size); + if ((!d->m_flush) && (lookahead_size < TDEFL_COMP_FAST_LOOKAHEAD_SIZE)) break; + + while (lookahead_size >= 4) + { + mz_uint cur_match_dist, cur_match_len = 1; + mz_uint8 *pCur_dict = d->m_dict + cur_pos; + mz_uint first_trigram = (*(const mz_uint32 *)pCur_dict) & 0xFFFFFF; + mz_uint hash = (first_trigram ^ (first_trigram >> (24 - (TDEFL_LZ_HASH_BITS - 8)))) & TDEFL_LEVEL1_HASH_SIZE_MASK; + mz_uint probe_pos = d->m_hash[hash]; + d->m_hash[hash] = (mz_uint16)lookahead_pos; + + if (((cur_match_dist = (mz_uint16)(lookahead_pos - probe_pos)) <= dict_size) && ((*(const mz_uint32 *)(d->m_dict + (probe_pos &= TDEFL_LZ_DICT_SIZE_MASK)) & 0xFFFFFF) == first_trigram)) + { + const mz_uint16 *p = (const mz_uint16 *)pCur_dict; + const mz_uint16 *q = (const mz_uint16 *)(d->m_dict + probe_pos); + mz_uint32 probe_len = 32; + do { } while ( (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && + (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (--probe_len > 0) ); + cur_match_len = ((mz_uint)(p - (const mz_uint16 *)pCur_dict) * 2) + (mz_uint)(*(const mz_uint8 *)p == *(const mz_uint8 *)q); + if (!probe_len) + cur_match_len = cur_match_dist ? TDEFL_MAX_MATCH_LEN : 0; + + if ((cur_match_len < TDEFL_MIN_MATCH_LEN) || ((cur_match_len == TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 8U*1024U))) + { + cur_match_len = 1; + *pLZ_code_buf++ = (mz_uint8)first_trigram; + *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1); + d->m_huff_count[0][(mz_uint8)first_trigram]++; + } + else + { + mz_uint32 s0, s1; + cur_match_len = MZ_MIN(cur_match_len, lookahead_size); + + MZ_ASSERT((cur_match_len >= TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 1) && (cur_match_dist <= TDEFL_LZ_DICT_SIZE)); + + cur_match_dist--; + + pLZ_code_buf[0] = (mz_uint8)(cur_match_len - TDEFL_MIN_MATCH_LEN); + *(mz_uint16 *)(&pLZ_code_buf[1]) = (mz_uint16)cur_match_dist; + pLZ_code_buf += 3; + *pLZ_flags = (mz_uint8)((*pLZ_flags >> 1) | 0x80); + + s0 = s_tdefl_small_dist_sym[cur_match_dist & 511]; + s1 = s_tdefl_large_dist_sym[cur_match_dist >> 8]; + d->m_huff_count[1][(cur_match_dist < 512) ? s0 : s1]++; + + d->m_huff_count[0][s_tdefl_len_sym[cur_match_len - TDEFL_MIN_MATCH_LEN]]++; + } + } + else + { + *pLZ_code_buf++ = (mz_uint8)first_trigram; + *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1); + d->m_huff_count[0][(mz_uint8)first_trigram]++; + } + + if (--num_flags_left == 0) { num_flags_left = 8; pLZ_flags = pLZ_code_buf++; } + + total_lz_bytes += cur_match_len; + lookahead_pos += cur_match_len; + dict_size = MZ_MIN(dict_size + cur_match_len, TDEFL_LZ_DICT_SIZE); + cur_pos = (cur_pos + cur_match_len) & TDEFL_LZ_DICT_SIZE_MASK; + MZ_ASSERT(lookahead_size >= cur_match_len); + lookahead_size -= cur_match_len; + + if (pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8]) + { + int n; + d->m_lookahead_pos = lookahead_pos; d->m_lookahead_size = lookahead_size; d->m_dict_size = dict_size; + d->m_total_lz_bytes = total_lz_bytes; d->m_pLZ_code_buf = pLZ_code_buf; d->m_pLZ_flags = pLZ_flags; d->m_num_flags_left = num_flags_left; + if ((n = tdefl_flush_block(d, 0)) != 0) + return (n < 0) ? MZ_FALSE : MZ_TRUE; + total_lz_bytes = d->m_total_lz_bytes; pLZ_code_buf = d->m_pLZ_code_buf; pLZ_flags = d->m_pLZ_flags; num_flags_left = d->m_num_flags_left; + } + } + + while (lookahead_size) + { + mz_uint8 lit = d->m_dict[cur_pos]; + + total_lz_bytes++; + *pLZ_code_buf++ = lit; + *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1); + if (--num_flags_left == 0) { num_flags_left = 8; pLZ_flags = pLZ_code_buf++; } + + d->m_huff_count[0][lit]++; + + lookahead_pos++; + dict_size = MZ_MIN(dict_size + 1, TDEFL_LZ_DICT_SIZE); + cur_pos = (cur_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK; + lookahead_size--; + + if (pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8]) + { + int n; + d->m_lookahead_pos = lookahead_pos; d->m_lookahead_size = lookahead_size; d->m_dict_size = dict_size; + d->m_total_lz_bytes = total_lz_bytes; d->m_pLZ_code_buf = pLZ_code_buf; d->m_pLZ_flags = pLZ_flags; d->m_num_flags_left = num_flags_left; + if ((n = tdefl_flush_block(d, 0)) != 0) + return (n < 0) ? MZ_FALSE : MZ_TRUE; + total_lz_bytes = d->m_total_lz_bytes; pLZ_code_buf = d->m_pLZ_code_buf; pLZ_flags = d->m_pLZ_flags; num_flags_left = d->m_num_flags_left; + } + } + } + + d->m_lookahead_pos = lookahead_pos; d->m_lookahead_size = lookahead_size; d->m_dict_size = dict_size; + d->m_total_lz_bytes = total_lz_bytes; d->m_pLZ_code_buf = pLZ_code_buf; d->m_pLZ_flags = pLZ_flags; d->m_num_flags_left = num_flags_left; + return MZ_TRUE; +} +#endif // MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN + +static MZ_FORCEINLINE void tdefl_record_literal(tdefl_compressor *d, mz_uint8 lit) +{ + d->m_total_lz_bytes++; + *d->m_pLZ_code_buf++ = lit; + *d->m_pLZ_flags = (mz_uint8)(*d->m_pLZ_flags >> 1); if (--d->m_num_flags_left == 0) { d->m_num_flags_left = 8; d->m_pLZ_flags = d->m_pLZ_code_buf++; } + d->m_huff_count[0][lit]++; +} + +static MZ_FORCEINLINE void tdefl_record_match(tdefl_compressor *d, mz_uint match_len, mz_uint match_dist) +{ + mz_uint32 s0, s1; + + MZ_ASSERT((match_len >= TDEFL_MIN_MATCH_LEN) && (match_dist >= 1) && (match_dist <= TDEFL_LZ_DICT_SIZE)); + + d->m_total_lz_bytes += match_len; + + d->m_pLZ_code_buf[0] = (mz_uint8)(match_len - TDEFL_MIN_MATCH_LEN); + + match_dist -= 1; + d->m_pLZ_code_buf[1] = (mz_uint8)(match_dist & 0xFF); + d->m_pLZ_code_buf[2] = (mz_uint8)(match_dist >> 8); d->m_pLZ_code_buf += 3; + + *d->m_pLZ_flags = (mz_uint8)((*d->m_pLZ_flags >> 1) | 0x80); if (--d->m_num_flags_left == 0) { d->m_num_flags_left = 8; d->m_pLZ_flags = d->m_pLZ_code_buf++; } + + s0 = s_tdefl_small_dist_sym[match_dist & 511]; s1 = s_tdefl_large_dist_sym[(match_dist >> 8) & 127]; + d->m_huff_count[1][(match_dist < 512) ? s0 : s1]++; + + if (match_len >= TDEFL_MIN_MATCH_LEN) d->m_huff_count[0][s_tdefl_len_sym[match_len - TDEFL_MIN_MATCH_LEN]]++; +} + +static mz_bool tdefl_compress_normal(tdefl_compressor *d) +{ + const mz_uint8 *pSrc = d->m_pSrc; size_t src_buf_left = d->m_src_buf_left; + tdefl_flush flush = d->m_flush; + + while ((src_buf_left) || ((flush) && (d->m_lookahead_size))) + { + mz_uint len_to_move, cur_match_dist, cur_match_len, cur_pos; + // Update dictionary and hash chains. Keeps the lookahead size equal to TDEFL_MAX_MATCH_LEN. + if ((d->m_lookahead_size + d->m_dict_size) >= (TDEFL_MIN_MATCH_LEN - 1)) + { + mz_uint dst_pos = (d->m_lookahead_pos + d->m_lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK, ins_pos = d->m_lookahead_pos + d->m_lookahead_size - 2; + mz_uint hash = (d->m_dict[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] << TDEFL_LZ_HASH_SHIFT) ^ d->m_dict[(ins_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK]; + mz_uint num_bytes_to_process = (mz_uint)MZ_MIN(src_buf_left, TDEFL_MAX_MATCH_LEN - d->m_lookahead_size); + const mz_uint8 *pSrc_end = pSrc + num_bytes_to_process; + src_buf_left -= num_bytes_to_process; + d->m_lookahead_size += num_bytes_to_process; + while (pSrc != pSrc_end) + { + mz_uint8 c = *pSrc++; d->m_dict[dst_pos] = c; if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1)) d->m_dict[TDEFL_LZ_DICT_SIZE + dst_pos] = c; + hash = ((hash << TDEFL_LZ_HASH_SHIFT) ^ c) & (TDEFL_LZ_HASH_SIZE - 1); + d->m_next[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] = d->m_hash[hash]; d->m_hash[hash] = (mz_uint16)(ins_pos); + dst_pos = (dst_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK; ins_pos++; + } + } + else + { + while ((src_buf_left) && (d->m_lookahead_size < TDEFL_MAX_MATCH_LEN)) + { + mz_uint8 c = *pSrc++; + mz_uint dst_pos = (d->m_lookahead_pos + d->m_lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK; + src_buf_left--; + d->m_dict[dst_pos] = c; + if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1)) + d->m_dict[TDEFL_LZ_DICT_SIZE + dst_pos] = c; + if ((++d->m_lookahead_size + d->m_dict_size) >= TDEFL_MIN_MATCH_LEN) + { + mz_uint ins_pos = d->m_lookahead_pos + (d->m_lookahead_size - 1) - 2; + mz_uint hash = ((d->m_dict[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] << (TDEFL_LZ_HASH_SHIFT * 2)) ^ (d->m_dict[(ins_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK] << TDEFL_LZ_HASH_SHIFT) ^ c) & (TDEFL_LZ_HASH_SIZE - 1); + d->m_next[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] = d->m_hash[hash]; d->m_hash[hash] = (mz_uint16)(ins_pos); + } + } + } + d->m_dict_size = MZ_MIN(TDEFL_LZ_DICT_SIZE - d->m_lookahead_size, d->m_dict_size); + if ((!flush) && (d->m_lookahead_size < TDEFL_MAX_MATCH_LEN)) + break; + + // Simple lazy/greedy parsing state machine. + len_to_move = 1; cur_match_dist = 0; cur_match_len = d->m_saved_match_len ? d->m_saved_match_len : (TDEFL_MIN_MATCH_LEN - 1); cur_pos = d->m_lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK; + if (d->m_flags & (TDEFL_RLE_MATCHES | TDEFL_FORCE_ALL_RAW_BLOCKS)) + { + if ((d->m_dict_size) && (!(d->m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS))) + { + mz_uint8 c = d->m_dict[(cur_pos - 1) & TDEFL_LZ_DICT_SIZE_MASK]; + cur_match_len = 0; while (cur_match_len < d->m_lookahead_size) { if (d->m_dict[cur_pos + cur_match_len] != c) break; cur_match_len++; } + if (cur_match_len < TDEFL_MIN_MATCH_LEN) cur_match_len = 0; else cur_match_dist = 1; + } + } + else + { + tdefl_find_match(d, d->m_lookahead_pos, d->m_dict_size, d->m_lookahead_size, &cur_match_dist, &cur_match_len); + } + if (((cur_match_len == TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 8U*1024U)) || (cur_pos == cur_match_dist) || ((d->m_flags & TDEFL_FILTER_MATCHES) && (cur_match_len <= 5))) + { + cur_match_dist = cur_match_len = 0; + } + if (d->m_saved_match_len) + { + if (cur_match_len > d->m_saved_match_len) + { + tdefl_record_literal(d, (mz_uint8)d->m_saved_lit); + if (cur_match_len >= 128) + { + tdefl_record_match(d, cur_match_len, cur_match_dist); + d->m_saved_match_len = 0; len_to_move = cur_match_len; + } + else + { + d->m_saved_lit = d->m_dict[cur_pos]; d->m_saved_match_dist = cur_match_dist; d->m_saved_match_len = cur_match_len; + } + } + else + { + tdefl_record_match(d, d->m_saved_match_len, d->m_saved_match_dist); + len_to_move = d->m_saved_match_len - 1; d->m_saved_match_len = 0; + } + } + else if (!cur_match_dist) + tdefl_record_literal(d, d->m_dict[MZ_MIN(cur_pos, sizeof(d->m_dict) - 1)]); + else if ((d->m_greedy_parsing) || (d->m_flags & TDEFL_RLE_MATCHES) || (cur_match_len >= 128)) + { + tdefl_record_match(d, cur_match_len, cur_match_dist); + len_to_move = cur_match_len; + } + else + { + d->m_saved_lit = d->m_dict[MZ_MIN(cur_pos, sizeof(d->m_dict) - 1)]; d->m_saved_match_dist = cur_match_dist; d->m_saved_match_len = cur_match_len; + } + // Move the lookahead forward by len_to_move bytes. + d->m_lookahead_pos += len_to_move; + MZ_ASSERT(d->m_lookahead_size >= len_to_move); + d->m_lookahead_size -= len_to_move; + d->m_dict_size = MZ_MIN(d->m_dict_size + len_to_move, TDEFL_LZ_DICT_SIZE); + // Check if it's time to flush the current LZ codes to the internal output buffer. + if ( (d->m_pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8]) || + ( (d->m_total_lz_bytes > 31*1024) && (((((mz_uint)(d->m_pLZ_code_buf - d->m_lz_code_buf) * 115) >> 7) >= d->m_total_lz_bytes) || (d->m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS))) ) + { + int n; + d->m_pSrc = pSrc; d->m_src_buf_left = src_buf_left; + if ((n = tdefl_flush_block(d, 0)) != 0) + return (n < 0) ? MZ_FALSE : MZ_TRUE; + } + } + + d->m_pSrc = pSrc; d->m_src_buf_left = src_buf_left; + return MZ_TRUE; +} + +static tdefl_status tdefl_flush_output_buffer(tdefl_compressor *d) +{ + if (d->m_pIn_buf_size) + { + *d->m_pIn_buf_size = d->m_pSrc - (const mz_uint8 *)d->m_pIn_buf; + } + + if (d->m_pOut_buf_size) + { + size_t n = MZ_MIN(*d->m_pOut_buf_size - d->m_out_buf_ofs, d->m_output_flush_remaining); + memcpy((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs, d->m_output_buf + d->m_output_flush_ofs, n); + d->m_output_flush_ofs += (mz_uint)n; + d->m_output_flush_remaining -= (mz_uint)n; + d->m_out_buf_ofs += n; + + *d->m_pOut_buf_size = d->m_out_buf_ofs; + } + + return (d->m_finished && !d->m_output_flush_remaining) ? TDEFL_STATUS_DONE : TDEFL_STATUS_OKAY; +} + +tdefl_status tdefl_compress(tdefl_compressor *d, const void *pIn_buf, size_t *pIn_buf_size, void *pOut_buf, size_t *pOut_buf_size, tdefl_flush flush) +{ + if (!d) + { + if (pIn_buf_size) *pIn_buf_size = 0; + if (pOut_buf_size) *pOut_buf_size = 0; + return TDEFL_STATUS_BAD_PARAM; + } + + d->m_pIn_buf = pIn_buf; d->m_pIn_buf_size = pIn_buf_size; + d->m_pOut_buf = pOut_buf; d->m_pOut_buf_size = pOut_buf_size; + d->m_pSrc = (const mz_uint8 *)(pIn_buf); d->m_src_buf_left = pIn_buf_size ? *pIn_buf_size : 0; + d->m_out_buf_ofs = 0; + d->m_flush = flush; + + if ( ((d->m_pPut_buf_func != NULL) == ((pOut_buf != NULL) || (pOut_buf_size != NULL))) || (d->m_prev_return_status != TDEFL_STATUS_OKAY) || + (d->m_wants_to_finish && (flush != TDEFL_FINISH)) || (pIn_buf_size && *pIn_buf_size && !pIn_buf) || (pOut_buf_size && *pOut_buf_size && !pOut_buf) ) + { + if (pIn_buf_size) *pIn_buf_size = 0; + if (pOut_buf_size) *pOut_buf_size = 0; + return (d->m_prev_return_status = TDEFL_STATUS_BAD_PARAM); + } + d->m_wants_to_finish |= (flush == TDEFL_FINISH); + + if ((d->m_output_flush_remaining) || (d->m_finished)) + return (d->m_prev_return_status = tdefl_flush_output_buffer(d)); + +#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN + if (((d->m_flags & TDEFL_MAX_PROBES_MASK) == 1) && + ((d->m_flags & TDEFL_GREEDY_PARSING_FLAG) != 0) && + ((d->m_flags & (TDEFL_FILTER_MATCHES | TDEFL_FORCE_ALL_RAW_BLOCKS | TDEFL_RLE_MATCHES)) == 0)) + { + if (!tdefl_compress_fast(d)) + return d->m_prev_return_status; + } + else +#endif // #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN + { + if (!tdefl_compress_normal(d)) + return d->m_prev_return_status; + } + + if ((d->m_flags & (TDEFL_WRITE_ZLIB_HEADER | TDEFL_COMPUTE_ADLER32)) && (pIn_buf)) + d->m_adler32 = (mz_uint32)mz_adler32(d->m_adler32, (const mz_uint8 *)pIn_buf, d->m_pSrc - (const mz_uint8 *)pIn_buf); + + if ((flush) && (!d->m_lookahead_size) && (!d->m_src_buf_left) && (!d->m_output_flush_remaining)) + { + if (tdefl_flush_block(d, flush) < 0) + return d->m_prev_return_status; + d->m_finished = (flush == TDEFL_FINISH); + if (flush == TDEFL_FULL_FLUSH) { MZ_CLEAR_OBJ(d->m_hash); MZ_CLEAR_OBJ(d->m_next); d->m_dict_size = 0; } + } + + return (d->m_prev_return_status = tdefl_flush_output_buffer(d)); +} + +tdefl_status tdefl_compress_buffer(tdefl_compressor *d, const void *pIn_buf, size_t in_buf_size, tdefl_flush flush) +{ + MZ_ASSERT(d->m_pPut_buf_func); return tdefl_compress(d, pIn_buf, &in_buf_size, NULL, NULL, flush); +} + +tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags) +{ + d->m_pPut_buf_func = pPut_buf_func; d->m_pPut_buf_user = pPut_buf_user; + d->m_flags = (mz_uint)(flags); d->m_max_probes[0] = 1 + ((flags & 0xFFF) + 2) / 3; d->m_greedy_parsing = (flags & TDEFL_GREEDY_PARSING_FLAG) != 0; + d->m_max_probes[1] = 1 + (((flags & 0xFFF) >> 2) + 2) / 3; + if (!(flags & TDEFL_NONDETERMINISTIC_PARSING_FLAG)) MZ_CLEAR_OBJ(d->m_hash); + d->m_lookahead_pos = d->m_lookahead_size = d->m_dict_size = d->m_total_lz_bytes = d->m_lz_code_buf_dict_pos = d->m_bits_in = 0; + d->m_output_flush_ofs = d->m_output_flush_remaining = d->m_finished = d->m_block_index = d->m_bit_buffer = d->m_wants_to_finish = 0; + d->m_pLZ_code_buf = d->m_lz_code_buf + 1; d->m_pLZ_flags = d->m_lz_code_buf; d->m_num_flags_left = 8; + d->m_pOutput_buf = d->m_output_buf; d->m_pOutput_buf_end = d->m_output_buf; d->m_prev_return_status = TDEFL_STATUS_OKAY; + d->m_saved_match_dist = d->m_saved_match_len = d->m_saved_lit = 0; d->m_adler32 = 1; + d->m_pIn_buf = NULL; d->m_pOut_buf = NULL; + d->m_pIn_buf_size = NULL; d->m_pOut_buf_size = NULL; + d->m_flush = TDEFL_NO_FLUSH; d->m_pSrc = NULL; d->m_src_buf_left = 0; d->m_out_buf_ofs = 0; + memset(&d->m_huff_count[0][0], 0, sizeof(d->m_huff_count[0][0]) * TDEFL_MAX_HUFF_SYMBOLS_0); + memset(&d->m_huff_count[1][0], 0, sizeof(d->m_huff_count[1][0]) * TDEFL_MAX_HUFF_SYMBOLS_1); + return TDEFL_STATUS_OKAY; +} + +tdefl_status tdefl_get_prev_return_status(tdefl_compressor *d) +{ + return d->m_prev_return_status; +} + +mz_uint32 tdefl_get_adler32(tdefl_compressor *d) +{ + return d->m_adler32; +} + +mz_bool tdefl_compress_mem_to_output(const void *pBuf, size_t buf_len, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags) +{ + tdefl_compressor *pComp; mz_bool succeeded; if (((buf_len) && (!pBuf)) || (!pPut_buf_func)) return MZ_FALSE; + pComp = (tdefl_compressor*)MZ_MALLOC(sizeof(tdefl_compressor)); if (!pComp) return MZ_FALSE; + succeeded = (tdefl_init(pComp, pPut_buf_func, pPut_buf_user, flags) == TDEFL_STATUS_OKAY); + succeeded = succeeded && (tdefl_compress_buffer(pComp, pBuf, buf_len, TDEFL_FINISH) == TDEFL_STATUS_DONE); + MZ_FREE(pComp); return succeeded; +} + +typedef struct +{ + size_t m_size, m_capacity; + mz_uint8 *m_pBuf; + mz_bool m_expandable; +} tdefl_output_buffer; + +static mz_bool tdefl_output_buffer_putter(const void *pBuf, int len, void *pUser) +{ + tdefl_output_buffer *p = (tdefl_output_buffer *)pUser; + size_t new_size = p->m_size + len; + if (new_size > p->m_capacity) + { + size_t new_capacity = p->m_capacity; mz_uint8 *pNew_buf; if (!p->m_expandable) return MZ_FALSE; + do { new_capacity = MZ_MAX(128U, new_capacity << 1U); } while (new_size > new_capacity); + pNew_buf = (mz_uint8*)MZ_REALLOC(p->m_pBuf, new_capacity); if (!pNew_buf) return MZ_FALSE; + p->m_pBuf = pNew_buf; p->m_capacity = new_capacity; + } + memcpy((mz_uint8*)p->m_pBuf + p->m_size, pBuf, len); p->m_size = new_size; + return MZ_TRUE; +} + +void *tdefl_compress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags) +{ + tdefl_output_buffer out_buf; MZ_CLEAR_OBJ(out_buf); + if (!pOut_len) return MZ_FALSE; else *pOut_len = 0; + out_buf.m_expandable = MZ_TRUE; + if (!tdefl_compress_mem_to_output(pSrc_buf, src_buf_len, tdefl_output_buffer_putter, &out_buf, flags)) return NULL; + *pOut_len = out_buf.m_size; return out_buf.m_pBuf; +} + +size_t tdefl_compress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags) +{ + tdefl_output_buffer out_buf; MZ_CLEAR_OBJ(out_buf); + if (!pOut_buf) return 0; + out_buf.m_pBuf = (mz_uint8*)pOut_buf; out_buf.m_capacity = out_buf_len; + if (!tdefl_compress_mem_to_output(pSrc_buf, src_buf_len, tdefl_output_buffer_putter, &out_buf, flags)) return 0; + return out_buf.m_size; +} + +#ifndef MINIZ_NO_ZLIB_APIS +static const mz_uint s_tdefl_num_probes[11] = { 0, 1, 6, 32, 16, 32, 128, 256, 512, 768, 1500 }; + +// level may actually range from [0,10] (10 is a "hidden" max level, where we want a bit more compression and it's fine if throughput to fall off a cliff on some files). +mz_uint tdefl_create_comp_flags_from_zip_params(int level, int window_bits, int strategy) +{ + mz_uint comp_flags = s_tdefl_num_probes[(level >= 0) ? MZ_MIN(10, level) : MZ_DEFAULT_LEVEL] | ((level <= 3) ? TDEFL_GREEDY_PARSING_FLAG : 0); + if (window_bits > 0) comp_flags |= TDEFL_WRITE_ZLIB_HEADER; + + if (!level) comp_flags |= TDEFL_FORCE_ALL_RAW_BLOCKS; + else if (strategy == MZ_FILTERED) comp_flags |= TDEFL_FILTER_MATCHES; + else if (strategy == MZ_HUFFMAN_ONLY) comp_flags &= ~TDEFL_MAX_PROBES_MASK; + else if (strategy == MZ_FIXED) comp_flags |= TDEFL_FORCE_ALL_STATIC_BLOCKS; + else if (strategy == MZ_RLE) comp_flags |= TDEFL_RLE_MATCHES; + + return comp_flags; +} +#endif //MINIZ_NO_ZLIB_APIS + +#ifdef _MSC_VER +#pragma warning (push) +#pragma warning (disable:4204) // nonstandard extension used : non-constant aggregate initializer (also supported by GNU C and C99, so no big deal) +#endif + +// Simple PNG writer function by Alex Evans, 2011. Released into the public domain: https://gist.github.com/908299, more context at +// http://altdevblogaday.org/2011/04/06/a-smaller-jpg-encoder/. +void *tdefl_write_image_to_png_file_in_memory(const void *pImage, int w, int h, int num_chans, size_t *pLen_out) +{ + tdefl_compressor *pComp = (tdefl_compressor *)MZ_MALLOC(sizeof(tdefl_compressor)); tdefl_output_buffer out_buf; int i, bpl = w * num_chans, y, z; mz_uint32 c; *pLen_out = 0; + if (!pComp) return NULL; + MZ_CLEAR_OBJ(out_buf); out_buf.m_expandable = MZ_TRUE; out_buf.m_capacity = 57+MZ_MAX(64, (1+bpl)*h); if (NULL == (out_buf.m_pBuf = (mz_uint8*)MZ_MALLOC(out_buf.m_capacity))) { MZ_FREE(pComp); return NULL; } + // write dummy header + for (z = 41; z; --z) tdefl_output_buffer_putter(&z, 1, &out_buf); + // compress image data + tdefl_init(pComp, tdefl_output_buffer_putter, &out_buf, TDEFL_DEFAULT_MAX_PROBES | TDEFL_WRITE_ZLIB_HEADER); + for (y = 0; y < h; ++y) { tdefl_compress_buffer(pComp, &z, 1, TDEFL_NO_FLUSH); tdefl_compress_buffer(pComp, (mz_uint8*)pImage + y * bpl, bpl, TDEFL_NO_FLUSH); } + if (tdefl_compress_buffer(pComp, NULL, 0, TDEFL_FINISH) != TDEFL_STATUS_DONE) { MZ_FREE(pComp); MZ_FREE(out_buf.m_pBuf); return NULL; } + // write real header + *pLen_out = out_buf.m_size-41; + { + mz_uint8 pnghdr[41]={0x89,0x50,0x4e,0x47,0x0d,0x0a,0x1a,0x0a,0x00,0x00,0x00,0x0d,0x49,0x48,0x44,0x52, + 0,0,(mz_uint8)(w>>8),(mz_uint8)w,0,0,(mz_uint8)(h>>8),(mz_uint8)h,8,"\0\0\04\02\06"[num_chans],0,0,0,0,0,0,0, + (mz_uint8)(*pLen_out>>24),(mz_uint8)(*pLen_out>>16),(mz_uint8)(*pLen_out>>8),(mz_uint8)*pLen_out,0x49,0x44,0x41,0x54}; + c=(mz_uint32)mz_crc32(MZ_CRC32_INIT,pnghdr+12,17); for (i=0; i<4; ++i, c<<=8) ((mz_uint8*)(pnghdr+29))[i]=(mz_uint8)(c>>24); + memcpy(out_buf.m_pBuf, pnghdr, 41); + } + // write footer (IDAT CRC-32, followed by IEND chunk) + if (!tdefl_output_buffer_putter("\0\0\0\0\0\0\0\0\x49\x45\x4e\x44\xae\x42\x60\x82", 16, &out_buf)) { *pLen_out = 0; MZ_FREE(pComp); MZ_FREE(out_buf.m_pBuf); return NULL; } + c = (mz_uint32)mz_crc32(MZ_CRC32_INIT,out_buf.m_pBuf+41-4, *pLen_out+4); for (i=0; i<4; ++i, c<<=8) (out_buf.m_pBuf+out_buf.m_size-16)[i] = (mz_uint8)(c >> 24); + // compute final size of file, grab compressed data buffer and return + *pLen_out += 57; MZ_FREE(pComp); return out_buf.m_pBuf; +} + +#ifdef _MSC_VER +#pragma warning (pop) +#endif + +// ------------------- .ZIP archive reading + +#ifndef MINIZ_NO_ARCHIVE_APIS + +#ifdef MINIZ_NO_STDIO + #define MZ_FILE void * +#else + #include + #include + + #if defined(_MSC_VER) + static FILE *mz_fopen(const char *pFilename, const char *pMode) + { + FILE* pFile = NULL; + fopen_s(&pFile, pFilename, pMode); + return pFile; + } + static FILE *mz_freopen(const char *pPath, const char *pMode, FILE *pStream) + { + FILE* pFile = NULL; + if (freopen_s(&pFile, pPath, pMode, pStream)) + return NULL; + return pFile; + } + #else + static FILE *mz_fopen(const char *pFilename, const char *pMode) + { + return fopen(pFilename, pMode); + } + static FILE *mz_freopen(const char *pPath, const char *pMode, FILE *pStream) + { + return freopen(pPath, pMode, pStream); + } + #endif // #if defined(_MSC_VER) + + #if defined(_MSC_VER) || defined(__MINGW64__) + #ifndef MINIZ_NO_TIME + #include + #endif + #define MZ_FILE FILE + #define MZ_FOPEN mz_fopen + #define MZ_FCLOSE fclose + #define MZ_FREAD fread + #define MZ_FWRITE fwrite + #define MZ_FTELL64 _ftelli64 + #define MZ_FSEEK64 _fseeki64 + #define MZ_FILE_STAT_STRUCT _stat + #define MZ_FILE_STAT _stat + #define MZ_FFLUSH fflush + #define MZ_FREOPEN mz_freopen + #define MZ_DELETE_FILE remove + #elif defined(__MINGW32__) + #ifndef MINIZ_NO_TIME + #include + #endif + #define MZ_FILE FILE + #define MZ_FOPEN mz_fopen + #define MZ_FCLOSE fclose + #define MZ_FREAD fread + #define MZ_FWRITE fwrite + #define MZ_FTELL64 ftello64 + #define MZ_FSEEK64 fseeko64 + #define MZ_FILE_STAT_STRUCT _stat + #define MZ_FILE_STAT _stat + #define MZ_FFLUSH fflush + #define MZ_FREOPEN mz_freopen + #define MZ_DELETE_FILE remove + #elif defined(__TINYC__) + #ifndef MINIZ_NO_TIME + #include + #endif + #define MZ_FILE FILE + #define MZ_FOPEN mz_fopen + #define MZ_FCLOSE fclose + #define MZ_FREAD fread + #define MZ_FWRITE fwrite + #define MZ_FTELL64 ftell + #define MZ_FSEEK64 fseek + #define MZ_FILE_STAT_STRUCT stat + #define MZ_FILE_STAT stat + #define MZ_FFLUSH fflush + #define MZ_FREOPEN mz_freopen + #define MZ_DELETE_FILE remove + #else + #ifndef MINIZ_NO_TIME + #include + #endif + #define MZ_FILE FILE + #define MZ_FOPEN mz_fopen + #define MZ_FCLOSE fclose + #define MZ_FREAD fread + #define MZ_FWRITE fwrite + #define MZ_FTELL64 ftello + #define MZ_FSEEK64 fseeko + #define MZ_FILE_STAT_STRUCT stat + #define MZ_FILE_STAT stat + #define MZ_FFLUSH fflush + #define MZ_FREOPEN mz_freopen + #define MZ_DELETE_FILE remove + #endif // #ifdef _MSC_VER +#endif // #ifdef MINIZ_NO_STDIO + +#define MZ_TOLOWER(c) ((((c) >= 'A') && ((c) <= 'Z')) ? ((c) - 'A' + 'a') : (c)) + +// Various ZIP archive enums. To completely avoid cross platform compiler alignment and platform endian issues, miniz.c doesn't use structs for any of this stuff. +enum +{ + // ZIP archive identifiers and record sizes + MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG = 0x06054b50, MZ_ZIP_CENTRAL_DIR_HEADER_SIG = 0x02014b50, MZ_ZIP_LOCAL_DIR_HEADER_SIG = 0x04034b50, + MZ_ZIP_LOCAL_DIR_HEADER_SIZE = 30, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE = 46, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE = 22, + // Central directory header record offsets + MZ_ZIP_CDH_SIG_OFS = 0, MZ_ZIP_CDH_VERSION_MADE_BY_OFS = 4, MZ_ZIP_CDH_VERSION_NEEDED_OFS = 6, MZ_ZIP_CDH_BIT_FLAG_OFS = 8, + MZ_ZIP_CDH_METHOD_OFS = 10, MZ_ZIP_CDH_FILE_TIME_OFS = 12, MZ_ZIP_CDH_FILE_DATE_OFS = 14, MZ_ZIP_CDH_CRC32_OFS = 16, + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS = 20, MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS = 24, MZ_ZIP_CDH_FILENAME_LEN_OFS = 28, MZ_ZIP_CDH_EXTRA_LEN_OFS = 30, + MZ_ZIP_CDH_COMMENT_LEN_OFS = 32, MZ_ZIP_CDH_DISK_START_OFS = 34, MZ_ZIP_CDH_INTERNAL_ATTR_OFS = 36, MZ_ZIP_CDH_EXTERNAL_ATTR_OFS = 38, MZ_ZIP_CDH_LOCAL_HEADER_OFS = 42, + // Local directory header offsets + MZ_ZIP_LDH_SIG_OFS = 0, MZ_ZIP_LDH_VERSION_NEEDED_OFS = 4, MZ_ZIP_LDH_BIT_FLAG_OFS = 6, MZ_ZIP_LDH_METHOD_OFS = 8, MZ_ZIP_LDH_FILE_TIME_OFS = 10, + MZ_ZIP_LDH_FILE_DATE_OFS = 12, MZ_ZIP_LDH_CRC32_OFS = 14, MZ_ZIP_LDH_COMPRESSED_SIZE_OFS = 18, MZ_ZIP_LDH_DECOMPRESSED_SIZE_OFS = 22, + MZ_ZIP_LDH_FILENAME_LEN_OFS = 26, MZ_ZIP_LDH_EXTRA_LEN_OFS = 28, + // End of central directory offsets + MZ_ZIP_ECDH_SIG_OFS = 0, MZ_ZIP_ECDH_NUM_THIS_DISK_OFS = 4, MZ_ZIP_ECDH_NUM_DISK_CDIR_OFS = 6, MZ_ZIP_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS = 8, + MZ_ZIP_ECDH_CDIR_TOTAL_ENTRIES_OFS = 10, MZ_ZIP_ECDH_CDIR_SIZE_OFS = 12, MZ_ZIP_ECDH_CDIR_OFS_OFS = 16, MZ_ZIP_ECDH_COMMENT_SIZE_OFS = 20, +}; + +typedef struct +{ + void *m_p; + size_t m_size, m_capacity; + mz_uint m_element_size; +} mz_zip_array; + +struct mz_zip_internal_state_tag +{ + mz_zip_array m_central_dir; + mz_zip_array m_central_dir_offsets; + mz_zip_array m_sorted_central_dir_offsets; + MZ_FILE *m_pFile; + void *m_pMem; + size_t m_mem_size; + size_t m_mem_capacity; +}; + +#define MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(array_ptr, element_size) (array_ptr)->m_element_size = element_size +#define MZ_ZIP_ARRAY_ELEMENT(array_ptr, element_type, index) ((element_type *)((array_ptr)->m_p))[index] + +static MZ_FORCEINLINE void mz_zip_array_clear(mz_zip_archive *pZip, mz_zip_array *pArray) +{ + pZip->m_pFree(pZip->m_pAlloc_opaque, pArray->m_p); + memset(pArray, 0, sizeof(mz_zip_array)); +} + +static mz_bool mz_zip_array_ensure_capacity(mz_zip_archive *pZip, mz_zip_array *pArray, size_t min_new_capacity, mz_uint growing) +{ + void *pNew_p; size_t new_capacity = min_new_capacity; MZ_ASSERT(pArray->m_element_size); if (pArray->m_capacity >= min_new_capacity) return MZ_TRUE; + if (growing) { new_capacity = MZ_MAX(1, pArray->m_capacity); while (new_capacity < min_new_capacity) new_capacity *= 2; } + if (NULL == (pNew_p = pZip->m_pRealloc(pZip->m_pAlloc_opaque, pArray->m_p, pArray->m_element_size, new_capacity))) return MZ_FALSE; + pArray->m_p = pNew_p; pArray->m_capacity = new_capacity; + return MZ_TRUE; +} + +static MZ_FORCEINLINE mz_bool mz_zip_array_reserve(mz_zip_archive *pZip, mz_zip_array *pArray, size_t new_capacity, mz_uint growing) +{ + if (new_capacity > pArray->m_capacity) { if (!mz_zip_array_ensure_capacity(pZip, pArray, new_capacity, growing)) return MZ_FALSE; } + return MZ_TRUE; +} + +static MZ_FORCEINLINE mz_bool mz_zip_array_resize(mz_zip_archive *pZip, mz_zip_array *pArray, size_t new_size, mz_uint growing) +{ + if (new_size > pArray->m_capacity) { if (!mz_zip_array_ensure_capacity(pZip, pArray, new_size, growing)) return MZ_FALSE; } + pArray->m_size = new_size; + return MZ_TRUE; +} + +static MZ_FORCEINLINE mz_bool mz_zip_array_ensure_room(mz_zip_archive *pZip, mz_zip_array *pArray, size_t n) +{ + return mz_zip_array_reserve(pZip, pArray, pArray->m_size + n, MZ_TRUE); +} + +static MZ_FORCEINLINE mz_bool mz_zip_array_push_back(mz_zip_archive *pZip, mz_zip_array *pArray, const void *pElements, size_t n) +{ + size_t orig_size = pArray->m_size; if (!mz_zip_array_resize(pZip, pArray, orig_size + n, MZ_TRUE)) return MZ_FALSE; + memcpy((mz_uint8*)pArray->m_p + orig_size * pArray->m_element_size, pElements, n * pArray->m_element_size); + return MZ_TRUE; +} + +#ifndef MINIZ_NO_TIME +static time_t mz_zip_dos_to_time_t(int dos_time, int dos_date) +{ + struct tm tm; + memset(&tm, 0, sizeof(tm)); tm.tm_isdst = -1; + tm.tm_year = ((dos_date >> 9) & 127) + 1980 - 1900; tm.tm_mon = ((dos_date >> 5) & 15) - 1; tm.tm_mday = dos_date & 31; + tm.tm_hour = (dos_time >> 11) & 31; tm.tm_min = (dos_time >> 5) & 63; tm.tm_sec = (dos_time << 1) & 62; + return mktime(&tm); +} + +static void mz_zip_time_to_dos_time(time_t time, mz_uint16 *pDOS_time, mz_uint16 *pDOS_date) +{ +#ifdef _MSC_VER + struct tm tm_struct; + struct tm *tm = &tm_struct; + errno_t err = localtime_s(tm, &time); + if (err) + { + *pDOS_date = 0; *pDOS_time = 0; + return; + } +#else + struct tm *tm = localtime(&time); +#endif + *pDOS_time = (mz_uint16)(((tm->tm_hour) << 11) + ((tm->tm_min) << 5) + ((tm->tm_sec) >> 1)); + *pDOS_date = (mz_uint16)(((tm->tm_year + 1900 - 1980) << 9) + ((tm->tm_mon + 1) << 5) + tm->tm_mday); +} +#endif + +#ifndef MINIZ_NO_STDIO +static mz_bool mz_zip_get_file_modified_time(const char *pFilename, mz_uint16 *pDOS_time, mz_uint16 *pDOS_date) +{ +#ifdef MINIZ_NO_TIME + (void)pFilename; *pDOS_date = *pDOS_time = 0; +#else + struct MZ_FILE_STAT_STRUCT file_stat; if (MZ_FILE_STAT(pFilename, &file_stat) != 0) return MZ_FALSE; + mz_zip_time_to_dos_time(file_stat.st_mtime, pDOS_time, pDOS_date); +#endif // #ifdef MINIZ_NO_TIME + return MZ_TRUE; +} + +static mz_bool mz_zip_set_file_times(const char *pFilename, time_t access_time, time_t modified_time) +{ +#ifndef MINIZ_NO_TIME + struct utimbuf t; t.actime = access_time; t.modtime = modified_time; + return !utime(pFilename, &t); +#else + (void)pFilename, (void)access_time, (void)modified_time; + return MZ_TRUE; +#endif // #ifndef MINIZ_NO_TIME +} +#endif + +static mz_bool mz_zip_reader_init_internal(mz_zip_archive *pZip, mz_uint32 flags) +{ + (void)flags; + if ((!pZip) || (pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_INVALID)) + return MZ_FALSE; + + if (!pZip->m_pAlloc) pZip->m_pAlloc = def_alloc_func; + if (!pZip->m_pFree) pZip->m_pFree = def_free_func; + if (!pZip->m_pRealloc) pZip->m_pRealloc = def_realloc_func; + + pZip->m_zip_mode = MZ_ZIP_MODE_READING; + pZip->m_archive_size = 0; + pZip->m_central_directory_file_ofs = 0; + pZip->m_total_files = 0; + + if (NULL == (pZip->m_pState = (mz_zip_internal_state *)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(mz_zip_internal_state)))) + return MZ_FALSE; + memset(pZip->m_pState, 0, sizeof(mz_zip_internal_state)); + MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_central_dir, sizeof(mz_uint8)); + MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_central_dir_offsets, sizeof(mz_uint32)); + MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_sorted_central_dir_offsets, sizeof(mz_uint32)); + return MZ_TRUE; +} + +static MZ_FORCEINLINE mz_bool mz_zip_reader_filename_less(const mz_zip_array *pCentral_dir_array, const mz_zip_array *pCentral_dir_offsets, mz_uint l_index, mz_uint r_index) +{ + const mz_uint8 *pL = &MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_array, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_offsets, mz_uint32, l_index)), *pE; + const mz_uint8 *pR = &MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_array, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_offsets, mz_uint32, r_index)); + mz_uint l_len = MZ_READ_LE16(pL + MZ_ZIP_CDH_FILENAME_LEN_OFS), r_len = MZ_READ_LE16(pR + MZ_ZIP_CDH_FILENAME_LEN_OFS); + mz_uint8 l = 0, r = 0; + pL += MZ_ZIP_CENTRAL_DIR_HEADER_SIZE; pR += MZ_ZIP_CENTRAL_DIR_HEADER_SIZE; + pE = pL + MZ_MIN(l_len, r_len); + while (pL < pE) + { + if ((l = MZ_TOLOWER(*pL)) != (r = MZ_TOLOWER(*pR))) + break; + pL++; pR++; + } + return (pL == pE) ? (l_len < r_len) : (l < r); +} + +#define MZ_SWAP_UINT32(a, b) do { mz_uint32 t = a; a = b; b = t; } MZ_MACRO_END + +// Heap sort of lowercased filenames, used to help accelerate plain central directory searches by mz_zip_reader_locate_file(). (Could also use qsort(), but it could allocate memory.) +static void mz_zip_reader_sort_central_dir_offsets_by_filename(mz_zip_archive *pZip) +{ + mz_zip_internal_state *pState = pZip->m_pState; + const mz_zip_array *pCentral_dir_offsets = &pState->m_central_dir_offsets; + const mz_zip_array *pCentral_dir = &pState->m_central_dir; + mz_uint32 *pIndices = &MZ_ZIP_ARRAY_ELEMENT(&pState->m_sorted_central_dir_offsets, mz_uint32, 0); + const int size = pZip->m_total_files; + int start = (size - 2) >> 1, end; + while (start >= 0) + { + int child, root = start; + for ( ; ; ) + { + if ((child = (root << 1) + 1) >= size) + break; + child += (((child + 1) < size) && (mz_zip_reader_filename_less(pCentral_dir, pCentral_dir_offsets, pIndices[child], pIndices[child + 1]))); + if (!mz_zip_reader_filename_less(pCentral_dir, pCentral_dir_offsets, pIndices[root], pIndices[child])) + break; + MZ_SWAP_UINT32(pIndices[root], pIndices[child]); root = child; + } + start--; + } + + end = size - 1; + while (end > 0) + { + int child, root = 0; + MZ_SWAP_UINT32(pIndices[end], pIndices[0]); + for ( ; ; ) + { + if ((child = (root << 1) + 1) >= end) + break; + child += (((child + 1) < end) && mz_zip_reader_filename_less(pCentral_dir, pCentral_dir_offsets, pIndices[child], pIndices[child + 1])); + if (!mz_zip_reader_filename_less(pCentral_dir, pCentral_dir_offsets, pIndices[root], pIndices[child])) + break; + MZ_SWAP_UINT32(pIndices[root], pIndices[child]); root = child; + } + end--; + } +} + +static mz_bool mz_zip_reader_read_central_dir(mz_zip_archive *pZip, mz_uint32 flags) +{ + mz_uint cdir_size, num_this_disk, cdir_disk_index; + mz_uint64 cdir_ofs; + mz_int64 cur_file_ofs; + const mz_uint8 *p; + mz_uint32 buf_u32[4096 / sizeof(mz_uint32)]; mz_uint8 *pBuf = (mz_uint8 *)buf_u32; + // Basic sanity checks - reject files which are too small, and check the first 4 bytes of the file to make sure a local header is there. + if (pZip->m_archive_size < MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE) + return MZ_FALSE; + // Find the end of central directory record by scanning the file from the end towards the beginning. + cur_file_ofs = MZ_MAX((mz_int64)pZip->m_archive_size - (mz_int64)sizeof(buf_u32), 0); + for ( ; ; ) + { + int i, n = (int)MZ_MIN(sizeof(buf_u32), pZip->m_archive_size - cur_file_ofs); + if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pBuf, n) != (mz_uint)n) + return MZ_FALSE; + for (i = n - 4; i >= 0; --i) + if (MZ_READ_LE32(pBuf + i) == MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG) + break; + if (i >= 0) + { + cur_file_ofs += i; + break; + } + if ((!cur_file_ofs) || ((pZip->m_archive_size - cur_file_ofs) >= (0xFFFF + MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE))) + return MZ_FALSE; + cur_file_ofs = MZ_MAX(cur_file_ofs - (sizeof(buf_u32) - 3), 0); + } + // Read and verify the end of central directory record. + if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pBuf, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE) != MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE) + return MZ_FALSE; + if ((MZ_READ_LE32(pBuf + MZ_ZIP_ECDH_SIG_OFS) != MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG) || + ((pZip->m_total_files = MZ_READ_LE16(pBuf + MZ_ZIP_ECDH_CDIR_TOTAL_ENTRIES_OFS)) != MZ_READ_LE16(pBuf + MZ_ZIP_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS))) + return MZ_FALSE; + + num_this_disk = MZ_READ_LE16(pBuf + MZ_ZIP_ECDH_NUM_THIS_DISK_OFS); + cdir_disk_index = MZ_READ_LE16(pBuf + MZ_ZIP_ECDH_NUM_DISK_CDIR_OFS); + if (((num_this_disk | cdir_disk_index) != 0) && ((num_this_disk != 1) || (cdir_disk_index != 1))) + return MZ_FALSE; + + if ((cdir_size = MZ_READ_LE32(pBuf + MZ_ZIP_ECDH_CDIR_SIZE_OFS)) < pZip->m_total_files * MZ_ZIP_CENTRAL_DIR_HEADER_SIZE) + return MZ_FALSE; + + cdir_ofs = MZ_READ_LE32(pBuf + MZ_ZIP_ECDH_CDIR_OFS_OFS); + if ((cdir_ofs + (mz_uint64)cdir_size) > pZip->m_archive_size) + return MZ_FALSE; + + pZip->m_central_directory_file_ofs = cdir_ofs; + + if (pZip->m_total_files) + { + mz_uint i, n; + // Read the entire central directory into a heap block, and allocate another heap block to hold the unsorted central dir file record offsets, and another to hold the sorted indices. + if ((!mz_zip_array_resize(pZip, &pZip->m_pState->m_central_dir, cdir_size, MZ_FALSE)) || + (!mz_zip_array_resize(pZip, &pZip->m_pState->m_central_dir_offsets, pZip->m_total_files, MZ_FALSE)) || + (!mz_zip_array_resize(pZip, &pZip->m_pState->m_sorted_central_dir_offsets, pZip->m_total_files, MZ_FALSE))) + return MZ_FALSE; + if (pZip->m_pRead(pZip->m_pIO_opaque, cdir_ofs, pZip->m_pState->m_central_dir.m_p, cdir_size) != cdir_size) + return MZ_FALSE; + + // Now create an index into the central directory file records, do some basic sanity checking on each record, and check for zip64 entries (which are not yet supported). + p = (const mz_uint8 *)pZip->m_pState->m_central_dir.m_p; + for (n = cdir_size, i = 0; i < pZip->m_total_files; ++i) + { + mz_uint total_header_size, comp_size, decomp_size, disk_index; + if ((n < MZ_ZIP_CENTRAL_DIR_HEADER_SIZE) || (MZ_READ_LE32(p) != MZ_ZIP_CENTRAL_DIR_HEADER_SIG)) + return MZ_FALSE; + MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir_offsets, mz_uint32, i) = (mz_uint32)(p - (const mz_uint8 *)pZip->m_pState->m_central_dir.m_p); + MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_sorted_central_dir_offsets, mz_uint32, i) = i; + comp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS); + decomp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS); + if (((!MZ_READ_LE32(p + MZ_ZIP_CDH_METHOD_OFS)) && (decomp_size != comp_size)) || (decomp_size && !comp_size) || (decomp_size == 0xFFFFFFFF) || (comp_size == 0xFFFFFFFF)) + return MZ_FALSE; + disk_index = MZ_READ_LE16(p + MZ_ZIP_CDH_DISK_START_OFS); + if ((disk_index != num_this_disk) && (disk_index != 1)) + return MZ_FALSE; + if (((mz_uint64)MZ_READ_LE32(p + MZ_ZIP_CDH_LOCAL_HEADER_OFS) + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + comp_size) > pZip->m_archive_size) + return MZ_FALSE; + if ((total_header_size = MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS) + MZ_READ_LE16(p + MZ_ZIP_CDH_EXTRA_LEN_OFS) + MZ_READ_LE16(p + MZ_ZIP_CDH_COMMENT_LEN_OFS)) > n) + return MZ_FALSE; + n -= total_header_size; p += total_header_size; + } + } + + if ((flags & MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY) == 0) + mz_zip_reader_sort_central_dir_offsets_by_filename(pZip); + + return MZ_TRUE; +} + +mz_bool mz_zip_reader_init(mz_zip_archive *pZip, mz_uint64 size, mz_uint32 flags) +{ + if ((!pZip) || (!pZip->m_pRead)) + return MZ_FALSE; + if (!mz_zip_reader_init_internal(pZip, flags)) + return MZ_FALSE; + pZip->m_archive_size = size; + if (!mz_zip_reader_read_central_dir(pZip, flags)) + { + mz_zip_reader_end(pZip); + return MZ_FALSE; + } + return MZ_TRUE; +} + +static size_t mz_zip_mem_read_func(void *pOpaque, mz_uint64 file_ofs, void *pBuf, size_t n) +{ + mz_zip_archive *pZip = (mz_zip_archive *)pOpaque; + size_t s = (file_ofs >= pZip->m_archive_size) ? 0 : (size_t)MZ_MIN(pZip->m_archive_size - file_ofs, n); + memcpy(pBuf, (const mz_uint8 *)pZip->m_pState->m_pMem + file_ofs, s); + return s; +} + +mz_bool mz_zip_reader_init_mem(mz_zip_archive *pZip, const void *pMem, size_t size, mz_uint32 flags) +{ + if (!mz_zip_reader_init_internal(pZip, flags)) + return MZ_FALSE; + pZip->m_archive_size = size; + pZip->m_pRead = mz_zip_mem_read_func; + pZip->m_pIO_opaque = pZip; + pZip->m_pState->m_pMem = (void *)pMem; + pZip->m_pState->m_mem_size = size; + if (!mz_zip_reader_read_central_dir(pZip, flags)) + { + mz_zip_reader_end(pZip); + return MZ_FALSE; + } + return MZ_TRUE; +} + +#ifndef MINIZ_NO_STDIO +static size_t mz_zip_file_read_func(void *pOpaque, mz_uint64 file_ofs, void *pBuf, size_t n) +{ + mz_zip_archive *pZip = (mz_zip_archive *)pOpaque; + mz_int64 cur_ofs = MZ_FTELL64(pZip->m_pState->m_pFile); + if (((mz_int64)file_ofs < 0) || (((cur_ofs != (mz_int64)file_ofs)) && (MZ_FSEEK64(pZip->m_pState->m_pFile, (mz_int64)file_ofs, SEEK_SET)))) + return 0; + return MZ_FREAD(pBuf, 1, n, pZip->m_pState->m_pFile); +} + +mz_bool mz_zip_reader_init_file(mz_zip_archive *pZip, const char *pFilename, mz_uint32 flags) +{ + mz_uint64 file_size; + MZ_FILE *pFile = MZ_FOPEN(pFilename, "rb"); + if (!pFile) + return MZ_FALSE; + if (MZ_FSEEK64(pFile, 0, SEEK_END)) + return MZ_FALSE; + file_size = MZ_FTELL64(pFile); + if (!mz_zip_reader_init_internal(pZip, flags)) + { + MZ_FCLOSE(pFile); + return MZ_FALSE; + } + pZip->m_pRead = mz_zip_file_read_func; + pZip->m_pIO_opaque = pZip; + pZip->m_pState->m_pFile = pFile; + pZip->m_archive_size = file_size; + if (!mz_zip_reader_read_central_dir(pZip, flags)) + { + mz_zip_reader_end(pZip); + return MZ_FALSE; + } + return MZ_TRUE; +} +#endif // #ifndef MINIZ_NO_STDIO + +mz_uint mz_zip_reader_get_num_files(mz_zip_archive *pZip) +{ + return pZip ? pZip->m_total_files : 0; +} + +static MZ_FORCEINLINE const mz_uint8 *mz_zip_reader_get_cdh(mz_zip_archive *pZip, mz_uint file_index) +{ + if ((!pZip) || (!pZip->m_pState) || (file_index >= pZip->m_total_files) || (pZip->m_zip_mode != MZ_ZIP_MODE_READING)) + return NULL; + return &MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir_offsets, mz_uint32, file_index)); +} + +mz_bool mz_zip_reader_is_file_encrypted(mz_zip_archive *pZip, mz_uint file_index) +{ + mz_uint m_bit_flag; + const mz_uint8 *p = mz_zip_reader_get_cdh(pZip, file_index); + if (!p) + return MZ_FALSE; + m_bit_flag = MZ_READ_LE16(p + MZ_ZIP_CDH_BIT_FLAG_OFS); + return (m_bit_flag & 1); +} + +mz_bool mz_zip_reader_is_file_a_directory(mz_zip_archive *pZip, mz_uint file_index) +{ + mz_uint filename_len, internal_attr, external_attr; + const mz_uint8 *p = mz_zip_reader_get_cdh(pZip, file_index); + if (!p) + return MZ_FALSE; + + internal_attr = MZ_READ_LE16(p + MZ_ZIP_CDH_INTERNAL_ATTR_OFS); + external_attr = MZ_READ_LE32(p + MZ_ZIP_CDH_EXTERNAL_ATTR_OFS); + if ((!internal_attr) && ((external_attr & 0x10) != 0)) + return MZ_TRUE; + + filename_len = MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS); + if (filename_len) + { + if (*(p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + filename_len - 1) == '/') + return MZ_TRUE; + } + + return MZ_FALSE; +} + +mz_bool mz_zip_reader_file_stat(mz_zip_archive *pZip, mz_uint file_index, mz_zip_archive_file_stat *pStat) +{ + mz_uint n; + const mz_uint8 *p = mz_zip_reader_get_cdh(pZip, file_index); + if ((!p) || (!pStat)) + return MZ_FALSE; + + // Unpack the central directory record. + pStat->m_file_index = file_index; + pStat->m_central_dir_ofs = MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir_offsets, mz_uint32, file_index); + pStat->m_version_made_by = MZ_READ_LE16(p + MZ_ZIP_CDH_VERSION_MADE_BY_OFS); + pStat->m_version_needed = MZ_READ_LE16(p + MZ_ZIP_CDH_VERSION_NEEDED_OFS); + pStat->m_bit_flag = MZ_READ_LE16(p + MZ_ZIP_CDH_BIT_FLAG_OFS); + pStat->m_method = MZ_READ_LE16(p + MZ_ZIP_CDH_METHOD_OFS); +#ifndef MINIZ_NO_TIME + pStat->m_time = mz_zip_dos_to_time_t(MZ_READ_LE16(p + MZ_ZIP_CDH_FILE_TIME_OFS), MZ_READ_LE16(p + MZ_ZIP_CDH_FILE_DATE_OFS)); +#endif + pStat->m_crc32 = MZ_READ_LE32(p + MZ_ZIP_CDH_CRC32_OFS); + pStat->m_comp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS); + pStat->m_uncomp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS); + pStat->m_internal_attr = MZ_READ_LE16(p + MZ_ZIP_CDH_INTERNAL_ATTR_OFS); + pStat->m_external_attr = MZ_READ_LE32(p + MZ_ZIP_CDH_EXTERNAL_ATTR_OFS); + pStat->m_local_header_ofs = MZ_READ_LE32(p + MZ_ZIP_CDH_LOCAL_HEADER_OFS); + + // Copy as much of the filename and comment as possible. + n = MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS); n = MZ_MIN(n, MZ_ZIP_MAX_ARCHIVE_FILENAME_SIZE - 1); + memcpy(pStat->m_filename, p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE, n); pStat->m_filename[n] = '\0'; + + n = MZ_READ_LE16(p + MZ_ZIP_CDH_COMMENT_LEN_OFS); n = MZ_MIN(n, MZ_ZIP_MAX_ARCHIVE_FILE_COMMENT_SIZE - 1); + pStat->m_comment_size = n; + memcpy(pStat->m_comment, p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS) + MZ_READ_LE16(p + MZ_ZIP_CDH_EXTRA_LEN_OFS), n); pStat->m_comment[n] = '\0'; + + return MZ_TRUE; +} + +mz_uint mz_zip_reader_get_filename(mz_zip_archive *pZip, mz_uint file_index, char *pFilename, mz_uint filename_buf_size) +{ + mz_uint n; + const mz_uint8 *p = mz_zip_reader_get_cdh(pZip, file_index); + if (!p) { if (filename_buf_size) pFilename[0] = '\0'; return 0; } + n = MZ_READ_LE16(p + MZ_ZIP_CDH_FILENAME_LEN_OFS); + if (filename_buf_size) + { + n = MZ_MIN(n, filename_buf_size - 1); + memcpy(pFilename, p + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE, n); + pFilename[n] = '\0'; + } + return n + 1; +} + +static MZ_FORCEINLINE mz_bool mz_zip_reader_string_equal(const char *pA, const char *pB, mz_uint len, mz_uint flags) +{ + mz_uint i; + if (flags & MZ_ZIP_FLAG_CASE_SENSITIVE) + return 0 == memcmp(pA, pB, len); + for (i = 0; i < len; ++i) + if (MZ_TOLOWER(pA[i]) != MZ_TOLOWER(pB[i])) + return MZ_FALSE; + return MZ_TRUE; +} + +static MZ_FORCEINLINE int mz_zip_reader_filename_compare(const mz_zip_array *pCentral_dir_array, const mz_zip_array *pCentral_dir_offsets, mz_uint l_index, const char *pR, mz_uint r_len) +{ + const mz_uint8 *pL = &MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_array, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(pCentral_dir_offsets, mz_uint32, l_index)), *pE; + mz_uint l_len = MZ_READ_LE16(pL + MZ_ZIP_CDH_FILENAME_LEN_OFS); + mz_uint8 l = 0, r = 0; + pL += MZ_ZIP_CENTRAL_DIR_HEADER_SIZE; + pE = pL + MZ_MIN(l_len, r_len); + while (pL < pE) + { + if ((l = MZ_TOLOWER(*pL)) != (r = MZ_TOLOWER(*pR))) + break; + pL++; pR++; + } + return (pL == pE) ? (int)(l_len - r_len) : (l - r); +} + +static int mz_zip_reader_locate_file_binary_search(mz_zip_archive *pZip, const char *pFilename) +{ + mz_zip_internal_state *pState = pZip->m_pState; + const mz_zip_array *pCentral_dir_offsets = &pState->m_central_dir_offsets; + const mz_zip_array *pCentral_dir = &pState->m_central_dir; + mz_uint32 *pIndices = &MZ_ZIP_ARRAY_ELEMENT(&pState->m_sorted_central_dir_offsets, mz_uint32, 0); + const int size = pZip->m_total_files; + const mz_uint filename_len = (mz_uint)strlen(pFilename); + int l = 0, h = size - 1; + while (l <= h) + { + int m = (l + h) >> 1, file_index = pIndices[m], comp = mz_zip_reader_filename_compare(pCentral_dir, pCentral_dir_offsets, file_index, pFilename, filename_len); + if (!comp) + return file_index; + else if (comp < 0) + l = m + 1; + else + h = m - 1; + } + return -1; +} + +int mz_zip_reader_locate_file(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags) +{ + mz_uint file_index; size_t name_len, comment_len; + if ((!pZip) || (!pZip->m_pState) || (!pName) || (pZip->m_zip_mode != MZ_ZIP_MODE_READING)) + return -1; + if (((flags & (MZ_ZIP_FLAG_IGNORE_PATH | MZ_ZIP_FLAG_CASE_SENSITIVE)) == 0) && (!pComment) && (pZip->m_pState->m_sorted_central_dir_offsets.m_p)) + return mz_zip_reader_locate_file_binary_search(pZip, pName); + name_len = strlen(pName); if (name_len > 0xFFFF) return -1; + comment_len = pComment ? strlen(pComment) : 0; if (comment_len > 0xFFFF) return -1; + for (file_index = 0; file_index < pZip->m_total_files; file_index++) + { + const mz_uint8 *pHeader = &MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir, mz_uint8, MZ_ZIP_ARRAY_ELEMENT(&pZip->m_pState->m_central_dir_offsets, mz_uint32, file_index)); + mz_uint filename_len = MZ_READ_LE16(pHeader + MZ_ZIP_CDH_FILENAME_LEN_OFS); + const char *pFilename = (const char *)pHeader + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE; + if (filename_len < name_len) + continue; + if (comment_len) + { + mz_uint file_extra_len = MZ_READ_LE16(pHeader + MZ_ZIP_CDH_EXTRA_LEN_OFS), file_comment_len = MZ_READ_LE16(pHeader + MZ_ZIP_CDH_COMMENT_LEN_OFS); + const char *pFile_comment = pFilename + filename_len + file_extra_len; + if ((file_comment_len != comment_len) || (!mz_zip_reader_string_equal(pComment, pFile_comment, file_comment_len, flags))) + continue; + } + if ((flags & MZ_ZIP_FLAG_IGNORE_PATH) && (filename_len)) + { + int ofs = filename_len - 1; + do + { + if ((pFilename[ofs] == '/') || (pFilename[ofs] == '\\') || (pFilename[ofs] == ':')) + break; + } while (--ofs >= 0); + ofs++; + pFilename += ofs; filename_len -= ofs; + } + if ((filename_len == name_len) && (mz_zip_reader_string_equal(pName, pFilename, filename_len, flags))) + return file_index; + } + return -1; +} + +mz_bool mz_zip_reader_extract_to_mem_no_alloc(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size) +{ + int status = TINFL_STATUS_DONE; + mz_uint64 needed_size, cur_file_ofs, comp_remaining, out_buf_ofs = 0, read_buf_size, read_buf_ofs = 0, read_buf_avail; + mz_zip_archive_file_stat file_stat; + void *pRead_buf; + mz_uint32 local_header_u32[(MZ_ZIP_LOCAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)]; mz_uint8 *pLocal_header = (mz_uint8 *)local_header_u32; + tinfl_decompressor inflator; + + if ((buf_size) && (!pBuf)) + return MZ_FALSE; + + if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat)) + return MZ_FALSE; + + if (!file_stat.m_comp_size) + return MZ_TRUE; + + // Encryption and patch files are not supported. + if (file_stat.m_bit_flag & (1 | 32)) + return MZ_FALSE; + + // This function only supports stored and deflate. + if ((!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) && (file_stat.m_method != 0) && (file_stat.m_method != MZ_DEFLATED)) + return MZ_FALSE; + + // Ensure supplied output buffer is large enough. + needed_size = (flags & MZ_ZIP_FLAG_COMPRESSED_DATA) ? file_stat.m_comp_size : file_stat.m_uncomp_size; + if (buf_size < needed_size) + return MZ_FALSE; + + // Read and parse the local directory entry. + cur_file_ofs = file_stat.m_local_header_ofs; + if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE) + return MZ_FALSE; + if (MZ_READ_LE32(pLocal_header) != MZ_ZIP_LOCAL_DIR_HEADER_SIG) + return MZ_FALSE; + + cur_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_FILENAME_LEN_OFS) + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_EXTRA_LEN_OFS); + if ((cur_file_ofs + file_stat.m_comp_size) > pZip->m_archive_size) + return MZ_FALSE; + + if ((flags & MZ_ZIP_FLAG_COMPRESSED_DATA) || (!file_stat.m_method)) + { + // The file is stored or the caller has requested the compressed data. + if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pBuf, (size_t)needed_size) != needed_size) + return MZ_FALSE; + return ((flags & MZ_ZIP_FLAG_COMPRESSED_DATA) != 0) || (mz_crc32(MZ_CRC32_INIT, (const mz_uint8 *)pBuf, (size_t)file_stat.m_uncomp_size) == file_stat.m_crc32); + } + + // Decompress the file either directly from memory or from a file input buffer. + tinfl_init(&inflator); + + if (pZip->m_pState->m_pMem) + { + // Read directly from the archive in memory. + pRead_buf = (mz_uint8 *)pZip->m_pState->m_pMem + cur_file_ofs; + read_buf_size = read_buf_avail = file_stat.m_comp_size; + comp_remaining = 0; + } + else if (pUser_read_buf) + { + // Use a user provided read buffer. + if (!user_read_buf_size) + return MZ_FALSE; + pRead_buf = (mz_uint8 *)pUser_read_buf; + read_buf_size = user_read_buf_size; + read_buf_avail = 0; + comp_remaining = file_stat.m_uncomp_size; + } + else + { + // Temporarily allocate a read buffer. + read_buf_size = MZ_MIN(file_stat.m_comp_size, MZ_ZIP_MAX_IO_BUF_SIZE); +#ifdef _MSC_VER + if (((0, sizeof(size_t) == sizeof(mz_uint32))) && (read_buf_size > 0x7FFFFFFF)) +#else + if (((sizeof(size_t) == sizeof(mz_uint32))) && (read_buf_size > 0x7FFFFFFF)) +#endif + return MZ_FALSE; + if (NULL == (pRead_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)read_buf_size))) + return MZ_FALSE; + read_buf_avail = 0; + comp_remaining = file_stat.m_comp_size; + } + + do + { + size_t in_buf_size, out_buf_size = (size_t)(file_stat.m_uncomp_size - out_buf_ofs); + if ((!read_buf_avail) && (!pZip->m_pState->m_pMem)) + { + read_buf_avail = MZ_MIN(read_buf_size, comp_remaining); + if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pRead_buf, (size_t)read_buf_avail) != read_buf_avail) + { + status = TINFL_STATUS_FAILED; + break; + } + cur_file_ofs += read_buf_avail; + comp_remaining -= read_buf_avail; + read_buf_ofs = 0; + } + in_buf_size = (size_t)read_buf_avail; + status = tinfl_decompress(&inflator, (mz_uint8 *)pRead_buf + read_buf_ofs, &in_buf_size, (mz_uint8 *)pBuf, (mz_uint8 *)pBuf + out_buf_ofs, &out_buf_size, TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF | (comp_remaining ? TINFL_FLAG_HAS_MORE_INPUT : 0)); + read_buf_avail -= in_buf_size; + read_buf_ofs += in_buf_size; + out_buf_ofs += out_buf_size; + } while (status == TINFL_STATUS_NEEDS_MORE_INPUT); + + if (status == TINFL_STATUS_DONE) + { + // Make sure the entire file was decompressed, and check its CRC. + if ((out_buf_ofs != file_stat.m_uncomp_size) || (mz_crc32(MZ_CRC32_INIT, (const mz_uint8 *)pBuf, (size_t)file_stat.m_uncomp_size) != file_stat.m_crc32)) + status = TINFL_STATUS_FAILED; + } + + if ((!pZip->m_pState->m_pMem) && (!pUser_read_buf)) + pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf); + + return status == TINFL_STATUS_DONE; +} + +mz_bool mz_zip_reader_extract_file_to_mem_no_alloc(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size) +{ + int file_index = mz_zip_reader_locate_file(pZip, pFilename, NULL, flags); + if (file_index < 0) + return MZ_FALSE; + return mz_zip_reader_extract_to_mem_no_alloc(pZip, file_index, pBuf, buf_size, flags, pUser_read_buf, user_read_buf_size); +} + +mz_bool mz_zip_reader_extract_to_mem(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags) +{ + return mz_zip_reader_extract_to_mem_no_alloc(pZip, file_index, pBuf, buf_size, flags, NULL, 0); +} + +mz_bool mz_zip_reader_extract_file_to_mem(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags) +{ + return mz_zip_reader_extract_file_to_mem_no_alloc(pZip, pFilename, pBuf, buf_size, flags, NULL, 0); +} + +void *mz_zip_reader_extract_to_heap(mz_zip_archive *pZip, mz_uint file_index, size_t *pSize, mz_uint flags) +{ + mz_uint64 comp_size, uncomp_size, alloc_size; + const mz_uint8 *p = mz_zip_reader_get_cdh(pZip, file_index); + void *pBuf; + + if (pSize) + *pSize = 0; + if (!p) + return NULL; + + comp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS); + uncomp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS); + + alloc_size = (flags & MZ_ZIP_FLAG_COMPRESSED_DATA) ? comp_size : uncomp_size; +#ifdef _MSC_VER + if (((0, sizeof(size_t) == sizeof(mz_uint32))) && (alloc_size > 0x7FFFFFFF)) +#else + if (((sizeof(size_t) == sizeof(mz_uint32))) && (alloc_size > 0x7FFFFFFF)) +#endif + return NULL; + if (NULL == (pBuf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)alloc_size))) + return NULL; + + if (!mz_zip_reader_extract_to_mem(pZip, file_index, pBuf, (size_t)alloc_size, flags)) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf); + return NULL; + } + + if (pSize) *pSize = (size_t)alloc_size; + return pBuf; +} + +void *mz_zip_reader_extract_file_to_heap(mz_zip_archive *pZip, const char *pFilename, size_t *pSize, mz_uint flags) +{ + int file_index = mz_zip_reader_locate_file(pZip, pFilename, NULL, flags); + if (file_index < 0) + { + if (pSize) *pSize = 0; + return MZ_FALSE; + } + return mz_zip_reader_extract_to_heap(pZip, file_index, pSize, flags); +} + +mz_bool mz_zip_reader_extract_to_callback(mz_zip_archive *pZip, mz_uint file_index, mz_file_write_func pCallback, void *pOpaque, mz_uint flags) +{ + int status = TINFL_STATUS_DONE; mz_uint file_crc32 = MZ_CRC32_INIT; + mz_uint64 read_buf_size, read_buf_ofs = 0, read_buf_avail, comp_remaining, out_buf_ofs = 0, cur_file_ofs; + mz_zip_archive_file_stat file_stat; + void *pRead_buf = NULL; void *pWrite_buf = NULL; + mz_uint32 local_header_u32[(MZ_ZIP_LOCAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)]; mz_uint8 *pLocal_header = (mz_uint8 *)local_header_u32; + + if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat)) + return MZ_FALSE; + + if (!file_stat.m_comp_size) + return MZ_TRUE; + + // Encryption and patch files are not supported. + if (file_stat.m_bit_flag & (1 | 32)) + return MZ_FALSE; + + // This function only supports stored and deflate. + if ((!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) && (file_stat.m_method != 0) && (file_stat.m_method != MZ_DEFLATED)) + return MZ_FALSE; + + // Read and parse the local directory entry. + cur_file_ofs = file_stat.m_local_header_ofs; + if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE) + return MZ_FALSE; + if (MZ_READ_LE32(pLocal_header) != MZ_ZIP_LOCAL_DIR_HEADER_SIG) + return MZ_FALSE; + + cur_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_FILENAME_LEN_OFS) + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_EXTRA_LEN_OFS); + if ((cur_file_ofs + file_stat.m_comp_size) > pZip->m_archive_size) + return MZ_FALSE; + + // Decompress the file either directly from memory or from a file input buffer. + if (pZip->m_pState->m_pMem) + { + pRead_buf = (mz_uint8 *)pZip->m_pState->m_pMem + cur_file_ofs; + read_buf_size = read_buf_avail = file_stat.m_comp_size; + comp_remaining = 0; + } + else + { + read_buf_size = MZ_MIN(file_stat.m_comp_size, MZ_ZIP_MAX_IO_BUF_SIZE); + if (NULL == (pRead_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)read_buf_size))) + return MZ_FALSE; + read_buf_avail = 0; + comp_remaining = file_stat.m_comp_size; + } + + if ((flags & MZ_ZIP_FLAG_COMPRESSED_DATA) || (!file_stat.m_method)) + { + // The file is stored or the caller has requested the compressed data. + if (pZip->m_pState->m_pMem) + { +#ifdef _MSC_VER + if (((0, sizeof(size_t) == sizeof(mz_uint32))) && (file_stat.m_comp_size > 0xFFFFFFFF)) +#else + if (((sizeof(size_t) == sizeof(mz_uint32))) && (file_stat.m_comp_size > 0xFFFFFFFF)) +#endif + return MZ_FALSE; + if (pCallback(pOpaque, out_buf_ofs, pRead_buf, (size_t)file_stat.m_comp_size) != file_stat.m_comp_size) + status = TINFL_STATUS_FAILED; + else if (!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) + file_crc32 = (mz_uint32)mz_crc32(file_crc32, (const mz_uint8 *)pRead_buf, (size_t)file_stat.m_comp_size); + cur_file_ofs += file_stat.m_comp_size; + out_buf_ofs += file_stat.m_comp_size; + comp_remaining = 0; + } + else + { + while (comp_remaining) + { + read_buf_avail = MZ_MIN(read_buf_size, comp_remaining); + if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pRead_buf, (size_t)read_buf_avail) != read_buf_avail) + { + status = TINFL_STATUS_FAILED; + break; + } + + if (!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) + file_crc32 = (mz_uint32)mz_crc32(file_crc32, (const mz_uint8 *)pRead_buf, (size_t)read_buf_avail); + + if (pCallback(pOpaque, out_buf_ofs, pRead_buf, (size_t)read_buf_avail) != read_buf_avail) + { + status = TINFL_STATUS_FAILED; + break; + } + cur_file_ofs += read_buf_avail; + out_buf_ofs += read_buf_avail; + comp_remaining -= read_buf_avail; + } + } + } + else + { + tinfl_decompressor inflator; + tinfl_init(&inflator); + + if (NULL == (pWrite_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, TINFL_LZ_DICT_SIZE))) + status = TINFL_STATUS_FAILED; + else + { + do + { + mz_uint8 *pWrite_buf_cur = (mz_uint8 *)pWrite_buf + (out_buf_ofs & (TINFL_LZ_DICT_SIZE - 1)); + size_t in_buf_size, out_buf_size = TINFL_LZ_DICT_SIZE - (out_buf_ofs & (TINFL_LZ_DICT_SIZE - 1)); + if ((!read_buf_avail) && (!pZip->m_pState->m_pMem)) + { + read_buf_avail = MZ_MIN(read_buf_size, comp_remaining); + if (pZip->m_pRead(pZip->m_pIO_opaque, cur_file_ofs, pRead_buf, (size_t)read_buf_avail) != read_buf_avail) + { + status = TINFL_STATUS_FAILED; + break; + } + cur_file_ofs += read_buf_avail; + comp_remaining -= read_buf_avail; + read_buf_ofs = 0; + } + + in_buf_size = (size_t)read_buf_avail; + status = tinfl_decompress(&inflator, (const mz_uint8 *)pRead_buf + read_buf_ofs, &in_buf_size, (mz_uint8 *)pWrite_buf, pWrite_buf_cur, &out_buf_size, comp_remaining ? TINFL_FLAG_HAS_MORE_INPUT : 0); + read_buf_avail -= in_buf_size; + read_buf_ofs += in_buf_size; + + if (out_buf_size) + { + if (pCallback(pOpaque, out_buf_ofs, pWrite_buf_cur, out_buf_size) != out_buf_size) + { + status = TINFL_STATUS_FAILED; + break; + } + file_crc32 = (mz_uint32)mz_crc32(file_crc32, pWrite_buf_cur, out_buf_size); + if ((out_buf_ofs += out_buf_size) > file_stat.m_uncomp_size) + { + status = TINFL_STATUS_FAILED; + break; + } + } + } while ((status == TINFL_STATUS_NEEDS_MORE_INPUT) || (status == TINFL_STATUS_HAS_MORE_OUTPUT)); + } + } + + if ((status == TINFL_STATUS_DONE) && (!(flags & MZ_ZIP_FLAG_COMPRESSED_DATA))) + { + // Make sure the entire file was decompressed, and check its CRC. + if ((out_buf_ofs != file_stat.m_uncomp_size) || (file_crc32 != file_stat.m_crc32)) + status = TINFL_STATUS_FAILED; + } + + if (!pZip->m_pState->m_pMem) + pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf); + if (pWrite_buf) + pZip->m_pFree(pZip->m_pAlloc_opaque, pWrite_buf); + + return status == TINFL_STATUS_DONE; +} + +mz_bool mz_zip_reader_extract_file_to_callback(mz_zip_archive *pZip, const char *pFilename, mz_file_write_func pCallback, void *pOpaque, mz_uint flags) +{ + int file_index = mz_zip_reader_locate_file(pZip, pFilename, NULL, flags); + if (file_index < 0) + return MZ_FALSE; + return mz_zip_reader_extract_to_callback(pZip, file_index, pCallback, pOpaque, flags); +} + +#ifndef MINIZ_NO_STDIO +static size_t mz_zip_file_write_callback(void *pOpaque, mz_uint64 ofs, const void *pBuf, size_t n) +{ + (void)ofs; return MZ_FWRITE(pBuf, 1, n, (MZ_FILE*)pOpaque); +} + +mz_bool mz_zip_reader_extract_to_file(mz_zip_archive *pZip, mz_uint file_index, const char *pDst_filename, mz_uint flags) +{ + mz_bool status; + mz_zip_archive_file_stat file_stat; + MZ_FILE *pFile; + if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat)) + return MZ_FALSE; + pFile = MZ_FOPEN(pDst_filename, "wb"); + if (!pFile) + return MZ_FALSE; + status = mz_zip_reader_extract_to_callback(pZip, file_index, mz_zip_file_write_callback, pFile, flags); + if (MZ_FCLOSE(pFile) == EOF) + return MZ_FALSE; +#ifndef MINIZ_NO_TIME + if (status) + mz_zip_set_file_times(pDst_filename, file_stat.m_time, file_stat.m_time); +#endif + return status; +} +#endif // #ifndef MINIZ_NO_STDIO + +mz_bool mz_zip_reader_end(mz_zip_archive *pZip) +{ + if ((!pZip) || (!pZip->m_pState) || (!pZip->m_pAlloc) || (!pZip->m_pFree) || (pZip->m_zip_mode != MZ_ZIP_MODE_READING)) + return MZ_FALSE; + + if (pZip->m_pState) + { + mz_zip_internal_state *pState = pZip->m_pState; pZip->m_pState = NULL; + mz_zip_array_clear(pZip, &pState->m_central_dir); + mz_zip_array_clear(pZip, &pState->m_central_dir_offsets); + mz_zip_array_clear(pZip, &pState->m_sorted_central_dir_offsets); + +#ifndef MINIZ_NO_STDIO + if (pState->m_pFile) + { + MZ_FCLOSE(pState->m_pFile); + pState->m_pFile = NULL; + } +#endif // #ifndef MINIZ_NO_STDIO + + pZip->m_pFree(pZip->m_pAlloc_opaque, pState); + } + pZip->m_zip_mode = MZ_ZIP_MODE_INVALID; + + return MZ_TRUE; +} + +#ifndef MINIZ_NO_STDIO +mz_bool mz_zip_reader_extract_file_to_file(mz_zip_archive *pZip, const char *pArchive_filename, const char *pDst_filename, mz_uint flags) +{ + int file_index = mz_zip_reader_locate_file(pZip, pArchive_filename, NULL, flags); + if (file_index < 0) + return MZ_FALSE; + return mz_zip_reader_extract_to_file(pZip, file_index, pDst_filename, flags); +} +#endif + +// ------------------- .ZIP archive writing + +#ifndef MINIZ_NO_ARCHIVE_WRITING_APIS + +static void mz_write_le16(mz_uint8 *p, mz_uint16 v) { p[0] = (mz_uint8)v; p[1] = (mz_uint8)(v >> 8); } +static void mz_write_le32(mz_uint8 *p, mz_uint32 v) { p[0] = (mz_uint8)v; p[1] = (mz_uint8)(v >> 8); p[2] = (mz_uint8)(v >> 16); p[3] = (mz_uint8)(v >> 24); } +#define MZ_WRITE_LE16(p, v) mz_write_le16((mz_uint8 *)(p), (mz_uint16)(v)) +#define MZ_WRITE_LE32(p, v) mz_write_le32((mz_uint8 *)(p), (mz_uint32)(v)) + +mz_bool mz_zip_writer_init(mz_zip_archive *pZip, mz_uint64 existing_size) +{ + if ((!pZip) || (pZip->m_pState) || (!pZip->m_pWrite) || (pZip->m_zip_mode != MZ_ZIP_MODE_INVALID)) + return MZ_FALSE; + + if (pZip->m_file_offset_alignment) + { + // Ensure user specified file offset alignment is a power of 2. + if (pZip->m_file_offset_alignment & (pZip->m_file_offset_alignment - 1)) + return MZ_FALSE; + } + + if (!pZip->m_pAlloc) pZip->m_pAlloc = def_alloc_func; + if (!pZip->m_pFree) pZip->m_pFree = def_free_func; + if (!pZip->m_pRealloc) pZip->m_pRealloc = def_realloc_func; + + pZip->m_zip_mode = MZ_ZIP_MODE_WRITING; + pZip->m_archive_size = existing_size; + pZip->m_central_directory_file_ofs = 0; + pZip->m_total_files = 0; + + if (NULL == (pZip->m_pState = (mz_zip_internal_state *)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(mz_zip_internal_state)))) + return MZ_FALSE; + memset(pZip->m_pState, 0, sizeof(mz_zip_internal_state)); + MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_central_dir, sizeof(mz_uint8)); + MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_central_dir_offsets, sizeof(mz_uint32)); + MZ_ZIP_ARRAY_SET_ELEMENT_SIZE(&pZip->m_pState->m_sorted_central_dir_offsets, sizeof(mz_uint32)); + return MZ_TRUE; +} + +static size_t mz_zip_heap_write_func(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n) +{ + mz_zip_archive *pZip = (mz_zip_archive *)pOpaque; + mz_zip_internal_state *pState = pZip->m_pState; + mz_uint64 new_size = MZ_MAX(file_ofs + n, pState->m_mem_size); +#ifdef _MSC_VER + if ((!n) || ((0, sizeof(size_t) == sizeof(mz_uint32)) && (new_size > 0x7FFFFFFF))) +#else + if ((!n) || ((sizeof(size_t) == sizeof(mz_uint32)) && (new_size > 0x7FFFFFFF))) +#endif + return 0; + if (new_size > pState->m_mem_capacity) + { + void *pNew_block; + size_t new_capacity = MZ_MAX(64, pState->m_mem_capacity); while (new_capacity < new_size) new_capacity *= 2; + if (NULL == (pNew_block = pZip->m_pRealloc(pZip->m_pAlloc_opaque, pState->m_pMem, 1, new_capacity))) + return 0; + pState->m_pMem = pNew_block; pState->m_mem_capacity = new_capacity; + } + memcpy((mz_uint8 *)pState->m_pMem + file_ofs, pBuf, n); + pState->m_mem_size = (size_t)new_size; + return n; +} + +mz_bool mz_zip_writer_init_heap(mz_zip_archive *pZip, size_t size_to_reserve_at_beginning, size_t initial_allocation_size) +{ + pZip->m_pWrite = mz_zip_heap_write_func; + pZip->m_pIO_opaque = pZip; + if (!mz_zip_writer_init(pZip, size_to_reserve_at_beginning)) + return MZ_FALSE; + if (0 != (initial_allocation_size = MZ_MAX(initial_allocation_size, size_to_reserve_at_beginning))) + { + if (NULL == (pZip->m_pState->m_pMem = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, initial_allocation_size))) + { + mz_zip_writer_end(pZip); + return MZ_FALSE; + } + pZip->m_pState->m_mem_capacity = initial_allocation_size; + } + return MZ_TRUE; +} + +#ifndef MINIZ_NO_STDIO +static size_t mz_zip_file_write_func(void *pOpaque, mz_uint64 file_ofs, const void *pBuf, size_t n) +{ + mz_zip_archive *pZip = (mz_zip_archive *)pOpaque; + mz_int64 cur_ofs = MZ_FTELL64(pZip->m_pState->m_pFile); + if (((mz_int64)file_ofs < 0) || (((cur_ofs != (mz_int64)file_ofs)) && (MZ_FSEEK64(pZip->m_pState->m_pFile, (mz_int64)file_ofs, SEEK_SET)))) + return 0; + return MZ_FWRITE(pBuf, 1, n, pZip->m_pState->m_pFile); +} + +mz_bool mz_zip_writer_init_file(mz_zip_archive *pZip, const char *pFilename, mz_uint64 size_to_reserve_at_beginning) +{ + MZ_FILE *pFile; + pZip->m_pWrite = mz_zip_file_write_func; + pZip->m_pIO_opaque = pZip; + if (!mz_zip_writer_init(pZip, size_to_reserve_at_beginning)) + return MZ_FALSE; + if (NULL == (pFile = MZ_FOPEN(pFilename, "wb"))) + { + mz_zip_writer_end(pZip); + return MZ_FALSE; + } + pZip->m_pState->m_pFile = pFile; + if (size_to_reserve_at_beginning) + { + mz_uint64 cur_ofs = 0; char buf[4096]; MZ_CLEAR_OBJ(buf); + do + { + size_t n = (size_t)MZ_MIN(sizeof(buf), size_to_reserve_at_beginning); + if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_ofs, buf, n) != n) + { + mz_zip_writer_end(pZip); + return MZ_FALSE; + } + cur_ofs += n; size_to_reserve_at_beginning -= n; + } while (size_to_reserve_at_beginning); + } + return MZ_TRUE; +} +#endif // #ifndef MINIZ_NO_STDIO + +mz_bool mz_zip_writer_init_from_reader(mz_zip_archive *pZip, const char *pFilename) +{ + mz_zip_internal_state *pState; + if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_READING)) + return MZ_FALSE; + // No sense in trying to write to an archive that's already at the support max size + if ((pZip->m_total_files == 0xFFFF) || ((pZip->m_archive_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + MZ_ZIP_LOCAL_DIR_HEADER_SIZE) > 0xFFFFFFFF)) + return MZ_FALSE; + + pState = pZip->m_pState; + + if (pState->m_pFile) + { +#ifdef MINIZ_NO_STDIO + pFilename; return MZ_FALSE; +#else + // Archive is being read from stdio - try to reopen as writable. + if (pZip->m_pIO_opaque != pZip) + return MZ_FALSE; + if (!pFilename) + return MZ_FALSE; + pZip->m_pWrite = mz_zip_file_write_func; + if (NULL == (pState->m_pFile = MZ_FREOPEN(pFilename, "r+b", pState->m_pFile))) + { + // The mz_zip_archive is now in a bogus state because pState->m_pFile is NULL, so just close it. + mz_zip_reader_end(pZip); + return MZ_FALSE; + } +#endif // #ifdef MINIZ_NO_STDIO + } + else if (pState->m_pMem) + { + // Archive lives in a memory block. Assume it's from the heap that we can resize using the realloc callback. + if (pZip->m_pIO_opaque != pZip) + return MZ_FALSE; + pState->m_mem_capacity = pState->m_mem_size; + pZip->m_pWrite = mz_zip_heap_write_func; + } + // Archive is being read via a user provided read function - make sure the user has specified a write function too. + else if (!pZip->m_pWrite) + return MZ_FALSE; + + // Start writing new files at the archive's current central directory location. + pZip->m_archive_size = pZip->m_central_directory_file_ofs; + pZip->m_zip_mode = MZ_ZIP_MODE_WRITING; + pZip->m_central_directory_file_ofs = 0; + + return MZ_TRUE; +} + +mz_bool mz_zip_writer_add_mem(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, mz_uint level_and_flags) +{ + return mz_zip_writer_add_mem_ex(pZip, pArchive_name, pBuf, buf_size, NULL, 0, level_and_flags, 0, 0); +} + +typedef struct +{ + mz_zip_archive *m_pZip; + mz_uint64 m_cur_archive_file_ofs; + mz_uint64 m_comp_size; +} mz_zip_writer_add_state; + +static mz_bool mz_zip_writer_add_put_buf_callback(const void* pBuf, int len, void *pUser) +{ + mz_zip_writer_add_state *pState = (mz_zip_writer_add_state *)pUser; + if ((int)pState->m_pZip->m_pWrite(pState->m_pZip->m_pIO_opaque, pState->m_cur_archive_file_ofs, pBuf, len) != len) + return MZ_FALSE; + pState->m_cur_archive_file_ofs += len; + pState->m_comp_size += len; + return MZ_TRUE; +} + +static mz_bool mz_zip_writer_create_local_dir_header(mz_zip_archive *pZip, mz_uint8 *pDst, mz_uint16 filename_size, mz_uint16 extra_size, mz_uint64 uncomp_size, mz_uint64 comp_size, mz_uint32 uncomp_crc32, mz_uint16 method, mz_uint16 bit_flags, mz_uint16 dos_time, mz_uint16 dos_date) +{ + (void)pZip; + memset(pDst, 0, MZ_ZIP_LOCAL_DIR_HEADER_SIZE); + MZ_WRITE_LE32(pDst + MZ_ZIP_LDH_SIG_OFS, MZ_ZIP_LOCAL_DIR_HEADER_SIG); + MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_VERSION_NEEDED_OFS, method ? 20 : 0); + MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_BIT_FLAG_OFS, bit_flags); + MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_METHOD_OFS, method); + MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_FILE_TIME_OFS, dos_time); + MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_FILE_DATE_OFS, dos_date); + MZ_WRITE_LE32(pDst + MZ_ZIP_LDH_CRC32_OFS, uncomp_crc32); + MZ_WRITE_LE32(pDst + MZ_ZIP_LDH_COMPRESSED_SIZE_OFS, comp_size); + MZ_WRITE_LE32(pDst + MZ_ZIP_LDH_DECOMPRESSED_SIZE_OFS, uncomp_size); + MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_FILENAME_LEN_OFS, filename_size); + MZ_WRITE_LE16(pDst + MZ_ZIP_LDH_EXTRA_LEN_OFS, extra_size); + return MZ_TRUE; +} + +static mz_bool mz_zip_writer_create_central_dir_header(mz_zip_archive *pZip, mz_uint8 *pDst, mz_uint16 filename_size, mz_uint16 extra_size, mz_uint16 comment_size, mz_uint64 uncomp_size, mz_uint64 comp_size, mz_uint32 uncomp_crc32, mz_uint16 method, mz_uint16 bit_flags, mz_uint16 dos_time, mz_uint16 dos_date, mz_uint64 local_header_ofs, mz_uint32 ext_attributes) +{ + (void)pZip; + memset(pDst, 0, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE); + MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_SIG_OFS, MZ_ZIP_CENTRAL_DIR_HEADER_SIG); + MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_VERSION_NEEDED_OFS, method ? 20 : 0); + MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_BIT_FLAG_OFS, bit_flags); + MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_METHOD_OFS, method); + MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_FILE_TIME_OFS, dos_time); + MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_FILE_DATE_OFS, dos_date); + MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_CRC32_OFS, uncomp_crc32); + MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS, comp_size); + MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS, uncomp_size); + MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_FILENAME_LEN_OFS, filename_size); + MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_EXTRA_LEN_OFS, extra_size); + MZ_WRITE_LE16(pDst + MZ_ZIP_CDH_COMMENT_LEN_OFS, comment_size); + MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_EXTERNAL_ATTR_OFS, ext_attributes); + MZ_WRITE_LE32(pDst + MZ_ZIP_CDH_LOCAL_HEADER_OFS, local_header_ofs); + return MZ_TRUE; +} + +static mz_bool mz_zip_writer_add_to_central_dir(mz_zip_archive *pZip, const char *pFilename, mz_uint16 filename_size, const void *pExtra, mz_uint16 extra_size, const void *pComment, mz_uint16 comment_size, mz_uint64 uncomp_size, mz_uint64 comp_size, mz_uint32 uncomp_crc32, mz_uint16 method, mz_uint16 bit_flags, mz_uint16 dos_time, mz_uint16 dos_date, mz_uint64 local_header_ofs, mz_uint32 ext_attributes) +{ + mz_zip_internal_state *pState = pZip->m_pState; + mz_uint32 central_dir_ofs = (mz_uint32)pState->m_central_dir.m_size; + size_t orig_central_dir_size = pState->m_central_dir.m_size; + mz_uint8 central_dir_header[MZ_ZIP_CENTRAL_DIR_HEADER_SIZE]; + + // No zip64 support yet + if ((local_header_ofs > 0xFFFFFFFF) || (((mz_uint64)pState->m_central_dir.m_size + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + filename_size + extra_size + comment_size) > 0xFFFFFFFF)) + return MZ_FALSE; + + if (!mz_zip_writer_create_central_dir_header(pZip, central_dir_header, filename_size, extra_size, comment_size, uncomp_size, comp_size, uncomp_crc32, method, bit_flags, dos_time, dos_date, local_header_ofs, ext_attributes)) + return MZ_FALSE; + + if ((!mz_zip_array_push_back(pZip, &pState->m_central_dir, central_dir_header, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE)) || + (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pFilename, filename_size)) || + (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pExtra, extra_size)) || + (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pComment, comment_size)) || + (!mz_zip_array_push_back(pZip, &pState->m_central_dir_offsets, ¢ral_dir_ofs, 1))) + { + // Try to push the central directory array back into its original state. + mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE); + return MZ_FALSE; + } + + return MZ_TRUE; +} + +static mz_bool mz_zip_writer_validate_archive_name(const char *pArchive_name) +{ + // Basic ZIP archive filename validity checks: Valid filenames cannot start with a forward slash, cannot contain a drive letter, and cannot use DOS-style backward slashes. + if (*pArchive_name == '/') + return MZ_FALSE; + while (*pArchive_name) + { + if ((*pArchive_name == '\\') || (*pArchive_name == ':')) + return MZ_FALSE; + pArchive_name++; + } + return MZ_TRUE; +} + +static mz_uint mz_zip_writer_compute_padding_needed_for_file_alignment(mz_zip_archive *pZip) +{ + mz_uint32 n; + if (!pZip->m_file_offset_alignment) + return 0; + n = (mz_uint32)(pZip->m_archive_size & (pZip->m_file_offset_alignment - 1)); + return (pZip->m_file_offset_alignment - n) & (pZip->m_file_offset_alignment - 1); +} + +static mz_bool mz_zip_writer_write_zeros(mz_zip_archive *pZip, mz_uint64 cur_file_ofs, mz_uint32 n) +{ + char buf[4096]; + memset(buf, 0, MZ_MIN(sizeof(buf), n)); + while (n) + { + mz_uint32 s = MZ_MIN(sizeof(buf), n); + if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_file_ofs, buf, s) != s) + return MZ_FALSE; + cur_file_ofs += s; n -= s; + } + return MZ_TRUE; +} + +mz_bool mz_zip_writer_add_mem_ex(mz_zip_archive *pZip, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags, mz_uint64 uncomp_size, mz_uint32 uncomp_crc32) +{ + mz_uint16 method = 0, dos_time = 0, dos_date = 0; + mz_uint level, ext_attributes = 0, num_alignment_padding_bytes; + mz_uint64 local_dir_header_ofs = pZip->m_archive_size, cur_archive_file_ofs = pZip->m_archive_size, comp_size = 0; + size_t archive_name_size; + mz_uint8 local_dir_header[MZ_ZIP_LOCAL_DIR_HEADER_SIZE]; + tdefl_compressor *pComp = NULL; + mz_bool store_data_uncompressed; + mz_zip_internal_state *pState; + + if ((int)level_and_flags < 0) + level_and_flags = MZ_DEFAULT_LEVEL; + level = level_and_flags & 0xF; + store_data_uncompressed = ((!level) || (level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA)); + + if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING) || ((buf_size) && (!pBuf)) || (!pArchive_name) || ((comment_size) && (!pComment)) || (pZip->m_total_files == 0xFFFF) || (level > MZ_UBER_COMPRESSION)) + return MZ_FALSE; + + pState = pZip->m_pState; + + if ((!(level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) && (uncomp_size)) + return MZ_FALSE; + // No zip64 support yet + if ((buf_size > 0xFFFFFFFF) || (uncomp_size > 0xFFFFFFFF)) + return MZ_FALSE; + if (!mz_zip_writer_validate_archive_name(pArchive_name)) + return MZ_FALSE; + +#ifndef MINIZ_NO_TIME + { + time_t cur_time; time(&cur_time); + mz_zip_time_to_dos_time(cur_time, &dos_time, &dos_date); + } +#endif // #ifndef MINIZ_NO_TIME + + archive_name_size = strlen(pArchive_name); + if (archive_name_size > 0xFFFF) + return MZ_FALSE; + + num_alignment_padding_bytes = mz_zip_writer_compute_padding_needed_for_file_alignment(pZip); + + // no zip64 support yet + if ((pZip->m_total_files == 0xFFFF) || ((pZip->m_archive_size + num_alignment_padding_bytes + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + comment_size + archive_name_size) > 0xFFFFFFFF)) + return MZ_FALSE; + + if ((archive_name_size) && (pArchive_name[archive_name_size - 1] == '/')) + { + // Set DOS Subdirectory attribute bit. + ext_attributes |= 0x10; + // Subdirectories cannot contain data. + if ((buf_size) || (uncomp_size)) + return MZ_FALSE; + } + + // Try to do any allocations before writing to the archive, so if an allocation fails the file remains unmodified. (A good idea if we're doing an in-place modification.) + if ((!mz_zip_array_ensure_room(pZip, &pState->m_central_dir, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + archive_name_size + comment_size)) || (!mz_zip_array_ensure_room(pZip, &pState->m_central_dir_offsets, 1))) + return MZ_FALSE; + + if ((!store_data_uncompressed) && (buf_size)) + { + if (NULL == (pComp = (tdefl_compressor *)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(tdefl_compressor)))) + return MZ_FALSE; + } + + if (!mz_zip_writer_write_zeros(pZip, cur_archive_file_ofs, num_alignment_padding_bytes + sizeof(local_dir_header))) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pComp); + return MZ_FALSE; + } + local_dir_header_ofs += num_alignment_padding_bytes; + if (pZip->m_file_offset_alignment) { MZ_ASSERT((local_dir_header_ofs & (pZip->m_file_offset_alignment - 1)) == 0); } + cur_archive_file_ofs += num_alignment_padding_bytes + sizeof(local_dir_header); + + MZ_CLEAR_OBJ(local_dir_header); + if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pArchive_name, archive_name_size) != archive_name_size) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pComp); + return MZ_FALSE; + } + cur_archive_file_ofs += archive_name_size; + + if (!(level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA)) + { + uncomp_crc32 = (mz_uint32)mz_crc32(MZ_CRC32_INIT, (const mz_uint8*)pBuf, buf_size); + uncomp_size = buf_size; + if (uncomp_size <= 3) + { + level = 0; + store_data_uncompressed = MZ_TRUE; + } + } + + if (store_data_uncompressed) + { + if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pBuf, buf_size) != buf_size) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pComp); + return MZ_FALSE; + } + + cur_archive_file_ofs += buf_size; + comp_size = buf_size; + + if (level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA) + method = MZ_DEFLATED; + } + else if (buf_size) + { + mz_zip_writer_add_state state; + + state.m_pZip = pZip; + state.m_cur_archive_file_ofs = cur_archive_file_ofs; + state.m_comp_size = 0; + + if ((tdefl_init(pComp, mz_zip_writer_add_put_buf_callback, &state, tdefl_create_comp_flags_from_zip_params(level, -15, MZ_DEFAULT_STRATEGY)) != TDEFL_STATUS_OKAY) || + (tdefl_compress_buffer(pComp, pBuf, buf_size, TDEFL_FINISH) != TDEFL_STATUS_DONE)) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pComp); + return MZ_FALSE; + } + + comp_size = state.m_comp_size; + cur_archive_file_ofs = state.m_cur_archive_file_ofs; + + method = MZ_DEFLATED; + } + + pZip->m_pFree(pZip->m_pAlloc_opaque, pComp); + pComp = NULL; + + // no zip64 support yet + if ((comp_size > 0xFFFFFFFF) || (cur_archive_file_ofs > 0xFFFFFFFF)) + return MZ_FALSE; + + if (!mz_zip_writer_create_local_dir_header(pZip, local_dir_header, (mz_uint16)archive_name_size, 0, uncomp_size, comp_size, uncomp_crc32, method, 0, dos_time, dos_date)) + return MZ_FALSE; + + if (pZip->m_pWrite(pZip->m_pIO_opaque, local_dir_header_ofs, local_dir_header, sizeof(local_dir_header)) != sizeof(local_dir_header)) + return MZ_FALSE; + + if (!mz_zip_writer_add_to_central_dir(pZip, pArchive_name, (mz_uint16)archive_name_size, NULL, 0, pComment, comment_size, uncomp_size, comp_size, uncomp_crc32, method, 0, dos_time, dos_date, local_dir_header_ofs, ext_attributes)) + return MZ_FALSE; + + pZip->m_total_files++; + pZip->m_archive_size = cur_archive_file_ofs; + + return MZ_TRUE; +} + +#ifndef MINIZ_NO_STDIO +mz_bool mz_zip_writer_add_file(mz_zip_archive *pZip, const char *pArchive_name, const char *pSrc_filename, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags) +{ + mz_uint uncomp_crc32 = MZ_CRC32_INIT, level, num_alignment_padding_bytes; + mz_uint16 method = 0, dos_time = 0, dos_date = 0, ext_attributes = 0; + mz_uint64 local_dir_header_ofs = pZip->m_archive_size, cur_archive_file_ofs = pZip->m_archive_size, uncomp_size = 0, comp_size = 0; + size_t archive_name_size; + mz_uint8 local_dir_header[MZ_ZIP_LOCAL_DIR_HEADER_SIZE]; + MZ_FILE *pSrc_file = NULL; + + if ((int)level_and_flags < 0) + level_and_flags = MZ_DEFAULT_LEVEL; + level = level_and_flags & 0xF; + + if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING) || (!pArchive_name) || ((comment_size) && (!pComment)) || (level > MZ_UBER_COMPRESSION)) + return MZ_FALSE; + if (level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA) + return MZ_FALSE; + if (!mz_zip_writer_validate_archive_name(pArchive_name)) + return MZ_FALSE; + + archive_name_size = strlen(pArchive_name); + if (archive_name_size > 0xFFFF) + return MZ_FALSE; + + num_alignment_padding_bytes = mz_zip_writer_compute_padding_needed_for_file_alignment(pZip); + + // no zip64 support yet + if ((pZip->m_total_files == 0xFFFF) || ((pZip->m_archive_size + num_alignment_padding_bytes + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE + comment_size + archive_name_size) > 0xFFFFFFFF)) + return MZ_FALSE; + + if (!mz_zip_get_file_modified_time(pSrc_filename, &dos_time, &dos_date)) + return MZ_FALSE; + + pSrc_file = MZ_FOPEN(pSrc_filename, "rb"); + if (!pSrc_file) + return MZ_FALSE; + MZ_FSEEK64(pSrc_file, 0, SEEK_END); + uncomp_size = MZ_FTELL64(pSrc_file); + MZ_FSEEK64(pSrc_file, 0, SEEK_SET); + + if (uncomp_size > 0xFFFFFFFF) + { + // No zip64 support yet + MZ_FCLOSE(pSrc_file); + return MZ_FALSE; + } + if (uncomp_size <= 3) + level = 0; + + if (!mz_zip_writer_write_zeros(pZip, cur_archive_file_ofs, num_alignment_padding_bytes + sizeof(local_dir_header))) + return MZ_FALSE; + local_dir_header_ofs += num_alignment_padding_bytes; + if (pZip->m_file_offset_alignment) { MZ_ASSERT((local_dir_header_ofs & (pZip->m_file_offset_alignment - 1)) == 0); } + cur_archive_file_ofs += num_alignment_padding_bytes + sizeof(local_dir_header); + + MZ_CLEAR_OBJ(local_dir_header); + if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pArchive_name, archive_name_size) != archive_name_size) + { + MZ_FCLOSE(pSrc_file); + return MZ_FALSE; + } + cur_archive_file_ofs += archive_name_size; + + if (uncomp_size) + { + mz_uint64 uncomp_remaining = uncomp_size; + void *pRead_buf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, MZ_ZIP_MAX_IO_BUF_SIZE); + if (!pRead_buf) + { + MZ_FCLOSE(pSrc_file); + return MZ_FALSE; + } + + if (!level) + { + while (uncomp_remaining) + { + mz_uint n = (mz_uint)MZ_MIN(MZ_ZIP_MAX_IO_BUF_SIZE, uncomp_remaining); + if ((MZ_FREAD(pRead_buf, 1, n, pSrc_file) != n) || (pZip->m_pWrite(pZip->m_pIO_opaque, cur_archive_file_ofs, pRead_buf, n) != n)) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf); + MZ_FCLOSE(pSrc_file); + return MZ_FALSE; + } + uncomp_crc32 = (mz_uint32)mz_crc32(uncomp_crc32, (const mz_uint8 *)pRead_buf, n); + uncomp_remaining -= n; + cur_archive_file_ofs += n; + } + comp_size = uncomp_size; + } + else + { + mz_bool result = MZ_FALSE; + mz_zip_writer_add_state state; + tdefl_compressor *pComp = (tdefl_compressor *)pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, sizeof(tdefl_compressor)); + if (!pComp) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf); + MZ_FCLOSE(pSrc_file); + return MZ_FALSE; + } + + state.m_pZip = pZip; + state.m_cur_archive_file_ofs = cur_archive_file_ofs; + state.m_comp_size = 0; + + if (tdefl_init(pComp, mz_zip_writer_add_put_buf_callback, &state, tdefl_create_comp_flags_from_zip_params(level, -15, MZ_DEFAULT_STRATEGY)) != TDEFL_STATUS_OKAY) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pComp); + pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf); + MZ_FCLOSE(pSrc_file); + return MZ_FALSE; + } + + for ( ; ; ) + { + size_t in_buf_size = (mz_uint32)MZ_MIN(uncomp_remaining, MZ_ZIP_MAX_IO_BUF_SIZE); + tdefl_status status; + + if (MZ_FREAD(pRead_buf, 1, in_buf_size, pSrc_file) != in_buf_size) + break; + + uncomp_crc32 = (mz_uint32)mz_crc32(uncomp_crc32, (const mz_uint8 *)pRead_buf, in_buf_size); + uncomp_remaining -= in_buf_size; + + status = tdefl_compress_buffer(pComp, pRead_buf, in_buf_size, uncomp_remaining ? TDEFL_NO_FLUSH : TDEFL_FINISH); + if (status == TDEFL_STATUS_DONE) + { + result = MZ_TRUE; + break; + } + else if (status != TDEFL_STATUS_OKAY) + break; + } + + pZip->m_pFree(pZip->m_pAlloc_opaque, pComp); + + if (!result) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf); + MZ_FCLOSE(pSrc_file); + return MZ_FALSE; + } + + comp_size = state.m_comp_size; + cur_archive_file_ofs = state.m_cur_archive_file_ofs; + + method = MZ_DEFLATED; + } + + pZip->m_pFree(pZip->m_pAlloc_opaque, pRead_buf); + } + + MZ_FCLOSE(pSrc_file); pSrc_file = NULL; + + // no zip64 support yet + if ((comp_size > 0xFFFFFFFF) || (cur_archive_file_ofs > 0xFFFFFFFF)) + return MZ_FALSE; + + if (!mz_zip_writer_create_local_dir_header(pZip, local_dir_header, (mz_uint16)archive_name_size, 0, uncomp_size, comp_size, uncomp_crc32, method, 0, dos_time, dos_date)) + return MZ_FALSE; + + if (pZip->m_pWrite(pZip->m_pIO_opaque, local_dir_header_ofs, local_dir_header, sizeof(local_dir_header)) != sizeof(local_dir_header)) + return MZ_FALSE; + + if (!mz_zip_writer_add_to_central_dir(pZip, pArchive_name, (mz_uint16)archive_name_size, NULL, 0, pComment, comment_size, uncomp_size, comp_size, uncomp_crc32, method, 0, dos_time, dos_date, local_dir_header_ofs, ext_attributes)) + return MZ_FALSE; + + pZip->m_total_files++; + pZip->m_archive_size = cur_archive_file_ofs; + + return MZ_TRUE; +} +#endif // #ifndef MINIZ_NO_STDIO + +mz_bool mz_zip_writer_add_from_zip_reader(mz_zip_archive *pZip, mz_zip_archive *pSource_zip, mz_uint file_index) +{ + mz_uint n, bit_flags, num_alignment_padding_bytes; + mz_uint64 comp_bytes_remaining, local_dir_header_ofs; + mz_uint64 cur_src_file_ofs, cur_dst_file_ofs; + mz_uint32 local_header_u32[(MZ_ZIP_LOCAL_DIR_HEADER_SIZE + sizeof(mz_uint32) - 1) / sizeof(mz_uint32)]; mz_uint8 *pLocal_header = (mz_uint8 *)local_header_u32; + mz_uint8 central_header[MZ_ZIP_CENTRAL_DIR_HEADER_SIZE]; + size_t orig_central_dir_size; + mz_zip_internal_state *pState; + void *pBuf; const mz_uint8 *pSrc_central_header; + + if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING)) + return MZ_FALSE; + if (NULL == (pSrc_central_header = mz_zip_reader_get_cdh(pSource_zip, file_index))) + return MZ_FALSE; + pState = pZip->m_pState; + + num_alignment_padding_bytes = mz_zip_writer_compute_padding_needed_for_file_alignment(pZip); + + // no zip64 support yet + if ((pZip->m_total_files == 0xFFFF) || ((pZip->m_archive_size + num_alignment_padding_bytes + MZ_ZIP_LOCAL_DIR_HEADER_SIZE + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE) > 0xFFFFFFFF)) + return MZ_FALSE; + + cur_src_file_ofs = MZ_READ_LE32(pSrc_central_header + MZ_ZIP_CDH_LOCAL_HEADER_OFS); + cur_dst_file_ofs = pZip->m_archive_size; + + if (pSource_zip->m_pRead(pSource_zip->m_pIO_opaque, cur_src_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE) + return MZ_FALSE; + if (MZ_READ_LE32(pLocal_header) != MZ_ZIP_LOCAL_DIR_HEADER_SIG) + return MZ_FALSE; + cur_src_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE; + + if (!mz_zip_writer_write_zeros(pZip, cur_dst_file_ofs, num_alignment_padding_bytes)) + return MZ_FALSE; + cur_dst_file_ofs += num_alignment_padding_bytes; + local_dir_header_ofs = cur_dst_file_ofs; + if (pZip->m_file_offset_alignment) { MZ_ASSERT((local_dir_header_ofs & (pZip->m_file_offset_alignment - 1)) == 0); } + + if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_dst_file_ofs, pLocal_header, MZ_ZIP_LOCAL_DIR_HEADER_SIZE) != MZ_ZIP_LOCAL_DIR_HEADER_SIZE) + return MZ_FALSE; + cur_dst_file_ofs += MZ_ZIP_LOCAL_DIR_HEADER_SIZE; + + n = MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_FILENAME_LEN_OFS) + MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_EXTRA_LEN_OFS); + comp_bytes_remaining = n + MZ_READ_LE32(pSrc_central_header + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS); + + if (NULL == (pBuf = pZip->m_pAlloc(pZip->m_pAlloc_opaque, 1, (size_t)MZ_MAX(sizeof(mz_uint32) * 4, MZ_MIN(MZ_ZIP_MAX_IO_BUF_SIZE, comp_bytes_remaining))))) + return MZ_FALSE; + + while (comp_bytes_remaining) + { + n = (mz_uint)MZ_MIN(MZ_ZIP_MAX_IO_BUF_SIZE, comp_bytes_remaining); + if (pSource_zip->m_pRead(pSource_zip->m_pIO_opaque, cur_src_file_ofs, pBuf, n) != n) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf); + return MZ_FALSE; + } + cur_src_file_ofs += n; + + if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_dst_file_ofs, pBuf, n) != n) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf); + return MZ_FALSE; + } + cur_dst_file_ofs += n; + + comp_bytes_remaining -= n; + } + + bit_flags = MZ_READ_LE16(pLocal_header + MZ_ZIP_LDH_BIT_FLAG_OFS); + if (bit_flags & 8) + { + // Copy data descriptor + if (pSource_zip->m_pRead(pSource_zip->m_pIO_opaque, cur_src_file_ofs, pBuf, sizeof(mz_uint32) * 4) != sizeof(mz_uint32) * 4) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf); + return MZ_FALSE; + } + + n = sizeof(mz_uint32) * ((MZ_READ_LE32(pBuf) == 0x08074b50) ? 4 : 3); + if (pZip->m_pWrite(pZip->m_pIO_opaque, cur_dst_file_ofs, pBuf, n) != n) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf); + return MZ_FALSE; + } + + cur_src_file_ofs += n; + cur_dst_file_ofs += n; + } + pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf); + + // no zip64 support yet + if (cur_dst_file_ofs > 0xFFFFFFFF) + return MZ_FALSE; + + orig_central_dir_size = pState->m_central_dir.m_size; + + memcpy(central_header, pSrc_central_header, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE); + MZ_WRITE_LE32(central_header + MZ_ZIP_CDH_LOCAL_HEADER_OFS, local_dir_header_ofs); + if (!mz_zip_array_push_back(pZip, &pState->m_central_dir, central_header, MZ_ZIP_CENTRAL_DIR_HEADER_SIZE)) + return MZ_FALSE; + + n = MZ_READ_LE16(pSrc_central_header + MZ_ZIP_CDH_FILENAME_LEN_OFS) + MZ_READ_LE16(pSrc_central_header + MZ_ZIP_CDH_EXTRA_LEN_OFS) + MZ_READ_LE16(pSrc_central_header + MZ_ZIP_CDH_COMMENT_LEN_OFS); + if (!mz_zip_array_push_back(pZip, &pState->m_central_dir, pSrc_central_header + MZ_ZIP_CENTRAL_DIR_HEADER_SIZE, n)) + { + mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE); + return MZ_FALSE; + } + + if (pState->m_central_dir.m_size > 0xFFFFFFFF) + return MZ_FALSE; + n = (mz_uint32)pState->m_central_dir.m_size; + if (!mz_zip_array_push_back(pZip, &pState->m_central_dir_offsets, &n, 1)) + { + mz_zip_array_resize(pZip, &pState->m_central_dir, orig_central_dir_size, MZ_FALSE); + return MZ_FALSE; + } + + pZip->m_total_files++; + pZip->m_archive_size = cur_dst_file_ofs; + + return MZ_TRUE; +} + +mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip) +{ + mz_zip_internal_state *pState; + mz_uint64 central_dir_ofs, central_dir_size; + mz_uint8 hdr[MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE]; + + if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING)) + return MZ_FALSE; + + pState = pZip->m_pState; + + // no zip64 support yet + if ((pZip->m_total_files > 0xFFFF) || ((pZip->m_archive_size + pState->m_central_dir.m_size + MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIZE) > 0xFFFFFFFF)) + return MZ_FALSE; + + central_dir_ofs = 0; + central_dir_size = 0; + if (pZip->m_total_files) + { + // Write central directory + central_dir_ofs = pZip->m_archive_size; + central_dir_size = pState->m_central_dir.m_size; + pZip->m_central_directory_file_ofs = central_dir_ofs; + if (pZip->m_pWrite(pZip->m_pIO_opaque, central_dir_ofs, pState->m_central_dir.m_p, (size_t)central_dir_size) != central_dir_size) + return MZ_FALSE; + pZip->m_archive_size += central_dir_size; + } + + // Write end of central directory record + MZ_CLEAR_OBJ(hdr); + MZ_WRITE_LE32(hdr + MZ_ZIP_ECDH_SIG_OFS, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG); + MZ_WRITE_LE16(hdr + MZ_ZIP_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS, pZip->m_total_files); + MZ_WRITE_LE16(hdr + MZ_ZIP_ECDH_CDIR_TOTAL_ENTRIES_OFS, pZip->m_total_files); + MZ_WRITE_LE32(hdr + MZ_ZIP_ECDH_CDIR_SIZE_OFS, central_dir_size); + MZ_WRITE_LE32(hdr + MZ_ZIP_ECDH_CDIR_OFS_OFS, central_dir_ofs); + + if (pZip->m_pWrite(pZip->m_pIO_opaque, pZip->m_archive_size, hdr, sizeof(hdr)) != sizeof(hdr)) + return MZ_FALSE; +#ifndef MINIZ_NO_STDIO + if ((pState->m_pFile) && (MZ_FFLUSH(pState->m_pFile) == EOF)) + return MZ_FALSE; +#endif // #ifndef MINIZ_NO_STDIO + + pZip->m_archive_size += sizeof(hdr); + + pZip->m_zip_mode = MZ_ZIP_MODE_WRITING_HAS_BEEN_FINALIZED; + return MZ_TRUE; +} + +mz_bool mz_zip_writer_finalize_heap_archive(mz_zip_archive *pZip, void **pBuf, size_t *pSize) +{ + if ((!pZip) || (!pZip->m_pState) || (!pBuf) || (!pSize)) + return MZ_FALSE; + if (pZip->m_pWrite != mz_zip_heap_write_func) + return MZ_FALSE; + if (!mz_zip_writer_finalize_archive(pZip)) + return MZ_FALSE; + + *pBuf = pZip->m_pState->m_pMem; + *pSize = pZip->m_pState->m_mem_size; + pZip->m_pState->m_pMem = NULL; + pZip->m_pState->m_mem_size = pZip->m_pState->m_mem_capacity = 0; + return MZ_TRUE; +} + +mz_bool mz_zip_writer_end(mz_zip_archive *pZip) +{ + mz_zip_internal_state *pState; + mz_bool status = MZ_TRUE; + if ((!pZip) || (!pZip->m_pState) || (!pZip->m_pAlloc) || (!pZip->m_pFree) || ((pZip->m_zip_mode != MZ_ZIP_MODE_WRITING) && (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING_HAS_BEEN_FINALIZED))) + return MZ_FALSE; + + pState = pZip->m_pState; + pZip->m_pState = NULL; + mz_zip_array_clear(pZip, &pState->m_central_dir); + mz_zip_array_clear(pZip, &pState->m_central_dir_offsets); + mz_zip_array_clear(pZip, &pState->m_sorted_central_dir_offsets); + +#ifndef MINIZ_NO_STDIO + if (pState->m_pFile) + { + MZ_FCLOSE(pState->m_pFile); + pState->m_pFile = NULL; + } +#endif // #ifndef MINIZ_NO_STDIO + + if ((pZip->m_pWrite == mz_zip_heap_write_func) && (pState->m_pMem)) + { + pZip->m_pFree(pZip->m_pAlloc_opaque, pState->m_pMem); + pState->m_pMem = NULL; + } + + pZip->m_pFree(pZip->m_pAlloc_opaque, pState); + pZip->m_zip_mode = MZ_ZIP_MODE_INVALID; + return status; +} + +#ifndef MINIZ_NO_STDIO +mz_bool mz_zip_add_mem_to_archive_file_in_place(const char *pZip_filename, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags) +{ + mz_bool status, created_new_archive = MZ_FALSE; + mz_zip_archive zip_archive; + struct MZ_FILE_STAT_STRUCT file_stat; + MZ_CLEAR_OBJ(zip_archive); + if ((int)level_and_flags < 0) + level_and_flags = MZ_DEFAULT_LEVEL; + if ((!pZip_filename) || (!pArchive_name) || ((buf_size) && (!pBuf)) || ((comment_size) && (!pComment)) || ((level_and_flags & 0xF) > MZ_UBER_COMPRESSION)) + return MZ_FALSE; + if (!mz_zip_writer_validate_archive_name(pArchive_name)) + return MZ_FALSE; + if (MZ_FILE_STAT(pZip_filename, &file_stat) != 0) + { + // Create a new archive. + if (!mz_zip_writer_init_file(&zip_archive, pZip_filename, 0)) + return MZ_FALSE; + created_new_archive = MZ_TRUE; + } + else + { + // Append to an existing archive. + if (!mz_zip_reader_init_file(&zip_archive, pZip_filename, level_and_flags | MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY)) + return MZ_FALSE; + if (!mz_zip_writer_init_from_reader(&zip_archive, pZip_filename)) + { + mz_zip_reader_end(&zip_archive); + return MZ_FALSE; + } + } + status = mz_zip_writer_add_mem_ex(&zip_archive, pArchive_name, pBuf, buf_size, pComment, comment_size, level_and_flags, 0, 0); + // Always finalize, even if adding failed for some reason, so we have a valid central directory. (This may not always succeed, but we can try.) + if (!mz_zip_writer_finalize_archive(&zip_archive)) + status = MZ_FALSE; + if (!mz_zip_writer_end(&zip_archive)) + status = MZ_FALSE; + if ((!status) && (created_new_archive)) + { + // It's a new archive and something went wrong, so just delete it. + int ignoredStatus = MZ_DELETE_FILE(pZip_filename); + (void)ignoredStatus; + } + return status; +} + +void *mz_zip_extract_archive_file_to_heap(const char *pZip_filename, const char *pArchive_name, size_t *pSize, mz_uint flags) +{ + int file_index; + mz_zip_archive zip_archive; + void *p = NULL; + + if (pSize) + *pSize = 0; + + if ((!pZip_filename) || (!pArchive_name)) + return NULL; + + MZ_CLEAR_OBJ(zip_archive); + if (!mz_zip_reader_init_file(&zip_archive, pZip_filename, flags | MZ_ZIP_FLAG_DO_NOT_SORT_CENTRAL_DIRECTORY)) + return NULL; + + if ((file_index = mz_zip_reader_locate_file(&zip_archive, pArchive_name, NULL, flags)) >= 0) + p = mz_zip_reader_extract_to_heap(&zip_archive, file_index, pSize, flags); + + mz_zip_reader_end(&zip_archive); + return p; +} + +#endif // #ifndef MINIZ_NO_STDIO + +#endif // #ifndef MINIZ_NO_ARCHIVE_WRITING_APIS + +#endif // #ifndef MINIZ_NO_ARCHIVE_APIS + +#ifdef __cplusplus +} +#endif + +#endif // MINIZ_HEADER_FILE_ONLY + +/* + This is free and unencumbered software released into the public domain. + + Anyone is free to copy, modify, publish, use, compile, sell, or + distribute this software, either in source code form or as a compiled + binary, for any purpose, commercial or non-commercial, and by any + means. + + In jurisdictions that recognize copyright laws, the author or authors + of this software dedicate any and all copyright interest in the + software to the public domain. We make this dedication for the benefit + of the public at large and to the detriment of our heirs and + successors. We intend this dedication to be an overt act of + relinquishment in perpetuity of all present and future rights to this + software under copyright law. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. + IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR + OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, + ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR + OTHER DEALINGS IN THE SOFTWARE. + + For more information, please refer to +*/ diff --git a/ExternalLibs/ttvfs_zip/miniz.h b/ExternalLibs/ttvfs_zip/miniz.h new file mode 100644 index 0000000..9e25402 --- /dev/null +++ b/ExternalLibs/ttvfs_zip/miniz.h @@ -0,0 +1,7 @@ +#ifndef MINIZ_H +#define MINIZ_H + +#define MINIZ_HEADER_FILE_ONLY +#include "miniz.c" + +#endif