udf_osta.c revision 1.5 1 1.5 lukem /* $NetBSD: udf_osta.c,v 1.5 2007/12/11 12:05:27 lukem Exp $ */
2 1.5 lukem
3 1.5 lukem #include <sys/cdefs.h>
4 1.5 lukem __KERNEL_RCSID(0, "$NetBSD: udf_osta.c,v 1.5 2007/12/11 12:05:27 lukem Exp $");
5 1.1 reinoud
6 1.1 reinoud /*
7 1.1 reinoud * Various routines from the OSTA 2.01 specs. Copyrights are included with
8 1.1 reinoud * each code segment. Slight whitespace modifications have been made for
9 1.1 reinoud * formatting purposes. Typos/bugs have been fixed.
10 1.1 reinoud *
11 1.1 reinoud */
12 1.1 reinoud
13 1.1 reinoud #include "udf_osta.h"
14 1.1 reinoud
15 1.1 reinoud
16 1.1 reinoud /*****************************************************************************/
17 1.1 reinoud /***********************************************************************
18 1.1 reinoud * OSTA compliant Unicode compression, uncompression routines.
19 1.1 reinoud * Copyright 1995 Micro Design International, Inc.
20 1.1 reinoud * Written by Jason M. Rinn.
21 1.1 reinoud * Micro Design International gives permission for the free use of the
22 1.1 reinoud * following source code.
23 1.1 reinoud */
24 1.1 reinoud
25 1.1 reinoud /***********************************************************************
26 1.1 reinoud * Takes an OSTA CS0 compressed unicode name, and converts
27 1.1 reinoud * it to Unicode.
28 1.1 reinoud * The Unicode output will be in the byte order
29 1.1 reinoud * that the local compiler uses for 16-bit values.
30 1.1 reinoud * NOTE: This routine only performs error checking on the compID.
31 1.1 reinoud * It is up to the user to ensure that the unicode buffer is large
32 1.1 reinoud * enough, and that the compressed unicode name is correct.
33 1.1 reinoud *
34 1.1 reinoud * RETURN VALUE
35 1.1 reinoud *
36 1.1 reinoud * The number of unicode characters which were uncompressed.
37 1.1 reinoud * A -1 is returned if the compression ID is invalid.
38 1.1 reinoud */
39 1.1 reinoud int
40 1.1 reinoud udf_UncompressUnicode(
41 1.1 reinoud int numberOfBytes, /* (Input) number of bytes read from media. */
42 1.1 reinoud byte *UDFCompressed, /* (Input) bytes read from media. */
43 1.1 reinoud unicode_t *unicode) /* (Output) uncompressed unicode characters. */
44 1.1 reinoud {
45 1.1 reinoud unsigned int compID;
46 1.1 reinoud int returnValue, unicodeIndex, byteIndex;
47 1.1 reinoud
48 1.1 reinoud /* Use UDFCompressed to store current byte being read. */
49 1.1 reinoud compID = UDFCompressed[0];
50 1.1 reinoud
51 1.1 reinoud /* First check for valid compID. */
52 1.1 reinoud if (compID != 8 && compID != 16) {
53 1.1 reinoud returnValue = -1;
54 1.1 reinoud } else {
55 1.1 reinoud unicodeIndex = 0;
56 1.1 reinoud byteIndex = 1;
57 1.1 reinoud
58 1.1 reinoud /* Loop through all the bytes. */
59 1.1 reinoud while (byteIndex < numberOfBytes) {
60 1.1 reinoud if (compID == 16) {
61 1.1 reinoud /* Move the first byte to the high bits of the
62 1.1 reinoud * unicode char.
63 1.1 reinoud */
64 1.1 reinoud unicode[unicodeIndex] =
65 1.1 reinoud UDFCompressed[byteIndex++] << 8;
66 1.1 reinoud } else {
67 1.1 reinoud unicode[unicodeIndex] = 0;
68 1.1 reinoud }
69 1.1 reinoud if (byteIndex < numberOfBytes) {
70 1.1 reinoud /*Then the next byte to the low bits. */
71 1.1 reinoud unicode[unicodeIndex] |=
72 1.1 reinoud UDFCompressed[byteIndex++];
73 1.1 reinoud }
74 1.1 reinoud unicodeIndex++;
75 1.1 reinoud }
76 1.1 reinoud returnValue = unicodeIndex;
77 1.1 reinoud }
78 1.1 reinoud return(returnValue);
79 1.1 reinoud }
80 1.1 reinoud
81 1.1 reinoud /***********************************************************************
82 1.1 reinoud * DESCRIPTION:
83 1.1 reinoud * Takes a string of unicode wide characters and returns an OSTA CS0
84 1.1 reinoud * compressed unicode string. The unicode MUST be in the byte order of
85 1.1 reinoud * the compiler in order to obtain correct results. Returns an error
86 1.1 reinoud * if the compression ID is invalid.
87 1.1 reinoud *
88 1.1 reinoud * NOTE: This routine assumes the implementation already knows, by
89 1.1 reinoud * the local environment, how many bits are appropriate and
90 1.1 reinoud * therefore does no checking to test if the input characters fit
91 1.1 reinoud * into that number of bits or not.
92 1.1 reinoud *
93 1.1 reinoud * RETURN VALUE
94 1.1 reinoud *
95 1.1 reinoud * The total number of bytes in the compressed OSTA CS0 string,
96 1.1 reinoud * including the compression ID.
97 1.1 reinoud * A -1 is returned if the compression ID is invalid.
98 1.1 reinoud */
99 1.1 reinoud int
100 1.1 reinoud udf_CompressUnicode(
101 1.1 reinoud int numberOfChars, /* (Input) number of unicode characters. */
102 1.1 reinoud int compID, /* (Input) compression ID to be used. */
103 1.1 reinoud unicode_t *unicode, /* (Input) unicode characters to compress. */
104 1.1 reinoud byte *UDFCompressed) /* (Output) compressed string, as bytes. */
105 1.1 reinoud {
106 1.1 reinoud int byteIndex, unicodeIndex;
107 1.1 reinoud
108 1.1 reinoud if (compID != 8 && compID != 16) {
109 1.1 reinoud byteIndex = -1; /* Unsupported compression ID ! */
110 1.1 reinoud } else {
111 1.1 reinoud /* Place compression code in first byte. */
112 1.1 reinoud UDFCompressed[0] = compID;
113 1.1 reinoud
114 1.1 reinoud byteIndex = 1;
115 1.1 reinoud unicodeIndex = 0;
116 1.1 reinoud while (unicodeIndex < numberOfChars) {
117 1.1 reinoud if (compID == 16) {
118 1.1 reinoud /* First, place the high bits of the char
119 1.1 reinoud * into the byte stream.
120 1.1 reinoud */
121 1.1 reinoud UDFCompressed[byteIndex++] =
122 1.1 reinoud (unicode[unicodeIndex] & 0xFF00) >> 8;
123 1.1 reinoud }
124 1.1 reinoud /*Then place the low bits into the stream. */
125 1.1 reinoud UDFCompressed[byteIndex++] =
126 1.1 reinoud unicode[unicodeIndex] & 0x00FF;
127 1.1 reinoud unicodeIndex++;
128 1.1 reinoud }
129 1.1 reinoud }
130 1.1 reinoud return(byteIndex);
131 1.1 reinoud }
132 1.1 reinoud
133 1.1 reinoud /*****************************************************************************/
134 1.1 reinoud /*
135 1.1 reinoud * CRC 010041
136 1.1 reinoud */
137 1.1 reinoud static unsigned short crc_table[256] = {
138 1.1 reinoud 0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50A5, 0x60C6, 0x70E7,
139 1.1 reinoud 0x8108, 0x9129, 0xA14A, 0xB16B, 0xC18C, 0xD1AD, 0xE1CE, 0xF1EF,
140 1.1 reinoud 0x1231, 0x0210, 0x3273, 0x2252, 0x52B5, 0x4294, 0x72F7, 0x62D6,
141 1.1 reinoud 0x9339, 0x8318, 0xB37B, 0xA35A, 0xD3BD, 0xC39C, 0xF3FF, 0xE3DE,
142 1.1 reinoud 0x2462, 0x3443, 0x0420, 0x1401, 0x64E6, 0x74C7, 0x44A4, 0x5485,
143 1.1 reinoud 0xA56A, 0xB54B, 0x8528, 0x9509, 0xE5EE, 0xF5CF, 0xC5AC, 0xD58D,
144 1.1 reinoud 0x3653, 0x2672, 0x1611, 0x0630, 0x76D7, 0x66F6, 0x5695, 0x46B4,
145 1.1 reinoud 0xB75B, 0xA77A, 0x9719, 0x8738, 0xF7DF, 0xE7FE, 0xD79D, 0xC7BC,
146 1.1 reinoud 0x48C4, 0x58E5, 0x6886, 0x78A7, 0x0840, 0x1861, 0x2802, 0x3823,
147 1.1 reinoud 0xC9CC, 0xD9ED, 0xE98E, 0xF9AF, 0x8948, 0x9969, 0xA90A, 0xB92B,
148 1.1 reinoud 0x5AF5, 0x4AD4, 0x7AB7, 0x6A96, 0x1A71, 0x0A50, 0x3A33, 0x2A12,
149 1.1 reinoud 0xDBFD, 0xCBDC, 0xFBBF, 0xEB9E, 0x9B79, 0x8B58, 0xBB3B, 0xAB1A,
150 1.1 reinoud 0x6CA6, 0x7C87, 0x4CE4, 0x5CC5, 0x2C22, 0x3C03, 0x0C60, 0x1C41,
151 1.1 reinoud 0xEDAE, 0xFD8F, 0xCDEC, 0xDDCD, 0xAD2A, 0xBD0B, 0x8D68, 0x9D49,
152 1.1 reinoud 0x7E97, 0x6EB6, 0x5ED5, 0x4EF4, 0x3E13, 0x2E32, 0x1E51, 0x0E70,
153 1.1 reinoud 0xFF9F, 0xEFBE, 0xDFDD, 0xCFFC, 0xBF1B, 0xAF3A, 0x9F59, 0x8F78,
154 1.1 reinoud 0x9188, 0x81A9, 0xB1CA, 0xA1EB, 0xD10C, 0xC12D, 0xF14E, 0xE16F,
155 1.1 reinoud 0x1080, 0x00A1, 0x30C2, 0x20E3, 0x5004, 0x4025, 0x7046, 0x6067,
156 1.1 reinoud 0x83B9, 0x9398, 0xA3FB, 0xB3DA, 0xC33D, 0xD31C, 0xE37F, 0xF35E,
157 1.1 reinoud 0x02B1, 0x1290, 0x22F3, 0x32D2, 0x4235, 0x5214, 0x6277, 0x7256,
158 1.1 reinoud 0xB5EA, 0xA5CB, 0x95A8, 0x8589, 0xF56E, 0xE54F, 0xD52C, 0xC50D,
159 1.1 reinoud 0x34E2, 0x24C3, 0x14A0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405,
160 1.1 reinoud 0xA7DB, 0xB7FA, 0x8799, 0x97B8, 0xE75F, 0xF77E, 0xC71D, 0xD73C,
161 1.1 reinoud 0x26D3, 0x36F2, 0x0691, 0x16B0, 0x6657, 0x7676, 0x4615, 0x5634,
162 1.1 reinoud 0xD94C, 0xC96D, 0xF90E, 0xE92F, 0x99C8, 0x89E9, 0xB98A, 0xA9AB,
163 1.1 reinoud 0x5844, 0x4865, 0x7806, 0x6827, 0x18C0, 0x08E1, 0x3882, 0x28A3,
164 1.1 reinoud 0xCB7D, 0xDB5C, 0xEB3F, 0xFB1E, 0x8BF9, 0x9BD8, 0xABBB, 0xBB9A,
165 1.1 reinoud 0x4A75, 0x5A54, 0x6A37, 0x7A16, 0x0AF1, 0x1AD0, 0x2AB3, 0x3A92,
166 1.1 reinoud 0xFD2E, 0xED0F, 0xDD6C, 0xCD4D, 0xBDAA, 0xAD8B, 0x9DE8, 0x8DC9,
167 1.1 reinoud 0x7C26, 0x6C07, 0x5C64, 0x4C45, 0x3CA2, 0x2C83, 0x1CE0, 0x0CC1,
168 1.1 reinoud 0xEF1F, 0xFF3E, 0xCF5D, 0xDF7C, 0xAF9B, 0xBFBA, 0x8FD9, 0x9FF8,
169 1.1 reinoud 0x6E17, 0x7E36, 0x4E55, 0x5E74, 0x2E93, 0x3EB2, 0x0ED1, 0x1EF0
170 1.1 reinoud };
171 1.1 reinoud
172 1.1 reinoud unsigned short
173 1.1 reinoud udf_cksum(s, n)
174 1.1 reinoud unsigned char *s;
175 1.1 reinoud int n;
176 1.1 reinoud {
177 1.1 reinoud unsigned short crc=0;
178 1.1 reinoud
179 1.1 reinoud while (n-- > 0)
180 1.1 reinoud crc = crc_table[(crc>>8 ^ *s++) & 0xff] ^ (crc<<8);
181 1.1 reinoud return crc;
182 1.1 reinoud }
183 1.1 reinoud
184 1.1 reinoud /* UNICODE Checksum */
185 1.1 reinoud unsigned short
186 1.1 reinoud udf_unicode_cksum(s, n)
187 1.1 reinoud unsigned short *s;
188 1.1 reinoud int n;
189 1.1 reinoud {
190 1.1 reinoud unsigned short crc=0;
191 1.1 reinoud
192 1.1 reinoud while (n-- > 0) {
193 1.1 reinoud /* Take high order byte first--corresponds to a big endian
194 1.1 reinoud * byte stream.
195 1.1 reinoud */
196 1.1 reinoud crc = crc_table[(crc>>8 ^ (*s>>8)) & 0xff] ^ (crc<<8);
197 1.1 reinoud crc = crc_table[(crc>>8 ^ (*s++ & 0xff)) & 0xff] ^ (crc<<8);
198 1.1 reinoud }
199 1.1 reinoud return crc;
200 1.1 reinoud }
201 1.1 reinoud
202 1.1 reinoud #ifdef MAIN
203 1.1 reinoud unsigned char bytes[] = { 0x70, 0x6A, 0x77 };
204 1.1 reinoud
205 1.1 reinoud main()
206 1.1 reinoud {
207 1.1 reinoud unsigned short x;
208 1.1 reinoud x = cksum(bytes, sizeof bytes);
209 1.1 reinoud printf("checksum: calculated=%4.4x, correct=%4.4x\en", x, 0x3299);
210 1.1 reinoud exit(0);
211 1.1 reinoud }
212 1.1 reinoud #endif
213 1.1 reinoud
214 1.1 reinoud /*****************************************************************************/
215 1.1 reinoud /* #ifdef NEEDS_ISPRINT */
216 1.1 reinoud /***********************************************************************
217 1.1 reinoud * OSTA UDF compliant file name translation routine for OS/2,
218 1.1 reinoud * Windows 95, Windows NT, Macintosh and UNIX.
219 1.1 reinoud * Copyright 1995 Micro Design International, Inc.
220 1.1 reinoud * Written by Jason M. Rinn.
221 1.1 reinoud * Micro Design International gives permission for the free use of the
222 1.1 reinoud * following source code.
223 1.1 reinoud */
224 1.1 reinoud
225 1.1 reinoud /***********************************************************************
226 1.1 reinoud * To use these routines with different operating systems.
227 1.1 reinoud *
228 1.1 reinoud * OS/2
229 1.1 reinoud * Define OS2
230 1.1 reinoud * Define MAXLEN = 254
231 1.1 reinoud *
232 1.1 reinoud * Windows 95
233 1.1 reinoud * Define WIN_95
234 1.1 reinoud * Define MAXLEN = 255
235 1.1 reinoud *
236 1.1 reinoud * Windows NT
237 1.1 reinoud * Define WIN_NT
238 1.1 reinoud * Define MAXLEN = 255
239 1.1 reinoud *
240 1.1 reinoud * Macintosh:
241 1.1 reinoud * Define MAC.
242 1.1 reinoud * Define MAXLEN = 31.
243 1.1 reinoud *
244 1.1 reinoud * UNIX
245 1.1 reinoud * Define UNIX.
246 1.1 reinoud * Define MAXLEN as specified by unix version.
247 1.1 reinoud */
248 1.1 reinoud
249 1.1 reinoud #define ILLEGAL_CHAR_MARK 0x005F
250 1.1 reinoud #define CRC_MARK 0x0023
251 1.1 reinoud #define EXT_SIZE 5
252 1.1 reinoud #define PERIOD 0x002E
253 1.1 reinoud #define SPACE 0x0020
254 1.1 reinoud
255 1.1 reinoud /*** PROTOTYPES ***/
256 1.1 reinoud int IsIllegal(unicode_t ch);
257 1.1 reinoud
258 1.1 reinoud /* Define a function or macro which determines if a Unicode character is
259 1.1 reinoud * printable under your implementation.
260 1.1 reinoud */
261 1.1 reinoud
262 1.1 reinoud
263 1.1 reinoud /* #include <stdio.h> */
264 1.1 reinoud static int UnicodeIsPrint(unicode_t ch) {
265 1.1 reinoud return (ch >=' ') && (ch < 127);
266 1.2 christos }
267 1.1 reinoud
268 1.1 reinoud
269 1.1 reinoud int UnicodeLength(unicode_t *string) {
270 1.1 reinoud int length;
271 1.1 reinoud length = 0;
272 1.1 reinoud while (*string++) length++;
273 1.1 reinoud
274 1.1 reinoud return length;
275 1.2 christos }
276 1.1 reinoud
277 1.1 reinoud
278 1.1 reinoud static int isprint(unsigned char c) {
279 1.1 reinoud return (c >= ' ') && (c != 127);
280 1.2 christos }
281 1.1 reinoud
282 1.1 reinoud
283 1.1 reinoud /***********************************************************************
284 1.1 reinoud * Translates a long file name to one using a MAXLEN and an illegal
285 1.1 reinoud * char set in accord with the OSTA requirements. Assumes the name has
286 1.1 reinoud * already been translated to Unicode.
287 1.1 reinoud *
288 1.1 reinoud * RETURN VALUE
289 1.1 reinoud *
290 1.1 reinoud * Number of unicode characters in translated name.
291 1.1 reinoud */
292 1.1 reinoud int UDFTransName(
293 1.1 reinoud unicode_t *newName, /* (Output)Translated name. Must be of length
294 1.1 reinoud * MAXLEN */
295 1.1 reinoud unicode_t *udfName, /* (Input) Name from UDF volume.*/
296 1.1 reinoud int udfLen) /* (Input) Length of UDF Name. */
297 1.1 reinoud {
298 1.4 thorpej int Index, newIndex = 0, needsCRC = false; /* index is shadowed */
299 1.4 thorpej int extIndex = 0, newExtIndex = 0, hasExt = false;
300 1.1 reinoud #if defined OS2 || defined WIN_95 || defined WIN_NT
301 1.1 reinoud int trailIndex = 0;
302 1.1 reinoud #endif
303 1.1 reinoud unsigned short valueCRC;
304 1.1 reinoud unicode_t current;
305 1.1 reinoud const char hexChar[] = "0123456789ABCDEF";
306 1.1 reinoud
307 1.3 reinoud for (Index = 0; Index < udfLen; Index++) {
308 1.3 reinoud current = udfName[Index];
309 1.1 reinoud
310 1.1 reinoud if (IsIllegal(current) || !UnicodeIsPrint(current)) {
311 1.4 thorpej needsCRC = true;
312 1.1 reinoud /* Replace Illegal and non-displayable chars with
313 1.1 reinoud * underscore.
314 1.1 reinoud */
315 1.1 reinoud current = ILLEGAL_CHAR_MARK;
316 1.1 reinoud /* Skip any other illegal or non-displayable
317 1.1 reinoud * characters.
318 1.1 reinoud */
319 1.3 reinoud while(Index+1 < udfLen && (IsIllegal(udfName[Index+1])
320 1.3 reinoud || !UnicodeIsPrint(udfName[Index+1]))) {
321 1.3 reinoud Index++;
322 1.1 reinoud }
323 1.1 reinoud }
324 1.1 reinoud
325 1.1 reinoud /* Record position of extension, if one is found. */
326 1.3 reinoud if (current == PERIOD && (udfLen - Index -1) <= EXT_SIZE) {
327 1.3 reinoud if (udfLen == Index + 1) {
328 1.1 reinoud /* A trailing period is NOT an extension. */
329 1.4 thorpej hasExt = false;
330 1.1 reinoud } else {
331 1.4 thorpej hasExt = true;
332 1.3 reinoud extIndex = Index;
333 1.1 reinoud newExtIndex = newIndex;
334 1.1 reinoud }
335 1.1 reinoud }
336 1.1 reinoud
337 1.1 reinoud #if defined OS2 || defined WIN_95 || defined WIN_NT
338 1.1 reinoud /* Record position of last char which is NOT period or space. */
339 1.1 reinoud else if (current != PERIOD && current != SPACE) {
340 1.1 reinoud trailIndex = newIndex;
341 1.1 reinoud }
342 1.1 reinoud #endif
343 1.1 reinoud
344 1.1 reinoud if (newIndex < MAXLEN) {
345 1.1 reinoud newName[newIndex++] = current;
346 1.1 reinoud } else {
347 1.4 thorpej needsCRC = true;
348 1.1 reinoud }
349 1.1 reinoud }
350 1.1 reinoud
351 1.1 reinoud #if defined OS2 || defined WIN_95 || defined WIN_NT
352 1.1 reinoud /* For OS2, 95 & NT, truncate any trailing periods and\or spaces. */
353 1.1 reinoud if (trailIndex != newIndex - 1) {
354 1.1 reinoud newIndex = trailIndex + 1;
355 1.4 thorpej needsCRC = true;
356 1.4 thorpej hasExt = false; /* Trailing period does not make an
357 1.1 reinoud * extension. */
358 1.1 reinoud }
359 1.1 reinoud #endif
360 1.1 reinoud
361 1.1 reinoud if (needsCRC) {
362 1.1 reinoud unicode_t ext[EXT_SIZE];
363 1.1 reinoud int localExtIndex = 0;
364 1.1 reinoud if (hasExt) {
365 1.1 reinoud int maxFilenameLen;
366 1.1 reinoud /* Translate extension, and store it in ext. */
367 1.3 reinoud for(Index = 0; Index<EXT_SIZE &&
368 1.3 reinoud extIndex + Index +1 < udfLen; Index++ ) {
369 1.3 reinoud current = udfName[extIndex + Index + 1];
370 1.1 reinoud if (IsIllegal(current) ||
371 1.1 reinoud !UnicodeIsPrint(current)) {
372 1.1 reinoud needsCRC = 1;
373 1.1 reinoud /* Replace Illegal and non-displayable
374 1.1 reinoud * chars with underscore.
375 1.1 reinoud */
376 1.1 reinoud current = ILLEGAL_CHAR_MARK;
377 1.1 reinoud /* Skip any other illegal or
378 1.1 reinoud * non-displayable characters.
379 1.1 reinoud */
380 1.3 reinoud while(Index + 1 < EXT_SIZE
381 1.1 reinoud && (IsIllegal(udfName[extIndex +
382 1.3 reinoud Index + 2]) ||
383 1.1 reinoud !isprint(udfName[extIndex +
384 1.3 reinoud Index + 2]))) {
385 1.3 reinoud Index++;
386 1.1 reinoud }
387 1.1 reinoud }
388 1.1 reinoud ext[localExtIndex++] = current;
389 1.1 reinoud }
390 1.1 reinoud
391 1.1 reinoud /* Truncate filename to leave room for extension and
392 1.1 reinoud * CRC.
393 1.1 reinoud */
394 1.1 reinoud maxFilenameLen = ((MAXLEN - 5) - localExtIndex - 1);
395 1.1 reinoud if (newIndex > maxFilenameLen) {
396 1.1 reinoud newIndex = maxFilenameLen;
397 1.1 reinoud } else {
398 1.1 reinoud newIndex = newExtIndex;
399 1.1 reinoud }
400 1.1 reinoud } else if (newIndex > MAXLEN - 5) {
401 1.1 reinoud /*If no extension, make sure to leave room for CRC. */
402 1.1 reinoud newIndex = MAXLEN - 5;
403 1.1 reinoud }
404 1.1 reinoud newName[newIndex++] = CRC_MARK; /* Add mark for CRC. */
405 1.1 reinoud
406 1.1 reinoud /*Calculate CRC from original filename from FileIdentifier. */
407 1.1 reinoud valueCRC = udf_unicode_cksum(udfName, udfLen);
408 1.1 reinoud /* Convert 16-bits of CRC to hex characters. */
409 1.1 reinoud newName[newIndex++] = hexChar[(valueCRC & 0xf000) >> 12];
410 1.1 reinoud newName[newIndex++] = hexChar[(valueCRC & 0x0f00) >> 8];
411 1.1 reinoud newName[newIndex++] = hexChar[(valueCRC & 0x00f0) >> 4];
412 1.1 reinoud newName[newIndex++] = hexChar[(valueCRC & 0x000f)];
413 1.1 reinoud
414 1.1 reinoud /* Place a translated extension at end, if found. */
415 1.1 reinoud if (hasExt) {
416 1.1 reinoud newName[newIndex++] = PERIOD;
417 1.3 reinoud for (Index = 0;Index < localExtIndex ;Index++ ) {
418 1.3 reinoud newName[newIndex++] = ext[Index];
419 1.1 reinoud }
420 1.1 reinoud }
421 1.1 reinoud }
422 1.1 reinoud return(newIndex);
423 1.1 reinoud }
424 1.1 reinoud
425 1.1 reinoud #if defined OS2 || defined WIN_95 || defined WIN_NT
426 1.1 reinoud /***********************************************************************
427 1.1 reinoud * Decides if a Unicode character matches one of a list
428 1.1 reinoud * of ASCII characters.
429 1.1 reinoud * Used by OS2 version of IsIllegal for readability, since all of the
430 1.1 reinoud * illegal characters above 0x0020 are in the ASCII subset of Unicode.
431 1.1 reinoud * Works very similarly to the standard C function strchr().
432 1.1 reinoud *
433 1.1 reinoud * RETURN VALUE
434 1.1 reinoud *
435 1.1 reinoud * Non-zero if the Unicode character is in the given ASCII string.
436 1.1 reinoud */
437 1.1 reinoud int UnicodeInString(
438 1.1 reinoud unsigned char *string, /* (Input) String to search through. */
439 1.1 reinoud unicode_t ch) /* (Input) Unicode char to search for. */
440 1.1 reinoud {
441 1.4 thorpej int found = false;
442 1.4 thorpej while (*string != '\0' && found == false) {
443 1.1 reinoud /* These types should compare, since both are unsigned
444 1.1 reinoud * numbers. */
445 1.1 reinoud if (*string == ch) {
446 1.4 thorpej found = true;
447 1.1 reinoud }
448 1.1 reinoud string++;
449 1.1 reinoud }
450 1.1 reinoud return(found);
451 1.1 reinoud }
452 1.1 reinoud #endif /* OS2 */
453 1.1 reinoud
454 1.1 reinoud /***********************************************************************
455 1.1 reinoud * Decides whether the given character is illegal for a given OS.
456 1.1 reinoud *
457 1.1 reinoud * RETURN VALUE
458 1.1 reinoud *
459 1.1 reinoud * Non-zero if char is illegal.
460 1.1 reinoud */
461 1.1 reinoud int IsIllegal(unicode_t ch)
462 1.1 reinoud {
463 1.1 reinoud #ifdef MAC
464 1.1 reinoud /* Only illegal character on the MAC is the colon. */
465 1.1 reinoud if (ch == 0x003A) {
466 1.1 reinoud return(1);
467 1.1 reinoud } else {
468 1.1 reinoud return(0);
469 1.1 reinoud }
470 1.1 reinoud
471 1.1 reinoud #elif defined UNIX
472 1.1 reinoud /* Illegal UNIX characters are NULL and slash. */
473 1.1 reinoud if (ch == 0x0000 || ch == 0x002F) {
474 1.1 reinoud return(1);
475 1.1 reinoud } else {
476 1.1 reinoud return(0);
477 1.1 reinoud }
478 1.1 reinoud
479 1.1 reinoud #elif defined OS2 || defined WIN_95 || defined WIN_NT
480 1.1 reinoud /* Illegal char's for OS/2 according to WARP toolkit. */
481 1.1 reinoud if (ch < 0x0020 || UnicodeInString("\\/:*?\"<>|", ch)) {
482 1.1 reinoud return(1);
483 1.1 reinoud } else {
484 1.1 reinoud return(0);
485 1.1 reinoud }
486 1.1 reinoud #endif
487 1.1 reinoud }
488 1.1 reinoud /* #endif*/ /* NEEDS_ISPRINT */
489 1.1 reinoud
490