2004-04-22 02:10:48 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1995 Danny Gasparovski.
|
|
|
|
*
|
|
|
|
* Please read the file COPYRIGHT for the
|
|
|
|
* terms and conditions of the copyright.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <slirp.h>
|
2011-08-01 18:18:37 +02:00
|
|
|
#include "qemu-timer.h"
|
2004-04-22 02:10:48 +02:00
|
|
|
|
|
|
|
#define ifs_init(ifm) ((ifm)->ifs_next = (ifm)->ifs_prev = (ifm))
|
|
|
|
|
2008-09-30 20:18:27 +02:00
|
|
|
static void
|
2008-08-17 22:21:51 +02:00
|
|
|
ifs_insque(struct mbuf *ifm, struct mbuf *ifmhead)
|
2004-04-22 02:10:48 +02:00
|
|
|
{
|
|
|
|
ifm->ifs_next = ifmhead->ifs_next;
|
|
|
|
ifmhead->ifs_next = ifm;
|
|
|
|
ifm->ifs_prev = ifmhead;
|
|
|
|
ifm->ifs_next->ifs_prev = ifm;
|
|
|
|
}
|
|
|
|
|
2008-09-30 20:18:27 +02:00
|
|
|
static void
|
2008-08-17 22:21:51 +02:00
|
|
|
ifs_remque(struct mbuf *ifm)
|
2004-04-22 02:10:48 +02:00
|
|
|
{
|
|
|
|
ifm->ifs_prev->ifs_next = ifm->ifs_next;
|
|
|
|
ifm->ifs_next->ifs_prev = ifm->ifs_prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2009-06-24 14:42:31 +02:00
|
|
|
if_init(Slirp *slirp)
|
2004-04-22 02:10:48 +02:00
|
|
|
{
|
2009-06-24 14:42:31 +02:00
|
|
|
slirp->if_fastq.ifq_next = slirp->if_fastq.ifq_prev = &slirp->if_fastq;
|
|
|
|
slirp->if_batchq.ifq_next = slirp->if_batchq.ifq_prev = &slirp->if_batchq;
|
|
|
|
slirp->next_m = &slirp->if_batchq;
|
2004-04-22 02:10:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* if_output: Queue packet into an output queue.
|
2007-09-16 23:08:06 +02:00
|
|
|
* There are 2 output queue's, if_fastq and if_batchq.
|
2004-04-22 02:10:48 +02:00
|
|
|
* Each output queue is a doubly linked list of double linked lists
|
|
|
|
* of mbufs, each list belonging to one "session" (socket). This
|
|
|
|
* way, we can output packets fairly by sending one packet from each
|
|
|
|
* session, instead of all the packets from one session, then all packets
|
2007-09-16 23:08:06 +02:00
|
|
|
* from the next session, etc. Packets on the if_fastq get absolute
|
2004-04-22 02:10:48 +02:00
|
|
|
* priority, but if one session hogs the link, it gets "downgraded"
|
|
|
|
* to the batchq until it runs out of packets, then it'll return
|
|
|
|
* to the fastq (eg. if the user does an ls -alR in a telnet session,
|
|
|
|
* it'll temporarily get downgraded to the batchq)
|
|
|
|
*/
|
|
|
|
void
|
2009-03-07 16:32:56 +01:00
|
|
|
if_output(struct socket *so, struct mbuf *ifm)
|
2004-04-22 02:10:48 +02:00
|
|
|
{
|
2009-06-24 14:42:31 +02:00
|
|
|
Slirp *slirp = ifm->slirp;
|
2004-04-22 02:10:48 +02:00
|
|
|
struct mbuf *ifq;
|
|
|
|
int on_fastq = 1;
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
DEBUG_CALL("if_output");
|
|
|
|
DEBUG_ARG("so = %lx", (long)so);
|
|
|
|
DEBUG_ARG("ifm = %lx", (long)ifm);
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/*
|
|
|
|
* First remove the mbuf from m_usedlist,
|
|
|
|
* since we're gonna use m_next and m_prev ourselves
|
|
|
|
* XXX Shouldn't need this, gotta change dtom() etc.
|
|
|
|
*/
|
|
|
|
if (ifm->m_flags & M_USEDLIST) {
|
|
|
|
remque(ifm);
|
|
|
|
ifm->m_flags &= ~M_USEDLIST;
|
|
|
|
}
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/*
|
2007-09-17 10:09:54 +02:00
|
|
|
* See if there's already a batchq list for this session.
|
2004-04-22 02:10:48 +02:00
|
|
|
* This can include an interactive session, which should go on fastq,
|
|
|
|
* but gets too greedy... hence it'll be downgraded from fastq to batchq.
|
|
|
|
* We mustn't put this packet back on the fastq (or we'll send it out of order)
|
|
|
|
* XXX add cache here?
|
|
|
|
*/
|
2009-06-24 14:42:31 +02:00
|
|
|
for (ifq = slirp->if_batchq.ifq_prev; ifq != &slirp->if_batchq;
|
|
|
|
ifq = ifq->ifq_prev) {
|
2004-04-22 02:10:48 +02:00
|
|
|
if (so == ifq->ifq_so) {
|
|
|
|
/* A match! */
|
|
|
|
ifm->ifq_so = so;
|
|
|
|
ifs_insque(ifm, ifq->ifs_prev);
|
|
|
|
goto diddit;
|
|
|
|
}
|
|
|
|
}
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/* No match, check which queue to put it on */
|
|
|
|
if (so && (so->so_iptos & IPTOS_LOWDELAY)) {
|
2009-06-24 14:42:31 +02:00
|
|
|
ifq = slirp->if_fastq.ifq_prev;
|
2004-04-22 02:10:48 +02:00
|
|
|
on_fastq = 1;
|
|
|
|
/*
|
|
|
|
* Check if this packet is a part of the last
|
|
|
|
* packet's session
|
|
|
|
*/
|
|
|
|
if (ifq->ifq_so == so) {
|
|
|
|
ifm->ifq_so = so;
|
|
|
|
ifs_insque(ifm, ifq->ifs_prev);
|
|
|
|
goto diddit;
|
|
|
|
}
|
|
|
|
} else
|
2009-06-24 14:42:31 +02:00
|
|
|
ifq = slirp->if_batchq.ifq_prev;
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/* Create a new doubly linked list for this session */
|
|
|
|
ifm->ifq_so = so;
|
|
|
|
ifs_init(ifm);
|
|
|
|
insque(ifm, ifq);
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2011-08-01 18:18:37 +02:00
|
|
|
/* Expiration date = Now + 1 second */
|
|
|
|
ifm->expiration_date = qemu_get_clock_ns(rt_clock) + 1000000000ULL;
|
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
diddit:
|
2009-06-24 14:42:31 +02:00
|
|
|
slirp->if_queued++;
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
if (so) {
|
|
|
|
/* Update *_queued */
|
|
|
|
so->so_queued++;
|
|
|
|
so->so_nqueued++;
|
|
|
|
/*
|
|
|
|
* Check if the interactive session should be downgraded to
|
|
|
|
* the batchq. A session is downgraded if it has queued 6
|
|
|
|
* packets without pausing, and at least 3 of those packets
|
|
|
|
* have been sent over the link
|
|
|
|
* (XXX These are arbitrary numbers, probably not optimal..)
|
|
|
|
*/
|
2007-09-16 23:08:06 +02:00
|
|
|
if (on_fastq && ((so->so_nqueued >= 6) &&
|
2004-04-22 02:10:48 +02:00
|
|
|
(so->so_nqueued - so->so_queued) >= 3)) {
|
2007-09-17 10:09:54 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/* Remove from current queue... */
|
|
|
|
remque(ifm->ifs_next);
|
2007-09-17 10:09:54 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/* ...And insert in the new. That'll teach ya! */
|
2009-06-24 14:42:31 +02:00
|
|
|
insque(ifm->ifs_next, &slirp->if_batchq);
|
2004-04-22 02:10:48 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef FULL_BOLT
|
|
|
|
/*
|
|
|
|
* This prevents us from malloc()ing too many mbufs
|
|
|
|
*/
|
2009-06-24 14:42:31 +02:00
|
|
|
if_start(ifm->slirp);
|
2004-04-22 02:10:48 +02:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Send a packet
|
|
|
|
* We choose a packet based on it's position in the output queues;
|
|
|
|
* If there are packets on the fastq, they are sent FIFO, before
|
|
|
|
* everything else. Otherwise we choose the first packet from the
|
|
|
|
* batchq and send it. the next packet chosen will be from the session
|
|
|
|
* after this one, then the session after that one, and so on.. So,
|
|
|
|
* for example, if there are 3 ftp session's fighting for bandwidth,
|
|
|
|
* one packet will be sent from the first session, then one packet
|
|
|
|
* from the second session, then one packet from the third, then back
|
|
|
|
* to the first, etc. etc.
|
|
|
|
*/
|
|
|
|
void
|
2009-06-24 14:42:31 +02:00
|
|
|
if_start(Slirp *slirp)
|
2004-04-22 02:10:48 +02:00
|
|
|
{
|
2011-08-01 18:18:37 +02:00
|
|
|
int requeued = 0;
|
|
|
|
uint64_t now;
|
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
struct mbuf *ifm, *ifqt;
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
DEBUG_CALL("if_start");
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2009-06-24 14:42:31 +02:00
|
|
|
if (slirp->if_queued == 0)
|
2004-04-22 02:10:48 +02:00
|
|
|
return; /* Nothing to do */
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
again:
|
|
|
|
/* check if we can really output */
|
2009-06-24 14:42:31 +02:00
|
|
|
if (!slirp_can_output(slirp->opaque))
|
2004-04-22 02:10:48 +02:00
|
|
|
return;
|
|
|
|
|
2011-08-01 18:18:37 +02:00
|
|
|
now = qemu_get_clock_ns(rt_clock);
|
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/*
|
|
|
|
* See which queue to get next packet from
|
|
|
|
* If there's something in the fastq, select it immediately
|
|
|
|
*/
|
2009-06-24 14:42:31 +02:00
|
|
|
if (slirp->if_fastq.ifq_next != &slirp->if_fastq) {
|
|
|
|
ifm = slirp->if_fastq.ifq_next;
|
2004-04-22 02:10:48 +02:00
|
|
|
} else {
|
|
|
|
/* Nothing on fastq, see if next_m is valid */
|
2009-06-24 14:42:31 +02:00
|
|
|
if (slirp->next_m != &slirp->if_batchq)
|
|
|
|
ifm = slirp->next_m;
|
2004-04-22 02:10:48 +02:00
|
|
|
else
|
2009-06-24 14:42:31 +02:00
|
|
|
ifm = slirp->if_batchq.ifq_next;
|
2007-09-17 10:09:54 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/* Set which packet to send on next iteration */
|
2009-06-24 14:42:31 +02:00
|
|
|
slirp->next_m = ifm->ifq_next;
|
2004-04-22 02:10:48 +02:00
|
|
|
}
|
|
|
|
/* Remove it from the queue */
|
|
|
|
ifqt = ifm->ifq_prev;
|
|
|
|
remque(ifm);
|
2009-06-24 14:42:31 +02:00
|
|
|
slirp->if_queued--;
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/* If there are more packets for this session, re-queue them */
|
|
|
|
if (ifm->ifs_next != /* ifm->ifs_prev != */ ifm) {
|
|
|
|
insque(ifm->ifs_next, ifqt);
|
|
|
|
ifs_remque(ifm);
|
|
|
|
}
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/* Update so_queued */
|
|
|
|
if (ifm->ifq_so) {
|
|
|
|
if (--ifm->ifq_so->so_queued == 0)
|
|
|
|
/* If there's no more queued, reset nqueued */
|
|
|
|
ifm->ifq_so->so_nqueued = 0;
|
|
|
|
}
|
2007-09-16 23:08:06 +02:00
|
|
|
|
2011-08-01 18:18:37 +02:00
|
|
|
if (ifm->expiration_date < now) {
|
|
|
|
/* Expired */
|
|
|
|
m_free(ifm);
|
|
|
|
} else {
|
|
|
|
/* Encapsulate the packet for sending */
|
|
|
|
if (if_encap(slirp, ifm)) {
|
|
|
|
m_free(ifm);
|
|
|
|
} else {
|
|
|
|
/* re-queue */
|
|
|
|
insque(ifm, ifqt);
|
|
|
|
requeued++;
|
|
|
|
}
|
|
|
|
}
|
2004-09-13 23:42:51 +02:00
|
|
|
|
2009-06-24 14:42:31 +02:00
|
|
|
if (slirp->if_queued)
|
2004-04-22 02:10:48 +02:00
|
|
|
goto again;
|
2011-08-01 18:18:37 +02:00
|
|
|
|
|
|
|
slirp->if_queued = requeued;
|
2004-04-22 02:10:48 +02:00
|
|
|
}
|