]> git.ipfire.org Git - thirdparty/kernel/stable.git/commitdiff
staging: rtl8723bs: fix out-of-bounds read in rtw_get_ie() parser
authorNavaneeth K <knavaneeth786@gmail.com>
Mon, 30 Mar 2026 03:12:31 +0000 (11:12 +0800)
committerGreg Kroah-Hartman <gregkh@linuxfoundation.org>
Sat, 18 Apr 2026 08:33:35 +0000 (10:33 +0200)
[ Upstream commit 154828bf9559b9c8421fc2f0d7f7f76b3683aaed ]

The Information Element (IE) parser rtw_get_ie() trusted the length
byte of each IE without validating that the IE body (len bytes after
the 2-byte header) fits inside the remaining frame buffer. A malformed
frame can advertise an IE length larger than the available data, causing
the parser to increment its pointer beyond the buffer end. This results
in out-of-bounds reads or, depending on the pattern, an infinite loop.

Fix by validating that (offset + 2 + len) does not exceed the limit
before accepting the IE or advancing to the next element.

This prevents OOB reads and ensures the parser terminates safely on
malformed frames.

[ The context change is due to the commit 4610e57a7d2e
("staging: rtl8723bs: Remove redundant else branches.") in v5.19
which is irrelevant to the logic of this patch. ]

Signed-off-by: Navaneeth K <knavaneeth786@gmail.com>
Cc: stable <stable@kernel.org>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Signed-off-by: Johnny Hao <johnny_haocn@sina.com>
Signed-off-by: Sasha Levin <sashal@kernel.org>
drivers/staging/rtl8723bs/core/rtw_ieee80211.c

index c01f7da9d025c041e6644528c290444e99dc0651..666ce2f9c5270f2cd6aa16e27990e9df5528b3d0 100644 (file)
@@ -141,23 +141,24 @@ u8 *rtw_get_ie(u8 *pbuf, signed int index, signed int *len, signed int limit)
        signed int tmp, i;
        u8 *p;
 
-       if (limit < 1)
+       if (limit < 2)
                return NULL;
 
        p = pbuf;
        i = 0;
        *len = 0;
-       while (1) {
+       while (i + 2 <= limit) {
+               tmp = *(p + 1);
+               if (i + 2 + tmp > limit)
+                       break;
+
                if (*p == index) {
-                       *len = *(p + 1);
+                       *len = tmp;
                        return p;
                } else {
-                       tmp = *(p + 1);
                        p += (tmp + 2);
                        i += (tmp + 2);
                }
-               if (i >= limit)
-                       break;
        }
        return NULL;
 }