2 top.c -- Show real-time statistics from a running tincd
3 Copyright (C) 2011-2013 Guus Sliepen <guus@tinc-vpn.org>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
26 #include "control_common.h"
33 typedef struct nodestats_t {
40 float in_packets_rate;
42 float out_packets_rate;
47 static const char *const sortname[] = {
57 static int sortmode = 0;
58 static bool cumulative = false;
60 static list_t node_list;
61 static struct timeval cur, prev, diff;
62 static int delay = 1000;
63 static bool changed = true;
64 static const char *bunit = "bytes";
65 static float bscale = 1;
66 static const char *punit = "pkts";
67 static float pscale = 1;
69 static bool update(int fd) {
70 if(!sendline(fd, "%d %d", CONTROL, REQ_DUMP_TRAFFIC))
73 gettimeofday(&cur, NULL);
75 timersub(&cur, &prev, &diff);
77 float interval = diff.tv_sec + diff.tv_usec * 1e-6;
88 for list_each(nodestats_t, ns, &node_list)
91 while(recvline(fd, line, sizeof line)) {
92 int n = sscanf(line, "%d %d %s %"PRIu64" %"PRIu64" %"PRIu64" %"PRIu64, &code, &req, name, &in_packets, &in_bytes, &out_packets, &out_bytes);
100 nodestats_t *found = NULL;
102 for list_each(nodestats_t, ns, &node_list) {
103 int result = strcmp(name, ns->name);
110 found = xzalloc(sizeof *found);
111 found->name = xstrdup(name);
112 list_insert_before(&node_list, node, found);
119 found = xzalloc(sizeof *found);
120 found->name = xstrdup(name);
121 list_insert_tail(&node_list, found);
126 found->in_packets_rate = (in_packets - found->in_packets) / interval;
127 found->in_bytes_rate = (in_bytes - found->in_bytes) / interval;
128 found->out_packets_rate = (out_packets - found->out_packets) / interval;
129 found->out_bytes_rate = (out_bytes - found->out_bytes) / interval;
130 found->in_packets = in_packets;
131 found->in_bytes = in_bytes;
132 found->out_packets = out_packets;
133 found->out_bytes = out_bytes;
139 static int cmpfloat(float a, float b) {
148 static int cmpu64(uint64_t a, uint64_t b) {
157 static int sortfunc(const void *a, const void *b) {
158 const nodestats_t *na = *(const nodestats_t **)a;
159 const nodestats_t *nb = *(const nodestats_t **)b;
163 return -cmpu64(na->in_packets, nb->in_packets) ?: na->i - nb->i;
165 return -cmpfloat(na->in_packets_rate, nb->in_packets_rate) ?: na->i - nb->i;
168 return -cmpu64(na->in_bytes, nb->in_bytes) ?: na->i - nb->i;
170 return -cmpfloat(na->in_bytes_rate, nb->in_bytes_rate) ?: na->i - nb->i;
173 return -cmpu64(na->out_packets, nb->out_packets) ?: na->i - nb->i;
175 return -cmpfloat(na->out_packets_rate, nb->out_packets_rate) ?: na->i - nb->i;
178 return -cmpu64(na->out_bytes, nb->out_bytes) ?: na->i - nb->i;
180 return -cmpfloat(na->out_bytes_rate, nb->out_bytes_rate) ?: na->i - nb->i;
183 return -cmpu64(na->in_packets + na->out_packets, nb->in_packets + nb->out_packets) ?: na->i - nb->i;
185 return -cmpfloat(na->in_packets_rate + na->out_packets_rate, nb->in_packets_rate + nb->out_packets_rate) ?: na->i - nb->i;
188 return -cmpu64(na->in_bytes + na->out_bytes, nb->in_bytes + nb->out_bytes) ?: na->i - nb->i;
190 return -cmpfloat(na->in_bytes_rate + na->out_bytes_rate, nb->in_bytes_rate + nb->out_bytes_rate) ?: na->i - nb->i;
192 return strcmp(na->name, nb->name) ?: na->i - nb->i;
196 static void redraw(void) {
199 mvprintw(0, 0, "Tinc %-16s Nodes: %4d Sort: %-10s %s", netname ?: "", node_list.count, sortname[sortmode], cumulative ? "Cumulative" : "Current");
201 mvprintw(2, 0, "Node IN %s IN %s OUT %s OUT %s", punit, bunit, punit, bunit);
202 chgat(-1, A_REVERSE, 0, NULL);
204 static nodestats_t **sorted = 0;
208 sorted = xrealloc(sorted, node_list.count * sizeof *sorted);
209 for list_each(nodestats_t, ns, &node_list)
214 for(int i = 0; i < n; i++)
218 qsort(sorted, n, sizeof *sorted, sortfunc);
220 for(int i = 0, row = 3; i < n; i++, row++) {
221 nodestats_t *node = sorted[i];
223 if(node->in_packets_rate || node->out_packets_rate)
231 mvprintw(row, 0, "%-16s %10.0f %10.0f %10.0f %10.0f",
232 node->name, node->in_packets * pscale, node->in_bytes * bscale, node->out_packets * pscale, node->out_bytes * bscale);
234 mvprintw(row, 0, "%-16s %10.0f %10.0f %10.0f %10.0f",
235 node->name, node->in_packets_rate * pscale, node->in_bytes_rate * bscale, node->out_packets_rate * pscale, node->out_bytes_rate * bscale);
258 float input = delay * 1e-3;
259 mvprintw(1, 0, "Change delay from %.1fs to: ", input);
268 cumulative = !cumulative;