2 top.c -- Show real-time statistics from a running tincd
3 Copyright (C) 2011 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.
24 #include "control_common.h"
30 typedef struct nodestats_t {
36 float in_packets_rate;
38 float out_packets_rate;
43 static const char *const sortname[] = {
53 static int sortmode = 0;
54 static bool cumulative = false;
56 static list_t node_list;
57 static struct timeval now, prev, diff;
58 static int delay = 1000;
59 static bool running = true;
61 static void update(int fd) {
62 sendline(fd, "%d %d", CONTROL, REQ_DUMP_TRAFFIC);
63 gettimeofday(&now, NULL);
65 timersub(&now, &prev, &diff);
67 float interval = diff.tv_sec + diff.tv_usec * 1e-6;
78 for(list_node_t *i = node_list.head; i; i = i->next) {
79 nodestats_t *node = i->data;
83 while(recvline(fd, line, sizeof line)) {
84 int n = sscanf(line, "%d %d %s %"PRIu64" %"PRIu64" %"PRIu64" %"PRIu64, &code, &req, name, &in_packets, &in_bytes, &out_packets, &out_bytes);
91 fprintf(stderr, "Error receiving traffic information\n");
95 nodestats_t *found = NULL;
97 for(list_node_t *i = node_list.head; i; i = i->next) {
98 nodestats_t *node = i->data;
99 int result = strcmp(name, node->name);
106 found = xmalloc_and_zero(sizeof *found);
107 found->name = xstrdup(name);
108 list_insert_after(&node_list, i, found);
114 found = xmalloc_and_zero(sizeof *found);
115 found->name = xstrdup(name);
116 list_insert_tail(&node_list, found);
120 found->in_packets_rate = (in_packets - found->in_packets) / interval;
121 found->in_bytes_rate = (in_bytes - found->in_bytes) / interval;
122 found->out_packets_rate = (out_packets - found->out_packets) / interval;
123 found->out_bytes_rate = (out_bytes - found->out_bytes) / interval;
124 found->in_packets = in_packets;
125 found->in_bytes = in_bytes;
126 found->out_packets = out_packets;
127 found->out_bytes = out_bytes;
131 static void redraw(void) {
134 mvprintw(0, 0, "Tinc %-16s Nodes: %4d Sort: %-8s %s", netname, node_list.count, sortname[sortmode], cumulative ? "Cumulative" : "Current");
136 mvprintw(2, 0, "Node IN pkts IN bytes OUT pkts OUT bytes");
137 chgat(-1, A_REVERSE, 0, NULL);
139 nodestats_t *sorted[node_list.count];
141 for(list_node_t *i = node_list.head; i; i = i->next)
142 sorted[n++] = i->data;
144 int cmpfloat(float a, float b) {
153 int cmpu64(uint64_t a, uint64_t b) {
162 int sortfunc(const void *a, const void *b) {
163 const nodestats_t *na = *(const nodestats_t **)a;
164 const nodestats_t *nb = *(const nodestats_t **)b;
168 return -cmpu64(na->in_packets, nb->in_packets);
170 return -cmpfloat(na->in_packets_rate, nb->in_packets_rate);
173 return -cmpu64(na->in_bytes, nb->in_bytes);
175 return -cmpfloat(na->in_bytes_rate, nb->in_bytes_rate);
178 return -cmpu64(na->out_packets, nb->out_packets);
180 return -cmpfloat(na->out_packets_rate, nb->out_packets_rate);
183 return -cmpu64(na->out_bytes, nb->out_bytes);
185 return -cmpfloat(na->out_bytes_rate, nb->out_bytes_rate);
188 return -cmpu64(na->in_packets + na->out_packets, nb->in_packets + nb->out_packets);
190 return -cmpfloat(na->in_packets_rate + na->out_packets_rate, nb->in_packets_rate + nb->out_packets_rate);
193 return -cmpu64(na->in_bytes + na->out_bytes, nb->in_bytes + nb->out_bytes);
195 return -cmpfloat(na->in_bytes_rate + na->out_bytes_rate, nb->in_bytes_rate + nb->out_bytes_rate);
197 return strcmp(na->name, nb->name);
201 qsort(sorted, n, sizeof *sorted, sortfunc);
204 for(int i = 0; i < n; i++, row++) {
205 nodestats_t *node = sorted[i];
207 if(node->in_packets_rate || node->out_packets_rate)
215 mvprintw(row, 0, "%-16s %'10"PRIu64" %'10"PRIu64" %'10"PRIu64" %'10"PRIu64,
216 node->name, node->in_packets, node->in_bytes, node->out_packets, node->out_bytes);
218 mvprintw(row, 0, "%-16s %'10.0f %'10.0f %'10.0f %'10.0f",
219 node->name, node->in_packets_rate, node->in_bytes_rate, node->out_packets_rate, node->out_bytes_rate);
239 float input = delay * 1e-3;
240 printw("Change delay from %.1fs to: ", input);
249 cumulative = !cumulative;