ctdb/docs: Include ceph rados namespace support in man page
[Samba.git] / source3 / smbd / mangle_hash2.c
blob0075d3bfcba4dab08f70d18197b032212602216e
1 /*
2 Unix SMB/CIFS implementation.
3 new hash based name mangling implementation
4 Copyright (C) Andrew Tridgell 2002
5 Copyright (C) Simo Sorce 2002
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
22 this mangling scheme uses the following format
24 Annnn~n.AAA
26 where nnnnn is a base 36 hash, and A represents characters from the original string
28 The hash is taken of the leading part of the long filename, in uppercase
30 for simplicity, we only allow ascii characters in 8.3 names
33 /* hash algorithm changed to FNV1 by idra@samba.org (Simo Sorce).
34 * see http://www.isthe.com/chongo/tech/comp/fnv/index.html for a
35 * discussion on Fowler / Noll / Vo (FNV) Hash by one of it's authors
39 ===============================================================================
40 NOTE NOTE NOTE!!!
42 This file deliberately uses non-multibyte string functions in many places. This
43 is *not* a mistake. This code is multi-byte safe, but it gets this property
44 through some very subtle knowledge of the way multi-byte strings are encoded
45 and the fact that this mangling algorithm only supports ascii characters in
46 8.3 names.
48 please don't convert this file to use the *_m() functions!!
49 ===============================================================================
53 * ============================================================================
54 * Whenever you change anything in the FLAG_ or other fields,
55 * re-initialize the tables char_flags and base_reverse by running the
56 * init_tables() routine once and dump its results. To do this, a
57 * single smbd run with
59 * #define DYNAMIC_MANGLE_TABLES 1
61 * and debug level 10 should be sufficient.
62 * ============================================================================
66 #include "includes.h"
67 #include "smbd/smbd.h"
68 #include "smbd/globals.h"
69 #include "../lib/util/memcache.h"
70 #include "mangle.h"
72 #if 1
73 #define M_DEBUG(level, x) DEBUG(level, x)
74 #else
75 #define M_DEBUG(level, x)
76 #endif
78 /* these flags are used to mark characters in as having particular
79 properties */
80 #define FLAG_BASECHAR 1
81 #define FLAG_ASCII 2
82 #define FLAG_ILLEGAL 4
83 #define FLAG_WILDCARD 8
85 /* the "possible" flags are used as a fast way to find possible DOS
86 reserved filenames */
87 #define FLAG_POSSIBLE1 16
88 #define FLAG_POSSIBLE2 32
89 #define FLAG_POSSIBLE3 64
90 #define FLAG_POSSIBLE4 128
92 #define FNV1_PRIME 0x01000193
93 /*the following number is a fnv1 of the string: idra@samba.org 2002 */
94 #define FNV1_INIT 0xa6b93095
96 #define FLAG_CHECK(c, flag) (char_flags[(unsigned char)(c)] & (flag))
98 /* these are the characters we use in the 8.3 hash. Must be 36 chars long */
99 static const char basechars[36] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
100 #define base_forward(v) basechars[v]
102 /* the list of reserved dos names - all of these are illegal */
103 static const char * const reserved_names[] =
104 { "AUX", "CON",
105 "COM1", "COM2", "COM3", "COM4", "COM5", "COM6", "COM7", "COM8", "COM9",
106 "LPT1", "LPT2", "LPT3", "LPT4", "LPT5", "LPT6", "LPT7", "LPT8", "LPT9",
107 "NUL", "PRN", NULL };
109 #define DYNAMIC_MANGLE_TABLES 0
111 #if DYNAMIC_MANGLE_TABLES
113 /* these tables are used to provide fast tests for characters */
114 static unsigned char char_flags[256];
115 static unsigned char base_reverse[256];
117 /* initialise the flags table
119 we allow only a very restricted set of characters as 'ascii' in this
120 mangling backend. This isn't a significant problem as modern clients
121 use the 'long' filenames anyway, and those don't have these
122 restrictions.
124 static void init_tables(void)
126 int i;
128 memset(char_flags, 0, sizeof(char_flags));
130 for (i=1;i<128;i++) {
131 if (i <= 0x1f) {
132 /* Control characters. */
133 char_flags[i] |= FLAG_ILLEGAL;
136 if ((i >= '0' && i <= '9') ||
137 (i >= 'a' && i <= 'z') ||
138 (i >= 'A' && i <= 'Z')) {
139 char_flags[i] |= (FLAG_ASCII | FLAG_BASECHAR);
141 if (strchr("_-$~", i)) {
142 char_flags[i] |= FLAG_ASCII;
145 if (strchr("*\\/?<>|\":", i)) {
146 char_flags[i] |= FLAG_ILLEGAL;
149 if (strchr("*?\"<>", i)) {
150 char_flags[i] |= FLAG_WILDCARD;
154 memset(base_reverse, 0, sizeof(base_reverse));
155 for (i=0;i<36;i++) {
156 base_reverse[(unsigned char)base_forward(i)] = i;
159 /* fill in the reserved names flags. These are used as a very
160 fast filter for finding possible DOS reserved filenames */
161 for (i=0; reserved_names[i]; i++) {
162 unsigned char c1, c2, c3, c4;
164 c1 = (unsigned char)reserved_names[i][0];
165 c2 = (unsigned char)reserved_names[i][1];
166 c3 = (unsigned char)reserved_names[i][2];
167 c4 = (unsigned char)reserved_names[i][3];
169 char_flags[c1] |= FLAG_POSSIBLE1;
170 char_flags[c2] |= FLAG_POSSIBLE2;
171 char_flags[c3] |= FLAG_POSSIBLE3;
172 char_flags[c4] |= FLAG_POSSIBLE4;
173 char_flags[tolower_m(c1)] |= FLAG_POSSIBLE1;
174 char_flags[tolower_m(c2)] |= FLAG_POSSIBLE2;
175 char_flags[tolower_m(c3)] |= FLAG_POSSIBLE3;
176 char_flags[tolower_m(c4)] |= FLAG_POSSIBLE4;
178 char_flags[(unsigned char)'.'] |= FLAG_POSSIBLE4;
181 #if 0
182 DEBUG(10, ("char_flags\n"));
183 dump_data(10, char_flags, sizeof(char_flags));
185 DEBUG(10, ("base_reverse\n"));
186 dump_data(10, base_reverse, sizeof(base_reverse));
187 #endif
190 #else /* DYNAMIC_MANGLE_TABLES */
193 * These tables were initialized by a single run of the above
194 * init_tables() routine, dumping the tables and a simple emacs macro.
196 * Technically we could leave out the 0's at the end of the array
197 * initializers, but I'll leave it in: less surprise.
200 static const uint8_t char_flags[256] = {
201 0x80, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
202 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
203 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
204 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
205 0x00, 0x00, 0x0C, 0x00, 0x02, 0x00, 0x00, 0x00,
206 0x00, 0x00, 0x0C, 0x00, 0x00, 0x02, 0x80, 0x04,
207 0x03, 0x83, 0x83, 0x83, 0x83, 0x03, 0x03, 0x03,
208 0x03, 0x03, 0x04, 0x00, 0x0C, 0x00, 0x0C, 0x0C,
209 0x00, 0x13, 0x03, 0x53, 0x03, 0x03, 0x03, 0x03,
210 0x03, 0x03, 0x03, 0x83, 0x53, 0x43, 0x53, 0x23,
211 0x33, 0x03, 0x23, 0x03, 0x43, 0x23, 0x03, 0x03,
212 0x43, 0x03, 0x03, 0x00, 0x04, 0x00, 0x00, 0x02,
213 0x00, 0x13, 0x03, 0x53, 0x03, 0x03, 0x03, 0x03,
214 0x03, 0x03, 0x03, 0x83, 0x53, 0x43, 0x53, 0x23,
215 0x33, 0x03, 0x23, 0x03, 0x43, 0x23, 0x03, 0x03,
216 0x43, 0x03, 0x03, 0x00, 0x04, 0x00, 0x02, 0x00,
217 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
218 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
219 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
220 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
221 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
222 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
223 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
224 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
225 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
226 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
227 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
228 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
229 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
230 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
231 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
232 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
235 static const uint8_t base_reverse[256] = {
236 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
237 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
238 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
239 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
240 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
241 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
242 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
243 0x08, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
244 0x00, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10,
245 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18,
246 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20,
247 0x21, 0x22, 0x23, 0x00, 0x00, 0x00, 0x00, 0x00,
248 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
249 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
250 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
251 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
252 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
253 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
254 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
255 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
256 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
257 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
258 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
259 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
260 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
261 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
262 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
263 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
264 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
265 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
266 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
267 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
270 #endif /* DYNAMIC_MANGLE_TABLES */
273 hash a string of the specified length. The string does not need to be
274 null terminated
276 this hash needs to be fast with a low collision rate (what hash doesn't?)
278 static unsigned int mangle_hash(const char *key, unsigned int length)
280 unsigned int value;
281 unsigned int i;
282 fstring str;
284 /* we have to uppercase here to ensure that the mangled name
285 doesn't depend on the case of the long name. Note that this
286 is the only place where we need to use a multi-byte string
287 function */
288 length = MIN(length,sizeof(fstring)-1);
289 strncpy(str, key, length);
290 str[length] = 0;
291 (void)strupper_m(str);
293 /* the length of a multi-byte string can change after a strupper_m */
294 length = strlen(str);
296 /* Set the initial value from the key size. */
297 for (value = FNV1_INIT, i=0; i < length; i++) {
298 value *= (unsigned int)FNV1_PRIME;
299 value ^= (unsigned int)(str[i]);
302 /* note that we force it to a 31 bit hash, to keep within the limits
303 of the 36^6 mangle space */
304 return value & ~0x80000000;
308 insert an entry into the prefix cache. The string might not be null
309 terminated */
310 static void cache_insert(const char *prefix, int length, unsigned int hash)
312 char *str = SMB_STRNDUP(prefix, length);
314 if (str == NULL) {
315 return;
318 memcache_add(smbd_memcache(), MANGLE_HASH2_CACHE,
319 data_blob_const(&hash, sizeof(hash)),
320 data_blob_const(str, length+1));
321 SAFE_FREE(str);
325 lookup an entry in the prefix cache. Return NULL if not found.
327 static char *cache_lookup(TALLOC_CTX *mem_ctx, unsigned int hash)
329 DATA_BLOB value;
331 if (!memcache_lookup(smbd_memcache(), MANGLE_HASH2_CACHE,
332 data_blob_const(&hash, sizeof(hash)), &value)) {
333 return NULL;
336 SMB_ASSERT((value.length > 0)
337 && (value.data[value.length-1] == '\0'));
339 return talloc_strdup(mem_ctx, (char *)value.data);
344 determine if a string is possibly in a mangled format, ignoring
345 case
347 In this algorithm, mangled names use only pure ascii characters (no
348 multi-byte) so we can avoid doing a UCS2 conversion
350 static bool is_mangled_component(const char *name, size_t len)
352 unsigned int i;
354 M_DEBUG(10,("is_mangled_component %s (len %lu) ?\n", name, (unsigned long)len));
356 /* check the length */
357 if (len > 12 || len < 8)
358 return False;
360 /* the best distinguishing characteristic is the ~ */
361 if (name[6] != '~')
362 return False;
364 /* check extension */
365 if (len > 8) {
366 if (name[8] != '.')
367 return False;
368 for (i=9; name[i] && i < len; i++) {
369 if (! FLAG_CHECK(name[i], FLAG_ASCII)) {
370 return False;
375 /* check lead characters */
376 for (i=0;i<mangle_prefix;i++) {
377 if (! FLAG_CHECK(name[i], FLAG_ASCII)) {
378 return False;
382 /* check rest of hash */
383 if (! FLAG_CHECK(name[7], FLAG_BASECHAR)) {
384 return False;
386 for (i=mangle_prefix;i<6;i++) {
387 if (! FLAG_CHECK(name[i], FLAG_BASECHAR)) {
388 return False;
392 M_DEBUG(10,("is_mangled_component %s (len %lu) -> yes\n", name, (unsigned long)len));
394 return True;
400 determine if a string is possibly in a mangled format, ignoring
401 case
403 In this algorithm, mangled names use only pure ascii characters (no
404 multi-byte) so we can avoid doing a UCS2 conversion
406 NOTE! This interface must be able to handle a path with unix
407 directory separators. It should return true if any component is
408 mangled
410 static bool is_mangled(const char *name, const struct share_params *parm)
412 const char *p;
413 const char *s;
415 M_DEBUG(10,("is_mangled %s ?\n", name));
417 for (s=name; (p=strchr(s, '/')); s=p+1) {
418 if (is_mangled_component(s, PTR_DIFF(p, s))) {
419 return True;
423 /* and the last part ... */
424 return is_mangled_component(s,strlen(s));
429 see if a filename is an allowable 8.3 name to return to the client.
430 Note this is not testing if this is a valid Samba mangled name, so
431 the rules are different for is_mangled.
433 we are only going to allow ascii characters in 8.3 names, as this
434 simplifies things greatly (it means that we know the string won't
435 get larger when converted from UNIX to DOS formats)
438 static const char force_shortname_chars[] = " +,[];=";
440 static bool is_8_3(const char *name, bool check_case, bool allow_wildcards, const struct share_params *p)
442 int len, i;
443 char *dot_p;
445 /* as a special case, the names '.' and '..' are allowable 8.3 names */
446 if (ISDOT(name) || (ISDOTDOT(name))) {
447 return true;
450 /* the simplest test is on the overall length of the
451 filename. Note that we deliberately use the ascii string
452 length (not the multi-byte one) as it is faster, and gives us
453 the result we need in this case. Using strlen_m would not
454 only be slower, it would be incorrect */
455 len = strlen(name);
456 if (len > 12)
457 return False;
459 /* find the '.'. Note that once again we use the non-multibyte
460 function */
461 dot_p = strchr(name, '.');
463 if (!dot_p) {
464 /* if the name doesn't contain a '.' then its length
465 must be less than 8 */
466 if (len > 8) {
467 return False;
469 } else {
470 int prefix_len, suffix_len;
472 /* if it does contain a dot then the prefix must be <=
473 8 and the suffix <= 3 in length */
474 prefix_len = PTR_DIFF(dot_p, name);
475 suffix_len = len - (prefix_len+1);
477 if (prefix_len > 8 || suffix_len > 3 || suffix_len == 0) {
478 return False;
481 /* a 8.3 name cannot contain more than 1 '.' */
482 if (strchr(dot_p+1, '.')) {
483 return False;
487 /* the length are all OK. Now check to see if the characters themselves are OK */
488 for (i=0; name[i]; i++) {
489 if (FLAG_CHECK(name[i], FLAG_ILLEGAL)) {
490 return false;
492 /* note that we may allow wildcard petterns! */
493 if (!allow_wildcards && FLAG_CHECK(name[i], FLAG_WILDCARD)) {
494 return false;
496 if (((unsigned char)name[i]) > 0x7e) {
497 return false;
499 if (strchr(force_shortname_chars, name[i])) {
500 return false;
504 /* it is a good 8.3 name */
505 return True;
510 reset the mangling cache on a smb.conf reload. This only really makes sense for
511 mangling backends that have parameters in smb.conf, and as this backend doesn't
512 this is a NULL operation
514 static void mangle_reset(void)
516 /* noop */
521 try to find a 8.3 name in the cache, and if found then
522 replace the string with the original long name.
524 static bool lookup_name_from_8_3(TALLOC_CTX *ctx,
525 const char *name,
526 char **pp_out, /* talloced on the given context. */
527 const struct share_params *p)
529 unsigned int hash, multiplier;
530 unsigned int i;
531 char *prefix;
532 char extension[4];
534 *pp_out = NULL;
536 /* make sure that this is a mangled name from this cache */
537 if (!is_mangled(name, p)) {
538 M_DEBUG(10,("lookup_name_from_8_3: %s -> not mangled\n", name));
539 return False;
542 /* we need to extract the hash from the 8.3 name */
543 hash = base_reverse[(unsigned char)name[7]];
544 for (multiplier=36, i=5;i>=mangle_prefix;i--) {
545 unsigned int v = base_reverse[(unsigned char)name[i]];
546 hash += multiplier * v;
547 multiplier *= 36;
550 /* now look in the prefix cache for that hash */
551 prefix = cache_lookup(ctx, hash);
552 if (!prefix) {
553 M_DEBUG(10,("lookup_name_from_8_3: %s -> %08X -> not found\n",
554 name, hash));
555 return False;
558 /* we found it - construct the full name */
559 if (name[8] == '.') {
560 strncpy(extension, name+9, 3);
561 extension[3] = 0;
562 } else {
563 extension[0] = 0;
566 if (extension[0]) {
567 M_DEBUG(10,("lookup_name_from_8_3: %s -> %s.%s\n",
568 name, prefix, extension));
569 *pp_out = talloc_asprintf(ctx, "%s.%s", prefix, extension);
570 } else {
571 M_DEBUG(10,("lookup_name_from_8_3: %s -> %s\n", name, prefix));
572 *pp_out = talloc_strdup(ctx, prefix);
575 TALLOC_FREE(prefix);
577 if (!*pp_out) {
578 M_DEBUG(0,("talloc_fail\n"));
579 return False;
582 return True;
586 look for a DOS reserved name
588 static bool is_reserved_name(const char *name)
590 if (FLAG_CHECK(name[0], FLAG_POSSIBLE1) &&
591 FLAG_CHECK(name[1], FLAG_POSSIBLE2) &&
592 FLAG_CHECK(name[2], FLAG_POSSIBLE3) &&
593 FLAG_CHECK(name[3], FLAG_POSSIBLE4)) {
594 /* a likely match, scan the lot */
595 int i;
596 for (i=0; reserved_names[i]; i++) {
597 int len = strlen(reserved_names[i]);
598 /* note that we match on COM1 as well as COM1.foo */
599 if (strnequal(name, reserved_names[i], len) &&
600 (name[len] == '.' || name[len] == 0)) {
601 return True;
606 return False;
610 See if a filename is a legal long filename.
611 A filename ending in a '.' is not legal unless it's "." or "..". JRA.
612 A filename ending in ' ' is not legal either. See bug id #2769.
615 static bool is_legal_name(const char *name)
617 const char *dot_pos = NULL;
618 bool alldots = True;
619 size_t numdots = 0;
621 while (*name) {
622 if (((unsigned int)name[0]) > 128 && (name[1] != 0)) {
623 /* Possible start of mb character. */
624 size_t size = 0;
625 (void)next_codepoint(name, &size);
627 * Note that we're only looking for multibyte
628 * encoding here. No encoding with a length > 1
629 * contains invalid characters.
631 if (size > 1) {
632 /* Was a mb string. */
633 name += size;
634 continue;
638 if (FLAG_CHECK(name[0], FLAG_ILLEGAL)) {
639 return False;
641 if (name[0] == '.') {
642 dot_pos = name;
643 numdots++;
644 } else {
645 alldots = False;
647 if ((name[0] == ' ') && (name[1] == '\0')) {
648 /* Can't end in ' ' */
649 return False;
651 name++;
654 if (dot_pos) {
655 if (alldots && (numdots == 1 || numdots == 2))
656 return True; /* . or .. is a valid name */
658 /* A valid long name cannot end in '.' */
659 if (dot_pos[1] == '\0')
660 return False;
662 return True;
665 static bool must_mangle(const char *name,
666 const struct share_params *p)
668 if (is_reserved_name(name)) {
669 return True;
671 return !is_legal_name(name);
675 the main forward mapping function, which converts a long filename to
676 a 8.3 name
678 if cache83 is not set then we don't cache the result
681 static bool hash2_name_to_8_3(const char *name,
682 char new_name[13],
683 bool cache83,
684 int default_case,
685 const struct share_params *p)
687 char *dot_p;
688 char lead_chars[7];
689 char extension[4];
690 unsigned int extension_length, i;
691 unsigned int prefix_len;
692 unsigned int hash, v;
694 /* reserved names are handled specially */
695 if (!is_reserved_name(name)) {
696 /* if the name is already a valid 8.3 name then we don't need to
697 * change anything */
698 if (is_legal_name(name) && is_8_3(name, False, False, p)) {
699 strlcpy(new_name, name, 13);
700 return True;
704 /* find the '.' if any */
705 dot_p = strrchr(name, '.');
707 if (dot_p) {
708 /* if the extension contains any illegal characters or
709 is too long or zero length then we treat it as part
710 of the prefix */
711 for (i=0; i<4 && dot_p[i+1]; i++) {
712 if (! FLAG_CHECK(dot_p[i+1], FLAG_ASCII)) {
713 dot_p = NULL;
714 break;
717 if (i == 0 || i == 4) {
718 dot_p = NULL;
722 /* the leading characters in the mangled name is taken from
723 the first characters of the name, if they are ascii otherwise
724 '_' is used
726 for (i=0;i<mangle_prefix && name[i];i++) {
727 lead_chars[i] = name[i];
728 if (! FLAG_CHECK(lead_chars[i], FLAG_ASCII)) {
729 lead_chars[i] = '_';
731 lead_chars[i] = toupper_m(lead_chars[i]);
733 for (;i<mangle_prefix;i++) {
734 lead_chars[i] = '_';
737 /* the prefix is anything up to the first dot */
738 if (dot_p) {
739 prefix_len = PTR_DIFF(dot_p, name);
740 } else {
741 prefix_len = strlen(name);
744 /* the extension of the mangled name is taken from the first 3
745 ascii chars after the dot */
746 extension_length = 0;
747 if (dot_p) {
748 for (i=1; extension_length < 3 && dot_p[i]; i++) {
749 char c = dot_p[i];
750 if (FLAG_CHECK(c, FLAG_ASCII)) {
751 extension[extension_length++] =
752 toupper_m(c);
757 /* find the hash for this prefix */
758 v = hash = mangle_hash(name, prefix_len);
760 /* now form the mangled name. */
761 for (i=0;i<mangle_prefix;i++) {
762 new_name[i] = lead_chars[i];
764 new_name[7] = base_forward(v % 36);
765 new_name[6] = '~';
766 for (i=5; i>=mangle_prefix; i--) {
767 v = v / 36;
768 new_name[i] = base_forward(v % 36);
771 /* add the extension */
772 if (extension_length) {
773 new_name[8] = '.';
774 memcpy(&new_name[9], extension, extension_length);
775 new_name[9+extension_length] = 0;
776 } else {
777 new_name[8] = 0;
780 if (cache83) {
781 /* put it in the cache */
782 cache_insert(name, prefix_len, hash);
785 M_DEBUG(10,("hash2_name_to_8_3: %s -> %08X -> %s (cache=%d)\n",
786 name, hash, new_name, cache83));
788 return True;
792 the following provides the abstraction layer to make it easier
793 to drop in an alternative mangling implementation */
794 static const struct mangle_fns mangle_hash2_fns = {
795 mangle_reset,
796 is_mangled,
797 must_mangle,
798 is_8_3,
799 lookup_name_from_8_3,
800 hash2_name_to_8_3
803 /* return the methods for this mangling implementation */
804 const struct mangle_fns *mangle_hash2_init(void)
806 /* the mangle prefix can only be in the mange 1 to 6 */
807 mangle_prefix = lp_mangle_prefix();
808 if (mangle_prefix > 6) {
809 mangle_prefix = 6;
811 if (mangle_prefix < 1) {
812 mangle_prefix = 1;
815 #if DYNAMIC_MANGLE_TABLES
816 init_tables();
817 #endif
818 mangle_reset();
820 return &mangle_hash2_fns;
823 static void posix_mangle_reset(void)
826 static bool posix_is_mangled(const char *s, const struct share_params *p)
828 return False;
831 static bool posix_must_mangle(const char *s, const struct share_params *p)
833 return False;
836 static bool posix_is_8_3(const char *fname,
837 bool check_case,
838 bool allow_wildcards,
839 const struct share_params *p)
841 return False;
844 static bool posix_lookup_name_from_8_3(TALLOC_CTX *ctx,
845 const char *in,
846 char **out, /* talloced on the given context. */
847 const struct share_params *p)
849 return False;
852 static bool posix_name_to_8_3(const char *in,
853 char out[13],
854 bool cache83,
855 int default_case,
856 const struct share_params *p)
858 memset(out, '\0', 13);
859 return True;
862 /* POSIX paths backend - no mangle. */
863 static const struct mangle_fns posix_mangle_fns = {
864 posix_mangle_reset,
865 posix_is_mangled,
866 posix_must_mangle,
867 posix_is_8_3,
868 posix_lookup_name_from_8_3,
869 posix_name_to_8_3
872 const struct mangle_fns *posix_mangle_init(void)
874 return &posix_mangle_fns;