1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
/*
* $FreeBSD$
*
* library functions for userland testing of dummynet schedulers
*/
#include "dn_test.h"
void
m_freem(struct mbuf *m)
{
printf("free %p\n", m);
}
int
dn_sched_modevent(module_t mod, int cmd, void *arg)
{
return 0;
}
void
dn_free_pkts(struct mbuf *m)
{
struct mbuf *x;
while ( (x = m) ) {
m = m->m_nextpkt;
m_freem(x);
}
}
int
dn_delete_queue(void *_q, void *do_free)
{
struct dn_queue *q = _q;
if (q->mq.head)
dn_free_pkts(q->mq.head);
free(q);
return 0;
}
/*
* This is a simplified function for testing purposes, which does
* not implement statistics or random loss.
* Enqueue a packet in q, subject to space and queue management policy
* (whose parameters are in q->fs).
* Update stats for the queue and the scheduler.
* Return 0 on success, 1 on drop. The packet is consumed anyways.
*/
int
dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop)
{
if (drop)
goto drop;
if (q->ni.length >= 200)
goto drop;
mq_append(&q->mq, m);
q->ni.length++;
q->ni.tot_bytes += m->m_pkthdr.len;
return 0;
drop:
q->ni.drops++;
return 1;
}
int
ipdn_bound_var(int *v, int dflt, int lo, int hi, const char *msg)
{
if (*v < lo) {
*v = dflt;
} else if (*v > hi) {
*v = hi;
}
return *v;
}
|
