![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to misc.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [MW Coherent from dump] / coherent / b / bin / unzip|
Return to misc.c CVS log | Up to [MW Coherent from dump] / coherent / b / bin / unzip |
1.1 root 1: /*---------------------------------------------------------------------------
2:
3: misc.c
4:
5: This file contains a number of useful but not particularly closely related
6: functions; their main claim to fame is that they don't change much, so this
7: file should rarely need to be recompiled. The CRC-32 stuff is from crc32.c;
8: do_string() is from nunzip.c; makeword() and makelong() are from unzip.c;
9: memset() and memcpy() are from zmemset.c and zmemcpy.c, respectively; and
10: dos_to_unix_time() is from set_file_time_and_close() in file_io.c. ebcdic[],
11: check_for_newer(), dateformat(), and return_VMS() are new. Things lumped
12: together here to cut down on the size of unzip.c and the number of associ-
13: ated files floating around.
14:
15: ---------------------------------------------------------------------------
16:
17: Copyrights: see accompanying file "COPYING" in UnZip source distribution.
18:
19: ---------------------------------------------------------------------------*/
20:
21:
22: #include "unzip.h"
23: #ifdef MSWIN
24: # include "wizunzip.h"
25: #endif
26:
27:
28:
29: #ifndef ZIPINFO /* no need to calculate CRCs */
30:
31: /**************************/
32: /* Function UpdateCRC() */
33: /**************************/
34:
35: /*--------------------------------------------------------------------
36:
37: First, the polynomial itself and its table of feedback terms. The
38: polynomial is
39: X^32+X^26+X^23+X^22+X^16+X^12+X^11+X^10+X^8+X^7+X^5+X^4+X^2+X^1+X^0
40:
41: Note that we take it "backwards" and put the highest-order term in
42: the lowest-order bit. The X^32 term is "implied"; the LSB is the
43: X^31 term, etc. The X^0 term (usually shown as "+1") results in
44: the MSB being 1.
45:
46: Note that the usual hardware shift register implementation, which
47: is what we're using (we're merely optimizing it by doing eight-bit
48: chunks at a time) shifts bits into the lowest-order term. In our
49: implementation, that means shifting towards the right. Why do we
50: do it this way? Because the calculated CRC must be transmitted in
51: order from highest-order term to lowest-order term. UARTs transmit
52: characters in order from LSB to MSB. By storing the CRC this way,
53: we hand it to the UART in the order low-byte to high-byte; the UART
54: sends each low-bit to hight-bit; and the result is transmission bit
55: by bit from highest- to lowest-order term without requiring any bit
56: shuffling on our part. Reception works similarly.
57:
58: The feedback terms table consists of 256, 32-bit entries. Notes:
59:
60: The table can be generated at runtime if desired; code to do so
61: is shown later. It might not be obvious, but the feedback
62: terms simply represent the results of eight shift/xor opera-
63: tions for all combinations of data and CRC register values.
64:
65: The values must be right-shifted by eight bits by the "updcrc"
66: logic; the shift must be unsigned (bring in zeroes). On some
67: hardware you could probably optimize the shift in assembler by
68: using byte-swap instructions.
69: polynomial $edb88320
70:
71: --------------------------------------------------------------------*/
72:
73: ULONG crc_32_tab[] =
74: {
75: 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
76: 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
77: 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
78: 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
79: 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
80: 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
81: 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
82: 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
83: 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
84: 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
85: 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
86: 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
87: 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
88: 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
89: 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
90: 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
91: 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
92: 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
93: 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
94: 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
95: 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
96: 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
97: 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
98: 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
99: 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
100: 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
101: 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
102: 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
103: 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
104: 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
105: 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
106: 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
107: 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
108: 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
109: 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
110: 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
111: 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
112: 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
113: 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
114: 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
115: 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
116: 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
117: 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
118: 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
119: 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
120: 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
121: 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
122: 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
123: 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
124: 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
125: 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
126: 0x2d02ef8dL
127: }; /* end crc_32_tab[] */
128:
129:
130: void UpdateCRC(s, len)
131: register byte *s;
132: register int len;
133: {
134: register ULONG crcval = crc32val;
135:
136: /* update running CRC calculation with contents of a buffer */
137: while (len--)
138: crcval = crc_32_tab[((byte) crcval ^ (*s++)) & 0xff] ^ (crcval >> 8);
139: crc32val = crcval;
140: }
141:
142: #endif /* !ZIPINFO */
143:
144:
145:
146:
147:
148: /**************************/
149: /* Function do_string() */
150: /**************************/
151:
152: int do_string(len, option) /* return PK-type error code */
153: unsigned int len; /* without prototype, UWORD converted to this */
154: int option;
155: {
156: int block_length, error = 0;
157: UWORD comment_bytes_left, extra_len;
158:
159:
160: /*---------------------------------------------------------------------------
161: This function processes arbitrary-length (well, usually) strings. Three
162: options are allowed: SKIP, wherein the string is skipped pretty logical,
163: eh?); DISPLAY, wherein the string is printed to standard output after un-
164: dergoing any necessary or unnecessary character conversions; and FILENAME,
165: wherein the string is put into the filename[] array after undergoing ap-
166: propriate conversions (including case-conversion, if that is indicated:
167: see the global variable pInfo->lcflag). The latter option should be OK,
168: since filename is now dimensioned at 1025, but we check anyway.
169:
170: The string, by the way, is assumed to start at the current file-pointer
171: position; its length is given by len. So start off by checking length
172: of string: if zero, we're already set.
173: ---------------------------------------------------------------------------*/
174:
175: if (!len)
176: return (0); /* 0: no error */
177:
178: switch (option) {
179:
180: /*
181: * First case: print string on standard output. First set loop vari-
182: * ables, then loop through the comment in chunks of OUTBUFSIZ bytes,
183: * converting formats and printing as we go. The second half of the
184: * loop conditional was added because the file might be truncated, in
185: * which case comment_bytes_left will remain at some non-zero value for
186: * all time. outbuf is used as a scratch buffer because it is avail-
187: * able (we should be either before or in between any file processing).
188: * [The typecast in front of the MIN() macro was added because of the
189: * new promotion rules under ANSI C; readbuf() wants an int, but MIN()
190: * returns a signed long, if I understand things correctly. The proto-
191: * type should handle it, but just in case...]
192: */
193:
194: case DISPLAY:
195: comment_bytes_left = len;
196: block_length = OUTBUFSIZ; /* for the while statement, first time */
197: while (comment_bytes_left > 0 && block_length > 0) {
198: if ((block_length = readbuf((char *)outbuf,
199: (int) MIN(OUTBUFSIZ, comment_bytes_left))) <= 0)
200: return 51; /* 51: unexpected EOF */
201: comment_bytes_left -= block_length;
202: NUKE_CRs(outbuf, block_length); /* (modifies block_length) */
203:
204: /* this is why we allocated an extra byte for outbuf: */
205: outbuf[block_length] = '\0'; /* terminate w/zero: ASCIIZ */
206:
207: A_TO_N(outbuf); /* translate string to native */
208: #ifdef MSWIN
209: /* ran out of local mem -- had to cheat */
210: WriteStringToMsgWin(outbuf, bRealTimeMsgUpdate);
211: #else /* !MSWIN */
212: printf("%s", outbuf);
213: #endif /* ?MSWIN */
214: }
215: printf("\n"); /* assume no newline at end */
216: break;
217:
218: /*
219: * Second case: read string into filename[] array. The filename should
220: * never ever be longer than FILNAMSIZ-1 (1024), but for now we'll check,
221: * just to be sure.
222: */
223:
224: case FILENAME:
225: extra_len = 0;
226: if (len >= FILNAMSIZ) {
227: fprintf(stderr, "warning: filename too long--truncating.\n");
228: error = 1; /* 1: warning error */
229: extra_len = len - FILNAMSIZ + 1;
230: len = FILNAMSIZ - 1;
231: }
232: if (readbuf(filename, len) <= 0)
233: return 51; /* 51: unexpected EOF */
234: filename[len] = '\0'; /* terminate w/zero: ASCIIZ */
235:
236: A_TO_N(filename); /* translate string to native */
237:
238: #ifndef ZIPINFO
239: if (pInfo->lcflag)
240: TOLOWER(filename, filename); /* replace with lowercase filename */
241: #endif
242:
243: if (!extra_len) /* we're done here */
244: break;
245:
246: /*
247: * We truncated the filename, so print what's left and then fall
248: * through to the SKIP routine.
249: */
250: fprintf(stderr, "[ %s ]\n", filename);
251: len = extra_len;
252: /* FALL THROUGH... */
253:
254: /*
255: * Third case: skip string, adjusting readbuf's internal variables
256: * as necessary (and possibly skipping to and reading a new block of
257: * data).
258: */
259:
260: case SKIP:
261: LSEEK(cur_zipfile_bufstart + (inptr-inbuf) + len)
262: break;
263:
264: /*
265: * Fourth case: assume we're at the start of an "extra field"; malloc
266: * storage for it and read data into the allocated space.
267: */
268:
269: case EXTRA_FIELD:
270: if (extra_field != (byte *)NULL)
271: free(extra_field);
272: if ((extra_field = (byte *)malloc(len)) == (byte *)NULL) {
273: fprintf(stderr,
274: "warning: extra field too long (%d). Ignoring...\n", len);
275: LSEEK(cur_zipfile_bufstart + (inptr-inbuf) + len)
276: } else
277: if (readbuf((char *)extra_field, len) <= 0)
278: return 51; /* 51: unexpected EOF */
279: break;
280:
281: } /* end switch (option) */
282: return error;
283:
284: } /* end function do_string() */
285:
286:
287:
288:
289:
290: #ifndef ZIPINFO
291: #ifndef VMS
292:
293: /*********************************/
294: /* Function dos_to_unix_time() */
295: /*********************************/
296:
297: time_t dos_to_unix_time(ddate, dtime)
298: unsigned ddate, dtime;
299: {
300: static short yday[]={0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334};
301: int yr, mo, dy, hh, mm, ss, leap;
302: long m_time, days=0;
303: #if (!defined(MACOS) && !defined(MSC) && !defined(__GO32__))
304: #if (defined(BSD) || defined(MTS))
305: #ifndef __386BSD__
306: static struct timeb tbp;
307: #endif /* __386BSD__ */
308: #else /* !(BSD || MTS) */
309: extern long timezone; /* declared in <time.h> for MSC (& Borland?) */
310: #endif /* ?(BSD || MTS) */
311: #endif /* !MACOS && !MSC && !__GO32__ */
312:
313: # define YRBASE 1970
314:
315: /* dissect date */
316: yr = ((ddate >> 9) & 0x7f) + (1980 - YRBASE);
317: mo = ((ddate >> 5) & 0x0f) - 1;
318: dy = (ddate & 0x1f) - 1;
319:
320: /* dissect time */
321: hh = (dtime >> 11) & 0x1f;
322: mm = (dtime >> 5) & 0x3f;
323: ss = (dtime & 0x1f) * 2;
324:
325: /* leap = # of leap years from BASE up to but not including current year */
326: leap = ((yr + YRBASE - 1) / 4); /* leap year base factor */
327:
328: /* How many days from BASE to this year? (& add expired days this year) */
329: days = (yr * 365) + (leap - 492) + yday[mo];
330:
331: /* if year is a leap year and month is after February, add another day */
332: if ((mo > 1) && ((yr+YRBASE)%4 == 0) && ((yr+YRBASE) != 2100))
333: ++days; /* OK through 2199 */
334:
335: /* convert date & time to seconds relative to 00:00:00, 01/01/YRBASE */
336: m_time = ((long)(days + dy) * 86400L) + ((long)hh * 3600) + (mm * 60) + ss;
337: /* - 1; MS-DOS times always rounded up to nearest even second */
338:
339: #if (!defined(MACOS) && !defined(__GO32__))
340: #if (defined(BSD) || defined(MTS))
341: #ifndef __386BSD__
342: ftime(&tbp);
343: m_time += tbp.timezone * 60L;
344: #endif
345: #else /* !(BSD || MTS) */
346: #ifdef WIN32
347: /* later... */
348: #else /* !WIN32 */
349: tzset(); /* set `timezone' */
350: #endif /* ?WIN32 */
351: m_time += timezone; /* account for timezone differences */
352: #endif /* ?(BSD || MTS) */
353: #endif /* !MACOS && !__GO32__ */
354:
355: #ifdef __386BSD__
356: m_time += localtime((time_t *) &m_time)->tm_gmtoff;
357: #else
358: if (localtime((time_t *)&m_time)->tm_isdst)
359: m_time -= 60L * 60L; /* adjust for daylight savings time */
360: #endif /* __386BSD__ */
361:
362: return m_time;
363:
364: } /* end function dos_to_unix_time() */
365:
366: #endif /* !VMS */
367:
368:
369:
370:
371:
372: /********************************/
373: /* Function check_for_newer() */ /* could make this into a macro for Unix */
374: /********************************/
375:
376: int check_for_newer(filename) /* return 1 if existing file newer or equal; */
377: char *filename; /* 0 if older; -1 if doesn't exist yet */
378: {
379: #ifdef VMS
380: unsigned short timbuf[7];
381: int dy, mo, yr, hh, mm, ss, dy2, mo2, yr2, hh2, mm2, ss2;
382: struct FAB fab;
383: struct XABDAT xdat;
384:
385:
386: if (stat(filename, &statbuf))
387: return DOES_NOT_EXIST;
388:
389: fab = cc$rms_fab;
390: xdat = cc$rms_xabdat;
391:
392: fab.fab$l_xab = &xdat;
393: fab.fab$l_fna = filename;
394: fab.fab$b_fns = strlen(filename);
395: fab.fab$l_fop = FAB$M_GET | FAB$M_UFO;
396:
397: if ((sys$open(&fab) & 1) == 0) /* open failure: report exists and */
398: return EXISTS_AND_OLDER; /* older so new copy will be made */
399: sys$numtim(&timbuf,&xdat.xab$q_cdt);
400: fab.fab$l_xab = 0L;
401:
402: sys$dassgn(fab.fab$l_stv);
403: sys$close(&fab); /* be sure file is closed and RMS knows about it */
404:
405: yr = timbuf[0];
406: yr2 = ((lrec.last_mod_file_date >> 9) & 0x7f) + 1980;
407: if (yr > yr2)
408: return EXISTS_AND_NEWER;
409: else if (yr < yr2)
410: return EXISTS_AND_OLDER;
411:
412: mo = timbuf[1];
413: mo2 = ((lrec.last_mod_file_date >> 5) & 0x0f);
414: if (mo > mo2)
415: return EXISTS_AND_NEWER;
416: else if (mo < mo2)
417: return EXISTS_AND_OLDER;
418:
419: dy = timbuf[2];
420: dy2 = (lrec.last_mod_file_date & 0x1f);
421: if (dy > dy2)
422: return EXISTS_AND_NEWER;
423: else if (dy < dy2)
424: return EXISTS_AND_OLDER;
425:
426: hh = timbuf[3];
427: hh2 = (lrec.last_mod_file_time >> 11) & 0x1f;
428: if (hh > hh2)
429: return EXISTS_AND_NEWER;
430: else if (hh < hh2)
431: return EXISTS_AND_OLDER;
432:
433: mm = timbuf[4];
434: mm2 = (lrec.last_mod_file_time >> 5) & 0x3f;
435: if (mm > mm2)
436: return EXISTS_AND_NEWER;
437: else if (mm < mm2)
438: return EXISTS_AND_OLDER;
439:
440: /* round to nearest 2 secs--may become 60, but doesn't matter for compare */
441: ss = (int)((float)timbuf[5] + (float)timbuf[6]*.01 + 1.) & -2;
442: ss2 = (lrec.last_mod_file_time & 0x1f) * 2;
443: if (ss >= ss2)
444: return EXISTS_AND_NEWER;
445:
446: return EXISTS_AND_OLDER;
447:
448: #else /* !VMS */
449: #ifdef OS2
450: long existing, archive;
451:
452: if ((existing = GetFileTime(filename)) == -1)
453: return DOES_NOT_EXIST;
454: archive = ((long) lrec.last_mod_file_date) << 16 | lrec.last_mod_file_time;
455:
456: return (existing >= archive);
457: #else /* !OS2 */
458: time_t existing, archive;
459:
460: if (stat(filename, &statbuf))
461: return DOES_NOT_EXIST;
462:
463: /* round up existing filetime to nearest 2 seconds for comparison */
464: existing = (statbuf.st_mtime & 1) ? statbuf.st_mtime+1 : statbuf.st_mtime;
465: archive = dos_to_unix_time(lrec.last_mod_file_date,
466: lrec.last_mod_file_time);
467:
468: return (existing >= archive);
469: #endif /* ?OS2 */
470: #endif /* ?VMS */
471:
472: } /* end function check_for_newer() */
473:
474:
475:
476:
477:
478: /***************************/
479: /* Function dateformat() */
480: /***************************/
481:
482: int dateformat()
483: {
484:
485: /*-----------------------------------------------------------------------------
486: For those operating systems which support it, this function returns a value
487: which tells how national convention says that numeric dates are displayed.
488:
489: Return values are DF_YMD, DF_DMY and DF_MDY. The meanings should be fairly
490: obvious.
491: -----------------------------------------------------------------------------*/
492:
493: #ifdef OS2
494: switch (GetCountryInfo()) {
495: case 0 /* DATEFMT_MM_DD_YY */ :
496: return DF_MDY;
497: case 1 /* DATEFMT_DD_MM_YY */ :
498: return DF_DMY;
499: case 2 /* DATEFMT_YY_MM_DD */ :
500: return DF_YMD;
501: }
502: #else /* !OS2 */
503: #if (defined(MSDOS) && !defined(MSWIN))
504: unsigned short _CountryInfo[18];
505: #ifdef __GO32__
506: unsigned short *CountryInfo = _CountryInfo;
507:
508: bdos(0x38, (unsigned)CountryInfo, 0);
509: #else /* !__GO32__ */
510: unsigned short far *CountryInfo = _CountryInfo;
511: union REGS regs;
512: struct SREGS sregs;
513:
514: regs.x.ax = 0x3800;
515: regs.x.dx = FP_OFF(CountryInfo);
516: sregs.ds = FP_SEG(CountryInfo);
517: int86x(0x21, ®s, ®s, &sregs);
518: #endif /* ?__GO32__ */
519:
520: switch(CountryInfo[0]) {
521: case 0:
522: return DF_MDY;
523: case 1:
524: return DF_DMY;
525: case 2:
526: return DF_YMD;
527: }
528: #endif /* MSDOS && !MSWIN */
529: #endif /* ?OS2 */
530:
531: return DF_MDY; /* default for Unix, VMS, etc. */
532:
533: } /* end function dateformat() */
534:
535: #endif /* !ZIPINFO */
536:
537:
538:
539:
540:
541: #ifdef EBCDIC
542:
543: /*
544: * This is the MTS ASCII->EBCDIC translation table. It provides a 1-1
545: * translation from ISO 8859/1 8-bit ASCII to IBM Code Page 37 EBCDIC.
546: */
547:
548: unsigned char ebcdic[] =
549: {
550: 0x00, 0x01, 0x02, 0x03, 0x37, 0x2d, 0x2e, 0x2f,
551: 0x16, 0x05, 0x25, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f,
552: 0x10, 0x11, 0x12, 0x13, 0x3c, 0x3d, 0x32, 0x26,
553: 0x18, 0x19, 0x3f, 0x27, 0x1c, 0x1d, 0x1e, 0x1f,
554: 0x40, 0x5a, 0x7f, 0x7b, 0x5b, 0x6c, 0x50, 0x7d,
555: 0x4d, 0x5d, 0x5c, 0x4e, 0x6b, 0x60, 0x4b, 0x61,
556: 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7,
557: 0xf8, 0xf9, 0x7a, 0x5e, 0x4c, 0x7e, 0x6e, 0x6f,
558: 0x7c, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7,
559: 0xc8, 0xc9, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6,
560: 0xd7, 0xd8, 0xd9, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6,
561: 0xe7, 0xe8, 0xe9, 0xba, 0xe0, 0xbb, 0xb0, 0x6d,
562: 0x79, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
563: 0x88, 0x89, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96,
564: 0x97, 0x98, 0x99, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6,
565: 0xa7, 0xa8, 0xa9, 0xc0, 0x4f, 0xd0, 0xa1, 0x07,
566: 0x20, 0x21, 0x22, 0x23, 0x24, 0x15, 0x06, 0x17,
567: 0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x09, 0x0a, 0x1b,
568: 0x30, 0x31, 0x1a, 0x33, 0x34, 0x35, 0x36, 0x08,
569: 0x38, 0x39, 0x3a, 0x3b, 0x04, 0x14, 0x3e, 0xff,
570: 0x41, 0xaa, 0x4a, 0xb1, 0x9f, 0xb2, 0x6a, 0xb5,
571: 0xbd, 0xb4, 0x9a, 0x8a, 0x5f, 0xca, 0xaf, 0xbc,
572: 0x90, 0x8f, 0xea, 0xfa, 0xbe, 0xa0, 0xb6, 0xb3,
573: 0x9d, 0xda, 0x9b, 0x8b, 0xb7, 0xb8, 0xb9, 0xab,
574: 0x64, 0x65, 0x62, 0x66, 0x63, 0x67, 0x9e, 0x68,
575: 0x74, 0x71, 0x72, 0x73, 0x78, 0x75, 0x76, 0x77,
576: 0xac, 0x69, 0xed, 0xee, 0xeb, 0xef, 0xec, 0xbf,
577: 0x80, 0xfd, 0xfe, 0xfb, 0xfc, 0xad, 0xae, 0x59,
578: 0x44, 0x45, 0x42, 0x46, 0x43, 0x47, 0x9c, 0x48,
579: 0x54, 0x51, 0x52, 0x53, 0x58, 0x55, 0x56, 0x57,
580: 0x8c, 0x49, 0xcd, 0xce, 0xcb, 0xcf, 0xcc, 0xe1,
581: 0x70, 0xdd, 0xde, 0xdb, 0xdc, 0x8d, 0x8e, 0xdf
582: }; /* end ebcdic[] */
583:
584: #endif /* EBCDIC */
585:
586:
587:
588:
589:
590: /*************************/
591: /* Function makeword() */
592: /*************************/
593:
594: UWORD makeword(b)
595: byte *b;
596: {
597: /*
598: * Convert Intel style 'short' integer to non-Intel non-16-bit
599: * host format. This routine also takes care of byte-ordering.
600: */
601: return ((b[1] << 8) | b[0]);
602: }
603:
604:
605:
606:
607:
608: /*************************/
609: /* Function makelong() */
610: /*************************/
611:
612: ULONG makelong(sig)
613: byte *sig;
614: {
615: /*
616: * Convert intel style 'long' variable to non-Intel non-16-bit
617: * host format. This routine also takes care of byte-ordering.
618: */
619: return (((ULONG) sig[3]) << 24)
620: + (((ULONG) sig[2]) << 16)
621: + (((ULONG) sig[1]) << 8)
622: + ((ULONG) sig[0]);
623: }
624:
625:
626:
627:
628:
629: #ifdef VMS
630:
631: /***************************/
632: /* Function return_VMS() */
633: /***************************/
634:
635: void return_VMS(zip_error)
636: int zip_error;
637: {
638: #ifdef RETURN_CODES
639: /*---------------------------------------------------------------------------
640: Do our own, explicit processing of error codes and print message, since
641: VMS misinterprets return codes as rather obnoxious system errors ("access
642: violation," for example).
643: ---------------------------------------------------------------------------*/
644:
645: switch (zip_error) {
646:
647: case 0:
648: break; /* life is fine... */
649: case 1:
650: fprintf(stderr, "\n[return-code 1: warning error \
651: (e.g., failed CRC or unknown compression method)]\n");
652: break;
653: case 2:
654: case 3:
655: fprintf(stderr, "\n[return-code %d: error in zipfile \
656: (e.g., can't find local file header sig)]\n",
657: zip_error);
658: break;
659: case 4:
660: case 5:
661: case 6:
662: case 7:
663: case 8:
664: fprintf(stderr, "\n[return-code %d: insufficient memory]\n",
665: zip_error);
666: break;
667: case 9:
668: fprintf(stderr, "\n[return-code 9: zipfile not found]\n");
669: break;
670: case 10: /* this is the one that gives "access violation," I think */
671: fprintf(stderr, "\n[return-code 10: bad or illegal parameters \
672: specified on command line]\n");
673: break;
674: case 11: /* I'm not sure this one is implemented, but maybe soon? */
675: fprintf(stderr,
676: "\n[return-code 11: no files found to extract/view/etc.]\n");
677: break;
678: case 50:
679: fprintf(stderr,
680: "\n[return-code 50: disk full (or otherwise unable to open output file)]\n");
681: break;
682: case 51:
683: fprintf(stderr,
684: "\n[return-code 51: unexpected EOF in zipfile (i.e., truncated)]\n");
685: break;
686: default:
687: fprintf(stderr, "\n[return-code %d: unknown return-code \
688: (who put this one in? Wasn't me...)]\n",
689: zip_error);
690: break;
691: }
692: #endif /* RETURN_CODES */
693:
694: exit(0); /* everything okey-dokey as far as VMS concerned */
695:
696: } /* end function return_VMS() */
697:
698: #endif /* VMS */
699:
700:
701:
702:
703:
704: #ifdef ZMEM /* memset, memcpy for systems without them */
705:
706: /***********************/
707: /* Function memset() */
708: /***********************/
709:
710: char *memset(buf, init, len)
711: register char *buf, init; /* buffer loc and initializer */
712: register unsigned int len; /* length of the buffer */
713: {
714: char *start;
715:
716: start = buf;
717: while (len--)
718: *(buf++) = init;
719: return (start);
720: }
721:
722:
723:
724:
725:
726: /***********************/
727: /* Function memcpy() */
728: /***********************/
729:
730: char *memcpy(dst, src, len)
731: register char *dst, *src;
732: register unsigned int len;
733: {
734: char *start;
735:
736: start = dst;
737: while (len-- > 0)
738: *dst++ = *src++;
739: return (start);
740: }
741:
742: #endif /* ZMEM */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.