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