static void dlm_dump_mles(struct dlm_ctxt *dlm)
 {
        struct dlm_master_list_entry *mle;
-       struct list_head *iter;
        
        mlog(ML_NOTICE, "dumping all mles for domain %s:\n", dlm->name);
        spin_lock(&dlm->master_lock);
-       list_for_each(iter, &dlm->master_list) {
-               mle = list_entry(iter, struct dlm_master_list_entry, list);
+       list_for_each_entry(mle, &dlm->master_list, list)
                dlm_print_one_mle(mle);
-       }
        spin_unlock(&dlm->master_lock);
 }
 
 int dlm_dump_all_mles(const char __user *data, unsigned int len)
 {
-       struct list_head *iter;
        struct dlm_ctxt *dlm;
 
        spin_lock(&dlm_domain_lock);
-       list_for_each(iter, &dlm_domains) {
-               dlm = list_entry (iter, struct dlm_ctxt, list);
+       list_for_each_entry(dlm, &dlm_domains, list) {
                mlog(ML_NOTICE, "found dlm: %p, name=%s\n", dlm, dlm->name);
                dlm_dump_mles(dlm);
        }
                        char *name, unsigned int namelen)
 {
        struct dlm_master_list_entry *tmpmle;
-       struct list_head *iter;
 
        assert_spin_locked(&dlm->master_lock);
 
-       list_for_each(iter, &dlm->master_list) {
-               tmpmle = list_entry(iter, struct dlm_master_list_entry, list);
+       list_for_each_entry(tmpmle, &dlm->master_list, list) {
                if (!dlm_mle_equal(dlm, tmpmle, name, namelen))
                        continue;
                dlm_get_mle(tmpmle);
 void dlm_hb_event_notify_attached(struct dlm_ctxt *dlm, int idx, int node_up)
 {
        struct dlm_master_list_entry *mle;
-       struct list_head *iter;
 
        assert_spin_locked(&dlm->spinlock);
        
-       list_for_each(iter, &dlm->mle_hb_events) {
-               mle = list_entry(iter, struct dlm_master_list_entry, 
-                                hb_events);
+       list_for_each_entry(mle, &dlm->mle_hb_events, hb_events) {
                if (node_up)
                        dlm_mle_node_up(dlm, mle, NULL, idx);
                else
        int ret;
        int i;
        int count = 0;
-       struct list_head *queue, *iter;
+       struct list_head *queue;
        struct dlm_lock *lock;
 
        assert_spin_locked(&res->spinlock);
        ret = 0;
        queue = &res->granted;
        for (i = 0; i < 3; i++) {
-               list_for_each(iter, queue) {
-                       lock = list_entry(iter, struct dlm_lock, list);
+               list_for_each_entry(lock, queue, list) {
                        ++count;
                        if (lock->ml.node == dlm->node_num) {
                                mlog(0, "found a lock owned by this node still "
 static void dlm_remove_nonlocal_locks(struct dlm_ctxt *dlm,
                                      struct dlm_lock_resource *res)
 {
-       struct list_head *iter, *iter2;
        struct list_head *queue = &res->granted;
        int i, bit;
-       struct dlm_lock *lock;
+       struct dlm_lock *lock, *next;
 
        assert_spin_locked(&res->spinlock);
 
        BUG_ON(res->owner == dlm->node_num);
 
        for (i=0; i<3; i++) {
-               list_for_each_safe(iter, iter2, queue) {
-                       lock = list_entry (iter, struct dlm_lock, list);
+               list_for_each_entry_safe(lock, next, queue, list) {
                        if (lock->ml.node != dlm->node_num) {
                                mlog(0, "putting lock for node %u\n",
                                     lock->ml.node);
 {
        int i;
        struct list_head *queue = &res->granted;
-       struct list_head *iter;
        struct dlm_lock *lock;
        int nodenum;
 
 
        spin_lock(&res->spinlock);
        for (i=0; i<3; i++) {
-               list_for_each(iter, queue) {
+               list_for_each_entry(lock, queue, list) {
                        /* up to the caller to make sure this node
                         * is alive */
-                       lock = list_entry (iter, struct dlm_lock, list);
                        if (lock->ml.node != dlm->node_num) {
                                spin_unlock(&res->spinlock);
                                return lock->ml.node;
 
 void dlm_clean_master_list(struct dlm_ctxt *dlm, u8 dead_node)
 {
-       struct list_head *iter, *iter2;
-       struct dlm_master_list_entry *mle;
+       struct dlm_master_list_entry *mle, *next;
        struct dlm_lock_resource *res;
        unsigned int hash;
 
 
        /* clean the master list */
        spin_lock(&dlm->master_lock);
-       list_for_each_safe(iter, iter2, &dlm->master_list) {
-               mle = list_entry(iter, struct dlm_master_list_entry, list);
-
+       list_for_each_entry_safe(mle, next, &dlm->master_list, list) {
                BUG_ON(mle->type != DLM_MLE_BLOCK &&
                       mle->type != DLM_MLE_MASTER &&
                       mle->type != DLM_MLE_MIGRATION);
 
        struct dlm_ctxt *dlm =
                container_of(work, struct dlm_ctxt, dispatched_work);
        LIST_HEAD(tmp_list);
-       struct list_head *iter, *iter2;
-       struct dlm_work_item *item;
+       struct dlm_work_item *item, *next;
        dlm_workfunc_t *workfunc;
        int tot=0;
 
        list_splice_init(&dlm->work_list, &tmp_list);
        spin_unlock(&dlm->work_lock);
 
-       list_for_each_safe(iter, iter2, &tmp_list) {
+       list_for_each_entry(item, &tmp_list, list) {
                tot++;
        }
        mlog(0, "%s: work thread has %d work items\n", dlm->name, tot);
 
-       list_for_each_safe(iter, iter2, &tmp_list) {
-               item = list_entry(iter, struct dlm_work_item, list);
+       list_for_each_entry_safe(item, next, &tmp_list, list) {
                workfunc = item->func;
                list_del_init(&item->list);
 
 {
        int status = 0;
        struct dlm_reco_node_data *ndata;
-       struct list_head *iter;
        int all_nodes_done;
        int destroy = 0;
        int pass = 0;
 
        /* safe to access the node data list without a lock, since this
         * process is the only one to change the list */
-       list_for_each(iter, &dlm->reco.node_data) {
-               ndata = list_entry (iter, struct dlm_reco_node_data, list);
+       list_for_each_entry(ndata, &dlm->reco.node_data, list) {
                BUG_ON(ndata->state != DLM_RECO_NODE_DATA_INIT);
                ndata->state = DLM_RECO_NODE_DATA_REQUESTING;
 
                 * done, or if anyone died */
                all_nodes_done = 1;
                spin_lock(&dlm_reco_state_lock);
-               list_for_each(iter, &dlm->reco.node_data) {
-                       ndata = list_entry (iter, struct dlm_reco_node_data, list);
-
+               list_for_each_entry(ndata, &dlm->reco.node_data, list) {
                        mlog(0, "checking recovery state of node %u\n",
                             ndata->node_num);
                        switch (ndata->state) {
 
 static void dlm_destroy_recovery_area(struct dlm_ctxt *dlm, u8 dead_node)
 {
-       struct list_head *iter, *iter2;
-       struct dlm_reco_node_data *ndata;
+       struct dlm_reco_node_data *ndata, *next;
        LIST_HEAD(tmplist);
 
        spin_lock(&dlm_reco_state_lock);
        list_splice_init(&dlm->reco.node_data, &tmplist);
        spin_unlock(&dlm_reco_state_lock);
 
-       list_for_each_safe(iter, iter2, &tmplist) {
-               ndata = list_entry (iter, struct dlm_reco_node_data, list);
+       list_for_each_entry_safe(ndata, next, &tmplist, list) {
                list_del_init(&ndata->list);
                kfree(ndata);
        }
        struct dlm_lock_resource *res;
        struct dlm_ctxt *dlm;
        LIST_HEAD(resources);
-       struct list_head *iter;
        int ret;
        u8 dead_node, reco_master;
        int skip_all_done = 0;
 
        /* any errors returned will be due to the new_master dying,
         * the dlm_reco_thread should detect this */
-       list_for_each(iter, &resources) {
-               res = list_entry (iter, struct dlm_lock_resource, recovering);
+       list_for_each_entry(res, &resources, recovering) {
                ret = dlm_send_one_lockres(dlm, res, mres, reco_master,
                                        DLM_MRES_RECOVERY);
                if (ret < 0) {
 {
        struct dlm_ctxt *dlm = data;
        struct dlm_reco_data_done *done = (struct dlm_reco_data_done *)msg->buf;
-       struct list_head *iter;
        struct dlm_reco_node_data *ndata = NULL;
        int ret = -EINVAL;
 
                        dlm->reco.dead_node, done->node_idx, dlm->node_num);
 
        spin_lock(&dlm_reco_state_lock);
-       list_for_each(iter, &dlm->reco.node_data) {
-               ndata = list_entry (iter, struct dlm_reco_node_data, list);
+       list_for_each_entry(ndata, &dlm->reco.node_data, list) {
                if (ndata->node_num != done->node_idx)
                        continue;
 
                                        struct list_head *list,
                                        u8 dead_node)
 {
-       struct dlm_lock_resource *res;
-       struct list_head *iter, *iter2;
+       struct dlm_lock_resource *res, *next;
        struct dlm_lock *lock;
 
        spin_lock(&dlm->spinlock);
-       list_for_each_safe(iter, iter2, &dlm->reco.resources) {
-               res = list_entry (iter, struct dlm_lock_resource, recovering);
+       list_for_each_entry_safe(res, next, &dlm->reco.resources, recovering) {
                /* always prune any $RECOVERY entries for dead nodes,
                 * otherwise hangs can occur during later recovery */
                if (dlm_is_recovery_lock(res->lockname.name,
                         struct dlm_migratable_lockres *mres,
                         u8 send_to, u8 flags)
 {
-       struct list_head *queue, *iter;
+       struct list_head *queue;
        int total_locks, i;
        u64 mig_cookie = 0;
        struct dlm_lock *lock;
        total_locks = 0;
        for (i=DLM_GRANTED_LIST; i<=DLM_BLOCKED_LIST; i++) {
                queue = dlm_list_idx_to_ptr(res, i);
-               list_for_each(iter, queue) {
-                       lock = list_entry (iter, struct dlm_lock, list);
-
+               list_for_each_entry(lock, queue, list) {
                        /* add another lock. */
                        total_locks++;
                        if (!dlm_add_lock_to_array(lock, mres, i))
        struct dlm_lockstatus *lksb = NULL;
        int ret = 0;
        int i, j, bad;
-       struct list_head *iter;
        struct dlm_lock *lock = NULL;
        u8 from = O2NM_MAX_NODES;
        unsigned int added = 0;
                        spin_lock(&res->spinlock);
                        for (j = DLM_GRANTED_LIST; j <= DLM_BLOCKED_LIST; j++) {
                                tmpq = dlm_list_idx_to_ptr(res, j);
-                               list_for_each(iter, tmpq) {
-                                       lock = list_entry (iter, struct dlm_lock, list);
+                               list_for_each_entry(lock, tmpq, list) {
                                        if (lock->ml.cookie != ml->cookie)
                                                lock = NULL;
                                        else
                                       struct dlm_lock_resource *res)
 {
        int i;
-       struct list_head *queue, *iter, *iter2;
-       struct dlm_lock *lock;
+       struct list_head *queue;
+       struct dlm_lock *lock, *next;
 
        res->state |= DLM_LOCK_RES_RECOVERING;
        if (!list_empty(&res->recovering)) {
        /* find any pending locks and put them back on proper list */
        for (i=DLM_BLOCKED_LIST; i>=DLM_GRANTED_LIST; i--) {
                queue = dlm_list_idx_to_ptr(res, i);
-               list_for_each_safe(iter, iter2, queue) {
-                       lock = list_entry (iter, struct dlm_lock, list);
+               list_for_each_entry_safe(lock, next, queue, list) {
                        dlm_lock_get(lock);
                        if (lock->convert_pending) {
                                /* move converting lock back to granted */
                                              u8 dead_node, u8 new_master)
 {
        int i;
-       struct list_head *iter, *iter2;
        struct hlist_node *hash_iter;
        struct hlist_head *bucket;
-
-       struct dlm_lock_resource *res;
+       struct dlm_lock_resource *res, *next;
 
        mlog_entry_void();
 
        assert_spin_locked(&dlm->spinlock);
 
-       list_for_each_safe(iter, iter2, &dlm->reco.resources) {
-               res = list_entry (iter, struct dlm_lock_resource, recovering);
+       list_for_each_entry_safe(res, next, &dlm->reco.resources, recovering) {
                if (res->owner == dead_node) {
                        list_del_init(&res->recovering);
                        spin_lock(&res->spinlock);
 static void dlm_revalidate_lvb(struct dlm_ctxt *dlm,
                               struct dlm_lock_resource *res, u8 dead_node)
 {
-       struct list_head *iter, *queue;
+       struct list_head *queue;
        struct dlm_lock *lock;
        int blank_lvb = 0, local = 0;
        int i;
 
        for (i=DLM_GRANTED_LIST; i<=DLM_CONVERTING_LIST; i++) {
                queue = dlm_list_idx_to_ptr(res, i);
-               list_for_each(iter, queue) {
-                       lock = list_entry (iter, struct dlm_lock, list);
+               list_for_each_entry(lock, queue, list) {
                        if (lock->ml.node == search_node) {
                                if (dlm_lvb_needs_invalidation(lock, local)) {
                                        /* zero the lksb lvb and lockres lvb */
 static void dlm_free_dead_locks(struct dlm_ctxt *dlm,
                                struct dlm_lock_resource *res, u8 dead_node)
 {
-       struct list_head *iter, *tmpiter;
-       struct dlm_lock *lock;
+       struct dlm_lock *lock, *next;
        unsigned int freed = 0;
 
        /* this node is the lockres master:
        assert_spin_locked(&res->spinlock);
 
        /* TODO: check pending_asts, pending_basts here */
-       list_for_each_safe(iter, tmpiter, &res->granted) {
-               lock = list_entry (iter, struct dlm_lock, list);
+       list_for_each_entry_safe(lock, next, &res->granted, list) {
                if (lock->ml.node == dead_node) {
                        list_del_init(&lock->list);
                        dlm_lock_put(lock);
                        freed++;
                }
        }
-       list_for_each_safe(iter, tmpiter, &res->converting) {
-               lock = list_entry (iter, struct dlm_lock, list);
+       list_for_each_entry_safe(lock, next, &res->converting, list) {
                if (lock->ml.node == dead_node) {
                        list_del_init(&lock->list);
                        dlm_lock_put(lock);
                        freed++;
                }
        }
-       list_for_each_safe(iter, tmpiter, &res->blocked) {
-               lock = list_entry (iter, struct dlm_lock, list);
+       list_for_each_entry_safe(lock, next, &res->blocked, list) {
                if (lock->ml.node == dead_node) {
                        list_del_init(&lock->list);
                        dlm_lock_put(lock);