CVE Database
/

CVE-2022-48760

Back to search

CVE-2022-48760

Published: Jun 20, 2024

Modified: May 11, 2026

PUBLISHED

Description

In the Linux kernel, the following vulnerability has been resolved: USB: core: Fix hang in usb_kill_urb by adding memory barriers The syzbot fuzzer has identified a bug in which processes hang waiting for usb_kill_urb() to return. It turns out the issue is not unlinking the URB; that works just fine. Rather, the problem arises when the wakeup notification that the URB has completed is not received. The reason is memory-access ordering on SMP systems. In outline form, usb_kill_urb() and __usb_hcd_giveback_urb() operating concurrently on different CPUs perform the following actions: CPU 0 CPU 1 ---------------------------- --------------------------------- usb_kill_urb(): __usb_hcd_giveback_urb(): ... ... atomic_inc(&urb->reject); atomic_dec(&urb->use_count); ... ... wait_event(usb_kill_urb_queue, atomic_read(&urb->use_count) == 0); if (atomic_read(&urb->reject)) wake_up(&usb_kill_urb_queue); Confining your attention to urb->reject and urb->use_count, you can see that the overall pattern of accesses on CPU 0 is: write urb->reject, then read urb->use_count; whereas the overall pattern of accesses on CPU 1 is: write urb->use_count, then read urb->reject. This pattern is referred to in memory-model circles as SB (for "Store Buffering"), and it is well known that without suitable enforcement of the desired order of accesses -- in the form of memory barriers -- it is entirely possible for one or both CPUs to execute their reads ahead of their writes. The end result will be that sometimes CPU 0 sees the old un-decremented value of urb->use_count while CPU 1 sees the old un-incremented value of urb->reject. Consequently CPU 0 ends up on the wait queue and never gets woken up, leading to the observed hang in usb_kill_urb(). The same pattern of accesses occurs in usb_poison_urb() and the failure pathway of usb_hcd_submit_urb(). The problem is fixed by adding suitable memory barriers. To provide proper memory-access ordering in the SB pattern, a full barrier is required on both CPUs. The atomic_inc() and atomic_dec() accesses themselves don't provide any memory ordering, but since they are present, we can use the optimized smp_mb__after_atomic() memory barrier in the various routines to obtain the desired effect. This patch adds the necessary memory barriers.

VendorProductVersions

Linux

Linux

affected
49367d8f1d9f26482cf7089489e90f0afd0a942c - < 5f138ef224dffd15d5e5c5b095859719e0038427
affected
49367d8f1d9f26482cf7089489e90f0afd0a942c - < b50f5ca60475710bbc9a3af32fbfc17b1e69c2f0
affected
49367d8f1d9f26482cf7089489e90f0afd0a942c - < 546ba238535d925254e0b3f12012a5c55801e2f3
affected
49367d8f1d9f26482cf7089489e90f0afd0a942c - < 5904dfd3ddaff3bf4a41c3baf0a8e8f31ed4599b
affected
49367d8f1d9f26482cf7089489e90f0afd0a942c - < 9c61fce322ac2ef7fecf025285353570d60e41d6

+4 more versions

Linux

Linux

affected
2.6.29
unaffected
0 - < 2.6.29
unaffected
4.4.302 - <= 4.4.*
unaffected
4.9.300 - <= 4.9.*
unaffected
4.14.265 - <= 4.14.*

+6 more versions

Security Training

Train your team to recognize and prevent security threats with our comprehensive security awareness program.

Start Training

Vulnerability Scanning

Discover vulnerabilities in your applications and infrastructure before attackers do.

Scan Now