1 /* zutil.c -- target dependent utility functions for the compression library
2  * Copyright (C) 1995-2005 Jean-loup Gailly.
3  * For conditions of distribution and use, see copyright notice in zlib.h
4  */
5 
6 /* @(#) $Id: zutil.c,v 1.1 2007/06/07 17:54:37 jules_rms Exp $ */
7 
8 #include "zutil.h"
9 
10 #ifndef NO_DUMMY_DECL
11 struct internal_state      {int dummy;}; /* for buggy compilers */
12 #endif
13 
14 const char * const z_errmsg[10] = {
15 "need dictionary",     /* Z_NEED_DICT       2  */
16 "stream end",          /* Z_STREAM_END      1  */
17 "",                    /* Z_OK              0  */
18 "file error",          /* Z_ERRNO         (-1) */
19 "stream error",        /* Z_STREAM_ERROR  (-2) */
20 "data error",          /* Z_DATA_ERROR    (-3) */
21 "insufficient memory", /* Z_MEM_ERROR     (-4) */
22 "buffer error",        /* Z_BUF_ERROR     (-5) */
23 "incompatible version",/* Z_VERSION_ERROR (-6) */
24 ""};
25 
26 
27 /*const char * ZEXPORT zlibVersion()
28 {
29     return ZLIB_VERSION;
30 }
31 
32 uLong ZEXPORT zlibCompileFlags()
33 {
34     uLong flags;
35 
36     flags = 0;
37     switch (sizeof(uInt)) {
38     case 2:     break;
39     case 4:     flags += 1;     break;
40     case 8:     flags += 2;     break;
41     default:    flags += 3;
42     }
43     switch (sizeof(uLong)) {
44     case 2:     break;
45     case 4:     flags += 1 << 2;        break;
46     case 8:     flags += 2 << 2;        break;
47     default:    flags += 3 << 2;
48     }
49     switch (sizeof(voidpf)) {
50     case 2:     break;
51     case 4:     flags += 1 << 4;        break;
52     case 8:     flags += 2 << 4;        break;
53     default:    flags += 3 << 4;
54     }
55     switch (sizeof(z_off_t)) {
56     case 2:     break;
57     case 4:     flags += 1 << 6;        break;
58     case 8:     flags += 2 << 6;        break;
59     default:    flags += 3 << 6;
60     }
61 #ifdef DEBUG
62     flags += 1 << 8;
63 #endif
64 #if defined(ASMV) || defined(ASMINF)
65     flags += 1 << 9;
66 #endif
67 #ifdef ZLIB_WINAPI
68     flags += 1 << 10;
69 #endif
70 #ifdef BUILDFIXED
71     flags += 1 << 12;
72 #endif
73 #ifdef DYNAMIC_CRC_TABLE
74     flags += 1 << 13;
75 #endif
76 #ifdef NO_GZCOMPRESS
77     flags += 1L << 16;
78 #endif
79 #ifdef NO_GZIP
80     flags += 1L << 17;
81 #endif
82 #ifdef PKZIP_BUG_WORKAROUND
83     flags += 1L << 20;
84 #endif
85 #ifdef FASTEST
86     flags += 1L << 21;
87 #endif
88 #ifdef STDC
89 #  ifdef NO_vsnprintf
90         flags += 1L << 25;
91 #    ifdef HAS_vsprintf_void
92         flags += 1L << 26;
93 #    endif
94 #  else
95 #    ifdef HAS_vsnprintf_void
96         flags += 1L << 26;
97 #    endif
98 #  endif
99 #else
100         flags += 1L << 24;
101 #  ifdef NO_snprintf
102         flags += 1L << 25;
103 #    ifdef HAS_sprintf_void
104         flags += 1L << 26;
105 #    endif
106 #  else
107 #    ifdef HAS_snprintf_void
108         flags += 1L << 26;
109 #    endif
110 #  endif
111 #endif
112     return flags;
113 }*/
114 
115 #if 0
116 
117 #  ifndef verbose
118 #    define verbose 0
119 #  endif
120 int z_verbose = verbose;
121 
122 void z_error (const char *m)
123 {
124     fprintf(stderr, "%s\n", m);
125     exit(1);
126 }
127 #endif
128 
129 /* exported to allow conversion of error code to string for compress() and
130  * uncompress()
131  */
zError(int err)132 const char * ZEXPORT zError(int err)
133 {
134     return ERR_MSG(err);
135 }
136 
137 #if defined(_WIN32_WCE)
138     /* The Microsoft C Run-Time Library for Windows CE doesn't have
139      * errno.  We define it as a global variable to simplify porting.
140      * Its value is always 0 and should not be used.
141      */
142     int errno = 0;
143 #endif
144 
145 #ifndef HAVE_MEMCPY
146 
zmemcpy(dest,source,len)147 void zmemcpy(dest, source, len)
148     Bytef* dest;
149     const Bytef* source;
150     uInt  len;
151 {
152     if (len == 0) return;
153     do {
154         *dest++ = *source++; /* ??? to be unrolled */
155     } while (--len != 0);
156 }
157 
zmemcmp(s1,s2,len)158 int zmemcmp(s1, s2, len)
159     const Bytef* s1;
160     const Bytef* s2;
161     uInt  len;
162 {
163     uInt j;
164 
165     for (j = 0; j < len; j++) {
166         if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1;
167     }
168     return 0;
169 }
170 
zmemzero(dest,len)171 void zmemzero(dest, len)
172     Bytef* dest;
173     uInt  len;
174 {
175     if (len == 0) return;
176     do {
177         *dest++ = 0;  /* ??? to be unrolled */
178     } while (--len != 0);
179 }
180 #endif
181 
182 
183 #ifdef SYS16BIT
184 
185 #ifdef __TURBOC__
186 /* Turbo C in 16-bit mode */
187 
188 #  define MY_ZCALLOC
189 
190 /* Turbo C malloc() does not allow dynamic allocation of 64K bytes
191  * and farmalloc(64K) returns a pointer with an offset of 8, so we
192  * must fix the pointer. Warning: the pointer must be put back to its
193  * original form in order to free it, use zcfree().
194  */
195 
196 #define MAX_PTR 10
197 /* 10*64K = 640K */
198 
199 local int next_ptr = 0;
200 
201 typedef struct ptr_table_s {
202     voidpf org_ptr;
203     voidpf new_ptr;
204 } ptr_table;
205 
206 local ptr_table table[MAX_PTR];
207 /* This table is used to remember the original form of pointers
208  * to large buffers (64K). Such pointers are normalized with a zero offset.
209  * Since MSDOS is not a preemptive multitasking OS, this table is not
210  * protected from concurrent access. This hack doesn't work anyway on
211  * a protected system like OS/2. Use Microsoft C instead.
212  */
213 
zcalloc(voidpf opaque,unsigned items,unsigned size)214 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
215 {
216     voidpf buf = opaque; /* just to make some compilers happy */
217     ulg bsize = (ulg)items*size;
218 
219     /* If we allocate less than 65520 bytes, we assume that farmalloc
220      * will return a usable pointer which doesn't have to be normalized.
221      */
222     if (bsize < 65520L) {
223         buf = farmalloc(bsize);
224         if (*(ush*)&buf != 0) return buf;
225     } else {
226         buf = farmalloc(bsize + 16L);
227     }
228     if (buf == NULL || next_ptr >= MAX_PTR) return NULL;
229     table[next_ptr].org_ptr = buf;
230 
231     /* Normalize the pointer to seg:0 */
232     *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
233     *(ush*)&buf = 0;
234     table[next_ptr++].new_ptr = buf;
235     return buf;
236 }
237 
zcfree(voidpf opaque,voidpf ptr)238 void  zcfree (voidpf opaque, voidpf ptr)
239 {
240     int n;
241     if (*(ush*)&ptr != 0) { /* object < 64K */
242         farfree(ptr);
243         return;
244     }
245     /* Find the original pointer */
246     for (n = 0; n < next_ptr; n++) {
247         if (ptr != table[n].new_ptr) continue;
248 
249         farfree(table[n].org_ptr);
250         while (++n < next_ptr) {
251             table[n-1] = table[n];
252         }
253         next_ptr--;
254         return;
255     }
256     ptr = opaque; /* just to make some compilers happy */
257     Assert(0, "zcfree: ptr not found");
258 }
259 
260 #endif /* __TURBOC__ */
261 
262 
263 #ifdef M_I86
264 /* Microsoft C in 16-bit mode */
265 
266 #  define MY_ZCALLOC
267 
268 #if (!defined(_MSC_VER) || (_MSC_VER <= 600))
269 #  define _halloc  halloc
270 #  define _hfree   hfree
271 #endif
272 
zcalloc(voidpf opaque,unsigned items,unsigned size)273 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
274 {
275     if (opaque) opaque = 0; /* to make compiler happy */
276     return _halloc((long)items, size);
277 }
278 
zcfree(voidpf opaque,voidpf ptr)279 void  zcfree (voidpf opaque, voidpf ptr)
280 {
281     if (opaque) opaque = 0; /* to make compiler happy */
282     _hfree(ptr);
283 }
284 
285 #endif /* M_I86 */
286 
287 #endif /* SYS16BIT */
288 
289 
290 #ifndef MY_ZCALLOC /* Any system without a special alloc function */
291 
292 #ifndef STDC
293 extern voidp  malloc OF((uInt size));
294 extern voidp  calloc OF((uInt items, uInt size));
295 extern void   free   OF((voidpf ptr));
296 #endif
297 
zcalloc(voidpf opaque,unsigned items,unsigned size)298 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
299 {
300     if (opaque) items += size - size; /* make compiler happy */
301     return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
302                               (voidpf)calloc(items, size);
303 }
304 
zcfree(voidpf opaque,voidpf ptr)305 void  zcfree (voidpf opaque, voidpf ptr)
306 {
307     free(ptr);
308     if (opaque) return; /* make compiler happy */
309 }
310 
311 #endif /* MY_ZCALLOC */
312