![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to util.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [MW Coherent from dump] / coherent / g / usr / bin / gzip|
Return to util.c CVS log | Up to [MW Coherent from dump] / coherent / g / usr / bin / gzip |
1.1 root 1: /* util.c -- utility functions for gzip support
2: * Copyright (C) 1992-1993 Jean-loup Gailly
3: * This is free software; you can redistribute it and/or modify it under the
4: * terms of the GNU General Public License, see the file COPYING.
5: */
6:
7: #ifndef lint
8: static char rcsid[] = "$Id: util.c,v 0.11 1993/02/24 18:23:13 jloup Exp $";
9: #endif
10:
11: #include "tailor.h"
12: #include "gzip.h"
13: #include "crypt.h"
14:
15: #include <stdio.h>
16: #include <ctype.h>
17: #include <errno.h>
18:
19: #ifdef HAVE_UNISTD_H
20: # include <sys/types.h>
21: # include <unistd.h>
22: #endif
23:
24: #if defined(STDC_HEADERS) || !defined(NO_STDLIB_H)
25: # include <stdlib.h>
26: #else
27: extern int errno;
28: #endif
29:
30: extern ulg crc_32_tab[]; /* crc table, defined below */
31:
32: /* ===========================================================================
33: * Run a set of bytes through the crc shift register. If s is a NULL
34: * pointer, then initialize the crc shift register contents instead.
35: * Return the current crc in either case.
36: */
37: ulg updcrc(s, n)
38: uch *s; /* pointer to bytes to pump through */
39: unsigned n; /* number of bytes in s[] */
40: {
41: register ulg c; /* temporary variable */
42:
43: static ulg crc = (ulg)0xffffffffL; /* shift register contents */
44:
45: if (s == NULL) {
46: c = 0xffffffffL;
47: } else {
48: c = crc;
49: while (n--) {
50: c = crc_32_tab[((int)c ^ (*s++)) & 0xff] ^ (c >> 8);
51: }
52: }
53: crc = c;
54: return c ^ 0xffffffffL; /* (instead of ~c for 64-bit machines) */
55: }
56:
57: /* ===========================================================================
58: * Clear input and output buffers
59: */
60: void clear_bufs()
61: {
62: outcnt = 0;
63: insize = inptr = 0;
64: bytes_in = bytes_out = 0L;
65: }
66:
67: /* ===========================================================================
68: * Fill the input buffer. This is called only when the buffer is empty
69: * and at least one byte is really needed.
70: */
71: int fill_inbuf()
72: {
73: int len;
74:
75: /* Read as much as possible */
76: insize = 0;
77: do {
78: len = read(ifd, inbuf+insize, INBUFSIZ-insize);
79: if (len == 0 || len == EOF) break;
80: insize += len;
81: } while (insize < INBUFSIZ);
82:
83: if (insize == 0) {
84: read_error();
85: }
86: bytes_in += (ulg)insize;
87: inptr = 1;
88: return inbuf[0];
89: }
90:
91: /* ===========================================================================
92: * Write the output buffer outbuf[0..outcnt-1] and update bytes_out.
93: * (used for the compressed data only)
94: */
95: void flush_outbuf()
96: {
97: if (outcnt == 0) return;
98:
99: if (write(ofd, (char *)outbuf, outcnt) != outcnt) {
100: write_error();
101: }
102: bytes_out += (ulg)outcnt;
103: outcnt = 0;
104: }
105:
106: /* ===========================================================================
107: * Write the output window window[0..outcnt-1] and update crc and bytes_out.
108: * (Used for the decompressed data only.)
109: */
110: void flush_window()
111: {
112: if (outcnt == 0) return;
113: updcrc(window, outcnt);
114:
115: if (!test && write(ofd, (char *)window, outcnt) != outcnt) {
116: write_error();
117: }
118: bytes_out += (ulg)outcnt;
119: outcnt = 0;
120: }
121:
122:
123: /* ======================================================================== */
124: char *strlwr(s)
125: /* put string s in lower case, return s */
126: char *s;
127: {
128: char *t;
129: for (t = s; *t; t++) *t = tolow(*t);
130: return s;
131: }
132:
133: /* ========================================================================
134: * Return the base name of a file (remove any directory prefix and
135: * any version suffix). For systems with filenames that are not
136: * case sensitive, force the base name to lower case.
137: */
138: char *basename(fname)
139: char *fname;
140: {
141: char *p;
142:
143: if ((p = strrchr(fname, PATH_SEP)) != NULL) fname = p+1;
144: #ifdef PATH_SEP2
145: if ((p = strrchr(fname, PATH_SEP2)) != NULL) fname = p+1;
146: #endif
147: #ifdef PATH_SEP3
148: if ((p = strrchr(fname, PATH_SEP3)) != NULL) fname = p+1;
149: #endif
150: #ifdef SUFFIX_SEP
151: if ((p = strrchr(fname, SUFFIX_SEP)) != NULL) *p = '\0';
152: #endif
153: if (casemap('A') == 'a') strlwr(fname);
154: return fname;
155: }
156:
157: /* ========================================================================
158: * Add an environment variable (if any) before argv, and update argc.
159: * Return the expanded environment variable to be freed later, or NULL
160: * if no options were added to argv.
161: */
162: #define SEPARATOR " \t" /* separators in env variable */
163:
164: char *add_envopt(argcp, argvp, env)
165: int *argcp; /* pointer to argc */
166: char ***argvp; /* pointer to argv */
167: char *env; /* name of environment variable */
168: {
169: char *p; /* running pointer through env variable */
170: char **oargv; /* runs through old argv array */
171: char **nargv; /* runs through new argv array */
172: int oargc = *argcp; /* old argc */
173: int nargc = 0; /* number of arguments in env variable */
174:
175: env = (char*)getenv(env);
176: if (env == NULL) return NULL;
177:
178: p = (char*)xmalloc(strlen(env)+1);
179: env = strcpy(p, env); /* keep env variable intact */
180:
181: for (p = env; *p; nargc++ ) { /* move through env */
182: p += strspn(p, SEPARATOR); /* skip leading separators */
183: if (*p == '\0') break;
184:
185: p += strcspn(p, SEPARATOR); /* find end of word */
186: if (*p) *p++ = '\0'; /* mark it */
187: }
188: if (nargc == 0) {
189: free(env); env = NULL;
190: return NULL;
191: }
192: *argcp += nargc;
193: /* Allocate the new argv array, with an extra element just in case
194: * the original arg list did not end with a NULL.
195: */
196: nargv = (char**)calloc(*argcp+1, sizeof(char *));
197: if (nargv == NULL) error("out of memory");
198: oargv = *argvp;
199: *argvp = nargv;
200:
201: /* Copy the program name first */
202: if (oargc-- < 0) error("argc<=0");
203: *(nargv++) = *(oargv++);
204:
205: /* Then copy the environment args */
206: for (p = env; nargc > 0; nargc--) {
207: p += strspn(p, SEPARATOR); /* skip separators */
208: *(nargv++) = p; /* store start */
209: while (*p++) ; /* skip over word */
210: }
211:
212: /* Finally copy the old args and add a NULL (usual convention) */
213: while (oargc--) *(nargv++) = *(oargv++);
214: *nargv = NULL;
215: return env;
216: }
217:
218: /* ========================================================================
219: * Error handlers.
220: */
221: void error(m)
222: char *m;
223: {
224: fprintf(stderr, "%s: %s\n", ifname, m);
225: abort_gzip();
226: }
227:
228: void warn(a, b)
229: char *a, *b; /* message strings juxtaposed in output */
230: {
231: WARN((stderr, " warning: %s%s\n", a, b));
232: }
233:
234: void read_error()
235: {
236: fprintf(stderr, "\nread error on ");
237: if (errno != 0) {
238: perror(ifname);
239: } else {
240: fprintf(stderr, "%s: unexpected end of file\n", ifname);
241: }
242: abort_gzip();
243: }
244:
245: void write_error()
246: {
247: fprintf(stderr, "\nwrite error on ");
248: perror(ofname);
249: abort_gzip();
250: }
251:
252: /* ========================================================================
253: * Display compression ratio on stderr.
254: */
255: void display_ratio(num, den)
256: long num;
257: long den;
258: {
259: long ratio; /* 1000 times the compression ratio */
260:
261: if (den == 0) {
262: ratio = 0; /* no compression */
263: } else if (den < 2147483L) { /* (2**31 -1)/1000 */
264: ratio = 1000L*num/den;
265: } else {
266: ratio = num/(den/1000L);
267: }
268: if (ratio < 0) {
269: putc('-', stderr);
270: ratio = -ratio;
271: }
272: fprintf(stderr, "%2ld.%ld%%", ratio / 10L, ratio % 10L);
273: }
274:
275:
276: /* ========================================================================
277: * Semi-safe malloc -- never returns NULL.
278: */
279: voidp xmalloc (size)
280: unsigned size;
281: {
282: voidp cp = (voidp)malloc (size);
283:
284: if (cp == NULL) error("out of memory");
285: return cp;
286: }
287:
288: /* ========================================================================
289: * Table of CRC-32's of all single-byte values (made by makecrc.c)
290: */
291: ulg crc_32_tab[] = {
292: 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
293: 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
294: 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
295: 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
296: 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
297: 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
298: 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
299: 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
300: 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
301: 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
302: 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
303: 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
304: 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
305: 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
306: 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
307: 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
308: 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
309: 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
310: 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
311: 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
312: 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
313: 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
314: 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
315: 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
316: 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
317: 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
318: 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
319: 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
320: 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
321: 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
322: 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
323: 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
324: 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
325: 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
326: 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
327: 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
328: 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
329: 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
330: 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
331: 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
332: 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
333: 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
334: 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
335: 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
336: 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
337: 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
338: 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
339: 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
340: 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
341: 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
342: 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
343: 0x2d02ef8dL
344: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.