/*
  * given an llist of mrs, put them all into the list_head for more processing
  */
-static void llist_append_to_list(struct llist_head *llist, struct list_head *list)
+static unsigned int llist_append_to_list(struct llist_head *llist,
+                                        struct list_head *list)
 {
        struct rds_ib_mr *ibmr;
        struct llist_node *node;
        struct llist_node *next;
+       unsigned int count = 0;
 
        node = llist_del_all(llist);
        while (node) {
                ibmr = llist_entry(node, struct rds_ib_mr, llnode);
                list_add_tail(&ibmr->unmap_list, list);
                node = next;
+               count++;
        }
+       return count;
 }
 
 /*
        LIST_HEAD(unmap_list);
        LIST_HEAD(fmr_list);
        unsigned long unpinned = 0;
-       unsigned int nfreed = 0, ncleaned = 0, free_goal;
+       unsigned int nfreed = 0, dirty_to_clean = 0, free_goal;
        int ret = 0;
 
        rds_ib_stats_inc(s_ib_rdma_mr_pool_flush);
        /* Get the list of all MRs to be dropped. Ordering matters -
         * we want to put drop_list ahead of free_list.
         */
-       llist_append_to_list(&pool->drop_list, &unmap_list);
-       llist_append_to_list(&pool->free_list, &unmap_list);
+       dirty_to_clean = llist_append_to_list(&pool->drop_list, &unmap_list);
+       dirty_to_clean += llist_append_to_list(&pool->free_list, &unmap_list);
        if (free_all)
                llist_append_to_list(&pool->clean_list, &unmap_list);
 
                        kfree(ibmr);
                        nfreed++;
                }
-               ncleaned++;
        }
 
        if (!list_empty(&unmap_list)) {
        }
 
        atomic_sub(unpinned, &pool->free_pinned);
-       atomic_sub(ncleaned, &pool->dirty_count);
+       atomic_sub(dirty_to_clean, &pool->dirty_count);
        atomic_sub(nfreed, &pool->item_count);
 
 out: