1 /* $NetBSD: msdosfs_conv.c,v 1.9 2013/01/26 16:51:51 christos Exp $ */ 2 3 /*- 4 * Copyright (C) 1995, 1997 Wolfgang Solfrank. 5 * Copyright (C) 1995, 1997 TooLs GmbH. 6 * All rights reserved. 7 * Original code by Paul Popelka (paulp@uts.amdahl.com) (see below). 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. All advertising materials mentioning features or use of this software 18 * must display the following acknowledgement: 19 * This product includes software developed by TooLs GmbH. 20 * 4. The name of TooLs GmbH may not be used to endorse or promote products 21 * derived from this software without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR 24 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 25 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 26 * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 27 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 28 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 29 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 30 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 31 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 32 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 33 */ 34 /* 35 * Written by Paul Popelka (paulp@uts.amdahl.com) 36 * 37 * You can do anything you want with this software, just don't say you wrote 38 * it, and don't remove this notice. 39 * 40 * This software is provided "as is". 41 * 42 * The author supplies this software to be publicly redistributed on the 43 * understanding that the author is not responsible for the correct 44 * functioning of this software in any circumstances and is not liable for 45 * any damages caused by this software. 46 * 47 * October 1992 48 */ 49 50 #if HAVE_NBTOOL_CONFIG_H 51 #include "nbtool_config.h" 52 #endif 53 54 #include <sys/cdefs.h> 55 __KERNEL_RCSID(0, "$NetBSD: msdosfs_conv.c,v 1.9 2013/01/26 16:51:51 christos Exp $"); 56 57 /* 58 * System include files. 59 */ 60 #include <sys/param.h> 61 #include <sys/time.h> 62 #ifdef _KERNEL 63 #include <sys/dirent.h> 64 #include <sys/systm.h> 65 #include <sys/kernel.h> 66 #include <sys/vnode.h> 67 #else 68 #include <stdio.h> 69 #include <dirent.h> 70 #include <sys/queue.h> 71 #endif 72 73 /* 74 * MSDOSFS include files. 75 */ 76 #include <fs/msdosfs/direntry.h> 77 #include <fs/msdosfs/denode.h> 78 79 /* 80 * Days in each month in a regular year. 81 */ 82 u_short const regyear[] = { 83 31, 28, 31, 30, 31, 30, 84 31, 31, 30, 31, 30, 31 85 }; 86 87 /* 88 * Days in each month in a leap year. 89 */ 90 u_short const leapyear[] = { 91 31, 29, 31, 30, 31, 30, 92 31, 31, 30, 31, 30, 31 93 }; 94 95 /* 96 * Variables used to remember parts of the last time conversion. Maybe we 97 * can avoid a full conversion. 98 */ 99 u_long lasttime; 100 u_long lastday; 101 u_short lastddate; 102 u_short lastdtime; 103 104 /* 105 * Convert the unix version of time to dos's idea of time to be used in 106 * file timestamps. The passed in unix time is assumed to be in GMT. 107 */ 108 void 109 unix2dostime(const struct timespec *tsp, int gmtoff, u_int16_t *ddp, u_int16_t *dtp, u_int8_t *dhp) 110 { 111 u_long t; 112 u_long days; 113 u_long inc; 114 u_long year; 115 u_long month; 116 const u_short *months; 117 118 /* 119 * If the time from the last conversion is the same as now, then 120 * skip the computations and use the saved result. 121 */ 122 t = tsp->tv_sec + gmtoff; /* time zone correction */ 123 t &= ~1; 124 if (lasttime != t) { 125 lasttime = t; 126 lastdtime = (((t / 2) % 30) << DT_2SECONDS_SHIFT) 127 + (((t / 60) % 60) << DT_MINUTES_SHIFT) 128 + (((t / 3600) % 24) << DT_HOURS_SHIFT); 129 130 /* 131 * If the number of days since 1970 is the same as the last 132 * time we did the computation then skip all this leap year 133 * and month stuff. 134 */ 135 days = t / (24 * 60 * 60); 136 if (days != lastday) { 137 lastday = days; 138 for (year = 1970;; year++) { 139 inc = year & 0x03 ? 365 : 366; 140 if (days < inc) 141 break; 142 days -= inc; 143 } 144 months = year & 0x03 ? regyear : leapyear; 145 for (month = 0; month < 12; month++) { 146 if (days < months[month]) 147 break; 148 days -= months[month]; 149 } 150 lastddate = ((days + 1) << DD_DAY_SHIFT) 151 + ((month + 1) << DD_MONTH_SHIFT); 152 /* 153 * Remember dos's idea of time is relative to 1980. 154 * unix's is relative to 1970. If somehow we get a 155 * time before 1980 then don't give totally crazy 156 * results. 157 */ 158 if (year > 1980) 159 lastddate += (year - 1980) << DD_YEAR_SHIFT; 160 } 161 } 162 if (dtp) 163 *dtp = lastdtime; 164 if (dhp) 165 *dhp = (tsp->tv_sec & 1) * 100 + tsp->tv_nsec / 10000000; 166 167 *ddp = lastddate; 168 } 169 170 /* 171 * The number of seconds between Jan 1, 1970 and Jan 1, 1980. In that 172 * interval there were 8 regular years and 2 leap years. 173 */ 174 #define SECONDSTO1980 (((8 * 365) + (2 * 366)) * (24 * 60 * 60)) 175 176 u_short lastdosdate; 177 u_long lastseconds; 178 179 /* 180 * Convert from dos' idea of time to unix'. This will probably only be 181 * called from the stat(), and fstat() system calls and so probably need 182 * not be too efficient. 183 */ 184 void 185 dos2unixtime(u_int dd, u_int dt, u_int dh, int gmtoff, struct timespec *tsp) 186 { 187 u_long seconds; 188 u_long m, month; 189 u_long y, year; 190 u_long days; 191 const u_short *months; 192 193 if (dd == 0) { 194 /* 195 * Uninitialized field, return the epoch. 196 */ 197 tsp->tv_sec = 0; 198 tsp->tv_nsec = 0; 199 return; 200 } 201 seconds = ((dt & DT_2SECONDS_MASK) >> DT_2SECONDS_SHIFT) * 2 202 + ((dt & DT_MINUTES_MASK) >> DT_MINUTES_SHIFT) * 60 203 + ((dt & DT_HOURS_MASK) >> DT_HOURS_SHIFT) * 3600 204 + dh / 100; 205 /* 206 * If the year, month, and day from the last conversion are the 207 * same then use the saved value. 208 */ 209 if (lastdosdate != dd) { 210 lastdosdate = dd; 211 days = 0; 212 year = (dd & DD_YEAR_MASK) >> DD_YEAR_SHIFT; 213 for (y = 0; y < year; y++) 214 days += y & 0x03 ? 365 : 366; 215 months = year & 0x03 ? regyear : leapyear; 216 /* 217 * Prevent going from 0 to 0xffffffff in the following 218 * loop. 219 */ 220 month = (dd & DD_MONTH_MASK) >> DD_MONTH_SHIFT; 221 if (month == 0) { 222 printf("%s: month value out of range (%ld)\n", 223 __func__, month); 224 month = 1; 225 } 226 for (m = 0; m < month - 1; m++) 227 days += months[m]; 228 days += ((dd & DD_DAY_MASK) >> DD_DAY_SHIFT) - 1; 229 lastseconds = (days * 24 * 60 * 60) + SECONDSTO1980; 230 } 231 tsp->tv_sec = seconds + lastseconds; 232 tsp->tv_sec -= gmtoff; /* time zone correction */ 233 tsp->tv_nsec = (dh % 100) * 10000000; 234 } 235 236 static const u_char 237 unix2dos[256] = { 238 0, 0, 0, 0, 0, 0, 0, 0, /* 00-07 */ 239 0, 0, 0, 0, 0, 0, 0, 0, /* 08-0f */ 240 0, 0, 0, 0, 0, 0, 0, 0, /* 10-17 */ 241 0, 0, 0, 0, 0, 0, 0, 0, /* 18-1f */ 242 0, '!', 0, '#', '$', '%', '&', '\'', /* 20-27 */ 243 '(', ')', 0, '+', 0, '-', 0, 0, /* 28-2f */ 244 '0', '1', '2', '3', '4', '5', '6', '7', /* 30-37 */ 245 '8', '9', 0, 0, 0, 0, 0, 0, /* 38-3f */ 246 '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G', /* 40-47 */ 247 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', /* 48-4f */ 248 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', /* 50-57 */ 249 'X', 'Y', 'Z', 0, 0, 0, '^', '_', /* 58-5f */ 250 '`', 'A', 'B', 'C', 'D', 'E', 'F', 'G', /* 60-67 */ 251 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', /* 68-6f */ 252 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', /* 70-77 */ 253 'X', 'Y', 'Z', '{', 0, '}', '~', 0, /* 78-7f */ 254 0, 0, 0, 0, 0, 0, 0, 0, /* 80-87 */ 255 0, 0, 0, 0, 0, 0, 0, 0, /* 88-8f */ 256 0, 0, 0, 0, 0, 0, 0, 0, /* 90-97 */ 257 0, 0, 0, 0, 0, 0, 0, 0, /* 98-9f */ 258 0, 0xad, 0xbd, 0x9c, 0xcf, 0xbe, 0xdd, 0xf5, /* a0-a7 */ 259 0xf9, 0xb8, 0xa6, 0xae, 0xaa, 0xf0, 0xa9, 0xee, /* a8-af */ 260 0xf8, 0xf1, 0xfd, 0xfc, 0xef, 0xe6, 0xf4, 0xfa, /* b0-b7 */ 261 0xf7, 0xfb, 0xa7, 0xaf, 0xac, 0xab, 0xf3, 0xa8, /* b8-bf */ 262 0xb7, 0xb5, 0xb6, 0xc7, 0x8e, 0x8f, 0x92, 0x80, /* c0-c7 */ 263 0xd4, 0x90, 0xd2, 0xd3, 0xde, 0xd6, 0xd7, 0xd8, /* c8-cf */ 264 0xd1, 0xa5, 0xe3, 0xe0, 0xe2, 0xe5, 0x99, 0x9e, /* d0-d7 */ 265 0x9d, 0xeb, 0xe9, 0xea, 0x9a, 0xed, 0xe8, 0xe1, /* d8-df */ 266 0xb7, 0xb5, 0xb6, 0xc7, 0x8e, 0x8f, 0x92, 0x80, /* e0-e7 */ 267 0xd4, 0x90, 0xd2, 0xd3, 0xde, 0xd6, 0xd7, 0xd8, /* e8-ef */ 268 0xd1, 0xa5, 0xe3, 0xe0, 0xe2, 0xe5, 0x99, 0xf6, /* f0-f7 */ 269 0x9d, 0xeb, 0xe9, 0xea, 0x9a, 0xed, 0xe8, 0x98, /* f8-ff */ 270 }; 271 272 static const u_char 273 dos2unix[256] = { 274 '?', '?', '?', '?', '?', '?', '?', '?', /* 00-07 */ 275 '?', '?', '?', '?', '?', '?', '?', '?', /* 08-0f */ 276 '?', '?', '?', '?', '?', '?', '?', '?', /* 10-17 */ 277 '?', '?', '?', '?', '?', '?', '?', '?', /* 18-1f */ 278 ' ', '!', '"', '#', '$', '%', '&', '\'', /* 20-27 */ 279 '(', ')', '*', '+', ',', '-', '.', '/', /* 28-2f */ 280 '0', '1', '2', '3', '4', '5', '6', '7', /* 30-37 */ 281 '8', '9', ':', ';', '<', '=', '>', '?', /* 38-3f */ 282 '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G', /* 40-47 */ 283 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', /* 48-4f */ 284 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', /* 50-57 */ 285 'X', 'Y', 'Z', '[', '\\', ']', '^', '_', /* 58-5f */ 286 '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', /* 60-67 */ 287 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', /* 68-6f */ 288 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', /* 70-77 */ 289 'x', 'y', 'z', '{', '|', '}', '~', 0x7f, /* 78-7f */ 290 0xc7, 0xfc, 0xe9, 0xe2, 0xe4, 0xe0, 0xe5, 0xe7, /* 80-87 */ 291 0xea, 0xeb, 0xe8, 0xef, 0xee, 0xec, 0xc4, 0xc5, /* 88-8f */ 292 0xc9, 0xe6, 0xc6, 0xf4, 0xf6, 0xf2, 0xfb, 0xf9, /* 90-97 */ 293 0xff, 0xd6, 0xdc, 0xf8, 0xa3, 0xd8, 0xd7, '?', /* 98-9f */ 294 0xe1, 0xed, 0xf3, 0xfa, 0xf1, 0xd1, 0xaa, 0xba, /* a0-a7 */ 295 0xbf, 0xae, 0xac, 0xbd, 0xbc, 0xa1, 0xab, 0xbb, /* a8-af */ 296 '?', '?', '?', '?', '?', 0xc1, 0xc2, 0xc0, /* b0-b7 */ 297 0xa9, '?', '?', '?', '?', 0xa2, 0xa5, '?', /* b8-bf */ 298 '?', '?', '?', '?', '?', '?', 0xe3, 0xc3, /* c0-c7 */ 299 '?', '?', '?', '?', '?', '?', '?', 0xa4, /* c8-cf */ 300 0xf0, 0xd0, 0xca, 0xcb, 0xc8, '?', 0xcd, 0xce, /* d0-d7 */ 301 0xcf, '?', '?', '?', '?', 0xa6, 0xcc, '?', /* d8-df */ 302 0xd3, 0xdf, 0xd4, 0xd2, 0xf5, 0xd5, 0xb5, 0xfe, /* e0-e7 */ 303 0xde, 0xda, 0xdb, 0xd9, 0xfd, 0xdd, 0xaf, 0x3f, /* e8-ef */ 304 0xad, 0xb1, '?', 0xbe, 0xb6, 0xa7, 0xf7, 0xb8, /* f0-f7 */ 305 0xb0, 0xa8, 0xb7, 0xb9, 0xb3, 0xb2, '?', '?', /* f8-ff */ 306 }; 307 308 static const u_char 309 u2l[256] = { 310 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, /* 00-07 */ 311 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, /* 08-0f */ 312 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, /* 10-17 */ 313 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, /* 18-1f */ 314 ' ', '!', '"', '#', '$', '%', '&', '\'', /* 20-27 */ 315 '(', ')', '*', '+', ',', '-', '.', '/', /* 28-2f */ 316 '0', '1', '2', '3', '4', '5', '6', '7', /* 30-37 */ 317 '8', '9', ':', ';', '<', '=', '>', '?', /* 38-3f */ 318 '@', 'a', 'b', 'c', 'd', 'e', 'f', 'g', /* 40-47 */ 319 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', /* 48-4f */ 320 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', /* 50-57 */ 321 'x', 'y', 'z', '[', '\\', ']', '^', '_', /* 58-5f */ 322 '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', /* 60-67 */ 323 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', /* 68-6f */ 324 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', /* 70-77 */ 325 'x', 'y', 'z', '{', '|', '}', '~', 0x7f, /* 78-7f */ 326 0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, /* 80-87 */ 327 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f, /* 88-8f */ 328 0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, /* 90-97 */ 329 0x98, 0x99, 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, /* 98-9f */ 330 0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7, /* a0-a7 */ 331 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf, /* a8-af */ 332 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, /* b0-b7 */ 333 0xb8, 0xb9, 0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, /* b8-bf */ 334 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* c0-c7 */ 335 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* c8-cf */ 336 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xd7, /* d0-d7 */ 337 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xdf, /* d8-df */ 338 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* e0-e7 */ 339 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* e8-ef */ 340 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, /* f0-f7 */ 341 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff, /* f8-ff */ 342 }; 343 344 /* 345 * DOS filenames are made of 2 parts, the name part and the extension part. 346 * The name part is 8 characters long and the extension part is 3 347 * characters long. They may contain trailing blanks if the name or 348 * extension are not long enough to fill their respective fields. 349 */ 350 351 /* 352 * Convert a DOS filename to a unix filename. And, return the number of 353 * characters in the resulting unix filename excluding the terminating 354 * null. 355 */ 356 int 357 dos2unixfn(u_char dn[11], u_char *un, int lower) 358 { 359 int i, j; 360 int thislong = 1; 361 u_char c; 362 363 /* 364 * If first char of the filename is SLOT_E5 (0x05), then the real 365 * first char of the filename should be 0xe5. But, they couldn't 366 * just have a 0xe5 mean 0xe5 because that is used to mean a freed 367 * directory slot. Another dos quirk. 368 */ 369 if (*dn == SLOT_E5) 370 c = dos2unix[0xe5]; 371 else 372 c = dos2unix[*dn]; 373 *un++ = lower ? u2l[c] : c; 374 375 /* 376 * Copy the rest into the unix filename string, ignoring 377 * trailing blanks. 378 */ 379 380 for (j=7; (j >= 0) && (dn[j] == ' '); j--) 381 ; 382 383 for (i = 1; i <= j; i++) { 384 c = dos2unix[dn[i]]; 385 *un++ = lower ? u2l[c] : c; 386 thislong++; 387 } 388 dn += 8; 389 390 /* 391 * Now, if there is an extension then put in a period and copy in 392 * the extension. 393 */ 394 if (*dn != ' ') { 395 *un++ = '.'; 396 thislong++; 397 for (i = 0; i < 3 && *dn != ' '; i++) { 398 c = dos2unix[*dn++]; 399 *un++ = lower ? u2l[c] : c; 400 thislong++; 401 } 402 } 403 *un++ = 0; 404 405 return (thislong); 406 } 407 408 /* 409 * Convert a unix filename to a DOS filename according to Win95 rules. 410 * If applicable and gen is not 0, it is inserted into the converted 411 * filename as a generation number. 412 * Returns 413 * 0 if name couldn't be converted 414 * 1 if the converted name is the same as the original 415 * (no long filename entry necessary for Win95) 416 * 2 if conversion was successful 417 * 3 if conversion was successful and generation number was inserted 418 */ 419 int 420 unix2dosfn(const u_char *un, u_char dn[12], int unlen, u_int gen) 421 { 422 int i, j, l; 423 int conv = 1; 424 const u_char *cp, *dp, *dp1; 425 u_char gentext[6], *wcp; 426 int shortlen; 427 428 /* 429 * Fill the dos filename string with blanks. These are DOS's pad 430 * characters. 431 */ 432 for (i = 0; i < 11; i++) 433 dn[i] = ' '; 434 dn[11] = 0; 435 436 /* 437 * The filenames "." and ".." are handled specially, since they 438 * don't follow dos filename rules. 439 */ 440 if (un[0] == '.' && unlen == 1) { 441 dn[0] = '.'; 442 return gen <= 1; 443 } 444 if (un[0] == '.' && un[1] == '.' && unlen == 2) { 445 dn[0] = '.'; 446 dn[1] = '.'; 447 return gen <= 1; 448 } 449 450 /* 451 * Filenames with only blanks and dots are not allowed! 452 */ 453 for (cp = un, i = unlen; --i >= 0; cp++) 454 if (*cp != ' ' && *cp != '.') 455 break; 456 if (i < 0) 457 return 0; 458 459 /* 460 * Now find the extension 461 * Note: dot as first char doesn't start extension 462 * and trailing dots and blanks are ignored 463 */ 464 dp = dp1 = 0; 465 for (cp = un + 1, i = unlen - 1; --i >= 0;) { 466 switch (*cp++) { 467 case '.': 468 if (!dp1) 469 dp1 = cp; 470 break; 471 case ' ': 472 break; 473 default: 474 if (dp1) 475 dp = dp1; 476 dp1 = 0; 477 break; 478 } 479 } 480 481 /* 482 * Now convert it 483 */ 484 if (dp) { 485 if (dp1) 486 l = dp1 - dp; 487 else 488 l = unlen - (dp - un); 489 for (i = 0, j = 8; i < l && j < 11; i++, j++) { 490 if (dp[i] != (dn[j] = unix2dos[dp[i]]) 491 && conv != 3) 492 conv = 2; 493 if (!dn[j]) { 494 conv = 3; 495 dn[j--] = ' '; 496 } 497 } 498 if (i < l) 499 conv = 3; 500 dp--; 501 } else { 502 for (dp = cp; *--dp == ' ' || *dp == '.';); 503 dp++; 504 } 505 506 shortlen = (dp - un) <= 8; 507 508 /* 509 * Now convert the rest of the name 510 */ 511 for (i = j = 0; un < dp && j < 8; i++, j++, un++) { 512 if ((*un == ' ') && shortlen) 513 dn[j] = ' '; 514 else 515 dn[j] = unix2dos[*un]; 516 if ((*un != dn[j]) 517 && conv != 3) 518 conv = 2; 519 if (!dn[j]) { 520 conv = 3; 521 dn[j--] = ' '; 522 } 523 } 524 if (un < dp) 525 conv = 3; 526 /* 527 * If we didn't have any chars in filename, 528 * generate a default 529 */ 530 if (!j) 531 dn[0] = '_'; 532 533 /* 534 * The first character cannot be E5, 535 * because that means a deleted entry 536 */ 537 if (dn[0] == 0xe5) 538 dn[0] = SLOT_E5; 539 540 /* 541 * If there wasn't any char dropped, 542 * there is no place for generation numbers 543 */ 544 if (conv != 3) { 545 if (gen > 1) 546 return 0; 547 return conv; 548 } 549 550 /* 551 * Now insert the generation number into the filename part 552 */ 553 for (wcp = gentext + sizeof(gentext); wcp > gentext && gen; gen /= 10) 554 *--wcp = gen % 10 + '0'; 555 if (gen) 556 return 0; 557 for (i = 8; dn[--i] == ' ';); 558 i++; 559 if (gentext + sizeof(gentext) - wcp + 1 > 8 - i) 560 i = 8 - (gentext + sizeof(gentext) - wcp + 1); 561 dn[i++] = '~'; 562 while (wcp < gentext + sizeof(gentext)) 563 dn[i++] = *wcp++; 564 return 3; 565 } 566 567 /* 568 * Create a Win95 long name directory entry 569 * Note: assumes that the filename is valid, 570 * i.e. doesn't consist solely of blanks and dots 571 */ 572 int 573 unix2winfn(const u_char *un, int unlen, struct winentry *wep, int cnt, int chksum) 574 { 575 const u_int8_t *cp; 576 u_int8_t *wcp; 577 int i; 578 579 /* 580 * Drop trailing blanks and dots 581 */ 582 for (cp = un + unlen; *--cp == ' ' || *cp == '.'; unlen--); 583 584 un += (cnt - 1) * WIN_CHARS; 585 unlen -= (cnt - 1) * WIN_CHARS; 586 587 /* 588 * Initialize winentry to some useful default 589 */ 590 for (wcp = (u_int8_t *)wep, i = sizeof(*wep); --i >= 0; *wcp++ = 0xff); 591 wep->weCnt = cnt; 592 wep->weAttributes = ATTR_WIN95; 593 wep->weReserved1 = 0; 594 wep->weChksum = chksum; 595 wep->weReserved2 = 0; 596 597 /* 598 * Now convert the filename parts 599 */ 600 for (wcp = wep->wePart1, i = sizeof(wep->wePart1)/2; --i >= 0;) { 601 if (--unlen < 0) 602 goto done; 603 *wcp++ = *un++; 604 *wcp++ = 0; 605 } 606 for (wcp = wep->wePart2, i = sizeof(wep->wePart2)/2; --i >= 0;) { 607 if (--unlen < 0) 608 goto done; 609 *wcp++ = *un++; 610 *wcp++ = 0; 611 } 612 for (wcp = wep->wePart3, i = sizeof(wep->wePart3)/2; --i >= 0;) { 613 if (--unlen < 0) 614 goto done; 615 *wcp++ = *un++; 616 *wcp++ = 0; 617 } 618 if (!unlen) 619 wep->weCnt |= WIN_LAST; 620 return unlen; 621 622 done: 623 *wcp++ = 0; 624 *wcp++ = 0; 625 wep->weCnt |= WIN_LAST; 626 return 0; 627 } 628 629 /* 630 * Compare our filename to the one in the Win95 entry 631 * Returns the checksum or -1 if no match 632 */ 633 int 634 winChkName(const u_char *un, int unlen, struct winentry *wep, int chksum) 635 { 636 u_int8_t *cp; 637 int i; 638 639 /* 640 * First compare checksums 641 */ 642 if (wep->weCnt&WIN_LAST) 643 chksum = wep->weChksum; 644 else if (chksum != wep->weChksum) 645 chksum = -1; 646 if (chksum == -1) 647 return -1; 648 649 /* 650 * Offset of this entry 651 */ 652 i = ((wep->weCnt&WIN_CNT) - 1) * WIN_CHARS; 653 un += i; 654 if ((unlen -= i) < 0) 655 return -1; 656 657 /* 658 * Ignore redundant winentries (those with only \0\0 on start in them). 659 * An appearance of such entry is a bug; unknown if in NetBSD msdosfs 660 * or MS Windows. 661 */ 662 if (unlen == 0) { 663 if (wep->wePart1[0] == '\0' && wep->wePart1[1] == '\0') 664 return chksum; 665 else 666 return -1; 667 } 668 669 if ((wep->weCnt&WIN_LAST) && unlen > WIN_CHARS) 670 return -1; 671 672 /* 673 * Compare the name parts 674 */ 675 for (cp = wep->wePart1, i = sizeof(wep->wePart1)/2; --i >= 0;) { 676 if (--unlen < 0) { 677 if (!*cp++ && !*cp) 678 return chksum; 679 return -1; 680 } 681 if (u2l[*cp++] != u2l[*un++] || *cp++) 682 return -1; 683 } 684 for (cp = wep->wePart2, i = sizeof(wep->wePart2)/2; --i >= 0;) { 685 if (--unlen < 0) { 686 if (!*cp++ && !*cp) 687 return chksum; 688 return -1; 689 } 690 if (u2l[*cp++] != u2l[*un++] || *cp++) 691 return -1; 692 } 693 for (cp = wep->wePart3, i = sizeof(wep->wePart3)/2; --i >= 0;) { 694 if (--unlen < 0) { 695 if (!*cp++ && !*cp) 696 return chksum; 697 return -1; 698 } 699 if (u2l[*cp++] != u2l[*un++] || *cp++) 700 return -1; 701 } 702 return chksum; 703 } 704 705 /* 706 * Convert Win95 filename to dirbuf. 707 * Returns the checksum or -1 if impossible 708 */ 709 int 710 win2unixfn(struct winentry *wep, struct dirent *dp, int chksum) 711 { 712 u_int8_t *cp; 713 u_int8_t *np, *ep = (u_int8_t *)dp->d_name + WIN_MAXLEN; 714 int i; 715 716 if ((wep->weCnt&WIN_CNT) > howmany(WIN_MAXLEN, WIN_CHARS) 717 || !(wep->weCnt&WIN_CNT)) 718 return -1; 719 720 /* 721 * First compare checksums 722 */ 723 if (wep->weCnt&WIN_LAST) { 724 chksum = wep->weChksum; 725 /* 726 * This works even though d_namlen is one byte! 727 */ 728 #ifdef __NetBSD__ 729 dp->d_namlen = (wep->weCnt&WIN_CNT) * WIN_CHARS; 730 #endif 731 } else if (chksum != wep->weChksum) 732 chksum = -1; 733 if (chksum == -1) 734 return -1; 735 736 /* 737 * Offset of this entry 738 */ 739 i = ((wep->weCnt&WIN_CNT) - 1) * WIN_CHARS; 740 np = (u_int8_t *)dp->d_name + i; 741 742 /* 743 * Convert the name parts 744 */ 745 for (cp = wep->wePart1, i = sizeof(wep->wePart1)/2; --i >= 0;) { 746 switch (*np++ = *cp++) { 747 case 0: 748 #ifdef __NetBSD__ 749 dp->d_namlen -= sizeof(wep->wePart2)/2 750 + sizeof(wep->wePart3)/2 + i + 1; 751 #endif 752 return chksum; 753 case '/': 754 np[-1] = 0; 755 return -1; 756 } 757 /* 758 * The size comparison should result in the compiler 759 * optimizing the whole if away 760 */ 761 if (WIN_MAXLEN % WIN_CHARS < sizeof(wep->wePart1) / 2 762 && np > ep) { 763 np[-1] = 0; 764 return -1; 765 } 766 if (*cp++) 767 return -1; 768 } 769 for (cp = wep->wePart2, i = sizeof(wep->wePart2)/2; --i >= 0;) { 770 switch (*np++ = *cp++) { 771 case 0: 772 #ifdef __NetBSD__ 773 dp->d_namlen -= sizeof(wep->wePart3)/2 + i + 1; 774 #endif 775 return chksum; 776 case '/': 777 np[-1] = 0; 778 return -1; 779 } 780 /* 781 * The size comparisons should be optimized away 782 */ 783 if (WIN_MAXLEN % WIN_CHARS >= sizeof(wep->wePart1) / 2 784 && WIN_MAXLEN % WIN_CHARS < (sizeof(wep->wePart1) + sizeof(wep->wePart2)) / 2 785 && np > ep) { 786 np[-1] = 0; 787 return -1; 788 } 789 if (*cp++) 790 return -1; 791 } 792 for (cp = wep->wePart3, i = sizeof(wep->wePart3)/2; --i >= 0;) { 793 switch (*np++ = *cp++) { 794 case 0: 795 #ifdef __NetBSD__ 796 dp->d_namlen -= i + 1; 797 #endif 798 return chksum; 799 case '/': 800 np[-1] = 0; 801 return -1; 802 } 803 /* 804 * See above 805 */ 806 if (WIN_MAXLEN % WIN_CHARS >= (sizeof(wep->wePart1) + sizeof(wep->wePart2)) / 2 807 && np > ep) { 808 np[-1] = 0; 809 return -1; 810 } 811 if (*cp++) 812 return -1; 813 } 814 return chksum; 815 } 816 817 /* 818 * Compute the checksum of a DOS filename for Win95 use 819 */ 820 u_int8_t 821 winChksum(u_int8_t *name) 822 { 823 int i; 824 u_int8_t s; 825 826 for (s = 0, i = 11; --i >= 0; s += *name++) 827 s = (s << 7)|(s >> 1); 828 return s; 829 } 830 831 /* 832 * Determine the number of slots necessary for Win95 names 833 */ 834 int 835 winSlotCnt(const u_char *un, int unlen) 836 { 837 for (un += unlen; unlen > 0; unlen--) 838 if (*--un != ' ' && *un != '.') 839 break; 840 if (unlen > WIN_MAXLEN) 841 return 0; 842 return howmany(unlen, WIN_CHARS); 843 } 844