Add a helper in list.h for the non-standard way of clearing a list that is used in xskmap. This makes it easier to reuse it in the other map types, and also makes sure this usage is not forgotten in any list refactorings in the future.
Unified · Split
| @@ -106,6 +106,20 @@ static inline void __list_del(struct list_head * prev, struct list_head * next) · 105 unmodified lines | ||
| 106 | 106 | WRITE_ONCE(prev->next, next); |
| 107 | 107 | } |
| 108 | 108 | |
| 109 | +/* | |
| 110 | + * Delete a list entry and clear the 'prev' pointer. | |
| 111 | + * | |
| 112 | + * This is a special-purpose list clearing method used in the networking code | |
| 113 | + * for lists allocated as per-cpu, where we don't want to incur the extra | |
| 114 | + * WRITE_ONCE() overhead of a regular list_del_init(). The code that uses this | |
| 115 | + * needs to check the node 'prev' pointer instead of calling list_empty(). | |
| 116 | + */ | |
| 117 | +static inline void __list_del_clearprev(struct list_head *entry) | |
| 118 | +{ | |
| 119 | + __list_del(entry->prev, entry->next); | |
| 120 | + entry->prev = NULL; | |
| 121 | +} | |
| 122 | + | |
| 109 | 123 | /** |
| 110 | 124 | * list_del - deletes entry from list. |
| 111 | 125 | * @entry: the element to delete from the list. |
| @@ -145,8 +145,7 @@ void __xsk_map_flush(struct bpf_map *map) · 144 unmodified lines | ||
| 145 | 145 | |
| 146 | 146 | list_for_each_entry_safe(xs, tmp, flush_list, flush_node) { |
| 147 | 147 | xsk_flush(xs); |
| 148 | − __list_del(xs->flush_node.prev, xs->flush_node.next); | |
| 149 | − xs->flush_node.prev = NULL; | |
| 148 | + __list_del_clearprev(&xs->flush_node); | |
| 150 | 149 | } |
| 151 | 150 | } |
| 152 | 151 | |