1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/compressionlibs/ziplib/test/oldezlib/EZLib/zutil.cpp Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,233 @@
1.4 +/* zutil.c -- target dependent utility functions for the compression library
1.5 + * Copyright (C) 1995-1998 Jean-loup Gailly.
1.6 + * For conditions of distribution and use, see copyright notice in zlib.h
1.7 + */
1.8 +
1.9 +/* @(#) $Id$ */
1.10 +
1.11 +#include <e32base.h>
1.12 +#include "zutil.h"
1.13 +
1.14 +
1.15 +struct internal_state {int dummy;}; /* for buggy compilers */
1.16 +
1.17 +#ifndef STDC
1.18 +extern void exit OF((int));
1.19 +#endif
1.20 +
1.21 +const char * const z_errmsg[10] = {
1.22 +"need dictionary", /* Z_NEED_DICT 2 */
1.23 +"stream end", /* Z_STREAM_END 1 */
1.24 +"", /* Z_OK 0 */
1.25 +"file error", /* Z_ERRNO (-1) */
1.26 +"stream error", /* Z_STREAM_ERROR (-2) */
1.27 +"data error", /* Z_DATA_ERROR (-3) */
1.28 +"insufficient memory", /* Z_MEM_ERROR (-4) */
1.29 +"buffer error", /* Z_BUF_ERROR (-5) */
1.30 +"incompatible version",/* Z_VERSION_ERROR (-6) */
1.31 +""};
1.32 +
1.33 +
1.34 +EXPORT_C const char * ZEXPORT zlibVersion()
1.35 +{
1.36 + return ZLIB_VERSION;
1.37 +}
1.38 +
1.39 +#ifdef DEBUG
1.40 +
1.41 +# ifndef verbose
1.42 +# define verbose 0
1.43 +# endif
1.44 +const int z_verbose = verbose;
1.45 +
1.46 +void z_error (m)
1.47 + char *m;
1.48 +{
1.49 + fprintf(stderr, "%s\n", m);
1.50 + exit(1);
1.51 +}
1.52 +#endif
1.53 +
1.54 +/* exported to allow conversion of error code to string for compress() and
1.55 + * uncompress()
1.56 + */
1.57 +EXPORT_C const char * ZEXPORT zError(
1.58 + int err)
1.59 +{
1.60 + return ERR_MSG(err);
1.61 +}
1.62 +
1.63 +
1.64 +#ifndef HAVE_MEMCPY
1.65 +
1.66 +void zmemcpy(dest, source, len)
1.67 + Bytef* dest;
1.68 + const Bytef* source;
1.69 + uInt len;
1.70 +{
1.71 + if (len == 0) return;
1.72 + do {
1.73 + *dest++ = *source++; /* ??? to be unrolled */
1.74 + } while (--len != 0);
1.75 +}
1.76 +
1.77 +int zmemcmp(s1, s2, len)
1.78 + const Bytef* s1;
1.79 + const Bytef* s2;
1.80 + uInt len;
1.81 +{
1.82 + uInt j;
1.83 +
1.84 + for (j = 0; j < len; j++) {
1.85 + if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1;
1.86 + }
1.87 + return 0;
1.88 +}
1.89 +
1.90 +void zmemzero(dest, len)
1.91 + Bytef* dest;
1.92 + uInt len;
1.93 +{
1.94 + if (len == 0) return;
1.95 + do {
1.96 + *dest++ = 0; /* ??? to be unrolled */
1.97 + } while (--len != 0);
1.98 +}
1.99 +#endif
1.100 +
1.101 +#ifdef __TURBOC__
1.102 +#if (defined( __BORLANDC__) || !defined(SMALL_MEDIUM)) && !defined(__32BIT__)
1.103 +/* Small and medium model in Turbo C are for now limited to near allocation
1.104 + * with reduced MAX_WBITS and MAX_MEM_LEVEL
1.105 + */
1.106 +# define MY_ZCALLOC
1.107 +
1.108 +/* Turbo C malloc() does not allow dynamic allocation of 64K bytes
1.109 + * and farmalloc(64K) returns a pointer with an offset of 8, so we
1.110 + * must fix the pointer. Warning: the pointer must be put back to its
1.111 + * original form in order to free it, use zcfree().
1.112 + */
1.113 +
1.114 +#define MAX_PTR 10
1.115 +/* 10*64K = 640K */
1.116 +
1.117 +local int next_ptr = 0;
1.118 +
1.119 +typedef struct ptr_table_s {
1.120 + voidpf org_ptr;
1.121 + voidpf new_ptr;
1.122 +} ptr_table;
1.123 +
1.124 +const local ptr_table table[MAX_PTR];
1.125 +/* This table is used to remember the original form of pointers
1.126 + * to large buffers (64K). Such pointers are normalized with a zero offset.
1.127 + * Since MSDOS is not a preemptive multitasking OS, this table is not
1.128 + * protected from concurrent access. This hack doesn't work anyway on
1.129 + * a protected system like OS/2. Use Microsoft C instead.
1.130 + */
1.131 +
1.132 +voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
1.133 +{
1.134 + voidpf buf = opaque; /* just to make some compilers happy */
1.135 + ulg bsize = (ulg)items*size;
1.136 +
1.137 + /* If we allocate less than 65520 bytes, we assume that farmalloc
1.138 + * will return a usable pointer which doesn't have to be normalized.
1.139 + */
1.140 + if (bsize < 65520L) {
1.141 + buf = farmalloc(bsize);
1.142 + if (*(ush*)&buf != 0) return buf;
1.143 + } else {
1.144 + buf = farmalloc(bsize + 16L);
1.145 + }
1.146 + if (buf == NULL || next_ptr >= MAX_PTR) return NULL;
1.147 + table[next_ptr].org_ptr = buf;
1.148 +
1.149 + /* Normalize the pointer to seg:0 */
1.150 + *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
1.151 + *(ush*)&buf = 0;
1.152 + table[next_ptr++].new_ptr = buf;
1.153 + return buf;
1.154 +}
1.155 +
1.156 +void zcfree (voidpf opaque, voidpf ptr)
1.157 +{
1.158 + int n;
1.159 + if (*(ush*)&ptr != 0) { /* object < 64K */
1.160 + farfree(ptr);
1.161 + return;
1.162 + }
1.163 + /* Find the original pointer */
1.164 + for (n = 0; n < next_ptr; n++) {
1.165 + if (ptr != table[n].new_ptr) continue;
1.166 +
1.167 + farfree(table[n].org_ptr);
1.168 + while (++n < next_ptr) {
1.169 + table[n-1] = table[n];
1.170 + }
1.171 + next_ptr--;
1.172 + return;
1.173 + }
1.174 + ptr = opaque; /* just to make some compilers happy */
1.175 + Assert(0, "zcfree: ptr not found");
1.176 +}
1.177 +#endif
1.178 +#endif /* __TURBOC__ */
1.179 +
1.180 +
1.181 +#if defined(M_I86) && !defined(__32BIT__)
1.182 +/* Microsoft C in 16-bit mode */
1.183 +
1.184 +# define MY_ZCALLOC
1.185 +
1.186 +#if (!defined(_MSC_VER) || (_MSC_VER <= 600))
1.187 +# define _halloc halloc
1.188 +# define _hfree hfree
1.189 +#endif
1.190 +
1.191 +voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
1.192 +{
1.193 + if (opaque) opaque = 0; /* to make compiler happy */
1.194 + return _halloc((long)items, size);
1.195 +}
1.196 +
1.197 +void zcfree (voidpf opaque, voidpf ptr)
1.198 +{
1.199 + if (opaque) opaque = 0; /* to make compiler happy */
1.200 + _hfree(ptr);
1.201 +}
1.202 +
1.203 +#endif /* MSC */
1.204 +
1.205 +
1.206 +#ifndef MY_ZCALLOC /* Any system without a special alloc function */
1.207 +
1.208 +#ifndef STDC
1.209 +extern voidp calloc OF((uInt items, uInt size));
1.210 +extern void free OF((voidpf ptr));
1.211 +#endif
1.212 +
1.213 +voidpf zcalloc (
1.214 + voidpf opaque,
1.215 + unsigned items,
1.216 + unsigned size)
1.217 +{
1.218 + if (opaque) items += size - size; /* make compiler happy */
1.219 +// return (voidpf)calloc(items, size);
1.220 + TInt bytes = items*size;
1.221 + TAny *ptr = User::Alloc(bytes);
1.222 + if (ptr)
1.223 + Mem::FillZ(ptr,bytes);
1.224 + return (voidpf) ptr; // Mark Ryan, Symbian 14/9/99
1.225 +}
1.226 +
1.227 +void zcfree (
1.228 + voidpf opaque,
1.229 + voidpf ptr)
1.230 +{
1.231 + //free(ptr);
1.232 + User::Free(ptr); // Mark Ryan, Symbian 14/9/99
1.233 + if (opaque) return; /* make compiler happy */
1.234 +}
1.235 +
1.236 +#endif /* MY_ZCALLOC */