if (likely(!xdp_buff_has_frags(xdp)))
                goto out;
 
-       list_for_each_entry_safe(pos, tmp, xskb_list, free_list_node) {
-               list_del(&pos->free_list_node);
+       list_for_each_entry_safe(pos, tmp, xskb_list, list_node) {
+               list_del(&pos->list_node);
                xp_free(pos);
        }
 
 {
        struct xdp_buff_xsk *frag = container_of(xdp, struct xdp_buff_xsk, xdp);
 
-       list_add_tail(&frag->free_list_node, &frag->pool->xskb_list);
+       list_add_tail(&frag->list_node, &frag->pool->xskb_list);
 }
 
 static inline struct xdp_buff *xsk_buff_get_frag(struct xdp_buff *first)
        struct xdp_buff_xsk *frag;
 
        frag = list_first_entry_or_null(&xskb->pool->xskb_list,
-                                       struct xdp_buff_xsk, free_list_node);
+                                       struct xdp_buff_xsk, list_node);
        if (frag) {
-               list_del(&frag->free_list_node);
+               list_del(&frag->list_node);
                ret = &frag->xdp;
        }
 
 {
        struct xdp_buff_xsk *xskb = container_of(tail, struct xdp_buff_xsk, xdp);
 
-       list_del(&xskb->free_list_node);
+       list_del(&xskb->list_node);
 }
 
 static inline struct xdp_buff *xsk_buff_get_tail(struct xdp_buff *first)
        struct xdp_buff_xsk *frag;
 
        frag = list_last_entry(&xskb->pool->xskb_list, struct xdp_buff_xsk,
-                              free_list_node);
+                              list_node);
        return &frag->xdp;
 }
 
 
        dma_addr_t frame_dma;
        struct xsk_buff_pool *pool;
        u64 orig_addr;
-       struct list_head free_list_node;
+       struct list_head list_node;
 };
 
 #define XSK_CHECK_PRIV_TYPE(t) BUILD_BUG_ON(sizeof(t) > offsetofend(struct xdp_buff_xsk, cb))
 
                return 0;
 
        xskb_list = &xskb->pool->xskb_list;
-       list_for_each_entry_safe(pos, tmp, xskb_list, free_list_node) {
+       list_for_each_entry_safe(pos, tmp, xskb_list, list_node) {
                if (list_is_singular(xskb_list))
                        contd = 0;
                len = pos->xdp.data_end - pos->xdp.data;
                err = __xsk_rcv_zc(xs, pos, len, contd);
                if (err)
                        goto err;
-               list_del(&pos->free_list_node);
+               list_del(&pos->list_node);
        }
 
        return 0;
 
                xskb = &pool->heads[i];
                xskb->pool = pool;
                xskb->xdp.frame_sz = umem->chunk_size - umem->headroom;
-               INIT_LIST_HEAD(&xskb->free_list_node);
+               INIT_LIST_HEAD(&xskb->list_node);
                if (pool->unaligned)
                        pool->free_heads[i] = xskb;
                else
        } else {
                pool->free_list_cnt--;
                xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk,
-                                       free_list_node);
-               list_del_init(&xskb->free_list_node);
+                                       list_node);
+               list_del_init(&xskb->list_node);
        }
 
        xskb->xdp.data = xskb->xdp.data_hard_start + XDP_PACKET_HEADROOM;
 
        i = nb_entries;
        while (i--) {
-               xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk, free_list_node);
-               list_del_init(&xskb->free_list_node);
+               xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk, list_node);
+               list_del_init(&xskb->list_node);
 
                *xdp = &xskb->xdp;
                xdp++;
 
 void xp_free(struct xdp_buff_xsk *xskb)
 {
-       if (!list_empty(&xskb->free_list_node))
+       if (!list_empty(&xskb->list_node))
                return;
 
        xskb->pool->free_list_cnt++;
-       list_add(&xskb->free_list_node, &xskb->pool->free_list);
+       list_add(&xskb->list_node, &xskb->pool->free_list);
 }
 EXPORT_SYMBOL(xp_free);