Lines Matching refs:flow

43 brcmf_flowring_is_tdls_mac(struct brcmf_flowring *flow, u8 mac[ETH_ALEN])
47 search = flow->tdls_entry;
59 u32 brcmf_flowring_lookup(struct brcmf_flowring *flow, u8 da[ETH_ALEN],
71 sta = (flow->addr_mode[ifidx] == ADDR_INDIRECT);
77 if ((sta) && (flow->tdls_active) &&
78 (brcmf_flowring_is_tdls_mac(flow, da))) {
85 hash = flow->hash;
103 u32 brcmf_flowring_create(struct brcmf_flowring *flow, u8 da[ETH_ALEN],
116 sta = (flow->addr_mode[ifidx] == ADDR_INDIRECT);
122 if ((sta) && (flow->tdls_active) &&
123 (brcmf_flowring_is_tdls_mac(flow, da))) {
130 hash = flow->hash;
141 for (i = 0; i < flow->nrofrings; i++) {
142 if (flow->rings[i] == NULL)
145 if (i == flow->nrofrings)
160 flow->rings[i] = ring;
168 u8 brcmf_flowring_tid(struct brcmf_flowring *flow, u16 flowid)
172 ring = flow->rings[flowid];
174 return flow->hash[ring->hash_id].fifo;
178 static void brcmf_flowring_block(struct brcmf_flowring *flow, u16 flowid,
190 spin_lock_irqsave(&flow->block_lock, flags);
192 ring = flow->rings[flowid];
194 spin_unlock_irqrestore(&flow->block_lock, flags);
197 ifidx = brcmf_flowring_ifidx_get(flow, flowid);
200 for (i = 0; i < flow->nrofrings; i++) {
201 if ((flow->rings[i]) && (i != flowid)) {
202 ring = flow->rings[i];
204 (brcmf_flowring_ifidx_get(flow, i) == ifidx)) {
212 flow->rings[flowid]->blocked = blocked;
214 spin_unlock_irqrestore(&flow->block_lock, flags);
218 bus_if = dev_get_drvdata(flow->dev);
223 spin_unlock_irqrestore(&flow->block_lock, flags);
227 void brcmf_flowring_delete(struct brcmf_flowring *flow, u16 flowid)
229 struct brcmf_bus *bus_if = dev_get_drvdata(flow->dev);
236 ring = flow->rings[flowid];
240 ifidx = brcmf_flowring_ifidx_get(flow, flowid);
243 brcmf_flowring_block(flow, flowid, false);
245 flow->hash[hash_idx].ifidx = BRCMF_FLOWRING_INVALID_IFIDX;
246 eth_zero_addr(flow->hash[hash_idx].mac);
247 flow->rings[flowid] = NULL;
259 u32 brcmf_flowring_enqueue(struct brcmf_flowring *flow, u16 flowid,
264 ring = flow->rings[flowid];
270 brcmf_flowring_block(flow, flowid, true);
279 brcmf_flowring_block(flow, flowid, false);
285 struct sk_buff *brcmf_flowring_dequeue(struct brcmf_flowring *flow, u16 flowid)
290 ring = flow->rings[flowid];
298 brcmf_flowring_block(flow, flowid, false);
306 void brcmf_flowring_reinsert(struct brcmf_flowring *flow, u16 flowid,
311 ring = flow->rings[flowid];
317 u32 brcmf_flowring_qlen(struct brcmf_flowring *flow, u16 flowid)
321 ring = flow->rings[flowid];
332 void brcmf_flowring_open(struct brcmf_flowring *flow, u16 flowid)
336 ring = flow->rings[flowid];
346 u8 brcmf_flowring_ifidx_get(struct brcmf_flowring *flow, u16 flowid)
351 ring = flow->rings[flowid];
354 return flow->hash[hash_idx].ifidx;
360 struct brcmf_flowring *flow;
363 flow = kzalloc(sizeof(*flow), GFP_KERNEL);
364 if (flow) {
365 flow->dev = dev;
366 flow->nrofrings = nrofrings;
367 spin_lock_init(&flow->block_lock);
368 for (i = 0; i < ARRAY_SIZE(flow->addr_mode); i++)
369 flow->addr_mode[i] = ADDR_INDIRECT;
370 for (i = 0; i < ARRAY_SIZE(flow->hash); i++)
371 flow->hash[i].ifidx = BRCMF_FLOWRING_INVALID_IFIDX;
372 flow->rings = kcalloc(nrofrings, sizeof(*flow->rings),
374 if (!flow->rings) {
375 kfree(flow);
376 flow = NULL;
380 return flow;
384 void brcmf_flowring_detach(struct brcmf_flowring *flow)
386 struct brcmf_bus *bus_if = dev_get_drvdata(flow->dev);
392 for (flowid = 0; flowid < flow->nrofrings; flowid++) {
393 if (flow->rings[flowid])
397 search = flow->tdls_entry;
403 kfree(flow->rings);
404 kfree(flow);
408 void brcmf_flowring_configure_addr_mode(struct brcmf_flowring *flow, int ifidx,
411 struct brcmf_bus *bus_if = dev_get_drvdata(flow->dev);
416 if (flow->addr_mode[ifidx] != addr_mode) {
417 for (i = 0; i < ARRAY_SIZE(flow->hash); i++) {
418 if (flow->hash[i].ifidx == ifidx) {
419 flowid = flow->hash[i].flowid;
420 if (flow->rings[flowid]->status != RING_OPEN)
425 flow->addr_mode[ifidx] = addr_mode;
430 void brcmf_flowring_delete_peer(struct brcmf_flowring *flow, int ifidx,
433 struct brcmf_bus *bus_if = dev_get_drvdata(flow->dev);
442 sta = (flow->addr_mode[ifidx] == ADDR_INDIRECT);
444 search = flow->tdls_entry;
455 hash = flow->hash;
459 flowid = flow->hash[i].flowid;
460 if (flow->rings[flowid]->status == RING_OPEN)
469 flow->tdls_entry = search->next;
471 if (flow->tdls_entry == NULL)
472 flow->tdls_active = false;
477 void brcmf_flowring_add_tdls_peer(struct brcmf_flowring *flow, int ifidx,
489 if (flow->tdls_entry == NULL) {
490 flow->tdls_entry = tdls_entry;
492 search = flow->tdls_entry;
503 flow->tdls_active = true;