2 * ip_vs_est.c: simple rate estimator for IPVS
4 * Version: $Id: ip_vs_est.c,v 1.4 2002/11/30 01:50:35 wensong Exp $
6 * Authors: Wensong Zhang <wensong@linuxvirtualserver.org>
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version
11 * 2 of the License, or (at your option) any later version.
16 #include <linux/kernel.h>
17 #include <linux/jiffies.h>
18 #include <linux/slab.h>
19 #include <linux/types.h>
20 #include <linux/interrupt.h>
21 #include <linux/sysctl.h>
23 #include <net/ip_vs.h>
26 This code is to estimate rate in a shorter interval (such as 8
27 seconds) for virtual services and real servers. For measure rate in a
28 long interval, it is easy to implement a user level daemon which
29 periodically reads those statistical counters and measure rate.
31 Currently, the measurement is activated by slow timer handler. Hope
32 this measurement will not introduce too much load.
34 We measure rate during the last 8 seconds every 2 seconds:
36 avgrate = avgrate*(1-W) + rate*W
42 * The stored value for average bps is scaled by 2^5, so that maximal
43 rate is ~2.15Gbits/s, average pps and cps are scaled by 2^10.
45 * A lot code is taken from net/sched/estimator.c
49 struct ip_vs_estimator
51 struct ip_vs_estimator *next;
52 struct ip_vs_stats *stats;
68 static struct ip_vs_estimator *est_list = NULL;
69 static DEFINE_RWLOCK(est_lock);
70 static struct timer_list est_timer;
72 static void estimation_timer(unsigned long arg)
74 struct ip_vs_estimator *e;
75 struct ip_vs_stats *s;
77 u32 n_inpkts, n_outpkts;
78 u64 n_inbytes, n_outbytes;
82 for (e = est_list; e; e = e->next) {
88 n_outpkts = s->outpkts;
89 n_inbytes = s->inbytes;
90 n_outbytes = s->outbytes;
92 /* scaled by 2^10, but divided 2 seconds */
93 rate = (n_conns - e->last_conns)<<9;
94 e->last_conns = n_conns;
95 e->cps += ((long)rate - (long)e->cps)>>2;
96 s->cps = (e->cps+0x1FF)>>10;
98 rate = (n_inpkts - e->last_inpkts)<<9;
99 e->last_inpkts = n_inpkts;
100 e->inpps += ((long)rate - (long)e->inpps)>>2;
101 s->inpps = (e->inpps+0x1FF)>>10;
103 rate = (n_outpkts - e->last_outpkts)<<9;
104 e->last_outpkts = n_outpkts;
105 e->outpps += ((long)rate - (long)e->outpps)>>2;
106 s->outpps = (e->outpps+0x1FF)>>10;
108 rate = (n_inbytes - e->last_inbytes)<<4;
109 e->last_inbytes = n_inbytes;
110 e->inbps += ((long)rate - (long)e->inbps)>>2;
111 s->inbps = (e->inbps+0xF)>>5;
113 rate = (n_outbytes - e->last_outbytes)<<4;
114 e->last_outbytes = n_outbytes;
115 e->outbps += ((long)rate - (long)e->outbps)>>2;
116 s->outbps = (e->outbps+0xF)>>5;
117 spin_unlock(&s->lock);
119 read_unlock(&est_lock);
120 mod_timer(&est_timer, jiffies + 2*HZ);
123 int ip_vs_new_estimator(struct ip_vs_stats *stats)
125 struct ip_vs_estimator *est;
127 est = kzalloc(sizeof(*est), GFP_KERNEL);
132 est->last_conns = stats->conns;
133 est->cps = stats->cps<<10;
135 est->last_inpkts = stats->inpkts;
136 est->inpps = stats->inpps<<10;
138 est->last_outpkts = stats->outpkts;
139 est->outpps = stats->outpps<<10;
141 est->last_inbytes = stats->inbytes;
142 est->inbps = stats->inbps<<5;
144 est->last_outbytes = stats->outbytes;
145 est->outbps = stats->outbps<<5;
147 write_lock_bh(&est_lock);
148 est->next = est_list;
149 if (est->next == NULL) {
150 setup_timer(&est_timer, estimation_timer, 0);
151 est_timer.expires = jiffies + 2*HZ;
152 add_timer(&est_timer);
155 write_unlock_bh(&est_lock);
159 void ip_vs_kill_estimator(struct ip_vs_stats *stats)
161 struct ip_vs_estimator *est, **pest;
164 write_lock_bh(&est_lock);
166 while ((est=*pest) != NULL) {
167 if (est->stats != stats) {
175 if (killed && est_list == NULL)
176 del_timer_sync(&est_timer);
177 write_unlock_bh(&est_lock);
180 void ip_vs_zero_estimator(struct ip_vs_stats *stats)
182 struct ip_vs_estimator *e;
184 write_lock_bh(&est_lock);
185 for (e = est_list; e; e = e->next) {
186 if (e->stats != stats)
189 /* set counters zero */
194 e->last_outbytes = 0;
201 write_unlock_bh(&est_lock);