diff options
author | Arend van Spriel <arend@broadcom.com> | 2011-11-10 14:30:29 -0500 |
---|---|---|
committer | John W. Linville <linville@tuxdriver.com> | 2011-11-11 14:28:42 -0500 |
commit | 9a95e60e0610bb8ec39c74d2c8546514a76428df (patch) | |
tree | 73bdc0f2aa241c46d1d2891712cea0d0490b5a9b /drivers/net/wireless/brcm80211/brcmutil/utils.c | |
parent | 02a588a2e3b9e0156f306a542bb6cd29ba42e1b9 (diff) |
brcm80211: util: move brcmu_pkttotlen() function to brcmfmac
The functions brcmu_pkttotlen() is only used in brcmfmac driver
so it has been moved there. It also does not use the sk_buff
next pointer anymore but walks a skb queue to determine the total
length.
Reviewed-by: Pieter-Paul Giesberts <pieterpg@broadcom.com>
Reviewed-by: Alwin Beukers <alwin@broadcom.com>
Signed-off-by: Arend van Spriel <arend@broadcom.com>
Signed-off-by: John W. Linville <linville@tuxdriver.com>
Diffstat (limited to 'drivers/net/wireless/brcm80211/brcmutil/utils.c')
-rw-r--r-- | drivers/net/wireless/brcm80211/brcmutil/utils.c | 13 |
1 files changed, 0 insertions, 13 deletions
diff --git a/drivers/net/wireless/brcm80211/brcmutil/utils.c b/drivers/net/wireless/brcm80211/brcmutil/utils.c index 57e656f987ad..3a92f72caef7 100644 --- a/drivers/net/wireless/brcm80211/brcmutil/utils.c +++ b/drivers/net/wireless/brcm80211/brcmutil/utils.c | |||
@@ -66,19 +66,6 @@ void brcmu_pkt_buf_free_skb(struct sk_buff *skb) | |||
66 | } | 66 | } |
67 | EXPORT_SYMBOL(brcmu_pkt_buf_free_skb); | 67 | EXPORT_SYMBOL(brcmu_pkt_buf_free_skb); |
68 | 68 | ||
69 | |||
70 | /* return total length of buffer chain */ | ||
71 | uint brcmu_pkttotlen(struct sk_buff *p) | ||
72 | { | ||
73 | uint total; | ||
74 | |||
75 | total = 0; | ||
76 | for (; p; p = p->next) | ||
77 | total += p->len; | ||
78 | return total; | ||
79 | } | ||
80 | EXPORT_SYMBOL(brcmu_pkttotlen); | ||
81 | |||
82 | /* | 69 | /* |
83 | * osl multiple-precedence packet queue | 70 | * osl multiple-precedence packet queue |
84 | * hi_prec is always >= the number of the highest non-empty precedence | 71 | * hi_prec is always >= the number of the highest non-empty precedence |