1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
|
// SPDX-License-Identifier: BSD-3-Clause-Clear
/*
* Copyright (c) 2018-2021 The Linux Foundation. All rights reserved.
* Copyright (c) Qualcomm Technologies, Inc. and/or its subsidiaries.
*/
#include "core.h"
#include "peer.h"
#include "debug.h"
#include "debugfs.h"
static void ath12k_peer_delete_wait_register(struct ath12k *ar,
struct ath12k_peer_delete_wait *wait,
u32 vdev_id, const u8 *addr)
{
wait->vdev_id = vdev_id;
ether_addr_copy(wait->addr, addr);
init_completion(&wait->done);
spin_lock_bh(&ar->data_lock);
list_add(&wait->list, &ar->peer_delete_waits);
spin_unlock_bh(&ar->data_lock);
}
static void ath12k_peer_delete_wait_unregister(struct ath12k *ar,
struct ath12k_peer_delete_wait *wait)
{
spin_lock_bh(&ar->data_lock);
list_del(&wait->list);
spin_unlock_bh(&ar->data_lock);
}
void ath12k_peer_delete_resp_signal(struct ath12k *ar, u32 vdev_id, const u8 *addr)
{
struct ath12k_peer_delete_wait *wait;
guard(spinlock_bh)(&ar->data_lock);
list_for_each_entry(wait, &ar->peer_delete_waits, list) {
if (wait->vdev_id == vdev_id &&
ether_addr_equal(wait->addr, addr)) {
complete(&wait->done);
return;
}
}
ath12k_warn(ar->ab, "failed to find link peer with vdev id %u addr %pM\n",
vdev_id, addr);
}
void ath12k_peer_delete_wait_flush(struct ath12k *ar)
{
struct ath12k_peer_delete_wait *wait;
spin_lock_bh(&ar->data_lock);
list_for_each_entry(wait, &ar->peer_delete_waits, list)
complete(&wait->done);
spin_unlock_bh(&ar->data_lock);
}
static int ath12k_wait_for_dp_link_peer_common(struct ath12k_base *ab, int vdev_id,
const u8 *addr, bool expect_mapped)
{
int ret;
struct ath12k_dp *dp = ath12k_ab_to_dp(ab);
ret = wait_event_timeout(ab->peer_mapping_wq, ({
bool mapped;
spin_lock_bh(&dp->dp_lock);
mapped = !!ath12k_dp_link_peer_find_by_vdev_and_addr(dp,
vdev_id,
addr);
spin_unlock_bh(&dp->dp_lock);
(mapped == expect_mapped ||
test_bit(ATH12K_FLAG_CRASH_FLUSH, &ab->dev_flags));
}), 3 * HZ);
if (ret <= 0)
return -ETIMEDOUT;
return 0;
}
void ath12k_peer_cleanup(struct ath12k *ar, u32 vdev_id)
{
struct ath12k_dp_link_peer *peer, *tmp;
struct ath12k_base *ab = ar->ab;
struct ath12k_dp *dp = ath12k_ab_to_dp(ab);
lockdep_assert_wiphy(ath12k_ar_to_hw(ar)->wiphy);
spin_lock_bh(&dp->dp_lock);
list_for_each_entry_safe(peer, tmp, &dp->peers, list) {
if (peer->vdev_id != vdev_id)
continue;
ath12k_warn(ab, "removing stale peer %pM from vdev_id %d\n",
peer->addr, vdev_id);
ath12k_dp_link_peer_free(peer);
ar->num_peers--;
}
spin_unlock_bh(&dp->dp_lock);
}
static int ath12k_wait_for_peer_deleted(struct ath12k *ar, int vdev_id, const u8 *addr)
{
return ath12k_wait_for_dp_link_peer_common(ar->ab, vdev_id, addr, false);
}
int ath12k_wait_for_peer_delete_done(struct ath12k *ar,
struct ath12k_peer_delete_wait *wait)
{
unsigned long time_left;
int ret;
ret = ath12k_wait_for_peer_deleted(ar, wait->vdev_id, wait->addr);
if (ret) {
ath12k_warn(ar->ab, "failed wait for peer deleted\n");
return ret;
}
time_left = wait_for_completion_timeout(&wait->done, 3 * HZ);
if (time_left == 0) {
ath12k_warn(ar->ab, "Timeout in receiving peer delete response\n");
return -ETIMEDOUT;
}
return 0;
}
static int ath12k_peer_delete_send(struct ath12k *ar, u32 vdev_id, const u8 *addr)
{
struct ath12k_base *ab = ar->ab;
int ret;
lockdep_assert_wiphy(ath12k_ar_to_hw(ar)->wiphy);
ret = ath12k_wmi_send_peer_delete_cmd(ar, addr, vdev_id);
if (ret) {
ath12k_warn(ab,
"failed to delete peer vdev_id %d addr %pM ret %d\n",
vdev_id, addr, ret);
return ret;
}
return 0;
}
int ath12k_peer_delete(struct ath12k *ar, u32 vdev_id, u8 *addr)
{
struct ath12k_peer_delete_wait wait;
int ret;
lockdep_assert_wiphy(ath12k_ar_to_hw(ar)->wiphy);
ath12k_dp_link_peer_unassign(ath12k_ab_to_dp(ar->ab),
&(ath12k_ar_to_ah(ar)->dp_hw), vdev_id,
addr, ar->hw_link_id);
/*
* Register the stack waiter before sending so the resp_event for
* this peer cannot arrive while no waiter is queued.
*/
ath12k_peer_delete_wait_register(ar, &wait, vdev_id, addr);
ret = ath12k_peer_delete_send(ar, vdev_id, addr);
if (ret)
goto out;
ret = ath12k_wait_for_peer_delete_done(ar, &wait);
if (ret)
goto out;
ar->num_peers--;
out:
ath12k_peer_delete_wait_unregister(ar, &wait);
return ret;
}
static int ath12k_wait_for_peer_created(struct ath12k *ar, int vdev_id, const u8 *addr)
{
return ath12k_wait_for_dp_link_peer_common(ar->ab, vdev_id, addr, true);
}
int ath12k_peer_create(struct ath12k *ar, struct ath12k_link_vif *arvif,
struct ieee80211_sta *sta,
struct ath12k_wmi_peer_create_arg *arg)
{
struct ieee80211_vif *vif = ath12k_ahvif_to_vif(arvif->ahvif);
struct ath12k_vif *ahvif = arvif->ahvif;
struct ath12k_dp_link_vif *dp_link_vif;
struct ath12k_link_sta *arsta;
u8 link_id = arvif->link_id;
struct ath12k_dp_link_peer *peer;
struct ath12k_sta *ahsta;
u16 ml_peer_id;
int ret;
struct ath12k_dp *dp = ath12k_ab_to_dp(ar->ab);
lockdep_assert_wiphy(ath12k_ar_to_hw(ar)->wiphy);
dp_link_vif = ath12k_dp_vif_to_dp_link_vif(&ahvif->dp_vif, link_id);
if (ar->num_peers > (ar->max_num_peers - 1)) {
ath12k_warn(ar->ab,
"failed to create peer due to insufficient peer entry resource in firmware\n");
return -ENOBUFS;
}
spin_lock_bh(&dp->dp_lock);
peer = ath12k_dp_link_peer_find_by_pdev_and_addr(dp, ar->pdev_idx,
arg->peer_addr);
if (peer) {
spin_unlock_bh(&dp->dp_lock);
return -EINVAL;
}
spin_unlock_bh(&dp->dp_lock);
ret = ath12k_wmi_send_peer_create_cmd(ar, arg);
if (ret) {
ath12k_warn(ar->ab,
"failed to send peer create vdev_id %d ret %d\n",
arg->vdev_id, ret);
return ret;
}
ret = ath12k_wait_for_peer_created(ar, arg->vdev_id,
arg->peer_addr);
if (ret)
return ret;
spin_lock_bh(&dp->dp_lock);
peer = ath12k_dp_link_peer_find_by_vdev_and_addr(dp, arg->vdev_id,
arg->peer_addr);
if (!peer) {
struct ath12k_peer_delete_wait wait;
spin_unlock_bh(&dp->dp_lock);
ath12k_warn(ar->ab, "failed to find peer %pM on vdev %i after creation\n",
arg->peer_addr, arg->vdev_id);
ath12k_peer_delete_wait_register(ar, &wait, arg->vdev_id,
arg->peer_addr);
ret = ath12k_wmi_send_peer_delete_cmd(ar, arg->peer_addr,
arg->vdev_id);
if (ret) {
ath12k_warn(ar->ab, "failed to delete peer vdev_id %d addr %pM\n",
arg->vdev_id, arg->peer_addr);
ath12k_peer_delete_wait_unregister(ar, &wait);
return ret;
}
ret = ath12k_wait_for_peer_delete_done(ar, &wait);
ath12k_peer_delete_wait_unregister(ar, &wait);
if (ret)
return ret;
return -ENOENT;
}
peer->pdev_idx = ar->pdev_idx;
peer->sta = sta;
if (vif->type == NL80211_IFTYPE_STATION) {
dp_link_vif->ast_hash = peer->ast_hash;
dp_link_vif->ast_idx = peer->hw_peer_id;
}
if (sta) {
ahsta = ath12k_sta_to_ahsta(sta);
arsta = wiphy_dereference(ath12k_ar_to_hw(ar)->wiphy,
ahsta->link[link_id]);
/* TODO: Split DP related field usage to DP peer structure */
arsta->tcl_metadata = u16_encode_bits(0, HTT_TCL_META_DATA_TYPE) |
u16_encode_bits(peer->peer_id,
HTT_TCL_META_DATA_PEER_ID) |
u16_encode_bits(0, HTT_TCL_META_DATA_VALID_HTT);
arsta->ast_hash = peer->ast_hash;
arsta->ast_idx = peer->hw_peer_id;
peer->link_id = arsta->link_id;
/* Fill ML info into created peer */
if (sta->mlo) {
ml_peer_id = ahsta->ml_peer_id;
/*
* For chips where firmware allocates the ML peer ID,
* ml_peer_id is ATH12K_MLO_PEER_ID_PENDING here. The
* MLO_RX_PEER_MAP HTT event handler fixes up
* peer->ml_id once the ID is known.
*/
if (ml_peer_id == ATH12K_MLO_PEER_ID_PENDING)
peer->ml_id = ATH12K_MLO_PEER_ID_INVALID;
else
peer->ml_id = ml_peer_id;
ether_addr_copy(peer->ml_addr, sta->addr);
/* the assoc link is considered primary for now */
peer->primary_link = arsta->is_assoc_link;
peer->mlo = true;
} else {
peer->ml_id = ATH12K_MLO_PEER_ID_INVALID;
peer->primary_link = true;
peer->mlo = false;
}
}
ar->num_peers++;
spin_unlock_bh(&dp->dp_lock);
if (arvif->link_id < IEEE80211_MLD_MAX_NUM_LINKS) {
ret = ath12k_dp_link_peer_assign(ath12k_ab_to_dp(ar->ab),
&(ath12k_ar_to_ah(ar)->dp_hw),
arvif->vdev_id, sta,
(u8 *)arg->peer_addr, link_id,
ar->hw_link_id);
}
if (vif->type == NL80211_IFTYPE_AP && peer->dp_peer)
peer->dp_peer->ucast_ra_only = true;
return ret;
}
u16 ath12k_peer_ml_alloc(struct ath12k_hw *ah)
{
u16 ml_peer_id;
lockdep_assert_wiphy(ah->hw->wiphy);
for (ml_peer_id = 0; ml_peer_id < ATH12K_MAX_MLO_PEERS; ml_peer_id++) {
if (test_bit(ml_peer_id, ah->free_ml_peer_id_map))
continue;
set_bit(ml_peer_id, ah->free_ml_peer_id_map);
break;
}
if (ml_peer_id == ATH12K_MAX_MLO_PEERS)
return ATH12K_MLO_PEER_ID_INVALID;
return ml_peer_id | ATH12K_PEER_ML_ID_VALID;
}
void ath12k_peer_ml_free(struct ath12k_hw *ah, struct ath12k_sta *ahsta)
{
lockdep_assert_wiphy(ah->hw->wiphy);
/*
* Only devices that allocate the ID on the host own a slot in
* free_ml_peer_id_map.
*/
if (ah->host_alloc_ml_id &&
(ahsta->ml_peer_id <
(ATH12K_MAX_MLO_PEERS | ATH12K_PEER_ML_ID_VALID)))
clear_bit(ahsta->ml_peer_id & ~ATH12K_PEER_ML_ID_VALID,
ah->free_ml_peer_id_map);
ahsta->ml_peer_id = ATH12K_MLO_PEER_ID_INVALID;
}
int ath12k_peer_mlo_link_peers_delete(struct ath12k_vif *ahvif, struct ath12k_sta *ahsta)
{
DECLARE_BITMAP(registered, IEEE80211_MLD_MAX_NUM_LINKS);
struct ieee80211_sta *sta = ath12k_ahsta_to_sta(ahsta);
struct ath12k_hw *ah = ahvif->ah;
struct ath12k_link_vif *arvif;
struct ath12k_link_sta *arsta;
int ret, err_ret = 0;
unsigned long links;
struct ath12k *ar;
u8 link_id;
lockdep_assert_wiphy(ah->hw->wiphy);
if (!sta->mlo)
return -EINVAL;
struct ath12k_peer_delete_wait *waits __free(kfree) =
kzalloc_objs(*waits, IEEE80211_MLD_MAX_NUM_LINKS);
if (!waits)
return -ENOMEM;
bitmap_zero(registered, IEEE80211_MLD_MAX_NUM_LINKS);
/*
* Firmware expects delete of all link peers at once before waiting
* for reception of peer unmap or delete responses. Phase 1 registers
* a per-link stack waiter and sends WMI peer delete for every
* link; the resp_event handler matches each response to its
* (vdev_id, addr) waiter on ar->peer_delete_waits.
*/
links = ahsta->links_map;
for_each_set_bit(link_id, &links, IEEE80211_MLD_MAX_NUM_LINKS) {
arvif = wiphy_dereference(ah->hw->wiphy, ahvif->link[link_id]);
arsta = wiphy_dereference(ah->hw->wiphy, ahsta->link[link_id]);
if (!arvif || !arsta)
continue;
ar = arvif->ar;
if (!ar)
continue;
ath12k_dp_peer_cleanup(ar, arvif->vdev_id, arsta->addr);
ath12k_dp_link_peer_unassign(ath12k_ab_to_dp(ar->ab),
&(ath12k_ar_to_ah(ar)->dp_hw),
arvif->vdev_id, arsta->addr,
ar->hw_link_id);
ath12k_peer_delete_wait_register(ar, &waits[link_id],
arvif->vdev_id, arsta->addr);
ret = ath12k_peer_delete_send(ar, arvif->vdev_id, arsta->addr);
if (ret) {
ath12k_warn(ar->ab,
"failed to delete peer vdev_id %d addr %pM ret %d\n",
arvif->vdev_id, arsta->addr, ret);
err_ret = ret;
ath12k_peer_delete_wait_unregister(ar, &waits[link_id]);
continue;
}
set_bit(link_id, registered);
}
/*
* Phase 2: wait for unmap + delete_resp on each registered link
* and tear down the waiter.
*/
links = ahsta->links_map;
for_each_set_bit(link_id, &links, IEEE80211_MLD_MAX_NUM_LINKS) {
if (!test_bit(link_id, registered))
continue;
arvif = wiphy_dereference(ah->hw->wiphy, ahvif->link[link_id]);
ar = arvif->ar;
ret = ath12k_wait_for_peer_delete_done(ar, &waits[link_id]);
ath12k_peer_delete_wait_unregister(ar, &waits[link_id]);
if (ret) {
err_ret = ret;
continue;
}
ar->num_peers--;
}
return err_ret;
}
static int ath12k_link_sta_rhash_insert(struct ath12k_base *ab,
struct ath12k_link_sta *arsta)
{
struct ath12k_link_sta *tmp;
lockdep_assert_held(&ab->base_lock);
tmp = rhashtable_lookup_get_insert_fast(ab->rhead_sta_addr, &arsta->rhash_addr,
ab->rhash_sta_addr_param);
if (!tmp)
return 0;
else if (IS_ERR(tmp))
return PTR_ERR(tmp);
else
return -EEXIST;
}
static int ath12k_link_sta_rhash_remove(struct ath12k_base *ab,
struct ath12k_link_sta *arsta)
{
int ret;
lockdep_assert_held(&ab->base_lock);
ret = rhashtable_remove_fast(ab->rhead_sta_addr, &arsta->rhash_addr,
ab->rhash_sta_addr_param);
if (ret && ret != -ENOENT)
return ret;
return 0;
}
int ath12k_link_sta_rhash_add(struct ath12k_base *ab,
struct ath12k_link_sta *arsta)
{
int ret;
lockdep_assert_held(&ab->base_lock);
ret = ath12k_link_sta_rhash_insert(ab, arsta);
if (ret)
ath12k_warn(ab, "failed to add arsta %pM in rhash_addr ret %d\n",
arsta->addr, ret);
return ret;
}
void ath12k_link_sta_rhash_delete(struct ath12k_base *ab,
struct ath12k_link_sta *arsta)
{
/*
* Return type of this function is void since there is nothing to be
* done in failure case
*/
int ret;
lockdep_assert_held(&ab->base_lock);
ret = ath12k_link_sta_rhash_remove(ab, arsta);
if (ret)
ath12k_warn(ab,
"failed to remove arsta %pM in rhash_addr ret %d\n",
arsta->addr, ret);
}
int ath12k_link_sta_rhash_tbl_init(struct ath12k_base *ab)
{
struct rhashtable_params *param;
struct rhashtable *rhash_addr_tbl;
int ret;
rhash_addr_tbl = kzalloc_obj(*ab->rhead_sta_addr);
if (!rhash_addr_tbl)
return -ENOMEM;
param = &ab->rhash_sta_addr_param;
param->key_offset = offsetof(struct ath12k_link_sta, addr);
param->head_offset = offsetof(struct ath12k_link_sta, rhash_addr);
param->key_len = sizeof_field(struct ath12k_link_sta, addr);
param->automatic_shrinking = true;
param->nelem_hint = ab->num_radios * ath12k_core_get_max_peers_per_radio(ab);
ret = rhashtable_init(rhash_addr_tbl, param);
if (ret) {
ath12k_warn(ab, "failed to init peer addr rhash table %d\n",
ret);
goto err_free;
}
ab->rhead_sta_addr = rhash_addr_tbl;
return 0;
err_free:
kfree(rhash_addr_tbl);
return ret;
}
void ath12k_link_sta_rhash_tbl_destroy(struct ath12k_base *ab)
{
if (!ab->rhead_sta_addr)
return;
rhashtable_destroy(ab->rhead_sta_addr);
kfree(ab->rhead_sta_addr);
ab->rhead_sta_addr = NULL;
}
struct ath12k_link_sta *ath12k_link_sta_find_by_addr(struct ath12k_base *ab,
const u8 *addr)
{
lockdep_assert_held(&ab->base_lock);
return rhashtable_lookup_fast(ab->rhead_sta_addr, addr,
ab->rhash_sta_addr_param);
}
|