mirror of
https://git.code.sf.net/p/ntfs-3g/ntfs-3g.git
synced 2024-12-12 11:24:00 +08:00
62f9636080
libntfs/unistr.c::ntfs_names_collate() pending a proper fix at some point. (Anton)
676 lines
19 KiB
C
676 lines
19 KiB
C
/*
|
|
* unistr.c - Unicode string handling. Part of the Linux-NTFS project.
|
|
*
|
|
* Copyright (c) 2000-2004 Anton Altaparmakov
|
|
*
|
|
* This program/include file is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License as published
|
|
* by the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program/include file is distributed in the hope that it will be
|
|
* useful, but WITHOUT ANY WARRANTY; without even the implied warranty
|
|
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program (in the main directory of the Linux-NTFS
|
|
* distribution in the file COPYING); if not, write to the Free Software
|
|
* Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#ifdef HAVE_STDIO_H
|
|
#include <stdio.h>
|
|
#endif
|
|
#ifdef HAVE_STDLIB_H
|
|
#include <stdlib.h>
|
|
#endif
|
|
#ifdef HAVE_WCHAR_H
|
|
#include <wchar.h>
|
|
#endif
|
|
#ifdef HAVE_STRING_H
|
|
#include <string.h>
|
|
#endif
|
|
#ifdef HAVE_ERRNO_H
|
|
#include <errno.h>
|
|
#endif
|
|
|
|
#include "types.h"
|
|
#include "unistr.h"
|
|
#include "debug.h"
|
|
|
|
/*
|
|
* IMPORTANT
|
|
* =========
|
|
*
|
|
* All these routines assume that the Unicode characters are in little endian
|
|
* encoding inside the strings!!!
|
|
*/
|
|
|
|
/*
|
|
* This is used by the name collation functions to quickly determine what
|
|
* characters are (in)valid.
|
|
*/
|
|
#if 0
|
|
static const u8 legal_ansi_char_array[0x40] = {
|
|
0x00, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10,
|
|
0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10,
|
|
|
|
0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10,
|
|
0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10,
|
|
|
|
0x17, 0x07, 0x18, 0x17, 0x17, 0x17, 0x17, 0x17,
|
|
0x17, 0x17, 0x18, 0x16, 0x16, 0x17, 0x07, 0x00,
|
|
|
|
0x17, 0x17, 0x17, 0x17, 0x17, 0x17, 0x17, 0x17,
|
|
0x17, 0x17, 0x04, 0x16, 0x18, 0x16, 0x18, 0x18,
|
|
};
|
|
#endif
|
|
|
|
/**
|
|
* ntfs_names_are_equal - compare two Unicode names for equality
|
|
* @s1: name to compare to @s2
|
|
* @s1_len: length in Unicode characters of @s1
|
|
* @s2: name to compare to @s1
|
|
* @s2_len: length in Unicode characters of @s2
|
|
* @ic: ignore case bool
|
|
* @upcase: upcase table (only if @ic == IGNORE_CASE)
|
|
* @upcase_size: length in Unicode characters of @upcase (if present)
|
|
*
|
|
* Compare the names @s1 and @s2 and return TRUE (1) if the names are
|
|
* identical, or FALSE (0) if they are not identical. If @ic is IGNORE_CASE,
|
|
* the @upcase table is used to perform a case insensitive comparison.
|
|
*/
|
|
BOOL ntfs_names_are_equal(const ntfschar *s1, size_t s1_len,
|
|
const ntfschar *s2, size_t s2_len,
|
|
const IGNORE_CASE_BOOL ic,
|
|
const ntfschar *upcase, const u32 upcase_size)
|
|
{
|
|
if (s1_len != s2_len)
|
|
return FALSE;
|
|
if (!s1_len)
|
|
return TRUE;
|
|
if (ic == CASE_SENSITIVE)
|
|
return ntfs_ucsncmp(s1, s2, s1_len) ? FALSE: TRUE;
|
|
return ntfs_ucsncasecmp(s1, s2, s1_len, upcase, upcase_size) ? FALSE:
|
|
TRUE;
|
|
}
|
|
|
|
/**
|
|
* ntfs_names_collate - collate two Unicode names
|
|
* @name1: first Unicode name to compare
|
|
* @name1_len: length of first Unicode name to compare
|
|
* @name2: second Unicode name to compare
|
|
* @name2_len: length of second Unicode name to compare
|
|
* @err_val: if @name1 contains an invalid character return this value
|
|
* @ic: either CASE_SENSITIVE or IGNORE_CASE
|
|
* @upcase: upcase table (ignored if @ic is CASE_SENSITIVE)
|
|
* @upcase_len: upcase table size (ignored if @ic is CASE_SENSITIVE)
|
|
*
|
|
* ntfs_names_collate() collates two Unicode names and returns:
|
|
*
|
|
* -1 if the first name collates before the second one,
|
|
* 0 if the names match,
|
|
* 1 if the second name collates before the first one, or
|
|
* @err_val if an invalid character is found in @name1 during the comparison.
|
|
*
|
|
* The following characters are considered invalid: '"', '*', '<', '>' and '?'.
|
|
*/
|
|
int ntfs_names_collate(const ntfschar *name1, const u32 name1_len,
|
|
const ntfschar *name2, const u32 name2_len,
|
|
const int err_val __attribute__((__unused__)),
|
|
const IGNORE_CASE_BOOL ic, const ntfschar *upcase,
|
|
const u32 upcase_len)
|
|
{
|
|
u32 cnt;
|
|
ntfschar c1, c2;
|
|
|
|
#ifdef DEBUG
|
|
if (!name1 || !name2 || (ic && (!upcase || !upcase_len))) {
|
|
Dputs("ntfs_names_collate received NULL pointer!");
|
|
exit(1);
|
|
}
|
|
#endif
|
|
for (cnt = 0; cnt < min(name1_len, name2_len); ++cnt) {
|
|
c1 = le16_to_cpu(*name1);
|
|
name1++;
|
|
c2 = le16_to_cpu(*name2);
|
|
name2++;
|
|
if (ic) {
|
|
if (c1 < upcase_len)
|
|
c1 = le16_to_cpu(upcase[c1]);
|
|
if (c2 < upcase_len)
|
|
c2 = le16_to_cpu(upcase[c2]);
|
|
}
|
|
#if 0
|
|
if (c1 < 64 && legal_ansi_char_array[c1] & 8)
|
|
return err_val;
|
|
#endif
|
|
if (c1 < c2)
|
|
return -1;
|
|
if (c1 > c2)
|
|
return 1;
|
|
}
|
|
if (name1_len < name2_len)
|
|
return -1;
|
|
if (name1_len == name2_len)
|
|
return 0;
|
|
/* name1_len > name2_len */
|
|
#if 0
|
|
c1 = le16_to_cpu(*name1);
|
|
if (c1 < 64 && legal_ansi_char_array[c1] & 8)
|
|
return err_val;
|
|
#endif
|
|
return 1;
|
|
}
|
|
|
|
/**
|
|
* ntfs_ucsncmp - compare two little endian Unicode strings
|
|
* @s1: first string
|
|
* @s2: second string
|
|
* @n: maximum unicode characters to compare
|
|
*
|
|
* Compare the first @n characters of the Unicode strings @s1 and @s2,
|
|
* The strings in little endian format and appropriate le16_to_cpu()
|
|
* conversion is performed on non-little endian machines.
|
|
*
|
|
* The function returns an integer less than, equal to, or greater than zero
|
|
* if @s1 (or the first @n Unicode characters thereof) is found, respectively,
|
|
* to be less than, to match, or be greater than @s2.
|
|
*/
|
|
int ntfs_ucsncmp(const ntfschar *s1, const ntfschar *s2, size_t n)
|
|
{
|
|
ntfschar c1, c2;
|
|
size_t i;
|
|
|
|
#ifdef DEBUG
|
|
if (!s1 || !s2) {
|
|
Dputs("ntfs_wcsncmp() received NULL pointer!");
|
|
exit(1);
|
|
}
|
|
#endif
|
|
for (i = 0; i < n; ++i) {
|
|
c1 = le16_to_cpu(s1[i]);
|
|
c2 = le16_to_cpu(s2[i]);
|
|
if (c1 < c2)
|
|
return -1;
|
|
if (c1 > c2)
|
|
return 1;
|
|
if (!c1)
|
|
break;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/**
|
|
* ntfs_ucsncasecmp - compare two little endian Unicode strings, ignoring case
|
|
* @s1: first string
|
|
* @s2: second string
|
|
* @n: maximum unicode characters to compare
|
|
* @upcase: upcase table
|
|
* @upcase_size: upcase table size in Unicode characters
|
|
*
|
|
* Compare the first @n characters of the Unicode strings @s1 and @s2,
|
|
* ignoring case. The strings in little endian format and appropriate
|
|
* le16_to_cpu() conversion is performed on non-little endian machines.
|
|
*
|
|
* Each character is uppercased using the @upcase table before the comparison.
|
|
*
|
|
* The function returns an integer less than, equal to, or greater than zero
|
|
* if @s1 (or the first @n Unicode characters thereof) is found, respectively,
|
|
* to be less than, to match, or be greater than @s2.
|
|
*/
|
|
int ntfs_ucsncasecmp(const ntfschar *s1, const ntfschar *s2, size_t n,
|
|
const ntfschar *upcase, const u32 upcase_size)
|
|
{
|
|
ntfschar c1, c2;
|
|
size_t i;
|
|
|
|
#ifdef DEBUG
|
|
if (!s1 || !s2 || !upcase) {
|
|
Dputs("ntfs_wcsncasecmp() received NULL pointer!");
|
|
exit(1);
|
|
}
|
|
#endif
|
|
for (i = 0; i < n; ++i) {
|
|
if ((c1 = le16_to_cpu(s1[i])) < upcase_size)
|
|
c1 = le16_to_cpu(upcase[c1]);
|
|
if ((c2 = le16_to_cpu(s2[i])) < upcase_size)
|
|
c2 = le16_to_cpu(upcase[c2]);
|
|
if (c1 < c2)
|
|
return -1;
|
|
if (c1 > c2)
|
|
return 1;
|
|
if (!c1)
|
|
break;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/**
|
|
* ntfs_ucsnlen - determine the length of a little endian Unicode string
|
|
* @s: pointer to Unicode string
|
|
* @maxlen: maximum length of string @s
|
|
*
|
|
* Return the number of Unicode characters in the little endian Unicode
|
|
* string @s up to a maximum of maxlen Unicode characters, not including
|
|
* the terminating (ntfschar)'\0'. If there is no (ntfschar)'\0' between @s
|
|
* and @s + @maxlen, @maxlen is returned.
|
|
*
|
|
* This function never looks beyond @s + @maxlen.
|
|
*/
|
|
u32 ntfs_ucsnlen(const ntfschar *s, u32 maxlen)
|
|
{
|
|
u32 i;
|
|
|
|
for (i = 0; i < maxlen; i++) {
|
|
if (!le16_to_cpu(s[i]))
|
|
break;
|
|
}
|
|
return i;
|
|
}
|
|
|
|
/**
|
|
* ntfs_ucsndup - duplicate little endian Unicode string
|
|
* @s: pointer to Unicode string
|
|
* @maxlen: maximum length of string @s
|
|
*
|
|
* Return a pointer to a new little endian Unicode string which is a duplicate
|
|
* of the string s. Memory for the new string is obtained with malloc(3), and
|
|
* can be freed with free(3).
|
|
*
|
|
* A maximum of @maxlen Unicode characters are copied and a terminating
|
|
* (ntfschar)'\0' little endian Unicode character is added.
|
|
*
|
|
* This function never looks beyond @s + @maxlen.
|
|
*
|
|
* Return a pointer to the new little endian Unicode string on success and NULL
|
|
* on failure with errno set to the error code.
|
|
*/
|
|
ntfschar *ntfs_ucsndup(const ntfschar *s, u32 maxlen)
|
|
{
|
|
ntfschar *dst;
|
|
u32 len;
|
|
|
|
len = ntfs_ucsnlen(s, maxlen);
|
|
dst = malloc((len + 1) * sizeof(ntfschar));
|
|
if (dst) {
|
|
memcpy(dst, s, len * sizeof(ntfschar));
|
|
dst[len] = cpu_to_le16(L'\0');
|
|
}
|
|
return dst;
|
|
}
|
|
|
|
/**
|
|
* ntfs_name_upcase
|
|
*/
|
|
void ntfs_name_upcase(ntfschar *name, u32 name_len, const ntfschar *upcase,
|
|
const u32 upcase_len)
|
|
{
|
|
u32 i;
|
|
ntfschar u;
|
|
|
|
for (i = 0; i < name_len; i++)
|
|
if ((u = le16_to_cpu(name[i])) < upcase_len)
|
|
name[i] = upcase[u];
|
|
}
|
|
|
|
/**
|
|
* ntfs_file_value_upcase
|
|
*/
|
|
void ntfs_file_value_upcase(FILE_NAME_ATTR *file_name_attr,
|
|
const ntfschar *upcase, const u32 upcase_len)
|
|
{
|
|
ntfs_name_upcase((ntfschar*)&file_name_attr->file_name,
|
|
file_name_attr->file_name_length, upcase, upcase_len);
|
|
}
|
|
|
|
/**
|
|
* ntfs_file_values_compare
|
|
*/
|
|
int ntfs_file_values_compare(const FILE_NAME_ATTR *file_name_attr1,
|
|
const FILE_NAME_ATTR *file_name_attr2,
|
|
const int err_val, const IGNORE_CASE_BOOL ic,
|
|
const ntfschar *upcase, const u32 upcase_len)
|
|
{
|
|
return ntfs_names_collate((ntfschar*)&file_name_attr1->file_name,
|
|
file_name_attr1->file_name_length,
|
|
(ntfschar*)&file_name_attr2->file_name,
|
|
file_name_attr2->file_name_length,
|
|
err_val, ic, upcase, upcase_len);
|
|
}
|
|
|
|
/**
|
|
* ntfs_ucstombs - convert a little endian Unicode string to a multibyte string
|
|
* @ins: input Unicode string buffer
|
|
* @ins_len: length of input string in Unicode characters
|
|
* @outs: on return contains the (allocated) output multibyte string
|
|
* @outs_len: length of output buffer in bytes
|
|
*
|
|
* Convert the input little endian, 2-byte Unicode string @ins, of length
|
|
* @ins_len into the multibyte string format dictated by the current locale.
|
|
*
|
|
* If *@outs is NULL, the function allocates the string and the caller is
|
|
* responsible for calling free(*@outs); when finished with it.
|
|
*
|
|
* On success the function returns the number of bytes written to the output
|
|
* string *@outs (>= 0), not counting the terminating NULL byte. If the output
|
|
* string buffer was allocated, *@outs is set to it.
|
|
*
|
|
* On error, -1 is returned, and errno is set to the error code. The following
|
|
* error codes can be expected:
|
|
* EINVAL Invalid arguments (e.g. @ins or @outs is NULL).
|
|
* EILSEQ The input string cannot be represented as a multibyte
|
|
* sequence according to the current locale.
|
|
* ENAMETOOLONG Destination buffer is too small for input string.
|
|
* ENOMEM Not enough memory to allocate destination buffer.
|
|
*/
|
|
int ntfs_ucstombs(const ntfschar *ins, const int ins_len, char **outs,
|
|
int outs_len)
|
|
{
|
|
char *mbs;
|
|
wchar_t wc;
|
|
int i, o, mbs_len;
|
|
int cnt = 0;
|
|
#ifdef HAVE_MBSINIT
|
|
mbstate_t mbstate;
|
|
#endif
|
|
|
|
if (!ins || !outs) {
|
|
errno = EINVAL;
|
|
return -1;
|
|
}
|
|
mbs = *outs;
|
|
mbs_len = outs_len;
|
|
if (mbs && !mbs_len) {
|
|
errno = ENAMETOOLONG;
|
|
return -1;
|
|
}
|
|
if (!mbs) {
|
|
mbs_len = (ins_len + 1) * MB_CUR_MAX;
|
|
mbs = (char*)malloc(mbs_len);
|
|
if (!mbs)
|
|
return -1;
|
|
}
|
|
#ifdef HAVE_MBSINIT
|
|
memset(&mbstate, 0, sizeof(mbstate));
|
|
#else
|
|
wctomb(NULL, 0);
|
|
#endif
|
|
for (i = o = 0; i < ins_len; i++) {
|
|
/* Reallocate memory if necessary or abort. */
|
|
if ((int)(o + MB_CUR_MAX) > mbs_len) {
|
|
char *tc;
|
|
if (mbs == *outs) {
|
|
errno = ENAMETOOLONG;
|
|
return -1;
|
|
}
|
|
tc = (char*)malloc((mbs_len + 64) & ~63);
|
|
if (!tc)
|
|
goto err_out;
|
|
memcpy(tc, mbs, mbs_len);
|
|
mbs_len = (mbs_len + 64) & ~63;
|
|
free(mbs);
|
|
mbs = tc;
|
|
}
|
|
/* Convert the LE Unicode character to a CPU wide character. */
|
|
wc = (wchar_t)le16_to_cpu(ins[i]);
|
|
if (!wc)
|
|
break;
|
|
/* Convert the CPU endian wide character to multibyte. */
|
|
#ifdef HAVE_MBSINIT
|
|
cnt = wcrtomb(mbs + o, wc, &mbstate);
|
|
#else
|
|
cnt = wctomb(mbs + o, wc);
|
|
#endif
|
|
if (cnt == -1)
|
|
goto err_out;
|
|
if (cnt <= 0) {
|
|
Dprintf("Eeek. cnt <= 0, cnt = %i\n", cnt);
|
|
errno = EINVAL;
|
|
goto err_out;
|
|
}
|
|
o += cnt;
|
|
}
|
|
#ifdef HAVE_MBSINIT
|
|
/* Make sure we are back in the initial state. */
|
|
if (!mbsinit(&mbstate)) {
|
|
Dputs("Eeek. mbstate not in initial state!");
|
|
errno = EILSEQ;
|
|
goto err_out;
|
|
}
|
|
#endif
|
|
/* Now write the NULL character. */
|
|
mbs[o] = '\0';
|
|
if (*outs != mbs)
|
|
*outs = mbs;
|
|
return o;
|
|
err_out:
|
|
if (mbs != *outs) {
|
|
int eo = errno;
|
|
free(mbs);
|
|
errno = eo;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
/**
|
|
* ntfs_mbstoucs - convert a multibyte string to a little endian Unicode string
|
|
* @ins: input multibyte string buffer
|
|
* @outs: on return contains the (allocated) output Unicode string
|
|
* @outs_len: length of output buffer in Unicode characters
|
|
*
|
|
* Convert the input multibyte string @ins, from the current locale into the
|
|
* corresponding little endian, 2-byte Unicode string.
|
|
*
|
|
* If *@outs is NULL, the function allocates the string and the caller is
|
|
* responsible for calling free(*@outs); when finished with it.
|
|
*
|
|
* On success the function returns the number of Unicode characters written to
|
|
* the output string *@outs (>= 0), not counting the terminating Unicode NULL
|
|
* character. If the output string buffer was allocated, *@outs is set to it.
|
|
*
|
|
* On error, -1 is returned, and errno is set to the error code. The following
|
|
* error codes can be expected:
|
|
* EINVAL Invalid arguments (e.g. @ins or @outs is NULL).
|
|
* EILSEQ The input string cannot be represented as a Unicode
|
|
* string according to the current locale.
|
|
* ENAMETOOLONG Destination buffer is too small for input string.
|
|
* ENOMEM Not enough memory to allocate destination buffer.
|
|
*/
|
|
int ntfs_mbstoucs(const char *ins, ntfschar **outs, int outs_len)
|
|
{
|
|
ntfschar *ucs;
|
|
const char *s;
|
|
wchar_t wc;
|
|
int i, o, cnt, ins_len, ucs_len, ins_size;
|
|
#ifdef HAVE_MBSINIT
|
|
mbstate_t mbstate;
|
|
#endif
|
|
|
|
if (!ins || !outs) {
|
|
errno = EINVAL;
|
|
return -1;
|
|
}
|
|
ucs = *outs;
|
|
ucs_len = outs_len;
|
|
if (ucs && !ucs_len) {
|
|
errno = ENAMETOOLONG;
|
|
return -1;
|
|
}
|
|
/* Determine the size of the multi-byte string in bytes. */
|
|
ins_size = strlen(ins);
|
|
/* Determine the length of the multi-byte string. */
|
|
s = ins;
|
|
#if defined(HAVE_MBSINIT)
|
|
memset(&mbstate, 0, sizeof(mbstate));
|
|
ins_len = mbsrtowcs(NULL, (const char **)&s, 0, &mbstate);
|
|
#ifdef __CYGWIN32__
|
|
if (!ins_len && *ins) {
|
|
/* Older Cygwin had broken mbsrtowcs() implementation. */
|
|
ins_len = strlen(ins);
|
|
}
|
|
#endif
|
|
#elif !defined(DJGPP)
|
|
ins_len = mbstowcs(NULL, s, 0);
|
|
#else
|
|
/* Eeek!!! DJGPP has broken mbstowcs() implementation!!! */
|
|
ins_len = strlen(ins);
|
|
#endif
|
|
if (ins_len == -1)
|
|
return ins_len;
|
|
#ifdef HAVE_MBSINIT
|
|
if ((s != ins) || !mbsinit(&mbstate)) {
|
|
#else
|
|
if (s != ins) {
|
|
#endif
|
|
errno = EILSEQ;
|
|
return -1;
|
|
}
|
|
/* Add the NULL terminator. */
|
|
ins_len++;
|
|
if (!ucs) {
|
|
ucs_len = ins_len;
|
|
ucs = (ntfschar*)malloc(ucs_len * sizeof(ntfschar));
|
|
if (!ucs)
|
|
return -1;
|
|
}
|
|
#ifdef HAVE_MBSINIT
|
|
memset(&mbstate, 0, sizeof(mbstate));
|
|
#else
|
|
mbtowc(NULL, NULL, 0);
|
|
#endif
|
|
for (i = o = cnt = 0; i < ins_size; i += cnt, o++) {
|
|
/* Reallocate memory if necessary or abort. */
|
|
if (o >= ucs_len) {
|
|
ntfschar *tc;
|
|
if (ucs == *outs) {
|
|
errno = ENAMETOOLONG;
|
|
return -1;
|
|
}
|
|
/*
|
|
* We will never get here but hey, it's only a bit of
|
|
* extra code...
|
|
*/
|
|
ucs_len = (ucs_len * sizeof(ntfschar) + 64) & ~63;
|
|
tc = (ntfschar*)realloc(ucs, ucs_len);
|
|
if (!tc)
|
|
goto err_out;
|
|
ucs = tc;
|
|
ucs_len /= sizeof(ntfschar);
|
|
}
|
|
/* Convert the multibyte character to a wide character. */
|
|
#ifdef HAVE_MBSINIT
|
|
cnt = mbrtowc(&wc, ins + i, ins_size - i, &mbstate);
|
|
#else
|
|
cnt = mbtowc(&wc, ins + i, ins_size - i);
|
|
#endif
|
|
if (!cnt)
|
|
break;
|
|
if (cnt == -1)
|
|
goto err_out;
|
|
if (cnt < -1) {
|
|
Dprintf("%s(): Eeek. cnt = %i\n", __FUNCTION__, cnt);
|
|
errno = EINVAL;
|
|
goto err_out;
|
|
}
|
|
/* Make sure we are not overflowing the NTFS Unicode set. */
|
|
if ((unsigned long)wc >= (unsigned long)(1 <<
|
|
(8 * sizeof(ntfschar)))) {
|
|
errno = EILSEQ;
|
|
goto err_out;
|
|
}
|
|
/* Convert the CPU wide character to a LE Unicode character. */
|
|
ucs[o] = cpu_to_le16(wc);
|
|
}
|
|
#ifdef HAVE_MBSINIT
|
|
/* Make sure we are back in the initial state. */
|
|
if (!mbsinit(&mbstate)) {
|
|
Dprintf("%s(): Eeek. mbstate not in initial state!\n",
|
|
__FUNCTION__);
|
|
errno = EILSEQ;
|
|
goto err_out;
|
|
}
|
|
#endif
|
|
/* Now write the NULL character. */
|
|
ucs[o] = cpu_to_le16(L'\0');
|
|
if (*outs != ucs)
|
|
*outs = ucs;
|
|
return o;
|
|
err_out:
|
|
if (ucs != *outs) {
|
|
int eo = errno;
|
|
free(ucs);
|
|
errno = eo;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
/**
|
|
* ntfs_upcase_table_build - build the default upcase table for NTFS
|
|
* @uc: destination buffer where to store the built table
|
|
* @uc_len: size of destination buffer in bytes
|
|
*
|
|
* ntfs_upcase_table_build() builds the default upcase table for NTFS and
|
|
* stores it in the caller supplied buffer @uc of size @uc_len.
|
|
*
|
|
* Note, @uc_len must be at least 128kiB in size or bad things will happen!
|
|
*/
|
|
void ntfs_upcase_table_build(ntfschar *uc, u32 uc_len)
|
|
{
|
|
static int uc_run_table[][3] = { /* Start, End, Add */
|
|
{0x0061, 0x007B, -32}, {0x0451, 0x045D, -80}, {0x1F70, 0x1F72, 74},
|
|
{0x00E0, 0x00F7, -32}, {0x045E, 0x0460, -80}, {0x1F72, 0x1F76, 86},
|
|
{0x00F8, 0x00FF, -32}, {0x0561, 0x0587, -48}, {0x1F76, 0x1F78, 100},
|
|
{0x0256, 0x0258, -205}, {0x1F00, 0x1F08, 8}, {0x1F78, 0x1F7A, 128},
|
|
{0x028A, 0x028C, -217}, {0x1F10, 0x1F16, 8}, {0x1F7A, 0x1F7C, 112},
|
|
{0x03AC, 0x03AD, -38}, {0x1F20, 0x1F28, 8}, {0x1F7C, 0x1F7E, 126},
|
|
{0x03AD, 0x03B0, -37}, {0x1F30, 0x1F38, 8}, {0x1FB0, 0x1FB2, 8},
|
|
{0x03B1, 0x03C2, -32}, {0x1F40, 0x1F46, 8}, {0x1FD0, 0x1FD2, 8},
|
|
{0x03C2, 0x03C3, -31}, {0x1F51, 0x1F52, 8}, {0x1FE0, 0x1FE2, 8},
|
|
{0x03C3, 0x03CC, -32}, {0x1F53, 0x1F54, 8}, {0x1FE5, 0x1FE6, 7},
|
|
{0x03CC, 0x03CD, -64}, {0x1F55, 0x1F56, 8}, {0x2170, 0x2180, -16},
|
|
{0x03CD, 0x03CF, -63}, {0x1F57, 0x1F58, 8}, {0x24D0, 0x24EA, -26},
|
|
{0x0430, 0x0450, -32}, {0x1F60, 0x1F68, 8}, {0xFF41, 0xFF5B, -32},
|
|
{0}
|
|
};
|
|
static int uc_dup_table[][2] = { /* Start, End */
|
|
{0x0100, 0x012F}, {0x01A0, 0x01A6}, {0x03E2, 0x03EF}, {0x04CB, 0x04CC},
|
|
{0x0132, 0x0137}, {0x01B3, 0x01B7}, {0x0460, 0x0481}, {0x04D0, 0x04EB},
|
|
{0x0139, 0x0149}, {0x01CD, 0x01DD}, {0x0490, 0x04BF}, {0x04EE, 0x04F5},
|
|
{0x014A, 0x0178}, {0x01DE, 0x01EF}, {0x04BF, 0x04BF}, {0x04F8, 0x04F9},
|
|
{0x0179, 0x017E}, {0x01F4, 0x01F5}, {0x04C1, 0x04C4}, {0x1E00, 0x1E95},
|
|
{0x018B, 0x018B}, {0x01FA, 0x0218}, {0x04C7, 0x04C8}, {0x1EA0, 0x1EF9},
|
|
{0}
|
|
};
|
|
static int uc_byte_table[][2] = { /* Offset, Value */
|
|
{0x00FF, 0x0178}, {0x01AD, 0x01AC}, {0x01F3, 0x01F1}, {0x0269, 0x0196},
|
|
{0x0183, 0x0182}, {0x01B0, 0x01AF}, {0x0253, 0x0181}, {0x026F, 0x019C},
|
|
{0x0185, 0x0184}, {0x01B9, 0x01B8}, {0x0254, 0x0186}, {0x0272, 0x019D},
|
|
{0x0188, 0x0187}, {0x01BD, 0x01BC}, {0x0259, 0x018F}, {0x0275, 0x019F},
|
|
{0x018C, 0x018B}, {0x01C6, 0x01C4}, {0x025B, 0x0190}, {0x0283, 0x01A9},
|
|
{0x0192, 0x0191}, {0x01C9, 0x01C7}, {0x0260, 0x0193}, {0x0288, 0x01AE},
|
|
{0x0199, 0x0198}, {0x01CC, 0x01CA}, {0x0263, 0x0194}, {0x0292, 0x01B7},
|
|
{0x01A8, 0x01A7}, {0x01DD, 0x018E}, {0x0268, 0x0197},
|
|
{0}
|
|
};
|
|
int i, r;
|
|
|
|
memset((char*)uc, 0, uc_len);
|
|
uc_len >>= 1;
|
|
if (uc_len > 65536)
|
|
uc_len = 65536;
|
|
for (i = 0; (u32)i < uc_len; i++)
|
|
uc[i] = i;
|
|
for (r = 0; uc_run_table[r][0]; r++)
|
|
for (i = uc_run_table[r][0]; i < uc_run_table[r][1]; i++)
|
|
uc[i] += uc_run_table[r][2];
|
|
for (r = 0; uc_dup_table[r][0]; r++)
|
|
for (i = uc_dup_table[r][0]; i < uc_dup_table[r][1]; i += 2)
|
|
uc[i + 1]--;
|
|
for (r = 0; uc_byte_table[r][0]; r++)
|
|
uc[uc_byte_table[r][0]] = uc_byte_table[r][1];
|
|
}
|