mark/iftop
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

""

Browse Source
This commit is contained in:
chris
2002-03-27 00:04:43 +00:00
parent 0ae08569c2
commit 3b7d58104e
3 changed files with 9 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
iftop.8
View File

@@ -26,10 +26,11 @@ if none is specified, and displays a table of current bandwidth usage by pairs
of hosts. of hosts.
When run, \fBiftop\fP displays, for each pair of hosts, the rate at which data When run, \fBiftop\fP displays, for each pair of hosts, the rate at which data
is sent and received averaged over 3, 15 and 60 second intervals. The direction is sent and received averaged over 1, 5 and 20 second intervals. The direction
of data flow is indicated by arrows, <= and =>. In addition, a simple bar graph of data flow is indicated by arrows, <= and =>. In addition, a simple bar graph
shows the 15-second average. The pairs of hosts which consume the most bandwidth shows the 5-second average. The pairs of hosts which consume the most bandwidth
are displayed at the top of the screen. are displayed at the top of the screen, and totals for all hosts are shown at
the bottom of the screen.
By default, \fBiftop\fP will look up the hostnames associated with addresses it By default, \fBiftop\fP will look up the hostnames associated with addresses it
finds in packets. This can cause substantial traffic of itself, and may result finds in packets. This can cause substantial traffic of itself, and may result

3
resolver.c
View File

@@ -55,8 +55,6 @@ void resolver_worker(void* ptr) {
pthread_mutex_unlock(&resolver_queue_mutex); pthread_mutex_unlock(&resolver_queue_mutex);
hstbuflen = 1024; hstbuflen = 1024;
/* Allocate buffer, remember to free it to avoid memory leakage. */ /* Allocate buffer, remember to free it to avoid memory leakage. */
tmphstbuf = xmalloc (hstbuflen); tmphstbuf = xmalloc (hstbuflen);
@@ -69,7 +67,6 @@ void resolver_worker(void* ptr) {
tmphstbuf = realloc (tmphstbuf, hstbuflen); tmphstbuf = realloc (tmphstbuf, hstbuflen);
} }
/* /*
* Store the result in ns_hash * Store the result in ns_hash
*/ */

9
ui.c
View File

@@ -18,9 +18,10 @@
#define HOSTNAME_LENGTH 256 #define HOSTNAME_LENGTH 256
#define HISTORY_DIVISIONS 3 #define HISTORY_DIVISIONS 3
#define BARGRAPH_INTERVAL 1 /* which division used for bars. */
/* 3, 15 and 60 seconds */ /* 1, 15 and 60 seconds */
int history_divs[HISTORY_DIVISIONS] = {1, 5, 20}; int history_divs[HISTORY_DIVISIONS] = {1, 5, 20};
@@ -240,12 +241,12 @@ void ui_print() {
/* Do some sort of primitive bar graph thing. */ /* Do some sort of primitive bar graph thing. */
mvchgat(y, 0, -1, A_NORMAL, 0, NULL); mvchgat(y, 0, -1, A_NORMAL, 0, NULL);
L = get_bar_length(8 * screen_line->sent[0] / history_divs[0]); L = get_bar_length(8 * screen_line->sent[BARGRAPH_INTERVAL] / history_divs[BARGRAPH_INTERVAL]);
if (L > 0) if (L > 0)
mvchgat(y, 0, L, A_REVERSE, 0, NULL); mvchgat(y, 0, L, A_REVERSE, 0, NULL);
mvchgat(y+1, 0, -1, A_NORMAL, 0, NULL); mvchgat(y+1, 0, -1, A_NORMAL, 0, NULL);
L = get_bar_length(8 * screen_line->recv[0] / history_divs[0]); L = get_bar_length(8 * screen_line->recv[BARGRAPH_INTERVAL] / history_divs[BARGRAPH_INTERVAL]);
if (L > 0) if (L > 0)
mvchgat(y+1, 0, L, A_REVERSE, 0, NULL); mvchgat(y+1, 0, L, A_REVERSE, 0, NULL);
} }