aboutsummaryrefslogtreecommitdiffstats
path: root/net/atm/atm_misc.c
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
committerLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
commit1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 (patch)
tree0bba044c4ce775e45a88a51686b5d9f90697ea9d /net/atm/atm_misc.c
Linux-2.6.12-rc2v2.6.12-rc2
Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip!
Diffstat (limited to 'net/atm/atm_misc.c')
-rw-r--r--net/atm/atm_misc.c106
1 files changed, 106 insertions, 0 deletions
diff --git a/net/atm/atm_misc.c b/net/atm/atm_misc.c
new file mode 100644
index 000000000000..b2113c3454ae
--- /dev/null
+++ b/net/atm/atm_misc.c
@@ -0,0 +1,106 @@
1/* net/atm/atm_misc.c - Various functions for use by ATM drivers */
2
3/* Written 1995-2000 by Werner Almesberger, EPFL ICA */
4
5
6#include <linux/module.h>
7#include <linux/atm.h>
8#include <linux/atmdev.h>
9#include <linux/skbuff.h>
10#include <linux/sonet.h>
11#include <linux/bitops.h>
12#include <asm/atomic.h>
13#include <asm/errno.h>
14
15
16int atm_charge(struct atm_vcc *vcc,int truesize)
17{
18 atm_force_charge(vcc,truesize);
19 if (atomic_read(&sk_atm(vcc)->sk_rmem_alloc) <= sk_atm(vcc)->sk_rcvbuf)
20 return 1;
21 atm_return(vcc,truesize);
22 atomic_inc(&vcc->stats->rx_drop);
23 return 0;
24}
25
26
27struct sk_buff *atm_alloc_charge(struct atm_vcc *vcc,int pdu_size,
28 int gfp_flags)
29{
30 struct sock *sk = sk_atm(vcc);
31 int guess = atm_guess_pdu2truesize(pdu_size);
32
33 atm_force_charge(vcc,guess);
34 if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf) {
35 struct sk_buff *skb = alloc_skb(pdu_size,gfp_flags);
36
37 if (skb) {
38 atomic_add(skb->truesize-guess,
39 &sk->sk_rmem_alloc);
40 return skb;
41 }
42 }
43 atm_return(vcc,guess);
44 atomic_inc(&vcc->stats->rx_drop);
45 return NULL;
46}
47
48
49/*
50 * atm_pcr_goal returns the positive PCR if it should be rounded up, the
51 * negative PCR if it should be rounded down, and zero if the maximum available
52 * bandwidth should be used.
53 *
54 * The rules are as follows (* = maximum, - = absent (0), x = value "x",
55 * (x+ = x or next value above x, x- = x or next value below):
56 *
57 * min max pcr result min max pcr result
58 * - - - * (UBR only) x - - x+
59 * - - * * x - * *
60 * - - z z- x - z z-
61 * - * - * x * - x+
62 * - * * * x * * *
63 * - * z z- x * z z-
64 * - y - y- x y - x+
65 * - y * y- x y * y-
66 * - y z z- x y z z-
67 *
68 * All non-error cases can be converted with the following simple set of rules:
69 *
70 * if pcr == z then z-
71 * else if min == x && pcr == - then x+
72 * else if max == y then y-
73 * else *
74 */
75
76
77int atm_pcr_goal(struct atm_trafprm *tp)
78{
79 if (tp->pcr && tp->pcr != ATM_MAX_PCR) return -tp->pcr;
80 if (tp->min_pcr && !tp->pcr) return tp->min_pcr;
81 if (tp->max_pcr != ATM_MAX_PCR) return -tp->max_pcr;
82 return 0;
83}
84
85
86void sonet_copy_stats(struct k_sonet_stats *from,struct sonet_stats *to)
87{
88#define __HANDLE_ITEM(i) to->i = atomic_read(&from->i)
89 __SONET_ITEMS
90#undef __HANDLE_ITEM
91}
92
93
94void sonet_subtract_stats(struct k_sonet_stats *from,struct sonet_stats *to)
95{
96#define __HANDLE_ITEM(i) atomic_sub(to->i,&from->i)
97 __SONET_ITEMS
98#undef __HANDLE_ITEM
99}
100
101
102EXPORT_SYMBOL(atm_charge);
103EXPORT_SYMBOL(atm_alloc_charge);
104EXPORT_SYMBOL(atm_pcr_goal);
105EXPORT_SYMBOL(sonet_copy_stats);
106EXPORT_SYMBOL(sonet_subtract_stats);