static int debug_mle_print(struct dlm_ctxt *dlm, struct debug_buffer *db)
 {
        struct dlm_master_list_entry *mle;
-       int out = 0;
+       struct hlist_head *bucket;
+       struct hlist_node *list;
+       int i, out = 0;
        unsigned long total = 0;
 
        out += snprintf(db->buf + out, db->len - out,
                        "Dumping MLEs for Domain: %s\n", dlm->name);
 
        spin_lock(&dlm->master_lock);
-       list_for_each_entry(mle, &dlm->master_list, list) {
-               ++total;
-               if (db->len - out < 200)
-                       continue;
-               out += dump_mle(mle, db->buf + out, db->len - out);
+       for (i = 0; i < DLM_HASH_BUCKETS; i++) {
+               bucket = dlm_master_hash(dlm, i);
+               hlist_for_each(list, bucket) {
+                       mle = hlist_entry(list, struct dlm_master_list_entry,
+                                         master_hash_node);
+                       ++total;
+                       if (db->len - out < 200)
+                               continue;
+                       out += dump_mle(mle, db->buf + out, db->len - out);
+               }
        }
        spin_unlock(&dlm->master_lock);
 
        /* Lists: Dirty=Empty  Purge=InUse  PendingASTs=Empty  ... */
        out += snprintf(db->buf + out, db->len - out,
                        "Lists: Dirty=%s  Purge=%s  PendingASTs=%s  "
-                       "PendingBASTs=%s  Master=%s\n",
+                       "PendingBASTs=%s\n",
                        (list_empty(&dlm->dirty_list) ? "Empty" : "InUse"),
                        (list_empty(&dlm->purge_list) ? "Empty" : "InUse"),
                        (list_empty(&dlm->pending_asts) ? "Empty" : "InUse"),
-                       (list_empty(&dlm->pending_basts) ? "Empty" : "InUse"),
-                       (list_empty(&dlm->master_list) ? "Empty" : "InUse"));
+                       (list_empty(&dlm->pending_basts) ? "Empty" : "InUse"));
 
        /* Purge Count: xxx  Refs: xxx */
        out += snprintf(db->buf + out, db->len - out,
 
 static void dlm_deref_lockres_worker(struct dlm_work_item *item, void *data);
 
 static inline void __dlm_mle_name(struct dlm_master_list_entry *mle,
-                                 unsigned char **name, unsigned int *namelen)
+                                 unsigned char **name, unsigned int *namelen,
+                                 unsigned int *namehash)
 {
        BUG_ON(mle->type != DLM_MLE_BLOCK &&
               mle->type != DLM_MLE_MASTER &&
        if (mle->type != DLM_MLE_MASTER) {
                *name = mle->u.mlename.name;
                *namelen = mle->u.mlename.len;
+               if (namehash)
+                       *namehash = mle->u.mlename.hash;
        } else {
                *name  = (unsigned char *)mle->u.mleres->lockname.name;
                *namelen = mle->u.mleres->lockname.len;
+               if (namehash)
+                       *namehash = mle->u.mleres->lockname.hash;
        }
 }
 
        if (dlm != mle->dlm)
                return 0;
 
-       __dlm_mle_name(mle, &mlename, &mlelen);
+       __dlm_mle_name(mle, &mlename, &mlelen, NULL);
 
        if (namelen != mlelen || memcmp(name, mlename, namelen) != 0)
                return 0;
 
        mle->dlm = dlm;
        mle->type = type;
-       INIT_LIST_HEAD(&mle->list);
+       INIT_HLIST_NODE(&mle->master_hash_node);
        INIT_LIST_HEAD(&mle->hb_events);
        memset(mle->maybe_map, 0, sizeof(mle->maybe_map));
        spin_lock_init(&mle->spinlock);
                BUG_ON(!name);
                memcpy(mle->u.mlename.name, name, namelen);
                mle->u.mlename.len = namelen;
+               mle->u.mlename.hash = dlm_lockid_hash(name, namelen);
        }
 
        /* copy off the node_map and register hb callbacks on our copy */
        assert_spin_locked(&dlm->spinlock);
        assert_spin_locked(&dlm->master_lock);
 
-       if (!list_empty(&mle->list))
-               list_del_init(&mle->list);
+       if (!hlist_unhashed(&mle->master_hash_node))
+               hlist_del_init(&mle->master_hash_node);
 }
 
 void __dlm_insert_mle(struct dlm_ctxt *dlm, struct dlm_master_list_entry *mle)
 {
+       struct hlist_head *bucket;
+       unsigned char *mname;
+       unsigned int mlen, hash;
+
        assert_spin_locked(&dlm->master_lock);
 
-       list_add(&mle->list, &dlm->master_list);
+       __dlm_mle_name(mle, &mname, &mlen, &hash);
+       bucket = dlm_master_hash(dlm, hash);
+       hlist_add_head(&mle->master_hash_node, bucket);
 }
 
 /* returns 1 if found, 0 if not */
                        char *name, unsigned int namelen)
 {
        struct dlm_master_list_entry *tmpmle;
+       struct hlist_head *bucket;
+       struct hlist_node *list;
+       unsigned int hash;
 
        assert_spin_locked(&dlm->master_lock);
 
-       list_for_each_entry(tmpmle, &dlm->master_list, list) {
+       hash = dlm_lockid_hash(name, namelen);
+       bucket = dlm_master_hash(dlm, hash);
+       hlist_for_each(list, bucket) {
+               tmpmle = hlist_entry(list, struct dlm_master_list_entry,
+                                    master_hash_node);
                if (!dlm_mle_equal(dlm, tmpmle, name, namelen))
                        continue;
                dlm_get_mle(tmpmle);
 {
        struct dlm_master_list_entry *mle;
        struct dlm_ctxt *dlm;
+       unsigned char *mname;
+       unsigned int mlen;
 
        mlog_entry_void();
 
        mle = container_of(kref, struct dlm_master_list_entry, mle_refs);
        dlm = mle->dlm;
 
-       if (mle->type != DLM_MLE_MASTER) {
-               mlog(0, "calling mle_release for %.*s, type %d\n",
-                    mle->u.mlename.len, mle->u.mlename.name, mle->type);
-       } else {
-               mlog(0, "calling mle_release for %.*s, type %d\n",
-                    mle->u.mleres->lockname.len,
-                    mle->u.mleres->lockname.name, mle->type);
-       }
        assert_spin_locked(&dlm->spinlock);
        assert_spin_locked(&dlm->master_lock);
 
+       __dlm_mle_name(mle, &mname, &mlen, NULL);
+       mlog(0, "Releasing mle for %.*s, type %d\n", mlen, mname, mle->type);
+
        /* remove from list if not already */
        __dlm_unlink_mle(dlm, mle);
 
 
        BUG_ON(mle->type == DLM_MLE_MIGRATION);
 
-       __dlm_mle_name(mle, &mlename, &mlenamelen);
+       __dlm_mle_name(mle, &mlename, &mlenamelen, NULL);
 
        request.namelen = (u8)mlenamelen;
        memcpy(request.name, mlename, request.namelen);
 
 void dlm_clean_master_list(struct dlm_ctxt *dlm, u8 dead_node)
 {
-       struct dlm_master_list_entry *mle, *next;
+       struct dlm_master_list_entry *mle;
        struct dlm_lock_resource *res;
+       struct hlist_head *bucket;
+       struct hlist_node *list;
+       unsigned int i;
 
        mlog_entry("dlm=%s, dead node=%u\n", dlm->name, dead_node);
 top:
 
        /* clean the master list */
        spin_lock(&dlm->master_lock);
-       list_for_each_entry_safe(mle, next, &dlm->master_list, list) {
+       for (i = 0; i < DLM_HASH_BUCKETS; i++) {
+               bucket = dlm_master_hash(dlm, i);
+               hlist_for_each(list, bucket) {
+                       mle = hlist_entry(list, struct dlm_master_list_entry,
+                                         master_hash_node);
+
                BUG_ON(mle->type != DLM_MLE_BLOCK &&
                       mle->type != DLM_MLE_MASTER &&
                       mle->type != DLM_MLE_MIGRATION);
                /* this may be the last reference */
                __dlm_put_mle(mle);
        }
+       }
        spin_unlock(&dlm->master_lock);
 }