Home
last modified time | relevance | path

Searched refs:namedq (Results 1 – 4 of 4) sorted by relevance

/linux/net/tipc/
H A Dname_distr.c313 static struct sk_buff *tipc_named_dequeue(struct sk_buff_head *namedq, in tipc_named_dequeue() argument
320 spin_lock_bh(&namedq->lock); in tipc_named_dequeue()
321 skb_queue_walk_safe(namedq, skb, tmp) { in tipc_named_dequeue()
323 __skb_unlink(skb, namedq); in tipc_named_dequeue()
335 __skb_unlink(skb, namedq); in tipc_named_dequeue()
336 spin_unlock_bh(&namedq->lock); in tipc_named_dequeue()
342 __skb_unlink(skb, namedq); in tipc_named_dequeue()
343 spin_unlock_bh(&namedq->lock); in tipc_named_dequeue()
348 __skb_unlink(skb, namedq); in tipc_named_dequeue()
353 spin_unlock_bh(&namedq->lock); in tipc_named_dequeue()
[all …]
H A Dlink.h81 struct sk_buff_head *namedq,
86 struct sk_buff_head *namedq,
H A Dname_distr.h73 void tipc_named_rcv(struct net *net, struct sk_buff_head *namedq,
H A Dnode.c77 struct sk_buff_head namedq; member
492 &n->bc_entry.namedq, snd_l, &n->bc_entry.link)) { in tipc_node_create()
567 skb_queue_head_init(&n->bc_entry.namedq); in tipc_node_create()
582 &n->bc_entry.namedq, snd_l, &n->bc_entry.link)) { in tipc_node_create()
1286 &n->bc_entry.namedq, &l)) { in tipc_node_check_dest()
1531 skb_queue_purge(&n->bc_entry.namedq); in node_lost_contact()
1910 if (!skb_queue_empty(&n->bc_entry.namedq)) in tipc_node_bc_rcv()
1911 tipc_named_rcv(net, &n->bc_entry.namedq, in tipc_node_bc_rcv()
2185 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq))) in tipc_rcv()
2186 tipc_named_rcv(net, &n->bc_entry.namedq, in tipc_rcv()