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