From: Kaitao Cheng <[email protected]>

When draining a BPF list_head, clear each node's owner pointer while still
holding the spinlock, so concurrent readers always see a consistent owner.

Delink each node with list_del_init() before calling __bpf_obj_drop_impl(),
preventing subsequent users who hold a reference count to the node from
acquiring an invalid next node.

Signed-off-by: Kaitao Cheng <[email protected]>
---
 kernel/bpf/helpers.c | 22 +++++++++++++---------
 1 file changed, 13 insertions(+), 9 deletions(-)

diff --git a/kernel/bpf/helpers.c b/kernel/bpf/helpers.c
index 9cd7b028592c..1e8754877dd1 100644
--- a/kernel/bpf/helpers.c
+++ b/kernel/bpf/helpers.c
@@ -2247,10 +2247,11 @@ EXPORT_SYMBOL_GPL(bpf_base_func_proto);
 void bpf_list_head_free(const struct btf_field *field, void *list_head,
                        struct bpf_spin_lock *spin_lock)
 {
-       struct list_head *head = list_head, *orig_head = list_head;
+       struct list_head *head = list_head, drain, *pos, *n;
 
        BUILD_BUG_ON(sizeof(struct list_head) > sizeof(struct bpf_list_head));
        BUILD_BUG_ON(__alignof__(struct list_head) > __alignof__(struct 
bpf_list_head));
+       INIT_LIST_HEAD(&drain);
 
        /* Do the actual list draining outside the lock to not hold the lock for
         * too long, and also prevent deadlocks if tracing programs end up
@@ -2261,20 +2262,23 @@ void bpf_list_head_free(const struct btf_field *field, 
void *list_head,
        __bpf_spin_lock_irqsave(spin_lock);
        if (!head->next || list_empty(head))
                goto unlock;
-       head = head->next;
+       list_for_each_safe(pos, n, head) {
+               WRITE_ONCE(container_of(pos,
+                       struct bpf_list_node_kern, list_head)->owner, NULL);
+               list_move_tail(pos, &drain);
+       }
 unlock:
-       INIT_LIST_HEAD(orig_head);
+       INIT_LIST_HEAD(head);
        __bpf_spin_unlock_irqrestore(spin_lock);
 
-       while (head != orig_head) {
-               void *obj = head;
-
-               obj -= field->graph_root.node_offset;
-               head = head->next;
+       while (!list_empty(&drain)) {
+               pos = drain.next;
+               list_del_init(pos);
                /* The contained type can also have resources, including a
                 * bpf_list_head which needs to be freed.
                 */
-               __bpf_obj_drop_impl(obj, field->graph_root.value_rec, false);
+               __bpf_obj_drop_impl((char *)pos - field->graph_root.node_offset,
+                                   field->graph_root.value_rec, false);
        }
 }
 
-- 
2.50.1 (Apple Git-155)


Reply via email to