License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 14:07:57 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2009-02-10 20:25:55 +00:00
|
|
|
/*
|
|
|
|
* cfg80211 scan result handling
|
|
|
|
*
|
|
|
|
* Copyright 2008 Johannes Berg <johannes@sipsolutions.net>
|
2014-09-03 12:24:58 +00:00
|
|
|
* Copyright 2013-2014 Intel Mobile Communications GmbH
|
2016-07-05 14:10:13 +00:00
|
|
|
* Copyright 2016 Intel Deutschland GmbH
|
2022-04-14 14:50:57 +00:00
|
|
|
* Copyright (C) 2018-2022 Intel Corporation
|
2009-02-10 20:25:55 +00:00
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2009-02-10 20:25:55 +00:00
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/netdevice.h>
|
|
|
|
#include <linux/wireless.h>
|
|
|
|
#include <linux/nl80211.h>
|
|
|
|
#include <linux/etherdevice.h>
|
2020-09-18 09:33:13 +00:00
|
|
|
#include <linux/crc32.h>
|
|
|
|
#include <linux/bitfield.h>
|
2009-02-10 20:25:55 +00:00
|
|
|
#include <net/arp.h>
|
|
|
|
#include <net/cfg80211.h>
|
2011-07-13 08:39:09 +00:00
|
|
|
#include <net/cfg80211-wext.h>
|
2009-02-10 20:25:55 +00:00
|
|
|
#include <net/iw_handler.h>
|
|
|
|
#include "core.h"
|
|
|
|
#include "nl80211.h"
|
2009-07-27 10:01:53 +00:00
|
|
|
#include "wext-compat.h"
|
2012-06-27 14:19:42 +00:00
|
|
|
#include "rdev-ops.h"
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
/**
|
|
|
|
* DOC: BSS tree/list structure
|
|
|
|
*
|
|
|
|
* At the top level, the BSS list is kept in both a list in each
|
|
|
|
* registered device (@bss_list) as well as an RB-tree for faster
|
|
|
|
* lookup. In the RB-tree, entries can be looked up using their
|
|
|
|
* channel, MESHID, MESHCONF (for MBSSes) or channel, BSSID, SSID
|
|
|
|
* for other BSSes.
|
|
|
|
*
|
|
|
|
* Due to the possibility of hidden SSIDs, there's a second level
|
|
|
|
* structure, the "hidden_list" and "hidden_beacon_bss" pointer.
|
|
|
|
* The hidden_list connects all BSSes belonging to a single AP
|
|
|
|
* that has a hidden SSID, and connects beacon and probe response
|
|
|
|
* entries. For a probe response entry for a hidden SSID, the
|
|
|
|
* hidden_beacon_bss pointer points to the BSS struct holding the
|
|
|
|
* beacon's information.
|
|
|
|
*
|
|
|
|
* Reference counting is done for all these references except for
|
|
|
|
* the hidden_list, so that a beacon BSS struct that is otherwise
|
|
|
|
* not referenced has one reference for being on the bss_list and
|
|
|
|
* one for each probe response entry that points to it using the
|
|
|
|
* hidden_beacon_bss pointer. When a BSS struct that has such a
|
|
|
|
* pointer is get/put, the refcount update is also propagated to
|
|
|
|
* the referenced struct, this ensure that it cannot get removed
|
|
|
|
* while somebody is using the probe response version.
|
|
|
|
*
|
|
|
|
* Note that the hidden_beacon_bss pointer never changes, due to
|
|
|
|
* the reference counting. Therefore, no locking is needed for
|
|
|
|
* it.
|
|
|
|
*
|
|
|
|
* Also note that the hidden_beacon_bss pointer is only relevant
|
|
|
|
* if the driver uses something other than the IEs, e.g. private
|
2020-08-22 23:19:51 +00:00
|
|
|
* data stored in the BSS struct, since the beacon IEs are
|
2013-02-01 01:06:18 +00:00
|
|
|
* also linked into the probe response struct.
|
|
|
|
*/
|
|
|
|
|
2016-11-15 11:05:11 +00:00
|
|
|
/*
|
|
|
|
* Limit the number of BSS entries stored in mac80211. Each one is
|
|
|
|
* a bit over 4k at most, so this limits to roughly 4-5M of memory.
|
|
|
|
* If somebody wants to really attack this though, they'd likely
|
|
|
|
* use small beacons, and only one type of frame, limiting each of
|
|
|
|
* the entries to a much smaller size (in order to generate more
|
|
|
|
* entries in total, so overhead is bigger.)
|
|
|
|
*/
|
|
|
|
static int bss_entries_limit = 1000;
|
|
|
|
module_param(bss_entries_limit, int, 0644);
|
|
|
|
MODULE_PARM_DESC(bss_entries_limit,
|
|
|
|
"limit to number of scan BSS entries (per wiphy, default 1000)");
|
|
|
|
|
2012-04-13 11:08:40 +00:00
|
|
|
#define IEEE80211_SCAN_RESULT_EXPIRE (30 * HZ)
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2020-09-18 09:33:13 +00:00
|
|
|
/**
|
|
|
|
* struct cfg80211_colocated_ap - colocated AP information
|
|
|
|
*
|
|
|
|
* @list: linked list to all colocated aPS
|
|
|
|
* @bssid: BSSID of the reported AP
|
|
|
|
* @ssid: SSID of the reported AP
|
|
|
|
* @ssid_len: length of the ssid
|
|
|
|
* @center_freq: frequency the reported AP is on
|
|
|
|
* @unsolicited_probe: the reported AP is part of an ESS, where all the APs
|
|
|
|
* that operate in the same channel as the reported AP and that might be
|
|
|
|
* detected by a STA receiving this frame, are transmitting unsolicited
|
|
|
|
* Probe Response frames every 20 TUs
|
|
|
|
* @oct_recommended: OCT is recommended to exchange MMPDUs with the reported AP
|
|
|
|
* @same_ssid: the reported AP has the same SSID as the reporting AP
|
|
|
|
* @multi_bss: the reported AP is part of a multiple BSSID set
|
|
|
|
* @transmitted_bssid: the reported AP is the transmitting BSSID
|
|
|
|
* @colocated_ess: all the APs that share the same ESS as the reported AP are
|
|
|
|
* colocated and can be discovered via legacy bands.
|
|
|
|
* @short_ssid_valid: short_ssid is valid and can be used
|
|
|
|
* @short_ssid: the short SSID for this SSID
|
|
|
|
*/
|
|
|
|
struct cfg80211_colocated_ap {
|
|
|
|
struct list_head list;
|
|
|
|
u8 bssid[ETH_ALEN];
|
|
|
|
u8 ssid[IEEE80211_MAX_SSID_LEN];
|
|
|
|
size_t ssid_len;
|
|
|
|
u32 short_ssid;
|
|
|
|
u32 center_freq;
|
|
|
|
u8 unsolicited_probe:1,
|
|
|
|
oct_recommended:1,
|
|
|
|
same_ssid:1,
|
|
|
|
multi_bss:1,
|
|
|
|
transmitted_bssid:1,
|
|
|
|
colocated_ess:1,
|
|
|
|
short_ssid_valid:1;
|
|
|
|
};
|
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
static void bss_free(struct cfg80211_internal_bss *bss)
|
2012-10-12 04:03:33 +00:00
|
|
|
{
|
2012-11-29 00:25:20 +00:00
|
|
|
struct cfg80211_bss_ies *ies;
|
2012-11-28 21:14:56 +00:00
|
|
|
|
|
|
|
if (WARN_ON(atomic_read(&bss->hold)))
|
|
|
|
return;
|
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
ies = (void *)rcu_access_pointer(bss->pub.beacon_ies);
|
2013-02-01 01:06:18 +00:00
|
|
|
if (ies && !bss->pub.hidden_beacon_bss)
|
2012-11-29 00:25:20 +00:00
|
|
|
kfree_rcu(ies, rcu_head);
|
|
|
|
ies = (void *)rcu_access_pointer(bss->pub.proberesp_ies);
|
|
|
|
if (ies)
|
|
|
|
kfree_rcu(ies, rcu_head);
|
2012-10-12 04:03:33 +00:00
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
/*
|
|
|
|
* This happens when the module is removed, it doesn't
|
|
|
|
* really matter any more save for completeness
|
|
|
|
*/
|
|
|
|
if (!list_empty(&bss->hidden_list))
|
|
|
|
list_del(&bss->hidden_list);
|
|
|
|
|
2012-10-12 04:03:33 +00:00
|
|
|
kfree(bss);
|
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
static inline void bss_ref_get(struct cfg80211_registered_device *rdev,
|
2013-02-01 01:06:18 +00:00
|
|
|
struct cfg80211_internal_bss *bss)
|
2013-02-01 00:34:36 +00:00
|
|
|
{
|
2014-04-21 04:53:02 +00:00
|
|
|
lockdep_assert_held(&rdev->bss_lock);
|
2013-02-01 01:06:18 +00:00
|
|
|
|
|
|
|
bss->refcount++;
|
2022-09-30 21:44:23 +00:00
|
|
|
|
|
|
|
if (bss->pub.hidden_beacon_bss)
|
|
|
|
bss_from_pub(bss->pub.hidden_beacon_bss)->refcount++;
|
|
|
|
|
|
|
|
if (bss->pub.transmitted_bss)
|
|
|
|
bss_from_pub(bss->pub.transmitted_bss)->refcount++;
|
2013-02-01 00:34:36 +00:00
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
static inline void bss_ref_put(struct cfg80211_registered_device *rdev,
|
2013-02-01 01:06:18 +00:00
|
|
|
struct cfg80211_internal_bss *bss)
|
2013-02-01 00:34:36 +00:00
|
|
|
{
|
2014-04-21 04:53:02 +00:00
|
|
|
lockdep_assert_held(&rdev->bss_lock);
|
2013-02-01 01:06:18 +00:00
|
|
|
|
|
|
|
if (bss->pub.hidden_beacon_bss) {
|
|
|
|
struct cfg80211_internal_bss *hbss;
|
2022-10-17 07:03:48 +00:00
|
|
|
|
|
|
|
hbss = bss_from_pub(bss->pub.hidden_beacon_bss);
|
2013-02-01 01:06:18 +00:00
|
|
|
hbss->refcount--;
|
|
|
|
if (hbss->refcount == 0)
|
|
|
|
bss_free(hbss);
|
|
|
|
}
|
2019-01-21 10:22:21 +00:00
|
|
|
|
2019-01-21 10:25:59 +00:00
|
|
|
if (bss->pub.transmitted_bss) {
|
2019-01-21 10:22:21 +00:00
|
|
|
struct cfg80211_internal_bss *tbss;
|
|
|
|
|
2022-10-17 07:03:48 +00:00
|
|
|
tbss = bss_from_pub(bss->pub.transmitted_bss);
|
2019-01-21 10:22:21 +00:00
|
|
|
tbss->refcount--;
|
|
|
|
if (tbss->refcount == 0)
|
|
|
|
bss_free(tbss);
|
|
|
|
}
|
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
bss->refcount--;
|
|
|
|
if (bss->refcount == 0)
|
|
|
|
bss_free(bss);
|
2013-02-01 00:34:36 +00:00
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
static bool __cfg80211_unlink_bss(struct cfg80211_registered_device *rdev,
|
2012-10-12 04:03:33 +00:00
|
|
|
struct cfg80211_internal_bss *bss)
|
|
|
|
{
|
2014-04-21 04:53:02 +00:00
|
|
|
lockdep_assert_held(&rdev->bss_lock);
|
2013-02-01 00:05:43 +00:00
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
if (!list_empty(&bss->hidden_list)) {
|
|
|
|
/*
|
|
|
|
* don't remove the beacon entry if it has
|
|
|
|
* probe responses associated with it
|
|
|
|
*/
|
|
|
|
if (!bss->pub.hidden_beacon_bss)
|
|
|
|
return false;
|
|
|
|
/*
|
|
|
|
* if it's a probe response entry break its
|
|
|
|
* link to the other entries in the group
|
|
|
|
*/
|
|
|
|
list_del_init(&bss->hidden_list);
|
|
|
|
}
|
|
|
|
|
2012-10-12 04:03:33 +00:00
|
|
|
list_del_init(&bss->list);
|
2019-01-21 10:25:59 +00:00
|
|
|
list_del_init(&bss->pub.nontrans_list);
|
2014-04-21 04:53:02 +00:00
|
|
|
rb_erase(&bss->rbn, &rdev->bss_tree);
|
2016-11-15 11:05:11 +00:00
|
|
|
rdev->bss_entries--;
|
|
|
|
WARN_ONCE((rdev->bss_entries == 0) ^ list_empty(&rdev->bss_list),
|
|
|
|
"rdev bss entries[%d]/list[empty:%d] corruption\n",
|
|
|
|
rdev->bss_entries, list_empty(&rdev->bss_list));
|
2014-04-21 04:53:02 +00:00
|
|
|
bss_ref_put(rdev, bss);
|
2013-02-01 01:06:18 +00:00
|
|
|
return true;
|
2012-10-12 04:03:33 +00:00
|
|
|
}
|
|
|
|
|
2019-03-15 15:39:03 +00:00
|
|
|
bool cfg80211_is_element_inherited(const struct element *elem,
|
|
|
|
const struct element *non_inherit_elem)
|
|
|
|
{
|
|
|
|
u8 id_len, ext_id_len, i, loop_len, id;
|
|
|
|
const u8 *list;
|
|
|
|
|
|
|
|
if (elem->id == WLAN_EID_MULTIPLE_BSSID)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!non_inherit_elem || non_inherit_elem->datalen < 2)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* non inheritance element format is:
|
|
|
|
* ext ID (56) | IDs list len | list | extension IDs list len | list
|
|
|
|
* Both lists are optional. Both lengths are mandatory.
|
|
|
|
* This means valid length is:
|
|
|
|
* elem_len = 1 (extension ID) + 2 (list len fields) + list lengths
|
|
|
|
*/
|
|
|
|
id_len = non_inherit_elem->data[1];
|
|
|
|
if (non_inherit_elem->datalen < 3 + id_len)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
ext_id_len = non_inherit_elem->data[2 + id_len];
|
|
|
|
if (non_inherit_elem->datalen < 3 + id_len + ext_id_len)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if (elem->id == WLAN_EID_EXTENSION) {
|
|
|
|
if (!ext_id_len)
|
|
|
|
return true;
|
|
|
|
loop_len = ext_id_len;
|
|
|
|
list = &non_inherit_elem->data[3 + id_len];
|
|
|
|
id = elem->data[0];
|
|
|
|
} else {
|
|
|
|
if (!id_len)
|
|
|
|
return true;
|
|
|
|
loop_len = id_len;
|
|
|
|
list = &non_inherit_elem->data[2];
|
|
|
|
id = elem->id;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < loop_len; i++) {
|
|
|
|
if (list[i] == id)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_is_element_inherited);
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
static size_t cfg80211_gen_new_ie(const u8 *ie, size_t ielen,
|
|
|
|
const u8 *subelement, size_t subie_len,
|
|
|
|
u8 *new_ie, gfp_t gfp)
|
|
|
|
{
|
|
|
|
u8 *pos, *tmp;
|
|
|
|
const u8 *tmp_old, *tmp_new;
|
2019-03-15 15:39:03 +00:00
|
|
|
const struct element *non_inherit_elem;
|
2019-01-21 10:14:57 +00:00
|
|
|
u8 *sub_copy;
|
|
|
|
|
|
|
|
/* copy subelement as we need to change its content to
|
|
|
|
* mark an ie after it is processed.
|
|
|
|
*/
|
2019-02-25 12:38:49 +00:00
|
|
|
sub_copy = kmemdup(subelement, subie_len, gfp);
|
2019-01-21 10:14:57 +00:00
|
|
|
if (!sub_copy)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
pos = &new_ie[0];
|
|
|
|
|
|
|
|
/* set new ssid */
|
|
|
|
tmp_new = cfg80211_find_ie(WLAN_EID_SSID, sub_copy, subie_len);
|
|
|
|
if (tmp_new) {
|
|
|
|
memcpy(pos, tmp_new, tmp_new[1] + 2);
|
|
|
|
pos += (tmp_new[1] + 2);
|
|
|
|
}
|
|
|
|
|
2019-03-15 15:39:03 +00:00
|
|
|
/* get non inheritance list if exists */
|
|
|
|
non_inherit_elem =
|
|
|
|
cfg80211_find_ext_elem(WLAN_EID_EXT_NON_INHERITANCE,
|
|
|
|
sub_copy, subie_len);
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
/* go through IEs in ie (skip SSID) and subelement,
|
|
|
|
* merge them into new_ie
|
|
|
|
*/
|
|
|
|
tmp_old = cfg80211_find_ie(WLAN_EID_SSID, ie, ielen);
|
|
|
|
tmp_old = (tmp_old) ? tmp_old + tmp_old[1] + 2 : ie;
|
|
|
|
|
2022-09-29 19:50:44 +00:00
|
|
|
while (tmp_old + 2 - ie <= ielen &&
|
|
|
|
tmp_old + tmp_old[1] + 2 - ie <= ielen) {
|
2019-01-21 10:14:57 +00:00
|
|
|
if (tmp_old[0] == 0) {
|
|
|
|
tmp_old++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2019-01-29 12:00:58 +00:00
|
|
|
if (tmp_old[0] == WLAN_EID_EXTENSION)
|
|
|
|
tmp = (u8 *)cfg80211_find_ext_ie(tmp_old[2], sub_copy,
|
|
|
|
subie_len);
|
|
|
|
else
|
|
|
|
tmp = (u8 *)cfg80211_find_ie(tmp_old[0], sub_copy,
|
|
|
|
subie_len);
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
if (!tmp) {
|
2019-03-15 15:39:03 +00:00
|
|
|
const struct element *old_elem = (void *)tmp_old;
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
/* ie in old ie but not in subelement */
|
2019-03-15 15:39:03 +00:00
|
|
|
if (cfg80211_is_element_inherited(old_elem,
|
|
|
|
non_inherit_elem)) {
|
2019-01-21 10:14:57 +00:00
|
|
|
memcpy(pos, tmp_old, tmp_old[1] + 2);
|
|
|
|
pos += tmp_old[1] + 2;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* ie in transmitting ie also in subelement,
|
|
|
|
* copy from subelement and flag the ie in subelement
|
2019-01-29 12:00:58 +00:00
|
|
|
* as copied (by setting eid field to WLAN_EID_SSID,
|
|
|
|
* which is skipped anyway).
|
|
|
|
* For vendor ie, compare OUI + type + subType to
|
2019-01-21 10:14:57 +00:00
|
|
|
* determine if they are the same ie.
|
|
|
|
*/
|
|
|
|
if (tmp_old[0] == WLAN_EID_VENDOR_SPECIFIC) {
|
2022-11-25 11:36:57 +00:00
|
|
|
if (tmp_old[1] >= 5 && tmp[1] >= 5 &&
|
|
|
|
!memcmp(tmp_old + 2, tmp + 2, 5)) {
|
2019-01-21 10:14:57 +00:00
|
|
|
/* same vendor ie, copy from
|
|
|
|
* subelement
|
|
|
|
*/
|
|
|
|
memcpy(pos, tmp, tmp[1] + 2);
|
|
|
|
pos += tmp[1] + 2;
|
2019-01-29 12:00:58 +00:00
|
|
|
tmp[0] = WLAN_EID_SSID;
|
2019-01-21 10:14:57 +00:00
|
|
|
} else {
|
|
|
|
memcpy(pos, tmp_old, tmp_old[1] + 2);
|
|
|
|
pos += tmp_old[1] + 2;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* copy ie from subelement into new ie */
|
|
|
|
memcpy(pos, tmp, tmp[1] + 2);
|
|
|
|
pos += tmp[1] + 2;
|
2019-01-29 12:00:58 +00:00
|
|
|
tmp[0] = WLAN_EID_SSID;
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (tmp_old + tmp_old[1] + 2 - ie == ielen)
|
|
|
|
break;
|
|
|
|
|
|
|
|
tmp_old += tmp_old[1] + 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* go through subelement again to check if there is any ie not
|
|
|
|
* copied to new ie, skip ssid, capability, bssid-index ie
|
|
|
|
*/
|
|
|
|
tmp_new = sub_copy;
|
2022-09-29 19:50:44 +00:00
|
|
|
while (tmp_new + 2 - sub_copy <= subie_len &&
|
|
|
|
tmp_new + tmp_new[1] + 2 - sub_copy <= subie_len) {
|
2019-01-21 10:14:57 +00:00
|
|
|
if (!(tmp_new[0] == WLAN_EID_NON_TX_BSSID_CAP ||
|
2019-03-15 15:39:02 +00:00
|
|
|
tmp_new[0] == WLAN_EID_SSID)) {
|
2019-01-21 10:14:57 +00:00
|
|
|
memcpy(pos, tmp_new, tmp_new[1] + 2);
|
|
|
|
pos += tmp_new[1] + 2;
|
|
|
|
}
|
|
|
|
if (tmp_new + tmp_new[1] + 2 - sub_copy == subie_len)
|
|
|
|
break;
|
|
|
|
tmp_new += tmp_new[1] + 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
kfree(sub_copy);
|
|
|
|
return pos - new_ie;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool is_bss(struct cfg80211_bss *a, const u8 *bssid,
|
|
|
|
const u8 *ssid, size_t ssid_len)
|
|
|
|
{
|
|
|
|
const struct cfg80211_bss_ies *ies;
|
2021-09-30 11:11:30 +00:00
|
|
|
const struct element *ssid_elem;
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
if (bssid && !ether_addr_equal(a->bssid, bssid))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!ssid)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
ies = rcu_access_pointer(a->ies);
|
|
|
|
if (!ies)
|
|
|
|
return false;
|
2021-09-30 11:11:30 +00:00
|
|
|
ssid_elem = cfg80211_find_elem(WLAN_EID_SSID, ies->data, ies->len);
|
|
|
|
if (!ssid_elem)
|
2019-01-21 10:14:57 +00:00
|
|
|
return false;
|
2021-09-30 11:11:30 +00:00
|
|
|
if (ssid_elem->datalen != ssid_len)
|
2019-01-21 10:14:57 +00:00
|
|
|
return false;
|
2021-09-30 11:11:30 +00:00
|
|
|
return memcmp(ssid_elem->data, ssid, ssid_len) == 0;
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2019-01-21 10:25:59 +00:00
|
|
|
cfg80211_add_nontrans_list(struct cfg80211_bss *trans_bss,
|
|
|
|
struct cfg80211_bss *nontrans_bss)
|
2019-01-21 10:14:57 +00:00
|
|
|
{
|
2021-09-30 11:11:32 +00:00
|
|
|
const struct element *ssid_elem;
|
2019-01-21 10:25:59 +00:00
|
|
|
struct cfg80211_bss *bss = NULL;
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
rcu_read_lock();
|
2021-09-30 11:11:32 +00:00
|
|
|
ssid_elem = ieee80211_bss_get_elem(nontrans_bss, WLAN_EID_SSID);
|
|
|
|
if (!ssid_elem) {
|
2019-01-21 10:14:57 +00:00
|
|
|
rcu_read_unlock();
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* check if nontrans_bss is in the list */
|
|
|
|
list_for_each_entry(bss, &trans_bss->nontrans_list, nontrans_list) {
|
2021-09-30 11:11:32 +00:00
|
|
|
if (is_bss(bss, nontrans_bss->bssid, ssid_elem->data,
|
|
|
|
ssid_elem->datalen)) {
|
2021-09-30 11:11:21 +00:00
|
|
|
rcu_read_unlock();
|
2019-01-21 10:14:57 +00:00
|
|
|
return 0;
|
2021-09-30 11:11:21 +00:00
|
|
|
}
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
|
|
|
|
2021-09-30 11:11:21 +00:00
|
|
|
rcu_read_unlock();
|
|
|
|
|
2022-09-30 22:01:44 +00:00
|
|
|
/*
|
|
|
|
* This is a bit weird - it's not on the list, but already on another
|
|
|
|
* one! The only way that could happen is if there's some BSSID/SSID
|
|
|
|
* shared by multiple APs in their multi-BSSID profiles, potentially
|
|
|
|
* with hidden SSID mixed in ... ignore it.
|
|
|
|
*/
|
|
|
|
if (!list_empty(&nontrans_bss->nontrans_list))
|
|
|
|
return -EINVAL;
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
/* add to the list */
|
|
|
|
list_add_tail(&nontrans_bss->nontrans_list, &trans_bss->nontrans_list);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
static void __cfg80211_bss_expire(struct cfg80211_registered_device *rdev,
|
2012-10-12 04:03:34 +00:00
|
|
|
unsigned long expire_time)
|
|
|
|
{
|
|
|
|
struct cfg80211_internal_bss *bss, *tmp;
|
|
|
|
bool expired = false;
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
lockdep_assert_held(&rdev->bss_lock);
|
2013-02-01 00:05:43 +00:00
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
list_for_each_entry_safe(bss, tmp, &rdev->bss_list, list) {
|
2012-10-12 04:03:34 +00:00
|
|
|
if (atomic_read(&bss->hold))
|
|
|
|
continue;
|
|
|
|
if (!time_after(expire_time, bss->ts))
|
|
|
|
continue;
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
if (__cfg80211_unlink_bss(rdev, bss))
|
2013-02-01 01:06:18 +00:00
|
|
|
expired = true;
|
2012-10-12 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (expired)
|
2014-04-21 04:53:02 +00:00
|
|
|
rdev->bss_generation++;
|
2012-10-12 04:03:34 +00:00
|
|
|
}
|
|
|
|
|
2016-11-15 11:05:11 +00:00
|
|
|
static bool cfg80211_bss_expire_oldest(struct cfg80211_registered_device *rdev)
|
|
|
|
{
|
|
|
|
struct cfg80211_internal_bss *bss, *oldest = NULL;
|
|
|
|
bool ret;
|
|
|
|
|
|
|
|
lockdep_assert_held(&rdev->bss_lock);
|
|
|
|
|
|
|
|
list_for_each_entry(bss, &rdev->bss_list, list) {
|
|
|
|
if (atomic_read(&bss->hold))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!list_empty(&bss->hidden_list) &&
|
|
|
|
!bss->pub.hidden_beacon_bss)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (oldest && time_before(oldest->ts, bss->ts))
|
|
|
|
continue;
|
|
|
|
oldest = bss;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (WARN_ON(!oldest))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The callers make sure to increase rdev->bss_generation if anything
|
|
|
|
* gets removed (and a new entry added), so there's no need to also do
|
|
|
|
* it here.
|
|
|
|
*/
|
|
|
|
|
|
|
|
ret = __cfg80211_unlink_bss(rdev, oldest);
|
|
|
|
WARN_ON(!ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2020-09-18 09:33:13 +00:00
|
|
|
static u8 cfg80211_parse_bss_param(u8 data,
|
|
|
|
struct cfg80211_colocated_ap *coloc_ap)
|
|
|
|
{
|
|
|
|
coloc_ap->oct_recommended =
|
|
|
|
u8_get_bits(data, IEEE80211_RNR_TBTT_PARAMS_OCT_RECOMMENDED);
|
|
|
|
coloc_ap->same_ssid =
|
|
|
|
u8_get_bits(data, IEEE80211_RNR_TBTT_PARAMS_SAME_SSID);
|
|
|
|
coloc_ap->multi_bss =
|
|
|
|
u8_get_bits(data, IEEE80211_RNR_TBTT_PARAMS_MULTI_BSSID);
|
|
|
|
coloc_ap->transmitted_bssid =
|
|
|
|
u8_get_bits(data, IEEE80211_RNR_TBTT_PARAMS_TRANSMITTED_BSSID);
|
|
|
|
coloc_ap->unsolicited_probe =
|
|
|
|
u8_get_bits(data, IEEE80211_RNR_TBTT_PARAMS_PROBE_ACTIVE);
|
|
|
|
coloc_ap->colocated_ess =
|
|
|
|
u8_get_bits(data, IEEE80211_RNR_TBTT_PARAMS_COLOC_ESS);
|
|
|
|
|
|
|
|
return u8_get_bits(data, IEEE80211_RNR_TBTT_PARAMS_COLOC_AP);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfg80211_calc_short_ssid(const struct cfg80211_bss_ies *ies,
|
|
|
|
const struct element **elem, u32 *s_ssid)
|
|
|
|
{
|
|
|
|
|
|
|
|
*elem = cfg80211_find_elem(WLAN_EID_SSID, ies->data, ies->len);
|
|
|
|
if (!*elem || (*elem)->datalen > IEEE80211_MAX_SSID_LEN)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
*s_ssid = ~crc32_le(~0, (*elem)->data, (*elem)->datalen);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void cfg80211_free_coloc_ap_list(struct list_head *coloc_ap_list)
|
|
|
|
{
|
|
|
|
struct cfg80211_colocated_ap *ap, *tmp_ap;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(ap, tmp_ap, coloc_ap_list, list) {
|
|
|
|
list_del(&ap->list);
|
|
|
|
kfree(ap);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfg80211_parse_ap_info(struct cfg80211_colocated_ap *entry,
|
|
|
|
const u8 *pos, u8 length,
|
|
|
|
const struct element *ssid_elem,
|
|
|
|
int s_ssid_tmp)
|
|
|
|
{
|
|
|
|
/* skip the TBTT offset */
|
|
|
|
pos++;
|
|
|
|
|
|
|
|
memcpy(entry->bssid, pos, ETH_ALEN);
|
|
|
|
pos += ETH_ALEN;
|
|
|
|
|
2022-08-03 15:02:56 +00:00
|
|
|
if (length >= IEEE80211_TBTT_INFO_OFFSET_BSSID_SSSID_BSS_PARAM) {
|
2020-09-18 09:33:13 +00:00
|
|
|
memcpy(&entry->short_ssid, pos,
|
|
|
|
sizeof(entry->short_ssid));
|
|
|
|
entry->short_ssid_valid = true;
|
|
|
|
pos += 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* skip non colocated APs */
|
|
|
|
if (!cfg80211_parse_bss_param(*pos, entry))
|
|
|
|
return -EINVAL;
|
|
|
|
pos++;
|
|
|
|
|
|
|
|
if (length == IEEE80211_TBTT_INFO_OFFSET_BSSID_BSS_PARAM) {
|
|
|
|
/*
|
|
|
|
* no information about the short ssid. Consider the entry valid
|
|
|
|
* for now. It would later be dropped in case there are explicit
|
|
|
|
* SSIDs that need to be matched
|
|
|
|
*/
|
|
|
|
if (!entry->same_ssid)
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (entry->same_ssid) {
|
|
|
|
entry->short_ssid = s_ssid_tmp;
|
|
|
|
entry->short_ssid_valid = true;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is safe because we validate datalen in
|
|
|
|
* cfg80211_parse_colocated_ap(), before calling this
|
|
|
|
* function.
|
|
|
|
*/
|
|
|
|
memcpy(&entry->ssid, &ssid_elem->data,
|
|
|
|
ssid_elem->datalen);
|
|
|
|
entry->ssid_len = ssid_elem->datalen;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfg80211_parse_colocated_ap(const struct cfg80211_bss_ies *ies,
|
|
|
|
struct list_head *list)
|
|
|
|
{
|
|
|
|
struct ieee80211_neighbor_ap_info *ap_info;
|
|
|
|
const struct element *elem, *ssid_elem;
|
|
|
|
const u8 *pos, *end;
|
|
|
|
u32 s_ssid_tmp;
|
|
|
|
int n_coloc = 0, ret;
|
|
|
|
LIST_HEAD(ap_list);
|
|
|
|
|
|
|
|
elem = cfg80211_find_elem(WLAN_EID_REDUCED_NEIGHBOR_REPORT, ies->data,
|
|
|
|
ies->len);
|
2021-04-08 12:32:24 +00:00
|
|
|
if (!elem)
|
2020-09-18 09:33:13 +00:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
pos = elem->data;
|
|
|
|
end = pos + elem->datalen;
|
|
|
|
|
|
|
|
ret = cfg80211_calc_short_ssid(ies, &ssid_elem, &s_ssid_tmp);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
/* RNR IE may contain more than one NEIGHBOR_AP_INFO */
|
|
|
|
while (pos + sizeof(*ap_info) <= end) {
|
|
|
|
enum nl80211_band band;
|
|
|
|
int freq;
|
|
|
|
u8 length, i, count;
|
|
|
|
|
|
|
|
ap_info = (void *)pos;
|
|
|
|
count = u8_get_bits(ap_info->tbtt_info_hdr,
|
|
|
|
IEEE80211_AP_INFO_TBTT_HDR_COUNT) + 1;
|
|
|
|
length = ap_info->tbtt_info_len;
|
|
|
|
|
|
|
|
pos += sizeof(*ap_info);
|
|
|
|
|
|
|
|
if (!ieee80211_operating_class_to_band(ap_info->op_class,
|
|
|
|
&band))
|
|
|
|
break;
|
|
|
|
|
|
|
|
freq = ieee80211_channel_to_frequency(ap_info->channel, band);
|
|
|
|
|
2021-05-08 13:03:51 +00:00
|
|
|
if (end - pos < count * length)
|
2020-09-18 09:33:13 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* TBTT info must include bss param + BSSID +
|
|
|
|
* (short SSID or same_ssid bit to be set).
|
|
|
|
* ignore other options, and move to the
|
|
|
|
* next AP info
|
|
|
|
*/
|
|
|
|
if (band != NL80211_BAND_6GHZ ||
|
|
|
|
(length != IEEE80211_TBTT_INFO_OFFSET_BSSID_BSS_PARAM &&
|
|
|
|
length < IEEE80211_TBTT_INFO_OFFSET_BSSID_SSSID_BSS_PARAM)) {
|
2021-05-08 13:03:51 +00:00
|
|
|
pos += count * length;
|
2020-09-18 09:33:13 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < count; i++) {
|
|
|
|
struct cfg80211_colocated_ap *entry;
|
|
|
|
|
|
|
|
entry = kzalloc(sizeof(*entry) + IEEE80211_MAX_SSID_LEN,
|
|
|
|
GFP_ATOMIC);
|
|
|
|
|
|
|
|
if (!entry)
|
|
|
|
break;
|
|
|
|
|
|
|
|
entry->center_freq = freq;
|
|
|
|
|
|
|
|
if (!cfg80211_parse_ap_info(entry, pos, length,
|
|
|
|
ssid_elem, s_ssid_tmp)) {
|
|
|
|
n_coloc++;
|
|
|
|
list_add_tail(&entry->list, &ap_list);
|
|
|
|
} else {
|
|
|
|
kfree(entry);
|
|
|
|
}
|
|
|
|
|
2021-05-08 13:03:51 +00:00
|
|
|
pos += length;
|
2020-09-18 09:33:13 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pos != end) {
|
|
|
|
cfg80211_free_coloc_ap_list(&ap_list);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
list_splice_tail(&ap_list, list);
|
|
|
|
return n_coloc;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void cfg80211_scan_req_add_chan(struct cfg80211_scan_request *request,
|
|
|
|
struct ieee80211_channel *chan,
|
|
|
|
bool add_to_6ghz)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
u32 n_channels = request->n_channels;
|
|
|
|
struct cfg80211_scan_6ghz_params *params =
|
|
|
|
&request->scan_6ghz_params[request->n_6ghz_params];
|
|
|
|
|
|
|
|
for (i = 0; i < n_channels; i++) {
|
|
|
|
if (request->channels[i] == chan) {
|
|
|
|
if (add_to_6ghz)
|
|
|
|
params->channel_idx = i;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
request->channels[n_channels] = chan;
|
|
|
|
if (add_to_6ghz)
|
|
|
|
request->scan_6ghz_params[request->n_6ghz_params].channel_idx =
|
|
|
|
n_channels;
|
|
|
|
|
|
|
|
request->n_channels++;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool cfg80211_find_ssid_match(struct cfg80211_colocated_ap *ap,
|
|
|
|
struct cfg80211_scan_request *request)
|
|
|
|
{
|
2020-10-29 22:24:07 +00:00
|
|
|
int i;
|
2020-09-18 09:33:13 +00:00
|
|
|
u32 s_ssid;
|
|
|
|
|
|
|
|
for (i = 0; i < request->n_ssids; i++) {
|
|
|
|
/* wildcard ssid in the scan request */
|
2022-02-02 08:49:37 +00:00
|
|
|
if (!request->ssids[i].ssid_len) {
|
|
|
|
if (ap->multi_bss && !ap->transmitted_bssid)
|
|
|
|
continue;
|
|
|
|
|
2020-09-18 09:33:13 +00:00
|
|
|
return true;
|
2022-02-02 08:49:37 +00:00
|
|
|
}
|
2020-09-18 09:33:13 +00:00
|
|
|
|
|
|
|
if (ap->ssid_len &&
|
|
|
|
ap->ssid_len == request->ssids[i].ssid_len) {
|
|
|
|
if (!memcmp(request->ssids[i].ssid, ap->ssid,
|
|
|
|
ap->ssid_len))
|
|
|
|
return true;
|
|
|
|
} else if (ap->short_ssid_valid) {
|
|
|
|
s_ssid = ~crc32_le(~0, request->ssids[i].ssid,
|
|
|
|
request->ssids[i].ssid_len);
|
|
|
|
|
|
|
|
if (ap->short_ssid == s_ssid)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfg80211_scan_6ghz(struct cfg80211_registered_device *rdev)
|
|
|
|
{
|
|
|
|
u8 i;
|
|
|
|
struct cfg80211_colocated_ap *ap;
|
|
|
|
int n_channels, count = 0, err;
|
|
|
|
struct cfg80211_scan_request *request, *rdev_req = rdev->scan_req;
|
|
|
|
LIST_HEAD(coloc_ap_list);
|
2020-11-29 15:30:48 +00:00
|
|
|
bool need_scan_psc = true;
|
2020-09-18 09:33:13 +00:00
|
|
|
const struct ieee80211_sband_iftype_data *iftd;
|
|
|
|
|
|
|
|
rdev_req->scan_6ghz = true;
|
|
|
|
|
|
|
|
if (!rdev->wiphy.bands[NL80211_BAND_6GHZ])
|
|
|
|
return -EOPNOTSUPP;
|
|
|
|
|
|
|
|
iftd = ieee80211_get_sband_iftype_data(rdev->wiphy.bands[NL80211_BAND_6GHZ],
|
|
|
|
rdev_req->wdev->iftype);
|
|
|
|
if (!iftd || !iftd->he_cap.has_he)
|
|
|
|
return -EOPNOTSUPP;
|
|
|
|
|
|
|
|
n_channels = rdev->wiphy.bands[NL80211_BAND_6GHZ]->n_channels;
|
|
|
|
|
|
|
|
if (rdev_req->flags & NL80211_SCAN_FLAG_COLOCATED_6GHZ) {
|
|
|
|
struct cfg80211_internal_bss *intbss;
|
|
|
|
|
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
|
|
|
list_for_each_entry(intbss, &rdev->bss_list, list) {
|
|
|
|
struct cfg80211_bss *res = &intbss->pub;
|
|
|
|
const struct cfg80211_bss_ies *ies;
|
|
|
|
|
|
|
|
ies = rcu_access_pointer(res->ies);
|
|
|
|
count += cfg80211_parse_colocated_ap(ies,
|
|
|
|
&coloc_ap_list);
|
|
|
|
}
|
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
request = kzalloc(struct_size(request, channels, n_channels) +
|
2021-06-18 10:41:41 +00:00
|
|
|
sizeof(*request->scan_6ghz_params) * count +
|
|
|
|
sizeof(*request->ssids) * rdev_req->n_ssids,
|
2020-09-18 09:33:13 +00:00
|
|
|
GFP_KERNEL);
|
|
|
|
if (!request) {
|
|
|
|
cfg80211_free_coloc_ap_list(&coloc_ap_list);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
*request = *rdev_req;
|
|
|
|
request->n_channels = 0;
|
|
|
|
request->scan_6ghz_params =
|
|
|
|
(void *)&request->channels[n_channels];
|
|
|
|
|
|
|
|
/*
|
2020-11-29 15:30:48 +00:00
|
|
|
* PSC channels should not be scanned in case of direct scan with 1 SSID
|
|
|
|
* and at least one of the reported co-located APs with same SSID
|
|
|
|
* indicating that all APs in the same ESS are co-located
|
2020-09-18 09:33:13 +00:00
|
|
|
*/
|
2020-11-29 15:30:48 +00:00
|
|
|
if (count && request->n_ssids == 1 && request->ssids[0].ssid_len) {
|
2020-09-18 09:33:13 +00:00
|
|
|
list_for_each_entry(ap, &coloc_ap_list, list) {
|
2020-11-29 15:30:48 +00:00
|
|
|
if (ap->colocated_ess &&
|
|
|
|
cfg80211_find_ssid_match(ap, request)) {
|
|
|
|
need_scan_psc = false;
|
2020-09-18 09:33:13 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* add to the scan request the channels that need to be scanned
|
|
|
|
* regardless of the collocated APs (PSC channels or all channels
|
|
|
|
* in case that NL80211_SCAN_FLAG_COLOCATED_6GHZ is not set)
|
|
|
|
*/
|
|
|
|
for (i = 0; i < rdev_req->n_channels; i++) {
|
|
|
|
if (rdev_req->channels[i]->band == NL80211_BAND_6GHZ &&
|
|
|
|
((need_scan_psc &&
|
|
|
|
cfg80211_channel_is_psc(rdev_req->channels[i])) ||
|
|
|
|
!(rdev_req->flags & NL80211_SCAN_FLAG_COLOCATED_6GHZ))) {
|
|
|
|
cfg80211_scan_req_add_chan(request,
|
|
|
|
rdev_req->channels[i],
|
|
|
|
false);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!(rdev_req->flags & NL80211_SCAN_FLAG_COLOCATED_6GHZ))
|
|
|
|
goto skip;
|
|
|
|
|
|
|
|
list_for_each_entry(ap, &coloc_ap_list, list) {
|
|
|
|
bool found = false;
|
|
|
|
struct cfg80211_scan_6ghz_params *scan_6ghz_params =
|
|
|
|
&request->scan_6ghz_params[request->n_6ghz_params];
|
|
|
|
struct ieee80211_channel *chan =
|
|
|
|
ieee80211_get_channel(&rdev->wiphy, ap->center_freq);
|
|
|
|
|
|
|
|
if (!chan || chan->flags & IEEE80211_CHAN_DISABLED)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
for (i = 0; i < rdev_req->n_channels; i++) {
|
|
|
|
if (rdev_req->channels[i] == chan)
|
|
|
|
found = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!found)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (request->n_ssids > 0 &&
|
|
|
|
!cfg80211_find_ssid_match(ap, request))
|
|
|
|
continue;
|
|
|
|
|
2022-02-02 08:49:37 +00:00
|
|
|
if (!request->n_ssids && ap->multi_bss && !ap->transmitted_bssid)
|
|
|
|
continue;
|
|
|
|
|
2020-09-18 09:33:13 +00:00
|
|
|
cfg80211_scan_req_add_chan(request, chan, true);
|
|
|
|
memcpy(scan_6ghz_params->bssid, ap->bssid, ETH_ALEN);
|
|
|
|
scan_6ghz_params->short_ssid = ap->short_ssid;
|
|
|
|
scan_6ghz_params->short_ssid_valid = ap->short_ssid_valid;
|
|
|
|
scan_6ghz_params->unsolicited_probe = ap->unsolicited_probe;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If a PSC channel is added to the scan and 'need_scan_psc' is
|
|
|
|
* set to false, then all the APs that the scan logic is
|
|
|
|
* interested with on the channel are collocated and thus there
|
|
|
|
* is no need to perform the initial PSC channel listen.
|
|
|
|
*/
|
|
|
|
if (cfg80211_channel_is_psc(chan) && !need_scan_psc)
|
|
|
|
scan_6ghz_params->psc_no_listen = true;
|
|
|
|
|
|
|
|
request->n_6ghz_params++;
|
|
|
|
}
|
|
|
|
|
|
|
|
skip:
|
|
|
|
cfg80211_free_coloc_ap_list(&coloc_ap_list);
|
|
|
|
|
|
|
|
if (request->n_channels) {
|
|
|
|
struct cfg80211_scan_request *old = rdev->int_scan_req;
|
|
|
|
rdev->int_scan_req = request;
|
|
|
|
|
2021-06-18 10:41:41 +00:00
|
|
|
/*
|
|
|
|
* Add the ssids from the parent scan request to the new scan
|
|
|
|
* request, so the driver would be able to use them in its
|
|
|
|
* probe requests to discover hidden APs on PSC channels.
|
|
|
|
*/
|
|
|
|
request->ssids = (void *)&request->channels[request->n_channels];
|
|
|
|
request->n_ssids = rdev_req->n_ssids;
|
|
|
|
memcpy(request->ssids, rdev_req->ssids, sizeof(*request->ssids) *
|
|
|
|
request->n_ssids);
|
|
|
|
|
2020-09-18 09:33:13 +00:00
|
|
|
/*
|
|
|
|
* If this scan follows a previous scan, save the scan start
|
|
|
|
* info from the first part of the scan
|
|
|
|
*/
|
|
|
|
if (old)
|
|
|
|
rdev->int_scan_req->info = old->info;
|
|
|
|
|
|
|
|
err = rdev_scan(rdev, request);
|
|
|
|
if (err) {
|
|
|
|
rdev->int_scan_req = old;
|
|
|
|
kfree(request);
|
|
|
|
} else {
|
|
|
|
kfree(old);
|
|
|
|
}
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
kfree(request);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
int cfg80211_scan(struct cfg80211_registered_device *rdev)
|
|
|
|
{
|
|
|
|
struct cfg80211_scan_request *request;
|
|
|
|
struct cfg80211_scan_request *rdev_req = rdev->scan_req;
|
|
|
|
u32 n_channels = 0, idx, i;
|
|
|
|
|
|
|
|
if (!(rdev->wiphy.flags & WIPHY_FLAG_SPLIT_SCAN_6GHZ))
|
|
|
|
return rdev_scan(rdev, rdev_req);
|
|
|
|
|
|
|
|
for (i = 0; i < rdev_req->n_channels; i++) {
|
|
|
|
if (rdev_req->channels[i]->band != NL80211_BAND_6GHZ)
|
|
|
|
n_channels++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!n_channels)
|
|
|
|
return cfg80211_scan_6ghz(rdev);
|
|
|
|
|
|
|
|
request = kzalloc(struct_size(request, channels, n_channels),
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (!request)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
*request = *rdev_req;
|
|
|
|
request->n_channels = n_channels;
|
|
|
|
|
|
|
|
for (i = idx = 0; i < rdev_req->n_channels; i++) {
|
|
|
|
if (rdev_req->channels[i]->band != NL80211_BAND_6GHZ)
|
|
|
|
request->channels[idx++] = rdev_req->channels[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
rdev_req->scan_6ghz = false;
|
|
|
|
rdev->int_scan_req = request;
|
|
|
|
return rdev_scan(rdev, request);
|
|
|
|
}
|
|
|
|
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
void ___cfg80211_scan_done(struct cfg80211_registered_device *rdev,
|
|
|
|
bool send_message)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
2020-09-18 09:33:13 +00:00
|
|
|
struct cfg80211_scan_request *request, *rdev_req;
|
2012-06-18 17:17:03 +00:00
|
|
|
struct wireless_dev *wdev;
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
struct sk_buff *msg;
|
2009-09-29 21:27:28 +00:00
|
|
|
#ifdef CONFIG_CFG80211_WEXT
|
2009-02-10 20:25:55 +00:00
|
|
|
union iwreq_data wrqu;
|
|
|
|
#endif
|
|
|
|
|
2021-01-22 15:19:43 +00:00
|
|
|
lockdep_assert_held(&rdev->wiphy.mtx);
|
2009-08-20 19:36:16 +00:00
|
|
|
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
if (rdev->scan_msg) {
|
2016-12-16 11:21:54 +00:00
|
|
|
nl80211_send_scan_msg(rdev, rdev->scan_msg);
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
rdev->scan_msg = NULL;
|
|
|
|
return;
|
|
|
|
}
|
2009-07-07 01:56:11 +00:00
|
|
|
|
2020-09-18 09:33:13 +00:00
|
|
|
rdev_req = rdev->scan_req;
|
|
|
|
if (!rdev_req)
|
2009-08-20 19:36:16 +00:00
|
|
|
return;
|
|
|
|
|
2020-09-18 09:33:13 +00:00
|
|
|
wdev = rdev_req->wdev;
|
|
|
|
request = rdev->int_scan_req ? rdev->int_scan_req : rdev_req;
|
|
|
|
|
|
|
|
if (wdev_running(wdev) &&
|
|
|
|
(rdev->wiphy.flags & WIPHY_FLAG_SPLIT_SCAN_6GHZ) &&
|
|
|
|
!rdev_req->scan_6ghz && !request->info.aborted &&
|
|
|
|
!cfg80211_scan_6ghz(rdev))
|
|
|
|
return;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2009-07-02 07:13:27 +00:00
|
|
|
/*
|
|
|
|
* This must be before sending the other events!
|
|
|
|
* Otherwise, wpa_supplicant gets completely confused with
|
|
|
|
* wext events.
|
|
|
|
*/
|
2012-06-18 17:17:03 +00:00
|
|
|
if (wdev->netdev)
|
|
|
|
cfg80211_sme_scan_done(wdev->netdev);
|
2009-07-02 07:13:27 +00:00
|
|
|
|
2016-07-05 14:10:13 +00:00
|
|
|
if (!request->info.aborted &&
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
request->flags & NL80211_SCAN_FLAG_FLUSH) {
|
|
|
|
/* flush entries from previous scans */
|
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
|
|
|
__cfg80211_bss_expire(rdev, request->scan_start);
|
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2012-10-12 04:03:34 +00:00
|
|
|
}
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2016-07-05 14:10:13 +00:00
|
|
|
msg = nl80211_build_scan_msg(rdev, wdev, request->info.aborted);
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
|
2009-09-29 21:27:28 +00:00
|
|
|
#ifdef CONFIG_CFG80211_WEXT
|
2016-07-05 14:10:13 +00:00
|
|
|
if (wdev->netdev && !request->info.aborted) {
|
2009-02-10 20:25:55 +00:00
|
|
|
memset(&wrqu, 0, sizeof(wrqu));
|
|
|
|
|
2012-06-18 17:17:03 +00:00
|
|
|
wireless_send_event(wdev->netdev, SIOCGIWSCAN, &wrqu, NULL);
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2021-08-05 11:55:27 +00:00
|
|
|
dev_put(wdev->netdev);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2020-09-18 09:33:13 +00:00
|
|
|
kfree(rdev->int_scan_req);
|
|
|
|
rdev->int_scan_req = NULL;
|
|
|
|
|
|
|
|
kfree(rdev->scan_req);
|
2009-08-12 20:21:21 +00:00
|
|
|
rdev->scan_req = NULL;
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
|
|
|
|
if (!send_message)
|
|
|
|
rdev->scan_msg = msg;
|
|
|
|
else
|
2016-12-16 11:21:54 +00:00
|
|
|
nl80211_send_scan_msg(rdev, msg);
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
2009-07-07 01:56:11 +00:00
|
|
|
|
2009-08-12 20:21:21 +00:00
|
|
|
void __cfg80211_scan_done(struct work_struct *wk)
|
|
|
|
{
|
|
|
|
struct cfg80211_registered_device *rdev;
|
|
|
|
|
|
|
|
rdev = container_of(wk, struct cfg80211_registered_device,
|
|
|
|
scan_done_wk);
|
|
|
|
|
2021-01-22 15:19:43 +00:00
|
|
|
wiphy_lock(&rdev->wiphy);
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
___cfg80211_scan_done(rdev, true);
|
2021-01-22 15:19:43 +00:00
|
|
|
wiphy_unlock(&rdev->wiphy);
|
2009-08-12 20:21:21 +00:00
|
|
|
}
|
|
|
|
|
2016-07-05 14:10:13 +00:00
|
|
|
void cfg80211_scan_done(struct cfg80211_scan_request *request,
|
|
|
|
struct cfg80211_scan_info *info)
|
2009-07-07 01:56:11 +00:00
|
|
|
{
|
2020-09-18 09:33:13 +00:00
|
|
|
struct cfg80211_scan_info old_info = request->info;
|
|
|
|
|
2016-07-05 14:10:13 +00:00
|
|
|
trace_cfg80211_scan_done(request, info);
|
2020-09-18 09:33:13 +00:00
|
|
|
WARN_ON(request != wiphy_to_rdev(request->wiphy)->scan_req &&
|
|
|
|
request != wiphy_to_rdev(request->wiphy)->int_scan_req);
|
2009-07-07 01:56:11 +00:00
|
|
|
|
2016-07-05 14:10:13 +00:00
|
|
|
request->info = *info;
|
2020-09-18 09:33:13 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* In case the scan is split, the scan_start_tsf and tsf_bssid should
|
|
|
|
* be of the first part. In such a case old_info.scan_start_tsf should
|
|
|
|
* be non zero.
|
|
|
|
*/
|
|
|
|
if (request->scan_6ghz && old_info.scan_start_tsf) {
|
|
|
|
request->info.scan_start_tsf = old_info.scan_start_tsf;
|
|
|
|
memcpy(request->info.tsf_bssid, old_info.tsf_bssid,
|
|
|
|
sizeof(request->info.tsf_bssid));
|
|
|
|
}
|
|
|
|
|
2013-05-08 19:45:15 +00:00
|
|
|
request->notified = true;
|
2014-04-21 04:53:03 +00:00
|
|
|
queue_work(cfg80211_wq, &wiphy_to_rdev(request->wiphy)->scan_done_wk);
|
2009-07-07 01:56:11 +00:00
|
|
|
}
|
2009-02-10 20:25:55 +00:00
|
|
|
EXPORT_SYMBOL(cfg80211_scan_done);
|
|
|
|
|
2017-04-21 12:05:00 +00:00
|
|
|
void cfg80211_add_sched_scan_req(struct cfg80211_registered_device *rdev,
|
|
|
|
struct cfg80211_sched_scan_request *req)
|
|
|
|
{
|
2021-01-22 15:19:43 +00:00
|
|
|
lockdep_assert_held(&rdev->wiphy.mtx);
|
2017-04-21 12:05:00 +00:00
|
|
|
|
|
|
|
list_add_rcu(&req->list, &rdev->sched_scan_req_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void cfg80211_del_sched_scan_req(struct cfg80211_registered_device *rdev,
|
|
|
|
struct cfg80211_sched_scan_request *req)
|
|
|
|
{
|
2021-01-22 15:19:43 +00:00
|
|
|
lockdep_assert_held(&rdev->wiphy.mtx);
|
2017-04-21 12:05:00 +00:00
|
|
|
|
|
|
|
list_del_rcu(&req->list);
|
|
|
|
kfree_rcu(req, rcu_head);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct cfg80211_sched_scan_request *
|
|
|
|
cfg80211_find_sched_scan_req(struct cfg80211_registered_device *rdev, u64 reqid)
|
|
|
|
{
|
|
|
|
struct cfg80211_sched_scan_request *pos;
|
|
|
|
|
2020-02-19 09:11:04 +00:00
|
|
|
list_for_each_entry_rcu(pos, &rdev->sched_scan_req_list, list,
|
2021-01-22 15:19:43 +00:00
|
|
|
lockdep_is_held(&rdev->wiphy.mtx)) {
|
2017-04-21 12:05:00 +00:00
|
|
|
if (pos->reqid == reqid)
|
|
|
|
return pos;
|
|
|
|
}
|
2017-04-28 12:40:28 +00:00
|
|
|
return NULL;
|
2017-04-21 12:05:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Determines if a scheduled scan request can be handled. When a legacy
|
|
|
|
* scheduled scan is running no other scheduled scan is allowed regardless
|
|
|
|
* whether the request is for legacy or multi-support scan. When a multi-support
|
|
|
|
* scheduled scan is running a request for legacy scan is not allowed. In this
|
|
|
|
* case a request for multi-support scan can be handled if resources are
|
|
|
|
* available, ie. struct wiphy::max_sched_scan_reqs limit is not yet reached.
|
|
|
|
*/
|
|
|
|
int cfg80211_sched_scan_req_possible(struct cfg80211_registered_device *rdev,
|
|
|
|
bool want_multi)
|
|
|
|
{
|
|
|
|
struct cfg80211_sched_scan_request *pos;
|
|
|
|
int i = 0;
|
|
|
|
|
|
|
|
list_for_each_entry(pos, &rdev->sched_scan_req_list, list) {
|
|
|
|
/* request id zero means legacy in progress */
|
|
|
|
if (!i && !pos->reqid)
|
|
|
|
return -EINPROGRESS;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i) {
|
|
|
|
/* no legacy allowed when multi request(s) are active */
|
|
|
|
if (!want_multi)
|
|
|
|
return -EINPROGRESS;
|
|
|
|
|
|
|
|
/* resource limit reached */
|
|
|
|
if (i == rdev->wiphy.max_sched_scan_reqs)
|
|
|
|
return -ENOSPC;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-04-28 12:40:28 +00:00
|
|
|
void cfg80211_sched_scan_results_wk(struct work_struct *work)
|
2011-05-11 14:09:35 +00:00
|
|
|
{
|
|
|
|
struct cfg80211_registered_device *rdev;
|
2017-04-28 12:40:28 +00:00
|
|
|
struct cfg80211_sched_scan_request *req, *tmp;
|
2011-05-11 14:09:35 +00:00
|
|
|
|
2017-04-28 12:40:28 +00:00
|
|
|
rdev = container_of(work, struct cfg80211_registered_device,
|
|
|
|
sched_scan_res_wk);
|
2011-05-11 14:09:35 +00:00
|
|
|
|
2021-01-22 15:19:43 +00:00
|
|
|
wiphy_lock(&rdev->wiphy);
|
2017-04-28 12:40:28 +00:00
|
|
|
list_for_each_entry_safe(req, tmp, &rdev->sched_scan_req_list, list) {
|
|
|
|
if (req->report_results) {
|
|
|
|
req->report_results = false;
|
|
|
|
if (req->flags & NL80211_SCAN_FLAG_FLUSH) {
|
|
|
|
/* flush entries from previous scans */
|
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
|
|
|
__cfg80211_bss_expire(rdev, req->scan_start);
|
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
|
|
|
req->scan_start = jiffies;
|
|
|
|
}
|
|
|
|
nl80211_send_sched_scan(req,
|
|
|
|
NL80211_CMD_SCHED_SCAN_RESULTS);
|
2012-10-12 04:03:34 +00:00
|
|
|
}
|
|
|
|
}
|
2021-01-22 15:19:43 +00:00
|
|
|
wiphy_unlock(&rdev->wiphy);
|
2011-05-11 14:09:35 +00:00
|
|
|
}
|
|
|
|
|
2017-04-28 12:40:28 +00:00
|
|
|
void cfg80211_sched_scan_results(struct wiphy *wiphy, u64 reqid)
|
2011-05-11 14:09:35 +00:00
|
|
|
{
|
2017-04-21 12:05:00 +00:00
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
|
|
|
struct cfg80211_sched_scan_request *request;
|
|
|
|
|
2017-04-28 12:40:28 +00:00
|
|
|
trace_cfg80211_sched_scan_results(wiphy, reqid);
|
2011-05-11 14:09:35 +00:00
|
|
|
/* ignore if we're not scanning */
|
2014-12-15 11:25:38 +00:00
|
|
|
|
2017-05-23 08:58:07 +00:00
|
|
|
rcu_read_lock();
|
2017-04-28 12:40:28 +00:00
|
|
|
request = cfg80211_find_sched_scan_req(rdev, reqid);
|
|
|
|
if (request) {
|
|
|
|
request->report_results = true;
|
|
|
|
queue_work(cfg80211_wq, &rdev->sched_scan_res_wk);
|
|
|
|
}
|
2017-05-23 08:58:07 +00:00
|
|
|
rcu_read_unlock();
|
2011-05-11 14:09:35 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_sched_scan_results);
|
|
|
|
|
2021-01-22 15:19:43 +00:00
|
|
|
void cfg80211_sched_scan_stopped_locked(struct wiphy *wiphy, u64 reqid)
|
2011-05-11 14:09:35 +00:00
|
|
|
{
|
2014-04-21 04:53:03 +00:00
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
2011-05-11 14:09:35 +00:00
|
|
|
|
2021-01-22 15:19:43 +00:00
|
|
|
lockdep_assert_held(&wiphy->mtx);
|
2014-04-30 13:14:23 +00:00
|
|
|
|
2017-04-28 12:40:28 +00:00
|
|
|
trace_cfg80211_sched_scan_stopped(wiphy, reqid);
|
2012-08-27 09:49:39 +00:00
|
|
|
|
2017-04-28 12:40:28 +00:00
|
|
|
__cfg80211_stop_sched_scan(rdev, reqid, true);
|
2014-04-30 13:14:23 +00:00
|
|
|
}
|
2021-01-22 15:19:43 +00:00
|
|
|
EXPORT_SYMBOL(cfg80211_sched_scan_stopped_locked);
|
2014-04-30 13:14:23 +00:00
|
|
|
|
2017-04-28 12:40:28 +00:00
|
|
|
void cfg80211_sched_scan_stopped(struct wiphy *wiphy, u64 reqid)
|
2014-04-30 13:14:23 +00:00
|
|
|
{
|
2021-01-22 15:19:43 +00:00
|
|
|
wiphy_lock(wiphy);
|
|
|
|
cfg80211_sched_scan_stopped_locked(wiphy, reqid);
|
|
|
|
wiphy_unlock(wiphy);
|
2011-05-11 14:09:35 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_sched_scan_stopped);
|
|
|
|
|
2017-04-21 12:05:00 +00:00
|
|
|
int cfg80211_stop_sched_scan_req(struct cfg80211_registered_device *rdev,
|
|
|
|
struct cfg80211_sched_scan_request *req,
|
|
|
|
bool driver_initiated)
|
2011-05-11 14:09:35 +00:00
|
|
|
{
|
2021-01-22 15:19:43 +00:00
|
|
|
lockdep_assert_held(&rdev->wiphy.mtx);
|
2011-05-11 14:09:35 +00:00
|
|
|
|
2011-05-12 13:28:29 +00:00
|
|
|
if (!driver_initiated) {
|
2017-04-21 12:05:02 +00:00
|
|
|
int err = rdev_sched_scan_stop(rdev, req->dev, req->reqid);
|
2011-05-12 13:28:29 +00:00
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
}
|
2011-05-11 14:09:35 +00:00
|
|
|
|
2017-04-21 12:05:00 +00:00
|
|
|
nl80211_send_sched_scan(req, NL80211_CMD_SCHED_SCAN_STOPPED);
|
2011-05-11 14:09:35 +00:00
|
|
|
|
2017-04-21 12:05:00 +00:00
|
|
|
cfg80211_del_sched_scan_req(rdev, req);
|
2011-05-11 14:09:35 +00:00
|
|
|
|
2011-06-29 20:49:33 +00:00
|
|
|
return 0;
|
2011-05-11 14:09:35 +00:00
|
|
|
}
|
|
|
|
|
2017-04-21 12:05:00 +00:00
|
|
|
int __cfg80211_stop_sched_scan(struct cfg80211_registered_device *rdev,
|
|
|
|
u64 reqid, bool driver_initiated)
|
|
|
|
{
|
|
|
|
struct cfg80211_sched_scan_request *sched_scan_req;
|
|
|
|
|
2021-01-22 15:19:43 +00:00
|
|
|
lockdep_assert_held(&rdev->wiphy.mtx);
|
2017-04-21 12:05:00 +00:00
|
|
|
|
|
|
|
sched_scan_req = cfg80211_find_sched_scan_req(rdev, reqid);
|
2017-04-28 12:40:28 +00:00
|
|
|
if (!sched_scan_req)
|
|
|
|
return -ENOENT;
|
2017-04-21 12:05:00 +00:00
|
|
|
|
|
|
|
return cfg80211_stop_sched_scan_req(rdev, sched_scan_req,
|
|
|
|
driver_initiated);
|
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
void cfg80211_bss_age(struct cfg80211_registered_device *rdev,
|
2009-02-11 22:14:43 +00:00
|
|
|
unsigned long age_secs)
|
|
|
|
{
|
|
|
|
struct cfg80211_internal_bss *bss;
|
|
|
|
unsigned long age_jiffies = msecs_to_jiffies(age_secs * MSEC_PER_SEC);
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
|
|
|
list_for_each_entry(bss, &rdev->bss_list, list)
|
2009-02-11 22:14:43 +00:00
|
|
|
bss->ts -= age_jiffies;
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2009-02-11 22:14:43 +00:00
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
void cfg80211_bss_expire(struct cfg80211_registered_device *rdev)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
2014-04-21 04:53:02 +00:00
|
|
|
__cfg80211_bss_expire(rdev, jiffies - IEEE80211_SCAN_RESULT_EXPIRE);
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
|
2020-06-25 11:15:24 +00:00
|
|
|
void cfg80211_bss_flush(struct wiphy *wiphy)
|
|
|
|
{
|
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
|
|
|
|
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
|
|
|
__cfg80211_bss_expire(rdev, jiffies);
|
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_bss_flush);
|
|
|
|
|
2019-02-07 22:26:38 +00:00
|
|
|
const struct element *
|
|
|
|
cfg80211_find_elem_match(u8 eid, const u8 *ies, unsigned int len,
|
|
|
|
const u8 *match, unsigned int match_len,
|
|
|
|
unsigned int match_offset)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
2019-02-07 20:44:41 +00:00
|
|
|
const struct element *elem;
|
|
|
|
|
|
|
|
for_each_element_id(elem, eid, ies, len) {
|
2019-02-07 22:26:38 +00:00
|
|
|
if (elem->datalen >= match_offset + match_len &&
|
|
|
|
!memcmp(elem->data + match_offset, match, match_len))
|
|
|
|
return elem;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
2016-09-15 15:15:09 +00:00
|
|
|
|
|
|
|
return NULL;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
2019-02-07 22:26:38 +00:00
|
|
|
EXPORT_SYMBOL(cfg80211_find_elem_match);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2019-02-07 22:26:38 +00:00
|
|
|
const struct element *cfg80211_find_vendor_elem(unsigned int oui, int oui_type,
|
|
|
|
const u8 *ies,
|
|
|
|
unsigned int len)
|
2011-09-15 08:53:01 +00:00
|
|
|
{
|
2019-02-07 22:26:38 +00:00
|
|
|
const struct element *elem;
|
2016-09-15 15:15:09 +00:00
|
|
|
u8 match[] = { oui >> 16, oui >> 8, oui, oui_type };
|
|
|
|
int match_len = (oui_type < 0) ? 3 : sizeof(match);
|
2011-09-15 08:53:01 +00:00
|
|
|
|
2016-05-03 13:08:07 +00:00
|
|
|
if (WARN_ON(oui_type > 0xff))
|
|
|
|
return NULL;
|
|
|
|
|
2019-02-07 22:26:38 +00:00
|
|
|
elem = cfg80211_find_elem_match(WLAN_EID_VENDOR_SPECIFIC, ies, len,
|
|
|
|
match, match_len, 0);
|
2013-02-12 18:11:38 +00:00
|
|
|
|
2019-02-07 22:26:38 +00:00
|
|
|
if (!elem || elem->datalen < 4)
|
2016-09-15 15:15:09 +00:00
|
|
|
return NULL;
|
2013-02-12 18:11:38 +00:00
|
|
|
|
2019-02-07 22:26:38 +00:00
|
|
|
return elem;
|
2011-09-15 08:53:01 +00:00
|
|
|
}
|
2019-02-07 22:26:38 +00:00
|
|
|
EXPORT_SYMBOL(cfg80211_find_vendor_elem);
|
2011-09-15 08:53:01 +00:00
|
|
|
|
2013-02-01 18:20:03 +00:00
|
|
|
/**
|
|
|
|
* enum bss_compare_mode - BSS compare mode
|
|
|
|
* @BSS_CMP_REGULAR: regular compare mode (for insertion and normal find)
|
|
|
|
* @BSS_CMP_HIDE_ZLEN: find hidden SSID with zero-length mode
|
|
|
|
* @BSS_CMP_HIDE_NUL: find hidden SSID with NUL-ed out mode
|
|
|
|
*/
|
|
|
|
enum bss_compare_mode {
|
|
|
|
BSS_CMP_REGULAR,
|
|
|
|
BSS_CMP_HIDE_ZLEN,
|
|
|
|
BSS_CMP_HIDE_NUL,
|
|
|
|
};
|
|
|
|
|
2011-11-04 16:12:07 +00:00
|
|
|
static int cmp_bss(struct cfg80211_bss *a,
|
2013-01-29 23:26:45 +00:00
|
|
|
struct cfg80211_bss *b,
|
2013-02-01 18:20:03 +00:00
|
|
|
enum bss_compare_mode mode)
|
2011-11-04 16:12:07 +00:00
|
|
|
{
|
2012-11-29 00:25:20 +00:00
|
|
|
const struct cfg80211_bss_ies *a_ies, *b_ies;
|
2013-01-29 23:40:20 +00:00
|
|
|
const u8 *ie1 = NULL;
|
|
|
|
const u8 *ie2 = NULL;
|
2013-01-29 23:26:45 +00:00
|
|
|
int i, r;
|
2011-11-04 16:12:07 +00:00
|
|
|
|
2013-01-29 23:40:20 +00:00
|
|
|
if (a->channel != b->channel)
|
2022-11-11 02:33:04 +00:00
|
|
|
return (b->channel->center_freq * 1000 + b->channel->freq_offset) -
|
|
|
|
(a->channel->center_freq * 1000 + a->channel->freq_offset);
|
2011-11-04 16:12:07 +00:00
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
a_ies = rcu_access_pointer(a->ies);
|
|
|
|
if (!a_ies)
|
|
|
|
return -1;
|
|
|
|
b_ies = rcu_access_pointer(b->ies);
|
|
|
|
if (!b_ies)
|
|
|
|
return 1;
|
|
|
|
|
2013-01-29 23:40:20 +00:00
|
|
|
if (WLAN_CAPABILITY_IS_STA_BSS(a->capability))
|
|
|
|
ie1 = cfg80211_find_ie(WLAN_EID_MESH_ID,
|
|
|
|
a_ies->data, a_ies->len);
|
|
|
|
if (WLAN_CAPABILITY_IS_STA_BSS(b->capability))
|
|
|
|
ie2 = cfg80211_find_ie(WLAN_EID_MESH_ID,
|
|
|
|
b_ies->data, b_ies->len);
|
|
|
|
if (ie1 && ie2) {
|
|
|
|
int mesh_id_cmp;
|
|
|
|
|
|
|
|
if (ie1[1] == ie2[1])
|
|
|
|
mesh_id_cmp = memcmp(ie1 + 2, ie2 + 2, ie1[1]);
|
|
|
|
else
|
|
|
|
mesh_id_cmp = ie2[1] - ie1[1];
|
|
|
|
|
|
|
|
ie1 = cfg80211_find_ie(WLAN_EID_MESH_CONFIG,
|
|
|
|
a_ies->data, a_ies->len);
|
|
|
|
ie2 = cfg80211_find_ie(WLAN_EID_MESH_CONFIG,
|
|
|
|
b_ies->data, b_ies->len);
|
|
|
|
if (ie1 && ie2) {
|
|
|
|
if (mesh_id_cmp)
|
|
|
|
return mesh_id_cmp;
|
|
|
|
if (ie1[1] != ie2[1])
|
|
|
|
return ie2[1] - ie1[1];
|
|
|
|
return memcmp(ie1 + 2, ie2 + 2, ie1[1]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
r = memcmp(a->bssid, b->bssid, sizeof(a->bssid));
|
|
|
|
if (r)
|
|
|
|
return r;
|
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
ie1 = cfg80211_find_ie(WLAN_EID_SSID, a_ies->data, a_ies->len);
|
|
|
|
ie2 = cfg80211_find_ie(WLAN_EID_SSID, b_ies->data, b_ies->len);
|
2011-11-04 16:12:07 +00:00
|
|
|
|
2013-01-29 23:26:45 +00:00
|
|
|
if (!ie1 && !ie2)
|
|
|
|
return 0;
|
|
|
|
|
2012-11-28 21:42:34 +00:00
|
|
|
/*
|
2013-01-29 23:26:45 +00:00
|
|
|
* Note that with "hide_ssid", the function returns a match if
|
|
|
|
* the already-present BSS ("b") is a hidden SSID beacon for
|
|
|
|
* the new BSS ("a").
|
2012-11-28 21:42:34 +00:00
|
|
|
*/
|
2011-11-04 16:12:07 +00:00
|
|
|
|
|
|
|
/* sort missing IE before (left of) present IE */
|
|
|
|
if (!ie1)
|
|
|
|
return -1;
|
|
|
|
if (!ie2)
|
|
|
|
return 1;
|
|
|
|
|
2013-02-01 18:20:03 +00:00
|
|
|
switch (mode) {
|
|
|
|
case BSS_CMP_HIDE_ZLEN:
|
|
|
|
/*
|
|
|
|
* In ZLEN mode we assume the BSS entry we're
|
|
|
|
* looking for has a zero-length SSID. So if
|
|
|
|
* the one we're looking at right now has that,
|
|
|
|
* return 0. Otherwise, return the difference
|
|
|
|
* in length, but since we're looking for the
|
|
|
|
* 0-length it's really equivalent to returning
|
|
|
|
* the length of the one we're looking at.
|
|
|
|
*
|
|
|
|
* No content comparison is needed as we assume
|
|
|
|
* the content length is zero.
|
|
|
|
*/
|
|
|
|
return ie2[1];
|
|
|
|
case BSS_CMP_REGULAR:
|
|
|
|
default:
|
|
|
|
/* sort by length first, then by contents */
|
|
|
|
if (ie1[1] != ie2[1])
|
|
|
|
return ie2[1] - ie1[1];
|
2013-01-29 23:26:45 +00:00
|
|
|
return memcmp(ie1 + 2, ie2 + 2, ie1[1]);
|
2013-02-01 18:20:03 +00:00
|
|
|
case BSS_CMP_HIDE_NUL:
|
|
|
|
if (ie1[1] != ie2[1])
|
|
|
|
return ie2[1] - ie1[1];
|
|
|
|
/* this is equivalent to memcmp(zeroes, ie2 + 2, len) */
|
|
|
|
for (i = 0; i < ie2[1]; i++)
|
|
|
|
if (ie2[i + 2])
|
|
|
|
return -1;
|
|
|
|
return 0;
|
|
|
|
}
|
2011-11-04 16:12:07 +00:00
|
|
|
}
|
|
|
|
|
2015-02-08 13:52:03 +00:00
|
|
|
static bool cfg80211_bss_type_match(u16 capability,
|
2016-04-12 13:56:15 +00:00
|
|
|
enum nl80211_band band,
|
2015-02-08 13:52:03 +00:00
|
|
|
enum ieee80211_bss_type bss_type)
|
|
|
|
{
|
|
|
|
bool ret = true;
|
|
|
|
u16 mask, val;
|
|
|
|
|
|
|
|
if (bss_type == IEEE80211_BSS_TYPE_ANY)
|
|
|
|
return ret;
|
|
|
|
|
2016-04-12 13:56:15 +00:00
|
|
|
if (band == NL80211_BAND_60GHZ) {
|
2015-02-08 13:52:03 +00:00
|
|
|
mask = WLAN_CAPABILITY_DMG_TYPE_MASK;
|
|
|
|
switch (bss_type) {
|
|
|
|
case IEEE80211_BSS_TYPE_ESS:
|
|
|
|
val = WLAN_CAPABILITY_DMG_TYPE_AP;
|
|
|
|
break;
|
|
|
|
case IEEE80211_BSS_TYPE_PBSS:
|
|
|
|
val = WLAN_CAPABILITY_DMG_TYPE_PBSS;
|
|
|
|
break;
|
|
|
|
case IEEE80211_BSS_TYPE_IBSS:
|
|
|
|
val = WLAN_CAPABILITY_DMG_TYPE_IBSS;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
mask = WLAN_CAPABILITY_ESS | WLAN_CAPABILITY_IBSS;
|
|
|
|
switch (bss_type) {
|
|
|
|
case IEEE80211_BSS_TYPE_ESS:
|
|
|
|
val = WLAN_CAPABILITY_ESS;
|
|
|
|
break;
|
|
|
|
case IEEE80211_BSS_TYPE_IBSS:
|
|
|
|
val = WLAN_CAPABILITY_IBSS;
|
|
|
|
break;
|
|
|
|
case IEEE80211_BSS_TYPE_MBSS:
|
|
|
|
val = 0;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = ((capability & mask) == val);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2013-06-19 21:06:27 +00:00
|
|
|
/* Returned bss is reference counted and must be cleaned up appropriately. */
|
2009-02-10 20:25:55 +00:00
|
|
|
struct cfg80211_bss *cfg80211_get_bss(struct wiphy *wiphy,
|
|
|
|
struct ieee80211_channel *channel,
|
|
|
|
const u8 *bssid,
|
2009-02-10 20:25:59 +00:00
|
|
|
const u8 *ssid, size_t ssid_len,
|
2015-02-08 13:52:03 +00:00
|
|
|
enum ieee80211_bss_type bss_type,
|
|
|
|
enum ieee80211_privacy privacy)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
2014-04-21 04:53:03 +00:00
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
2009-02-10 20:25:55 +00:00
|
|
|
struct cfg80211_internal_bss *bss, *res = NULL;
|
2010-07-13 08:55:38 +00:00
|
|
|
unsigned long now = jiffies;
|
2015-02-08 13:52:03 +00:00
|
|
|
int bss_privacy;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2015-02-08 13:52:03 +00:00
|
|
|
trace_cfg80211_get_bss(wiphy, channel, bssid, ssid, ssid_len, bss_type,
|
|
|
|
privacy);
|
2012-08-27 09:49:39 +00:00
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
list_for_each_entry(bss, &rdev->bss_list, list) {
|
2015-02-08 13:52:03 +00:00
|
|
|
if (!cfg80211_bss_type_match(bss->pub.capability,
|
|
|
|
bss->pub.channel->band, bss_type))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
bss_privacy = (bss->pub.capability & WLAN_CAPABILITY_PRIVACY);
|
|
|
|
if ((privacy == IEEE80211_PRIVACY_ON && !bss_privacy) ||
|
|
|
|
(privacy == IEEE80211_PRIVACY_OFF && bss_privacy))
|
2009-02-10 20:25:59 +00:00
|
|
|
continue;
|
2009-02-10 20:25:55 +00:00
|
|
|
if (channel && bss->pub.channel != channel)
|
|
|
|
continue;
|
2014-04-09 20:36:50 +00:00
|
|
|
if (!is_valid_ether_addr(bss->pub.bssid))
|
|
|
|
continue;
|
2010-07-13 08:55:38 +00:00
|
|
|
/* Don't get expired BSS structs */
|
|
|
|
if (time_after(now, bss->ts + IEEE80211_SCAN_RESULT_EXPIRE) &&
|
|
|
|
!atomic_read(&bss->hold))
|
|
|
|
continue;
|
2009-02-10 20:25:55 +00:00
|
|
|
if (is_bss(&bss->pub, bssid, ssid, ssid_len)) {
|
|
|
|
res = bss;
|
2014-04-21 04:53:02 +00:00
|
|
|
bss_ref_get(rdev, res);
|
2009-02-10 20:25:55 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2009-02-10 20:25:55 +00:00
|
|
|
if (!res)
|
|
|
|
return NULL;
|
2012-08-27 09:49:39 +00:00
|
|
|
trace_cfg80211_return_bss(&res->pub);
|
2009-02-10 20:25:55 +00:00
|
|
|
return &res->pub;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_get_bss);
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
static void rb_insert_bss(struct cfg80211_registered_device *rdev,
|
2009-02-10 20:25:55 +00:00
|
|
|
struct cfg80211_internal_bss *bss)
|
|
|
|
{
|
2014-04-21 04:53:02 +00:00
|
|
|
struct rb_node **p = &rdev->bss_tree.rb_node;
|
2009-02-10 20:25:55 +00:00
|
|
|
struct rb_node *parent = NULL;
|
|
|
|
struct cfg80211_internal_bss *tbss;
|
|
|
|
int cmp;
|
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
tbss = rb_entry(parent, struct cfg80211_internal_bss, rbn);
|
|
|
|
|
2013-02-01 18:20:03 +00:00
|
|
|
cmp = cmp_bss(&bss->pub, &tbss->pub, BSS_CMP_REGULAR);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
if (WARN_ON(!cmp)) {
|
|
|
|
/* will sort of leak this BSS */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cmp < 0)
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
else
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
}
|
|
|
|
|
|
|
|
rb_link_node(&bss->rbn, parent, p);
|
2014-04-21 04:53:02 +00:00
|
|
|
rb_insert_color(&bss->rbn, &rdev->bss_tree);
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct cfg80211_internal_bss *
|
2014-04-21 04:53:02 +00:00
|
|
|
rb_find_bss(struct cfg80211_registered_device *rdev,
|
2013-01-29 23:26:45 +00:00
|
|
|
struct cfg80211_internal_bss *res,
|
2013-02-01 18:20:03 +00:00
|
|
|
enum bss_compare_mode mode)
|
2011-11-04 16:12:07 +00:00
|
|
|
{
|
2014-04-21 04:53:02 +00:00
|
|
|
struct rb_node *n = rdev->bss_tree.rb_node;
|
2011-11-04 16:12:07 +00:00
|
|
|
struct cfg80211_internal_bss *bss;
|
|
|
|
int r;
|
|
|
|
|
|
|
|
while (n) {
|
|
|
|
bss = rb_entry(n, struct cfg80211_internal_bss, rbn);
|
2013-02-01 18:20:03 +00:00
|
|
|
r = cmp_bss(&res->pub, &bss->pub, mode);
|
2011-11-04 16:12:07 +00:00
|
|
|
|
|
|
|
if (r == 0)
|
|
|
|
return bss;
|
|
|
|
else if (r < 0)
|
|
|
|
n = n->rb_left;
|
|
|
|
else
|
|
|
|
n = n->rb_right;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
static bool cfg80211_combine_bsses(struct cfg80211_registered_device *rdev,
|
2013-02-01 01:06:18 +00:00
|
|
|
struct cfg80211_internal_bss *new)
|
2011-11-04 16:12:07 +00:00
|
|
|
{
|
2012-11-29 00:25:20 +00:00
|
|
|
const struct cfg80211_bss_ies *ies;
|
2013-02-01 01:06:18 +00:00
|
|
|
struct cfg80211_internal_bss *bss;
|
|
|
|
const u8 *ie;
|
|
|
|
int i, ssidlen;
|
|
|
|
u8 fold = 0;
|
2016-11-15 11:05:11 +00:00
|
|
|
u32 n_entries = 0;
|
2012-11-29 00:25:20 +00:00
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
ies = rcu_access_pointer(new->pub.beacon_ies);
|
2012-11-29 00:25:20 +00:00
|
|
|
if (WARN_ON(!ies))
|
2013-02-01 01:06:18 +00:00
|
|
|
return false;
|
2011-11-04 16:12:07 +00:00
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
ie = cfg80211_find_ie(WLAN_EID_SSID, ies->data, ies->len);
|
|
|
|
if (!ie) {
|
|
|
|
/* nothing to do */
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
ssidlen = ie[1];
|
|
|
|
for (i = 0; i < ssidlen; i++)
|
|
|
|
fold |= ie[2 + i];
|
|
|
|
|
|
|
|
if (fold) {
|
|
|
|
/* not a hidden SSID */
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This is the bad part ... */
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
list_for_each_entry(bss, &rdev->bss_list, list) {
|
2016-11-15 11:05:11 +00:00
|
|
|
/*
|
|
|
|
* we're iterating all the entries anyway, so take the
|
|
|
|
* opportunity to validate the list length accounting
|
|
|
|
*/
|
|
|
|
n_entries++;
|
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
if (!ether_addr_equal(bss->pub.bssid, new->pub.bssid))
|
|
|
|
continue;
|
|
|
|
if (bss->pub.channel != new->pub.channel)
|
|
|
|
continue;
|
2013-07-08 14:55:49 +00:00
|
|
|
if (bss->pub.scan_width != new->pub.scan_width)
|
|
|
|
continue;
|
2013-02-01 01:06:18 +00:00
|
|
|
if (rcu_access_pointer(bss->pub.beacon_ies))
|
|
|
|
continue;
|
|
|
|
ies = rcu_access_pointer(bss->pub.ies);
|
|
|
|
if (!ies)
|
|
|
|
continue;
|
|
|
|
ie = cfg80211_find_ie(WLAN_EID_SSID, ies->data, ies->len);
|
|
|
|
if (!ie)
|
|
|
|
continue;
|
|
|
|
if (ssidlen && ie[1] != ssidlen)
|
|
|
|
continue;
|
|
|
|
if (WARN_ON_ONCE(bss->pub.hidden_beacon_bss))
|
|
|
|
continue;
|
|
|
|
if (WARN_ON_ONCE(!list_empty(&bss->hidden_list)))
|
|
|
|
list_del(&bss->hidden_list);
|
|
|
|
/* combine them */
|
|
|
|
list_add(&bss->hidden_list, &new->hidden_list);
|
|
|
|
bss->pub.hidden_beacon_bss = &new->pub;
|
|
|
|
new->refcount += bss->refcount;
|
|
|
|
rcu_assign_pointer(bss->pub.beacon_ies,
|
|
|
|
new->pub.beacon_ies);
|
|
|
|
}
|
|
|
|
|
2016-11-15 11:05:11 +00:00
|
|
|
WARN_ONCE(n_entries != rdev->bss_entries,
|
|
|
|
"rdev bss entries[%d]/list[len:%d] corruption\n",
|
|
|
|
rdev->bss_entries, n_entries);
|
|
|
|
|
2013-02-01 01:06:18 +00:00
|
|
|
return true;
|
2011-11-04 16:12:07 +00:00
|
|
|
}
|
|
|
|
|
2019-01-22 07:50:50 +00:00
|
|
|
struct cfg80211_non_tx_bss {
|
|
|
|
struct cfg80211_bss *tx_bss;
|
|
|
|
u8 max_bssid_indicator;
|
|
|
|
u8 bssid_index;
|
|
|
|
};
|
|
|
|
|
2022-10-05 21:11:43 +00:00
|
|
|
static void cfg80211_update_hidden_bsses(struct cfg80211_internal_bss *known,
|
|
|
|
const struct cfg80211_bss_ies *new_ies,
|
|
|
|
const struct cfg80211_bss_ies *old_ies)
|
|
|
|
{
|
|
|
|
struct cfg80211_internal_bss *bss;
|
|
|
|
|
|
|
|
/* Assign beacon IEs to all sub entries */
|
|
|
|
list_for_each_entry(bss, &known->hidden_list, hidden_list) {
|
|
|
|
const struct cfg80211_bss_ies *ies;
|
|
|
|
|
|
|
|
ies = rcu_access_pointer(bss->pub.beacon_ies);
|
|
|
|
WARN_ON(ies != old_ies);
|
|
|
|
|
|
|
|
rcu_assign_pointer(bss->pub.beacon_ies, new_ies);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-07-26 16:39:32 +00:00
|
|
|
static bool
|
|
|
|
cfg80211_update_known_bss(struct cfg80211_registered_device *rdev,
|
|
|
|
struct cfg80211_internal_bss *known,
|
|
|
|
struct cfg80211_internal_bss *new,
|
|
|
|
bool signal_valid)
|
|
|
|
{
|
|
|
|
lockdep_assert_held(&rdev->bss_lock);
|
|
|
|
|
|
|
|
/* Update IEs */
|
|
|
|
if (rcu_access_pointer(new->pub.proberesp_ies)) {
|
|
|
|
const struct cfg80211_bss_ies *old;
|
|
|
|
|
|
|
|
old = rcu_access_pointer(known->pub.proberesp_ies);
|
|
|
|
|
|
|
|
rcu_assign_pointer(known->pub.proberesp_ies,
|
|
|
|
new->pub.proberesp_ies);
|
|
|
|
/* Override possible earlier Beacon frame IEs */
|
|
|
|
rcu_assign_pointer(known->pub.ies,
|
|
|
|
new->pub.proberesp_ies);
|
|
|
|
if (old)
|
|
|
|
kfree_rcu((struct cfg80211_bss_ies *)old, rcu_head);
|
|
|
|
} else if (rcu_access_pointer(new->pub.beacon_ies)) {
|
|
|
|
const struct cfg80211_bss_ies *old;
|
|
|
|
|
|
|
|
if (known->pub.hidden_beacon_bss &&
|
|
|
|
!list_empty(&known->hidden_list)) {
|
|
|
|
const struct cfg80211_bss_ies *f;
|
|
|
|
|
|
|
|
/* The known BSS struct is one of the probe
|
|
|
|
* response members of a group, but we're
|
|
|
|
* receiving a beacon (beacon_ies in the new
|
|
|
|
* bss is used). This can only mean that the
|
|
|
|
* AP changed its beacon from not having an
|
|
|
|
* SSID to showing it, which is confusing so
|
|
|
|
* drop this information.
|
|
|
|
*/
|
|
|
|
|
|
|
|
f = rcu_access_pointer(new->pub.beacon_ies);
|
|
|
|
kfree_rcu((struct cfg80211_bss_ies *)f, rcu_head);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
old = rcu_access_pointer(known->pub.beacon_ies);
|
|
|
|
|
|
|
|
rcu_assign_pointer(known->pub.beacon_ies, new->pub.beacon_ies);
|
|
|
|
|
|
|
|
/* Override IEs if they were from a beacon before */
|
|
|
|
if (old == rcu_access_pointer(known->pub.ies))
|
|
|
|
rcu_assign_pointer(known->pub.ies, new->pub.beacon_ies);
|
|
|
|
|
2022-10-13 17:41:51 +00:00
|
|
|
cfg80211_update_hidden_bsses(known,
|
|
|
|
rcu_access_pointer(new->pub.beacon_ies),
|
|
|
|
old);
|
2019-07-26 16:39:32 +00:00
|
|
|
|
|
|
|
if (old)
|
|
|
|
kfree_rcu((struct cfg80211_bss_ies *)old, rcu_head);
|
|
|
|
}
|
|
|
|
|
|
|
|
known->pub.beacon_interval = new->pub.beacon_interval;
|
|
|
|
|
|
|
|
/* don't update the signal if beacon was heard on
|
|
|
|
* adjacent channel.
|
|
|
|
*/
|
|
|
|
if (signal_valid)
|
|
|
|
known->pub.signal = new->pub.signal;
|
|
|
|
known->pub.capability = new->pub.capability;
|
|
|
|
known->ts = new->ts;
|
|
|
|
known->ts_boottime = new->ts_boottime;
|
|
|
|
known->parent_tsf = new->parent_tsf;
|
|
|
|
known->pub.chains = new->pub.chains;
|
|
|
|
memcpy(known->pub.chain_signal, new->pub.chain_signal,
|
|
|
|
IEEE80211_MAX_CHAINS);
|
|
|
|
ether_addr_copy(known->parent_bssid, new->parent_bssid);
|
|
|
|
known->pub.max_bssid_indicator = new->pub.max_bssid_indicator;
|
|
|
|
known->pub.bssid_index = new->pub.bssid_index;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-06-19 21:06:27 +00:00
|
|
|
/* Returned bss is reference counted and must be cleaned up appropriately. */
|
2019-05-01 12:55:24 +00:00
|
|
|
struct cfg80211_internal_bss *
|
2014-04-21 04:53:02 +00:00
|
|
|
cfg80211_bss_update(struct cfg80211_registered_device *rdev,
|
2014-03-04 14:50:13 +00:00
|
|
|
struct cfg80211_internal_bss *tmp,
|
2019-05-01 12:55:24 +00:00
|
|
|
bool signal_valid, unsigned long ts)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
|
|
|
struct cfg80211_internal_bss *found = NULL;
|
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
if (WARN_ON(!tmp->pub.channel))
|
2009-02-10 20:25:55 +00:00
|
|
|
return NULL;
|
|
|
|
|
2019-05-01 12:55:24 +00:00
|
|
|
tmp->ts = ts;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
if (WARN_ON(!rcu_access_pointer(tmp->pub.ies))) {
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2012-11-29 00:25:20 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
found = rb_find_bss(rdev, tmp, BSS_CMP_REGULAR);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2009-04-16 13:00:58 +00:00
|
|
|
if (found) {
|
2019-07-26 16:39:32 +00:00
|
|
|
if (!cfg80211_update_known_bss(rdev, found, tmp, signal_valid))
|
|
|
|
goto drop;
|
2009-02-10 20:25:55 +00:00
|
|
|
} else {
|
2012-11-29 00:25:20 +00:00
|
|
|
struct cfg80211_internal_bss *new;
|
2011-11-04 16:12:07 +00:00
|
|
|
struct cfg80211_internal_bss *hidden;
|
2012-11-29 00:25:20 +00:00
|
|
|
struct cfg80211_bss_ies *ies;
|
2011-11-04 16:12:07 +00:00
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
/*
|
|
|
|
* create a copy -- the "res" variable that is passed in
|
|
|
|
* is allocated on the stack since it's not needed in the
|
|
|
|
* more common case of an update
|
|
|
|
*/
|
2014-04-21 04:53:02 +00:00
|
|
|
new = kzalloc(sizeof(*new) + rdev->wiphy.bss_priv_size,
|
2012-11-29 00:25:20 +00:00
|
|
|
GFP_ATOMIC);
|
|
|
|
if (!new) {
|
|
|
|
ies = (void *)rcu_dereference(tmp->pub.beacon_ies);
|
|
|
|
if (ies)
|
|
|
|
kfree_rcu(ies, rcu_head);
|
|
|
|
ies = (void *)rcu_dereference(tmp->pub.proberesp_ies);
|
|
|
|
if (ies)
|
|
|
|
kfree_rcu(ies, rcu_head);
|
2013-02-01 01:06:18 +00:00
|
|
|
goto drop;
|
2012-11-29 00:25:20 +00:00
|
|
|
}
|
|
|
|
memcpy(new, tmp, sizeof(*new));
|
2013-02-01 01:06:18 +00:00
|
|
|
new->refcount = 1;
|
|
|
|
INIT_LIST_HEAD(&new->hidden_list);
|
2019-01-21 10:25:59 +00:00
|
|
|
INIT_LIST_HEAD(&new->pub.nontrans_list);
|
2022-09-30 21:44:23 +00:00
|
|
|
/* we'll set this later if it was non-NULL */
|
|
|
|
new->pub.transmitted_bss = NULL;
|
2013-02-01 01:06:18 +00:00
|
|
|
|
|
|
|
if (rcu_access_pointer(tmp->pub.proberesp_ies)) {
|
2014-04-21 04:53:02 +00:00
|
|
|
hidden = rb_find_bss(rdev, tmp, BSS_CMP_HIDE_ZLEN);
|
2013-02-01 01:06:18 +00:00
|
|
|
if (!hidden)
|
2014-04-21 04:53:02 +00:00
|
|
|
hidden = rb_find_bss(rdev, tmp,
|
2013-02-01 01:06:18 +00:00
|
|
|
BSS_CMP_HIDE_NUL);
|
|
|
|
if (hidden) {
|
|
|
|
new->pub.hidden_beacon_bss = &hidden->pub;
|
|
|
|
list_add(&new->hidden_list,
|
|
|
|
&hidden->hidden_list);
|
|
|
|
hidden->refcount++;
|
|
|
|
rcu_assign_pointer(new->pub.beacon_ies,
|
|
|
|
hidden->pub.beacon_ies);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Ok so we found a beacon, and don't have an entry. If
|
|
|
|
* it's a beacon with hidden SSID, we might be in for an
|
|
|
|
* expensive search for any probe responses that should
|
|
|
|
* be grouped with this beacon for updates ...
|
|
|
|
*/
|
2014-04-21 04:53:02 +00:00
|
|
|
if (!cfg80211_combine_bsses(rdev, new)) {
|
2021-06-28 13:23:34 +00:00
|
|
|
bss_ref_put(rdev, new);
|
2013-02-01 01:06:18 +00:00
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-11-15 11:05:11 +00:00
|
|
|
if (rdev->bss_entries >= bss_entries_limit &&
|
|
|
|
!cfg80211_bss_expire_oldest(rdev)) {
|
2021-06-28 13:23:34 +00:00
|
|
|
bss_ref_put(rdev, new);
|
2016-11-15 11:05:11 +00:00
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
|
2019-01-21 10:22:21 +00:00
|
|
|
/* This must be before the call to bss_ref_get */
|
2019-01-22 07:50:50 +00:00
|
|
|
if (tmp->pub.transmitted_bss) {
|
|
|
|
new->pub.transmitted_bss = tmp->pub.transmitted_bss;
|
2022-10-17 07:03:48 +00:00
|
|
|
bss_ref_get(rdev, bss_from_pub(tmp->pub.transmitted_bss));
|
2019-01-21 10:22:21 +00:00
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
list_add_tail(&new->list, &rdev->bss_list);
|
2016-11-15 11:05:11 +00:00
|
|
|
rdev->bss_entries++;
|
2014-04-21 04:53:02 +00:00
|
|
|
rb_insert_bss(rdev, new);
|
2012-11-29 00:25:20 +00:00
|
|
|
found = new;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
rdev->bss_generation++;
|
|
|
|
bss_ref_get(rdev, found);
|
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
return found;
|
2013-02-01 01:06:18 +00:00
|
|
|
drop:
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2013-02-01 01:06:18 +00:00
|
|
|
return NULL;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
|
2021-09-30 08:15:33 +00:00
|
|
|
int cfg80211_get_ies_channel_number(const u8 *ie, size_t ielen,
|
2023-03-01 10:09:20 +00:00
|
|
|
enum nl80211_band band)
|
2012-11-23 13:23:30 +00:00
|
|
|
{
|
2021-12-02 12:09:14 +00:00
|
|
|
const struct element *tmp;
|
2012-11-23 13:23:30 +00:00
|
|
|
|
2021-12-02 12:36:10 +00:00
|
|
|
if (band == NL80211_BAND_6GHZ) {
|
|
|
|
struct ieee80211_he_operation *he_oper;
|
|
|
|
|
2021-12-02 12:09:14 +00:00
|
|
|
tmp = cfg80211_find_ext_elem(WLAN_EID_EXT_HE_OPERATION, ie,
|
|
|
|
ielen);
|
|
|
|
if (tmp && tmp->datalen >= sizeof(*he_oper) &&
|
|
|
|
tmp->datalen >= ieee80211_he_oper_size(&tmp->data[1])) {
|
2021-12-02 12:36:10 +00:00
|
|
|
const struct ieee80211_he_6ghz_oper *he_6ghz_oper;
|
|
|
|
|
2021-12-02 12:09:14 +00:00
|
|
|
he_oper = (void *)&tmp->data[1];
|
2021-12-02 12:36:10 +00:00
|
|
|
|
|
|
|
he_6ghz_oper = ieee80211_he_6ghz_oper(he_oper);
|
|
|
|
if (!he_6ghz_oper)
|
2021-12-02 12:09:14 +00:00
|
|
|
return -1;
|
2021-12-02 12:36:10 +00:00
|
|
|
|
2023-03-01 10:09:18 +00:00
|
|
|
return he_6ghz_oper->primary;
|
2021-12-02 12:36:10 +00:00
|
|
|
}
|
|
|
|
} else if (band == NL80211_BAND_S1GHZ) {
|
2021-12-02 12:09:14 +00:00
|
|
|
tmp = cfg80211_find_elem(WLAN_EID_S1G_OPERATION, ie, ielen);
|
|
|
|
if (tmp && tmp->datalen >= sizeof(struct ieee80211_s1g_oper_ie)) {
|
|
|
|
struct ieee80211_s1g_oper_ie *s1gop = (void *)tmp->data;
|
2020-09-22 02:28:07 +00:00
|
|
|
|
2022-04-20 04:13:20 +00:00
|
|
|
return s1gop->oper_ch;
|
2020-09-22 02:28:07 +00:00
|
|
|
}
|
2012-11-23 13:23:30 +00:00
|
|
|
} else {
|
2021-12-02 12:09:14 +00:00
|
|
|
tmp = cfg80211_find_elem(WLAN_EID_DS_PARAMS, ie, ielen);
|
|
|
|
if (tmp && tmp->datalen == 1)
|
|
|
|
return tmp->data[0];
|
2012-11-23 13:23:30 +00:00
|
|
|
|
2021-12-02 12:09:14 +00:00
|
|
|
tmp = cfg80211_find_elem(WLAN_EID_HT_OPERATION, ie, ielen);
|
|
|
|
if (tmp &&
|
|
|
|
tmp->datalen >= sizeof(struct ieee80211_ht_operation)) {
|
|
|
|
struct ieee80211_ht_operation *htop = (void *)tmp->data;
|
|
|
|
|
|
|
|
return htop->primary_chan;
|
2012-11-23 13:23:30 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-12-02 12:09:14 +00:00
|
|
|
return -1;
|
2021-09-30 08:15:33 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_get_ies_channel_number);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Update RX channel information based on the available frame payload
|
|
|
|
* information. This is mainly for the 2.4 GHz band where frames can be received
|
|
|
|
* from neighboring channels and the Beacon frames use the DSSS Parameter Set
|
|
|
|
* element to indicate the current (transmitting) channel, but this might also
|
|
|
|
* be needed on other bands if RX frequency does not match with the actual
|
2021-12-02 12:36:10 +00:00
|
|
|
* operating channel of a BSS, or if the AP reports a different primary channel.
|
2021-09-30 08:15:33 +00:00
|
|
|
*/
|
|
|
|
static struct ieee80211_channel *
|
|
|
|
cfg80211_get_bss_channel(struct wiphy *wiphy, const u8 *ie, size_t ielen,
|
|
|
|
struct ieee80211_channel *channel,
|
2023-03-01 10:09:20 +00:00
|
|
|
enum nl80211_bss_scan_width scan_width)
|
2021-09-30 08:15:33 +00:00
|
|
|
{
|
|
|
|
u32 freq;
|
|
|
|
int channel_number;
|
|
|
|
struct ieee80211_channel *alt_channel;
|
|
|
|
|
2021-12-02 12:36:10 +00:00
|
|
|
channel_number = cfg80211_get_ies_channel_number(ie, ielen,
|
2023-03-01 10:09:20 +00:00
|
|
|
channel->band);
|
2021-09-30 08:15:33 +00:00
|
|
|
|
2018-09-05 15:52:22 +00:00
|
|
|
if (channel_number < 0) {
|
|
|
|
/* No channel information in frame payload */
|
2012-11-23 13:23:30 +00:00
|
|
|
return channel;
|
2018-09-05 15:52:22 +00:00
|
|
|
}
|
2012-11-23 13:23:30 +00:00
|
|
|
|
2020-04-02 01:18:03 +00:00
|
|
|
freq = ieee80211_channel_to_freq_khz(channel_number, channel->band);
|
2021-12-02 12:36:10 +00:00
|
|
|
|
|
|
|
/*
|
2023-03-01 10:09:19 +00:00
|
|
|
* Frame info (beacon/prob res) is the same as received channel,
|
|
|
|
* no need for further processing.
|
2021-12-02 12:36:10 +00:00
|
|
|
*/
|
2023-03-01 10:09:19 +00:00
|
|
|
if (freq == ieee80211_channel_to_khz(channel))
|
2021-12-02 12:36:10 +00:00
|
|
|
return channel;
|
|
|
|
|
2020-04-02 01:18:03 +00:00
|
|
|
alt_channel = ieee80211_get_channel_khz(wiphy, freq);
|
2018-09-05 15:52:22 +00:00
|
|
|
if (!alt_channel) {
|
2023-03-01 10:09:19 +00:00
|
|
|
if (channel->band == NL80211_BAND_2GHZ ||
|
|
|
|
channel->band == NL80211_BAND_6GHZ) {
|
2018-09-05 15:52:22 +00:00
|
|
|
/*
|
|
|
|
* Better not allow unexpected channels when that could
|
|
|
|
* be going beyond the 1-11 range (e.g., discovering
|
|
|
|
* BSS on channel 12 when radio is configured for
|
2023-03-01 10:09:19 +00:00
|
|
|
* channel 11) or beyond the 6 GHz channel range.
|
2018-09-05 15:52:22 +00:00
|
|
|
*/
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* No match for the payload channel number - ignore it */
|
|
|
|
return channel;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (scan_width == NL80211_BSS_CHAN_WIDTH_10 ||
|
|
|
|
scan_width == NL80211_BSS_CHAN_WIDTH_5) {
|
|
|
|
/*
|
|
|
|
* Ignore channel number in 5 and 10 MHz channels where there
|
|
|
|
* may not be an n:1 or 1:n mapping between frequencies and
|
|
|
|
* channel numbers.
|
|
|
|
*/
|
|
|
|
return channel;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Use the channel determined through the payload channel number
|
|
|
|
* instead of the RX channel reported by the driver.
|
|
|
|
*/
|
|
|
|
if (alt_channel->flags & IEEE80211_CHAN_DISABLED)
|
2012-11-23 13:23:30 +00:00
|
|
|
return NULL;
|
2018-09-05 15:52:22 +00:00
|
|
|
return alt_channel;
|
2012-11-23 13:23:30 +00:00
|
|
|
}
|
|
|
|
|
2013-06-19 21:06:27 +00:00
|
|
|
/* Returned bss is reference counted and must be cleaned up appropriately. */
|
2019-01-21 10:14:57 +00:00
|
|
|
static struct cfg80211_bss *
|
|
|
|
cfg80211_inform_single_bss_data(struct wiphy *wiphy,
|
|
|
|
struct cfg80211_inform_bss *data,
|
|
|
|
enum cfg80211_bss_frame_type ftype,
|
|
|
|
const u8 *bssid, u64 tsf, u16 capability,
|
|
|
|
u16 beacon_interval, const u8 *ie, size_t ielen,
|
2019-01-22 07:50:50 +00:00
|
|
|
struct cfg80211_non_tx_bss *non_tx_data,
|
2019-01-21 10:14:57 +00:00
|
|
|
gfp_t gfp)
|
2009-03-26 21:40:09 +00:00
|
|
|
{
|
2019-01-21 10:14:57 +00:00
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
2012-11-29 00:25:20 +00:00
|
|
|
struct cfg80211_bss_ies *ies;
|
2014-03-04 14:50:13 +00:00
|
|
|
struct ieee80211_channel *channel;
|
2019-01-21 10:25:59 +00:00
|
|
|
struct cfg80211_internal_bss tmp = {}, *res;
|
2015-02-08 13:52:03 +00:00
|
|
|
int bss_type;
|
2014-05-18 07:15:24 +00:00
|
|
|
bool signal_valid;
|
2019-07-03 13:38:23 +00:00
|
|
|
unsigned long ts;
|
2009-03-26 21:40:09 +00:00
|
|
|
|
|
|
|
if (WARN_ON(!wiphy))
|
|
|
|
return NULL;
|
|
|
|
|
2010-05-13 05:04:08 +00:00
|
|
|
if (WARN_ON(wiphy->signal_type == CFG80211_SIGNAL_TYPE_UNSPEC &&
|
2015-10-07 09:32:53 +00:00
|
|
|
(data->signal < 0 || data->signal > 100)))
|
2009-03-26 21:40:09 +00:00
|
|
|
return NULL;
|
|
|
|
|
2018-09-05 15:52:22 +00:00
|
|
|
channel = cfg80211_get_bss_channel(wiphy, ie, ielen, data->chan,
|
2023-03-01 10:09:20 +00:00
|
|
|
data->scan_width);
|
2012-11-23 13:23:30 +00:00
|
|
|
if (!channel)
|
|
|
|
return NULL;
|
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
memcpy(tmp.pub.bssid, bssid, ETH_ALEN);
|
|
|
|
tmp.pub.channel = channel;
|
2015-10-07 09:32:53 +00:00
|
|
|
tmp.pub.scan_width = data->scan_width;
|
|
|
|
tmp.pub.signal = data->signal;
|
2012-11-29 00:25:20 +00:00
|
|
|
tmp.pub.beacon_interval = beacon_interval;
|
|
|
|
tmp.pub.capability = capability;
|
2015-10-07 09:32:53 +00:00
|
|
|
tmp.ts_boottime = data->boottime_ns;
|
2020-11-29 15:30:49 +00:00
|
|
|
tmp.parent_tsf = data->parent_tsf;
|
|
|
|
ether_addr_copy(tmp.parent_bssid, data->parent_bssid);
|
|
|
|
|
2019-01-22 07:50:50 +00:00
|
|
|
if (non_tx_data) {
|
|
|
|
tmp.pub.transmitted_bss = non_tx_data->tx_bss;
|
2019-07-03 13:38:23 +00:00
|
|
|
ts = bss_from_pub(non_tx_data->tx_bss)->ts;
|
2019-01-22 07:50:50 +00:00
|
|
|
tmp.pub.bssid_index = non_tx_data->bssid_index;
|
|
|
|
tmp.pub.max_bssid_indicator = non_tx_data->max_bssid_indicator;
|
2019-07-03 13:38:23 +00:00
|
|
|
} else {
|
|
|
|
ts = jiffies;
|
2019-01-22 07:50:50 +00:00
|
|
|
}
|
2015-10-07 09:32:53 +00:00
|
|
|
|
2010-01-06 14:19:24 +00:00
|
|
|
/*
|
2014-08-12 19:01:28 +00:00
|
|
|
* If we do not know here whether the IEs are from a Beacon or Probe
|
2010-01-06 14:19:24 +00:00
|
|
|
* Response frame, we need to pick one of the options and only use it
|
|
|
|
* with the driver that does not provide the full Beacon/Probe Response
|
|
|
|
* frame. Use Beacon frame pointer to avoid indicating that this should
|
2013-01-30 20:33:19 +00:00
|
|
|
* override the IEs pointer should we have received an earlier
|
2012-11-29 00:25:20 +00:00
|
|
|
* indication of Probe Response data.
|
2010-01-06 14:19:24 +00:00
|
|
|
*/
|
2014-08-12 18:34:30 +00:00
|
|
|
ies = kzalloc(sizeof(*ies) + ielen, gfp);
|
2012-11-29 00:25:20 +00:00
|
|
|
if (!ies)
|
|
|
|
return NULL;
|
|
|
|
ies->len = ielen;
|
2013-02-05 15:54:31 +00:00
|
|
|
ies->tsf = tsf;
|
2014-08-12 18:34:30 +00:00
|
|
|
ies->from_beacon = false;
|
2012-11-29 00:25:20 +00:00
|
|
|
memcpy(ies->data, ie, ielen);
|
2009-03-26 21:40:09 +00:00
|
|
|
|
2014-08-12 19:01:28 +00:00
|
|
|
switch (ftype) {
|
|
|
|
case CFG80211_BSS_FTYPE_BEACON:
|
|
|
|
ies->from_beacon = true;
|
2020-08-22 08:23:23 +00:00
|
|
|
fallthrough;
|
2014-08-12 19:01:28 +00:00
|
|
|
case CFG80211_BSS_FTYPE_UNKNOWN:
|
|
|
|
rcu_assign_pointer(tmp.pub.beacon_ies, ies);
|
|
|
|
break;
|
|
|
|
case CFG80211_BSS_FTYPE_PRESP:
|
|
|
|
rcu_assign_pointer(tmp.pub.proberesp_ies, ies);
|
|
|
|
break;
|
|
|
|
}
|
2012-11-29 00:25:20 +00:00
|
|
|
rcu_assign_pointer(tmp.pub.ies, ies);
|
2009-03-26 21:40:09 +00:00
|
|
|
|
2020-02-14 22:23:38 +00:00
|
|
|
signal_valid = data->chan == channel;
|
2019-07-03 13:38:23 +00:00
|
|
|
res = cfg80211_bss_update(wiphy_to_rdev(wiphy), &tmp, signal_valid, ts);
|
2009-03-26 21:40:09 +00:00
|
|
|
if (!res)
|
|
|
|
return NULL;
|
|
|
|
|
2016-04-12 13:56:15 +00:00
|
|
|
if (channel->band == NL80211_BAND_60GHZ) {
|
2015-02-08 13:52:03 +00:00
|
|
|
bss_type = res->pub.capability & WLAN_CAPABILITY_DMG_TYPE_MASK;
|
|
|
|
if (bss_type == WLAN_CAPABILITY_DMG_TYPE_AP ||
|
|
|
|
bss_type == WLAN_CAPABILITY_DMG_TYPE_PBSS)
|
|
|
|
regulatory_hint_found_beacon(wiphy, channel, gfp);
|
|
|
|
} else {
|
|
|
|
if (res->pub.capability & WLAN_CAPABILITY_ESS)
|
|
|
|
regulatory_hint_found_beacon(wiphy, channel, gfp);
|
|
|
|
}
|
2009-03-26 21:40:09 +00:00
|
|
|
|
2019-07-03 13:38:22 +00:00
|
|
|
if (non_tx_data) {
|
2019-01-21 10:14:57 +00:00
|
|
|
/* this is a nontransmitting bss, we need to add it to
|
|
|
|
* transmitting bss' list if it is not there
|
|
|
|
*/
|
2022-04-11 09:07:51 +00:00
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
2019-01-22 07:50:50 +00:00
|
|
|
if (cfg80211_add_nontrans_list(non_tx_data->tx_bss,
|
|
|
|
&res->pub)) {
|
2022-09-30 21:44:23 +00:00
|
|
|
if (__cfg80211_unlink_bss(rdev, res)) {
|
2019-01-21 10:14:57 +00:00
|
|
|
rdev->bss_generation++;
|
2022-09-30 21:44:23 +00:00
|
|
|
res = NULL;
|
|
|
|
}
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
2022-04-11 09:07:51 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2022-09-30 21:44:23 +00:00
|
|
|
|
|
|
|
if (!res)
|
|
|
|
return NULL;
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
|
|
|
|
2012-08-27 09:49:39 +00:00
|
|
|
trace_cfg80211_return_bss(&res->pub);
|
2009-03-26 21:40:09 +00:00
|
|
|
/* cfg80211_bss_update gives us a referenced result */
|
|
|
|
return &res->pub;
|
|
|
|
}
|
|
|
|
|
2019-03-15 15:39:05 +00:00
|
|
|
static const struct element
|
|
|
|
*cfg80211_get_profile_continuation(const u8 *ie, size_t ielen,
|
|
|
|
const struct element *mbssid_elem,
|
|
|
|
const struct element *sub_elem)
|
|
|
|
{
|
|
|
|
const u8 *mbssid_end = mbssid_elem->data + mbssid_elem->datalen;
|
|
|
|
const struct element *next_mbssid;
|
|
|
|
const struct element *next_sub;
|
|
|
|
|
|
|
|
next_mbssid = cfg80211_find_elem(WLAN_EID_MULTIPLE_BSSID,
|
|
|
|
mbssid_end,
|
|
|
|
ielen - (mbssid_end - ie));
|
|
|
|
|
|
|
|
/*
|
2020-08-22 23:19:51 +00:00
|
|
|
* If it is not the last subelement in current MBSSID IE or there isn't
|
2019-03-15 15:39:05 +00:00
|
|
|
* a next MBSSID IE - profile is complete.
|
|
|
|
*/
|
|
|
|
if ((sub_elem->data + sub_elem->datalen < mbssid_end - 1) ||
|
|
|
|
!next_mbssid)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* For any length error, just return NULL */
|
|
|
|
|
|
|
|
if (next_mbssid->datalen < 4)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
next_sub = (void *)&next_mbssid->data[1];
|
|
|
|
|
|
|
|
if (next_mbssid->data + next_mbssid->datalen <
|
|
|
|
next_sub->data + next_sub->datalen)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (next_sub->id != 0 || next_sub->datalen < 2)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if the first element in the next sub element is a start
|
|
|
|
* of a new profile
|
|
|
|
*/
|
|
|
|
return next_sub->data[0] == WLAN_EID_NON_TX_BSSID_CAP ?
|
|
|
|
NULL : next_mbssid;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t cfg80211_merge_profile(const u8 *ie, size_t ielen,
|
|
|
|
const struct element *mbssid_elem,
|
|
|
|
const struct element *sub_elem,
|
2019-04-11 08:59:50 +00:00
|
|
|
u8 *merged_ie, size_t max_copy_len)
|
2019-03-15 15:39:05 +00:00
|
|
|
{
|
|
|
|
size_t copied_len = sub_elem->datalen;
|
|
|
|
const struct element *next_mbssid;
|
|
|
|
|
|
|
|
if (sub_elem->datalen > max_copy_len)
|
|
|
|
return 0;
|
|
|
|
|
2019-04-11 08:59:50 +00:00
|
|
|
memcpy(merged_ie, sub_elem->data, sub_elem->datalen);
|
2019-03-15 15:39:05 +00:00
|
|
|
|
|
|
|
while ((next_mbssid = cfg80211_get_profile_continuation(ie, ielen,
|
|
|
|
mbssid_elem,
|
|
|
|
sub_elem))) {
|
|
|
|
const struct element *next_sub = (void *)&next_mbssid->data[1];
|
|
|
|
|
|
|
|
if (copied_len + next_sub->datalen > max_copy_len)
|
|
|
|
break;
|
2019-04-11 08:59:50 +00:00
|
|
|
memcpy(merged_ie + copied_len, next_sub->data,
|
2019-03-15 15:39:05 +00:00
|
|
|
next_sub->datalen);
|
|
|
|
copied_len += next_sub->datalen;
|
|
|
|
}
|
|
|
|
|
|
|
|
return copied_len;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_merge_profile);
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
static void cfg80211_parse_mbssid_data(struct wiphy *wiphy,
|
|
|
|
struct cfg80211_inform_bss *data,
|
|
|
|
enum cfg80211_bss_frame_type ftype,
|
|
|
|
const u8 *bssid, u64 tsf,
|
|
|
|
u16 beacon_interval, const u8 *ie,
|
|
|
|
size_t ielen,
|
2019-01-22 07:50:50 +00:00
|
|
|
struct cfg80211_non_tx_bss *non_tx_data,
|
2019-01-21 10:14:57 +00:00
|
|
|
gfp_t gfp)
|
|
|
|
{
|
2019-02-07 21:36:33 +00:00
|
|
|
const u8 *mbssid_index_ie;
|
|
|
|
const struct element *elem, *sub;
|
|
|
|
size_t new_ie_len;
|
2019-01-21 10:14:57 +00:00
|
|
|
u8 new_bssid[ETH_ALEN];
|
2019-03-15 15:39:05 +00:00
|
|
|
u8 *new_ie, *profile;
|
|
|
|
u64 seen_indices = 0;
|
2019-01-21 10:14:57 +00:00
|
|
|
u16 capability;
|
|
|
|
struct cfg80211_bss *bss;
|
|
|
|
|
2019-01-22 07:50:50 +00:00
|
|
|
if (!non_tx_data)
|
2019-01-21 10:14:57 +00:00
|
|
|
return;
|
2021-09-30 11:11:30 +00:00
|
|
|
if (!cfg80211_find_elem(WLAN_EID_MULTIPLE_BSSID, ie, ielen))
|
2019-01-21 10:14:57 +00:00
|
|
|
return;
|
2019-01-16 21:02:03 +00:00
|
|
|
if (!wiphy->support_mbssid)
|
|
|
|
return;
|
|
|
|
if (wiphy->support_only_he_mbssid &&
|
2021-09-30 11:11:30 +00:00
|
|
|
!cfg80211_find_ext_elem(WLAN_EID_EXT_HE_CAPABILITY, ie, ielen))
|
2019-01-16 21:02:03 +00:00
|
|
|
return;
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
new_ie = kmalloc(IEEE80211_MAX_DATA_LEN, gfp);
|
|
|
|
if (!new_ie)
|
|
|
|
return;
|
|
|
|
|
2019-03-15 15:39:05 +00:00
|
|
|
profile = kmalloc(ielen, gfp);
|
|
|
|
if (!profile)
|
|
|
|
goto out;
|
|
|
|
|
2019-02-07 21:36:33 +00:00
|
|
|
for_each_element_id(elem, WLAN_EID_MULTIPLE_BSSID, ie, ielen) {
|
|
|
|
if (elem->datalen < 4)
|
|
|
|
continue;
|
2022-09-28 20:01:37 +00:00
|
|
|
if (elem->data[0] < 1 || (int)elem->data[0] > 8)
|
|
|
|
continue;
|
2019-02-07 21:36:33 +00:00
|
|
|
for_each_element(sub, elem->data + 1, elem->datalen - 1) {
|
2019-03-15 15:39:05 +00:00
|
|
|
u8 profile_len;
|
|
|
|
|
2019-02-07 21:36:33 +00:00
|
|
|
if (sub->id != 0 || sub->datalen < 4) {
|
2019-01-21 10:14:57 +00:00
|
|
|
/* not a valid BSS profile */
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2019-02-07 21:36:33 +00:00
|
|
|
if (sub->data[0] != WLAN_EID_NON_TX_BSSID_CAP ||
|
|
|
|
sub->data[1] != 2) {
|
2019-01-21 10:14:57 +00:00
|
|
|
/* The first element within the Nontransmitted
|
|
|
|
* BSSID Profile is not the Nontransmitted
|
|
|
|
* BSSID Capability element.
|
|
|
|
*/
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2019-03-15 15:39:05 +00:00
|
|
|
memset(profile, 0, ielen);
|
|
|
|
profile_len = cfg80211_merge_profile(ie, ielen,
|
|
|
|
elem,
|
|
|
|
sub,
|
2019-04-11 08:59:50 +00:00
|
|
|
profile,
|
2019-03-15 15:39:05 +00:00
|
|
|
ielen);
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
/* found a Nontransmitted BSSID Profile */
|
|
|
|
mbssid_index_ie = cfg80211_find_ie
|
|
|
|
(WLAN_EID_MULTI_BSSID_IDX,
|
2019-03-15 15:39:05 +00:00
|
|
|
profile, profile_len);
|
2019-01-21 10:14:57 +00:00
|
|
|
if (!mbssid_index_ie || mbssid_index_ie[1] < 1 ||
|
2019-03-15 15:39:05 +00:00
|
|
|
mbssid_index_ie[2] == 0 ||
|
|
|
|
mbssid_index_ie[2] > 46) {
|
2019-01-21 10:14:57 +00:00
|
|
|
/* No valid Multiple BSSID-Index element */
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2019-05-29 12:25:29 +00:00
|
|
|
if (seen_indices & BIT_ULL(mbssid_index_ie[2]))
|
2019-03-15 15:39:05 +00:00
|
|
|
/* We don't support legacy split of a profile */
|
|
|
|
net_dbg_ratelimited("Partial info for BSSID index %d\n",
|
|
|
|
mbssid_index_ie[2]);
|
|
|
|
|
2019-05-29 12:25:29 +00:00
|
|
|
seen_indices |= BIT_ULL(mbssid_index_ie[2]);
|
2019-03-15 15:39:05 +00:00
|
|
|
|
2019-01-22 07:50:50 +00:00
|
|
|
non_tx_data->bssid_index = mbssid_index_ie[2];
|
|
|
|
non_tx_data->max_bssid_indicator = elem->data[0];
|
|
|
|
|
|
|
|
cfg80211_gen_new_bssid(bssid,
|
|
|
|
non_tx_data->max_bssid_indicator,
|
|
|
|
non_tx_data->bssid_index,
|
2019-01-21 10:14:57 +00:00
|
|
|
new_bssid);
|
|
|
|
memset(new_ie, 0, IEEE80211_MAX_DATA_LEN);
|
2019-03-15 15:39:05 +00:00
|
|
|
new_ie_len = cfg80211_gen_new_ie(ie, ielen,
|
|
|
|
profile,
|
|
|
|
profile_len, new_ie,
|
2019-01-21 10:14:57 +00:00
|
|
|
gfp);
|
|
|
|
if (!new_ie_len)
|
|
|
|
continue;
|
|
|
|
|
2019-03-15 15:39:05 +00:00
|
|
|
capability = get_unaligned_le16(profile + 2);
|
2019-01-21 10:14:57 +00:00
|
|
|
bss = cfg80211_inform_single_bss_data(wiphy, data,
|
|
|
|
ftype,
|
|
|
|
new_bssid, tsf,
|
|
|
|
capability,
|
|
|
|
beacon_interval,
|
|
|
|
new_ie,
|
|
|
|
new_ie_len,
|
2019-01-22 07:50:50 +00:00
|
|
|
non_tx_data,
|
|
|
|
gfp);
|
2019-01-21 10:14:57 +00:00
|
|
|
if (!bss)
|
|
|
|
break;
|
|
|
|
cfg80211_put_bss(wiphy, bss);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-03-15 15:39:05 +00:00
|
|
|
out:
|
2019-01-21 10:14:57 +00:00
|
|
|
kfree(new_ie);
|
2019-03-15 15:39:05 +00:00
|
|
|
kfree(profile);
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
|
|
|
|
2009-02-10 20:25:55 +00:00
|
|
|
struct cfg80211_bss *
|
2019-01-21 10:14:57 +00:00
|
|
|
cfg80211_inform_bss_data(struct wiphy *wiphy,
|
|
|
|
struct cfg80211_inform_bss *data,
|
|
|
|
enum cfg80211_bss_frame_type ftype,
|
|
|
|
const u8 *bssid, u64 tsf, u16 capability,
|
|
|
|
u16 beacon_interval, const u8 *ie, size_t ielen,
|
|
|
|
gfp_t gfp)
|
|
|
|
{
|
|
|
|
struct cfg80211_bss *res;
|
2019-01-22 07:50:50 +00:00
|
|
|
struct cfg80211_non_tx_bss non_tx_data;
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
res = cfg80211_inform_single_bss_data(wiphy, data, ftype, bssid, tsf,
|
|
|
|
capability, beacon_interval, ie,
|
|
|
|
ielen, NULL, gfp);
|
2019-07-03 13:38:22 +00:00
|
|
|
if (!res)
|
|
|
|
return NULL;
|
2019-01-22 07:50:50 +00:00
|
|
|
non_tx_data.tx_bss = res;
|
2019-01-21 10:14:57 +00:00
|
|
|
cfg80211_parse_mbssid_data(wiphy, data, ftype, bssid, tsf,
|
2019-01-22 07:50:50 +00:00
|
|
|
beacon_interval, ie, ielen, &non_tx_data,
|
|
|
|
gfp);
|
2019-01-21 10:14:57 +00:00
|
|
|
return res;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_inform_bss_data);
|
|
|
|
|
|
|
|
static void
|
|
|
|
cfg80211_parse_mbssid_frame_data(struct wiphy *wiphy,
|
|
|
|
struct cfg80211_inform_bss *data,
|
|
|
|
struct ieee80211_mgmt *mgmt, size_t len,
|
2019-01-22 07:50:50 +00:00
|
|
|
struct cfg80211_non_tx_bss *non_tx_data,
|
2019-01-21 10:14:57 +00:00
|
|
|
gfp_t gfp)
|
|
|
|
{
|
|
|
|
enum cfg80211_bss_frame_type ftype;
|
|
|
|
const u8 *ie = mgmt->u.probe_resp.variable;
|
|
|
|
size_t ielen = len - offsetof(struct ieee80211_mgmt,
|
|
|
|
u.probe_resp.variable);
|
|
|
|
|
|
|
|
ftype = ieee80211_is_beacon(mgmt->frame_control) ?
|
|
|
|
CFG80211_BSS_FTYPE_BEACON : CFG80211_BSS_FTYPE_PRESP;
|
|
|
|
|
|
|
|
cfg80211_parse_mbssid_data(wiphy, data, ftype, mgmt->bssid,
|
|
|
|
le64_to_cpu(mgmt->u.probe_resp.timestamp),
|
|
|
|
le16_to_cpu(mgmt->u.probe_resp.beacon_int),
|
2019-01-22 07:50:50 +00:00
|
|
|
ie, ielen, non_tx_data, gfp);
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
cfg80211_update_notlisted_nontrans(struct wiphy *wiphy,
|
2019-01-21 10:25:59 +00:00
|
|
|
struct cfg80211_bss *nontrans_bss,
|
2019-10-04 12:37:06 +00:00
|
|
|
struct ieee80211_mgmt *mgmt, size_t len)
|
2019-01-21 10:14:57 +00:00
|
|
|
{
|
|
|
|
u8 *ie, *new_ie, *pos;
|
2021-09-30 11:11:32 +00:00
|
|
|
const struct element *nontrans_ssid;
|
|
|
|
const u8 *trans_ssid, *mbssid;
|
2019-01-21 10:14:57 +00:00
|
|
|
size_t ielen = len - offsetof(struct ieee80211_mgmt,
|
|
|
|
u.probe_resp.variable);
|
|
|
|
size_t new_ie_len;
|
|
|
|
struct cfg80211_bss_ies *new_ies;
|
|
|
|
const struct cfg80211_bss_ies *old;
|
2022-09-28 19:56:15 +00:00
|
|
|
size_t cpy_len;
|
2019-01-21 10:14:57 +00:00
|
|
|
|
2019-10-04 12:37:06 +00:00
|
|
|
lockdep_assert_held(&wiphy_to_rdev(wiphy)->bss_lock);
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
ie = mgmt->u.probe_resp.variable;
|
|
|
|
|
|
|
|
new_ie_len = ielen;
|
|
|
|
trans_ssid = cfg80211_find_ie(WLAN_EID_SSID, ie, ielen);
|
|
|
|
if (!trans_ssid)
|
|
|
|
return;
|
|
|
|
new_ie_len -= trans_ssid[1];
|
|
|
|
mbssid = cfg80211_find_ie(WLAN_EID_MULTIPLE_BSSID, ie, ielen);
|
2019-09-20 19:54:18 +00:00
|
|
|
/*
|
|
|
|
* It's not valid to have the MBSSID element before SSID
|
|
|
|
* ignore if that happens - the code below assumes it is
|
|
|
|
* after (while copying things inbetween).
|
|
|
|
*/
|
|
|
|
if (!mbssid || mbssid < trans_ssid)
|
2019-01-21 10:14:57 +00:00
|
|
|
return;
|
|
|
|
new_ie_len -= mbssid[1];
|
2019-10-04 12:37:06 +00:00
|
|
|
|
2021-09-30 11:11:32 +00:00
|
|
|
nontrans_ssid = ieee80211_bss_get_elem(nontrans_bss, WLAN_EID_SSID);
|
2019-10-04 12:37:06 +00:00
|
|
|
if (!nontrans_ssid)
|
2019-01-21 10:14:57 +00:00
|
|
|
return;
|
2019-10-04 12:37:06 +00:00
|
|
|
|
2021-09-30 11:11:32 +00:00
|
|
|
new_ie_len += nontrans_ssid->datalen;
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
/* generate new ie for nontrans BSS
|
|
|
|
* 1. replace SSID with nontrans BSS' SSID
|
|
|
|
* 2. skip MBSSID IE
|
|
|
|
*/
|
2019-10-04 12:37:06 +00:00
|
|
|
new_ie = kzalloc(new_ie_len, GFP_ATOMIC);
|
2019-01-21 10:14:57 +00:00
|
|
|
if (!new_ie)
|
|
|
|
return;
|
2019-10-04 12:37:06 +00:00
|
|
|
|
|
|
|
new_ies = kzalloc(sizeof(*new_ies) + new_ie_len, GFP_ATOMIC);
|
2019-01-30 06:48:21 +00:00
|
|
|
if (!new_ies)
|
|
|
|
goto out_free;
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
pos = new_ie;
|
|
|
|
|
|
|
|
/* copy the nontransmitted SSID */
|
2021-09-30 11:11:32 +00:00
|
|
|
cpy_len = nontrans_ssid->datalen + 2;
|
2019-01-21 10:14:57 +00:00
|
|
|
memcpy(pos, nontrans_ssid, cpy_len);
|
|
|
|
pos += cpy_len;
|
|
|
|
/* copy the IEs between SSID and MBSSID */
|
|
|
|
cpy_len = trans_ssid[1] + 2;
|
|
|
|
memcpy(pos, (trans_ssid + cpy_len), (mbssid - (trans_ssid + cpy_len)));
|
|
|
|
pos += (mbssid - (trans_ssid + cpy_len));
|
|
|
|
/* copy the IEs after MBSSID */
|
|
|
|
cpy_len = mbssid[1] + 2;
|
|
|
|
memcpy(pos, mbssid + cpy_len, ((ie + ielen) - (mbssid + cpy_len)));
|
|
|
|
|
|
|
|
/* update ie */
|
|
|
|
new_ies->len = new_ie_len;
|
|
|
|
new_ies->tsf = le64_to_cpu(mgmt->u.probe_resp.timestamp);
|
|
|
|
new_ies->from_beacon = ieee80211_is_beacon(mgmt->frame_control);
|
|
|
|
memcpy(new_ies->data, new_ie, new_ie_len);
|
|
|
|
if (ieee80211_is_probe_resp(mgmt->frame_control)) {
|
2019-01-21 10:25:59 +00:00
|
|
|
old = rcu_access_pointer(nontrans_bss->proberesp_ies);
|
|
|
|
rcu_assign_pointer(nontrans_bss->proberesp_ies, new_ies);
|
|
|
|
rcu_assign_pointer(nontrans_bss->ies, new_ies);
|
2019-01-21 10:14:57 +00:00
|
|
|
if (old)
|
|
|
|
kfree_rcu((struct cfg80211_bss_ies *)old, rcu_head);
|
|
|
|
} else {
|
2019-01-21 10:25:59 +00:00
|
|
|
old = rcu_access_pointer(nontrans_bss->beacon_ies);
|
|
|
|
rcu_assign_pointer(nontrans_bss->beacon_ies, new_ies);
|
2022-10-05 21:11:43 +00:00
|
|
|
cfg80211_update_hidden_bsses(bss_from_pub(nontrans_bss),
|
|
|
|
new_ies, old);
|
2019-01-21 10:25:59 +00:00
|
|
|
rcu_assign_pointer(nontrans_bss->ies, new_ies);
|
2019-01-21 10:14:57 +00:00
|
|
|
if (old)
|
|
|
|
kfree_rcu((struct cfg80211_bss_ies *)old, rcu_head);
|
|
|
|
}
|
2019-01-30 06:48:21 +00:00
|
|
|
|
|
|
|
out_free:
|
|
|
|
kfree(new_ie);
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
2015-10-07 09:32:53 +00:00
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
/* cfg80211_inform_bss_width_frame helper */
|
|
|
|
static struct cfg80211_bss *
|
|
|
|
cfg80211_inform_single_bss_frame_data(struct wiphy *wiphy,
|
|
|
|
struct cfg80211_inform_bss *data,
|
|
|
|
struct ieee80211_mgmt *mgmt, size_t len,
|
|
|
|
gfp_t gfp)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
2012-11-29 00:25:20 +00:00
|
|
|
struct cfg80211_internal_bss tmp = {}, *res;
|
|
|
|
struct cfg80211_bss_ies *ies;
|
2014-03-04 14:50:13 +00:00
|
|
|
struct ieee80211_channel *channel;
|
2014-05-18 07:15:24 +00:00
|
|
|
bool signal_valid;
|
2020-09-22 02:28:06 +00:00
|
|
|
struct ieee80211_ext *ext = NULL;
|
|
|
|
u8 *bssid, *variable;
|
|
|
|
u16 capability, beacon_int;
|
|
|
|
size_t ielen, min_hdr_len = offsetof(struct ieee80211_mgmt,
|
|
|
|
u.probe_resp.variable);
|
2015-02-08 13:52:03 +00:00
|
|
|
int bss_type;
|
2011-03-26 18:26:55 +00:00
|
|
|
|
2012-11-23 13:23:30 +00:00
|
|
|
BUILD_BUG_ON(offsetof(struct ieee80211_mgmt, u.probe_resp.variable) !=
|
|
|
|
offsetof(struct ieee80211_mgmt, u.beacon.variable));
|
|
|
|
|
2015-10-07 09:32:53 +00:00
|
|
|
trace_cfg80211_inform_bss_frame(wiphy, data, mgmt, len);
|
2012-08-27 09:49:39 +00:00
|
|
|
|
2011-03-26 18:26:55 +00:00
|
|
|
if (WARN_ON(!mgmt))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (WARN_ON(!wiphy))
|
|
|
|
return NULL;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2010-05-13 05:04:08 +00:00
|
|
|
if (WARN_ON(wiphy->signal_type == CFG80211_SIGNAL_TYPE_UNSPEC &&
|
2015-10-07 09:32:53 +00:00
|
|
|
(data->signal < 0 || data->signal > 100)))
|
2009-02-10 20:25:55 +00:00
|
|
|
return NULL;
|
|
|
|
|
2020-09-22 02:28:06 +00:00
|
|
|
if (ieee80211_is_s1g_beacon(mgmt->frame_control)) {
|
|
|
|
ext = (void *) mgmt;
|
|
|
|
min_hdr_len = offsetof(struct ieee80211_ext, u.s1g_beacon);
|
|
|
|
if (ieee80211_is_s1g_short_beacon(mgmt->frame_control))
|
|
|
|
min_hdr_len = offsetof(struct ieee80211_ext,
|
|
|
|
u.s1g_short_beacon.variable);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (WARN_ON(len < min_hdr_len))
|
2009-02-10 20:25:55 +00:00
|
|
|
return NULL;
|
|
|
|
|
2020-09-22 02:28:06 +00:00
|
|
|
ielen = len - min_hdr_len;
|
|
|
|
variable = mgmt->u.probe_resp.variable;
|
|
|
|
if (ext) {
|
|
|
|
if (ieee80211_is_s1g_short_beacon(mgmt->frame_control))
|
|
|
|
variable = ext->u.s1g_short_beacon.variable;
|
|
|
|
else
|
|
|
|
variable = ext->u.s1g_beacon.variable;
|
|
|
|
}
|
|
|
|
|
|
|
|
channel = cfg80211_get_bss_channel(wiphy, variable,
|
2023-03-01 10:09:20 +00:00
|
|
|
ielen, data->chan, data->scan_width);
|
2012-11-23 13:23:30 +00:00
|
|
|
if (!channel)
|
|
|
|
return NULL;
|
|
|
|
|
2020-09-22 02:28:06 +00:00
|
|
|
if (ext) {
|
2021-04-08 12:28:27 +00:00
|
|
|
const struct ieee80211_s1g_bcn_compat_ie *compat;
|
|
|
|
const struct element *elem;
|
2020-09-22 02:28:06 +00:00
|
|
|
|
2021-04-08 12:28:27 +00:00
|
|
|
elem = cfg80211_find_elem(WLAN_EID_S1G_BCN_COMPAT,
|
|
|
|
variable, ielen);
|
|
|
|
if (!elem)
|
|
|
|
return NULL;
|
|
|
|
if (elem->datalen < sizeof(*compat))
|
2020-09-22 02:28:06 +00:00
|
|
|
return NULL;
|
2021-04-08 12:28:27 +00:00
|
|
|
compat = (void *)elem->data;
|
2020-09-22 02:28:06 +00:00
|
|
|
bssid = ext->u.s1g_beacon.sa;
|
|
|
|
capability = le16_to_cpu(compat->compat_info);
|
|
|
|
beacon_int = le16_to_cpu(compat->beacon_int);
|
|
|
|
} else {
|
|
|
|
bssid = mgmt->bssid;
|
|
|
|
beacon_int = le16_to_cpu(mgmt->u.probe_resp.beacon_int);
|
|
|
|
capability = le16_to_cpu(mgmt->u.probe_resp.capab_info);
|
|
|
|
}
|
|
|
|
|
2014-08-12 18:34:30 +00:00
|
|
|
ies = kzalloc(sizeof(*ies) + ielen, gfp);
|
2012-11-29 00:25:20 +00:00
|
|
|
if (!ies)
|
2009-02-10 20:25:55 +00:00
|
|
|
return NULL;
|
2012-11-29 00:25:20 +00:00
|
|
|
ies->len = ielen;
|
2013-02-05 15:54:31 +00:00
|
|
|
ies->tsf = le64_to_cpu(mgmt->u.probe_resp.timestamp);
|
2020-09-22 02:28:06 +00:00
|
|
|
ies->from_beacon = ieee80211_is_beacon(mgmt->frame_control) ||
|
|
|
|
ieee80211_is_s1g_beacon(mgmt->frame_control);
|
|
|
|
memcpy(ies->data, variable, ielen);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
if (ieee80211_is_probe_resp(mgmt->frame_control))
|
|
|
|
rcu_assign_pointer(tmp.pub.proberesp_ies, ies);
|
|
|
|
else
|
|
|
|
rcu_assign_pointer(tmp.pub.beacon_ies, ies);
|
|
|
|
rcu_assign_pointer(tmp.pub.ies, ies);
|
2016-12-16 11:21:54 +00:00
|
|
|
|
2020-09-22 02:28:06 +00:00
|
|
|
memcpy(tmp.pub.bssid, bssid, ETH_ALEN);
|
|
|
|
tmp.pub.beacon_interval = beacon_int;
|
|
|
|
tmp.pub.capability = capability;
|
2012-11-29 00:25:20 +00:00
|
|
|
tmp.pub.channel = channel;
|
2015-10-07 09:32:53 +00:00
|
|
|
tmp.pub.scan_width = data->scan_width;
|
|
|
|
tmp.pub.signal = data->signal;
|
|
|
|
tmp.ts_boottime = data->boottime_ns;
|
2016-07-05 14:10:13 +00:00
|
|
|
tmp.parent_tsf = data->parent_tsf;
|
2017-12-13 17:51:36 +00:00
|
|
|
tmp.pub.chains = data->chains;
|
|
|
|
memcpy(tmp.pub.chain_signal, data->chain_signal, IEEE80211_MAX_CHAINS);
|
2016-07-05 14:10:13 +00:00
|
|
|
ether_addr_copy(tmp.parent_bssid, data->parent_bssid);
|
2012-11-29 00:25:20 +00:00
|
|
|
|
2020-02-14 22:23:38 +00:00
|
|
|
signal_valid = data->chan == channel;
|
2019-05-01 12:55:24 +00:00
|
|
|
res = cfg80211_bss_update(wiphy_to_rdev(wiphy), &tmp, signal_valid,
|
|
|
|
jiffies);
|
2009-02-10 20:25:55 +00:00
|
|
|
if (!res)
|
|
|
|
return NULL;
|
|
|
|
|
2016-04-12 13:56:15 +00:00
|
|
|
if (channel->band == NL80211_BAND_60GHZ) {
|
2015-02-08 13:52:03 +00:00
|
|
|
bss_type = res->pub.capability & WLAN_CAPABILITY_DMG_TYPE_MASK;
|
|
|
|
if (bss_type == WLAN_CAPABILITY_DMG_TYPE_AP ||
|
|
|
|
bss_type == WLAN_CAPABILITY_DMG_TYPE_PBSS)
|
|
|
|
regulatory_hint_found_beacon(wiphy, channel, gfp);
|
|
|
|
} else {
|
|
|
|
if (res->pub.capability & WLAN_CAPABILITY_ESS)
|
|
|
|
regulatory_hint_found_beacon(wiphy, channel, gfp);
|
|
|
|
}
|
2009-02-21 05:20:39 +00:00
|
|
|
|
2012-08-27 09:49:39 +00:00
|
|
|
trace_cfg80211_return_bss(&res->pub);
|
2009-02-10 20:25:55 +00:00
|
|
|
/* cfg80211_bss_update gives us a referenced result */
|
|
|
|
return &res->pub;
|
|
|
|
}
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
struct cfg80211_bss *
|
|
|
|
cfg80211_inform_bss_frame_data(struct wiphy *wiphy,
|
|
|
|
struct cfg80211_inform_bss *data,
|
|
|
|
struct ieee80211_mgmt *mgmt, size_t len,
|
|
|
|
gfp_t gfp)
|
|
|
|
{
|
2019-01-21 10:25:59 +00:00
|
|
|
struct cfg80211_bss *res, *tmp_bss;
|
2019-01-21 10:14:57 +00:00
|
|
|
const u8 *ie = mgmt->u.probe_resp.variable;
|
|
|
|
const struct cfg80211_bss_ies *ies1, *ies2;
|
|
|
|
size_t ielen = len - offsetof(struct ieee80211_mgmt,
|
|
|
|
u.probe_resp.variable);
|
2022-11-25 11:36:58 +00:00
|
|
|
struct cfg80211_non_tx_bss non_tx_data = {};
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
res = cfg80211_inform_single_bss_frame_data(wiphy, data, mgmt,
|
2019-07-03 13:38:21 +00:00
|
|
|
len, gfp);
|
2022-11-25 11:36:58 +00:00
|
|
|
|
|
|
|
/* don't do any further MBSSID handling for S1G */
|
|
|
|
if (ieee80211_is_s1g_beacon(mgmt->frame_control))
|
|
|
|
return res;
|
|
|
|
|
2019-01-16 21:02:03 +00:00
|
|
|
if (!res || !wiphy->support_mbssid ||
|
2021-09-30 11:11:30 +00:00
|
|
|
!cfg80211_find_elem(WLAN_EID_MULTIPLE_BSSID, ie, ielen))
|
2019-01-16 21:02:03 +00:00
|
|
|
return res;
|
|
|
|
if (wiphy->support_only_he_mbssid &&
|
2021-09-30 11:11:30 +00:00
|
|
|
!cfg80211_find_ext_elem(WLAN_EID_EXT_HE_CAPABILITY, ie, ielen))
|
2019-01-21 10:14:57 +00:00
|
|
|
return res;
|
|
|
|
|
2019-01-22 07:50:50 +00:00
|
|
|
non_tx_data.tx_bss = res;
|
2019-01-21 10:14:57 +00:00
|
|
|
/* process each non-transmitting bss */
|
2019-01-22 07:50:50 +00:00
|
|
|
cfg80211_parse_mbssid_frame_data(wiphy, data, mgmt, len,
|
|
|
|
&non_tx_data, gfp);
|
2019-01-21 10:14:57 +00:00
|
|
|
|
2019-10-04 12:37:06 +00:00
|
|
|
spin_lock_bh(&wiphy_to_rdev(wiphy)->bss_lock);
|
|
|
|
|
2019-01-21 10:14:57 +00:00
|
|
|
/* check if the res has other nontransmitting bss which is not
|
|
|
|
* in MBSSID IE
|
|
|
|
*/
|
|
|
|
ies1 = rcu_access_pointer(res->ies);
|
|
|
|
|
|
|
|
/* go through nontrans_list, if the timestamp of the BSS is
|
|
|
|
* earlier than the timestamp of the transmitting BSS then
|
|
|
|
* update it
|
|
|
|
*/
|
2019-01-21 10:25:59 +00:00
|
|
|
list_for_each_entry(tmp_bss, &res->nontrans_list,
|
2019-01-21 10:14:57 +00:00
|
|
|
nontrans_list) {
|
2019-01-21 10:25:59 +00:00
|
|
|
ies2 = rcu_access_pointer(tmp_bss->ies);
|
2019-01-21 10:14:57 +00:00
|
|
|
if (ies2->tsf < ies1->tsf)
|
|
|
|
cfg80211_update_notlisted_nontrans(wiphy, tmp_bss,
|
2019-10-04 12:37:06 +00:00
|
|
|
mgmt, len);
|
2019-01-21 10:14:57 +00:00
|
|
|
}
|
2019-10-04 12:37:06 +00:00
|
|
|
spin_unlock_bh(&wiphy_to_rdev(wiphy)->bss_lock);
|
2019-01-21 10:14:57 +00:00
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
2015-10-07 09:32:53 +00:00
|
|
|
EXPORT_SYMBOL(cfg80211_inform_bss_frame_data);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2013-02-01 00:49:58 +00:00
|
|
|
void cfg80211_ref_bss(struct wiphy *wiphy, struct cfg80211_bss *pub)
|
2012-01-20 12:55:26 +00:00
|
|
|
{
|
2014-04-21 04:53:03 +00:00
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
2012-01-20 12:55:26 +00:00
|
|
|
|
|
|
|
if (!pub)
|
|
|
|
return;
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
2022-10-17 07:03:48 +00:00
|
|
|
bss_ref_get(rdev, bss_from_pub(pub));
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2012-01-20 12:55:26 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_ref_bss);
|
|
|
|
|
2013-02-01 00:49:58 +00:00
|
|
|
void cfg80211_put_bss(struct wiphy *wiphy, struct cfg80211_bss *pub)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
2014-04-21 04:53:03 +00:00
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
if (!pub)
|
|
|
|
return;
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
2022-10-17 07:03:48 +00:00
|
|
|
bss_ref_put(rdev, bss_from_pub(pub));
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_put_bss);
|
|
|
|
|
2009-02-10 20:25:58 +00:00
|
|
|
void cfg80211_unlink_bss(struct wiphy *wiphy, struct cfg80211_bss *pub)
|
|
|
|
{
|
2014-04-21 04:53:03 +00:00
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
2019-01-21 10:25:59 +00:00
|
|
|
struct cfg80211_internal_bss *bss, *tmp1;
|
|
|
|
struct cfg80211_bss *nontrans_bss, *tmp;
|
2009-02-10 20:25:58 +00:00
|
|
|
|
|
|
|
if (WARN_ON(!pub))
|
|
|
|
return;
|
|
|
|
|
2022-10-17 07:03:48 +00:00
|
|
|
bss = bss_from_pub(pub);
|
2009-02-10 20:25:58 +00:00
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
2019-01-21 10:25:59 +00:00
|
|
|
if (list_empty(&bss->list))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(nontrans_bss, tmp,
|
|
|
|
&pub->nontrans_list,
|
|
|
|
nontrans_list) {
|
2022-10-17 07:03:48 +00:00
|
|
|
tmp1 = bss_from_pub(nontrans_bss);
|
2019-01-21 10:25:59 +00:00
|
|
|
if (__cfg80211_unlink_bss(rdev, tmp1))
|
2014-04-21 04:53:02 +00:00
|
|
|
rdev->bss_generation++;
|
2010-10-06 19:18:04 +00:00
|
|
|
}
|
2019-01-21 10:25:59 +00:00
|
|
|
|
|
|
|
if (__cfg80211_unlink_bss(rdev, bss))
|
|
|
|
rdev->bss_generation++;
|
|
|
|
out:
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2009-02-10 20:25:58 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_unlink_bss);
|
|
|
|
|
2019-05-29 12:25:32 +00:00
|
|
|
void cfg80211_bss_iter(struct wiphy *wiphy,
|
|
|
|
struct cfg80211_chan_def *chandef,
|
|
|
|
void (*iter)(struct wiphy *wiphy,
|
|
|
|
struct cfg80211_bss *bss,
|
|
|
|
void *data),
|
|
|
|
void *iter_data)
|
|
|
|
{
|
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
|
|
|
struct cfg80211_internal_bss *bss;
|
|
|
|
|
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
|
|
|
|
|
|
|
list_for_each_entry(bss, &rdev->bss_list, list) {
|
2022-04-14 14:50:57 +00:00
|
|
|
if (!chandef || cfg80211_is_sub_chan(chandef, bss->pub.channel,
|
|
|
|
false))
|
2019-05-29 12:25:32 +00:00
|
|
|
iter(wiphy, &bss->pub, iter_data);
|
|
|
|
}
|
|
|
|
|
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(cfg80211_bss_iter);
|
|
|
|
|
cfg80211: fix duplicated scan entries after channel switch
When associated BSS completes channel switch procedure, its channel
record needs to be updated. The existing mac80211 solution was
extended to cfg80211 in commit 5dc8cdce1d72 ("mac80211/cfg80211:
update bss channel on channel switch").
However that solution still appears to be incomplete as it may lead
to duplicated scan entries for associated BSS after channel switch.
The root cause of the problem is as follows. Each BSS entry is
included into the following data structures:
- bss list rdev->bss_list
- bss search tree rdev->bss_tree
Updating BSS channel record without rebuilding bss_tree may break
tree search since cmp_bss considers all of the following: channel,
bssid, ssid. When BSS channel is updated, but its location in bss_tree
is not updated, then subsequent search operations may fail to locate
this BSS since they will be traversing bss_tree in wrong direction.
As a result, for scan performed after associated BSS channel switch,
cfg80211_bss_update may add the second entry for the same BSS to both
bss_list and bss_tree, rather then update the existing one.
To summarize, if BSS channel needs to be updated, then bss_tree should
be rebuilt in order to put updated BSS entry into a proper location.
This commit suggests the following straightforward solution:
- if new entry has been already created for BSS after channel switch,
then use its IEs to update known BSS entry and then remove new
entry completely
- use rb_erase/rb_insert_bss reinstall updated BSS in bss_tree
- for nontransmit BSS entry, the whole transmit BSS hierarchy
is updated
Signed-off-by: Sergey Matyukevich <sergey.matyukevich.os@quantenna.com>
Link: https://lore.kernel.org/r/20190726163922.27509-3-sergey.matyukevich.os@quantenna.com
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2019-07-26 16:39:34 +00:00
|
|
|
void cfg80211_update_assoc_bss_entry(struct wireless_dev *wdev,
|
2022-04-14 14:50:57 +00:00
|
|
|
unsigned int link_id,
|
cfg80211: fix duplicated scan entries after channel switch
When associated BSS completes channel switch procedure, its channel
record needs to be updated. The existing mac80211 solution was
extended to cfg80211 in commit 5dc8cdce1d72 ("mac80211/cfg80211:
update bss channel on channel switch").
However that solution still appears to be incomplete as it may lead
to duplicated scan entries for associated BSS after channel switch.
The root cause of the problem is as follows. Each BSS entry is
included into the following data structures:
- bss list rdev->bss_list
- bss search tree rdev->bss_tree
Updating BSS channel record without rebuilding bss_tree may break
tree search since cmp_bss considers all of the following: channel,
bssid, ssid. When BSS channel is updated, but its location in bss_tree
is not updated, then subsequent search operations may fail to locate
this BSS since they will be traversing bss_tree in wrong direction.
As a result, for scan performed after associated BSS channel switch,
cfg80211_bss_update may add the second entry for the same BSS to both
bss_list and bss_tree, rather then update the existing one.
To summarize, if BSS channel needs to be updated, then bss_tree should
be rebuilt in order to put updated BSS entry into a proper location.
This commit suggests the following straightforward solution:
- if new entry has been already created for BSS after channel switch,
then use its IEs to update known BSS entry and then remove new
entry completely
- use rb_erase/rb_insert_bss reinstall updated BSS in bss_tree
- for nontransmit BSS entry, the whole transmit BSS hierarchy
is updated
Signed-off-by: Sergey Matyukevich <sergey.matyukevich.os@quantenna.com>
Link: https://lore.kernel.org/r/20190726163922.27509-3-sergey.matyukevich.os@quantenna.com
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2019-07-26 16:39:34 +00:00
|
|
|
struct ieee80211_channel *chan)
|
|
|
|
{
|
|
|
|
struct wiphy *wiphy = wdev->wiphy;
|
|
|
|
struct cfg80211_registered_device *rdev = wiphy_to_rdev(wiphy);
|
2022-04-14 14:50:57 +00:00
|
|
|
struct cfg80211_internal_bss *cbss = wdev->links[link_id].client.current_bss;
|
cfg80211: fix duplicated scan entries after channel switch
When associated BSS completes channel switch procedure, its channel
record needs to be updated. The existing mac80211 solution was
extended to cfg80211 in commit 5dc8cdce1d72 ("mac80211/cfg80211:
update bss channel on channel switch").
However that solution still appears to be incomplete as it may lead
to duplicated scan entries for associated BSS after channel switch.
The root cause of the problem is as follows. Each BSS entry is
included into the following data structures:
- bss list rdev->bss_list
- bss search tree rdev->bss_tree
Updating BSS channel record without rebuilding bss_tree may break
tree search since cmp_bss considers all of the following: channel,
bssid, ssid. When BSS channel is updated, but its location in bss_tree
is not updated, then subsequent search operations may fail to locate
this BSS since they will be traversing bss_tree in wrong direction.
As a result, for scan performed after associated BSS channel switch,
cfg80211_bss_update may add the second entry for the same BSS to both
bss_list and bss_tree, rather then update the existing one.
To summarize, if BSS channel needs to be updated, then bss_tree should
be rebuilt in order to put updated BSS entry into a proper location.
This commit suggests the following straightforward solution:
- if new entry has been already created for BSS after channel switch,
then use its IEs to update known BSS entry and then remove new
entry completely
- use rb_erase/rb_insert_bss reinstall updated BSS in bss_tree
- for nontransmit BSS entry, the whole transmit BSS hierarchy
is updated
Signed-off-by: Sergey Matyukevich <sergey.matyukevich.os@quantenna.com>
Link: https://lore.kernel.org/r/20190726163922.27509-3-sergey.matyukevich.os@quantenna.com
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2019-07-26 16:39:34 +00:00
|
|
|
struct cfg80211_internal_bss *new = NULL;
|
|
|
|
struct cfg80211_internal_bss *bss;
|
|
|
|
struct cfg80211_bss *nontrans_bss;
|
|
|
|
struct cfg80211_bss *tmp;
|
|
|
|
|
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
|
|
|
|
2020-03-26 13:09:43 +00:00
|
|
|
/*
|
|
|
|
* Some APs use CSA also for bandwidth changes, i.e., without actually
|
|
|
|
* changing the control channel, so no need to update in such a case.
|
|
|
|
*/
|
|
|
|
if (cbss->pub.channel == chan)
|
cfg80211: fix duplicated scan entries after channel switch
When associated BSS completes channel switch procedure, its channel
record needs to be updated. The existing mac80211 solution was
extended to cfg80211 in commit 5dc8cdce1d72 ("mac80211/cfg80211:
update bss channel on channel switch").
However that solution still appears to be incomplete as it may lead
to duplicated scan entries for associated BSS after channel switch.
The root cause of the problem is as follows. Each BSS entry is
included into the following data structures:
- bss list rdev->bss_list
- bss search tree rdev->bss_tree
Updating BSS channel record without rebuilding bss_tree may break
tree search since cmp_bss considers all of the following: channel,
bssid, ssid. When BSS channel is updated, but its location in bss_tree
is not updated, then subsequent search operations may fail to locate
this BSS since they will be traversing bss_tree in wrong direction.
As a result, for scan performed after associated BSS channel switch,
cfg80211_bss_update may add the second entry for the same BSS to both
bss_list and bss_tree, rather then update the existing one.
To summarize, if BSS channel needs to be updated, then bss_tree should
be rebuilt in order to put updated BSS entry into a proper location.
This commit suggests the following straightforward solution:
- if new entry has been already created for BSS after channel switch,
then use its IEs to update known BSS entry and then remove new
entry completely
- use rb_erase/rb_insert_bss reinstall updated BSS in bss_tree
- for nontransmit BSS entry, the whole transmit BSS hierarchy
is updated
Signed-off-by: Sergey Matyukevich <sergey.matyukevich.os@quantenna.com>
Link: https://lore.kernel.org/r/20190726163922.27509-3-sergey.matyukevich.os@quantenna.com
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2019-07-26 16:39:34 +00:00
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* use transmitting bss */
|
|
|
|
if (cbss->pub.transmitted_bss)
|
2022-10-17 07:03:48 +00:00
|
|
|
cbss = bss_from_pub(cbss->pub.transmitted_bss);
|
cfg80211: fix duplicated scan entries after channel switch
When associated BSS completes channel switch procedure, its channel
record needs to be updated. The existing mac80211 solution was
extended to cfg80211 in commit 5dc8cdce1d72 ("mac80211/cfg80211:
update bss channel on channel switch").
However that solution still appears to be incomplete as it may lead
to duplicated scan entries for associated BSS after channel switch.
The root cause of the problem is as follows. Each BSS entry is
included into the following data structures:
- bss list rdev->bss_list
- bss search tree rdev->bss_tree
Updating BSS channel record without rebuilding bss_tree may break
tree search since cmp_bss considers all of the following: channel,
bssid, ssid. When BSS channel is updated, but its location in bss_tree
is not updated, then subsequent search operations may fail to locate
this BSS since they will be traversing bss_tree in wrong direction.
As a result, for scan performed after associated BSS channel switch,
cfg80211_bss_update may add the second entry for the same BSS to both
bss_list and bss_tree, rather then update the existing one.
To summarize, if BSS channel needs to be updated, then bss_tree should
be rebuilt in order to put updated BSS entry into a proper location.
This commit suggests the following straightforward solution:
- if new entry has been already created for BSS after channel switch,
then use its IEs to update known BSS entry and then remove new
entry completely
- use rb_erase/rb_insert_bss reinstall updated BSS in bss_tree
- for nontransmit BSS entry, the whole transmit BSS hierarchy
is updated
Signed-off-by: Sergey Matyukevich <sergey.matyukevich.os@quantenna.com>
Link: https://lore.kernel.org/r/20190726163922.27509-3-sergey.matyukevich.os@quantenna.com
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2019-07-26 16:39:34 +00:00
|
|
|
|
|
|
|
cbss->pub.channel = chan;
|
|
|
|
|
|
|
|
list_for_each_entry(bss, &rdev->bss_list, list) {
|
|
|
|
if (!cfg80211_bss_type_match(bss->pub.capability,
|
|
|
|
bss->pub.channel->band,
|
|
|
|
wdev->conn_bss_type))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (bss == cbss)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!cmp_bss(&bss->pub, &cbss->pub, BSS_CMP_REGULAR)) {
|
|
|
|
new = bss;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (new) {
|
|
|
|
/* to save time, update IEs for transmitting bss only */
|
|
|
|
if (cfg80211_update_known_bss(rdev, cbss, new, false)) {
|
|
|
|
new->pub.proberesp_ies = NULL;
|
|
|
|
new->pub.beacon_ies = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
list_for_each_entry_safe(nontrans_bss, tmp,
|
|
|
|
&new->pub.nontrans_list,
|
|
|
|
nontrans_list) {
|
2022-10-17 07:03:48 +00:00
|
|
|
bss = bss_from_pub(nontrans_bss);
|
cfg80211: fix duplicated scan entries after channel switch
When associated BSS completes channel switch procedure, its channel
record needs to be updated. The existing mac80211 solution was
extended to cfg80211 in commit 5dc8cdce1d72 ("mac80211/cfg80211:
update bss channel on channel switch").
However that solution still appears to be incomplete as it may lead
to duplicated scan entries for associated BSS after channel switch.
The root cause of the problem is as follows. Each BSS entry is
included into the following data structures:
- bss list rdev->bss_list
- bss search tree rdev->bss_tree
Updating BSS channel record without rebuilding bss_tree may break
tree search since cmp_bss considers all of the following: channel,
bssid, ssid. When BSS channel is updated, but its location in bss_tree
is not updated, then subsequent search operations may fail to locate
this BSS since they will be traversing bss_tree in wrong direction.
As a result, for scan performed after associated BSS channel switch,
cfg80211_bss_update may add the second entry for the same BSS to both
bss_list and bss_tree, rather then update the existing one.
To summarize, if BSS channel needs to be updated, then bss_tree should
be rebuilt in order to put updated BSS entry into a proper location.
This commit suggests the following straightforward solution:
- if new entry has been already created for BSS after channel switch,
then use its IEs to update known BSS entry and then remove new
entry completely
- use rb_erase/rb_insert_bss reinstall updated BSS in bss_tree
- for nontransmit BSS entry, the whole transmit BSS hierarchy
is updated
Signed-off-by: Sergey Matyukevich <sergey.matyukevich.os@quantenna.com>
Link: https://lore.kernel.org/r/20190726163922.27509-3-sergey.matyukevich.os@quantenna.com
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2019-07-26 16:39:34 +00:00
|
|
|
if (__cfg80211_unlink_bss(rdev, bss))
|
|
|
|
rdev->bss_generation++;
|
|
|
|
}
|
|
|
|
|
|
|
|
WARN_ON(atomic_read(&new->hold));
|
|
|
|
if (!WARN_ON(!__cfg80211_unlink_bss(rdev, new)))
|
|
|
|
rdev->bss_generation++;
|
|
|
|
}
|
|
|
|
|
|
|
|
rb_erase(&cbss->rbn, &rdev->bss_tree);
|
|
|
|
rb_insert_bss(rdev, cbss);
|
|
|
|
rdev->bss_generation++;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(nontrans_bss, tmp,
|
|
|
|
&cbss->pub.nontrans_list,
|
|
|
|
nontrans_list) {
|
2022-10-17 07:03:48 +00:00
|
|
|
bss = bss_from_pub(nontrans_bss);
|
cfg80211: fix duplicated scan entries after channel switch
When associated BSS completes channel switch procedure, its channel
record needs to be updated. The existing mac80211 solution was
extended to cfg80211 in commit 5dc8cdce1d72 ("mac80211/cfg80211:
update bss channel on channel switch").
However that solution still appears to be incomplete as it may lead
to duplicated scan entries for associated BSS after channel switch.
The root cause of the problem is as follows. Each BSS entry is
included into the following data structures:
- bss list rdev->bss_list
- bss search tree rdev->bss_tree
Updating BSS channel record without rebuilding bss_tree may break
tree search since cmp_bss considers all of the following: channel,
bssid, ssid. When BSS channel is updated, but its location in bss_tree
is not updated, then subsequent search operations may fail to locate
this BSS since they will be traversing bss_tree in wrong direction.
As a result, for scan performed after associated BSS channel switch,
cfg80211_bss_update may add the second entry for the same BSS to both
bss_list and bss_tree, rather then update the existing one.
To summarize, if BSS channel needs to be updated, then bss_tree should
be rebuilt in order to put updated BSS entry into a proper location.
This commit suggests the following straightforward solution:
- if new entry has been already created for BSS after channel switch,
then use its IEs to update known BSS entry and then remove new
entry completely
- use rb_erase/rb_insert_bss reinstall updated BSS in bss_tree
- for nontransmit BSS entry, the whole transmit BSS hierarchy
is updated
Signed-off-by: Sergey Matyukevich <sergey.matyukevich.os@quantenna.com>
Link: https://lore.kernel.org/r/20190726163922.27509-3-sergey.matyukevich.os@quantenna.com
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2019-07-26 16:39:34 +00:00
|
|
|
bss->pub.channel = chan;
|
|
|
|
rb_erase(&bss->rbn, &rdev->bss_tree);
|
|
|
|
rb_insert_bss(rdev, bss);
|
|
|
|
rdev->bss_generation++;
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
|
|
|
}
|
|
|
|
|
2009-09-29 21:27:28 +00:00
|
|
|
#ifdef CONFIG_CFG80211_WEXT
|
2013-05-08 19:34:22 +00:00
|
|
|
static struct cfg80211_registered_device *
|
|
|
|
cfg80211_get_dev_from_ifindex(struct net *net, int ifindex)
|
|
|
|
{
|
2013-05-08 19:45:15 +00:00
|
|
|
struct cfg80211_registered_device *rdev;
|
2013-05-08 19:34:22 +00:00
|
|
|
struct net_device *dev;
|
|
|
|
|
2013-05-08 19:45:15 +00:00
|
|
|
ASSERT_RTNL();
|
|
|
|
|
2013-05-08 19:34:22 +00:00
|
|
|
dev = dev_get_by_index(net, ifindex);
|
|
|
|
if (!dev)
|
2013-05-08 19:45:15 +00:00
|
|
|
return ERR_PTR(-ENODEV);
|
|
|
|
if (dev->ieee80211_ptr)
|
2014-04-21 04:53:03 +00:00
|
|
|
rdev = wiphy_to_rdev(dev->ieee80211_ptr->wiphy);
|
2013-05-08 19:45:15 +00:00
|
|
|
else
|
2013-05-08 19:34:22 +00:00
|
|
|
rdev = ERR_PTR(-ENODEV);
|
|
|
|
dev_put(dev);
|
|
|
|
return rdev;
|
|
|
|
}
|
|
|
|
|
2009-02-10 20:25:55 +00:00
|
|
|
int cfg80211_wext_siwscan(struct net_device *dev,
|
|
|
|
struct iw_request_info *info,
|
|
|
|
union iwreq_data *wrqu, char *extra)
|
|
|
|
{
|
|
|
|
struct cfg80211_registered_device *rdev;
|
|
|
|
struct wiphy *wiphy;
|
|
|
|
struct iw_scan_req *wreq = NULL;
|
2021-11-15 09:21:39 +00:00
|
|
|
struct cfg80211_scan_request *creq;
|
2009-02-10 20:25:55 +00:00
|
|
|
int i, err, n_channels = 0;
|
2016-04-12 13:56:15 +00:00
|
|
|
enum nl80211_band band;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
if (!netif_running(dev))
|
|
|
|
return -ENETDOWN;
|
|
|
|
|
2009-09-09 11:09:54 +00:00
|
|
|
if (wrqu->data.length == sizeof(struct iw_scan_req))
|
|
|
|
wreq = (struct iw_scan_req *)extra;
|
|
|
|
|
2009-07-13 22:33:35 +00:00
|
|
|
rdev = cfg80211_get_dev_from_ifindex(dev_net(dev), dev->ifindex);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
if (IS_ERR(rdev))
|
|
|
|
return PTR_ERR(rdev);
|
|
|
|
|
2021-11-15 09:21:39 +00:00
|
|
|
if (rdev->scan_req || rdev->scan_msg)
|
|
|
|
return -EBUSY;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
wiphy = &rdev->wiphy;
|
|
|
|
|
2009-09-09 11:09:54 +00:00
|
|
|
/* Determine number of channels, needed to allocate creq */
|
|
|
|
if (wreq && wreq->num_channels)
|
|
|
|
n_channels = wreq->num_channels;
|
2014-01-09 09:37:23 +00:00
|
|
|
else
|
|
|
|
n_channels = ieee80211_get_num_supported_channels(wiphy);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
creq = kzalloc(sizeof(*creq) + sizeof(struct cfg80211_ssid) +
|
|
|
|
n_channels * sizeof(void *),
|
|
|
|
GFP_ATOMIC);
|
2021-11-15 09:21:39 +00:00
|
|
|
if (!creq)
|
|
|
|
return -ENOMEM;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
creq->wiphy = wiphy;
|
2012-06-18 17:17:03 +00:00
|
|
|
creq->wdev = dev->ieee80211_ptr;
|
2009-08-07 15:54:07 +00:00
|
|
|
/* SSIDs come after channels */
|
|
|
|
creq->ssids = (void *)&creq->channels[n_channels];
|
2009-02-10 20:25:55 +00:00
|
|
|
creq->n_channels = n_channels;
|
|
|
|
creq->n_ssids = 1;
|
2012-10-12 04:03:34 +00:00
|
|
|
creq->scan_start = jiffies;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2009-09-09 11:09:54 +00:00
|
|
|
/* translate "Scan on frequencies" request */
|
2009-02-10 20:25:55 +00:00
|
|
|
i = 0;
|
2016-04-12 13:56:15 +00:00
|
|
|
for (band = 0; band < NUM_NL80211_BANDS; band++) {
|
2009-02-10 20:25:55 +00:00
|
|
|
int j;
|
2009-11-02 12:32:03 +00:00
|
|
|
|
2009-02-10 20:25:55 +00:00
|
|
|
if (!wiphy->bands[band])
|
|
|
|
continue;
|
2009-11-02 12:32:03 +00:00
|
|
|
|
2009-02-10 20:25:55 +00:00
|
|
|
for (j = 0; j < wiphy->bands[band]->n_channels; j++) {
|
2009-11-02 12:32:03 +00:00
|
|
|
/* ignore disabled channels */
|
|
|
|
if (wiphy->bands[band]->channels[j].flags &
|
|
|
|
IEEE80211_CHAN_DISABLED)
|
|
|
|
continue;
|
2009-09-09 11:09:54 +00:00
|
|
|
|
|
|
|
/* If we have a wireless request structure and the
|
|
|
|
* wireless request specifies frequencies, then search
|
|
|
|
* for the matching hardware channel.
|
|
|
|
*/
|
|
|
|
if (wreq && wreq->num_channels) {
|
|
|
|
int k;
|
|
|
|
int wiphy_freq = wiphy->bands[band]->channels[j].center_freq;
|
|
|
|
for (k = 0; k < wreq->num_channels; k++) {
|
2014-04-09 01:28:06 +00:00
|
|
|
struct iw_freq *freq =
|
|
|
|
&wreq->channel_list[k];
|
|
|
|
int wext_freq =
|
|
|
|
cfg80211_wext_freq(freq);
|
|
|
|
|
2009-09-09 11:09:54 +00:00
|
|
|
if (wext_freq == wiphy_freq)
|
|
|
|
goto wext_freq_found;
|
|
|
|
}
|
|
|
|
goto wext_freq_not_found;
|
|
|
|
}
|
|
|
|
|
|
|
|
wext_freq_found:
|
2009-02-10 20:25:55 +00:00
|
|
|
creq->channels[i] = &wiphy->bands[band]->channels[j];
|
|
|
|
i++;
|
2009-09-09 11:09:54 +00:00
|
|
|
wext_freq_not_found: ;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
}
|
2009-09-11 08:13:55 +00:00
|
|
|
/* No channels found? */
|
|
|
|
if (!i) {
|
|
|
|
err = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2009-09-09 11:09:54 +00:00
|
|
|
/* Set real number of channels specified in creq->channels[] */
|
|
|
|
creq->n_channels = i;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2009-09-09 11:09:54 +00:00
|
|
|
/* translate "Scan for SSID" request */
|
|
|
|
if (wreq) {
|
2009-02-10 20:25:55 +00:00
|
|
|
if (wrqu->data.flags & IW_SCAN_THIS_ESSID) {
|
2009-12-23 14:33:35 +00:00
|
|
|
if (wreq->essid_len > IEEE80211_MAX_SSID_LEN) {
|
|
|
|
err = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
2009-02-10 20:25:55 +00:00
|
|
|
memcpy(creq->ssids[0].ssid, wreq->essid, wreq->essid_len);
|
|
|
|
creq->ssids[0].ssid_len = wreq->essid_len;
|
|
|
|
}
|
|
|
|
if (wreq->scan_type == IW_SCAN_TYPE_PASSIVE)
|
|
|
|
creq->n_ssids = 0;
|
|
|
|
}
|
|
|
|
|
2016-04-12 13:56:15 +00:00
|
|
|
for (i = 0; i < NUM_NL80211_BANDS; i++)
|
2011-07-19 22:52:16 +00:00
|
|
|
if (wiphy->bands[i])
|
|
|
|
creq->rates[i] = (1 << wiphy->bands[i]->n_bitrates) - 1;
|
2011-07-18 16:08:35 +00:00
|
|
|
|
2016-02-26 20:12:47 +00:00
|
|
|
eth_broadcast_addr(creq->bssid);
|
|
|
|
|
2021-01-22 15:19:43 +00:00
|
|
|
wiphy_lock(&rdev->wiphy);
|
|
|
|
|
2009-02-10 20:25:55 +00:00
|
|
|
rdev->scan_req = creq;
|
2012-06-27 14:19:42 +00:00
|
|
|
err = rdev_scan(rdev, creq);
|
2009-02-10 20:25:55 +00:00
|
|
|
if (err) {
|
|
|
|
rdev->scan_req = NULL;
|
2009-12-23 14:33:35 +00:00
|
|
|
/* creq will be freed below */
|
2009-07-13 22:33:35 +00:00
|
|
|
} else {
|
2012-06-18 17:17:03 +00:00
|
|
|
nl80211_send_scan_start(rdev, dev->ieee80211_ptr);
|
2009-12-23 14:33:35 +00:00
|
|
|
/* creq now owned by driver */
|
|
|
|
creq = NULL;
|
2009-07-13 22:33:35 +00:00
|
|
|
dev_hold(dev);
|
|
|
|
}
|
2021-01-22 15:19:43 +00:00
|
|
|
wiphy_unlock(&rdev->wiphy);
|
2009-02-10 20:25:55 +00:00
|
|
|
out:
|
2009-12-23 14:33:35 +00:00
|
|
|
kfree(creq);
|
2009-02-10 20:25:55 +00:00
|
|
|
return err;
|
|
|
|
}
|
2015-01-06 13:00:53 +00:00
|
|
|
EXPORT_WEXT_HANDLER(cfg80211_wext_siwscan);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2015-02-24 18:58:20 +00:00
|
|
|
static char *ieee80211_scan_add_ies(struct iw_request_info *info,
|
|
|
|
const struct cfg80211_bss_ies *ies,
|
|
|
|
char *current_ev, char *end_buf)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
2012-11-29 00:25:20 +00:00
|
|
|
const u8 *pos, *end, *next;
|
2009-02-10 20:25:55 +00:00
|
|
|
struct iw_event iwe;
|
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
if (!ies)
|
2015-02-24 18:58:20 +00:00
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If needed, fragment the IEs buffer (at IE boundaries) into short
|
|
|
|
* enough fragments to fit into IW_GENERIC_IE_MAX octet messages.
|
|
|
|
*/
|
2012-11-29 00:25:20 +00:00
|
|
|
pos = ies->data;
|
|
|
|
end = pos + ies->len;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
while (end - pos > IW_GENERIC_IE_MAX) {
|
|
|
|
next = pos + 2 + pos[1];
|
|
|
|
while (next + 2 + next[1] - pos < IW_GENERIC_IE_MAX)
|
|
|
|
next = next + 2 + next[1];
|
|
|
|
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = IWEVGENIE;
|
|
|
|
iwe.u.data.length = next - pos;
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info, current_ev,
|
|
|
|
end_buf, &iwe,
|
|
|
|
(void *)pos);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
pos = next;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (end > pos) {
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = IWEVGENIE;
|
|
|
|
iwe.u.data.length = end - pos;
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info, current_ev,
|
|
|
|
end_buf, &iwe,
|
|
|
|
(void *)pos);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
2015-02-24 18:58:20 +00:00
|
|
|
|
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static char *
|
2009-02-18 17:45:06 +00:00
|
|
|
ieee80211_bss(struct wiphy *wiphy, struct iw_request_info *info,
|
|
|
|
struct cfg80211_internal_bss *bss, char *current_ev,
|
|
|
|
char *end_buf)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
2012-11-29 00:25:20 +00:00
|
|
|
const struct cfg80211_bss_ies *ies;
|
2009-02-10 20:25:55 +00:00
|
|
|
struct iw_event iwe;
|
2012-11-29 00:25:20 +00:00
|
|
|
const u8 *ie;
|
2015-02-24 18:58:20 +00:00
|
|
|
u8 buf[50];
|
|
|
|
u8 *cfg, *p, *tmp;
|
2012-11-29 00:25:20 +00:00
|
|
|
int rem, i, sig;
|
2009-02-10 20:25:55 +00:00
|
|
|
bool ismesh = false;
|
|
|
|
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = SIOCGIWAP;
|
|
|
|
iwe.u.ap_addr.sa_family = ARPHRD_ETHER;
|
|
|
|
memcpy(iwe.u.ap_addr.sa_data, bss->pub.bssid, ETH_ALEN);
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_event_check(info, current_ev, end_buf, &iwe,
|
|
|
|
IW_EV_ADDR_LEN);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = SIOCGIWFREQ;
|
|
|
|
iwe.u.freq.m = ieee80211_frequency_to_channel(bss->pub.channel->center_freq);
|
|
|
|
iwe.u.freq.e = 0;
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_event_check(info, current_ev, end_buf, &iwe,
|
|
|
|
IW_EV_FREQ_LEN);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = SIOCGIWFREQ;
|
|
|
|
iwe.u.freq.m = bss->pub.channel->center_freq;
|
|
|
|
iwe.u.freq.e = 6;
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_event_check(info, current_ev, end_buf, &iwe,
|
|
|
|
IW_EV_FREQ_LEN);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2009-02-18 17:45:06 +00:00
|
|
|
if (wiphy->signal_type != CFG80211_SIGNAL_TYPE_NONE) {
|
2009-02-10 20:25:55 +00:00
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = IWEVQUAL;
|
|
|
|
iwe.u.qual.updated = IW_QUAL_LEVEL_UPDATED |
|
|
|
|
IW_QUAL_NOISE_INVALID |
|
2009-02-18 17:27:22 +00:00
|
|
|
IW_QUAL_QUAL_UPDATED;
|
2009-02-18 17:45:06 +00:00
|
|
|
switch (wiphy->signal_type) {
|
2009-02-10 20:25:55 +00:00
|
|
|
case CFG80211_SIGNAL_TYPE_MBM:
|
2009-02-18 17:27:22 +00:00
|
|
|
sig = bss->pub.signal / 100;
|
|
|
|
iwe.u.qual.level = sig;
|
2009-02-10 20:25:55 +00:00
|
|
|
iwe.u.qual.updated |= IW_QUAL_DBM;
|
2009-02-18 17:27:22 +00:00
|
|
|
if (sig < -110) /* rather bad */
|
|
|
|
sig = -110;
|
|
|
|
else if (sig > -40) /* perfect */
|
|
|
|
sig = -40;
|
|
|
|
/* will give a range of 0 .. 70 */
|
|
|
|
iwe.u.qual.qual = sig + 110;
|
2009-02-10 20:25:55 +00:00
|
|
|
break;
|
|
|
|
case CFG80211_SIGNAL_TYPE_UNSPEC:
|
|
|
|
iwe.u.qual.level = bss->pub.signal;
|
2009-02-18 17:27:22 +00:00
|
|
|
/* will give range 0 .. 100 */
|
|
|
|
iwe.u.qual.qual = bss->pub.signal;
|
2009-02-10 20:25:55 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/* not reached */
|
|
|
|
break;
|
|
|
|
}
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_event_check(info, current_ev,
|
|
|
|
end_buf, &iwe,
|
|
|
|
IW_EV_QUAL_LEN);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = SIOCGIWENCODE;
|
|
|
|
if (bss->pub.capability & WLAN_CAPABILITY_PRIVACY)
|
|
|
|
iwe.u.data.flags = IW_ENCODE_ENABLED | IW_ENCODE_NOKEY;
|
|
|
|
else
|
|
|
|
iwe.u.data.flags = IW_ENCODE_DISABLED;
|
|
|
|
iwe.u.data.length = 0;
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info, current_ev, end_buf,
|
|
|
|
&iwe, "");
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
return current_ev;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2012-11-29 00:25:20 +00:00
|
|
|
rcu_read_lock();
|
|
|
|
ies = rcu_dereference(bss->pub.ies);
|
2013-02-05 15:51:29 +00:00
|
|
|
rem = ies->len;
|
|
|
|
ie = ies->data;
|
2012-11-29 00:25:20 +00:00
|
|
|
|
2013-02-05 15:51:29 +00:00
|
|
|
while (rem >= 2) {
|
2009-02-10 20:25:55 +00:00
|
|
|
/* invalid data */
|
|
|
|
if (ie[1] > rem - 2)
|
|
|
|
break;
|
|
|
|
|
|
|
|
switch (ie[0]) {
|
|
|
|
case WLAN_EID_SSID:
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = SIOCGIWESSID;
|
|
|
|
iwe.u.data.length = ie[1];
|
|
|
|
iwe.u.data.flags = 1;
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf, &iwe,
|
|
|
|
(u8 *)ie + 2);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-02-10 20:25:55 +00:00
|
|
|
break;
|
|
|
|
case WLAN_EID_MESH_ID:
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = SIOCGIWESSID;
|
|
|
|
iwe.u.data.length = ie[1];
|
|
|
|
iwe.u.data.flags = 1;
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf, &iwe,
|
|
|
|
(u8 *)ie + 2);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-02-10 20:25:55 +00:00
|
|
|
break;
|
|
|
|
case WLAN_EID_MESH_CONFIG:
|
|
|
|
ismesh = true;
|
2009-11-18 18:40:00 +00:00
|
|
|
if (ie[1] != sizeof(struct ieee80211_meshconf_ie))
|
2009-02-10 20:25:55 +00:00
|
|
|
break;
|
2012-11-29 00:25:20 +00:00
|
|
|
cfg = (u8 *)ie + 2;
|
2009-02-10 20:25:55 +00:00
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = IWEVCUSTOM;
|
2009-11-18 18:22:59 +00:00
|
|
|
sprintf(buf, "Mesh Network Path Selection Protocol ID: "
|
|
|
|
"0x%02X", cfg[0]);
|
2009-02-10 20:25:55 +00:00
|
|
|
iwe.u.data.length = strlen(buf);
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf,
|
|
|
|
&iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-11-18 18:22:59 +00:00
|
|
|
sprintf(buf, "Path Selection Metric ID: 0x%02X",
|
|
|
|
cfg[1]);
|
2009-02-10 20:25:55 +00:00
|
|
|
iwe.u.data.length = strlen(buf);
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf,
|
|
|
|
&iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-11-18 18:22:59 +00:00
|
|
|
sprintf(buf, "Congestion Control Mode ID: 0x%02X",
|
|
|
|
cfg[2]);
|
2009-02-10 20:25:55 +00:00
|
|
|
iwe.u.data.length = strlen(buf);
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf,
|
|
|
|
&iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-11-18 18:22:59 +00:00
|
|
|
sprintf(buf, "Synchronization ID: 0x%02X", cfg[3]);
|
2009-02-10 20:25:55 +00:00
|
|
|
iwe.u.data.length = strlen(buf);
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf,
|
|
|
|
&iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-11-18 18:22:59 +00:00
|
|
|
sprintf(buf, "Authentication ID: 0x%02X", cfg[4]);
|
|
|
|
iwe.u.data.length = strlen(buf);
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf,
|
|
|
|
&iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-11-18 18:22:59 +00:00
|
|
|
sprintf(buf, "Formation Info: 0x%02X", cfg[5]);
|
|
|
|
iwe.u.data.length = strlen(buf);
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf,
|
|
|
|
&iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-11-18 18:22:59 +00:00
|
|
|
sprintf(buf, "Capabilities: 0x%02X", cfg[6]);
|
2009-02-10 20:25:55 +00:00
|
|
|
iwe.u.data.length = strlen(buf);
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_point_check(info,
|
|
|
|
current_ev,
|
|
|
|
end_buf,
|
|
|
|
&iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-02-10 20:25:55 +00:00
|
|
|
break;
|
|
|
|
case WLAN_EID_SUPP_RATES:
|
|
|
|
case WLAN_EID_EXT_SUPP_RATES:
|
|
|
|
/* display all supported rates in readable format */
|
|
|
|
p = current_ev + iwe_stream_lcp_len(info);
|
|
|
|
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = SIOCGIWRATE;
|
|
|
|
/* Those two flags are ignored... */
|
|
|
|
iwe.u.bitrate.fixed = iwe.u.bitrate.disabled = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < ie[1]; i++) {
|
|
|
|
iwe.u.bitrate.value =
|
|
|
|
((ie[i + 2] & 0x7f) * 500000);
|
2015-02-24 18:58:20 +00:00
|
|
|
tmp = p;
|
2009-02-10 20:25:55 +00:00
|
|
|
p = iwe_stream_add_value(info, current_ev, p,
|
2015-02-24 18:58:20 +00:00
|
|
|
end_buf, &iwe,
|
|
|
|
IW_EV_PARAM_LEN);
|
|
|
|
if (p == tmp) {
|
|
|
|
current_ev = ERR_PTR(-E2BIG);
|
|
|
|
goto unlock;
|
|
|
|
}
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
current_ev = p;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rem -= ie[1] + 2;
|
|
|
|
ie += ie[1] + 2;
|
|
|
|
}
|
|
|
|
|
2009-11-30 00:55:45 +00:00
|
|
|
if (bss->pub.capability & (WLAN_CAPABILITY_ESS | WLAN_CAPABILITY_IBSS) ||
|
|
|
|
ismesh) {
|
2009-02-10 20:25:55 +00:00
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = SIOCGIWMODE;
|
|
|
|
if (ismesh)
|
|
|
|
iwe.u.mode = IW_MODE_MESH;
|
|
|
|
else if (bss->pub.capability & WLAN_CAPABILITY_ESS)
|
|
|
|
iwe.u.mode = IW_MODE_MASTER;
|
|
|
|
else
|
|
|
|
iwe.u.mode = IW_MODE_ADHOC;
|
2015-02-24 18:58:20 +00:00
|
|
|
current_ev = iwe_stream_add_event_check(info, current_ev,
|
|
|
|
end_buf, &iwe,
|
|
|
|
IW_EV_UINT_LEN);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
|
|
|
|
2015-02-24 18:58:20 +00:00
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = IWEVCUSTOM;
|
|
|
|
sprintf(buf, "tsf=%016llx", (unsigned long long)(ies->tsf));
|
|
|
|
iwe.u.data.length = strlen(buf);
|
|
|
|
current_ev = iwe_stream_add_point_check(info, current_ev, end_buf,
|
|
|
|
&iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
|
|
|
memset(&iwe, 0, sizeof(iwe));
|
|
|
|
iwe.cmd = IWEVCUSTOM;
|
|
|
|
sprintf(buf, " Last beacon: %ums ago",
|
|
|
|
elapsed_jiffies_msecs(bss->ts));
|
|
|
|
iwe.u.data.length = strlen(buf);
|
|
|
|
current_ev = iwe_stream_add_point_check(info, current_ev,
|
|
|
|
end_buf, &iwe, buf);
|
|
|
|
if (IS_ERR(current_ev))
|
|
|
|
goto unlock;
|
|
|
|
|
|
|
|
current_ev = ieee80211_scan_add_ies(info, ies, current_ev, end_buf);
|
|
|
|
|
|
|
|
unlock:
|
2012-11-29 00:25:20 +00:00
|
|
|
rcu_read_unlock();
|
2009-02-10 20:25:55 +00:00
|
|
|
return current_ev;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
static int ieee80211_scan_results(struct cfg80211_registered_device *rdev,
|
2009-02-10 20:25:55 +00:00
|
|
|
struct iw_request_info *info,
|
|
|
|
char *buf, size_t len)
|
|
|
|
{
|
|
|
|
char *current_ev = buf;
|
|
|
|
char *end_buf = buf + len;
|
|
|
|
struct cfg80211_internal_bss *bss;
|
2015-02-24 18:58:20 +00:00
|
|
|
int err = 0;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_lock_bh(&rdev->bss_lock);
|
|
|
|
cfg80211_bss_expire(rdev);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
2014-04-21 04:53:02 +00:00
|
|
|
list_for_each_entry(bss, &rdev->bss_list, list) {
|
2009-02-10 20:25:55 +00:00
|
|
|
if (buf + len - current_ev <= IW_EV_ADDR_LEN) {
|
2015-02-24 18:58:20 +00:00
|
|
|
err = -E2BIG;
|
|
|
|
break;
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
2014-04-21 04:53:02 +00:00
|
|
|
current_ev = ieee80211_bss(&rdev->wiphy, info, bss,
|
2009-02-18 17:45:06 +00:00
|
|
|
current_ev, end_buf);
|
2015-02-24 18:58:20 +00:00
|
|
|
if (IS_ERR(current_ev)) {
|
|
|
|
err = PTR_ERR(current_ev);
|
|
|
|
break;
|
|
|
|
}
|
2009-02-10 20:25:55 +00:00
|
|
|
}
|
2014-04-21 04:53:02 +00:00
|
|
|
spin_unlock_bh(&rdev->bss_lock);
|
2015-02-24 18:58:20 +00:00
|
|
|
|
|
|
|
if (err)
|
|
|
|
return err;
|
2009-02-10 20:25:55 +00:00
|
|
|
return current_ev - buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int cfg80211_wext_giwscan(struct net_device *dev,
|
|
|
|
struct iw_request_info *info,
|
wifi: cfg80211: Avoid clashing function prototypes
When built with Control Flow Integrity, function prototypes between
caller and function declaration must match. These mismatches are visible
at compile time with the new -Wcast-function-type-strict in Clang[1].
Fix a total of 73 warnings like these:
drivers/net/wireless/intersil/orinoco/wext.c:1379:27: warning: cast from 'int (*)(struct net_device *, struct iw_request_info *, struct iw_param *, char *)' to 'iw_handler' (aka 'int (*)(struct net_device *, struct iw_request_info *, union iwreq_data *, char *)') converts to incompatible function type [-Wcast-function-type-strict]
IW_HANDLER(SIOCGIWPOWER, (iw_handler)orinoco_ioctl_getpower),
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../net/wireless/wext-compat.c:1607:33: warning: cast from 'int (*)(struct net_device *, struct iw_request_info *, struct iw_point *, char *)' to 'iw_handler' (aka 'int (*)(struct net_device *, struct iw_request_info *, union iwreq_data *, char *)') converts to incompatible function type [-Wcast-function-type-strict]
[IW_IOCTL_IDX(SIOCSIWGENIE)] = (iw_handler) cfg80211_wext_siwgenie,
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../drivers/net/wireless/intersil/orinoco/wext.c:1390:27: error: incompatible function pointer types initializing 'const iw_handler' (aka 'int (*const)(struct net_device *, struct iw_request_info *, union iwreq_data *, char *)') with an expression of type 'int (struct net_device *, struct iw_request_info *, struct iw_param *, char *)' [-Wincompatible-function-pointer-types]
IW_HANDLER(SIOCGIWRETRY, cfg80211_wext_giwretry),
^~~~~~~~~~~~~~~~~~~~~~
The cfg80211 Wireless Extension handler callbacks (iw_handler) use a
union for the data argument. Actually use the union and perform explicit
member selection in the function body instead of having a function
prototype mismatch. There are no resulting binary differences
before/after changes.
These changes were made partly manually and partly with the help of
Coccinelle.
Link: https://github.com/KSPP/linux/issues/234
Link: https://reviews.llvm.org/D134831 [1]
Signed-off-by: Gustavo A. R. Silva <gustavoars@kernel.org>
Reviewed-by: Kees Cook <keescook@chromium.org>
Signed-off-by: Kalle Valo <kvalo@kernel.org>
Link: https://lore.kernel.org/r/a68822bf8dd587988131bb6a295280cb4293f05d.1667934775.git.gustavoars@kernel.org
2022-11-08 20:23:55 +00:00
|
|
|
union iwreq_data *wrqu, char *extra)
|
2009-02-10 20:25:55 +00:00
|
|
|
{
|
wifi: cfg80211: Avoid clashing function prototypes
When built with Control Flow Integrity, function prototypes between
caller and function declaration must match. These mismatches are visible
at compile time with the new -Wcast-function-type-strict in Clang[1].
Fix a total of 73 warnings like these:
drivers/net/wireless/intersil/orinoco/wext.c:1379:27: warning: cast from 'int (*)(struct net_device *, struct iw_request_info *, struct iw_param *, char *)' to 'iw_handler' (aka 'int (*)(struct net_device *, struct iw_request_info *, union iwreq_data *, char *)') converts to incompatible function type [-Wcast-function-type-strict]
IW_HANDLER(SIOCGIWPOWER, (iw_handler)orinoco_ioctl_getpower),
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../net/wireless/wext-compat.c:1607:33: warning: cast from 'int (*)(struct net_device *, struct iw_request_info *, struct iw_point *, char *)' to 'iw_handler' (aka 'int (*)(struct net_device *, struct iw_request_info *, union iwreq_data *, char *)') converts to incompatible function type [-Wcast-function-type-strict]
[IW_IOCTL_IDX(SIOCSIWGENIE)] = (iw_handler) cfg80211_wext_siwgenie,
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
../drivers/net/wireless/intersil/orinoco/wext.c:1390:27: error: incompatible function pointer types initializing 'const iw_handler' (aka 'int (*const)(struct net_device *, struct iw_request_info *, union iwreq_data *, char *)') with an expression of type 'int (struct net_device *, struct iw_request_info *, struct iw_param *, char *)' [-Wincompatible-function-pointer-types]
IW_HANDLER(SIOCGIWRETRY, cfg80211_wext_giwretry),
^~~~~~~~~~~~~~~~~~~~~~
The cfg80211 Wireless Extension handler callbacks (iw_handler) use a
union for the data argument. Actually use the union and perform explicit
member selection in the function body instead of having a function
prototype mismatch. There are no resulting binary differences
before/after changes.
These changes were made partly manually and partly with the help of
Coccinelle.
Link: https://github.com/KSPP/linux/issues/234
Link: https://reviews.llvm.org/D134831 [1]
Signed-off-by: Gustavo A. R. Silva <gustavoars@kernel.org>
Reviewed-by: Kees Cook <keescook@chromium.org>
Signed-off-by: Kalle Valo <kvalo@kernel.org>
Link: https://lore.kernel.org/r/a68822bf8dd587988131bb6a295280cb4293f05d.1667934775.git.gustavoars@kernel.org
2022-11-08 20:23:55 +00:00
|
|
|
struct iw_point *data = &wrqu->data;
|
2009-02-10 20:25:55 +00:00
|
|
|
struct cfg80211_registered_device *rdev;
|
|
|
|
int res;
|
|
|
|
|
|
|
|
if (!netif_running(dev))
|
|
|
|
return -ENETDOWN;
|
|
|
|
|
2009-07-13 22:33:35 +00:00
|
|
|
rdev = cfg80211_get_dev_from_ifindex(dev_net(dev), dev->ifindex);
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
if (IS_ERR(rdev))
|
|
|
|
return PTR_ERR(rdev);
|
|
|
|
|
cfg80211: send scan results from work queue
Due to the previous commit, when a scan finishes, it is in theory
possible to hit the following sequence:
1. interface starts being removed
2. scan is cancelled by driver and cfg80211 is notified
3. scan done work is scheduled
4. interface is removed completely, rdev->scan_req is freed,
event sent to userspace but scan done work remains pending
5. new scan is requested on another virtual interface
6. scan done work runs, freeing the still-running scan
To fix this situation, hang on to the scan done message and block
new scans while that is the case, and only send the message from
the work function, regardless of whether the scan_req is already
freed from interface removal. This makes step 5 above impossible
and changes step 6 to be
5. scan done work runs, sending the scan done message
As this can't work for wext, so we send the message immediately,
but this shouldn't be an issue since we still return -EBUSY.
Signed-off-by: Johannes Berg <johannes.berg@intel.com>
2014-01-22 09:14:19 +00:00
|
|
|
if (rdev->scan_req || rdev->scan_msg)
|
2013-05-08 19:45:15 +00:00
|
|
|
return -EAGAIN;
|
2009-02-10 20:25:55 +00:00
|
|
|
|
|
|
|
res = ieee80211_scan_results(rdev, info, extra, data->length);
|
|
|
|
data->length = 0;
|
|
|
|
if (res >= 0) {
|
|
|
|
data->length = res;
|
|
|
|
res = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
2015-01-06 13:00:53 +00:00
|
|
|
EXPORT_WEXT_HANDLER(cfg80211_wext_giwscan);
|
2009-02-10 20:25:55 +00:00
|
|
|
#endif
|