2 * Copyright (c) 1998 Brian Somers <brian@Awfulhak.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/types.h>
31 #include <netinet/in_systm.h>
32 #include <sys/socket.h>
34 #include <netinet/in.h>
35 #include <netinet/ip.h>
48 #include "throughput.h"
51 #include "descriptor.h"
60 #include "slcompress.h"
71 static void Despatch(struct bundle *, struct link *, struct mbuf *, u_short);
74 link_AddInOctets(struct link *l, int n)
76 if (l->stats.gather) {
77 throughput_addin(&l->stats.total, n);
79 throughput_addin(l->stats.parent, n);
84 link_AddOutOctets(struct link *l, int n)
86 if (l->stats.gather) {
87 throughput_addout(&l->stats.total, n);
89 throughput_addout(l->stats.parent, n);
94 link_SequenceQueue(struct link *l)
96 struct mqueue *queue, *highest;
98 log_Printf(LogDEBUG, "link_SequenceQueue\n");
100 highest = LINK_HIGHQ(l);
101 for (queue = l->Queue; queue < highest; queue++)
103 m_enqueue(highest, m_dequeue(queue));
107 link_DeleteQueue(struct link *l)
109 struct mqueue *queue, *highest;
111 highest = LINK_HIGHQ(l);
112 for (queue = l->Queue; queue <= highest; queue++)
114 m_freem(m_dequeue(queue));
118 link_QueueLen(struct link *l)
123 for (i = 0, len = 0; i < LINK_QUEUES(l); i++)
124 len += l->Queue[i].len;
130 link_QueueBytes(struct link *l)
137 for (i = 0, len = 0; i < LINK_QUEUES(l); i++) {
138 len = l->Queue[i].len;
141 bytes += m_length(m);
150 link_Dequeue(struct link *l)
155 for (bp = NULL, pri = LINK_QUEUES(l) - 1; pri >= 0; pri--)
156 if (l->Queue[pri].len) {
157 bp = m_dequeue(l->Queue + pri);
158 log_Printf(LogDEBUG, "link_Dequeue: Dequeued from queue %d,"
159 " containing %lu more packets\n", pri,
160 (u_long)l->Queue[pri].len);
167 static struct protostatheader {
170 } ProtocolStat[NPROTOSTAT] = {
172 { PROTO_VJUNCOMP, "VJ_UNCOMP" },
173 { PROTO_VJCOMP, "VJ_COMP" },
174 { PROTO_COMPD, "COMPD" },
175 { PROTO_ICOMPD, "ICOMPD" },
176 { PROTO_LCP, "LCP" },
177 { PROTO_IPCP, "IPCP" },
178 { PROTO_CCP, "CCP" },
179 { PROTO_PAP, "PAP" },
180 { PROTO_LQR, "LQR" },
181 { PROTO_CHAP, "CHAP" },
182 { PROTO_MP, "MULTILINK" },
187 link_ProtocolRecord(struct link *l, u_short proto, int type)
191 for (i = 0; i < NPROTOSTAT; i++)
192 if (ProtocolStat[i].number == proto)
195 if (type == PROTO_IN)
202 link_ReportProtocolStatus(struct link *l, struct prompt *prompt)
206 prompt_Printf(prompt, " Protocol in out "
207 "Protocol in out\n");
208 for (i = 0; i < NPROTOSTAT; i++) {
209 prompt_Printf(prompt, " %-9s: %8lu, %8lu",
210 ProtocolStat[i].name, l->proto_in[i], l->proto_out[i]);
212 prompt_Printf(prompt, "\n");
215 prompt_Printf(prompt, "\n");
219 link_PushPacket(struct link *l, struct mbuf *bp, struct bundle *b, int pri,
225 * When we ``push'' a packet into the link, it gets processed by the
226 * ``push'' function in each layer starting at the top.
227 * We never expect the result of a ``push'' to be more than one
228 * packet (as we do with ``pull''s).
231 if(pri < 0 || pri >= LINK_QUEUES(l))
234 for (layer = l->nlayers; layer && bp; layer--)
235 if (l->layer[layer - 1]->push != NULL)
236 bp = (*l->layer[layer - 1]->push)(b, l, bp, pri, &proto);
239 link_AddOutOctets(l, m_length(bp));
240 log_Printf(LogDEBUG, "link_PushPacket: Transmit proto 0x%04x\n", proto);
241 m_enqueue(l->Queue + pri, m_pullup(bp));
246 link_PullPacket(struct link *l, char *buf, size_t len, struct bundle *b)
248 struct mbuf *bp, *lbp[LAYER_MAX], *next;
249 u_short lproto[LAYER_MAX], proto;
253 * When we ``pull'' a packet from the link, it gets processed by the
254 * ``pull'' function in each layer starting at the bottom.
255 * Each ``pull'' may produce multiple packets, chained together using
257 * Each packet that results from each pull has to be pulled through
258 * all of the higher layers before the next resulting packet is pulled
259 * through anything; this ensures that packets that depend on the
260 * fsm state resulting from the receipt of the previous packet aren't
264 link_AddInOctets(l, len);
266 memset(lbp, '\0', sizeof lbp);
267 lbp[0] = m_get(len, MB_UNKNOWN);
268 memcpy(MBUF_CTOP(lbp[0]), buf, len);
272 while (layer || lbp[layer]) {
273 if (lbp[layer] == NULL) {
278 lbp[layer] = bp->m_nextpkt;
279 bp->m_nextpkt = NULL;
280 proto = lproto[layer];
282 if (l->layer[layer]->pull != NULL)
283 bp = (*l->layer[layer]->pull)(b, l, bp, &proto);
285 if (layer == l->nlayers - 1) {
286 /* We've just done the top layer, despatch the packet(s) */
288 next = bp->m_nextpkt;
289 bp->m_nextpkt = NULL;
290 log_Printf(LogDEBUG, "link_PullPacket: Despatch proto 0x%04x\n", proto);
291 Despatch(b, l, bp, proto);
296 lproto[layer] = proto;
302 link_Stack(struct link *l, struct layer *layer)
304 if (l->nlayers == sizeof l->layer / sizeof l->layer[0]) {
305 log_Printf(LogERROR, "%s: Oops, cannot stack a %s layer...\n",
306 l->name, layer->name);
309 l->layer[l->nlayers++] = layer;
314 link_EmptyStack(struct link *l)
319 static const struct {
321 struct mbuf *(*fn)(struct bundle *, struct link *, struct mbuf *);
323 { PROTO_IP, ipv4_Input },
325 { PROTO_IPV6, ipv6_Input },
327 { PROTO_MP, mp_Input },
328 { PROTO_LCP, lcp_Input },
329 { PROTO_IPCP, ipcp_Input },
331 { PROTO_IPV6CP, ipv6cp_Input },
333 { PROTO_PAP, pap_Input },
334 { PROTO_CHAP, chap_Input },
335 { PROTO_CCP, ccp_Input },
336 { PROTO_LQR, lqr_Input },
337 { PROTO_CBCP, cbcp_Input }
340 #define DSIZE (sizeof despatcher / sizeof despatcher[0])
343 Despatch(struct bundle *bundle, struct link *l, struct mbuf *bp, u_short proto)
347 for (f = 0; f < DSIZE; f++)
348 if (despatcher[f].proto == proto) {
349 bp = (*despatcher[f].fn)(bundle, l, bp);
354 struct physical *p = link2physical(l);
356 log_Printf(LogPHASE, "%s protocol 0x%04x (%s)\n",
357 f == DSIZE ? "Unknown" : "Unexpected", proto,
358 hdlc_Protocol2Nam(proto));
359 bp = m_pullup(proto_Prepend(bp, proto, 0, 0));
360 lcp_SendProtoRej(&l->lcp, MBUF_CTOP(bp), bp->m_len);
362 p->hdlc.lqm.SaveInDiscards++;
363 p->hdlc.stats.unknownproto++;
370 link_ShowLayers(struct cmdargs const *arg)
372 struct link *l = command_ChooseLink(arg);
375 for (layer = l->nlayers; layer; layer--)
376 prompt_Printf(arg->prompt, "%s%s", layer == l->nlayers ? "" : ", ",
377 l->layer[layer - 1]->name);
379 prompt_Printf(arg->prompt, "\n");