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