summaryrefslogtreecommitdiff
path: root/output.c
blob: 51d46dd349077e6e4fa4fbff66a02faa9cf2757e (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/*	$Id$	*/
/*
 * Copyright (c) 2004 demon <demon@vhost.dymdns.org>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#include <curses.h>
#include "main.h"

u_long delta(u_long, u_long *);
u_long ani[60];
u_long ano[60];

int out(struct ifdata *diff) {
    extern struct ifdata ifdata;
    WINDOW *scr;

    move(0,0);
//    clear();

    printw("IF: %s\n", ifdata.xname);
    printw("BR: %d Mbps\n\n",  ifdata.baudrate / 1000000);

    printw("RX: %lu kBps\n", diff->ibytes / 1024);
    printw("RX: %i kBpm\n\n", delta(diff->ibytes, ani) / 1024);

    printw("TX: %lu kBps\n", diff->obytes / 1024);
    printw("TX: %i kBpm\n\n", delta(diff->obytes, ano) / 1024);

    printw("RX: %lu pps\n", diff->ipackets);
    printw("TX: %lu pps\n\n", diff->opackets);

    printw("RX: %lu MB\n", ifdata.ibytes / (1024 * 1024));
    printw("TX: %lu MB\n", ifdata.obytes / (1024 * 1024));

    refresh();
}

u_long delta(u_long n, u_long *an) {
    u_long nsum = 0;
    int i, del = 60;
    for (i=59; i>0; i--) {
	an[i] = an[i-1];
	nsum += an[i];
	if (an[i] == 0)
	    del -= 1;
    }
    an[0] = n;
    nsum += n;
    return (nsum / del);
}