1 /*- 2 * Copyright (c) 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley 6 * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension 7 * Support code is derived from software contributed to Berkeley 8 * by Atsushi Murai (amurai@spec.co.jp). Joliet support was added by 9 * Joachim Kuebart (joki@kuebart.stuttgart.netsurf.de). 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the University of 22 * California, Berkeley and its contributors. 23 * 4. Neither the name of the University nor the names of its contributors 24 * may be used to endorse or promote products derived from this software 25 * without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 * 39 * @(#)cd9660_util.c 8.3 (Berkeley) 12/5/94 40 * $FreeBSD: src/sys/isofs/cd9660/cd9660_util.c,v 1.13.2.1 2001/02/27 12:36:34 sobomax Exp $ 41 */ 42 43 #include <sys/param.h> 44 #include <sys/mount.h> 45 #include <sys/vnode.h> 46 #include <sys/iconv.h> 47 48 #include "iso.h" 49 #include "cd9660_mount.h" 50 51 extern struct iconv_functions *cd9660_iconv; 52 53 /* 54 * Get one character out of an iso filename 55 * Obey joliet_level 56 * Return number of bytes consumed 57 */ 58 int 59 isochar(u_char *isofn, u_char *isoend, int joliet_level, u_short *c, 60 int *clen, int flags, void *handle) 61 { 62 size_t i, j, len; 63 char inbuf[3], outbuf[3], *inp, *outp; 64 *c = *isofn++; 65 if (clen) *clen = 1; 66 if (joliet_level == 0 || isofn == isoend) 67 /* (00) and (01) are one byte in Joliet, too */ 68 return 1; 69 if (flags & ISOFSMNT_KICONV && cd9660_iconv) { 70 i = j = len = 2; 71 inbuf[0]=(char)*(isofn - 1); 72 inbuf[1]=(char)*isofn; 73 inbuf[2]='\0'; 74 inp = inbuf; 75 outp = outbuf; 76 cd9660_iconv->convchr(handle, (const char **)(void *)&inp, 77 &i, &outp, &j); 78 len -= j; 79 if (clen) *clen = len; 80 *c = '\0'; 81 while(len--) 82 *c |= (*(outp - len - 1) & 0xff) << (len << 3); 83 } else { 84 switch (*c) { 85 default: 86 *c = '?'; 87 break; 88 case '\0': 89 *c = *isofn; 90 break; 91 } 92 } 93 return 2; 94 } 95 96 /* 97 * translate and compare a filename 98 * returns (fn - isofn) 99 * Note: Version number plus ';' may be omitted. 100 */ 101 int 102 isofncmp(u_char *fn, int fnlen, u_char *isofn, int isolen, int joliet_level, 103 int flags, void *handle, void *lhandle) 104 { 105 int i, j; 106 u_short c, d; 107 u_char *fnend = fn + fnlen, *isoend = isofn + isolen; 108 for (; fn < fnend; ) { 109 d = sgetrune(fn, fnend - fn, (char const **)&fn, flags, lhandle); 110 if (isofn == isoend) 111 return d; 112 isofn += isochar(isofn, isoend, joliet_level, &c, NULL, flags, handle); 113 if (c == ';') { 114 if (d != ';') 115 return d; 116 for (i = 0; fn < fnend; i = i * 10 + *fn++ - '0') { 117 if (*fn < '0' || *fn > '9') { 118 return -1; 119 } 120 } 121 for (j = 0; isofn != isoend; j = j * 10 + c - '0') 122 isofn += isochar(isofn, isoend, 123 joliet_level, &c, 124 NULL, flags, handle); 125 return i - j; 126 } 127 if (c != d) { 128 if (c >= 'A' && c <= 'Z') { 129 if (c + ('a' - 'A') != d) { 130 if (d >= 'a' && d <= 'z') 131 return d - ('a' - 'A') - c; 132 else 133 return d - c; 134 } 135 } else 136 return d - c; 137 } 138 } 139 if (isofn != isoend) { 140 isofn += isochar(isofn, isoend, joliet_level, &c, NULL, flags, handle); 141 switch (c) { 142 default: 143 return -c; 144 case '.': 145 if (isofn != isoend) { 146 isochar(isofn, isoend, joliet_level, &c, 147 NULL, flags, handle); 148 if (c == ';') 149 return 0; 150 } 151 return -1; 152 case ';': 153 return 0; 154 } 155 } 156 return 0; 157 } 158 159 /* 160 * translate a filename of length > 0 161 */ 162 void 163 isofntrans(u_char *infn, int infnlen, u_char *outfn, u_short *outfnlen, int original, 164 int assoc, int joliet_level, int flags, void *handle) 165 { 166 u_short c, d = '\0'; 167 u_char *outp = outfn, *infnend = infn + infnlen; 168 int clen; 169 if (assoc) { 170 *outp++ = ASSOCCHAR; 171 } 172 for (; infn != infnend; ) { 173 infn += isochar(infn, infnend, joliet_level, &c, &clen, flags, handle); 174 if (!original && !joliet_level && c >= 'A' && c <= 'Z') 175 c += ('a' - 'A'); 176 else if (!original && c == ';') { 177 outp -= (d == '.'); 178 break; 179 } 180 d = c; 181 while(clen--) 182 *outp++ = c >> (clen << 3); 183 } 184 *outfnlen = outp - outfn; 185 } 186 187 /* 188 * same as sgetrune(3) 189 */ 190 u_short 191 sgetrune(const char *string, size_t n, char const **result, 192 int flags, void *handle) 193 { 194 size_t i, j, len; 195 char outbuf[3], *outp; 196 u_short c = '\0'; 197 len = i = (n < 2) ? n : 2; 198 j = 2; 199 outp = outbuf; 200 if (flags & ISOFSMNT_KICONV && cd9660_iconv) { 201 cd9660_iconv->convchr(handle, &string, &i, &outp, &j); 202 len -= i; 203 } else { 204 len = 1; 205 string++; 206 } 207 if (result) *result = string; 208 while(len--) c |= (*(string - len - 1) & 0xff) << (len << 3); 209 return (c); 210 } 211