18 static void qpolicy_simple_push(struct sock *sk, struct sk_buff *skb)  in qpolicy_simple_push()  argument
20 	skb_queue_tail(&sk->sk_write_queue, skb);  in qpolicy_simple_push()
41 	struct sk_buff *skb, *best = NULL;  in qpolicy_prio_best_skb()  local
43 	skb_queue_walk(&sk->sk_write_queue, skb)  in qpolicy_prio_best_skb()
44 		if (best == NULL || skb->priority > best->priority)  in qpolicy_prio_best_skb()
45 			best = skb;  in qpolicy_prio_best_skb()
51 	struct sk_buff *skb, *worst = NULL;  in qpolicy_prio_worst_skb()  local
53 	skb_queue_walk(&sk->sk_write_queue, skb)  in qpolicy_prio_worst_skb()
54 		if (worst == NULL || skb->priority < worst->priority)  in qpolicy_prio_worst_skb()
55 			worst = skb;  in qpolicy_prio_worst_skb()
73 	void		(*push)	(struct sock *sk, struct sk_buff *skb);
96 void dccp_qpolicy_push(struct sock *sk, struct sk_buff *skb)  in dccp_qpolicy_push()  argument
98 	qpol_table[dccp_sk(sk)->dccps_qpolicy].push(sk, skb);  in dccp_qpolicy_push()
106 void dccp_qpolicy_drop(struct sock *sk, struct sk_buff *skb)  in dccp_qpolicy_drop()  argument
108 	if (skb != NULL) {  in dccp_qpolicy_drop()
109 		skb_unlink(skb, &sk->sk_write_queue);  in dccp_qpolicy_drop()
110 		kfree_skb(skb);  in dccp_qpolicy_drop()
121 	struct sk_buff *skb = dccp_qpolicy_top(sk);  in dccp_qpolicy_pop()  local
123 	if (skb != NULL) {  in dccp_qpolicy_pop()
125 		skb->priority = 0;  in dccp_qpolicy_pop()
126 		skb_unlink(skb, &sk->sk_write_queue);  in dccp_qpolicy_pop()
128 	return skb;  in dccp_qpolicy_pop()