1997-12-21 12:11:13 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1997 Brian Somers <brian@Awfulhak.org>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
1999-08-05 10:32:16 +00:00
|
|
|
* $Id: throughput.c,v 1.9 1999/05/08 11:07:47 brian Exp $
|
1997-11-18 14:52:08 +00:00
|
|
|
*/
|
|
|
|
|
1998-04-07 00:54:26 +00:00
|
|
|
#include <sys/types.h>
|
1997-11-18 14:52:08 +00:00
|
|
|
|
|
|
|
#include <stdio.h>
|
1999-08-05 10:32:16 +00:00
|
|
|
#include <stdlib.h>
|
1998-04-19 15:24:50 +00:00
|
|
|
#include <string.h>
|
1998-02-10 03:23:50 +00:00
|
|
|
#include <termios.h>
|
1997-11-18 14:52:08 +00:00
|
|
|
#include <time.h>
|
|
|
|
|
1997-11-22 03:37:54 +00:00
|
|
|
#include "log.h"
|
1997-11-18 14:52:08 +00:00
|
|
|
#include "timer.h"
|
|
|
|
#include "throughput.h"
|
1998-02-10 03:23:50 +00:00
|
|
|
#include "descriptor.h"
|
|
|
|
#include "prompt.h"
|
1997-11-18 14:52:08 +00:00
|
|
|
|
|
|
|
void
|
1999-08-05 10:32:16 +00:00
|
|
|
throughput_init(struct pppThroughput *t, int period)
|
1997-11-18 14:52:08 +00:00
|
|
|
{
|
|
|
|
t->OctetsIn = t->OctetsOut = 0;
|
1999-08-05 10:32:16 +00:00
|
|
|
t->SamplePeriod = period;
|
|
|
|
t->SampleOctets = (long long *)calloc(period, sizeof *t->SampleOctets);
|
|
|
|
t->OctetsPerSecond = t->BestOctetsPerSecond = 0;
|
|
|
|
t->nSample = 0;
|
|
|
|
time(&t->BestOctetsPerSecondTime);
|
1998-04-19 15:24:50 +00:00
|
|
|
memset(&t->Timer, '\0', sizeof t->Timer);
|
1998-04-03 19:21:56 +00:00
|
|
|
t->Timer.name = "throughput";
|
1998-04-10 13:19:23 +00:00
|
|
|
t->uptime = 0;
|
1999-08-05 10:32:16 +00:00
|
|
|
t->downtime = 0;
|
1998-04-16 00:26:21 +00:00
|
|
|
t->rolling = 0;
|
1999-08-05 10:32:16 +00:00
|
|
|
t->callback.data = NULL;
|
|
|
|
t->callback.fn = NULL;
|
1997-11-18 14:52:08 +00:00
|
|
|
throughput_stop(t);
|
|
|
|
}
|
|
|
|
|
1999-08-05 10:32:16 +00:00
|
|
|
void
|
|
|
|
throughput_destroy(struct pppThroughput *t)
|
|
|
|
{
|
|
|
|
if (t && t->SampleOctets) {
|
|
|
|
throughput_stop(t);
|
|
|
|
free(t->SampleOctets);
|
|
|
|
t->SampleOctets = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
throughput_uptime(struct pppThroughput *t)
|
|
|
|
{
|
|
|
|
time_t downat;
|
|
|
|
|
|
|
|
downat = t->downtime ? t->downtime : time(NULL);
|
|
|
|
return t->uptime ? downat - t->uptime : 0;
|
|
|
|
}
|
|
|
|
|
1997-11-18 14:52:08 +00:00
|
|
|
void
|
1998-04-03 19:26:02 +00:00
|
|
|
throughput_disp(struct pppThroughput *t, struct prompt *prompt)
|
1997-11-18 14:52:08 +00:00
|
|
|
{
|
1999-08-05 10:32:16 +00:00
|
|
|
int secs_up, divisor;
|
1997-11-18 14:52:08 +00:00
|
|
|
|
1999-08-05 10:32:16 +00:00
|
|
|
secs_up = throughput_uptime(t);
|
|
|
|
prompt_Printf(prompt, "Connect time: %d:%02d:%02d", secs_up / 3600,
|
|
|
|
(secs_up / 60) % 60, secs_up % 60);
|
|
|
|
if (t->downtime)
|
|
|
|
prompt_Printf(prompt, " - down at %s", ctime(&t->downtime));
|
|
|
|
else
|
|
|
|
prompt_Printf(prompt, "\n");
|
|
|
|
|
|
|
|
divisor = secs_up ? secs_up : 1;
|
1999-05-08 11:07:56 +00:00
|
|
|
prompt_Printf(prompt, "%qu octets in, %qu octets out\n",
|
1998-02-10 03:23:50 +00:00
|
|
|
t->OctetsIn, t->OctetsOut);
|
1998-04-16 00:26:21 +00:00
|
|
|
if (t->rolling) {
|
1999-05-08 11:07:56 +00:00
|
|
|
prompt_Printf(prompt, " overall %6qu bytes/sec\n",
|
1999-08-05 10:32:16 +00:00
|
|
|
(t->OctetsIn + t->OctetsOut) / divisor);
|
|
|
|
prompt_Printf(prompt, " %s %6qu bytes/sec (over the last"
|
|
|
|
" %d secs)\n", t->downtime ? "average " : "currently",
|
|
|
|
t->OctetsPerSecond,
|
|
|
|
secs_up > t->SamplePeriod ? t->SamplePeriod : secs_up);
|
1999-05-08 11:07:56 +00:00
|
|
|
prompt_Printf(prompt, " peak %6qu bytes/sec on %s",
|
1998-06-09 18:49:10 +00:00
|
|
|
t->BestOctetsPerSecond, ctime(&t->BestOctetsPerSecondTime));
|
1997-11-18 14:52:08 +00:00
|
|
|
} else
|
1999-05-08 11:07:56 +00:00
|
|
|
prompt_Printf(prompt, "Overall %qu bytes/sec\n",
|
1999-08-05 10:32:16 +00:00
|
|
|
(t->OctetsIn + t->OctetsOut) / divisor);
|
1997-11-18 14:52:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
throughput_log(struct pppThroughput *t, int level, const char *title)
|
|
|
|
{
|
|
|
|
if (t->uptime) {
|
|
|
|
int secs_up;
|
|
|
|
|
1999-08-05 10:32:16 +00:00
|
|
|
secs_up = throughput_uptime(t);
|
1997-11-18 14:52:08 +00:00
|
|
|
if (title)
|
1999-05-08 11:07:56 +00:00
|
|
|
log_Printf(level, "%s: Connect time: %d secs: %qu octets in, %qu octets"
|
1997-11-18 14:52:08 +00:00
|
|
|
" out\n", title, secs_up, t->OctetsIn, t->OctetsOut);
|
|
|
|
else
|
1999-08-05 10:32:16 +00:00
|
|
|
log_Printf(level, "Connect time: %d secs: %qu octets in,"
|
|
|
|
" %qu octets out\n", secs_up, t->OctetsIn, t->OctetsOut);
|
1997-11-18 14:52:08 +00:00
|
|
|
if (secs_up == 0)
|
|
|
|
secs_up = 1;
|
1998-04-16 00:26:21 +00:00
|
|
|
if (t->rolling)
|
1999-05-08 11:07:56 +00:00
|
|
|
log_Printf(level, " total %qu bytes/sec, peak %qu bytes/sec on %s",
|
1999-08-05 10:32:16 +00:00
|
|
|
(t->OctetsIn + t->OctetsOut) / secs_up, t->BestOctetsPerSecond,
|
|
|
|
ctime(&t->BestOctetsPerSecondTime));
|
1997-11-18 14:52:08 +00:00
|
|
|
else
|
1999-05-08 11:07:56 +00:00
|
|
|
log_Printf(level, " total %qu bytes/sec\n",
|
1999-08-05 10:32:16 +00:00
|
|
|
(t->OctetsIn + t->OctetsOut) / secs_up);
|
1997-11-18 14:52:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
1997-11-22 03:37:54 +00:00
|
|
|
throughput_sampler(void *v)
|
1997-11-18 14:52:08 +00:00
|
|
|
{
|
1997-11-22 03:37:54 +00:00
|
|
|
struct pppThroughput *t = (struct pppThroughput *)v;
|
1999-05-08 11:07:56 +00:00
|
|
|
unsigned long long old;
|
1999-08-05 10:32:16 +00:00
|
|
|
int uptime, divisor;
|
1997-11-18 14:52:08 +00:00
|
|
|
|
1998-05-01 19:26:12 +00:00
|
|
|
timer_Stop(&t->Timer);
|
1997-11-18 14:52:08 +00:00
|
|
|
|
1999-08-05 10:32:16 +00:00
|
|
|
uptime = throughput_uptime(t);
|
|
|
|
divisor = uptime < t->SamplePeriod ? uptime + 1 : t->SamplePeriod;
|
1997-11-18 14:52:08 +00:00
|
|
|
old = t->SampleOctets[t->nSample];
|
|
|
|
t->SampleOctets[t->nSample] = t->OctetsIn + t->OctetsOut;
|
1999-08-05 10:32:16 +00:00
|
|
|
t->OctetsPerSecond = (t->SampleOctets[t->nSample] - old) / divisor;
|
1998-06-09 18:49:10 +00:00
|
|
|
if (t->BestOctetsPerSecond < t->OctetsPerSecond) {
|
1997-11-18 14:52:08 +00:00
|
|
|
t->BestOctetsPerSecond = t->OctetsPerSecond;
|
1999-08-05 10:32:16 +00:00
|
|
|
time(&t->BestOctetsPerSecondTime);
|
1998-06-09 18:49:10 +00:00
|
|
|
}
|
1999-08-05 10:32:16 +00:00
|
|
|
if (++t->nSample == t->SamplePeriod)
|
1997-11-18 14:52:08 +00:00
|
|
|
t->nSample = 0;
|
|
|
|
|
1999-08-05 10:32:16 +00:00
|
|
|
if (t->callback.fn != NULL && uptime >= t->SamplePeriod)
|
|
|
|
(*t->callback.fn)(t->callback.data);
|
|
|
|
|
1998-05-01 19:26:12 +00:00
|
|
|
timer_Start(&t->Timer);
|
1997-11-18 14:52:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1998-04-16 00:26:21 +00:00
|
|
|
throughput_start(struct pppThroughput *t, const char *name, int rolling)
|
1997-11-18 14:52:08 +00:00
|
|
|
{
|
1999-08-05 10:32:16 +00:00
|
|
|
int i;
|
1998-05-01 19:26:12 +00:00
|
|
|
timer_Stop(&t->Timer);
|
1999-08-05 10:32:16 +00:00
|
|
|
|
|
|
|
for (i = 0; i < t->SamplePeriod; i++)
|
|
|
|
t->SampleOctets[i] = 0;
|
|
|
|
t->nSample = 0;
|
|
|
|
t->OctetsIn = t->OctetsOut = 0;
|
|
|
|
t->OctetsPerSecond = t->BestOctetsPerSecond = 0;
|
|
|
|
time(&t->BestOctetsPerSecondTime);
|
|
|
|
t->downtime = 0;
|
1997-11-18 14:52:08 +00:00
|
|
|
time(&t->uptime);
|
1999-08-05 10:32:16 +00:00
|
|
|
throughput_restart(t, name, rolling);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
throughput_restart(struct pppThroughput *t, const char *name, int rolling)
|
|
|
|
{
|
|
|
|
timer_Stop(&t->Timer);
|
|
|
|
t->rolling = rolling ? 1 : 0;
|
1998-04-16 00:26:21 +00:00
|
|
|
if (t->rolling) {
|
1997-11-18 14:52:08 +00:00
|
|
|
t->Timer.load = SECTICKS;
|
|
|
|
t->Timer.func = throughput_sampler;
|
1998-04-03 19:21:56 +00:00
|
|
|
t->Timer.name = name;
|
1997-11-18 14:52:08 +00:00
|
|
|
t->Timer.arg = t;
|
1998-05-01 19:26:12 +00:00
|
|
|
timer_Start(&t->Timer);
|
1999-08-05 10:32:16 +00:00
|
|
|
} else {
|
|
|
|
t->Timer.load = 0;
|
|
|
|
t->Timer.func = NULL;
|
|
|
|
t->Timer.name = NULL;
|
|
|
|
t->Timer.arg = NULL;
|
1997-11-18 14:52:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
throughput_stop(struct pppThroughput *t)
|
|
|
|
{
|
1999-08-05 10:32:16 +00:00
|
|
|
if (t->Timer.state != TIMER_STOPPED)
|
|
|
|
time(&t->downtime);
|
1998-05-01 19:26:12 +00:00
|
|
|
timer_Stop(&t->Timer);
|
1997-11-18 14:52:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1999-05-08 11:07:56 +00:00
|
|
|
throughput_addin(struct pppThroughput *t, long long n)
|
1997-11-18 14:52:08 +00:00
|
|
|
{
|
|
|
|
t->OctetsIn += n;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1999-05-08 11:07:56 +00:00
|
|
|
throughput_addout(struct pppThroughput *t, long long n)
|
1997-11-18 14:52:08 +00:00
|
|
|
{
|
|
|
|
t->OctetsOut += n;
|
|
|
|
}
|
1998-06-12 20:12:26 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
throughput_clear(struct pppThroughput *t, int clear_type, struct prompt *prompt)
|
|
|
|
{
|
|
|
|
if (clear_type & (THROUGHPUT_OVERALL|THROUGHPUT_CURRENT)) {
|
|
|
|
int i;
|
|
|
|
|
1999-08-05 10:32:16 +00:00
|
|
|
for (i = 0; i < t->SamplePeriod; i++)
|
1998-06-12 20:12:26 +00:00
|
|
|
t->SampleOctets[i] = 0;
|
|
|
|
t->nSample = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (clear_type & THROUGHPUT_OVERALL) {
|
1999-08-05 10:32:16 +00:00
|
|
|
int divisor;
|
1998-06-12 20:12:26 +00:00
|
|
|
|
1999-08-05 10:32:16 +00:00
|
|
|
if ((divisor = throughput_uptime(t)) == 0)
|
|
|
|
divisor = 1;
|
1999-05-08 11:07:56 +00:00
|
|
|
prompt_Printf(prompt, "overall cleared (was %6qu bytes/sec)\n",
|
1999-08-05 10:32:16 +00:00
|
|
|
(t->OctetsIn + t->OctetsOut) / divisor);
|
1998-06-12 20:12:26 +00:00
|
|
|
t->OctetsIn = t->OctetsOut = 0;
|
1999-08-05 10:32:16 +00:00
|
|
|
t->downtime = 0;
|
|
|
|
time(&t->uptime);
|
1998-06-12 20:12:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (clear_type & THROUGHPUT_CURRENT) {
|
1999-05-08 11:07:56 +00:00
|
|
|
prompt_Printf(prompt, "current cleared (was %6qu bytes/sec)\n",
|
1998-06-12 20:12:26 +00:00
|
|
|
t->OctetsPerSecond);
|
|
|
|
t->OctetsPerSecond = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (clear_type & THROUGHPUT_PEAK) {
|
|
|
|
char *time_buf, *last;
|
|
|
|
|
|
|
|
time_buf = ctime(&t->BestOctetsPerSecondTime);
|
|
|
|
last = time_buf + strlen(time_buf);
|
|
|
|
if (last > time_buf && *--last == '\n')
|
|
|
|
*last = '\0';
|
1999-05-08 11:07:56 +00:00
|
|
|
prompt_Printf(prompt, "peak cleared (was %6qu bytes/sec on %s)\n",
|
1999-08-05 10:32:16 +00:00
|
|
|
t->BestOctetsPerSecond, time_buf);
|
1998-06-12 20:12:26 +00:00
|
|
|
t->BestOctetsPerSecond = 0;
|
1999-08-05 10:32:16 +00:00
|
|
|
time(&t->BestOctetsPerSecondTime);
|
1998-06-12 20:12:26 +00:00
|
|
|
}
|
|
|
|
}
|
1999-08-05 10:32:16 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
throughput_callback(struct pppThroughput *t, void (*fn)(void *), void *data)
|
|
|
|
{
|
|
|
|
t->callback.fn = fn;
|
|
|
|
t->callback.data = data;
|
|
|
|
}
|