1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
4 * Copyright (C) 2002, 2003 Cluster File Systems, Inc.
6 * This file is part of Lustre, http://www.lustre.org.
8 * Lustre is free software; you can redistribute it and/or
9 * modify it under the terms of version 2 of the GNU General Public
10 * License as published by the Free Software Foundation.
12 * Lustre 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 Lustre; if not, write to the Free Software
19 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 #define DEBUG_SUBSYSTEM S_CLASS
23 #include <obd_class.h>
25 #include <linux/kmod.h> /* for request_module() */
26 #include <linux/module.h>
27 #include <linux/random.h>
28 #include <linux/slab.h>
29 #include <linux/pagemap.h>
31 #include <liblustre.h>
34 #include <lprocfs_status.h>
35 #include <lustre/lustre_idl.h>
38 #include <linux/jbd.h>
39 #ifdef HAVE_SERVER_SUPPORT
41 #include <linux/ldiskfs_fs.h>
44 static int mea_last_char_hash(int count, char *name, int namelen)
48 c = name[namelen - 1];
50 CWARN("looks like wrong len is passed\n");
55 static int mea_all_chars_hash(int count, char *name, int namelen)
59 while (--namelen >= 0)
66 /* This hash calculate method must be same as the lvar hash method */
68 #define LVAR_HASH_SANDWICH (0)
69 #define LVAR_HASH_TEA (1)
70 #define LVAR_HASH_R5 (0)
71 #define LVAR_HASH_PREFIX (0)
73 static __u32 hash_build0(const char *name, int namelen)
79 if (strncmp(name, ".", 1) == 0 && namelen == 1)
81 if (strncmp(name, "..", 2) == 0 && namelen == 2)
84 if (LVAR_HASH_PREFIX) {
86 strncpy((void *)&result,
87 name, min(namelen, (int)sizeof result));
89 struct ldiskfs_dx_hash_info hinfo;
92 hinfo.hash_version = LDISKFS_DX_HASH_TEA;
94 hinfo.hash_version = LDISKFS_DX_HASH_R5;
96 ldiskfsfs_dirhash(name, namelen, &hinfo);
98 if (LVAR_HASH_SANDWICH) {
101 hinfo.hash_version = LDISKFS_DX_HASH_TEA;
103 ldiskfsfs_dirhash(name, namelen, &hinfo);
104 result2 = hinfo.hash;
105 result = (0xfc000000 & result2) | (0x03ffffff & result);
113 HASH_GRAY_AREA = 1024
116 static __u32 hash_build(const char *name, int namelen)
120 hash = (hash_build0(name, namelen) << 1) & MAX_HASH_SIZE;
121 if (hash > MAX_HASH_SIZE - HASH_GRAY_AREA)
122 hash &= HASH_GRAY_AREA - 1;
126 static int mea_hash_segment(int count, const char *name, int namelen)
130 LASSERT(IS_PO2(MAX_HASH_SIZE + 1));
132 hash = hash_build(name, namelen) / (MAX_HASH_SIZE / count);
133 LASSERTF(hash < count, "hash %x count %d \n", hash, count);
138 static int mea_hash_segment(int count, char *name, int namelen)
140 #warning "fix for liblustre"
144 int raw_name2idx(int hashtype, int count, const char *name, int namelen)
148 LASSERT(namelen > 0);
153 case MEA_MAGIC_LAST_CHAR:
154 c = mea_last_char_hash(count, (char *)name, namelen);
156 case MEA_MAGIC_ALL_CHARS:
157 c = mea_all_chars_hash(count, (char *)name, namelen);
159 case MEA_MAGIC_HASH_SEGMENT:
160 c = mea_hash_segment(count, (char *)name, namelen);
163 CERROR("Unknown hash type 0x%x\n", hashtype);
170 int mea_name2idx(struct lmv_stripe_md *mea, const char *name, int namelen)
174 LASSERT(mea && mea->mea_count);
176 c = raw_name2idx(mea->mea_magic, mea->mea_count, name, namelen);
178 LASSERT(c < mea->mea_count);