1 /* $KAME: qdisc_priq.c,v 1.1 2000/10/18 09:15:17 kjc Exp $ */ 2 /* 3 * Copyright (C) 2000 4 * Sony Computer Science Laboratories, Inc. All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 1. Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY SONY CSL AND CONTRIBUTORS ``AS IS'' AND 16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 18 * ARE DISCLAIMED. IN NO EVENT SHALL SONY CSL OR CONTRIBUTORS BE LIABLE 19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 25 * SUCH DAMAGE. 26 */ 27 28 #include <sys/param.h> 29 #include <sys/ioctl.h> 30 #include <sys/time.h> 31 #include <sys/socket.h> 32 #include <net/if.h> 33 #include <netinet/in.h> 34 #include <altq/altq.h> 35 #include <altq/altq_priq.h> 36 37 #include <stdio.h> 38 #include <stdlib.h> 39 #include <unistd.h> 40 #include <string.h> 41 #include <math.h> 42 #include <errno.h> 43 #include <err.h> 44 45 #include "quip_client.h" 46 #include "altqstat.h" 47 48 void 49 priq_stat_loop(int fd, const char *ifname, int count, int interval) 50 { 51 struct class_stats stats1[PRIQ_MAXPRI], stats2[PRIQ_MAXPRI]; 52 char clnames[PRIQ_MAXPRI][128]; 53 struct priq_class_stats get_stats; 54 struct class_stats *sp, *lp, *new, *last, *tmp; 55 struct timeval cur_time, last_time; 56 int i; 57 double sec; 58 int cnt = count; 59 60 strcpy(get_stats.iface.ifname, ifname); 61 new = &stats1[0]; 62 last = &stats2[0]; 63 64 /* invalidate class handles */ 65 for (i=0; i<PRIQ_MAXPRI; i++) 66 last[i].class_handle = PRIQ_NULLCLASS_HANDLE; 67 68 while (count == 0 || cnt-- > 0) { 69 get_stats.stats = new; 70 get_stats.maxpri = PRIQ_MAXPRI; 71 if (ioctl(fd, PRIQ_GETSTATS, &get_stats) < 0) 72 err(1, "ioctl PRIQ_GETSTATS"); 73 74 gettimeofday(&cur_time, NULL); 75 sec = calc_interval(&cur_time, &last_time); 76 77 printf("\n%s:\n", ifname); 78 79 for (i = get_stats.maxpri; i >= 0; i--) { 80 sp = &new[i]; 81 lp = &last[i]; 82 83 if (sp->class_handle == PRIQ_NULLCLASS_HANDLE) 84 continue; 85 86 if (sp->class_handle != lp->class_handle) { 87 quip_chandle2name(ifname, sp->class_handle, 88 clnames[i]); 89 continue; 90 } 91 92 printf("[%s] handle:%#lx pri:%d\n", 93 clnames[i], sp->class_handle, i); 94 printf(" measured: %sbps qlen:%2d period:%u\n", 95 rate2str(calc_rate(sp->xmitcnt.bytes, 96 lp->xmitcnt.bytes, sec)), 97 sp->qlength, sp->period); 98 printf(" packets:%llu (%llu bytes) drops:%llu\n", 99 (ull)sp->xmitcnt.packets, 100 (ull)sp->xmitcnt.bytes, 101 (ull)sp->dropcnt.packets); 102 if (sp->qtype == Q_RED) 103 print_redstats(sp->red); 104 else if (sp->qtype == Q_RIO) 105 print_riostats(sp->red); 106 } 107 108 /* swap the buffer pointers */ 109 tmp = last; 110 last = new; 111 new = tmp; 112 113 last_time = cur_time; 114 sleep(interval); 115 } 116 } 117