/* $NetBSD: qdisc_wfq.c,v 1.5 2006/10/28 11:43:02 peter Exp $ */
/* $KAME: qdisc_wfq.c,v 1.5 2002/11/08 06:36:18 kjc Exp $ */
/*
* Copyright (C) 1999-2000
* Sony Computer Science Laboratories, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY SONY CSL AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL SONY CSL OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* first, find out how many queues are available
*/
for (i = 0; i < MAX_QSIZE; i++) {
wfq_stats.qid = i;
if (ioctl(fd, WFQ_GET_STATS, &wfq_stats) < 0)
break;
}
nqueues = i;
printf("wfq on %s: %d queues are used\n", ifname, nqueues);
/*
* calculate the throughput of each queue
*/
for (i = 0; i < nqueues; i++) {
qinfo[i].bps = calc_rate(qinfo[i].stats.xmit_cnt.bytes,
qinfo[i].last_bytes, sec);
qinfo[i].last_bytes = qinfo[i].stats.xmit_cnt.bytes;
for (j = 0; j < ntop; j++) {
if (top[j] == NULL) {
top[j] = &qinfo[i];
break;
}
if (top[j]->bps < qinfo[i].bps ||
(top[j]->bps == qinfo[i].bps &&
top[j]->stats.xmit_cnt.packets <
qinfo[i].stats.xmit_cnt.packets)) {
for (k = ntop-1; k > j; k--)
top[k] = top[k-1];
top[j] = &qinfo[i];
break;
}
}
}