Deleted Added
full compact
throughput.h (50479) throughput.h (64670)
1/*-
2 * Copyright (c) 1997 Brian Somers <brian@Awfulhak.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 *
1/*-
2 * Copyright (c) 1997 Brian Somers <brian@Awfulhak.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 *
26 * $FreeBSD: head/usr.sbin/ppp/throughput.h 50479 1999-08-28 01:35:59Z peter $
26 * $FreeBSD: head/usr.sbin/ppp/throughput.h 64670 2000-08-15 10:25:42Z brian $
27 */
28
29#define SAMPLE_PERIOD 5 /* Default sample period */
30
31#define THROUGHPUT_OVERALL 0x0001
32#define THROUGHPUT_CURRENT 0x0002
33#define THROUGHPUT_PEAK 0x0004
34#define THROUGHPUT_ALL 0x0007
35
36struct pppThroughput {
37 time_t uptime, downtime;
38 unsigned long long OctetsIn;
39 unsigned long long OctetsOut;
40 int SamplePeriod;
27 */
28
29#define SAMPLE_PERIOD 5 /* Default sample period */
30
31#define THROUGHPUT_OVERALL 0x0001
32#define THROUGHPUT_CURRENT 0x0002
33#define THROUGHPUT_PEAK 0x0004
34#define THROUGHPUT_ALL 0x0007
35
36struct pppThroughput {
37 time_t uptime, downtime;
38 unsigned long long OctetsIn;
39 unsigned long long OctetsOut;
40 int SamplePeriod;
41 unsigned long long *SampleOctets;
42 unsigned long long OctetsPerSecond;
41 struct {
42 unsigned long long *SampleOctets;
43 unsigned long long OctetsPerSecond;
44 } in, out;
43 unsigned long long BestOctetsPerSecond;
44 time_t BestOctetsPerSecondTime;
45 int nSample;
46 unsigned rolling : 1;
47 struct pppTimer Timer;
48 struct {
49 void *data;
50 void (*fn)(void *v);
51 } callback;
52};
53
54extern void throughput_init(struct pppThroughput *, int);
55extern void throughput_destroy(struct pppThroughput *);
56extern void throughput_disp(struct pppThroughput *, struct prompt *);
57extern void throughput_log(struct pppThroughput *, int, const char *);
58extern void throughput_start(struct pppThroughput *, const char *, int);
59extern void throughput_restart(struct pppThroughput *, const char *, int);
60extern void throughput_stop(struct pppThroughput *);
61extern void throughput_addin(struct pppThroughput *, long long);
62extern void throughput_addout(struct pppThroughput *, long long);
63extern void throughput_clear(struct pppThroughput *, int, struct prompt *);
64extern void throughput_callback(struct pppThroughput *, void (*)(void *),
65 void *);
66extern int throughput_uptime(struct pppThroughput *);
45 unsigned long long BestOctetsPerSecond;
46 time_t BestOctetsPerSecondTime;
47 int nSample;
48 unsigned rolling : 1;
49 struct pppTimer Timer;
50 struct {
51 void *data;
52 void (*fn)(void *v);
53 } callback;
54};
55
56extern void throughput_init(struct pppThroughput *, int);
57extern void throughput_destroy(struct pppThroughput *);
58extern void throughput_disp(struct pppThroughput *, struct prompt *);
59extern void throughput_log(struct pppThroughput *, int, const char *);
60extern void throughput_start(struct pppThroughput *, const char *, int);
61extern void throughput_restart(struct pppThroughput *, const char *, int);
62extern void throughput_stop(struct pppThroughput *);
63extern void throughput_addin(struct pppThroughput *, long long);
64extern void throughput_addout(struct pppThroughput *, long long);
65extern void throughput_clear(struct pppThroughput *, int, struct prompt *);
66extern void throughput_callback(struct pppThroughput *, void (*)(void *),
67 void *);
68extern int throughput_uptime(struct pppThroughput *);