msdosfs_conv.c revision 33548
133548Sjkh/* $Id: msdosfs_conv.c,v 1.14 1998/02/09 06:09:50 eivind Exp $ */ 233548Sjkh/* $NetBSD: msdosfs_conv.c,v 1.25 1997/11/17 15:36:40 ws Exp $ */ 32893Sdfr 433548Sjkh/*- 533548Sjkh * Copyright (C) 1995, 1997 Wolfgang Solfrank. 633548Sjkh * Copyright (C) 1995, 1997 TooLs GmbH. 733548Sjkh * All rights reserved. 833548Sjkh * Original code by Paul Popelka (paulp@uts.amdahl.com) (see below). 933548Sjkh * 1033548Sjkh * Redistribution and use in source and binary forms, with or without 1133548Sjkh * modification, are permitted provided that the following conditions 1233548Sjkh * are met: 1333548Sjkh * 1. Redistributions of source code must retain the above copyright 1433548Sjkh * notice, this list of conditions and the following disclaimer. 1533548Sjkh * 2. Redistributions in binary form must reproduce the above copyright 1633548Sjkh * notice, this list of conditions and the following disclaimer in the 1733548Sjkh * documentation and/or other materials provided with the distribution. 1833548Sjkh * 3. All advertising materials mentioning features or use of this software 1933548Sjkh * must display the following acknowledgement: 2033548Sjkh * This product includes software developed by TooLs GmbH. 2133548Sjkh * 4. The name of TooLs GmbH may not be used to endorse or promote products 2233548Sjkh * derived from this software without specific prior written permission. 2333548Sjkh * 2433548Sjkh * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR 2533548Sjkh * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 2633548Sjkh * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 2733548Sjkh * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 2833548Sjkh * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 2933548Sjkh * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 3033548Sjkh * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 3133548Sjkh * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 3233548Sjkh * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 3333548Sjkh * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 3433548Sjkh */ 352893Sdfr/* 362893Sdfr * Written by Paul Popelka (paulp@uts.amdahl.com) 378876Srgrimes * 382893Sdfr * You can do anything you want with this software, just don't say you wrote 392893Sdfr * it, and don't remove this notice. 408876Srgrimes * 412893Sdfr * This software is provided "as is". 428876Srgrimes * 432893Sdfr * The author supplies this software to be publicly redistributed on the 442893Sdfr * understanding that the author is not responsible for the correct 452893Sdfr * functioning of this software in any circumstances and is not liable for 462893Sdfr * any damages caused by this software. 478876Srgrimes * 482893Sdfr * October 1992 492893Sdfr */ 502893Sdfr 512893Sdfr/* 522893Sdfr * System include files. 532893Sdfr */ 542893Sdfr#include <sys/param.h> 552893Sdfr#include <sys/time.h> 562893Sdfr#include <sys/kernel.h> /* defines tz */ 5733548Sjkh#include <sys/systm.h> 587465Sache#include <machine/clock.h> 5933548Sjkh#include <sys/dirent.h> 602893Sdfr 612893Sdfr/* 622893Sdfr * MSDOSFS include files. 632893Sdfr */ 642893Sdfr#include <msdosfs/direntry.h> 652893Sdfr 662893Sdfr/* 677465Sache * Total number of days that have passed for each month in a regular year. 682893Sdfr */ 6912144Sphkstatic u_short regyear[] = { 707465Sache 31, 59, 90, 120, 151, 181, 717465Sache 212, 243, 273, 304, 334, 365 722893Sdfr}; 732893Sdfr 742893Sdfr/* 757465Sache * Total number of days that have passed for each month in a leap year. 762893Sdfr */ 7712144Sphkstatic u_short leapyear[] = { 787465Sache 31, 60, 91, 121, 152, 182, 797465Sache 213, 244, 274, 305, 335, 366 802893Sdfr}; 812893Sdfr 822893Sdfr/* 832893Sdfr * Variables used to remember parts of the last time conversion. Maybe we 842893Sdfr * can avoid a full conversion. 852893Sdfr */ 8633181Seivindstatic u_long lasttime; 8733181Seivindstatic u_long lastday; 8833181Seivindstatic u_short lastddate; 8933181Seivindstatic u_short lastdtime; 902893Sdfr 912893Sdfr/* 922893Sdfr * Convert the unix version of time to dos's idea of time to be used in 932893Sdfr * file timestamps. The passed in unix time is assumed to be in GMT. 942893Sdfr */ 952893Sdfrvoid 9633548Sjkhunix2dostime(tsp, ddp, dtp, dhp) 972893Sdfr struct timespec *tsp; 9833548Sjkh u_int16_t *ddp; 9933548Sjkh u_int16_t *dtp; 10033548Sjkh u_int8_t *dhp; 1012893Sdfr{ 1022893Sdfr u_long t; 1032893Sdfr u_long days; 1042893Sdfr u_long inc; 1052893Sdfr u_long year; 1062893Sdfr u_long month; 1072893Sdfr u_short *months; 1082893Sdfr 1092893Sdfr /* 1102893Sdfr * If the time from the last conversion is the same as now, then 1112893Sdfr * skip the computations and use the saved result. 1122893Sdfr */ 11318397Snate t = tsp->tv_sec - (tz.tz_minuteswest * 60) 11415055Sache - (wall_cmos_clock ? adjkerntz : 0); 11515053Sache /* - daylight savings time correction */ 11633548Sjkh t &= ~1; 1172893Sdfr if (lasttime != t) { 1182893Sdfr lasttime = t; 11933548Sjkh lastdtime = (((t / 2) % 30) << DT_2SECONDS_SHIFT) 1202893Sdfr + (((t / 60) % 60) << DT_MINUTES_SHIFT) 1212893Sdfr + (((t / 3600) % 24) << DT_HOURS_SHIFT); 1222893Sdfr 1232893Sdfr /* 1242893Sdfr * If the number of days since 1970 is the same as the last 1252893Sdfr * time we did the computation then skip all this leap year 1262893Sdfr * and month stuff. 1272893Sdfr */ 1282893Sdfr days = t / (24 * 60 * 60); 1292893Sdfr if (days != lastday) { 1302893Sdfr lastday = days; 1312893Sdfr for (year = 1970;; year++) { 1322893Sdfr inc = year & 0x03 ? 365 : 366; 1332893Sdfr if (days < inc) 1342893Sdfr break; 1352893Sdfr days -= inc; 1362893Sdfr } 1372893Sdfr months = year & 0x03 ? regyear : leapyear; 13820138Sbde for (month = 0; days >= months[month]; month++) 1397465Sache ; 1407465Sache if (month > 0) 1417465Sache days -= months[month - 1]; 1422893Sdfr lastddate = ((days + 1) << DD_DAY_SHIFT) 1432893Sdfr + ((month + 1) << DD_MONTH_SHIFT); 1442893Sdfr /* 1452893Sdfr * Remember dos's idea of time is relative to 1980. 1462893Sdfr * unix's is relative to 1970. If somehow we get a 1472893Sdfr * time before 1980 then don't give totally crazy 1482893Sdfr * results. 1492893Sdfr */ 1502893Sdfr if (year > 1980) 1512893Sdfr lastddate += (year - 1980) << DD_YEAR_SHIFT; 1522893Sdfr } 1532893Sdfr } 15433548Sjkh if (dtp) 15533548Sjkh *dtp = lastdtime; 15633548Sjkh if (dhp) 15733548Sjkh *dhp = (tsp->tv_sec & 1) * 100 + tsp->tv_nsec / 10000000; 15833548Sjkh 1592893Sdfr *ddp = lastddate; 1602893Sdfr} 1612893Sdfr 1622893Sdfr/* 1632893Sdfr * The number of seconds between Jan 1, 1970 and Jan 1, 1980. In that 1642893Sdfr * interval there were 8 regular years and 2 leap years. 1652893Sdfr */ 1662893Sdfr#define SECONDSTO1980 (((8 * 365) + (2 * 366)) * (24 * 60 * 60)) 1672893Sdfr 16833181Seivindstatic u_short lastdosdate; 16933181Seivindstatic u_long lastseconds; 1702893Sdfr 1712893Sdfr/* 1722893Sdfr * Convert from dos' idea of time to unix'. This will probably only be 1732893Sdfr * called from the stat(), and fstat() system calls and so probably need 1742893Sdfr * not be too efficient. 1752893Sdfr */ 1762893Sdfrvoid 17733548Sjkhdos2unixtime(dd, dt, dh, tsp) 17833548Sjkh u_int dd; 17933548Sjkh u_int dt; 18033548Sjkh u_int dh; 1812893Sdfr struct timespec *tsp; 1822893Sdfr{ 1832893Sdfr u_long seconds; 18411921Sphk u_long month; 18511921Sphk u_long year; 1862893Sdfr u_long days; 1872893Sdfr u_short *months; 1882893Sdfr 18933548Sjkh if (dd == 0) { 19033548Sjkh /* 19133548Sjkh * Uninitialized field, return the epoch. 19233548Sjkh */ 19333548Sjkh tsp->tv_sec = 0; 19433548Sjkh tsp->tv_nsec = 0; 19533548Sjkh return; 19633548Sjkh } 1975083Sbde seconds = (((dt & DT_2SECONDS_MASK) >> DT_2SECONDS_SHIFT) << 1) 1982893Sdfr + ((dt & DT_MINUTES_MASK) >> DT_MINUTES_SHIFT) * 60 19933548Sjkh + ((dt & DT_HOURS_MASK) >> DT_HOURS_SHIFT) * 3600 20033548Sjkh + dh / 100; 2012893Sdfr /* 2022893Sdfr * If the year, month, and day from the last conversion are the 2032893Sdfr * same then use the saved value. 2042893Sdfr */ 2052893Sdfr if (lastdosdate != dd) { 2062893Sdfr lastdosdate = dd; 2072893Sdfr days = 0; 2082893Sdfr year = (dd & DD_YEAR_MASK) >> DD_YEAR_SHIFT; 2097465Sache days = year * 365; 2107465Sache days += year / 4 + 1; /* add in leap days */ 2117465Sache if ((year & 0x03) == 0) 2127465Sache days--; /* if year is a leap year */ 2132893Sdfr months = year & 0x03 ? regyear : leapyear; 2142893Sdfr month = (dd & DD_MONTH_MASK) >> DD_MONTH_SHIFT; 2157465Sache if (month < 1 || month > 12) { 21633548Sjkh printf("dos2unixtime(): month value out of range (%ld)\n", 2173152Sphk month); 2182893Sdfr month = 1; 2192893Sdfr } 2207465Sache if (month > 1) 2217465Sache days += months[month - 2]; 2222893Sdfr days += ((dd & DD_DAY_MASK) >> DD_DAY_SHIFT) - 1; 2232893Sdfr lastseconds = (days * 24 * 60 * 60) + SECONDSTO1980; 2242893Sdfr } 22518397Snate tsp->tv_sec = seconds + lastseconds + (tz.tz_minuteswest * 60) 22615055Sache + adjkerntz; 22715053Sache /* + daylight savings time correction */ 22833548Sjkh tsp->tv_nsec = (dh % 100) * 10000000; 2292893Sdfr} 2302893Sdfr 23133548Sjkhstatic u_char 23233548Sjkhunix2dos[256] = { 23333548Sjkh 0, 0, 0, 0, 0, 0, 0, 0, /* 00-07 */ 23433548Sjkh 0, 0, 0, 0, 0, 0, 0, 0, /* 08-0f */ 23533548Sjkh 0, 0, 0, 0, 0, 0, 0, 0, /* 10-17 */ 23633548Sjkh 0, 0, 0, 0, 0, 0, 0, 0, /* 18-1f */ 23733548Sjkh 0, 0x21, 0, 0x23, 0x24, 0x25, 0x26, 0x27, /* 20-27 */ 23833548Sjkh 0x28, 0x29, 0, 0, 0, 0x2d, 0, 0, /* 28-2f */ 23933548Sjkh 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, /* 30-37 */ 24033548Sjkh 0x38, 0x39, 0, 0, 0, 0, 0, 0, /* 38-3f */ 24133548Sjkh 0x40, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, /* 40-47 */ 24233548Sjkh 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f, /* 48-4f */ 24333548Sjkh 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, /* 50-57 */ 24433548Sjkh 0x58, 0x59, 0x5a, 0, 0, 0, 0x5e, 0x5f, /* 58-5f */ 24533548Sjkh 0x60, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, /* 60-67 */ 24633548Sjkh 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f, /* 68-6f */ 24733548Sjkh 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, /* 70-77 */ 24833548Sjkh 0x58, 0x59, 0x5a, 0x7b, 0, 0x7d, 0x7e, 0, /* 78-7f */ 24933548Sjkh 0, 0, 0, 0, 0, 0, 0, 0, /* 80-87 */ 25033548Sjkh 0, 0, 0, 0, 0, 0, 0, 0, /* 88-8f */ 25133548Sjkh 0, 0, 0, 0, 0, 0, 0, 0, /* 90-97 */ 25233548Sjkh 0, 0, 0, 0, 0, 0, 0, 0, /* 98-9f */ 25333548Sjkh 0, 0xad, 0xbd, 0x9c, 0xcf, 0xbe, 0xdd, 0xf5, /* a0-a7 */ 25433548Sjkh 0xf9, 0xb8, 0xa6, 0xae, 0xaa, 0xf0, 0xa9, 0xee, /* a8-af */ 25533548Sjkh 0xf8, 0xf1, 0xfd, 0xfc, 0xef, 0xe6, 0xf4, 0xfa, /* b0-b7 */ 25633548Sjkh 0xf7, 0xfb, 0xa7, 0xaf, 0xac, 0xab, 0xf3, 0xa8, /* b8-bf */ 25733548Sjkh 0xb7, 0xb5, 0xb6, 0xc7, 0x8e, 0x8f, 0x92, 0x80, /* c0-c7 */ 25833548Sjkh 0xd4, 0x90, 0xd2, 0xd3, 0xde, 0xd6, 0xd7, 0xd8, /* c8-cf */ 25933548Sjkh 0xd1, 0xa5, 0xe3, 0xe0, 0xe2, 0xe5, 0x99, 0x9e, /* d0-d7 */ 26033548Sjkh 0x9d, 0xeb, 0xe9, 0xea, 0x9a, 0xed, 0xe8, 0xe1, /* d8-df */ 26133548Sjkh 0xb7, 0xb5, 0xb6, 0xc7, 0x8e, 0x8f, 0x92, 0x80, /* e0-e7 */ 26233548Sjkh 0xd4, 0x90, 0xd2, 0xd3, 0xde, 0xd6, 0xd7, 0xd8, /* e8-ef */ 26333548Sjkh 0xd1, 0xa5, 0xe3, 0xe0, 0xe2, 0xe5, 0x99, 0xf6, /* f0-f7 */ 26433548Sjkh 0x9d, 0xeb, 0xe9, 0xea, 0x9a, 0xed, 0xe8, 0x98, /* f8-ff */ 26533548Sjkh}; 2662893Sdfr 26733548Sjkhstatic u_char 26833548Sjkhdos2unix[256] = { 26933548Sjkh 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, /* 00-07 */ 27033548Sjkh 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, /* 08-0f */ 27133548Sjkh 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, /* 10-17 */ 27233548Sjkh 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, /* 18-1f */ 27333548Sjkh 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, /* 20-27 */ 27433548Sjkh 0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, /* 28-2f */ 27533548Sjkh 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, /* 30-37 */ 27633548Sjkh 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, /* 38-3f */ 27733548Sjkh 0x40, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, /* 40-47 */ 27833548Sjkh 0x48, 0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f, /* 48-4f */ 27933548Sjkh 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, /* 50-57 */ 28033548Sjkh 0x58, 0x59, 0x5a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, /* 58-5f */ 28133548Sjkh 0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 60-67 */ 28233548Sjkh 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, /* 68-6f */ 28333548Sjkh 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 70-77 */ 28433548Sjkh 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, /* 78-7f */ 28533548Sjkh 0xc7, 0xfc, 0xe9, 0xe2, 0xe4, 0xe0, 0xe5, 0xe7, /* 80-87 */ 28633548Sjkh 0xea, 0xeb, 0xe8, 0xef, 0xee, 0xec, 0xc4, 0xc5, /* 88-8f */ 28733548Sjkh 0xc9, 0xe6, 0xc6, 0xf4, 0xf6, 0xf2, 0xfb, 0xf9, /* 90-97 */ 28833548Sjkh 0xff, 0xd6, 0xdc, 0xf8, 0xa3, 0xd8, 0xd7, 0x3f, /* 98-9f */ 28933548Sjkh 0xe1, 0xed, 0xf3, 0xfa, 0xf1, 0xd1, 0xaa, 0xba, /* a0-a7 */ 29033548Sjkh 0xbf, 0xae, 0xac, 0xbd, 0xbc, 0xa1, 0xab, 0xbb, /* a8-af */ 29133548Sjkh 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0xc1, 0xc2, 0xc0, /* b0-b7 */ 29233548Sjkh 0xa9, 0x3f, 0x3f, 0x3f, 0x3f, 0xa2, 0xa5, 0x3f, /* b8-bf */ 29333548Sjkh 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0xe3, 0xc3, /* c0-c7 */ 29433548Sjkh 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0x3f, 0xa4, /* c8-cf */ 29533548Sjkh 0xf0, 0xd0, 0xca, 0xcb, 0xc8, 0x3f, 0xcd, 0xce, /* d0-d7 */ 29633548Sjkh 0xcf, 0x3f, 0x3f, 0x3f, 0x3f, 0xa6, 0xcc, 0x3f, /* d8-df */ 29733548Sjkh 0xd3, 0xdf, 0xd4, 0xd2, 0xf5, 0xd5, 0xb5, 0xfe, /* e0-e7 */ 29833548Sjkh 0xde, 0xda, 0xdb, 0xd9, 0xfd, 0xdd, 0xaf, 0x3f, /* e8-ef */ 29933548Sjkh 0xad, 0xb1, 0x3f, 0xbe, 0xb6, 0xa7, 0xf7, 0xb8, /* f0-f7 */ 30033548Sjkh 0xb0, 0xa8, 0xb7, 0xb9, 0xb3, 0xb2, 0x3f, 0x3f, /* f8-ff */ 30133548Sjkh}; 30233548Sjkh 30333548Sjkhstatic u_char 30433548Sjkhu2l[256] = { 30533548Sjkh 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, /* 00-07 */ 30633548Sjkh 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, /* 08-0f */ 30733548Sjkh 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, /* 10-17 */ 30833548Sjkh 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, /* 18-1f */ 30933548Sjkh 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, /* 20-27 */ 31033548Sjkh 0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, /* 28-2f */ 31133548Sjkh 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, /* 30-37 */ 31233548Sjkh 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, /* 38-3f */ 31333548Sjkh 0x40, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 40-47 */ 31433548Sjkh 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, /* 48-4f */ 31533548Sjkh 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 50-57 */ 31633548Sjkh 0x78, 0x79, 0x7a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, /* 58-5f */ 31733548Sjkh 0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 60-67 */ 31833548Sjkh 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, /* 68-6f */ 31933548Sjkh 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 70-77 */ 32033548Sjkh 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, /* 78-7f */ 32133548Sjkh 0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, /* 80-87 */ 32233548Sjkh 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f, /* 88-8f */ 32333548Sjkh 0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, /* 90-97 */ 32433548Sjkh 0x98, 0x99, 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, /* 98-9f */ 32533548Sjkh 0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7, /* a0-a7 */ 32633548Sjkh 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf, /* a8-af */ 32733548Sjkh 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, /* b0-b7 */ 32833548Sjkh 0xb8, 0xb9, 0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, /* b8-bf */ 32933548Sjkh 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* c0-c7 */ 33033548Sjkh 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* c8-cf */ 33133548Sjkh 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xd7, /* d0-d7 */ 33233548Sjkh 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xdf, /* d8-df */ 33333548Sjkh 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* e0-e7 */ 33433548Sjkh 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* e8-ef */ 33533548Sjkh 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, /* f0-f7 */ 33633548Sjkh 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff, /* f8-ff */ 33733548Sjkh}; 33833548Sjkh 3392893Sdfr/* 3402893Sdfr * DOS filenames are made of 2 parts, the name part and the extension part. 3412893Sdfr * The name part is 8 characters long and the extension part is 3 3422893Sdfr * characters long. They may contain trailing blanks if the name or 3432893Sdfr * extension are not long enough to fill their respective fields. 3442893Sdfr */ 3452893Sdfr 3462893Sdfr/* 3472893Sdfr * Convert a DOS filename to a unix filename. And, return the number of 3482893Sdfr * characters in the resulting unix filename excluding the terminating 3492893Sdfr * null. 3502893Sdfr */ 3512893Sdfrint 35233548Sjkhdos2unixfn(dn, un, lower) 3532893Sdfr u_char dn[11]; 3542893Sdfr u_char *un; 35533548Sjkh int lower; 3562893Sdfr{ 3572893Sdfr int i; 35833548Sjkh int thislong = 1; 3592893Sdfr u_char c; 3602893Sdfr 3612893Sdfr /* 36233548Sjkh * If first char of the filename is SLOT_E5 (0x05), then the real 36333548Sjkh * first char of the filename should be 0xe5. But, they couldn't 36433548Sjkh * just have a 0xe5 mean 0xe5 because that is used to mean a freed 36533548Sjkh * directory slot. Another dos quirk. 3662893Sdfr */ 36733548Sjkh if (*dn == SLOT_E5) 36833548Sjkh c = dos2unix[0xe5]; 36933548Sjkh else 37033548Sjkh c = dos2unix[*dn]; 37133548Sjkh *un++ = lower ? u2l[c] : c; 37233548Sjkh dn++; 3732893Sdfr 3742893Sdfr /* 37533548Sjkh * Copy the name portion into the unix filename string. 3762893Sdfr */ 37733548Sjkh for (i = 1; i < 8 && *dn != ' '; i++) { 37833548Sjkh c = dos2unix[*dn++]; 37933548Sjkh *un++ = lower ? u2l[c] : c; 3802893Sdfr thislong++; 3812893Sdfr } 38233548Sjkh dn += 8 - i; 3832893Sdfr 3842893Sdfr /* 3852893Sdfr * Now, if there is an extension then put in a period and copy in 3862893Sdfr * the extension. 3872893Sdfr */ 38833548Sjkh if (*dn != ' ') { 3892893Sdfr *un++ = '.'; 3902893Sdfr thislong++; 39133548Sjkh for (i = 0; i < 3 && *dn != ' '; i++) { 39233548Sjkh c = dos2unix[*dn++]; 39333548Sjkh *un++ = lower ? u2l[c] : c; 3942893Sdfr thislong++; 3952893Sdfr } 3962893Sdfr } 3972893Sdfr *un++ = 0; 3982893Sdfr 39933548Sjkh return (thislong); 4002893Sdfr} 4012893Sdfr 4022893Sdfr/* 40333548Sjkh * Convert a unix filename to a DOS filename according to Win95 rules. 40433548Sjkh * If applicable and gen is not 0, it is inserted into the converted 40533548Sjkh * filename as a generation number. 40633548Sjkh * Returns 40733548Sjkh * 0 if name couldn't be converted 40833548Sjkh * 1 if the converted name is the same as the original 40933548Sjkh * (no long filename entry necessary for Win95) 41033548Sjkh * 2 if conversion was successful 41133548Sjkh * 3 if conversion was successful and generation number was inserted 4122893Sdfr */ 41333548Sjkhint 41433548Sjkhunix2dosfn(un, dn, unlen, gen) 41533548Sjkh const u_char *un; 41633548Sjkh u_char dn[12]; 4172893Sdfr int unlen; 41833548Sjkh u_int gen; 4192893Sdfr{ 42033548Sjkh int i, j, l; 42133548Sjkh int conv = 1; 42233548Sjkh const u_char *cp, *dp, *dp1; 42333548Sjkh u_char gentext[6], *wcp; 4242893Sdfr 4252893Sdfr /* 4262893Sdfr * Fill the dos filename string with blanks. These are DOS's pad 4272893Sdfr * characters. 4282893Sdfr */ 42933548Sjkh for (i = 0; i < 11; i++) 4302893Sdfr dn[i] = ' '; 43133548Sjkh dn[11] = 0; 4322893Sdfr 4332893Sdfr /* 4342893Sdfr * The filenames "." and ".." are handled specially, since they 4352893Sdfr * don't follow dos filename rules. 4362893Sdfr */ 4372893Sdfr if (un[0] == '.' && unlen == 1) { 4382893Sdfr dn[0] = '.'; 43933548Sjkh return gen <= 1; 4402893Sdfr } 4412893Sdfr if (un[0] == '.' && un[1] == '.' && unlen == 2) { 4422893Sdfr dn[0] = '.'; 4432893Sdfr dn[1] = '.'; 44433548Sjkh return gen <= 1; 4452893Sdfr } 4462893Sdfr 4472893Sdfr /* 44833548Sjkh * Filenames with only blanks and dots are not allowed! 4492893Sdfr */ 45033548Sjkh for (cp = un, i = unlen; --i >= 0; cp++) 45133548Sjkh if (*cp != ' ' && *cp != '.') 45233548Sjkh break; 45333548Sjkh if (i < 0) 45433548Sjkh return 0; 45533548Sjkh 45633548Sjkh /* 45733548Sjkh * Now find the extension 45833548Sjkh * Note: dot as first char doesn't start extension 45933548Sjkh * and trailing dots and blanks are ignored 46033548Sjkh */ 46133548Sjkh dp = dp1 = 0; 46233548Sjkh for (cp = un + 1, i = unlen - 1; --i >= 0;) { 46333548Sjkh switch (*cp++) { 46433548Sjkh case '.': 46533548Sjkh if (!dp1) 46633548Sjkh dp1 = cp; 46733548Sjkh break; 46833548Sjkh case ' ': 46933548Sjkh break; 47033548Sjkh default: 47133548Sjkh if (dp1) 47233548Sjkh dp = dp1; 47333548Sjkh dp1 = 0; 47433548Sjkh break; 47533548Sjkh } 4762893Sdfr } 4772893Sdfr 4782893Sdfr /* 47933548Sjkh * Now convert it 4802893Sdfr */ 48133548Sjkh if (dp) { 48233548Sjkh if (dp1) 48333548Sjkh l = dp1 - dp; 48433548Sjkh else 48533548Sjkh l = unlen - (dp - un); 48633548Sjkh for (i = 0, j = 8; i < l && j < 11; i++, j++) { 48733548Sjkh if (dp[i] != (dn[j] = unix2dos[dp[i]]) 48833548Sjkh && conv != 3) 48933548Sjkh conv = 2; 49033548Sjkh if (!dn[j]) { 49133548Sjkh conv = 3; 49233548Sjkh dn[j--] = ' '; 49333548Sjkh } 49433548Sjkh } 49533548Sjkh if (i < l) 49633548Sjkh conv = 3; 49733548Sjkh dp--; 49833548Sjkh } else { 49933548Sjkh for (dp = cp; *--dp == ' ' || *dp == '.';); 50033548Sjkh dp++; 50133548Sjkh } 50233548Sjkh 50333548Sjkh /* 50433548Sjkh * Now convert the rest of the name 50533548Sjkh */ 50633548Sjkh for (i = j = 0; un < dp && j < 8; i++, j++, un++) { 50733548Sjkh if (*un != (dn[j] = unix2dos[*un]) 50833548Sjkh && conv != 3) 50933548Sjkh conv = 2; 51033548Sjkh if (!dn[j]) { 51133548Sjkh conv = 3; 51233548Sjkh dn[j--] = ' '; 51333548Sjkh } 51433548Sjkh } 51533548Sjkh if (un < dp) 51633548Sjkh conv = 3; 51733548Sjkh /* 51833548Sjkh * If we didn't have any chars in filename, 51933548Sjkh * generate a default 52033548Sjkh */ 52133548Sjkh if (!j) 52233548Sjkh dn[0] = '_'; 52333548Sjkh 52433548Sjkh /* 52533548Sjkh * The first character cannot be E5, 52633548Sjkh * because that means a deleted entry 52733548Sjkh */ 52833548Sjkh if (dn[0] == 0xe5) 5292893Sdfr dn[0] = SLOT_E5; 5302893Sdfr 5312893Sdfr /* 53233548Sjkh * If there wasn't any char dropped, 53333548Sjkh * there is no place for generation numbers 5342893Sdfr */ 53533548Sjkh if (conv != 3) { 53633548Sjkh if (gen > 1) 53733548Sjkh return 0; 53833548Sjkh return conv; 5392893Sdfr } 5402893Sdfr 5412893Sdfr /* 54233548Sjkh * Now insert the generation number into the filename part 5432893Sdfr */ 54433548Sjkh for (wcp = gentext + sizeof(gentext); wcp > gentext && gen; gen /= 10) 54533548Sjkh *--wcp = gen % 10 + '0'; 54633548Sjkh if (gen) 54733548Sjkh return 0; 54833548Sjkh for (i = 8; dn[--i] == ' ';); 54933548Sjkh i++; 55033548Sjkh if (gentext + sizeof(gentext) - wcp + 1 > 8 - i) 55133548Sjkh i = 8 - (gentext + sizeof(gentext) - wcp + 1); 55233548Sjkh dn[i++] = '~'; 55333548Sjkh while (wcp < gentext + sizeof(gentext)) 55433548Sjkh dn[i++] = *wcp++; 55533548Sjkh return 3; 55633548Sjkh} 55733548Sjkh 55833548Sjkh/* 55933548Sjkh * Create a Win95 long name directory entry 56033548Sjkh * Note: assumes that the filename is valid, 56133548Sjkh * i.e. doesn't consist solely of blanks and dots 56233548Sjkh */ 56333548Sjkhint 56433548Sjkhunix2winfn(un, unlen, wep, cnt, chksum) 56533548Sjkh const u_char *un; 56633548Sjkh int unlen; 56733548Sjkh struct winentry *wep; 56833548Sjkh int cnt; 56933548Sjkh int chksum; 57033548Sjkh{ 57133548Sjkh const u_int8_t *cp; 57233548Sjkh u_int8_t *wcp; 57333548Sjkh int i; 57433548Sjkh 57533548Sjkh /* 57633548Sjkh * Drop trailing blanks and dots 57733548Sjkh */ 57833548Sjkh for (cp = un + unlen; *--cp == ' ' || *cp == '.'; unlen--); 57933548Sjkh 58033548Sjkh un += (cnt - 1) * WIN_CHARS; 58133548Sjkh unlen -= (cnt - 1) * WIN_CHARS; 58233548Sjkh 58333548Sjkh /* 58433548Sjkh * Initialize winentry to some useful default 58533548Sjkh */ 58633548Sjkh for (wcp = (u_int8_t *)wep, i = sizeof(*wep); --i >= 0; *wcp++ = 0xff); 58733548Sjkh wep->weCnt = cnt; 58833548Sjkh wep->weAttributes = ATTR_WIN95; 58933548Sjkh wep->weReserved1 = 0; 59033548Sjkh wep->weChksum = chksum; 59133548Sjkh wep->weReserved2 = 0; 59233548Sjkh 59333548Sjkh /* 59433548Sjkh * Now convert the filename parts 59533548Sjkh */ 59633548Sjkh for (wcp = wep->wePart1, i = sizeof(wep->wePart1)/2; --i >= 0;) { 59733548Sjkh if (--unlen < 0) 59833548Sjkh goto done; 59933548Sjkh *wcp++ = *un++; 60033548Sjkh *wcp++ = 0; 6012893Sdfr } 60233548Sjkh for (wcp = wep->wePart2, i = sizeof(wep->wePart2)/2; --i >= 0;) { 60333548Sjkh if (--unlen < 0) 60433548Sjkh goto done; 60533548Sjkh *wcp++ = *un++; 60633548Sjkh *wcp++ = 0; 60733548Sjkh } 60833548Sjkh for (wcp = wep->wePart3, i = sizeof(wep->wePart3)/2; --i >= 0;) { 60933548Sjkh if (--unlen < 0) 61033548Sjkh goto done; 61133548Sjkh *wcp++ = *un++; 61233548Sjkh *wcp++ = 0; 61333548Sjkh } 61433548Sjkh if (!unlen) 61533548Sjkh wep->weCnt |= WIN_LAST; 61633548Sjkh return unlen; 61733548Sjkh 61833548Sjkhdone: 61933548Sjkh *wcp++ = 0; 62033548Sjkh *wcp++ = 0; 62133548Sjkh wep->weCnt |= WIN_LAST; 62233548Sjkh return 0; 6232893Sdfr} 6242893Sdfr 6252893Sdfr/* 62633548Sjkh * Compare our filename to the one in the Win95 entry 62733548Sjkh * Returns the checksum or -1 if no match 6282893Sdfr */ 62933548Sjkhint 63033548SjkhwinChkName(un, unlen, wep, chksum) 63133548Sjkh const u_char *un; 63233548Sjkh int unlen; 63333548Sjkh struct winentry *wep; 63433548Sjkh int chksum; 63533548Sjkh{ 63633548Sjkh u_int8_t *cp; 63733548Sjkh int i; 63833548Sjkh 63933548Sjkh /* 64033548Sjkh * First compare checksums 64133548Sjkh */ 64233548Sjkh if (wep->weCnt&WIN_LAST) 64333548Sjkh chksum = wep->weChksum; 64433548Sjkh else if (chksum != wep->weChksum) 64533548Sjkh chksum = -1; 64633548Sjkh if (chksum == -1) 64733548Sjkh return -1; 64833548Sjkh 64933548Sjkh /* 65033548Sjkh * Offset of this entry 65133548Sjkh */ 65233548Sjkh i = ((wep->weCnt&WIN_CNT) - 1) * WIN_CHARS; 65333548Sjkh un += i; 65433548Sjkh if ((unlen -= i) <= 0) 65533548Sjkh return -1; 65633548Sjkh if ((wep->weCnt&WIN_LAST) && unlen > WIN_CHARS) 65733548Sjkh return -1; 65833548Sjkh 65933548Sjkh /* 66033548Sjkh * Compare the name parts 66133548Sjkh */ 66233548Sjkh for (cp = wep->wePart1, i = sizeof(wep->wePart1)/2; --i >= 0;) { 66333548Sjkh if (--unlen < 0) { 66433548Sjkh if (!*cp++ && !*cp) 66533548Sjkh return chksum; 66633548Sjkh return -1; 66733548Sjkh } 66833548Sjkh if (u2l[*cp++] != u2l[*un++] || *cp++) 66933548Sjkh return -1; 67033548Sjkh } 67133548Sjkh for (cp = wep->wePart2, i = sizeof(wep->wePart2)/2; --i >= 0;) { 67233548Sjkh if (--unlen < 0) { 67333548Sjkh if (!*cp++ && !*cp) 67433548Sjkh return chksum; 67533548Sjkh return -1; 67633548Sjkh } 67733548Sjkh if (u2l[*cp++] != u2l[*un++] || *cp++) 67833548Sjkh return -1; 67933548Sjkh } 68033548Sjkh for (cp = wep->wePart3, i = sizeof(wep->wePart3)/2; --i >= 0;) { 68133548Sjkh if (--unlen < 0) { 68233548Sjkh if (!*cp++ && !*cp) 68333548Sjkh return chksum; 68433548Sjkh return -1; 68533548Sjkh } 68633548Sjkh if (u2l[*cp++] != u2l[*un++] || *cp++) 68733548Sjkh return -1; 68833548Sjkh } 68933548Sjkh return chksum; 69033548Sjkh} 69133548Sjkh 69233548Sjkh/* 69333548Sjkh * Convert Win95 filename to dirbuf. 69433548Sjkh * Returns the checksum or -1 if impossible 69533548Sjkh */ 69633548Sjkhint 69733548Sjkhwin2unixfn(wep, dp, chksum) 69833548Sjkh struct winentry *wep; 69933548Sjkh struct dirent *dp; 70033548Sjkh int chksum; 70133548Sjkh{ 70233548Sjkh u_int8_t *cp; 70333548Sjkh u_int8_t *np, *ep = dp->d_name + WIN_MAXLEN; 70433548Sjkh int i; 70533548Sjkh 70633548Sjkh if ((wep->weCnt&WIN_CNT) > howmany(WIN_MAXLEN, WIN_CHARS) 70733548Sjkh || !(wep->weCnt&WIN_CNT)) 70833548Sjkh return -1; 70933548Sjkh 71033548Sjkh /* 71133548Sjkh * First compare checksums 71233548Sjkh */ 71333548Sjkh if (wep->weCnt&WIN_LAST) { 71433548Sjkh chksum = wep->weChksum; 71533548Sjkh /* 71633548Sjkh * This works even though d_namlen is one byte! 71733548Sjkh */ 71833548Sjkh dp->d_namlen = (wep->weCnt&WIN_CNT) * WIN_CHARS; 71933548Sjkh } else if (chksum != wep->weChksum) 72033548Sjkh chksum = -1; 72133548Sjkh if (chksum == -1) 72233548Sjkh return -1; 72333548Sjkh 72433548Sjkh /* 72533548Sjkh * Offset of this entry 72633548Sjkh */ 72733548Sjkh i = ((wep->weCnt&WIN_CNT) - 1) * WIN_CHARS; 72833548Sjkh np = (u_int8_t *)dp->d_name + i; 72933548Sjkh 73033548Sjkh /* 73133548Sjkh * Convert the name parts 73233548Sjkh */ 73333548Sjkh for (cp = wep->wePart1, i = sizeof(wep->wePart1)/2; --i >= 0;) { 73433548Sjkh switch (*np++ = *cp++) { 73533548Sjkh case 0: 73633548Sjkh dp->d_namlen -= sizeof(wep->wePart2)/2 73733548Sjkh + sizeof(wep->wePart3)/2 + i + 1; 73833548Sjkh return chksum; 73933548Sjkh case '/': 74033548Sjkh np[-1] = 0; 74133548Sjkh return -1; 74233548Sjkh } 74333548Sjkh /* 74433548Sjkh * The size comparison should result in the compiler 74533548Sjkh * optimizing the whole if away 74633548Sjkh */ 74733548Sjkh if (WIN_MAXLEN % WIN_CHARS < sizeof(wep->wePart1) / 2 74833548Sjkh && np > ep) { 74933548Sjkh np[-1] = 0; 75033548Sjkh return -1; 75133548Sjkh } 75233548Sjkh if (*cp++) 75333548Sjkh return -1; 75433548Sjkh } 75533548Sjkh for (cp = wep->wePart2, i = sizeof(wep->wePart2)/2; --i >= 0;) { 75633548Sjkh switch (*np++ = *cp++) { 75733548Sjkh case 0: 75833548Sjkh dp->d_namlen -= sizeof(wep->wePart3)/2 + i + 1; 75933548Sjkh return chksum; 76033548Sjkh case '/': 76133548Sjkh np[-1] = 0; 76233548Sjkh return -1; 76333548Sjkh } 76433548Sjkh /* 76533548Sjkh * The size comparisons should be optimized away 76633548Sjkh */ 76733548Sjkh if (WIN_MAXLEN % WIN_CHARS >= sizeof(wep->wePart1) / 2 76833548Sjkh && WIN_MAXLEN % WIN_CHARS < (sizeof(wep->wePart1) + sizeof(wep->wePart2)) / 2 76933548Sjkh && np > ep) { 77033548Sjkh np[-1] = 0; 77133548Sjkh return -1; 77233548Sjkh } 77333548Sjkh if (*cp++) 77433548Sjkh return -1; 77533548Sjkh } 77633548Sjkh for (cp = wep->wePart3, i = sizeof(wep->wePart3)/2; --i >= 0;) { 77733548Sjkh switch (*np++ = *cp++) { 77833548Sjkh case 0: 77933548Sjkh dp->d_namlen -= i + 1; 78033548Sjkh return chksum; 78133548Sjkh case '/': 78233548Sjkh np[-1] = 0; 78333548Sjkh return -1; 78433548Sjkh } 78533548Sjkh /* 78633548Sjkh * See above 78733548Sjkh */ 78833548Sjkh if (WIN_MAXLEN % WIN_CHARS >= (sizeof(wep->wePart1) + sizeof(wep->wePart2)) / 2 78933548Sjkh && np > ep) { 79033548Sjkh np[-1] = 0; 79133548Sjkh return -1; 79233548Sjkh } 79333548Sjkh if (*cp++) 79433548Sjkh return -1; 79533548Sjkh } 79633548Sjkh return chksum; 79733548Sjkh} 79833548Sjkh 79933548Sjkh/* 80033548Sjkh * Compute the checksum of a DOS filename for Win95 use 80133548Sjkh */ 80233548Sjkhu_int8_t 80333548SjkhwinChksum(name) 80433548Sjkh u_int8_t *name; 80533548Sjkh{ 80633548Sjkh int i; 80733548Sjkh u_int8_t s; 80833548Sjkh 80933548Sjkh for (s = 0, i = 11; --i >= 0; s += *name++) 81033548Sjkh s = (s << 7)|(s >> 1); 81133548Sjkh return s; 81233548Sjkh} 81333548Sjkh 81433548Sjkh/* 81533548Sjkh * Determine the number of slots necessary for Win95 names 81633548Sjkh */ 81733548Sjkhint 81833548SjkhwinSlotCnt(un, unlen) 81933548Sjkh const u_char *un; 82033548Sjkh int unlen; 82133548Sjkh{ 82233548Sjkh for (un += unlen; unlen > 0; unlen--) 82333548Sjkh if (*--un != ' ' && *un != '.') 82433548Sjkh break; 82533548Sjkh if (unlen > WIN_MAXLEN) 82633548Sjkh return 0; 82733548Sjkh return howmany(unlen, WIN_CHARS); 82833548Sjkh} 829