2 Unix SMB/CIFS implementation.
4 Copyright (C) Andrew Tridgell 1992-2002
5 Copyright (C) Simo Sorce 2001
6 Copyright (C) Andrew Bartlett 2002
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
24 /* -------------------------------------------------------------------------- **
27 * March/April 1998 CRH
28 * - Many of the functions in this module overwrite string buffers passed to
29 * them. This causes a variety of problems and is, generally speaking,
30 * dangerous and scarry. See the kludge notes in name_map()
32 * - It seems that something is calling name_map() twice. The
33 * first call is probably some sort of test. Names which contain
34 * illegal characters are being doubly mangled. I'm not sure, but
35 * I'm guessing the problem is in server.c.
37 * -------------------------------------------------------------------------- **
40 /* -------------------------------------------------------------------------- **
43 * March/April 1998 CRH
44 * Updated a bit. Rewrote is_mangled() to be a bit more selective.
45 * Rewrote the mangled name cache. Added comments here and there.
47 * -------------------------------------------------------------------------- **
53 /* -------------------------------------------------------------------------- **
56 * magic_char - This is the magic char used for mangling. It's
57 * global. There is a call to lp_magicchar() in server.c
58 * that is used to override the initial value.
60 * MANGLE_BASE - This is the number of characters we use for name mangling.
62 * basechars - The set characters used for name mangling. This
63 * is static (scope is this file only).
65 * mangle() - Macro used to select a character from basechars (i.e.,
66 * mangle(n) will return the nth digit, modulo MANGLE_BASE).
68 * chartest - array 0..255. The index range is the set of all possible
69 * values of a byte. For each byte value, the content is a
70 * two nibble pair. See BASECHAR_MASK and ILLEGAL_MASK,
73 * ct_initialized - False until the chartest array has been initialized via
74 * a call to init_chartest().
76 * BASECHAR_MASK - Masks the upper nibble of a one-byte value.
78 * ILLEGAL_MASK - Masks the lower nibble of a one-byte value.
80 * isbasecahr() - Given a character, check the chartest array to see
81 * if that character is in the basechars set. This is
82 * faster than using strchr_m().
84 * isillegal() - Given a character, check the chartest array to see
85 * if that character is in the illegal characters set.
86 * This is faster than using strchr_m().
88 * mangled_cache - Cache header used for storing mangled -> original
91 * mc_initialized - False until the mangled_cache structure has been
92 * initialized via a call to reset_mangled_cache().
94 * MANGLED_CACHE_MAX_ENTRIES - Default maximum number of entries for the
95 * cache. A value of 0 indicates "infinite".
97 * MANGLED_CACHE_MAX_MEMORY - Default maximum amount of memory for the
98 * cache. When the cache was kept as an array of 256
99 * byte strings, the default cache size was 50 entries.
100 * This required a fixed 12.5Kbytes of memory. The
101 * mangled stack parameter is no longer used (though
102 * this might change). We're now using a fixed 16Kbyte
103 * maximum cache size. This will probably be much more
107 char magic_char = '~';
109 static char basechars[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_-!@#$%";
110 #define MANGLE_BASE (sizeof(basechars)/sizeof(char)-1)
112 static unsigned char chartest[256] = { 0 };
113 static BOOL ct_initialized = False;
115 #define mangle(V) ((char)(basechars[(V) % MANGLE_BASE]))
116 #define BASECHAR_MASK 0xf0
117 #define ILLEGAL_MASK 0x0f
118 #define isbasechar(C) ( (chartest[ ((C) & 0xff) ]) & BASECHAR_MASK )
119 #define isillegal(C) ( (chartest[ ((C) & 0xff) ]) & ILLEGAL_MASK )
121 static ubi_cacheRoot mangled_cache[1] = { { { 0, 0, 0, 0 }, 0, 0, 0, 0, 0, 0 } };
122 static BOOL mc_initialized = False;
123 #define MANGLED_CACHE_MAX_ENTRIES 1024
124 #define MANGLED_CACHE_MAX_MEMORY 0
126 /* -------------------------------------------------------------------- */
128 static NTSTATUS has_valid_83_chars(const smb_ucs2_t *s, BOOL allow_wildcards)
131 return NT_STATUS_INVALID_PARAMETER;
133 /* CHECK: this should not be necessary if the ms wild chars
134 are not valid in valid.dat --- simo */
135 if (!allow_wildcards && ms_has_wild_w(s))
136 return NT_STATUS_UNSUCCESSFUL;
140 return NT_STATUS_UNSUCCESSFUL;
147 /* return False if something fail and
148 * return 2 alloced unicode strings that contain prefix and extension
151 static NTSTATUS mangle_get_prefix(const smb_ucs2_t *ucs2_string, smb_ucs2_t **prefix,
152 smb_ucs2_t **extension, BOOL allow_wildcards)
158 *prefix = strdup_w(ucs2_string);
160 return NT_STATUS_NO_MEMORY;
162 if ((p = strrchr_w(*prefix, UCS2_CHAR('.')))) {
163 ext_len = strlen_w(p+1);
164 if ((ext_len > 0) && (ext_len < 4) && (p != *prefix) &&
165 (NT_STATUS_IS_OK(has_valid_83_chars(p+1,allow_wildcards)))) /* check extension */ {
167 *extension = strdup_w(p+1);
170 return NT_STATUS_NO_MEMORY;
177 /* ************************************************************************** **
178 * Return NT_STATUS_UNSUCCESSFUL if a name is a special msdos reserved name.
180 * Input: fname - String containing the name to be tested.
182 * Output: NT_STATUS_UNSUCCESSFUL, if the name matches one of the list of reserved names.
184 * Notes: This is a static function called by is_8_3(), below.
186 * ************************************************************************** **
189 static NTSTATUS is_valid_name(const smb_ucs2_t *fname, BOOL allow_wildcards, BOOL only_8_3)
192 NTSTATUS ret = NT_STATUS_OK;
194 if (!fname || !*fname)
195 return NT_STATUS_INVALID_PARAMETER;
197 /* . and .. are valid names. */
198 if (strcmp_wa(fname, ".")==0 || strcmp_wa(fname, "..")==0)
201 /* Name cannot start with '.' */
202 if (*fname == UCS2_CHAR('.'))
203 return NT_STATUS_UNSUCCESSFUL;
206 ret = has_valid_83_chars(fname, allow_wildcards);
207 if (!NT_STATUS_IS_OK(ret))
211 str = strdup_w(fname);
212 p = strchr_w(str, UCS2_CHAR('.'));
213 if (p && p[1] == UCS2_CHAR(0)) {
214 /* Name cannot end in '.' */
216 return NT_STATUS_UNSUCCESSFUL;
226 if(strcmp_wa(p, "UX") == 0)
227 ret = NT_STATUS_UNSUCCESSFUL;
230 if((strcmp_wa(p, "LOCK$") == 0)
231 || (strcmp_wa(p, "ON") == 0)
232 || (strcmp_wa(p, "OM1") == 0)
233 || (strcmp_wa(p, "OM2") == 0)
234 || (strcmp_wa(p, "OM3") == 0)
235 || (strcmp_wa(p, "OM4") == 0)
237 ret = NT_STATUS_UNSUCCESSFUL;
240 if((strcmp_wa(p, "PT1") == 0)
241 || (strcmp_wa(p, "PT2") == 0)
242 || (strcmp_wa(p, "PT3") == 0)
244 ret = NT_STATUS_UNSUCCESSFUL;
247 if(strcmp_wa(p, "UL") == 0)
248 ret = NT_STATUS_UNSUCCESSFUL;
251 if(strcmp_wa(p, "RN") == 0)
252 ret = NT_STATUS_UNSUCCESSFUL;
262 static NTSTATUS is_8_3_w(const smb_ucs2_t *fname, BOOL allow_wildcards)
264 smb_ucs2_t *pref = 0, *ext = 0;
266 NTSTATUS ret = NT_STATUS_UNSUCCESSFUL;
268 if (!fname || !*fname)
269 return NT_STATUS_INVALID_PARAMETER;
271 if (strlen_w(fname) > 12)
272 return NT_STATUS_UNSUCCESSFUL;
274 if (strcmp_wa(fname, ".") == 0 || strcmp_wa(fname, "..") == 0)
277 if (!NT_STATUS_IS_OK(is_valid_name(fname, allow_wildcards, True)))
280 if (!NT_STATUS_IS_OK(mangle_get_prefix(fname, &pref, &ext, allow_wildcards)))
282 plen = strlen_w(pref);
284 if (strchr_wa(pref, '.'))
286 if (plen < 1 || plen > 8)
288 if (ext && (strlen_w(ext) > 3))
299 static BOOL is_8_3(const char *fname, BOOL check_case, BOOL allow_wildcards)
302 smb_ucs2_t *ucs2name;
303 NTSTATUS ret = NT_STATUS_UNSUCCESSFUL;
306 if (!fname || !*fname)
308 if ((f = strrchr(fname, '/')) == NULL)
316 size = push_ucs2_allocate(&ucs2name, f);
317 if (size == (size_t)-1) {
318 DEBUG(0,("is_8_3: internal error push_ucs2_allocate() failed!\n"));
322 ret = is_8_3_w(ucs2name, allow_wildcards);
327 if (!NT_STATUS_IS_OK(ret)) {
336 /* -------------------------------------------------------------------------- **
340 /* ************************************************************************** **
341 * Initialize the static character test array.
347 * Notes: This function changes (loads) the contents of the <chartest>
348 * array. The scope of <chartest> is this file.
350 * ************************************************************************** **
352 static void init_chartest( void )
354 const char *illegalchars = "*\\/?<>|\":";
355 const unsigned char *s;
357 memset( (char *)chartest, '\0', 256 );
359 for( s = (const unsigned char *)illegalchars; *s; s++ )
360 chartest[*s] = ILLEGAL_MASK;
362 for( s = (const unsigned char *)basechars; *s; s++ )
363 chartest[*s] |= BASECHAR_MASK;
365 ct_initialized = True;
368 /* ************************************************************************** **
369 * Return True if the name *could be* a mangled name.
371 * Input: s - A path name - in UNIX pathname format.
373 * Output: True if the name matches the pattern described below in the
376 * Notes: The input name is *not* tested for 8.3 compliance. This must be
377 * done separately. This function returns true if the name contains
378 * a magic character followed by excactly two characters from the
379 * basechars list (above), which in turn are followed either by the
380 * nul (end of string) byte or a dot (extension) or by a '/' (end of
383 * ************************************************************************** **
385 static BOOL is_mangled(const char *s)
389 if( !ct_initialized )
392 magic = strchr_m( s, magic_char );
393 while( magic && magic[1] && magic[2] ) { /* 3 chars, 1st is magic. */
394 if( ('.' == magic[3] || '/' == magic[3] || !(magic[3])) /* Ends with '.' or nul or '/' ? */
395 && isbasechar( toupper(magic[1]) ) /* is 2nd char basechar? */
396 && isbasechar( toupper(magic[2]) ) ) /* is 3rd char basechar? */
397 return( True ); /* If all above, then true, */
398 magic = strchr_m( magic+1, magic_char ); /* else seek next magic. */
403 /* ************************************************************************** **
404 * Compare two cache keys and return a value indicating their ordinal
407 * Input: ItemPtr - Pointer to a comparison key. In this case, this will
408 * be a mangled name string.
409 * NodePtr - Pointer to a node in the cache. The node structure
410 * will be followed in memory by a mangled name string.
412 * Output: A signed integer, as follows:
413 * (x < 0) <==> Key1 less than Key2
414 * (x == 0) <==> Key1 equals Key2
415 * (x > 0) <==> Key1 greater than Key2
417 * Notes: This is a ubiqx-style comparison routine. See ubi_BinTree for
420 * ************************************************************************** **
422 static signed int cache_compare( ubi_btItemPtr ItemPtr, ubi_btNodePtr NodePtr )
424 char *Key1 = (char *)ItemPtr;
425 char *Key2 = (char *)(((ubi_cacheEntryPtr)NodePtr) + 1);
427 return( StrCaseCmp( Key1, Key2 ) );
430 /* ************************************************************************** **
431 * Free a cache entry.
433 * Input: WarrenZevon - Pointer to the entry that is to be returned to
437 * Notes: This function gets around the possibility that the standard
438 * free() function may be implemented as a macro, or other evil
439 * subversions (oh, so much fun).
441 * ************************************************************************** **
443 static void cache_free_entry( ubi_trNodePtr WarrenZevon )
445 ZERO_STRUCTP(WarrenZevon);
446 SAFE_FREE( WarrenZevon );
449 /* ************************************************************************** **
450 * Initializes or clears the mangled cache.
455 * Notes: There is a section below that is commented out. It shows how
456 * one might use lp_ calls to set the maximum memory and entry size
457 * of the cache. You might also want to remove the constants used
458 * in ubi_cacheInit() and replace them with lp_ calls. If so, then
459 * the calls to ubi_cacheSetMax*() would be moved into the else
460 * clause. Another option would be to pass in the max_entries and
461 * max_memory values as parameters. crh 09-Apr-1998.
463 * ************************************************************************** **
466 static void mangle_reset( void )
468 if( !mc_initialized ) {
469 (void)ubi_cacheInit( mangled_cache,
472 MANGLED_CACHE_MAX_ENTRIES,
473 MANGLED_CACHE_MAX_MEMORY );
474 mc_initialized = True;
476 (void)ubi_cacheClear( mangled_cache );
480 (void)ubi_cacheSetMaxEntries( mangled_cache, lp_mangled_cache_entries() );
481 (void)ubi_cacheSetMaxMemory( mangled_cache, lp_mangled_cache_memory() );
485 /* ************************************************************************** **
486 * Add a mangled name into the cache.
488 * Notes: If the mangled cache has not been initialized, then the
489 * function will simply fail. It could initialize the cache,
490 * but that's not the way it was done before I changed the
491 * cache mechanism, so I'm sticking with the old method.
493 * If the extension of the raw name maps directly to the
494 * extension of the mangled name, then we'll store both names
495 * *without* extensions. That way, we can provide consistent
496 * reverse mangling for all names that match. The test here is
497 * a bit more careful than the one done in earlier versions of
500 * - the extension must exist on the raw name,
501 * - it must be all lower case
502 * - it must match the mangled extension (to prove that no
503 * mangling occurred).
507 * ************************************************************************** **
509 static void cache_mangled_name( char *mangled_name, char *raw_name )
511 ubi_cacheEntryPtr new_entry;
518 /* If the cache isn't initialized, give up. */
519 if( !mc_initialized )
522 /* Init the string lengths. */
523 mangled_len = strlen( mangled_name );
524 raw_len = strlen( raw_name );
526 /* See if the extensions are unmangled. If so, store the entry
527 * without the extension, thus creating a "group" reverse map.
529 s1 = strrchr( mangled_name, '.' );
530 if( s1 && (s2 = strrchr( raw_name, '.' )) ) {
532 while( s1[i] && (tolower( s1[i] ) == s2[i]) )
534 if( !s1[i] && !s2[i] ) {
540 /* Allocate a new cache entry. If the allocation fails, just return. */
541 i = sizeof( ubi_cacheEntry ) + mangled_len + raw_len + 2;
542 new_entry = malloc( i );
546 /* Fill the new cache entry, and add it to the cache. */
547 s1 = (char *)(new_entry + 1);
548 s2 = (char *)&(s1[mangled_len + 1]);
549 safe_strcpy( s1, mangled_name, mangled_len );
550 safe_strcpy( s2, raw_name, raw_len );
551 ubi_cachePut( mangled_cache, i, new_entry, s1 );
554 /* ************************************************************************** **
555 * Check for a name on the mangled name stack
557 * Input: s - Input *and* output string buffer.
559 * Output: True if the name was found in the cache, else False.
561 * Notes: If a reverse map is found, the function will overwrite the string
562 * space indicated by the input pointer <s>. This is frightening.
563 * It should be rewritten to return NULL if the long name was not
564 * found, and a pointer to the long name if it was found.
566 * ************************************************************************** **
569 static BOOL check_cache( char *s )
571 ubi_cacheEntryPtr FoundPtr;
572 char *ext_start = NULL;
574 char *saved_ext = NULL;
576 /* If the cache isn't initialized, give up. */
577 if( !mc_initialized )
580 FoundPtr = ubi_cacheGet( mangled_cache, (ubi_trItemPtr)s );
582 /* If we didn't find the name *with* the extension, try without. */
584 ext_start = strrchr( s, '.' );
586 if((saved_ext = strdup(ext_start)) == NULL)
590 FoundPtr = ubi_cacheGet( mangled_cache, (ubi_trItemPtr)s );
592 * At this point s is the name without the
593 * extension. We re-add the extension if saved_ext
594 * is not null, before freeing saved_ext.
599 /* Okay, if we haven't found it we're done. */
602 /* Replace the saved_ext as it was truncated. */
603 (void)pstrcat( s, saved_ext );
604 SAFE_FREE(saved_ext);
609 /* If we *did* find it, we need to copy it into the string buffer. */
610 found_name = (char *)(FoundPtr + 1);
611 found_name += (strlen( found_name ) + 1);
613 (void)pstrcpy( s, found_name );
615 /* Replace the saved_ext as it was truncated. */
616 (void)pstrcat( s, saved_ext );
617 SAFE_FREE(saved_ext);
623 /*****************************************************************************
624 * do the actual mangling to 8.3 format
625 * the buffer must be able to hold 13 characters (including the null)
626 *****************************************************************************
628 static void to_8_3(char *s, int default_case)
641 if( p && (strlen(p+1) < (size_t)4) ) {
642 BOOL all_normal = ( strisnormal(p+1, default_case) ); /* XXXXXXXXX */
644 if( all_normal && p[1] != 0 ) {
646 csum = str_checksum( s );
649 csum = str_checksum(s);
651 csum = str_checksum(s);
657 safe_strcpy( extension, "___", 3 );
660 while( *p && extlen < 3 ) {
662 extension[extlen++] = p[0];
666 extension[extlen] = 0;
672 while( *p && baselen < 5 ) {
674 base[baselen++] = p[0];
680 csum = csum % (MANGLE_BASE*MANGLE_BASE);
682 (void)slprintf(s, 12, "%s%c%c%c",
683 base, magic_char, mangle( csum/MANGLE_BASE ), mangle( csum ) );
686 (void)pstrcat( s, "." );
687 (void)pstrcat( s, extension );
691 /*****************************************************************************
692 * Convert a filename to DOS format. Return True if successful.
694 * Input: OutName - Source *and* destination buffer.
696 * NOTE that OutName must point to a memory space that
697 * is at least 13 bytes in size!
699 * need83 - If False, name mangling will be skipped unless the
700 * name contains illegal characters. Mapping will still
701 * be done, if appropriate. This is probably used to
702 * signal that a client does not require name mangling,
703 * thus skipping the name mangling even on shares which
704 * have name-mangling turned on.
705 * cache83 - If False, the mangled name cache will not be updated.
706 * This is usually used to prevent that we overwrite
707 * a conflicting cache entry prematurely, i.e. before
708 * we know whether the client is really interested in the
709 * current name. (See PR#13758). UKD.
711 * Output: Returns False only if the name wanted mangling but the share does
712 * not have name mangling turned on.
714 * ****************************************************************************
717 static void name_map(char *OutName, BOOL need83, BOOL cache83, int default_case)
719 smb_ucs2_t *OutName_ucs2;
720 DEBUG(5,("name_map( %s, need83 = %s, cache83 = %s)\n", OutName,
721 need83 ? "True" : "False", cache83 ? "True" : "False"));
723 if (push_ucs2_allocate(&OutName_ucs2, OutName) == (size_t)-1) {
724 DEBUG(0, ("push_ucs2_allocate failed!\n"));
728 if( !need83 && !NT_STATUS_IS_OK(is_valid_name(OutName_ucs2, False, False)))
731 /* check if it's already in 8.3 format */
732 if (need83 && !NT_STATUS_IS_OK(is_8_3_w(OutName_ucs2, False))) {
735 /* mangle it into 8.3 */
737 tmp = strdup(OutName);
739 to_8_3(OutName, default_case);
742 cache_mangled_name(OutName, tmp);
747 DEBUG(5,("name_map() ==> [%s]\n", OutName));
748 SAFE_FREE(OutName_ucs2);
752 the following provides the abstraction layer to make it easier
753 to drop in an alternative mangling implementation
755 static struct mangle_fns mangle_fns = {
763 /* return the methods for this mangling implementation */
764 struct mangle_fns *mangle_hash_init(void)