Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
FreeBSD/Linux Kernel Cross Reference
sys/fs/msdosfs/msdosfs_conv.c
Version:
- FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
SearchContext: - none - 3 - 10
1 /* $FreeBSD: releng/6.0/sys/fs/msdosfs/msdosfs_conv.c 148344 2005-07-23 17:02:04Z imura $ */ 2 /* $NetBSD: msdosfs_conv.c,v 1.25 1997/11/17 15:36:40 ws Exp $ */ 3 4 /*- 5 * Copyright (C) 1995, 1997 Wolfgang Solfrank. 6 * Copyright (C) 1995, 1997 TooLs GmbH. 7 * All rights reserved. 8 * Original code by Paul Popelka (paulp@uts.amdahl.com) (see below). 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by TooLs GmbH. 21 * 4. The name of TooLs GmbH may not be used to endorse or promote products 22 * derived from this software without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR 25 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 26 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 27 * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 28 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 29 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 30 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 31 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 32 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 33 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 34 */ 35 /*- 36 * Written by Paul Popelka (paulp@uts.amdahl.com) 37 * 38 * You can do anything you want with this software, just don't say you wrote 39 * it, and don't remove this notice. 40 * 41 * This software is provided "as is". 42 * 43 * The author supplies this software to be publicly redistributed on the 44 * understanding that the author is not responsible for the correct 45 * functioning of this software in any circumstances and is not liable for 46 * any damages caused by this software. 47 * 48 * October 1992 49 */ 50 51 /* 52 * System include files. 53 */ 54 #include <sys/param.h> 55 #include <sys/time.h> 56 #include <sys/kernel.h> /* defines tz */ 57 #include <sys/systm.h> 58 #include <machine/clock.h> 59 #include <sys/dirent.h> 60 #include <sys/iconv.h> 61 #include <sys/mount.h> 62 #include <sys/malloc.h> 63 64 extern struct iconv_functions *msdosfs_iconv; 65 66 /* 67 * MSDOSFS include files. 68 */ 69 #include <fs/msdosfs/bpb.h> 70 #include <fs/msdosfs/msdosfsmount.h> 71 #include <fs/msdosfs/direntry.h> 72 73 /* 74 * Total number of days that have passed for each month in a regular year. 75 */ 76 static u_short regyear[] = { 77 31, 59, 90, 120, 151, 181, 78 212, 243, 273, 304, 334, 365 79 }; 80 81 /* 82 * Total number of days that have passed for each month in a leap year. 83 */ 84 static u_short leapyear[] = { 85 31, 60, 91, 121, 152, 182, 86 213, 244, 274, 305, 335, 366 87 }; 88 89 /* 90 * Variables used to remember parts of the last time conversion. Maybe we 91 * can avoid a full conversion. 92 */ 93 static u_long lasttime; 94 static u_long lastday; 95 static u_short lastddate; 96 static u_short lastdtime; 97 98 static int mbsadjpos(const char **, size_t, size_t, int, int, void *handle); 99 static u_int16_t dos2unixchr(const u_char **, size_t *, int, struct msdosfsmount *); 100 static u_int16_t unix2doschr(const u_char **, size_t *, struct msdosfsmount *); 101 static u_int16_t win2unixchr(u_int16_t, struct msdosfsmount *); 102 static u_int16_t unix2winchr(const u_char **, size_t *, int, struct msdosfsmount *); 103 104 static char *nambuf_ptr; 105 static size_t nambuf_len; 106 static int nambuf_last_id; 107 108 /* 109 * Convert the unix version of time to dos's idea of time to be used in 110 * file timestamps. The passed in unix time is assumed to be in GMT. 111 */ 112 void 113 unix2dostime(tsp, ddp, dtp, dhp) 114 struct timespec *tsp; 115 u_int16_t *ddp; 116 u_int16_t *dtp; 117 u_int8_t *dhp; 118 { 119 u_long t; 120 u_long days; 121 u_long inc; 122 u_long year; 123 u_long month; 124 u_short *months; 125 126 /* 127 * If the time from the last conversion is the same as now, then 128 * skip the computations and use the saved result. 129 */ 130 t = tsp->tv_sec - (tz_minuteswest * 60) 131 - (wall_cmos_clock ? adjkerntz : 0); 132 /* - daylight savings time correction */ 133 t &= ~1; 134 if (lasttime != t) { 135 lasttime = t; 136 lastdtime = (((t / 2) % 30) << DT_2SECONDS_SHIFT) 137 + (((t / 60) % 60) << DT_MINUTES_SHIFT) 138 + (((t / 3600) % 24) << DT_HOURS_SHIFT); 139 140 /* 141 * If the number of days since 1970 is the same as the last 142 * time we did the computation then skip all this leap year 143 * and month stuff. 144 */ 145 days = t / (24 * 60 * 60); 146 if (days != lastday) { 147 lastday = days; 148 for (year = 1970;; year++) { 149 inc = year & 0x03 ? 365 : 366; 150 if (days < inc) 151 break; 152 days -= inc; 153 } 154 months = year & 0x03 ? regyear : leapyear; 155 for (month = 0; days >= months[month]; month++) 156 ; 157 if (month > 0) 158 days -= months[month - 1]; 159 lastddate = ((days + 1) << DD_DAY_SHIFT) 160 + ((month + 1) << DD_MONTH_SHIFT); 161 /* 162 * Remember dos's idea of time is relative to 1980. 163 * unix's is relative to 1970. If somehow we get a 164 * time before 1980 then don't give totally crazy 165 * results. 166 */ 167 if (year > 1980) 168 lastddate += (year - 1980) << DD_YEAR_SHIFT; 169 } 170 } 171 if (dtp) 172 *dtp = lastdtime; 173 if (dhp) 174 *dhp = (tsp->tv_sec & 1) * 100 + tsp->tv_nsec / 10000000; 175 176 *ddp = lastddate; 177 } 178 179 /* 180 * The number of seconds between Jan 1, 1970 and Jan 1, 1980. In that 181 * interval there were 8 regular years and 2 leap years. 182 */ 183 #define SECONDSTO1980 (((8 * 365) + (2 * 366)) * (24 * 60 * 60)) 184 185 static u_short lastdosdate; 186 static u_long lastseconds; 187 188 /* 189 * Convert from dos' idea of time to unix'. This will probably only be 190 * called from the stat(), and fstat() system calls and so probably need 191 * not be too efficient. 192 */ 193 void 194 dos2unixtime(dd, dt, dh, tsp) 195 u_int dd; 196 u_int dt; 197 u_int dh; 198 struct timespec *tsp; 199 { 200 u_long seconds; 201 u_long month; 202 u_long year; 203 u_long days; 204 u_short *months; 205 206 if (dd == 0) { 207 /* 208 * Uninitialized field, return the epoch. 209 */ 210 tsp->tv_sec = 0; 211 tsp->tv_nsec = 0; 212 return; 213 } 214 seconds = (((dt & DT_2SECONDS_MASK) >> DT_2SECONDS_SHIFT) << 1) 215 + ((dt & DT_MINUTES_MASK) >> DT_MINUTES_SHIFT) * 60 216 + ((dt & DT_HOURS_MASK) >> DT_HOURS_SHIFT) * 3600 217 + dh / 100; 218 /* 219 * If the year, month, and day from the last conversion are the 220 * same then use the saved value. 221 */ 222 if (lastdosdate != dd) { 223 lastdosdate = dd; 224 days = 0; 225 year = (dd & DD_YEAR_MASK) >> DD_YEAR_SHIFT; 226 days = year * 365; 227 days += year / 4 + 1; /* add in leap days */ 228 if ((year & 0x03) == 0) 229 days--; /* if year is a leap year */ 230 months = year & 0x03 ? regyear : leapyear; 231 month = (dd & DD_MONTH_MASK) >> DD_MONTH_SHIFT; 232 if (month < 1 || month > 12) { 233 printf("dos2unixtime(): month value out of range (%ld)\n", 234 month); 235 month = 1; 236 } 237 if (month > 1) 238 days += months[month - 2]; 239 days += ((dd & DD_DAY_MASK) >> DD_DAY_SHIFT) - 1; 240 lastseconds = (days * 24 * 60 * 60) + SECONDSTO1980; 241 } 242 tsp->tv_sec = seconds + lastseconds + (tz_minuteswest * 60) 243 + adjkerntz; 244 /* + daylight savings time correction */ 245 tsp->tv_nsec = (dh % 100) * 10000000; 246 } 247 248 /* 249 * 0 - character disallowed in long file name. 250 * 1 - character should be replaced by '_' in DOS file name, 251 * and generation number inserted. 252 * 2 - character ('.' and ' ') should be skipped in DOS file name, 253 * and generation number inserted. 254 */ 255 static u_char 256 unix2dos[256] = { 257 /* iso8859-1 -> cp850 */ 258 0, 0, 0, 0, 0, 0, 0, 0, /* 00-07 */ 259 0, 0, 0, 0, 0, 0, 0, 0, /* 08-0f */ 260 0, 0, 0, 0, 0, 0, 0, 0, /* 10-17 */ 261 0, 0, 0, 0, 0, 0, 0, 0, /* 18-1f */ 262 2, 0x21, 0, 0x23, 0x24, 0x25, 0x26, 0x27, /* 20-27 */ 263 0x28, 0x29, 0, 1, 1, 0x2d, 2, 0, /* 28-2f */ 264 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, /* 30-37 */ 265 0x38, 0x39, 0, 1, 0, 1, 0, 0, /* 38-3f */ 266 0x40, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, /* 40-47 */ 267 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f, /* 48-4f */ 268 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, /* 50-57 */ 269 0x58, 0x59, 0x5a, 1, 0, 1, 0x5e, 0x5f, /* 58-5f */ 270 0x60, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, /* 60-67 */ 271 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f, /* 68-6f */ 272 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, /* 70-77 */ 273 0x58, 0x59, 0x5a, 0x7b, 0, 0x7d, 0x7e, 0, /* 78-7f */ 274 0, 0, 0, 0, 0, 0, 0, 0, /* 80-87 */ 275 0, 0, 0, 0, 0, 0, 0, 0, /* 88-8f */ 276 0, 0, 0, 0, 0, 0, 0, 0, /* 90-97 */ 277 0, 0, 0, 0, 0, 0, 0, 0, /* 98-9f */ 278 0, 0xad, 0xbd, 0x9c, 0xcf, 0xbe, 0xdd, 0xf5, /* a0-a7 */ 279 0xf9, 0xb8, 0xa6, 0xae, 0xaa, 0xf0, 0xa9, 0xee, /* a8-af */ 280 0xf8, 0xf1, 0xfd, 0xfc, 0xef, 0xe6, 0xf4, 0xfa, /* b0-b7 */ 281 0xf7, 0xfb, 0xa7, 0xaf, 0xac, 0xab, 0xf3, 0xa8, /* b8-bf */ 282 0xb7, 0xb5, 0xb6, 0xc7, 0x8e, 0x8f, 0x92, 0x80, /* c0-c7 */ 283 0xd4, 0x90, 0xd2, 0xd3, 0xde, 0xd6, 0xd7, 0xd8, /* c8-cf */ 284 0xd1, 0xa5, 0xe3, 0xe0, 0xe2, 0xe5, 0x99, 0x9e, /* d0-d7 */ 285 0x9d, 0xeb, 0xe9, 0xea, 0x9a, 0xed, 0xe8, 0xe1, /* d8-df */ 286 0xb7, 0xb5, 0xb6, 0xc7, 0x8e, 0x8f, 0x92, 0x80, /* e0-e7 */ 287 0xd4, 0x90, 0xd2, 0xd3, 0xde, 0xd6, 0xd7, 0xd8, /* e8-ef */ 288 0xd1, 0xa5, 0xe3, 0xe0, 0xe2, 0xe5, 0x99, 0xf6, /* f0-f7 */ 289 0x9d, 0xeb, 0xe9, 0xea, 0x9a, 0xed, 0xe8, 0x98, /* f8-ff */ 290 }; 291 292 static u_char 293 dos2unix[256] = { 294 /* cp850 -> iso8859-1 */ 295 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, /* 00-07 */ 296 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, /* 08-0f */ 297 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, /* 10-17 */ 298 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, /* 18-1f */ 299 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, /* 20-27 */ 300 0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, /* 28-2f */ 301 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, /* 30-37 */ 302 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, /* 38-3f */ 303 0x40, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, /* 40-47 */ 304 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f, /* 48-4f */ 305 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, /* 50-57 */ 306 0x58, 0x59, 0x5a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, /* 58-5f */ 307 0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 60-67 */ 308 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, /* 68-6f */ 309 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 70-77 */ 310 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, /* 78-7f */ 311 0xc7, 0xfc, 0xe9, 0xe2, 0xe4, 0xe0, 0xe5, 0xe7, /* 80-87 */ 312 0xea, 0xeb, 0xe8, 0xef, 0xee, 0xec, 0xc4, 0xc5, /* 88-8f */ 313 0xc9, 0xe6, 0xc6, 0xf4, 0xf6, 0xf2, 0xfb, 0xf9, /* 90-97 */ 314 0xff, 0xd6, 0xdc, 0xf8, 0xa3, 0xd8, 0xd7, 0x3f, /* 98-9f */ 315 0xe1, 0xed, 0xf3, 0xfa, 0xf1, 0xd1, 0xaa, 0xba, /* a0-a7 */ 316 0xbf, 0xae, 0xac, 0xbd, 0xbc, 0xa1, 0xab, 0xbb, /* a8-af */ 317 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0xc1, 0xc2, 0xc0, /* b0-b7 */ 318 0xa9, 0x3f, 0x3f, 0x3f, 0x3f, 0xa2, 0xa5, 0x3f, /* b8-bf */ 319 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0xe3, 0xc3, /* c0-c7 */ 320 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0xa4, /* c8-cf */ 321 0xf0, 0xd0, 0xca, 0xcb, 0xc8, 0x3f, 0xcd, 0xce, /* d0-d7 */ 322 0xcf, 0x3f, 0x3f, 0x3f, 0x3f, 0xa6, 0xcc, 0x3f, /* d8-df */ 323 0xd3, 0xdf, 0xd4, 0xd2, 0xf5, 0xd5, 0xb5, 0xfe, /* e0-e7 */ 324 0xde, 0xda, 0xdb, 0xd9, 0xfd, 0xdd, 0xaf, 0x3f, /* e8-ef */ 325 0xad, 0xb1, 0x3f, 0xbe, 0xb6, 0xa7, 0xf7, 0xb8, /* f0-f7 */ 326 0xb0, 0xa8, 0xb7, 0xb9, 0xb3, 0xb2, 0x3f, 0x3f, /* f8-ff */ 327 }; 328 329 static u_char 330 u2l[256] = { 331 /* tolower */ 332 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, /* 00-07 */ 333 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, /* 08-0f */ 334 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, /* 10-17 */ 335 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, /* 18-1f */ 336 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, /* 20-27 */ 337 0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, /* 28-2f */ 338 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, /* 30-37 */ 339 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, /* 38-3f */ 340 0x40, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 40-47 */ 341 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, /* 48-4f */ 342 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 50-57 */ 343 0x78, 0x79, 0x7a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, /* 58-5f */ 344 0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 60-67 */ 345 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, /* 68-6f */ 346 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 70-77 */ 347 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, /* 78-7f */ 348 0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, /* 80-87 */ 349 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f, /* 88-8f */ 350 0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, /* 90-97 */ 351 0x98, 0x99, 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, /* 98-9f */ 352 0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7, /* a0-a7 */ 353 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf, /* a8-af */ 354 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, /* b0-b7 */ 355 0xb8, 0xb9, 0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, /* b8-bf */ 356 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* c0-c7 */ 357 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* c8-cf */ 358 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xd7, /* d0-d7 */ 359 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xdf, /* d8-df */ 360 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* e0-e7 */ 361 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* e8-ef */ 362 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, /* f0-f7 */ 363 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff, /* f8-ff */ 364 }; 365 366 static u_char 367 l2u[256] = { 368 /* toupper */ 369 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, /* 00-07 */ 370 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, /* 08-0f */ 371 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, /* 10-17 */ 372 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, /* 18-1f */ 373 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, /* 20-27 */ 374 0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, /* 28-2f */ 375 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, /* 30-37 */ 376 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, /* 38-3f */ 377 0x40, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 40-47 */ 378 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, /* 48-4f */ 379 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 50-57 */ 380 0x78, 0x79, 0x7a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, /* 58-5f */ 381 0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 60-67 */ 382 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, /* 68-6f */ 383 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 70-77 */ 384 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, /* 78-7f */ 385 0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, /* 80-87 */ 386 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f, /* 88-8f */ 387 0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, /* 90-97 */ 388 0x98, 0x99, 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, /* 98-9f */ 389 0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7, /* a0-a7 */ 390 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf, /* a8-af */ 391 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, /* b0-b7 */ 392 0xb8, 0xb9, 0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, /* b8-bf */ 393 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* c0-c7 */ 394 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* c8-cf */ 395 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xd7, /* d0-d7 */ 396 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xdf, /* d8-df */ 397 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* e0-e7 */ 398 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* e8-ef */ 399 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, /* f0-f7 */ 400 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff, /* f8-ff */ 401 }; 402 403 /* 404 * DOS filenames are made of 2 parts, the name part and the extension part. 405 * The name part is 8 characters long and the extension part is 3 406 * characters long. They may contain trailing blanks if the name or 407 * extension are not long enough to fill their respective fields. 408 */ 409 410 /* 411 * Convert a DOS filename to a unix filename. And, return the number of 412 * characters in the resulting unix filename excluding the terminating 413 * null. 414 */ 415 int 416 dos2unixfn(dn, un, lower, pmp) 417 u_char dn[11]; 418 u_char *un; 419 int lower; 420 struct msdosfsmount *pmp; 421 { 422 size_t i; 423 int thislong = 0; 424 u_int16_t c; 425 426 /* 427 * If first char of the filename is SLOT_E5 (0x05), then the real 428 * first char of the filename should be 0xe5. But, they couldn't 429 * just have a 0xe5 mean 0xe5 because that is used to mean a freed 430 * directory slot. Another dos quirk. 431 */ 432 if (*dn == SLOT_E5) 433 *dn = 0xe5; 434 435 /* 436 * Copy the name portion into the unix filename string. 437 */ 438 for (i = 8; i > 0 && *dn != ' ';) { 439 c = dos2unixchr((const u_char **)&dn, &i, lower, pmp); 440 if (c & 0xff00) { 441 *un++ = c >> 8; 442 thislong++; 443 } 444 *un++ = c; 445 thislong++; 446 } 447 dn += i; 448 449 /* 450 * Now, if there is an extension then put in a period and copy in 451 * the extension. 452 */ 453 if (*dn != ' ') { 454 *un++ = '.'; 455 thislong++; 456 for (i = 3; i > 0 && *dn != ' ';) { 457 c = dos2unixchr((const u_char **)&dn, &i, lower, pmp); 458 if (c & 0xff00) { 459 *un++ = c >> 8; 460 thislong++; 461 } 462 *un++ = c; 463 thislong++; 464 } 465 } 466 *un++ = 0; 467 468 return (thislong); 469 } 470 471 /* 472 * Convert a unix filename to a DOS filename according to Win95 rules. 473 * If applicable and gen is not 0, it is inserted into the converted 474 * filename as a generation number. 475 * Returns 476 * 0 if name couldn't be converted 477 * 1 if the converted name is the same as the original 478 * (no long filename entry necessary for Win95) 479 * 2 if conversion was successful 480 * 3 if conversion was successful and generation number was inserted 481 */ 482 int 483 unix2dosfn(un, dn, unlen, gen, pmp) 484 const u_char *un; 485 u_char dn[12]; 486 size_t unlen; 487 u_int gen; 488 struct msdosfsmount *pmp; 489 { 490 ssize_t i, j; 491 int l; 492 int conv = 1; 493 const u_char *cp, *dp, *dp1; 494 u_char gentext[6], *wcp; 495 u_int16_t c; 496 497 /* 498 * Fill the dos filename string with blanks. These are DOS's pad 499 * characters. 500 */ 501 for (i = 0; i < 11; i++) 502 dn[i] = ' '; 503 dn[11] = 0; 504 505 /* 506 * The filenames "." and ".." are handled specially, since they 507 * don't follow dos filename rules. 508 */ 509 if (un[0] == '.' && unlen == 1) { 510 dn[0] = '.'; 511 return gen <= 1; 512 } 513 if (un[0] == '.' && un[1] == '.' && unlen == 2) { 514 dn[0] = '.'; 515 dn[1] = '.'; 516 return gen <= 1; 517 } 518 519 /* 520 * Filenames with only blanks and dots are not allowed! 521 */ 522 for (cp = un, i = unlen; --i >= 0; cp++) 523 if (*cp != ' ' && *cp != '.') 524 break; 525 if (i < 0) 526 return 0; 527 528 529 /* 530 * Filenames with some characters are not allowed! 531 */ 532 for (cp = un, i = unlen; i > 0;) 533 if (unix2doschr(&cp, (size_t *)&i, pmp) == 0) 534 return 0; 535 536 /* 537 * Now find the extension 538 * Note: dot as first char doesn't start extension 539 * and trailing dots and blanks are ignored 540 * Note(2003/7): It seems recent Windows has 541 * defferent rule than this code, that Windows 542 * ignores all dots before extension, and use all 543 * chars as filename except for dots. 544 */ 545 dp = dp1 = 0; 546 for (cp = un + 1, i = unlen - 1; --i >= 0;) { 547 switch (*cp++) { 548 case '.': 549 if (!dp1) 550 dp1 = cp; 551 break; 552 case ' ': 553 break; 554 default: 555 if (dp1) 556 dp = dp1; 557 dp1 = 0; 558 break; 559 } 560 } 561 562 /* 563 * Now convert it (this part is for extension). 564 * As Windows XP do, if it's not ascii char, 565 * this function should return 2 or 3, so that checkng out Unicode name. 566 */ 567 if (dp) { 568 if (dp1) 569 l = dp1 - dp; 570 else 571 l = unlen - (dp - un); 572 for (cp = dp, i = l, j = 8; i > 0 && j < 11; j++) { 573 c = unix2doschr(&cp, (size_t *)&i, pmp); 574 if (c & 0xff00) { 575 dn[j] = c >> 8; 576 if (++j < 11) { 577 dn[j] = c; 578 if (conv != 3) 579 conv = 2; 580 continue; 581 } else { 582 conv = 3; 583 dn[j-1] = ' '; 584 break; 585 } 586 } else { 587 dn[j] = c; 588 } 589 if (((dn[j] & 0x80) || *(cp - 1) != dn[j]) && conv != 3) 590 conv = 2; 591 if (dn[j] == 1) { 592 conv = 3; 593 dn[j] = '_'; 594 } 595 if (dn[j] == 2) { 596 conv = 3; 597 dn[j--] = ' '; 598 } 599 } 600 if (i > 0) 601 conv = 3; 602 dp--; 603 } else { 604 for (dp = cp; *--dp == ' ' || *dp == '.';); 605 dp++; 606 } 607 608 /* 609 * Now convert the rest of the name 610 */ 611 for (i = dp - un, j = 0; un < dp && j < 8; j++) { 612 c = unix2doschr(&un, &i, pmp); 613 if (c & 0xff00) { 614 dn[j] = c >> 8; 615 if (++j < 8) { 616 dn[j] = c; 617 if (conv != 3) 618 conv = 2; 619 continue; 620 } else { 621 conv = 3; 622 dn[j-1] = ' '; 623 break; 624 } 625 } else { 626 dn[j] = c; 627 } 628 if (((dn[j] & 0x80) || *(un - 1) != dn[j]) && conv != 3) 629 conv = 2; 630 if (dn[j] == 1) { 631 conv = 3; 632 dn[j] = '_'; 633 } 634 if (dn[j] == 2) { 635 conv = 3; 636 dn[j--] = ' '; 637 } 638 } 639 if (un < dp) 640 conv = 3; 641 /* 642 * If we didn't have any chars in filename, 643 * generate a default 644 */ 645 if (!j) 646 dn[0] = '_'; 647 648 /* 649 * If there wasn't any char dropped, 650 * there is no place for generation numbers 651 */ 652 if (conv != 3) { 653 if (gen > 1) 654 conv = 0; 655 goto done; 656 } 657 658 /* 659 * Now insert the generation number into the filename part 660 */ 661 if (gen == 0) 662 goto done; 663 for (wcp = gentext + sizeof(gentext); wcp > gentext && gen; gen /= 10) 664 *--wcp = gen % 10 + ''; 665 if (gen) { 666 conv = 0; 667 goto done; 668 } 669 for (i = 8; dn[--i] == ' ';); 670 i++; 671 if (gentext + sizeof(gentext) - wcp + 1 > 8 - i) 672 i = 8 - (gentext + sizeof(gentext) - wcp + 1); 673 /* 674 * Correct posision to where insert the generation number 675 */ 676 cp = dn; 677 i -= mbsadjpos((const char**)&cp, i, unlen, 1, pmp->pm_flags, pmp->pm_d2u); 678 679 dn[i++] = '~'; 680 while (wcp < gentext + sizeof(gentext)) 681 dn[i++] = *wcp++; 682 683 /* 684 * Tail of the filename should be space 685 */ 686 while (i < 8) 687 dn[i++] = ' '; 688 conv = 3; 689 690 done: 691 /* 692 * The first character cannot be E5, 693 * because that means a deleted entry 694 */ 695 if (dn[0] == 0xe5) 696 dn[0] = SLOT_E5; 697 698 return conv; 699 } 700 701 /* 702 * Create a Win95 long name directory entry 703 * Note: assumes that the filename is valid, 704 * i.e. doesn't consist solely of blanks and dots 705 */ 706 int 707 unix2winfn(un, unlen, wep, cnt, chksum, pmp) 708 const u_char *un; 709 size_t unlen; 710 struct winentry *wep; 711 int cnt; 712 int chksum; 713 struct msdosfsmount *pmp; 714 { 715 u_int8_t *wcp; 716 int i, end; 717 u_int16_t code; 718 719 /* 720 * Drop trailing blanks and dots 721 */ 722 unlen = winLenFixup(un, unlen); 723 724 /* 725 * Cut *un for this slot 726 */ 727 unlen = mbsadjpos((const char **)&un, unlen, (cnt - 1) * WIN_CHARS, 2, 728 pmp->pm_flags, pmp->pm_u2w); 729 730 /* 731 * Initialize winentry to some useful default 732 */ 733 for (wcp = (u_int8_t *)wep, i = sizeof(*wep); --i >= 0; *wcp++ = 0xff); 734 wep->weCnt = cnt; 735 wep->weAttributes = ATTR_WIN95; 736 wep->weReserved1 = 0; 737 wep->weChksum = chksum; 738 wep->weReserved2 = 0; 739 740 /* 741 * Now convert the filename parts 742 */ 743 end = 0; 744 for (wcp = wep->wePart1, i = sizeof(wep->wePart1)/2; --i >= 0 && !end;) { 745 code = unix2winchr(&un, &unlen, 0, pmp); 746 *wcp++ = code; 747 *wcp++ = code >> 8; 748 if (!code) 749 end = WIN_LAST; 750 } 751 for (wcp = wep->wePart2, i = sizeof(wep->wePart2)/2; --i >= 0 && !end;) { 752 code = unix2winchr(&un, &unlen, 0, pmp); 753 *wcp++ = code; 754 *wcp++ = code >> 8; 755 if (!code) 756 end = WIN_LAST; 757 } 758 for (wcp = wep->wePart3, i = sizeof(wep->wePart3)/2; --i >= 0 && !end;) { 759 code = unix2winchr(&un, &unlen, 0, pmp); 760 *wcp++ = code; 761 *wcp++ = code >> 8; 762 if (!code) 763 end = WIN_LAST; 764 } 765 if (*un == '\0') 766 end = WIN_LAST; 767 wep->weCnt |= end; 768 return !end; 769 } 770 771 /* 772 * Compare our filename to the one in the Win95 entry 773 * Returns the checksum or -1 if no match 774 */ 775 int 776 winChkName(un, unlen, chksum, pmp) 777 const u_char *un; 778 size_t unlen; 779 int chksum; 780 struct msdosfsmount *pmp; 781 { 782 size_t len; 783 u_int16_t c1, c2; 784 u_char *np; 785 struct dirent dirbuf; 786 787 /* 788 * We alread have winentry in mbnambuf 789 */ 790 if (!mbnambuf_flush(&dirbuf) || !dirbuf.d_namlen) 791 return -1; 792 793 #ifdef MSDOSFS_DEBUG 794 printf("winChkName(): un=%s:%d,d_name=%s:%d\n", un, unlen, 795 dirbuf.d_name, 796 dirbuf.d_namlen); 797 #endif 798 799 /* 800 * Compare the name parts 801 */ 802 len = dirbuf.d_namlen; 803 if (unlen != len) 804 return -2; 805 806 for (np = dirbuf.d_name; unlen > 0 && len > 0;) { 807 /* 808 * Comparison must be case insensitive, because FAT disallows 809 * to look up or create files in case sensitive even when 810 * it's a long file name. 811 */ 812 c1 = unix2winchr((const u_char **)&np, &len, LCASE_BASE, pmp); 813 c2 = unix2winchr(&un, &unlen, LCASE_BASE, pmp); 814 if (c1 != c2) 815 return -2; 816 } 817 return chksum; 818 } 819 820 /* 821 * Convert Win95 filename to dirbuf. 822 * Returns the checksum or -1 if impossible 823 */ 824 int 825 win2unixfn(wep, chksum, pmp) 826 struct winentry *wep; 827 int chksum; 828 struct msdosfsmount *pmp; 829 { 830 u_int8_t *cp; 831 u_int8_t *np, name[WIN_CHARS * 2 + 1]; 832 u_int16_t code; 833 int i; 834 835 if ((wep->weCnt&WIN_CNT) > howmany(WIN_MAXLEN, WIN_CHARS) 836 || !(wep->weCnt&WIN_CNT)) 837 return -1; 838 839 /* 840 * First compare checksums 841 */ 842 if (wep->weCnt&WIN_LAST) { 843 chksum = wep->weChksum; 844 } else if (chksum != wep->weChksum) 845 chksum = -1; 846 if (chksum == -1) 847 return -1; 848 849 /* 850 * Convert the name parts 851 */ 852 np = name; 853 for (cp = wep->wePart1, i = sizeof(wep->wePart1)/2; --i >= 0;) { 854 code = (cp[1] << 8) | cp[0]; 855 switch (code) { 856 case 0: 857 *np = '\0'; 858 mbnambuf_write(name, (wep->weCnt & WIN_CNT) - 1); 859 return chksum; 860 case '/': 861 *np = '\0'; 862 return -1; 863 default: 864 code = win2unixchr(code, pmp); 865 if (code & 0xff00) 866 *np++ = code >> 8; 867 *np++ = code; 868 break; 869 } 870 cp += 2; 871 } 872 for (cp = wep->wePart2, i = sizeof(wep->wePart2)/2; --i >= 0;) { 873 code = (cp[1] << 8) | cp[0]; 874 switch (code) { 875 case 0: 876 *np = '\0'; 877 mbnambuf_write(name, (wep->weCnt & WIN_CNT) - 1); 878 return chksum; 879 case '/': 880 *np = '\0'; 881 return -1; 882 default: 883 code = win2unixchr(code, pmp); 884 if (code & 0xff00) 885 *np++ = code >> 8; 886 *np++ = code; 887 break; 888 } 889 cp += 2; 890 } 891 for (cp = wep->wePart3, i = sizeof(wep->wePart3)/2; --i >= 0;) { 892 code = (cp[1] << 8) | cp[0]; 893 switch (code) { 894 case 0: 895 *np = '\0'; 896 mbnambuf_write(name, (wep->weCnt & WIN_CNT) - 1); 897 return chksum; 898 case '/': 899 *np = '\0'; 900 return -1; 901 default: 902 code = win2unixchr(code, pmp); 903 if (code & 0xff00) 904 *np++ = code >> 8; 905 *np++ = code; 906 break; 907 } 908 cp += 2; 909 } 910 *np = '\0'; 911 mbnambuf_write(name, (wep->weCnt & WIN_CNT) - 1); 912 return chksum; 913 } 914 915 /* 916 * Compute the unrolled checksum of a DOS filename for Win95 LFN use. 917 */ 918 u_int8_t 919 winChksum(name) 920 u_int8_t *name; 921 { 922 u_int8_t s; 923 924 s = name[0]; 925 s = ((s << 7) | (s >> 1)) + name[1]; 926 s = ((s << 7) | (s >> 1)) + name[2]; 927 s = ((s << 7) | (s >> 1)) + name[3]; 928 s = ((s << 7) | (s >> 1)) + name[4]; 929 s = ((s << 7) | (s >> 1)) + name[5]; 930 s = ((s << 7) | (s >> 1)) + name[6]; 931 s = ((s << 7) | (s >> 1)) + name[7]; 932 s = ((s << 7) | (s >> 1)) + name[8]; 933 s = ((s << 7) | (s >> 1)) + name[9]; 934 s = ((s << 7) | (s >> 1)) + name[10]; 935 936 return (s); 937 } 938 939 /* 940 * Determine the number of slots necessary for Win95 names 941 */ 942 int 943 winSlotCnt(un, unlen, pmp) 944 const u_char *un; 945 size_t unlen; 946 struct msdosfsmount *pmp; 947 { 948 size_t wlen; 949 char wn[WIN_MAXLEN * 2 + 1], *wnp; 950 951 unlen = winLenFixup(un, unlen); 952 953 if (pmp->pm_flags & MSDOSFSMNT_KICONV && msdosfs_iconv) { 954 wlen = WIN_MAXLEN * 2; 955 wnp = wn; 956 msdosfs_iconv->conv(pmp->pm_u2w, (const char **)&un, &unlen, &wnp, &wlen); 957 if (unlen > 0) 958 return 0; 959 return howmany(WIN_MAXLEN - wlen/2, WIN_CHARS); 960 } 961 962 if (unlen > WIN_MAXLEN) 963 return 0; 964 return howmany(unlen, WIN_CHARS); 965 } 966 967 /* 968 * Determine the number of bytes neccesary for Win95 names 969 */ 970 size_t 971 winLenFixup(un, unlen) 972 const u_char* un; 973 size_t unlen; 974 { 975 for (un += unlen; unlen > 0; unlen--) 976 if (*--un != ' ' && *un != '.') 977 break; 978 return unlen; 979 } 980 981 /* 982 * Store an area with multi byte string instr, and reterns left 983 * byte of instr and moves pointer forward. The area's size is 984 * inlen or outlen. 985 */ 986 static int 987 mbsadjpos(const char **instr, size_t inlen, size_t outlen, int weight, int flag, void *handle) 988 { 989 char *outp, outstr[outlen * weight + 1]; 990 991 if (flag & MSDOSFSMNT_KICONV && msdosfs_iconv) { 992 outp = outstr; 993 outlen *= weight; 994 msdosfs_iconv->conv(handle, instr, &inlen, &outp, &outlen); 995 return (inlen); 996 } 997 998 (*instr) += min(inlen, outlen); 999 return (inlen - min(inlen, outlen)); 1000 } 1001 1002 /* 1003 * Convert DOS char to Local char 1004 */ 1005 static u_int16_t 1006 dos2unixchr(const u_char **instr, size_t *ilen, int lower, struct msdosfsmount *pmp) 1007 { 1008 u_char c; 1009 char *outp, outbuf[3]; 1010 u_int16_t wc; 1011 size_t len, olen; 1012 1013 if (pmp->pm_flags & MSDOSFSMNT_KICONV && msdosfs_iconv) { 1014 olen = len = 2; 1015 outp = outbuf; 1016 1017 if (lower & (LCASE_BASE | LCASE_EXT)) 1018 msdosfs_iconv->convchr_case(pmp->pm_d2u, (const char **)instr, 1019 ilen, &outp, &olen, KICONV_LOWER); 1020 else 1021 msdosfs_iconv->convchr(pmp->pm_d2u, (const char **)instr, 1022 ilen, &outp, &olen); 1023 len -= olen; 1024 1025 /* 1026 * return '?' if failed to convert 1027 */ 1028 if (len == 0) { 1029 (*ilen)--; 1030 (*instr)++; 1031 return ('?'); 1032 } 1033 1034 wc = 0; 1035 while(len--) 1036 wc |= (*(outp - len - 1) & 0xff) << (len << 3); 1037 return (wc); 1038 } 1039 1040 (*ilen)--; 1041 c = *(*instr)++; 1042 c = dos2unix[c]; 1043 if (lower & (LCASE_BASE | LCASE_EXT)) 1044 c = u2l[c]; 1045 return ((u_int16_t)c); 1046 } 1047 1048 /* 1049 * Convert Local char to DOS char 1050 */ 1051 static u_int16_t 1052 unix2doschr(const u_char **instr, size_t *ilen, struct msdosfsmount *pmp) 1053 { 1054 u_char c; 1055 char *up, *outp, unicode[3], outbuf[3]; 1056 u_int16_t wc; 1057 size_t len, ucslen, unixlen, olen; 1058 1059 if (pmp->pm_flags & MSDOSFSMNT_KICONV && msdosfs_iconv) { 1060 /* 1061 * to hide an invisible character, using a unicode filter 1062 */ 1063 ucslen = 2; 1064 len = *ilen; 1065 up = unicode; 1066 msdosfs_iconv->convchr(pmp->pm_u2w, (const char **)instr, 1067 ilen, &up, &ucslen); 1068 unixlen = len - *ilen; 1069 1070 /* 1071 * cannot be converted 1072 */ 1073 if (unixlen == 0) { 1074 (*ilen)--; 1075 (*instr)++; 1076 return (0); 1077 } 1078 1079 /* 1080 * return magic number for ascii char 1081 */ 1082 if (unixlen == 1) { 1083 c = *(*instr -1); 1084 if (! (c & 0x80)) { 1085 c = unix2dos[c]; 1086 if (c <= 2) 1087 return (c); 1088 } 1089 } 1090 1091 /* 1092 * now convert using libiconv 1093 */ 1094 *instr -= unixlen; 1095 *ilen = len; 1096 1097 olen = len = 2; 1098 outp = outbuf; 1099 msdosfs_iconv->convchr_case(pmp->pm_u2d, (const char **)instr, 1100 ilen, &outp, &olen, KICONV_FROM_UPPER); 1101 len -= olen; 1102 1103 /* 1104 * cannot be converted, but has unicode char, should return magic number 1105 */ 1106 if (len == 0) { 1107 (*ilen) -= unixlen; 1108 (*instr) += unixlen; 1109 return (1); 1110 } 1111 1112 wc = 0; 1113 while(len--) 1114 wc |= (*(outp - len - 1) & 0xff) << (len << 3); 1115 return (wc); 1116 } 1117 1118 (*ilen)--; 1119 c = *(*instr)++; 1120 c = l2u[c]; 1121 c = unix2dos[c]; 1122 return ((u_int16_t)c); 1123 } 1124 1125 /* 1126 * Convert Windows char to Local char 1127 */ 1128 static u_int16_t 1129 win2unixchr(u_int16_t wc, struct msdosfsmount *pmp) 1130 { 1131 u_char *inp, *outp, inbuf[3], outbuf[3]; 1132 size_t ilen, olen, len; 1133 1134 if (wc == 0) 1135 return (0); 1136 1137 if (pmp->pm_flags & MSDOSFSMNT_KICONV && msdosfs_iconv) { 1138 inbuf[0] = (u_char)(wc>>8); 1139 inbuf[1] = (u_char)wc; 1140 inbuf[2] = '\0'; 1141 1142 ilen = olen = len = 2; 1143 inp = inbuf; 1144 outp = outbuf; 1145 msdosfs_iconv->convchr(pmp->pm_w2u, (const char **)&inp, &ilen, 1146 (char **)&outp, &olen); 1147 len -= olen; 1148 1149 /* 1150 * return '?' if failed to convert 1151 */ 1152 if (len == 0) { 1153 wc = '?'; 1154 return (wc); 1155 } 1156 1157 wc = 0; 1158 while(len--) 1159 wc |= (*(outp - len - 1) & 0xff) << (len << 3); 1160 return (wc); 1161 } 1162 1163 if (wc & 0xff00) 1164 wc = '?'; 1165 1166 return (wc); 1167 } 1168 1169 /* 1170 * Convert Local char to Windows char 1171 */ 1172 static u_int16_t 1173 unix2winchr(const u_char **instr, size_t *ilen, int lower, struct msdosfsmount *pmp) 1174 { 1175 u_char *outp, outbuf[3]; 1176 u_int16_t wc; 1177 size_t olen; 1178 1179 if (*ilen == 0) 1180 return (0); 1181 1182 if (pmp->pm_flags & MSDOSFSMNT_KICONV && msdosfs_iconv) { 1183 outp = outbuf; 1184 olen = 2; 1185 if (lower & (LCASE_BASE | LCASE_EXT)) 1186 msdosfs_iconv->convchr_case(pmp->pm_u2w, (const char **)instr, 1187 ilen, (char **)&outp, &olen, 1188 KICONV_FROM_LOWER); 1189 else 1190 msdosfs_iconv->convchr(pmp->pm_u2w, (const char **)instr, 1191 ilen, (char **)&outp, &olen); 1192 1193 /* 1194 * return '' if end of filename 1195 */ 1196 if (olen == 2) 1197 return (0); 1198 1199 wc = (outbuf[0]<<8) | outbuf[1]; 1200 1201 return (wc); 1202 } 1203 1204 (*ilen)--; 1205 wc = (*instr)[0]; 1206 if (lower & (LCASE_BASE | LCASE_EXT)) 1207 wc = u2l[wc]; 1208 (*instr)++; 1209 return (wc); 1210 } 1211 1212 /* 1213 * Initialize the temporary concatenation buffer (once) and mark it as 1214 * empty on subsequent calls. 1215 */ 1216 void 1217 mbnambuf_init(void) 1218 { 1219 1220 if (nambuf_ptr == NULL) { 1221 nambuf_ptr = malloc(MAXNAMLEN + 1, M_MSDOSFSMNT, M_WAITOK); 1222 nambuf_ptr[MAXNAMLEN] = '\0'; 1223 } 1224 nambuf_len = 0; 1225 nambuf_last_id = -1; 1226 } 1227 1228 /* 1229 * Fill out our concatenation buffer with the given substring, at the offset 1230 * specified by its id. Since this function must be called with ids in 1231 * descending order, we take advantage of the fact that ASCII substrings are 1232 * exactly WIN_CHARS in length. For non-ASCII substrings, we shift all 1233 * previous (i.e. higher id) substrings upwards to make room for this one. 1234 * This only penalizes portions of substrings that contain more than 1235 * WIN_CHARS bytes when they are first encountered. 1236 */ 1237 void 1238 mbnambuf_write(char *name, int id) 1239 { 1240 size_t count; 1241 char *slot; 1242 1243 KASSERT(nambuf_len == 0 || id == nambuf_last_id - 1, 1244 ("non-decreasing id, id %d last id %d", id, nambuf_last_id)); 1245 1246 /* Store this substring in a WIN_CHAR-aligned slot. */ 1247 slot = nambuf_ptr + (id * WIN_CHARS); 1248 count = strlen(name); 1249 if (nambuf_len + count > MAXNAMLEN) { 1250 printf("msdosfs: file name %zu too long\n", nambuf_len + count); 1251 return; 1252 } 1253 1254 /* Shift suffix upwards by the amount length exceeds WIN_CHARS. */ 1255 if (count > WIN_CHARS && nambuf_len != 0) 1256 bcopy(slot + WIN_CHARS, slot + count, nambuf_len); 1257 1258 /* Copy in the substring to its slot and update length so far. */ 1259 bcopy(name, slot, count); 1260 nambuf_len += count; 1261 nambuf_last_id = id; 1262 } 1263 1264 /* 1265 * Take the completed string and use it to setup the struct dirent. 1266 * Be sure to always nul-terminate the d_name and then copy the string 1267 * from our buffer. Note that this function assumes the full string has 1268 * been reassembled in the buffer. If it's called before all substrings 1269 * have been written via mbnambuf_write(), the result will be incorrect. 1270 */ 1271 char * 1272 mbnambuf_flush(struct dirent *dp) 1273 { 1274 1275 if (nambuf_len > sizeof(dp->d_name) - 1) { 1276 mbnambuf_init(); 1277 return (NULL); 1278 } 1279 bcopy(nambuf_ptr, dp->d_name, nambuf_len); 1280 dp->d_name[nambuf_len] = '\0'; 1281 dp->d_namlen = nambuf_len; 1282 1283 mbnambuf_init(); 1284 return (dp->d_name); 1285 }
Cache object: d20854bcff6f1fc19f498dabafab30b4
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]