1 /* Copyright (c) 2014 Broadcom Corporation
3 * Permission to use, copy, modify, and/or distribute this software for any
4 * purpose with or without fee is hereby granted, provided that the above
5 * copyright notice and this permission notice appear in all copies.
7 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
8 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
9 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
10 * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
11 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
12 * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
13 * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 #include <linux/types.h>
18 #include <linux/netdevice.h>
19 #include <linux/etherdevice.h>
20 #include <brcmu_utils.h>
31 #define BRCMF_FLOWRING_HIGH 1024
32 #define BRCMF_FLOWRING_LOW (BRCMF_FLOWRING_HIGH - 256)
33 #define BRCMF_FLOWRING_INVALID_IFIDX 0xff
35 #define BRCMF_FLOWRING_HASH_AP(da, fifo, ifidx) (da[5] + fifo + ifidx * 16)
36 #define BRCMF_FLOWRING_HASH_STA(fifo, ifidx) (fifo + ifidx * 16)
38 static const u8 brcmf_flowring_prio2fifo
[] = {
51 brcmf_flowring_is_tdls_mac(struct brcmf_flowring
*flow
, u8 mac
[ETH_ALEN
])
53 struct brcmf_flowring_tdls_entry
*search
;
55 search
= flow
->tdls_entry
;
58 if (memcmp(search
->mac
, mac
, ETH_ALEN
) == 0)
60 search
= search
->next
;
67 u32
brcmf_flowring_lookup(struct brcmf_flowring
*flow
, u8 da
[ETH_ALEN
],
70 struct brcmf_flowring_hash
*hash
;
78 fifo
= brcmf_flowring_prio2fifo
[prio
];
79 sta
= (flow
->addr_mode
[ifidx
] == ADDR_INDIRECT
);
81 if ((!sta
) && (is_multicast_ether_addr(da
))) {
85 if ((sta
) && (flow
->tdls_active
) &&
86 (brcmf_flowring_is_tdls_mac(flow
, da
))) {
89 hash_idx
= sta
? BRCMF_FLOWRING_HASH_STA(fifo
, ifidx
) :
90 BRCMF_FLOWRING_HASH_AP(mac
, fifo
, ifidx
);
93 for (i
= 0; i
< BRCMF_FLOWRING_HASHSIZE
; i
++) {
94 if ((sta
|| (memcmp(hash
[hash_idx
].mac
, mac
, ETH_ALEN
) == 0)) &&
95 (hash
[hash_idx
].fifo
== fifo
) &&
96 (hash
[hash_idx
].ifidx
== ifidx
)) {
103 return hash
[hash_idx
].flowid
;
105 return BRCMF_FLOWRING_INVALID_ID
;
109 u32
brcmf_flowring_create(struct brcmf_flowring
*flow
, u8 da
[ETH_ALEN
],
112 struct brcmf_flowring_ring
*ring
;
113 struct brcmf_flowring_hash
*hash
;
121 fifo
= brcmf_flowring_prio2fifo
[prio
];
122 sta
= (flow
->addr_mode
[ifidx
] == ADDR_INDIRECT
);
124 if ((!sta
) && (is_multicast_ether_addr(da
))) {
125 mac
= (u8
*)ALLFFMAC
;
128 if ((sta
) && (flow
->tdls_active
) &&
129 (brcmf_flowring_is_tdls_mac(flow
, da
))) {
132 hash_idx
= sta
? BRCMF_FLOWRING_HASH_STA(fifo
, ifidx
) :
133 BRCMF_FLOWRING_HASH_AP(mac
, fifo
, ifidx
);
136 for (i
= 0; i
< BRCMF_FLOWRING_HASHSIZE
; i
++) {
137 if ((hash
[hash_idx
].ifidx
== BRCMF_FLOWRING_INVALID_IFIDX
) &&
138 (is_zero_ether_addr(hash
[hash_idx
].mac
))) {
145 for (i
= 0; i
< flow
->nrofrings
; i
++) {
146 if (flow
->rings
[i
] == NULL
)
149 if (i
== flow
->nrofrings
)
152 ring
= kzalloc(sizeof(*ring
), GFP_ATOMIC
);
156 memcpy(hash
[hash_idx
].mac
, mac
, ETH_ALEN
);
157 hash
[hash_idx
].fifo
= fifo
;
158 hash
[hash_idx
].ifidx
= ifidx
;
159 hash
[hash_idx
].flowid
= i
;
161 ring
->hash_id
= hash_idx
;
162 ring
->status
= RING_CLOSED
;
163 skb_queue_head_init(&ring
->skblist
);
164 flow
->rings
[i
] = ring
;
168 return BRCMF_FLOWRING_INVALID_ID
;
172 u8
brcmf_flowring_tid(struct brcmf_flowring
*flow
, u8 flowid
)
174 struct brcmf_flowring_ring
*ring
;
176 ring
= flow
->rings
[flowid
];
178 return flow
->hash
[ring
->hash_id
].fifo
;
182 static void brcmf_flowring_block(struct brcmf_flowring
*flow
, u8 flowid
,
185 struct brcmf_flowring_ring
*ring
;
186 struct brcmf_bus
*bus_if
;
187 struct brcmf_pub
*drvr
;
188 struct brcmf_if
*ifp
;
189 bool currently_blocked
;
194 spin_lock_irqsave(&flow
->block_lock
, flags
);
196 ring
= flow
->rings
[flowid
];
197 ifidx
= brcmf_flowring_ifidx_get(flow
, flowid
);
199 currently_blocked
= false;
200 for (i
= 0; i
< flow
->nrofrings
; i
++) {
201 if (flow
->rings
[i
]) {
202 ring
= flow
->rings
[i
];
203 if ((ring
->status
== RING_OPEN
) &&
204 (brcmf_flowring_ifidx_get(flow
, i
) == ifidx
)) {
206 currently_blocked
= true;
212 ring
->blocked
= blocked
;
213 if (currently_blocked
== blocked
) {
214 spin_unlock_irqrestore(&flow
->block_lock
, flags
);
218 bus_if
= dev_get_drvdata(flow
->dev
);
220 ifp
= drvr
->iflist
[ifidx
];
221 brcmf_txflowblock_if(ifp
, BRCMF_NETIF_STOP_REASON_FLOW
, blocked
);
223 spin_unlock_irqrestore(&flow
->block_lock
, flags
);
227 void brcmf_flowring_delete(struct brcmf_flowring
*flow
, u8 flowid
)
229 struct brcmf_flowring_ring
*ring
;
233 ring
= flow
->rings
[flowid
];
236 brcmf_flowring_block(flow
, flowid
, false);
237 hash_idx
= ring
->hash_id
;
238 flow
->hash
[hash_idx
].ifidx
= BRCMF_FLOWRING_INVALID_IFIDX
;
239 eth_zero_addr(flow
->hash
[hash_idx
].mac
);
240 flow
->rings
[flowid
] = NULL
;
242 skb
= skb_dequeue(&ring
->skblist
);
244 brcmu_pkt_buf_free_skb(skb
);
245 skb
= skb_dequeue(&ring
->skblist
);
252 void brcmf_flowring_enqueue(struct brcmf_flowring
*flow
, u8 flowid
,
255 struct brcmf_flowring_ring
*ring
;
257 ring
= flow
->rings
[flowid
];
259 skb_queue_tail(&ring
->skblist
, skb
);
261 if (!ring
->blocked
&&
262 (skb_queue_len(&ring
->skblist
) > BRCMF_FLOWRING_HIGH
)) {
263 brcmf_flowring_block(flow
, flowid
, true);
264 brcmf_dbg(MSGBUF
, "Flowcontrol: BLOCK for ring %d\n", flowid
);
265 /* To prevent (work around) possible race condition, check
266 * queue len again. It is also possible to use locking to
267 * protect, but that is undesirable for every enqueue and
268 * dequeue. This simple check will solve a possible race
269 * condition if it occurs.
271 if (skb_queue_len(&ring
->skblist
) < BRCMF_FLOWRING_LOW
)
272 brcmf_flowring_block(flow
, flowid
, false);
277 struct sk_buff
*brcmf_flowring_dequeue(struct brcmf_flowring
*flow
, u8 flowid
)
279 struct brcmf_flowring_ring
*ring
;
282 ring
= flow
->rings
[flowid
];
283 if (ring
->status
!= RING_OPEN
)
286 skb
= skb_dequeue(&ring
->skblist
);
289 (skb_queue_len(&ring
->skblist
) < BRCMF_FLOWRING_LOW
)) {
290 brcmf_flowring_block(flow
, flowid
, false);
291 brcmf_dbg(MSGBUF
, "Flowcontrol: OPEN for ring %d\n", flowid
);
298 void brcmf_flowring_reinsert(struct brcmf_flowring
*flow
, u8 flowid
,
301 struct brcmf_flowring_ring
*ring
;
303 ring
= flow
->rings
[flowid
];
305 skb_queue_head(&ring
->skblist
, skb
);
309 u32
brcmf_flowring_qlen(struct brcmf_flowring
*flow
, u8 flowid
)
311 struct brcmf_flowring_ring
*ring
;
313 ring
= flow
->rings
[flowid
];
317 if (ring
->status
!= RING_OPEN
)
320 return skb_queue_len(&ring
->skblist
);
324 void brcmf_flowring_open(struct brcmf_flowring
*flow
, u8 flowid
)
326 struct brcmf_flowring_ring
*ring
;
328 ring
= flow
->rings
[flowid
];
330 brcmf_err("Ring NULL, for flowid %d\n", flowid
);
334 ring
->status
= RING_OPEN
;
338 u8
brcmf_flowring_ifidx_get(struct brcmf_flowring
*flow
, u8 flowid
)
340 struct brcmf_flowring_ring
*ring
;
343 ring
= flow
->rings
[flowid
];
344 hash_idx
= ring
->hash_id
;
346 return flow
->hash
[hash_idx
].ifidx
;
350 struct brcmf_flowring
*brcmf_flowring_attach(struct device
*dev
, u16 nrofrings
)
352 struct brcmf_flowring
*flow
;
355 flow
= kzalloc(sizeof(*flow
), GFP_KERNEL
);
358 flow
->nrofrings
= nrofrings
;
359 spin_lock_init(&flow
->block_lock
);
360 for (i
= 0; i
< ARRAY_SIZE(flow
->addr_mode
); i
++)
361 flow
->addr_mode
[i
] = ADDR_INDIRECT
;
362 for (i
= 0; i
< ARRAY_SIZE(flow
->hash
); i
++)
363 flow
->hash
[i
].ifidx
= BRCMF_FLOWRING_INVALID_IFIDX
;
364 flow
->rings
= kcalloc(nrofrings
, sizeof(*flow
->rings
),
376 void brcmf_flowring_detach(struct brcmf_flowring
*flow
)
378 struct brcmf_bus
*bus_if
= dev_get_drvdata(flow
->dev
);
379 struct brcmf_pub
*drvr
= bus_if
->drvr
;
380 struct brcmf_flowring_tdls_entry
*search
;
381 struct brcmf_flowring_tdls_entry
*remove
;
384 for (flowid
= 0; flowid
< flow
->nrofrings
; flowid
++) {
385 if (flow
->rings
[flowid
])
386 brcmf_msgbuf_delete_flowring(drvr
, flowid
);
389 search
= flow
->tdls_entry
;
392 search
= search
->next
;
400 void brcmf_flowring_configure_addr_mode(struct brcmf_flowring
*flow
, int ifidx
,
401 enum proto_addr_mode addr_mode
)
403 struct brcmf_bus
*bus_if
= dev_get_drvdata(flow
->dev
);
404 struct brcmf_pub
*drvr
= bus_if
->drvr
;
408 if (flow
->addr_mode
[ifidx
] != addr_mode
) {
409 for (i
= 0; i
< ARRAY_SIZE(flow
->hash
); i
++) {
410 if (flow
->hash
[i
].ifidx
== ifidx
) {
411 flowid
= flow
->hash
[i
].flowid
;
412 if (flow
->rings
[flowid
]->status
!= RING_OPEN
)
414 flow
->rings
[flowid
]->status
= RING_CLOSING
;
415 brcmf_msgbuf_delete_flowring(drvr
, flowid
);
418 flow
->addr_mode
[ifidx
] = addr_mode
;
423 void brcmf_flowring_delete_peer(struct brcmf_flowring
*flow
, int ifidx
,
426 struct brcmf_bus
*bus_if
= dev_get_drvdata(flow
->dev
);
427 struct brcmf_pub
*drvr
= bus_if
->drvr
;
428 struct brcmf_flowring_hash
*hash
;
429 struct brcmf_flowring_tdls_entry
*prev
;
430 struct brcmf_flowring_tdls_entry
*search
;
435 sta
= (flow
->addr_mode
[ifidx
] == ADDR_INDIRECT
);
437 search
= flow
->tdls_entry
;
440 if (memcmp(search
->mac
, peer
, ETH_ALEN
) == 0) {
445 search
= search
->next
;
449 for (i
= 0; i
< BRCMF_FLOWRING_HASHSIZE
; i
++) {
450 if ((sta
|| (memcmp(hash
[i
].mac
, peer
, ETH_ALEN
) == 0)) &&
451 (hash
[i
].ifidx
== ifidx
)) {
452 flowid
= flow
->hash
[i
].flowid
;
453 if (flow
->rings
[flowid
]->status
== RING_OPEN
) {
454 flow
->rings
[flowid
]->status
= RING_CLOSING
;
455 brcmf_msgbuf_delete_flowring(drvr
, flowid
);
462 prev
->next
= search
->next
;
464 flow
->tdls_entry
= search
->next
;
466 if (flow
->tdls_entry
== NULL
)
467 flow
->tdls_active
= false;
472 void brcmf_flowring_add_tdls_peer(struct brcmf_flowring
*flow
, int ifidx
,
475 struct brcmf_flowring_tdls_entry
*tdls_entry
;
476 struct brcmf_flowring_tdls_entry
*search
;
478 tdls_entry
= kzalloc(sizeof(*tdls_entry
), GFP_ATOMIC
);
479 if (tdls_entry
== NULL
)
482 memcpy(tdls_entry
->mac
, peer
, ETH_ALEN
);
483 tdls_entry
->next
= NULL
;
484 if (flow
->tdls_entry
== NULL
) {
485 flow
->tdls_entry
= tdls_entry
;
487 search
= flow
->tdls_entry
;
488 if (memcmp(search
->mac
, peer
, ETH_ALEN
) == 0)
490 while (search
->next
) {
491 search
= search
->next
;
492 if (memcmp(search
->mac
, peer
, ETH_ALEN
) == 0)
495 search
->next
= tdls_entry
;
498 flow
->tdls_active
= true;