2006-10-31 06:32:48 +08:00
|
|
|
/**
|
|
|
|
* unistr.c - Unicode string handling. Originated from the Linux-NTFS project.
|
|
|
|
*
|
|
|
|
* Copyright (c) 2000-2004 Anton Altaparmakov
|
2009-01-23 19:11:44 +08:00
|
|
|
* Copyright (c) 2002-2009 Szabolcs Szakacsits
|
2015-04-17 17:03:58 +08:00
|
|
|
* Copyright (c) 2008-2015 Jean-Pierre Andre
|
2008-08-21 20:04:51 +08:00
|
|
|
* Copyright (c) 2008 Bernhard Kaindl
|
2006-10-31 06:32:48 +08:00
|
|
|
*
|
|
|
|
* 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 NTFS-3G
|
|
|
|
* distribution in the file COPYING); if not, write to the Free Software
|
|
|
|
* Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
#include "config.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#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
|
2008-08-21 20:04:51 +08:00
|
|
|
#ifdef HAVE_LOCALE_H
|
|
|
|
#include <locale.h>
|
|
|
|
#endif
|
2006-10-31 06:32:48 +08:00
|
|
|
|
2009-11-05 19:40:44 +08:00
|
|
|
#if defined(__APPLE__) || defined(__DARWIN__)
|
|
|
|
#ifdef ENABLE_NFCONV
|
|
|
|
#include <CoreFoundation/CoreFoundation.h>
|
|
|
|
#endif /* ENABLE_NFCONV */
|
|
|
|
#endif /* defined(__APPLE__) || defined(__DARWIN__) */
|
|
|
|
|
2009-01-23 19:11:44 +08:00
|
|
|
#include "compat.h"
|
2006-10-31 06:32:48 +08:00
|
|
|
#include "attrib.h"
|
|
|
|
#include "types.h"
|
|
|
|
#include "unistr.h"
|
|
|
|
#include "debug.h"
|
|
|
|
#include "logging.h"
|
|
|
|
#include "misc.h"
|
|
|
|
|
2016-04-12 23:02:40 +08:00
|
|
|
#ifndef ALLOW_BROKEN_UNICODE
|
|
|
|
/* Erik allowing broken UTF-16 surrogate pairs and U+FFFE and U+FFFF by default,
|
|
|
|
* open to debate. */
|
|
|
|
#define ALLOW_BROKEN_UNICODE 1
|
|
|
|
#endif /* !defined(ALLOW_BROKEN_UNICODE) */
|
2016-04-08 11:39:48 +08:00
|
|
|
|
2006-10-31 06:32:48 +08:00
|
|
|
/*
|
|
|
|
* IMPORTANT
|
|
|
|
* =========
|
|
|
|
*
|
|
|
|
* All these routines assume that the Unicode characters are in little endian
|
|
|
|
* encoding inside the strings!!!
|
|
|
|
*/
|
|
|
|
|
2008-08-21 20:04:51 +08:00
|
|
|
static int use_utf8 = 1; /* use UTF-8 encoding for file names */
|
|
|
|
|
2009-11-05 19:40:44 +08:00
|
|
|
#if defined(__APPLE__) || defined(__DARWIN__)
|
|
|
|
#ifdef ENABLE_NFCONV
|
|
|
|
/**
|
|
|
|
* This variable controls whether or not automatic normalization form conversion
|
|
|
|
* should be performed when translating NTFS unicode file names to UTF-8.
|
|
|
|
* Defaults to on, but can be controlled from the outside using the function
|
|
|
|
* int ntfs_macosx_normalize_filenames(int normalize);
|
|
|
|
*/
|
|
|
|
static int nfconvert_utf8 = 1;
|
|
|
|
#endif /* ENABLE_NFCONV */
|
|
|
|
#endif /* defined(__APPLE__) || defined(__DARWIN__) */
|
|
|
|
|
2006-10-31 06:32:48 +08:00
|
|
|
/*
|
|
|
|
* 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;
|
|
|
|
}
|
|
|
|
|
2009-12-16 17:45:28 +08:00
|
|
|
/*
|
|
|
|
* ntfs_names_full_collate() fully collate two Unicode names
|
|
|
|
*
|
2006-10-31 06:32:48 +08:00
|
|
|
* @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
|
|
|
|
* @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)
|
|
|
|
*
|
|
|
|
* -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
|
2008-01-11 01:32:55 +08:00
|
|
|
*
|
2006-10-31 06:32:48 +08:00
|
|
|
*/
|
2009-12-16 17:45:28 +08:00
|
|
|
int ntfs_names_full_collate(const ntfschar *name1, const u32 name1_len,
|
2006-10-31 06:32:48 +08:00
|
|
|
const ntfschar *name2, const u32 name2_len,
|
|
|
|
const IGNORE_CASE_BOOL ic, const ntfschar *upcase,
|
|
|
|
const u32 upcase_len)
|
|
|
|
{
|
|
|
|
u32 cnt;
|
2009-11-24 22:18:53 +08:00
|
|
|
u16 c1, c2;
|
2009-12-16 17:45:28 +08:00
|
|
|
u16 u1, u2;
|
2006-10-31 06:32:48 +08:00
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
if (!name1 || !name2 || (ic && (!upcase || !upcase_len))) {
|
|
|
|
ntfs_log_debug("ntfs_names_collate received NULL pointer!\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
#endif
|
2008-01-11 01:32:55 +08:00
|
|
|
cnt = min(name1_len, name2_len);
|
|
|
|
if (cnt > 0) {
|
2009-12-16 17:45:28 +08:00
|
|
|
if (ic == CASE_SENSITIVE) {
|
2010-10-26 14:59:51 +08:00
|
|
|
while (--cnt && (*name1 == *name2)) {
|
2008-01-11 01:32:55 +08:00
|
|
|
name1++;
|
|
|
|
name2++;
|
2010-10-26 14:59:51 +08:00
|
|
|
}
|
|
|
|
u1 = c1 = le16_to_cpu(*name1);
|
|
|
|
u2 = c2 = le16_to_cpu(*name2);
|
2009-12-16 17:45:28 +08:00
|
|
|
if (u1 < upcase_len)
|
|
|
|
u1 = le16_to_cpu(upcase[u1]);
|
|
|
|
if (u2 < upcase_len)
|
|
|
|
u2 = le16_to_cpu(upcase[u2]);
|
|
|
|
if ((u1 == u2) && cnt)
|
|
|
|
do {
|
|
|
|
name1++;
|
2010-10-26 14:59:51 +08:00
|
|
|
u1 = le16_to_cpu(*name1);
|
2009-12-16 17:45:28 +08:00
|
|
|
name2++;
|
2010-10-26 14:59:51 +08:00
|
|
|
u2 = le16_to_cpu(*name2);
|
2009-12-16 17:45:28 +08:00
|
|
|
if (u1 < upcase_len)
|
|
|
|
u1 = le16_to_cpu(upcase[u1]);
|
|
|
|
if (u2 < upcase_len)
|
|
|
|
u2 = le16_to_cpu(upcase[u2]);
|
|
|
|
} while ((u1 == u2) && --cnt);
|
|
|
|
if (u1 < u2)
|
|
|
|
return -1;
|
|
|
|
if (u1 > u2)
|
|
|
|
return 1;
|
|
|
|
if (name1_len < name2_len)
|
|
|
|
return -1;
|
|
|
|
if (name1_len > name2_len)
|
|
|
|
return 1;
|
|
|
|
if (c1 < c2)
|
|
|
|
return -1;
|
|
|
|
if (c1 > c2)
|
|
|
|
return 1;
|
|
|
|
} else {
|
2008-01-11 01:32:55 +08:00
|
|
|
do {
|
2009-12-16 17:45:28 +08:00
|
|
|
u1 = c1 = le16_to_cpu(*name1);
|
2008-01-11 01:32:55 +08:00
|
|
|
name1++;
|
2009-12-16 17:45:28 +08:00
|
|
|
u2 = c2 = le16_to_cpu(*name2);
|
2008-01-11 01:32:55 +08:00
|
|
|
name2++;
|
2009-12-16 17:45:28 +08:00
|
|
|
if (u1 < upcase_len)
|
|
|
|
u1 = le16_to_cpu(upcase[u1]);
|
|
|
|
if (u2 < upcase_len)
|
|
|
|
u2 = le16_to_cpu(upcase[u2]);
|
|
|
|
} while ((u1 == u2) && --cnt);
|
|
|
|
if (u1 < u2)
|
|
|
|
return -1;
|
|
|
|
if (u1 > u2)
|
|
|
|
return 1;
|
|
|
|
if (name1_len < name2_len)
|
|
|
|
return -1;
|
|
|
|
if (name1_len > name2_len)
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (name1_len < name2_len)
|
2006-10-31 06:32:48 +08:00
|
|
|
return -1;
|
2009-12-16 17:45:28 +08:00
|
|
|
if (name1_len > name2_len)
|
2006-10-31 06:32:48 +08:00
|
|
|
return 1;
|
|
|
|
}
|
2009-12-16 17:45:28 +08:00
|
|
|
return 0;
|
2006-10-31 06:32:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* 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)
|
|
|
|
{
|
2015-12-22 06:55:31 +08:00
|
|
|
u16 c1, c2;
|
2006-10-31 06:32:48 +08:00
|
|
|
size_t i;
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
if (!s1 || !s2) {
|
|
|
|
ntfs_log_debug("ntfs_wcsncmp() received NULL pointer!\n");
|
|
|
|
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)
|
|
|
|
{
|
2009-11-24 22:18:53 +08:00
|
|
|
u16 c1, c2;
|
2006-10-31 06:32:48 +08:00
|
|
|
size_t i;
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
if (!s1 || !s2 || !upcase) {
|
|
|
|
ntfs_log_debug("ntfs_wcsncasecmp() received NULL pointer!\n");
|
|
|
|
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 ntfs_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 = ntfs_malloc((len + 1) * sizeof(ntfschar));
|
|
|
|
if (dst) {
|
|
|
|
memcpy(dst, s, len * sizeof(ntfschar));
|
2015-12-22 06:21:00 +08:00
|
|
|
dst[len] = const_cpu_to_le16(L'\0');
|
2006-10-31 06:32:48 +08:00
|
|
|
}
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* ntfs_name_upcase - Map an Unicode name to its uppercase equivalent
|
|
|
|
* @name:
|
|
|
|
* @name_len:
|
|
|
|
* @upcase:
|
|
|
|
* @upcase_len:
|
|
|
|
*
|
|
|
|
* Description...
|
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
*/
|
|
|
|
void ntfs_name_upcase(ntfschar *name, u32 name_len, const ntfschar *upcase,
|
|
|
|
const u32 upcase_len)
|
|
|
|
{
|
|
|
|
u32 i;
|
2009-11-24 22:18:53 +08:00
|
|
|
u16 u;
|
2006-10-31 06:32:48 +08:00
|
|
|
|
|
|
|
for (i = 0; i < name_len; i++)
|
|
|
|
if ((u = le16_to_cpu(name[i])) < upcase_len)
|
|
|
|
name[i] = upcase[u];
|
|
|
|
}
|
|
|
|
|
2010-05-25 16:12:44 +08:00
|
|
|
/**
|
|
|
|
* ntfs_name_locase - Map a Unicode name to its lowercase equivalent
|
|
|
|
*/
|
|
|
|
void ntfs_name_locase(ntfschar *name, u32 name_len, const ntfschar *locase,
|
|
|
|
const u32 locase_len)
|
|
|
|
{
|
|
|
|
u32 i;
|
|
|
|
u16 u;
|
|
|
|
|
|
|
|
if (locase)
|
|
|
|
for (i = 0; i < name_len; i++)
|
|
|
|
if ((u = le16_to_cpu(name[i])) < locase_len)
|
|
|
|
name[i] = locase[u];
|
|
|
|
}
|
|
|
|
|
2006-10-31 06:32:48 +08:00
|
|
|
/**
|
|
|
|
* ntfs_file_value_upcase - Convert a filename to upper case
|
|
|
|
* @file_name_attr:
|
|
|
|
* @upcase:
|
|
|
|
* @upcase_len:
|
|
|
|
*
|
|
|
|
* Description...
|
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
*/
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
2009-01-05 21:28:06 +08:00
|
|
|
/*
|
|
|
|
NTFS uses Unicode (UTF-16LE [NTFS-3G uses UCS-2LE, which is enough
|
|
|
|
for now]) for path names, but the Unicode code points need to be
|
|
|
|
converted before a path can be accessed under NTFS. For 7 bit ASCII/ANSI,
|
|
|
|
glibc does this even without a locale in a hard-coded fashion as that
|
|
|
|
appears to be is easy because the low 7-bit ASCII range appears to be
|
|
|
|
available in all charsets but it does not convert anything if
|
|
|
|
there was some error with the locale setup or none set up like
|
|
|
|
when mount is called during early boot where he (by policy) do
|
|
|
|
not use locales (and may be not available if /usr is not yet mounted),
|
|
|
|
so this patch fixes the resulting issues for systems which use
|
|
|
|
UTF-8 and for others, specifying the locale in fstab brings them
|
|
|
|
the encoding which they want.
|
|
|
|
|
|
|
|
If no locale is defined or there was a problem with setting one
|
|
|
|
up and whenever nl_langinfo(CODESET) returns a sting starting with
|
|
|
|
"ANSI", use an internal UCS-2LE <-> UTF-8 codeset converter to fix
|
|
|
|
the bug where NTFS-3G does not show any path names which include
|
|
|
|
international characters!!! (and also fails on creating them) as result.
|
|
|
|
|
|
|
|
Author: Bernhard Kaindl <bk@suse.de>
|
|
|
|
Jean-Pierre Andre made it compliant with RFC3629/RFC2781.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return the amount of 8-bit elements in UTF-8 needed (without the terminating
|
|
|
|
* null) to store a given UTF-16LE string.
|
|
|
|
*
|
|
|
|
* Return -1 with errno set if string has invalid byte sequence or too long.
|
|
|
|
*/
|
|
|
|
static int utf16_to_utf8_size(const ntfschar *ins, const int ins_len, int outs_len)
|
|
|
|
{
|
|
|
|
int i, ret = -1;
|
|
|
|
int count = 0;
|
|
|
|
BOOL surrog;
|
|
|
|
|
|
|
|
surrog = FALSE;
|
|
|
|
for (i = 0; i < ins_len && ins[i]; i++) {
|
|
|
|
unsigned short c = le16_to_cpu(ins[i]);
|
|
|
|
if (surrog) {
|
|
|
|
if ((c >= 0xdc00) && (c < 0xe000)) {
|
|
|
|
surrog = FALSE;
|
|
|
|
count += 4;
|
2016-04-08 11:39:48 +08:00
|
|
|
} else {
|
2016-04-12 23:02:40 +08:00
|
|
|
#if ALLOW_BROKEN_UNICODE
|
2016-04-08 11:39:48 +08:00
|
|
|
/* The first UTF-16 unit of a surrogate pair has
|
|
|
|
* a value between 0xd800 and 0xdc00. It can be
|
|
|
|
* encoded as an individual UTF-8 sequence if we
|
|
|
|
* cannot combine it with the next UTF-16 unit
|
|
|
|
* unit as a surrogate pair. */
|
|
|
|
surrog = FALSE;
|
|
|
|
count += 3;
|
|
|
|
|
|
|
|
--i;
|
|
|
|
continue;
|
|
|
|
#else
|
2009-01-05 21:28:06 +08:00
|
|
|
goto fail;
|
2016-04-12 23:02:40 +08:00
|
|
|
#endif /* ALLOW_BROKEN_UNICODE */
|
2016-04-08 11:39:48 +08:00
|
|
|
}
|
2009-01-05 21:28:06 +08:00
|
|
|
} else
|
|
|
|
if (c < 0x80)
|
|
|
|
count++;
|
|
|
|
else if (c < 0x800)
|
|
|
|
count += 2;
|
|
|
|
else if (c < 0xd800)
|
|
|
|
count += 3;
|
|
|
|
else if (c < 0xdc00)
|
|
|
|
surrog = TRUE;
|
2016-04-12 23:02:40 +08:00
|
|
|
#if ALLOW_BROKEN_UNICODE
|
2016-04-08 11:39:48 +08:00
|
|
|
else if (c < 0xe000)
|
|
|
|
count += 3;
|
2009-01-05 21:28:06 +08:00
|
|
|
else if (c >= 0xe000)
|
2016-04-12 23:02:40 +08:00
|
|
|
#else
|
|
|
|
else if ((c >= 0xe000) && (c < 0xfffe))
|
|
|
|
#endif /* ALLOW_BROKEN_UNICODE */
|
2009-01-05 21:28:06 +08:00
|
|
|
count += 3;
|
|
|
|
else
|
|
|
|
goto fail;
|
|
|
|
if (count > outs_len) {
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (surrog)
|
2016-04-12 23:02:40 +08:00
|
|
|
#if ALLOW_BROKEN_UNICODE
|
2016-04-08 11:39:48 +08:00
|
|
|
count += 3; /* ending with a single surrogate */
|
|
|
|
#else
|
2009-01-05 21:28:06 +08:00
|
|
|
goto fail;
|
2016-04-12 23:02:40 +08:00
|
|
|
#endif /* ALLOW_BROKEN_UNICODE */
|
2009-01-05 21:28:06 +08:00
|
|
|
|
|
|
|
ret = count;
|
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
fail:
|
|
|
|
errno = EILSEQ;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ntfs_utf16_to_utf8 - convert a little endian UTF16LE string to an UTF-8 string
|
|
|
|
* @ins: input utf16 string buffer
|
|
|
|
* @ins_len: length of input string in utf16 characters
|
|
|
|
* @outs: on return contains the (allocated) output multibyte string
|
|
|
|
* @outs_len: length of output buffer in bytes
|
|
|
|
*
|
|
|
|
* Return -1 with errno set if string has invalid byte sequence or too long.
|
|
|
|
*/
|
|
|
|
static int ntfs_utf16_to_utf8(const ntfschar *ins, const int ins_len,
|
|
|
|
char **outs, int outs_len)
|
|
|
|
{
|
2009-11-05 19:40:44 +08:00
|
|
|
#if defined(__APPLE__) || defined(__DARWIN__)
|
|
|
|
#ifdef ENABLE_NFCONV
|
|
|
|
char *original_outs_value = *outs;
|
|
|
|
int original_outs_len = outs_len;
|
|
|
|
#endif /* ENABLE_NFCONV */
|
|
|
|
#endif /* defined(__APPLE__) || defined(__DARWIN__) */
|
|
|
|
|
2009-01-05 21:28:06 +08:00
|
|
|
char *t;
|
|
|
|
int i, size, ret = -1;
|
2009-11-24 22:18:53 +08:00
|
|
|
int halfpair;
|
2009-01-05 21:28:06 +08:00
|
|
|
|
|
|
|
halfpair = 0;
|
|
|
|
if (!*outs)
|
|
|
|
outs_len = PATH_MAX;
|
|
|
|
|
|
|
|
size = utf16_to_utf8_size(ins, ins_len, outs_len);
|
|
|
|
|
|
|
|
if (size < 0)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if (!*outs) {
|
|
|
|
outs_len = size + 1;
|
|
|
|
*outs = ntfs_malloc(outs_len);
|
|
|
|
if (!*outs)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
t = *outs;
|
|
|
|
|
|
|
|
for (i = 0; i < ins_len && ins[i]; i++) {
|
|
|
|
unsigned short c = le16_to_cpu(ins[i]);
|
|
|
|
/* size not double-checked */
|
|
|
|
if (halfpair) {
|
|
|
|
if ((c >= 0xdc00) && (c < 0xe000)) {
|
|
|
|
*t++ = 0xf0 + (((halfpair + 64) >> 8) & 7);
|
|
|
|
*t++ = 0x80 + (((halfpair + 64) >> 2) & 63);
|
|
|
|
*t++ = 0x80 + ((c >> 6) & 15) + ((halfpair & 3) << 4);
|
|
|
|
*t++ = 0x80 + (c & 63);
|
|
|
|
halfpair = 0;
|
2016-04-08 11:39:48 +08:00
|
|
|
} else {
|
2016-04-12 23:02:40 +08:00
|
|
|
#if ALLOW_BROKEN_UNICODE
|
2016-04-08 11:39:48 +08:00
|
|
|
/* The first UTF-16 unit of a surrogate pair has
|
|
|
|
* a value between 0xd800 and 0xdc00. It can be
|
|
|
|
* encoded as an individual UTF-8 sequence if we
|
|
|
|
* cannot combine it with the next UTF-16 unit
|
|
|
|
* unit as a surrogate pair. */
|
|
|
|
*t++ = 0xe0 | (halfpair >> 12);
|
|
|
|
*t++ = 0x80 | ((halfpair >> 6) & 0x3f);
|
|
|
|
*t++ = 0x80 | (halfpair & 0x3f);
|
|
|
|
halfpair = 0;
|
|
|
|
|
|
|
|
--i;
|
|
|
|
continue;
|
|
|
|
#else
|
2009-01-05 21:28:06 +08:00
|
|
|
goto fail;
|
2016-04-12 23:02:40 +08:00
|
|
|
#endif /* ALLOW_BROKEN_UNICODE */
|
2016-04-08 11:39:48 +08:00
|
|
|
}
|
2009-01-05 21:28:06 +08:00
|
|
|
} else if (c < 0x80) {
|
|
|
|
*t++ = c;
|
|
|
|
} else {
|
|
|
|
if (c < 0x800) {
|
|
|
|
*t++ = (0xc0 | ((c >> 6) & 0x3f));
|
|
|
|
*t++ = 0x80 | (c & 0x3f);
|
|
|
|
} else if (c < 0xd800) {
|
|
|
|
*t++ = 0xe0 | (c >> 12);
|
|
|
|
*t++ = 0x80 | ((c >> 6) & 0x3f);
|
|
|
|
*t++ = 0x80 | (c & 0x3f);
|
|
|
|
} else if (c < 0xdc00)
|
|
|
|
halfpair = c;
|
2016-04-12 23:02:40 +08:00
|
|
|
#if ALLOW_BROKEN_UNICODE
|
2016-04-08 11:39:48 +08:00
|
|
|
else if (c < 0xe000) {
|
|
|
|
*t++ = 0xe0 | (c >> 12);
|
|
|
|
*t++ = 0x80 | ((c >> 6) & 0x3f);
|
|
|
|
*t++ = 0x80 | (c & 0x3f);
|
|
|
|
}
|
2016-04-12 23:02:40 +08:00
|
|
|
#endif /* ALLOW_BROKEN_UNICODE */
|
2009-01-05 21:28:06 +08:00
|
|
|
else if (c >= 0xe000) {
|
|
|
|
*t++ = 0xe0 | (c >> 12);
|
|
|
|
*t++ = 0x80 | ((c >> 6) & 0x3f);
|
|
|
|
*t++ = 0x80 | (c & 0x3f);
|
|
|
|
} else
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
}
|
2016-04-12 23:02:40 +08:00
|
|
|
#if ALLOW_BROKEN_UNICODE
|
2016-04-08 11:39:48 +08:00
|
|
|
if (halfpair) { /* ending with a single surrogate */
|
|
|
|
*t++ = 0xe0 | (halfpair >> 12);
|
|
|
|
*t++ = 0x80 | ((halfpair >> 6) & 0x3f);
|
|
|
|
*t++ = 0x80 | (halfpair & 0x3f);
|
|
|
|
}
|
2016-04-12 23:02:40 +08:00
|
|
|
#endif /* ALLOW_BROKEN_UNICODE */
|
2009-01-05 21:28:06 +08:00
|
|
|
*t = '\0';
|
2009-11-05 19:40:44 +08:00
|
|
|
|
|
|
|
#if defined(__APPLE__) || defined(__DARWIN__)
|
|
|
|
#ifdef ENABLE_NFCONV
|
|
|
|
if(nfconvert_utf8 && (t - *outs) > 0) {
|
|
|
|
char *new_outs = NULL;
|
|
|
|
int new_outs_len = ntfs_macosx_normalize_utf8(*outs, &new_outs, 0); // Normalize to decomposed form
|
|
|
|
if(new_outs_len >= 0 && new_outs != NULL) {
|
|
|
|
if(original_outs_value != *outs) {
|
|
|
|
// We have allocated outs ourselves.
|
|
|
|
free(*outs);
|
|
|
|
*outs = new_outs;
|
|
|
|
t = *outs + new_outs_len;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
// We need to copy new_outs into the fixed outs buffer.
|
|
|
|
memset(*outs, 0, original_outs_len);
|
|
|
|
strncpy(*outs, new_outs, original_outs_len-1);
|
|
|
|
t = *outs + original_outs_len;
|
|
|
|
free(new_outs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
ntfs_log_error("Failed to normalize NTFS string to UTF-8 NFD: %s\n", *outs);
|
|
|
|
ntfs_log_error(" new_outs=0x%p\n", new_outs);
|
|
|
|
ntfs_log_error(" new_outs_len=%d\n", new_outs_len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* ENABLE_NFCONV */
|
|
|
|
#endif /* defined(__APPLE__) || defined(__DARWIN__) */
|
|
|
|
|
2009-01-05 21:28:06 +08:00
|
|
|
ret = t - *outs;
|
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
fail:
|
|
|
|
errno = EILSEQ;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return the amount of 16-bit elements in UTF-16LE needed
|
|
|
|
* (without the terminating null) to store given UTF-8 string.
|
|
|
|
*
|
|
|
|
* Return -1 with errno set if it's longer than PATH_MAX or string is invalid.
|
|
|
|
*
|
|
|
|
* Note: This does not check whether the input sequence is a valid utf8 string,
|
|
|
|
* and should be used only in context where such check is made!
|
|
|
|
*/
|
|
|
|
static int utf8_to_utf16_size(const char *s)
|
|
|
|
{
|
|
|
|
int ret = -1;
|
|
|
|
unsigned int byte;
|
|
|
|
size_t count = 0;
|
|
|
|
|
|
|
|
while ((byte = *((const unsigned char *)s++))) {
|
|
|
|
if (++count >= PATH_MAX)
|
|
|
|
goto fail;
|
2009-12-09 19:19:27 +08:00
|
|
|
if (byte >= 0xc0) {
|
|
|
|
if (byte >= 0xF5) {
|
|
|
|
errno = EILSEQ;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (!*s)
|
|
|
|
break;
|
|
|
|
if (byte >= 0xC0)
|
|
|
|
s++;
|
|
|
|
if (!*s)
|
|
|
|
break;
|
|
|
|
if (byte >= 0xE0)
|
|
|
|
s++;
|
|
|
|
if (!*s)
|
|
|
|
break;
|
|
|
|
if (byte >= 0xF0) {
|
|
|
|
s++;
|
|
|
|
if (++count >= PATH_MAX)
|
|
|
|
goto fail;
|
|
|
|
}
|
2009-01-05 21:28:06 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
ret = count;
|
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
fail:
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* This converts one UTF-8 sequence to cpu-endian Unicode value
|
|
|
|
* within range U+0 .. U+10ffff and excluding U+D800 .. U+DFFF
|
|
|
|
*
|
|
|
|
* Return the number of used utf8 bytes or -1 with errno set
|
|
|
|
* if sequence is invalid.
|
|
|
|
*/
|
|
|
|
static int utf8_to_unicode(u32 *wc, const char *s)
|
|
|
|
{
|
|
|
|
unsigned int byte = *((const unsigned char *)s);
|
|
|
|
|
|
|
|
/* single byte */
|
|
|
|
if (byte == 0) {
|
|
|
|
*wc = (u32) 0;
|
|
|
|
return 0;
|
|
|
|
} else if (byte < 0x80) {
|
|
|
|
*wc = (u32) byte;
|
|
|
|
return 1;
|
|
|
|
/* double byte */
|
|
|
|
} else if (byte < 0xc2) {
|
|
|
|
goto fail;
|
|
|
|
} else if (byte < 0xE0) {
|
|
|
|
if ((s[1] & 0xC0) == 0x80) {
|
|
|
|
*wc = ((u32)(byte & 0x1F) << 6)
|
|
|
|
| ((u32)(s[1] & 0x3F));
|
|
|
|
return 2;
|
|
|
|
} else
|
|
|
|
goto fail;
|
|
|
|
/* three-byte */
|
|
|
|
} else if (byte < 0xF0) {
|
|
|
|
if (((s[1] & 0xC0) == 0x80) && ((s[2] & 0xC0) == 0x80)) {
|
|
|
|
*wc = ((u32)(byte & 0x0F) << 12)
|
|
|
|
| ((u32)(s[1] & 0x3F) << 6)
|
|
|
|
| ((u32)(s[2] & 0x3F));
|
|
|
|
/* Check valid ranges */
|
2016-04-12 23:02:40 +08:00
|
|
|
#if ALLOW_BROKEN_UNICODE
|
2009-01-05 21:28:06 +08:00
|
|
|
if (((*wc >= 0x800) && (*wc <= 0xD7FF))
|
2016-04-08 11:39:48 +08:00
|
|
|
|| ((*wc >= 0xD800) && (*wc <= 0xDFFF))
|
2016-04-12 23:02:40 +08:00
|
|
|
|| ((*wc >= 0xe000) && (*wc <= 0xFFFF)))
|
2009-01-05 21:28:06 +08:00
|
|
|
return 3;
|
|
|
|
#else
|
|
|
|
if (((*wc >= 0x800) && (*wc <= 0xD7FF))
|
2016-04-12 23:02:40 +08:00
|
|
|
|| ((*wc >= 0xe000) && (*wc <= 0xFFFD)))
|
2009-01-05 21:28:06 +08:00
|
|
|
return 3;
|
2016-04-12 23:02:40 +08:00
|
|
|
#endif /* ALLOW_BROKEN_UNICODE */
|
2009-01-05 21:28:06 +08:00
|
|
|
}
|
|
|
|
goto fail;
|
|
|
|
/* four-byte */
|
|
|
|
} else if (byte < 0xF5) {
|
|
|
|
if (((s[1] & 0xC0) == 0x80) && ((s[2] & 0xC0) == 0x80)
|
|
|
|
&& ((s[3] & 0xC0) == 0x80)) {
|
|
|
|
*wc = ((u32)(byte & 0x07) << 18)
|
|
|
|
| ((u32)(s[1] & 0x3F) << 12)
|
|
|
|
| ((u32)(s[2] & 0x3F) << 6)
|
|
|
|
| ((u32)(s[3] & 0x3F));
|
2012-01-24 00:09:19 +08:00
|
|
|
/* Check valid ranges */
|
|
|
|
if ((*wc <= 0x10ffff) && (*wc >= 0x10000))
|
|
|
|
return 4;
|
2009-01-05 21:28:06 +08:00
|
|
|
}
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
fail:
|
|
|
|
errno = EILSEQ;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* ntfs_utf8_to_utf16 - convert a UTF-8 string to a UTF-16LE string
|
|
|
|
* @ins: input multibyte string buffer
|
|
|
|
* @outs: on return contains the (allocated) output utf16 string
|
|
|
|
* @outs_len: length of output buffer in utf16 characters
|
|
|
|
*
|
|
|
|
* Return -1 with errno set.
|
|
|
|
*/
|
|
|
|
static int ntfs_utf8_to_utf16(const char *ins, ntfschar **outs)
|
|
|
|
{
|
2009-11-05 19:40:44 +08:00
|
|
|
#if defined(__APPLE__) || defined(__DARWIN__)
|
|
|
|
#ifdef ENABLE_NFCONV
|
|
|
|
char *new_ins = NULL;
|
|
|
|
if(nfconvert_utf8) {
|
|
|
|
int new_ins_len;
|
|
|
|
new_ins_len = ntfs_macosx_normalize_utf8(ins, &new_ins, 1); // Normalize to composed form
|
|
|
|
if(new_ins_len >= 0)
|
|
|
|
ins = new_ins;
|
|
|
|
else
|
|
|
|
ntfs_log_error("Failed to normalize NTFS string to UTF-8 NFC: %s\n", ins);
|
|
|
|
}
|
|
|
|
#endif /* ENABLE_NFCONV */
|
|
|
|
#endif /* defined(__APPLE__) || defined(__DARWIN__) */
|
2009-01-05 21:28:06 +08:00
|
|
|
const char *t = ins;
|
|
|
|
u32 wc;
|
2009-12-09 19:20:20 +08:00
|
|
|
BOOL allocated;
|
2009-01-05 21:28:06 +08:00
|
|
|
ntfschar *outpos;
|
|
|
|
int shorts, ret = -1;
|
|
|
|
|
|
|
|
shorts = utf8_to_utf16_size(ins);
|
|
|
|
if (shorts < 0)
|
|
|
|
goto fail;
|
|
|
|
|
2009-12-09 19:20:20 +08:00
|
|
|
allocated = FALSE;
|
2009-01-05 21:28:06 +08:00
|
|
|
if (!*outs) {
|
|
|
|
*outs = ntfs_malloc((shorts + 1) * sizeof(ntfschar));
|
|
|
|
if (!*outs)
|
|
|
|
goto fail;
|
2009-12-09 19:20:20 +08:00
|
|
|
allocated = TRUE;
|
2009-01-05 21:28:06 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
outpos = *outs;
|
|
|
|
|
|
|
|
while(1) {
|
|
|
|
int m = utf8_to_unicode(&wc, t);
|
2009-12-09 19:20:20 +08:00
|
|
|
if (m <= 0) {
|
|
|
|
if (m < 0) {
|
|
|
|
/* do not leave space allocated if failed */
|
|
|
|
if (allocated) {
|
|
|
|
free(*outs);
|
|
|
|
*outs = (ntfschar*)NULL;
|
|
|
|
}
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
*outpos++ = const_cpu_to_le16(0);
|
|
|
|
break;
|
|
|
|
}
|
2009-01-05 21:28:06 +08:00
|
|
|
if (wc < 0x10000)
|
|
|
|
*outpos++ = cpu_to_le16(wc);
|
|
|
|
else {
|
|
|
|
wc -= 0x10000;
|
|
|
|
*outpos++ = cpu_to_le16((wc >> 10) + 0xd800);
|
|
|
|
*outpos++ = cpu_to_le16((wc & 0x3ff) + 0xdc00);
|
|
|
|
}
|
|
|
|
t += m;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = --outpos - *outs;
|
|
|
|
fail:
|
2009-11-05 19:40:44 +08:00
|
|
|
#if defined(__APPLE__) || defined(__DARWIN__)
|
|
|
|
#ifdef ENABLE_NFCONV
|
|
|
|
if(new_ins != NULL)
|
|
|
|
free(new_ins);
|
|
|
|
#endif /* ENABLE_NFCONV */
|
|
|
|
#endif /* defined(__APPLE__) || defined(__DARWIN__) */
|
2009-01-05 21:28:06 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2006-10-31 06:32:48 +08:00
|
|
|
/**
|
|
|
|
* 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;
|
2010-08-28 19:59:43 +08:00
|
|
|
int mbs_len;
|
|
|
|
#ifdef MB_CUR_MAX
|
2006-10-31 06:32:48 +08:00
|
|
|
wchar_t wc;
|
2010-08-28 19:59:43 +08:00
|
|
|
int i, o;
|
2006-10-31 06:32:48 +08:00
|
|
|
int cnt = 0;
|
|
|
|
#ifdef HAVE_MBSINIT
|
|
|
|
mbstate_t mbstate;
|
|
|
|
#endif
|
2010-08-28 19:59:43 +08:00
|
|
|
#endif /* MB_CUR_MAX */
|
2006-10-31 06:32:48 +08:00
|
|
|
|
|
|
|
if (!ins || !outs) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
mbs = *outs;
|
|
|
|
mbs_len = outs_len;
|
|
|
|
if (mbs && !mbs_len) {
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
return -1;
|
|
|
|
}
|
2008-08-21 20:04:51 +08:00
|
|
|
if (use_utf8)
|
|
|
|
return ntfs_utf16_to_utf8(ins, ins_len, outs, outs_len);
|
2010-08-28 19:59:43 +08:00
|
|
|
#ifdef MB_CUR_MAX
|
2006-10-31 06:32:48 +08:00
|
|
|
if (!mbs) {
|
|
|
|
mbs_len = (ins_len + 1) * MB_CUR_MAX;
|
|
|
|
mbs = ntfs_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 = ntfs_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) {
|
|
|
|
ntfs_log_debug("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)) {
|
|
|
|
ntfs_log_debug("Eeek. mbstate not in initial state!\n");
|
|
|
|
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;
|
|
|
|
}
|
2010-08-28 19:59:43 +08:00
|
|
|
#else /* MB_CUR_MAX */
|
|
|
|
errno = EILSEQ;
|
|
|
|
#endif /* MB_CUR_MAX */
|
2006-10-31 06:32:48 +08:00
|
|
|
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
|
|
|
|
*
|
|
|
|
* Convert the input multibyte string @ins, from the current locale into the
|
|
|
|
* corresponding little endian, 2-byte Unicode string.
|
|
|
|
*
|
2008-03-10 23:35:54 +08:00
|
|
|
* The function allocates the string and the caller is responsible for calling
|
|
|
|
* free(*@outs); when finished with it.
|
2006-10-31 06:32:48 +08:00
|
|
|
*
|
|
|
|
* On success the function returns the number of Unicode characters written to
|
|
|
|
* the output string *@outs (>= 0), not counting the terminating Unicode NULL
|
2008-03-10 23:35:54 +08:00
|
|
|
* character.
|
2006-10-31 06:32:48 +08:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
2008-03-10 23:35:54 +08:00
|
|
|
int ntfs_mbstoucs(const char *ins, ntfschar **outs)
|
2006-10-31 06:32:48 +08:00
|
|
|
{
|
2010-08-28 19:59:43 +08:00
|
|
|
#ifdef MB_CUR_MAX
|
2006-10-31 06:32:48 +08:00
|
|
|
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
|
2010-08-28 19:59:43 +08:00
|
|
|
#endif /* MB_CUR_MAX */
|
2006-10-31 06:32:48 +08:00
|
|
|
|
|
|
|
if (!ins || !outs) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return -1;
|
|
|
|
}
|
2008-03-10 23:35:54 +08:00
|
|
|
|
2008-08-21 20:04:51 +08:00
|
|
|
if (use_utf8)
|
|
|
|
return ntfs_utf8_to_utf16(ins, outs);
|
|
|
|
|
2010-08-28 19:59:43 +08:00
|
|
|
#ifdef MB_CUR_MAX
|
2006-10-31 06:32:48 +08:00
|
|
|
/* 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++;
|
2008-03-10 23:35:54 +08:00
|
|
|
ucs_len = ins_len;
|
|
|
|
ucs = ntfs_malloc(ucs_len * sizeof(ntfschar));
|
|
|
|
if (!ucs)
|
|
|
|
return -1;
|
2006-10-31 06:32:48 +08:00
|
|
|
#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++) {
|
2008-03-10 23:35:54 +08:00
|
|
|
/* Reallocate memory if necessary. */
|
2006-10-31 06:32:48 +08:00
|
|
|
if (o >= ucs_len) {
|
|
|
|
ntfschar *tc;
|
|
|
|
ucs_len = (ucs_len * sizeof(ntfschar) + 64) & ~63;
|
2008-03-10 23:35:54 +08:00
|
|
|
tc = realloc(ucs, ucs_len);
|
2006-10-31 06:32:48 +08:00
|
|
|
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) {
|
|
|
|
ntfs_log_trace("Eeek. cnt = %i\n", 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)) {
|
|
|
|
ntfs_log_trace("Eeek. mbstate not in initial state!\n");
|
|
|
|
errno = EILSEQ;
|
|
|
|
goto err_out;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
/* Now write the NULL character. */
|
2015-12-22 06:21:00 +08:00
|
|
|
ucs[o] = const_cpu_to_le16(L'\0');
|
2008-03-10 23:35:54 +08:00
|
|
|
*outs = ucs;
|
2006-10-31 06:32:48 +08:00
|
|
|
return o;
|
|
|
|
err_out:
|
2008-03-10 23:35:54 +08:00
|
|
|
free(ucs);
|
2010-08-28 19:59:43 +08:00
|
|
|
#else /* MB_CUR_MAX */
|
|
|
|
errno = EILSEQ;
|
|
|
|
#endif /* MB_CUR_MAX */
|
2006-10-31 06:32:48 +08:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2010-05-25 16:12:44 +08:00
|
|
|
/*
|
|
|
|
* Turn a UTF8 name uppercase
|
|
|
|
*
|
|
|
|
* Returns an allocated uppercase name which has to be freed by caller
|
|
|
|
* or NULL if there is an error (described by errno)
|
|
|
|
*/
|
|
|
|
|
|
|
|
char *ntfs_uppercase_mbs(const char *low,
|
|
|
|
const ntfschar *upcase, u32 upcase_size)
|
|
|
|
{
|
|
|
|
int size;
|
|
|
|
char *upp;
|
|
|
|
u32 wc;
|
|
|
|
int n;
|
|
|
|
const char *s;
|
|
|
|
char *t;
|
|
|
|
|
|
|
|
size = strlen(low);
|
|
|
|
upp = (char*)ntfs_malloc(3*size + 1);
|
|
|
|
if (upp) {
|
|
|
|
s = low;
|
|
|
|
t = upp;
|
|
|
|
do {
|
|
|
|
n = utf8_to_unicode(&wc, s);
|
|
|
|
if (n > 0) {
|
|
|
|
if (wc < upcase_size)
|
|
|
|
wc = le16_to_cpu(upcase[wc]);
|
|
|
|
if (wc < 0x80)
|
|
|
|
*t++ = wc;
|
|
|
|
else if (wc < 0x800) {
|
|
|
|
*t++ = (0xc0 | ((wc >> 6) & 0x3f));
|
|
|
|
*t++ = 0x80 | (wc & 0x3f);
|
|
|
|
} else if (wc < 0x10000) {
|
|
|
|
*t++ = 0xe0 | (wc >> 12);
|
|
|
|
*t++ = 0x80 | ((wc >> 6) & 0x3f);
|
|
|
|
*t++ = 0x80 | (wc & 0x3f);
|
|
|
|
} else {
|
|
|
|
*t++ = 0xf0 | ((wc >> 18) & 7);
|
|
|
|
*t++ = 0x80 | ((wc >> 12) & 63);
|
|
|
|
*t++ = 0x80 | ((wc >> 6) & 0x3f);
|
|
|
|
*t++ = 0x80 | (wc & 0x3f);
|
|
|
|
}
|
|
|
|
s += n;
|
|
|
|
}
|
|
|
|
} while (n > 0);
|
|
|
|
if (n < 0) {
|
|
|
|
free(upp);
|
|
|
|
upp = (char*)NULL;
|
|
|
|
errno = EILSEQ;
|
|
|
|
}
|
|
|
|
*t = 0;
|
|
|
|
}
|
|
|
|
return (upp);
|
|
|
|
}
|
|
|
|
|
2006-10-31 06:32:48 +08:00
|
|
|
/**
|
|
|
|
* 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)
|
|
|
|
{
|
2015-04-17 17:03:58 +08:00
|
|
|
struct NEWUPPERCASE {
|
|
|
|
unsigned short first;
|
|
|
|
unsigned short last;
|
|
|
|
short diff;
|
|
|
|
unsigned char step;
|
|
|
|
unsigned char osmajor;
|
|
|
|
unsigned char osminor;
|
|
|
|
} ;
|
|
|
|
|
2010-12-21 22:51:08 +08:00
|
|
|
/*
|
|
|
|
* This is the table as defined by Windows XP
|
|
|
|
*/
|
2006-10-31 06:32:48 +08:00
|
|
|
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}
|
|
|
|
};
|
2015-04-17 17:03:58 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Changes which were applied to later Windows versions
|
|
|
|
*
|
|
|
|
* md5 for $UpCase from Winxp : 6fa3db2468275286210751e869d36373
|
|
|
|
* Vista : 2f03b5a69d486ff3864cecbd07f24440
|
|
|
|
* Win8 : 7ff498a44e45e77374cc7c962b1b92f2
|
|
|
|
*/
|
|
|
|
static const struct NEWUPPERCASE newuppercase[] = {
|
|
|
|
/* from Windows 6.0 (Vista) */
|
|
|
|
{ 0x37b, 0x37d, 0x82, 1, 6, 0 },
|
|
|
|
{ 0x1f80, 0x1f87, 0x8, 1, 6, 0 },
|
|
|
|
{ 0x1f90, 0x1f97, 0x8, 1, 6, 0 },
|
|
|
|
{ 0x1fa0, 0x1fa7, 0x8, 1, 6, 0 },
|
|
|
|
{ 0x2c30, 0x2c5e, -0x30, 1, 6, 0 },
|
|
|
|
{ 0x2d00, 0x2d25, -0x1c60, 1, 6, 0 },
|
|
|
|
{ 0x2c68, 0x2c6c, -0x1, 2, 6, 0 },
|
|
|
|
{ 0x219, 0x21f, -0x1, 2, 6, 0 },
|
|
|
|
{ 0x223, 0x233, -0x1, 2, 6, 0 },
|
|
|
|
{ 0x247, 0x24f, -0x1, 2, 6, 0 },
|
|
|
|
{ 0x3d9, 0x3e1, -0x1, 2, 6, 0 },
|
|
|
|
{ 0x48b, 0x48f, -0x1, 2, 6, 0 },
|
|
|
|
{ 0x4fb, 0x513, -0x1, 2, 6, 0 },
|
|
|
|
{ 0x2c81, 0x2ce3, -0x1, 2, 6, 0 },
|
|
|
|
{ 0x3f8, 0x3fb, -0x1, 3, 6, 0 },
|
|
|
|
{ 0x4c6, 0x4ce, -0x1, 4, 6, 0 },
|
|
|
|
{ 0x23c, 0x242, -0x1, 6, 6, 0 },
|
|
|
|
{ 0x4ed, 0x4f7, -0x1, 10, 6, 0 },
|
|
|
|
{ 0x450, 0x45d, -0x50, 13, 6, 0 },
|
|
|
|
{ 0x2c61, 0x2c76, -0x1, 21, 6, 0 },
|
|
|
|
{ 0x1fcc, 0x1ffc, -0x9, 48, 6, 0 },
|
|
|
|
{ 0x180, 0x180, 0xc3, 1, 6, 0 },
|
|
|
|
{ 0x195, 0x195, 0x61, 1, 6, 0 },
|
|
|
|
{ 0x19a, 0x19a, 0xa3, 1, 6, 0 },
|
|
|
|
{ 0x19e, 0x19e, 0x82, 1, 6, 0 },
|
|
|
|
{ 0x1bf, 0x1bf, 0x38, 1, 6, 0 },
|
|
|
|
{ 0x1f9, 0x1f9, -0x1, 1, 6, 0 },
|
|
|
|
{ 0x23a, 0x23a, 0x2a2b, 1, 6, 0 },
|
|
|
|
{ 0x23e, 0x23e, 0x2a28, 1, 6, 0 },
|
|
|
|
{ 0x26b, 0x26b, 0x29f7, 1, 6, 0 },
|
|
|
|
{ 0x27d, 0x27d, 0x29e7, 1, 6, 0 },
|
|
|
|
{ 0x280, 0x280, -0xda, 1, 6, 0 },
|
|
|
|
{ 0x289, 0x289, -0x45, 1, 6, 0 },
|
|
|
|
{ 0x28c, 0x28c, -0x47, 1, 6, 0 },
|
|
|
|
{ 0x3f2, 0x3f2, 0x7, 1, 6, 0 },
|
|
|
|
{ 0x4cf, 0x4cf, -0xf, 1, 6, 0 },
|
|
|
|
{ 0x1d7d, 0x1d7d, 0xee6, 1, 6, 0 },
|
|
|
|
{ 0x1fb3, 0x1fb3, 0x9, 1, 6, 0 },
|
|
|
|
{ 0x214e, 0x214e, -0x1c, 1, 6, 0 },
|
|
|
|
{ 0x2184, 0x2184, -0x1, 1, 6, 0 },
|
|
|
|
/* from Windows 6.1 (Win7) */
|
|
|
|
{ 0x23a, 0x23e, 0x0, 4, 6, 1 },
|
|
|
|
{ 0x250, 0x250, 0x2a1f, 2, 6, 1 },
|
|
|
|
{ 0x251, 0x251, 0x2a1c, 2, 6, 1 },
|
|
|
|
{ 0x271, 0x271, 0x29fd, 2, 6, 1 },
|
|
|
|
{ 0x371, 0x373, -0x1, 2, 6, 1 },
|
|
|
|
{ 0x377, 0x377, -0x1, 2, 6, 1 },
|
|
|
|
{ 0x3c2, 0x3c2, 0x0, 2, 6, 1 },
|
|
|
|
{ 0x3d7, 0x3d7, -0x8, 2, 6, 1 },
|
|
|
|
{ 0x515, 0x523, -0x1, 2, 6, 1 },
|
2016-05-31 14:24:23 +08:00
|
|
|
/* below, -0x75fc stands for 0x8a04 and truncation */
|
|
|
|
{ 0x1d79, 0x1d79, -0x75fc, 2, 6, 1 },
|
2015-04-17 17:03:58 +08:00
|
|
|
{ 0x1efb, 0x1eff, -0x1, 2, 6, 1 },
|
|
|
|
{ 0x1fc3, 0x1ff3, 0x9, 48, 6, 1 },
|
|
|
|
{ 0x1fcc, 0x1ffc, 0x0, 48, 6, 1 },
|
|
|
|
{ 0x2c65, 0x2c65, -0x2a2b, 2, 6, 1 },
|
|
|
|
{ 0x2c66, 0x2c66, -0x2a28, 2, 6, 1 },
|
|
|
|
{ 0x2c73, 0x2c73, -0x1, 2, 6, 1 },
|
|
|
|
{ 0xa641, 0xa65f, -0x1, 2, 6, 1 },
|
|
|
|
{ 0xa663, 0xa66d, -0x1, 2, 6, 1 },
|
|
|
|
{ 0xa681, 0xa697, -0x1, 2, 6, 1 },
|
|
|
|
{ 0xa723, 0xa72f, -0x1, 2, 6, 1 },
|
|
|
|
{ 0xa733, 0xa76f, -0x1, 2, 6, 1 },
|
|
|
|
{ 0xa77a, 0xa77c, -0x1, 2, 6, 1 },
|
|
|
|
{ 0xa77f, 0xa787, -0x1, 2, 6, 1 },
|
|
|
|
{ 0xa78c, 0xa78c, -0x1, 2, 6, 1 },
|
|
|
|
/* end mark */
|
|
|
|
{ 0 }
|
|
|
|
} ;
|
|
|
|
|
2006-10-31 06:32:48 +08:00
|
|
|
int i, r;
|
2009-04-20 23:27:03 +08:00
|
|
|
int k, off;
|
2015-04-17 17:03:58 +08:00
|
|
|
const struct NEWUPPERCASE *puc;
|
2006-10-31 06:32:48 +08:00
|
|
|
|
|
|
|
memset((char*)uc, 0, uc_len);
|
|
|
|
uc_len >>= 1;
|
|
|
|
if (uc_len > 65536)
|
|
|
|
uc_len = 65536;
|
|
|
|
for (i = 0; (u32)i < uc_len; i++)
|
2009-04-20 23:27:03 +08:00
|
|
|
uc[i] = cpu_to_le16(i);
|
|
|
|
for (r = 0; uc_run_table[r][0]; r++) {
|
|
|
|
off = uc_run_table[r][2];
|
2006-10-31 06:32:48 +08:00
|
|
|
for (i = uc_run_table[r][0]; i < uc_run_table[r][1]; i++)
|
2009-04-20 23:27:03 +08:00
|
|
|
uc[i] = cpu_to_le16(i + off);
|
|
|
|
}
|
2006-10-31 06:32:48 +08:00
|
|
|
for (r = 0; uc_dup_table[r][0]; r++)
|
|
|
|
for (i = uc_dup_table[r][0]; i < uc_dup_table[r][1]; i += 2)
|
2009-04-20 23:27:03 +08:00
|
|
|
uc[i + 1] = cpu_to_le16(i);
|
|
|
|
for (r = 0; uc_byte_table[r][0]; r++) {
|
|
|
|
k = uc_byte_table[r][1];
|
|
|
|
uc[uc_byte_table[r][0]] = cpu_to_le16(k);
|
|
|
|
}
|
2015-04-17 17:03:58 +08:00
|
|
|
for (r=0; newuppercase[r].first; r++) {
|
|
|
|
puc = &newuppercase[r];
|
|
|
|
if ((puc->osmajor < UPCASE_MAJOR)
|
|
|
|
|| ((puc->osmajor == UPCASE_MAJOR)
|
|
|
|
&& (puc->osminor <= UPCASE_MINOR))) {
|
|
|
|
off = puc->diff;
|
|
|
|
for (i = puc->first; i <= puc->last; i += puc->step)
|
|
|
|
uc[i] = cpu_to_le16(i + off);
|
|
|
|
}
|
|
|
|
}
|
2006-10-31 06:32:48 +08:00
|
|
|
}
|
|
|
|
|
2011-02-08 20:52:12 +08:00
|
|
|
/*
|
|
|
|
* Allocate and build the default upcase table
|
|
|
|
*
|
|
|
|
* Returns the number of entries
|
|
|
|
* 0 if failed
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define UPCASE_LEN 65536 /* default number of entries in upcase */
|
|
|
|
|
|
|
|
u32 ntfs_upcase_build_default(ntfschar **upcase)
|
|
|
|
{
|
2011-08-04 21:49:35 +08:00
|
|
|
u32 upcase_len = 0;
|
2011-02-08 20:52:12 +08:00
|
|
|
|
|
|
|
*upcase = (ntfschar*)ntfs_malloc(UPCASE_LEN*2);
|
|
|
|
if (*upcase) {
|
|
|
|
ntfs_upcase_table_build(*upcase, UPCASE_LEN*2);
|
|
|
|
upcase_len = UPCASE_LEN;
|
|
|
|
}
|
|
|
|
return (upcase_len);
|
|
|
|
}
|
|
|
|
|
2010-05-25 16:12:44 +08:00
|
|
|
/*
|
|
|
|
* Build a table for converting to lower case
|
|
|
|
*
|
|
|
|
* This is only meaningful when there is a single lower case
|
|
|
|
* character leading to an upper case one, and currently the
|
|
|
|
* only exception is the greek letter sigma which has a single
|
|
|
|
* upper case glyph (code U+03A3), but two lower case glyphs
|
|
|
|
* (code U+03C3 and U+03C2, the latter to be used at the end
|
|
|
|
* of a word). In the following implementation the upper case
|
|
|
|
* sigma will be lowercased as U+03C3.
|
|
|
|
*/
|
|
|
|
|
|
|
|
ntfschar *ntfs_locase_table_build(const ntfschar *uc, u32 uc_cnt)
|
|
|
|
{
|
|
|
|
ntfschar *lc;
|
|
|
|
u32 upp;
|
|
|
|
u32 i;
|
|
|
|
|
|
|
|
lc = (ntfschar*)ntfs_malloc(uc_cnt*sizeof(ntfschar));
|
|
|
|
if (lc) {
|
|
|
|
for (i=0; i<uc_cnt; i++)
|
|
|
|
lc[i] = cpu_to_le16(i);
|
|
|
|
for (i=0; i<uc_cnt; i++) {
|
|
|
|
upp = le16_to_cpu(uc[i]);
|
|
|
|
if ((upp != i) && (upp < uc_cnt))
|
|
|
|
lc[upp] = cpu_to_le16(i);
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
ntfs_log_error("Could not build the locase table\n");
|
|
|
|
return (lc);
|
|
|
|
}
|
|
|
|
|
2006-10-31 06:32:48 +08:00
|
|
|
/**
|
|
|
|
* ntfs_str2ucs - convert a string to a valid NTFS file name
|
|
|
|
* @s: input string
|
|
|
|
* @len: length of output buffer in Unicode characters
|
|
|
|
*
|
|
|
|
* Convert the input @s string into the corresponding little endian,
|
|
|
|
* 2-byte Unicode string. The length of the converted string is less
|
|
|
|
* or equal to the maximum length allowed by the NTFS format (255).
|
|
|
|
*
|
|
|
|
* If @s is NULL then return AT_UNNAMED.
|
|
|
|
*
|
|
|
|
* On success the function returns the Unicode string in an allocated
|
|
|
|
* buffer and the caller is responsible to free it when it's not needed
|
|
|
|
* anymore.
|
|
|
|
*
|
|
|
|
* On error NULL is returned and errno is set to the error code.
|
|
|
|
*/
|
|
|
|
ntfschar *ntfs_str2ucs(const char *s, int *len)
|
|
|
|
{
|
|
|
|
ntfschar *ucs = NULL;
|
|
|
|
|
2008-03-10 23:35:54 +08:00
|
|
|
if (s && ((*len = ntfs_mbstoucs(s, &ucs)) == -1)) {
|
2006-10-31 06:32:48 +08:00
|
|
|
ntfs_log_perror("Couldn't convert '%s' to Unicode", s);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (*len > NTFS_MAX_NAME_LEN) {
|
|
|
|
free(ucs);
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (!ucs || !*len) {
|
|
|
|
ucs = AT_UNNAMED;
|
|
|
|
*len = 0;
|
|
|
|
}
|
|
|
|
return ucs;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* ntfs_ucsfree - free memory allocated by ntfs_str2ucs()
|
|
|
|
* @ucs input string to be freed
|
|
|
|
*
|
|
|
|
* Free memory at @ucs and which was allocated by ntfs_str2ucs.
|
|
|
|
*
|
|
|
|
* Return value: none.
|
|
|
|
*/
|
|
|
|
void ntfs_ucsfree(ntfschar *ucs)
|
|
|
|
{
|
|
|
|
if (ucs && (ucs != AT_UNNAMED))
|
|
|
|
free(ucs);
|
|
|
|
}
|
|
|
|
|
2009-07-02 03:45:59 +08:00
|
|
|
/*
|
|
|
|
* Check whether a name contains no chars forbidden
|
|
|
|
* for DOS or Win32 use
|
|
|
|
*
|
|
|
|
* If there is a bad char, errno is set to EINVAL
|
|
|
|
*/
|
|
|
|
|
|
|
|
BOOL ntfs_forbidden_chars(const ntfschar *name, int len)
|
|
|
|
{
|
2009-08-12 23:35:11 +08:00
|
|
|
BOOL forbidden;
|
2009-07-02 03:45:59 +08:00
|
|
|
int ch;
|
|
|
|
int i;
|
2014-03-11 17:56:31 +08:00
|
|
|
static const u32 mainset = (1L << ('\"' - 0x20))
|
2009-07-02 03:45:59 +08:00
|
|
|
| (1L << ('*' - 0x20))
|
|
|
|
| (1L << ('/' - 0x20))
|
|
|
|
| (1L << (':' - 0x20))
|
|
|
|
| (1L << ('<' - 0x20))
|
|
|
|
| (1L << ('>' - 0x20))
|
|
|
|
| (1L << ('?' - 0x20));
|
|
|
|
|
2010-06-03 16:13:30 +08:00
|
|
|
forbidden = (len == 0)
|
2014-03-11 17:56:31 +08:00
|
|
|
|| (name[len-1] == const_cpu_to_le16(' '))
|
|
|
|
|| (name[len-1] == const_cpu_to_le16('.'));
|
2009-07-02 03:45:59 +08:00
|
|
|
for (i=0; i<len; i++) {
|
|
|
|
ch = le16_to_cpu(name[i]);
|
2009-08-12 23:35:11 +08:00
|
|
|
if ((ch < 0x20)
|
2009-07-02 03:45:59 +08:00
|
|
|
|| ((ch < 0x40)
|
|
|
|
&& ((1L << (ch - 0x20)) & mainset))
|
|
|
|
|| (ch == '\\')
|
|
|
|
|| (ch == '|'))
|
|
|
|
forbidden = TRUE;
|
|
|
|
}
|
|
|
|
if (forbidden)
|
|
|
|
errno = EINVAL;
|
|
|
|
return (forbidden);
|
|
|
|
}
|
|
|
|
|
2014-03-11 17:56:31 +08:00
|
|
|
/*
|
|
|
|
* Check whether a name contains no forbidden chars and
|
|
|
|
* is not a reserved name for DOS or Win32 use
|
|
|
|
*
|
|
|
|
* The reserved names are CON, PRN, AUX, NUL, COM1..COM9, LPT1..LPT9
|
|
|
|
* with no suffix or any suffix.
|
|
|
|
*
|
|
|
|
* If the name is forbidden, errno is set to EINVAL
|
|
|
|
*/
|
|
|
|
|
|
|
|
BOOL ntfs_forbidden_names(ntfs_volume *vol, const ntfschar *name, int len)
|
|
|
|
{
|
|
|
|
BOOL forbidden;
|
|
|
|
int h;
|
|
|
|
static const ntfschar dot = const_cpu_to_le16('.');
|
|
|
|
static const ntfschar con[] = { const_cpu_to_le16('c'),
|
|
|
|
const_cpu_to_le16('o'), const_cpu_to_le16('n') };
|
|
|
|
static const ntfschar prn[] = { const_cpu_to_le16('p'),
|
|
|
|
const_cpu_to_le16('r'), const_cpu_to_le16('n') };
|
|
|
|
static const ntfschar aux[] = { const_cpu_to_le16('a'),
|
|
|
|
const_cpu_to_le16('u'), const_cpu_to_le16('x') };
|
|
|
|
static const ntfschar nul[] = { const_cpu_to_le16('n'),
|
|
|
|
const_cpu_to_le16('u'), const_cpu_to_le16('l') };
|
|
|
|
static const ntfschar com[] = { const_cpu_to_le16('c'),
|
|
|
|
const_cpu_to_le16('o'), const_cpu_to_le16('m') };
|
|
|
|
static const ntfschar lpt[] = { const_cpu_to_le16('l'),
|
|
|
|
const_cpu_to_le16('p'), const_cpu_to_le16('t') };
|
|
|
|
|
|
|
|
forbidden = ntfs_forbidden_chars(name, len);
|
|
|
|
if (!forbidden && (len >= 3)) {
|
|
|
|
/*
|
|
|
|
* Rough hash check to tell whether the first couple of chars
|
|
|
|
* may be one of CO PR AU NU LP or lowercase variants.
|
|
|
|
*/
|
|
|
|
h = ((le16_to_cpu(name[0]) & 31)*48)
|
|
|
|
^ ((le16_to_cpu(name[1]) & 31)*165);
|
|
|
|
if ((h % 23) == 17) {
|
|
|
|
/* do a full check, depending on the third char */
|
|
|
|
switch (le16_to_cpu(name[2]) & ~0x20) {
|
|
|
|
case 'N' :
|
|
|
|
if (((len == 3) || (name[3] == dot))
|
|
|
|
&& (!ntfs_ucsncasecmp(name, con, 3,
|
|
|
|
vol->upcase, vol->upcase_len)
|
|
|
|
|| !ntfs_ucsncasecmp(name, prn, 3,
|
|
|
|
vol->upcase, vol->upcase_len)))
|
|
|
|
forbidden = TRUE;
|
|
|
|
break;
|
|
|
|
case 'X' :
|
|
|
|
if (((len == 3) || (name[3] == dot))
|
|
|
|
&& !ntfs_ucsncasecmp(name, aux, 3,
|
|
|
|
vol->upcase, vol->upcase_len))
|
|
|
|
forbidden = TRUE;
|
|
|
|
break;
|
|
|
|
case 'L' :
|
|
|
|
if (((len == 3) || (name[3] == dot))
|
|
|
|
&& !ntfs_ucsncasecmp(name, nul, 3,
|
|
|
|
vol->upcase, vol->upcase_len))
|
|
|
|
forbidden = TRUE;
|
|
|
|
break;
|
|
|
|
case 'M' :
|
|
|
|
if ((len > 3)
|
|
|
|
&& (le16_to_cpu(name[3]) >= '1')
|
|
|
|
&& (le16_to_cpu(name[3]) <= '9')
|
|
|
|
&& ((len == 4) || (name[4] == dot))
|
|
|
|
&& !ntfs_ucsncasecmp(name, com, 3,
|
|
|
|
vol->upcase, vol->upcase_len))
|
|
|
|
forbidden = TRUE;
|
|
|
|
break;
|
|
|
|
case 'T' :
|
|
|
|
if ((len > 3)
|
|
|
|
&& (le16_to_cpu(name[3]) >= '1')
|
|
|
|
&& (le16_to_cpu(name[3]) <= '9')
|
|
|
|
&& ((len == 4) || (name[4] == dot))
|
|
|
|
&& !ntfs_ucsncasecmp(name, lpt, 3,
|
|
|
|
vol->upcase, vol->upcase_len))
|
|
|
|
forbidden = TRUE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (forbidden)
|
|
|
|
errno = EINVAL;
|
|
|
|
return (forbidden);
|
|
|
|
}
|
|
|
|
|
2009-07-02 03:45:59 +08:00
|
|
|
/*
|
|
|
|
* Check whether the same name can be used as a DOS and
|
|
|
|
* a Win32 name
|
|
|
|
*
|
|
|
|
* The names must be the same, or the short name the uppercase
|
|
|
|
* variant of the long name
|
|
|
|
*/
|
|
|
|
|
|
|
|
BOOL ntfs_collapsible_chars(ntfs_volume *vol,
|
|
|
|
const ntfschar *shortname, int shortlen,
|
|
|
|
const ntfschar *longname, int longlen)
|
|
|
|
{
|
|
|
|
BOOL collapsible;
|
|
|
|
unsigned int ch;
|
2011-07-05 18:17:11 +08:00
|
|
|
unsigned int cs;
|
2009-07-02 03:45:59 +08:00
|
|
|
int i;
|
|
|
|
|
|
|
|
collapsible = shortlen == longlen;
|
2011-07-05 18:17:11 +08:00
|
|
|
for (i=0; collapsible && (i<shortlen); i++) {
|
|
|
|
ch = le16_to_cpu(longname[i]);
|
|
|
|
cs = le16_to_cpu(shortname[i]);
|
|
|
|
if ((cs != ch)
|
|
|
|
&& ((ch >= vol->upcase_len)
|
|
|
|
|| (cs >= vol->upcase_len)
|
|
|
|
|| (vol->upcase[cs] != vol->upcase[ch])))
|
|
|
|
collapsible = FALSE;
|
2009-07-02 03:45:59 +08:00
|
|
|
}
|
|
|
|
return (collapsible);
|
|
|
|
}
|
|
|
|
|
2008-08-21 20:04:51 +08:00
|
|
|
/*
|
2009-01-05 21:28:06 +08:00
|
|
|
* Define the character encoding to be used.
|
|
|
|
* Use UTF-8 unless specified otherwise.
|
2008-08-21 20:04:51 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
int ntfs_set_char_encoding(const char *locale)
|
|
|
|
{
|
|
|
|
use_utf8 = 0;
|
|
|
|
if (!locale || strstr(locale,"utf8") || strstr(locale,"UTF8")
|
|
|
|
|| strstr(locale,"utf-8") || strstr(locale,"UTF-8"))
|
|
|
|
use_utf8 = 1;
|
|
|
|
else
|
|
|
|
if (setlocale(LC_ALL, locale))
|
|
|
|
use_utf8 = 0;
|
|
|
|
else {
|
|
|
|
ntfs_log_error("Invalid locale, encoding to UTF-8\n");
|
|
|
|
use_utf8 = 1;
|
|
|
|
}
|
2009-01-05 21:28:06 +08:00
|
|
|
return 0; /* always successful */
|
2008-08-21 20:04:51 +08:00
|
|
|
}
|
|
|
|
|
2009-11-05 19:40:44 +08:00
|
|
|
#if defined(__APPLE__) || defined(__DARWIN__)
|
|
|
|
|
|
|
|
int ntfs_macosx_normalize_filenames(int normalize) {
|
|
|
|
#ifdef ENABLE_NFCONV
|
2015-06-23 12:43:17 +08:00
|
|
|
if (normalize == 0 || normalize == 1) {
|
2009-11-05 19:40:44 +08:00
|
|
|
nfconvert_utf8 = normalize;
|
|
|
|
return 0;
|
|
|
|
}
|
2015-06-23 12:43:17 +08:00
|
|
|
else {
|
2009-11-05 19:40:44 +08:00
|
|
|
return -1;
|
2015-06-23 12:43:17 +08:00
|
|
|
}
|
2009-11-05 19:40:44 +08:00
|
|
|
#else
|
|
|
|
return -1;
|
|
|
|
#endif /* ENABLE_NFCONV */
|
|
|
|
}
|
|
|
|
|
|
|
|
int ntfs_macosx_normalize_utf8(const char *utf8_string, char **target,
|
2015-06-23 12:43:17 +08:00
|
|
|
int composed)
|
|
|
|
{
|
2009-11-05 19:40:44 +08:00
|
|
|
#ifdef ENABLE_NFCONV
|
2015-06-23 12:43:17 +08:00
|
|
|
/* For this code to compile, the CoreFoundation framework must be fed to
|
|
|
|
* the linker. */
|
2009-11-05 19:40:44 +08:00
|
|
|
CFStringRef cfSourceString;
|
|
|
|
CFMutableStringRef cfMutableString;
|
|
|
|
CFRange rangeToProcess;
|
|
|
|
CFIndex requiredBufferLength;
|
|
|
|
char *result = NULL;
|
|
|
|
int resultLength = -1;
|
|
|
|
|
|
|
|
/* Convert the UTF-8 string to a CFString. */
|
2015-06-23 12:43:17 +08:00
|
|
|
cfSourceString = CFStringCreateWithCString(kCFAllocatorDefault,
|
|
|
|
utf8_string, kCFStringEncodingUTF8);
|
|
|
|
if (cfSourceString == NULL) {
|
2009-11-05 19:40:44 +08:00
|
|
|
ntfs_log_error("CFStringCreateWithCString failed!\n");
|
|
|
|
return -2;
|
|
|
|
}
|
2015-06-23 12:43:17 +08:00
|
|
|
|
|
|
|
/* Create a mutable string from cfSourceString that we are free to
|
|
|
|
* modify. */
|
|
|
|
cfMutableString = CFStringCreateMutableCopy(kCFAllocatorDefault, 0,
|
|
|
|
cfSourceString);
|
2009-11-05 19:40:44 +08:00
|
|
|
CFRelease(cfSourceString); /* End-of-life. */
|
2015-06-23 12:43:17 +08:00
|
|
|
if (cfMutableString == NULL) {
|
2009-11-05 19:40:44 +08:00
|
|
|
ntfs_log_error("CFStringCreateMutableCopy failed!\n");
|
|
|
|
return -3;
|
|
|
|
}
|
2015-06-23 12:43:17 +08:00
|
|
|
|
2009-11-05 19:40:44 +08:00
|
|
|
/* Normalize the mutable string to the desired normalization form. */
|
2015-06-23 12:43:17 +08:00
|
|
|
CFStringNormalize(cfMutableString, (composed != 0 ?
|
|
|
|
kCFStringNormalizationFormC : kCFStringNormalizationFormD));
|
|
|
|
|
|
|
|
/* Store the resulting string in a '\0'-terminated UTF-8 encoded char*
|
|
|
|
* buffer. */
|
2009-11-05 19:40:44 +08:00
|
|
|
rangeToProcess = CFRangeMake(0, CFStringGetLength(cfMutableString));
|
2015-06-23 12:43:17 +08:00
|
|
|
if (CFStringGetBytes(cfMutableString, rangeToProcess,
|
|
|
|
kCFStringEncodingUTF8, 0, false, NULL, 0,
|
|
|
|
&requiredBufferLength) > 0)
|
|
|
|
{
|
|
|
|
resultLength = sizeof(char) * (requiredBufferLength + 1);
|
2009-11-05 19:40:44 +08:00
|
|
|
result = ntfs_calloc(resultLength);
|
2015-06-23 12:43:17 +08:00
|
|
|
|
|
|
|
if (result != NULL) {
|
|
|
|
if (CFStringGetBytes(cfMutableString, rangeToProcess,
|
|
|
|
kCFStringEncodingUTF8, 0, false,
|
|
|
|
(UInt8*) result, resultLength - 1,
|
|
|
|
&requiredBufferLength) <= 0)
|
|
|
|
{
|
|
|
|
ntfs_log_error("Could not perform UTF-8 "
|
|
|
|
"conversion of normalized "
|
|
|
|
"CFMutableString.\n");
|
2009-11-05 19:40:44 +08:00
|
|
|
free(result);
|
|
|
|
result = NULL;
|
|
|
|
}
|
|
|
|
}
|
2015-06-23 12:43:17 +08:00
|
|
|
else {
|
|
|
|
ntfs_log_error("Could not perform a ntfs_calloc of %d "
|
|
|
|
"bytes for char *result.\n", resultLength);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
ntfs_log_error("Could not perform check for required length of "
|
|
|
|
"UTF-8 conversion of normalized CFMutableString.\n");
|
2009-11-05 19:40:44 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
CFRelease(cfMutableString);
|
2015-06-23 12:43:17 +08:00
|
|
|
|
|
|
|
if (result != NULL) {
|
2009-11-05 19:40:44 +08:00
|
|
|
*target = result;
|
|
|
|
return resultLength - 1;
|
|
|
|
}
|
2015-06-23 12:43:17 +08:00
|
|
|
else {
|
2009-11-05 19:40:44 +08:00
|
|
|
return -1;
|
2015-06-23 12:43:17 +08:00
|
|
|
}
|
2009-11-05 19:40:44 +08:00
|
|
|
#else
|
|
|
|
return -1;
|
|
|
|
#endif /* ENABLE_NFCONV */
|
|
|
|
}
|
|
|
|
#endif /* defined(__APPLE__) || defined(__DARWIN__) */
|