b=16098

[fs/lustre-release.git] / lustre / include / class_hash.h

diff --git a/lustre/include/class_hash.h b/lustre/include/class_hash.h
index 5e8a368..5eabcb8 100644 (file)
--- a/lustre/include/class_hash.h
+++ b/lustre/include/class_hash.h
@@ -1,5 +1,37 @@
 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
  * vim:expandtab:shiftwidth=8:tabstop=8:
+ *
+ * GPL HEADER START
+ *
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License version 2 only,
+ * as published by the Free Software Foundation.
+ *
+ * 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 version 2 for more details (a copy is included
+ * in the LICENSE file that accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License
+ * version 2 along with this program; If not, see
+ * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
+ *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ *
+ * GPL HEADER END
+ */
+/*
+ * Copyright  2008 Sun Microsystems, Inc. All rights reserved
+ * Use is subject to license terms.
+ */
+/*
+ * This file is part of Lustre, http://www.lustre.org/
+ * Lustre is a trademark of Sun Microsystems, Inc.
  */
 
 #ifndef __CLASS_HASH_H
@@ -7,6 +39,8 @@
 
 #include <lustre_lib.h>
 
+/* #define LUSTRE_HASH_DEBUG 1 */
+
 /* define the hash bucket*/
 struct lustre_hash_bucket { 
         struct hlist_head lhb_head;
@@ -16,7 +50,7 @@ struct lustre_hash_bucket {
          * it will help us to analyse the hash distribute 
          */
         int lhb_item_count; 
-#endif      
+#endif
 };
 
 struct lustre_hash_operations;
@@ -81,21 +115,34 @@ lustre_hash_delitem_nolock(struct lustre_class_hash_body *hash_body,
         RETURN(0);
 }
 
+typedef void (*hash_item_iterate_cb) (void *obj, void *data);
+
 int lustre_hash_init(struct lustre_class_hash_body **hash_body,
                      char *hashname, __u32 hashsize, 
                      struct lustre_hash_operations *hash_operations);
 void lustre_hash_exit(struct lustre_class_hash_body **hash_body);
 int lustre_hash_additem_unique(struct lustre_class_hash_body *hash_body, 
                                void *key, struct hlist_node *actual_hnode);
+void *lustre_hash_findadd_unique(struct lustre_class_hash_body *hash_body,
+                                 void *key, struct hlist_node *actual_hnode);
 int lustre_hash_additem(struct lustre_class_hash_body *hash_body, void *key, 
                         struct hlist_node *actual_hnode);
 int lustre_hash_delitem_by_key(struct lustre_class_hash_body *hash_body, 
                                void *key);
 int lustre_hash_delitem(struct lustre_class_hash_body *hash_body, void *key, 
                         struct hlist_node *hash_item);
+void lustre_hash_bucket_iterate(struct lustre_class_hash_body *hash_body,
+                                void *key, hash_item_iterate_cb,
+                                void *data);
+void lustre_hash_iterate_all(struct lustre_class_hash_body *hash_body,
+                             hash_item_iterate_cb, void *data);
+
 void * lustre_hash_get_object_by_key(struct lustre_class_hash_body *hash_body,
                                       void *key);
 
+__u32 djb2_hashfn(struct lustre_class_hash_body *hash_body, void* key,
+                  size_t size);
+
 /* ( uuid <-> export ) hash operations define */
 __u32 uuid_hashfn(struct lustre_class_hash_body *hash_body,  void * key);
 int uuid_hash_key_compare(void *key, struct hlist_node * compared_hnode);
@@ -114,4 +161,10 @@ int conn_hash_key_compare(void *key, struct hlist_node * compared_hnode);
 void * conn_refcount_get(struct hlist_node * actual_hnode);
 void conn_refcount_put(struct hlist_node * actual_hnode);
 
+/* ( nid <-> nidstats ) hash operations define. uses nid_hashfn */
+int nidstats_hash_key_compare(void *key, struct hlist_node * compared_hnode);
+void* nidstats_refcount_get(struct hlist_node * actual_hnode);
+void nidstats_refcount_put(struct hlist_node * actual_hnode);
+extern struct lustre_hash_operations nid_stat_hash_operations;
+
 #endif /* __CLASS_HASH_H */