2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* fs/cifs/cifs_unicode.c
|
|
|
|
*
|
2009-05-01 00:45:10 +07:00
|
|
|
* Copyright (c) International Business Machines Corp., 2000,2009
|
2005-04-17 05:20:36 +07:00
|
|
|
* Modified by Steve French (sfrench@us.ibm.com)
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
2007-06-06 03:35:06 +07:00
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
2005-04-17 05:20:36 +07:00
|
|
|
* (at your option) any later version.
|
2007-06-06 03:35:06 +07:00
|
|
|
*
|
2005-04-17 05:20:36 +07:00
|
|
|
* This program 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
|
2007-06-06 03:35:06 +07:00
|
|
|
* along with this program; if not, write to the Free Software
|
2005-04-17 05:20:36 +07:00
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*/
|
|
|
|
#include <linux/fs.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 15:04:11 +07:00
|
|
|
#include <linux/slab.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include "cifs_unicode.h"
|
|
|
|
#include "cifs_uniupr.h"
|
|
|
|
#include "cifspdu.h"
|
2006-06-01 05:40:51 +07:00
|
|
|
#include "cifsglob.h"
|
2005-04-17 05:20:36 +07:00
|
|
|
#include "cifs_debug.h"
|
|
|
|
|
2009-04-30 17:46:32 +07:00
|
|
|
/*
|
|
|
|
* cifs_ucs2_bytes - how long will a string be after conversion?
|
|
|
|
* @ucs - pointer to input string
|
|
|
|
* @maxbytes - don't go past this many bytes of input string
|
|
|
|
* @codepage - destination codepage
|
|
|
|
*
|
|
|
|
* Walk a ucs2le string and return the number of bytes that the string will
|
|
|
|
* be after being converted to the given charset, not including any null
|
|
|
|
* termination required. Don't walk past maxbytes in the source buffer.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
cifs_ucs2_bytes(const __le16 *from, int maxbytes,
|
|
|
|
const struct nls_table *codepage)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int charlen, outlen = 0;
|
|
|
|
int maxwords = maxbytes / 2;
|
|
|
|
char tmp[NLS_MAX_CHARSET_SIZE];
|
2011-01-21 01:36:51 +07:00
|
|
|
__u16 ftmp;
|
2009-04-30 17:46:32 +07:00
|
|
|
|
2011-01-21 01:36:51 +07:00
|
|
|
for (i = 0; i < maxwords; i++) {
|
|
|
|
ftmp = get_unaligned_le16(&from[i]);
|
|
|
|
if (ftmp == 0)
|
|
|
|
break;
|
|
|
|
|
|
|
|
charlen = codepage->uni2char(ftmp, tmp, NLS_MAX_CHARSET_SIZE);
|
2009-04-30 17:46:32 +07:00
|
|
|
if (charlen > 0)
|
|
|
|
outlen += charlen;
|
|
|
|
else
|
|
|
|
outlen++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return outlen;
|
|
|
|
}
|
|
|
|
|
2009-04-30 17:46:15 +07:00
|
|
|
/*
|
2011-01-21 01:36:51 +07:00
|
|
|
* cifs_mapchar - convert a host-endian char to proper char in codepage
|
2009-04-30 17:46:15 +07:00
|
|
|
* @target - where converted character should be copied
|
2011-01-21 01:36:51 +07:00
|
|
|
* @src_char - 2 byte host-endian source character
|
2009-04-30 17:46:15 +07:00
|
|
|
* @cp - codepage to which character should be converted
|
|
|
|
* @mapchar - should character be mapped according to mapchars mount option?
|
|
|
|
*
|
|
|
|
* This function handles the conversion of a single character. It is the
|
|
|
|
* responsibility of the caller to ensure that the target buffer is large
|
|
|
|
* enough to hold the result of the conversion (at least NLS_MAX_CHARSET_SIZE).
|
|
|
|
*/
|
|
|
|
static int
|
2011-01-21 01:36:51 +07:00
|
|
|
cifs_mapchar(char *target, const __u16 src_char, const struct nls_table *cp,
|
2009-04-30 17:46:15 +07:00
|
|
|
bool mapchar)
|
|
|
|
{
|
|
|
|
int len = 1;
|
|
|
|
|
|
|
|
if (!mapchar)
|
|
|
|
goto cp_convert;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* BB: Cannot handle remapping UNI_SLASH until all the calls to
|
|
|
|
* build_path_from_dentry are modified, as they use slash as
|
|
|
|
* separator.
|
|
|
|
*/
|
2011-01-21 01:36:51 +07:00
|
|
|
switch (src_char) {
|
2009-04-30 17:46:15 +07:00
|
|
|
case UNI_COLON:
|
|
|
|
*target = ':';
|
|
|
|
break;
|
2011-04-06 02:02:37 +07:00
|
|
|
case UNI_ASTERISK:
|
2009-04-30 17:46:15 +07:00
|
|
|
*target = '*';
|
|
|
|
break;
|
|
|
|
case UNI_QUESTION:
|
|
|
|
*target = '?';
|
|
|
|
break;
|
|
|
|
case UNI_PIPE:
|
|
|
|
*target = '|';
|
|
|
|
break;
|
|
|
|
case UNI_GRTRTHAN:
|
|
|
|
*target = '>';
|
|
|
|
break;
|
|
|
|
case UNI_LESSTHAN:
|
|
|
|
*target = '<';
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
goto cp_convert;
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
return len;
|
|
|
|
|
|
|
|
cp_convert:
|
2011-01-21 01:36:51 +07:00
|
|
|
len = cp->uni2char(src_char, target, NLS_MAX_CHARSET_SIZE);
|
2009-04-30 17:46:15 +07:00
|
|
|
if (len <= 0) {
|
|
|
|
*target = '?';
|
|
|
|
len = 1;
|
|
|
|
}
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* cifs_from_ucs2 - convert utf16le string to local charset
|
|
|
|
* @to - destination buffer
|
|
|
|
* @from - source buffer
|
|
|
|
* @tolen - destination buffer size (in bytes)
|
|
|
|
* @fromlen - source buffer size (in bytes)
|
|
|
|
* @codepage - codepage to which characters should be converted
|
|
|
|
* @mapchar - should characters be remapped according to the mapchars option?
|
|
|
|
*
|
|
|
|
* Convert a little-endian ucs2le string (as sent by the server) to a string
|
|
|
|
* in the provided codepage. The tolen and fromlen parameters are to ensure
|
|
|
|
* that the code doesn't walk off of the end of the buffer (which is always
|
|
|
|
* a danger if the alignment of the source buffer is off). The destination
|
|
|
|
* string is always properly null terminated and fits in the destination
|
|
|
|
* buffer. Returns the length of the destination string in bytes (including
|
|
|
|
* null terminator).
|
|
|
|
*
|
|
|
|
* Note that some windows versions actually send multiword UTF-16 characters
|
|
|
|
* instead of straight UCS-2. The linux nls routines however aren't able to
|
|
|
|
* deal with those characters properly. In the event that we get some of
|
|
|
|
* those characters, they won't be translated properly.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
cifs_from_ucs2(char *to, const __le16 *from, int tolen, int fromlen,
|
|
|
|
const struct nls_table *codepage, bool mapchar)
|
|
|
|
{
|
|
|
|
int i, charlen, safelen;
|
|
|
|
int outlen = 0;
|
|
|
|
int nullsize = nls_nullsize(codepage);
|
|
|
|
int fromwords = fromlen / 2;
|
|
|
|
char tmp[NLS_MAX_CHARSET_SIZE];
|
2011-01-21 01:36:51 +07:00
|
|
|
__u16 ftmp;
|
2009-04-30 17:46:15 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* because the chars can be of varying widths, we need to take care
|
|
|
|
* not to overflow the destination buffer when we get close to the
|
|
|
|
* end of it. Until we get to this offset, we don't need to check
|
|
|
|
* for overflow however.
|
|
|
|
*/
|
|
|
|
safelen = tolen - (NLS_MAX_CHARSET_SIZE + nullsize);
|
|
|
|
|
2011-01-21 01:36:51 +07:00
|
|
|
for (i = 0; i < fromwords; i++) {
|
|
|
|
ftmp = get_unaligned_le16(&from[i]);
|
|
|
|
if (ftmp == 0)
|
|
|
|
break;
|
|
|
|
|
2009-04-30 17:46:15 +07:00
|
|
|
/*
|
|
|
|
* check to see if converting this character might make the
|
|
|
|
* conversion bleed into the null terminator
|
|
|
|
*/
|
|
|
|
if (outlen >= safelen) {
|
2011-01-21 01:36:51 +07:00
|
|
|
charlen = cifs_mapchar(tmp, ftmp, codepage, mapchar);
|
2009-04-30 17:46:15 +07:00
|
|
|
if ((outlen + charlen) > (tolen - nullsize))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* put converted char into 'to' buffer */
|
2011-01-21 01:36:51 +07:00
|
|
|
charlen = cifs_mapchar(&to[outlen], ftmp, codepage, mapchar);
|
2009-04-30 17:46:15 +07:00
|
|
|
outlen += charlen;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* properly null-terminate string */
|
|
|
|
for (i = 0; i < nullsize; i++)
|
|
|
|
to[outlen++] = 0;
|
|
|
|
|
|
|
|
return outlen;
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* NAME: cifs_strtoUCS()
|
|
|
|
*
|
|
|
|
* FUNCTION: Convert character string to unicode string
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
int
|
2008-02-08 06:25:02 +07:00
|
|
|
cifs_strtoUCS(__le16 *to, const char *from, int len,
|
2005-04-17 05:20:36 +07:00
|
|
|
const struct nls_table *codepage)
|
|
|
|
{
|
|
|
|
int charlen;
|
|
|
|
int i;
|
2011-01-21 01:36:51 +07:00
|
|
|
wchar_t wchar_to; /* needed to quiet sparse */
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
for (i = 0; len && *from; i++, from += charlen, len -= charlen) {
|
2011-01-21 01:36:51 +07:00
|
|
|
charlen = codepage->char2uni(from, len, &wchar_to);
|
2005-04-17 05:20:36 +07:00
|
|
|
if (charlen < 1) {
|
2011-01-21 01:36:51 +07:00
|
|
|
cERROR(1, "strtoUCS: char2uni of 0x%x returned %d",
|
|
|
|
*from, charlen);
|
2005-11-11 10:28:44 +07:00
|
|
|
/* A question mark */
|
2011-01-21 01:36:51 +07:00
|
|
|
wchar_to = 0x003f;
|
2005-04-17 05:20:36 +07:00
|
|
|
charlen = 1;
|
2011-01-21 01:36:51 +07:00
|
|
|
}
|
|
|
|
put_unaligned_le16(wchar_to, &to[i]);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2011-01-21 01:36:51 +07:00
|
|
|
put_unaligned_le16(0, &to[i]);
|
2005-04-17 05:20:36 +07:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2009-04-30 18:16:14 +07:00
|
|
|
/*
|
2009-05-01 00:45:10 +07:00
|
|
|
* cifs_strndup_from_ucs - copy a string from wire format to the local codepage
|
2009-04-30 18:16:14 +07:00
|
|
|
* @src - source string
|
|
|
|
* @maxlen - don't walk past this many bytes in the source string
|
|
|
|
* @is_unicode - is this a unicode string?
|
|
|
|
* @codepage - destination codepage
|
|
|
|
*
|
|
|
|
* Take a string given by the server, convert it to the local codepage and
|
|
|
|
* put it in a new buffer. Returns a pointer to the new string or NULL on
|
|
|
|
* error.
|
|
|
|
*/
|
|
|
|
char *
|
2009-05-01 00:45:10 +07:00
|
|
|
cifs_strndup_from_ucs(const char *src, const int maxlen, const bool is_unicode,
|
2009-04-30 18:16:14 +07:00
|
|
|
const struct nls_table *codepage)
|
|
|
|
{
|
|
|
|
int len;
|
|
|
|
char *dst;
|
|
|
|
|
|
|
|
if (is_unicode) {
|
|
|
|
len = cifs_ucs2_bytes((__le16 *) src, maxlen, codepage);
|
|
|
|
len += nls_nullsize(codepage);
|
|
|
|
dst = kmalloc(len, GFP_KERNEL);
|
|
|
|
if (!dst)
|
|
|
|
return NULL;
|
|
|
|
cifs_from_ucs2(dst, (__le16 *) src, len, maxlen, codepage,
|
|
|
|
false);
|
|
|
|
} else {
|
|
|
|
len = strnlen(src, maxlen);
|
|
|
|
len++;
|
|
|
|
dst = kmalloc(len, GFP_KERNEL);
|
|
|
|
if (!dst)
|
|
|
|
return NULL;
|
|
|
|
strlcpy(dst, src, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
2011-01-21 01:36:51 +07:00
|
|
|
/*
|
|
|
|
* Convert 16 bit Unicode pathname to wire format from string in current code
|
|
|
|
* page. Conversion may involve remapping up the six characters that are
|
|
|
|
* only legal in POSIX-like OS (if they are present in the string). Path
|
|
|
|
* names are little endian 16 bit Unicode on the wire
|
|
|
|
*/
|
|
|
|
int
|
2011-04-06 02:02:37 +07:00
|
|
|
cifsConvertToUCS(__le16 *target, const char *source, int srclen,
|
2011-01-21 01:36:51 +07:00
|
|
|
const struct nls_table *cp, int mapChars)
|
|
|
|
{
|
|
|
|
int i, j, charlen;
|
|
|
|
char src_char;
|
2011-04-06 02:02:37 +07:00
|
|
|
__le16 dst_char;
|
|
|
|
wchar_t tmp;
|
2011-01-21 01:36:51 +07:00
|
|
|
|
|
|
|
if (!mapChars)
|
|
|
|
return cifs_strtoUCS(target, source, PATH_MAX, cp);
|
|
|
|
|
2011-04-06 02:02:37 +07:00
|
|
|
for (i = 0, j = 0; i < srclen; j++) {
|
2011-01-21 01:36:51 +07:00
|
|
|
src_char = source[i];
|
2011-05-18 02:28:21 +07:00
|
|
|
charlen = 1;
|
2011-01-21 01:36:51 +07:00
|
|
|
switch (src_char) {
|
|
|
|
case 0:
|
2011-04-06 02:02:37 +07:00
|
|
|
put_unaligned(0, &target[j]);
|
2011-01-21 01:36:51 +07:00
|
|
|
goto ctoUCS_out;
|
|
|
|
case ':':
|
2011-04-06 02:02:37 +07:00
|
|
|
dst_char = cpu_to_le16(UNI_COLON);
|
2011-01-21 01:36:51 +07:00
|
|
|
break;
|
|
|
|
case '*':
|
2011-04-06 02:02:37 +07:00
|
|
|
dst_char = cpu_to_le16(UNI_ASTERISK);
|
2011-01-21 01:36:51 +07:00
|
|
|
break;
|
|
|
|
case '?':
|
2011-04-06 02:02:37 +07:00
|
|
|
dst_char = cpu_to_le16(UNI_QUESTION);
|
2011-01-21 01:36:51 +07:00
|
|
|
break;
|
|
|
|
case '<':
|
2011-04-06 02:02:37 +07:00
|
|
|
dst_char = cpu_to_le16(UNI_LESSTHAN);
|
2011-01-21 01:36:51 +07:00
|
|
|
break;
|
|
|
|
case '>':
|
2011-04-06 02:02:37 +07:00
|
|
|
dst_char = cpu_to_le16(UNI_GRTRTHAN);
|
2011-01-21 01:36:51 +07:00
|
|
|
break;
|
|
|
|
case '|':
|
2011-04-06 02:02:37 +07:00
|
|
|
dst_char = cpu_to_le16(UNI_PIPE);
|
2011-01-21 01:36:51 +07:00
|
|
|
break;
|
|
|
|
/*
|
|
|
|
* FIXME: We can not handle remapping backslash (UNI_SLASH)
|
|
|
|
* until all the calls to build_path_from_dentry are modified,
|
|
|
|
* as they use backslash as separator.
|
|
|
|
*/
|
|
|
|
default:
|
2011-04-06 02:02:37 +07:00
|
|
|
charlen = cp->char2uni(source + i, srclen - i, &tmp);
|
|
|
|
dst_char = cpu_to_le16(tmp);
|
|
|
|
|
2011-01-21 01:36:51 +07:00
|
|
|
/*
|
|
|
|
* if no match, use question mark, which at least in
|
|
|
|
* some cases serves as wild card
|
|
|
|
*/
|
|
|
|
if (charlen < 1) {
|
2011-04-06 02:02:37 +07:00
|
|
|
dst_char = cpu_to_le16(0x003f);
|
2011-01-21 01:36:51 +07:00
|
|
|
charlen = 1;
|
|
|
|
}
|
|
|
|
}
|
2011-05-18 02:28:21 +07:00
|
|
|
/*
|
|
|
|
* character may take more than one byte in the source string,
|
|
|
|
* but will take exactly two bytes in the target string
|
|
|
|
*/
|
|
|
|
i += charlen;
|
2011-04-06 02:02:37 +07:00
|
|
|
put_unaligned(dst_char, &target[j]);
|
2011-01-21 01:36:51 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
ctoUCS_out:
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|