PT-2026-152556
CVE-2026-99676
·
تاريخ النشر
2026-11-20
·
تاريخ التحديث
2026-11-20
الوصف من
الدرجة
N/A
غير متوفرلا تتوفر حاليًا تقييمات أو مقاييس للخطورة. سنحدّث المعلومات المقابلة في الصفحة فور توفرها.
In the Linux kernel, the following vulnerability has been resolved:
net: restore refcount ordering for lockless socket access
Before commit fb041bb7c0a9 ("locking/refcount: Consolidate implementations
of refcount t"), default builds implemented refcount inc not zero() using
atomic add unless(), which provided full memory ordering on success. The
commit removed that ordering on weakly ordered architectures, allowing
accesses after a successful reference acquisition to be reordered before
it.
Use refcount inc not zero acquire() in the IPv4 and IPv6 established
lookups and in inet twsk purge(), where the socket is validated again
after taking a reference.
bpf sk assign() can receive a socket pointer obtained through BTF
without a reference. Use acquire ordering when it takes its own reference
for a refcounted socket.
Use refcount set release() when setting refcounts in the SYN cookie,
TCP Fast Open, request migration, and TIME WAIT paths. Keep the existing
TIME WAIT smp wmb(), which separately orders the refcount store before
ehash publication.
وجدت خطأً في الوصف؟ لديك ما تضيفه؟ لا تتردد في مراسلتنا 👾