/*- * Copyright (c) 1994 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension * Support code is derived from software contributed to Berkeley * by Atsushi Murai (amurai@spec.co.jp). * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)cd9660_util.c 8.1 (Berkeley) 1/21/94 * $FreeBSD$ */ #include #include #include #include #include #include #include #include #include #include #include #include #include /* XXX */ #include /* XXX */ #include #include #include #ifdef __notanymore__ int isonum_711 (p) unsigned char *p; { return (*p); } int isonum_712 (p) signed char *p; { return (*p); } int isonum_721 (p) unsigned char *p; { /* little endian short */ #if BYTE_ORDER != LITTLE_ENDIAN printf ("isonum_721 called on non little-endian machine!\n"); #endif return *(short *)p; } int isonum_722 (p) unsigned char *p; { /* big endian short */ #if BYTE_ORDER != BIG_ENDIAN printf ("isonum_722 called on non big-endian machine!\n"); #endif return *(short *)p; } int isonum_723 (p) unsigned char *p; { #if BYTE_ORDER == BIG_ENDIAN return isonum_722 (p + 2); #elif BYTE_ORDER == LITTLE_ENDIAN return isonum_721 (p); #else printf ("isonum_723 unsupported byte order!\n"); return 0; #endif } int isonum_731 (p) unsigned char *p; { /* little endian long */ #if BYTE_ORDER != LITTLE_ENDIAN printf ("isonum_731 called on non little-endian machine!\n"); #endif return *(long *)p; } int isonum_732 (p) unsigned char *p; { /* big endian long */ #if BYTE_ORDER != BIG_ENDIAN printf ("isonum_732 called on non big-endian machine!\n"); #endif return *(long *)p; } int isonum_733 (p) unsigned char *p; { #if BYTE_ORDER == BIG_ENDIAN return isonum_732 (p + 4); #elif BYTE_ORDER == LITTLE_ENDIAN return isonum_731 (p); #else printf ("isonum_733 unsupported byte order!\n"); return 0; #endif } #endif /* __notanymore__ */ /* * translate and compare a filename * Note: Version number plus ';' may be omitted. */ int isofncmp(unsigned char *fn,int fnlen,unsigned char *isofn,int isolen) { int i, j; unsigned char c; while (--fnlen >= 0) { if (--isolen < 0) return *fn; if ((c = *isofn++) == ';') { switch (*fn++) { default: return *--fn; case 0: return 0; case ';': break; } for (i = 0; --fnlen >= 0; i = i * 10 + *fn++ - '0') { if (*fn < '0' || *fn > '9') { return -1; } } for (j = 0; --isolen >= 0; j = j * 10 + *isofn++ - '0'); return i - j; } if (c != *fn) { if (c >= 'A' && c <= 'Z') { if (c + ('a' - 'A') != *fn) { if (*fn >= 'a' && *fn <= 'z') return *fn - ('a' - 'A') - c; else return *fn - c; } } else return *fn - c; } fn++; } if (isolen > 0) { switch (*isofn) { default: return -1; case '.': if (isofn[1] != ';') return -1; case ';': return 0; } } return 0; } /* * translate a filename */ void isofntrans(unsigned char *infn,int infnlen, unsigned char *outfn,unsigned short *outfnlen, int original,int assoc) { int fnidx = 0; if (assoc) { *outfn++ = ASSOCCHAR; fnidx++; infnlen++; } for (; fnidx < infnlen; fnidx++) { char c = *infn++; if (!original && c >= 'A' && c <= 'Z') *outfn++ = c + ('a' - 'A'); else if (!original && c == '.' && *infn == ';') break; else if (!original && c == ';') break; else *outfn++ = c; } *outfnlen = fnidx; }