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