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
26 * $FreeBSD: src/usr.sbin/ppp/link.c,v 1.16.2.2 2002/09/01 02:12:28 brian Exp $
27 * $DragonFly: src/usr.sbin/ppp/link.c,v 1.3 2008/05/19 10:19:49 corecode Exp $
31 #include <sys/types.h>
32 #include <sys/select.h>
33 #include <netinet/in_systm.h>
34 #include <sys/socket.h>
36 #include <netinet/in.h>
37 #include <netinet/ip.h>
51 #include "throughput.h"
54 #include "descriptor.h"
63 #include "slcompress.h"
74 static void Despatch(struct bundle
*, struct link
*, struct mbuf
*, u_short
);
77 link_AddInOctets(struct link
*l
, int n
)
79 if (l
->stats
.gather
) {
80 throughput_addin(&l
->stats
.total
, n
);
82 throughput_addin(l
->stats
.parent
, n
);
87 link_AddOutOctets(struct link
*l
, int n
)
89 if (l
->stats
.gather
) {
90 throughput_addout(&l
->stats
.total
, n
);
92 throughput_addout(l
->stats
.parent
, n
);
97 link_SequenceQueue(struct link
*l
)
99 struct mqueue
*queue
, *highest
;
101 log_Printf(LogDEBUG
, "link_SequenceQueue\n");
103 highest
= LINK_HIGHQ(l
);
104 for (queue
= l
->Queue
; queue
< highest
; queue
++)
106 m_enqueue(highest
, m_dequeue(queue
));
110 link_DeleteQueue(struct link
*l
)
112 struct mqueue
*queue
, *highest
;
114 highest
= LINK_HIGHQ(l
);
115 for (queue
= l
->Queue
; queue
<= highest
; queue
++)
117 m_freem(m_dequeue(queue
));
121 link_QueueLen(struct link
*l
)
126 for (i
= 0, len
= 0; i
< LINK_QUEUES(l
); i
++)
127 len
+= l
->Queue
[i
].len
;
133 link_QueueBytes(struct link
*l
)
140 for (i
= 0, len
= 0; i
< LINK_QUEUES(l
); i
++) {
141 len
= l
->Queue
[i
].len
;
144 bytes
+= m_length(m
);
153 link_Dequeue(struct link
*l
)
158 for (bp
= NULL
, pri
= LINK_QUEUES(l
) - 1; pri
>= 0; pri
--)
159 if (l
->Queue
[pri
].len
) {
160 bp
= m_dequeue(l
->Queue
+ pri
);
161 log_Printf(LogDEBUG
, "link_Dequeue: Dequeued from queue %d,"
162 " containing %lu more packets\n", pri
,
163 (u_long
)l
->Queue
[pri
].len
);
170 static struct protostatheader
{
173 } ProtocolStat
[NPROTOSTAT
] = {
175 { PROTO_VJUNCOMP
, "VJ_UNCOMP" },
176 { PROTO_VJCOMP
, "VJ_COMP" },
177 { PROTO_COMPD
, "COMPD" },
178 { PROTO_ICOMPD
, "ICOMPD" },
179 { PROTO_LCP
, "LCP" },
180 { PROTO_IPCP
, "IPCP" },
181 { PROTO_CCP
, "CCP" },
182 { PROTO_PAP
, "PAP" },
183 { PROTO_LQR
, "LQR" },
184 { PROTO_CHAP
, "CHAP" },
185 { PROTO_MP
, "MULTILINK" },
190 link_ProtocolRecord(struct link
*l
, u_short proto
, int type
)
194 for (i
= 0; i
< NPROTOSTAT
; i
++)
195 if (ProtocolStat
[i
].number
== proto
)
198 if (type
== PROTO_IN
)
205 link_ReportProtocolStatus(struct link
*l
, struct prompt
*prompt
)
209 prompt_Printf(prompt
, " Protocol in out "
210 "Protocol in out\n");
211 for (i
= 0; i
< NPROTOSTAT
; i
++) {
212 prompt_Printf(prompt
, " %-9s: %8lu, %8lu",
213 ProtocolStat
[i
].name
, l
->proto_in
[i
], l
->proto_out
[i
]);
215 prompt_Printf(prompt
, "\n");
218 prompt_Printf(prompt
, "\n");
222 link_PushPacket(struct link
*l
, struct mbuf
*bp
, struct bundle
*b
, int pri
,
228 * When we ``push'' a packet into the link, it gets processed by the
229 * ``push'' function in each layer starting at the top.
230 * We never expect the result of a ``push'' to be more than one
231 * packet (as we do with ``pull''s).
234 if(pri
< 0 || pri
>= LINK_QUEUES(l
))
237 for (layer
= l
->nlayers
; layer
&& bp
; layer
--)
238 if (l
->layer
[layer
- 1]->push
!= NULL
)
239 bp
= (*l
->layer
[layer
- 1]->push
)(b
, l
, bp
, pri
, &proto
);
242 link_AddOutOctets(l
, m_length(bp
));
243 log_Printf(LogDEBUG
, "link_PushPacket: Transmit proto 0x%04x\n", proto
);
244 m_enqueue(l
->Queue
+ pri
, m_pullup(bp
));
249 link_PullPacket(struct link
*l
, char *buf
, size_t len
, struct bundle
*b
)
251 struct mbuf
*bp
, *lbp
[LAYER_MAX
], *next
;
252 u_short lproto
[LAYER_MAX
], proto
;
256 * When we ``pull'' a packet from the link, it gets processed by the
257 * ``pull'' function in each layer starting at the bottom.
258 * Each ``pull'' may produce multiple packets, chained together using
260 * Each packet that results from each pull has to be pulled through
261 * all of the higher layers before the next resulting packet is pulled
262 * through anything; this ensures that packets that depend on the
263 * fsm state resulting from the receipt of the previous packet aren't
267 link_AddInOctets(l
, len
);
269 memset(lbp
, '\0', sizeof lbp
);
270 lbp
[0] = m_get(len
, MB_UNKNOWN
);
271 memcpy(MBUF_CTOP(lbp
[0]), buf
, len
);
275 while (layer
|| lbp
[layer
]) {
276 if (lbp
[layer
] == NULL
) {
281 lbp
[layer
] = bp
->m_nextpkt
;
282 bp
->m_nextpkt
= NULL
;
283 proto
= lproto
[layer
];
285 if (l
->layer
[layer
]->pull
!= NULL
)
286 bp
= (*l
->layer
[layer
]->pull
)(b
, l
, bp
, &proto
);
288 if (layer
== l
->nlayers
- 1) {
289 /* We've just done the top layer, despatch the packet(s) */
291 next
= bp
->m_nextpkt
;
292 bp
->m_nextpkt
= NULL
;
293 log_Printf(LogDEBUG
, "link_PullPacket: Despatch proto 0x%04x\n", proto
);
294 Despatch(b
, l
, bp
, proto
);
299 lproto
[layer
] = proto
;
305 link_Stack(struct link
*l
, struct layer
*layer
)
307 if (l
->nlayers
== sizeof l
->layer
/ sizeof l
->layer
[0]) {
308 log_Printf(LogERROR
, "%s: Oops, cannot stack a %s layer...\n",
309 l
->name
, layer
->name
);
312 l
->layer
[l
->nlayers
++] = layer
;
317 link_EmptyStack(struct link
*l
)
322 static const struct {
324 struct mbuf
*(*fn
)(struct bundle
*, struct link
*, struct mbuf
*);
326 { PROTO_IP
, ipv4_Input
},
328 { PROTO_IPV6
, ipv6_Input
},
330 { PROTO_MP
, mp_Input
},
331 { PROTO_LCP
, lcp_Input
},
332 { PROTO_IPCP
, ipcp_Input
},
334 { PROTO_IPV6CP
, ipv6cp_Input
},
336 { PROTO_PAP
, pap_Input
},
337 { PROTO_CHAP
, chap_Input
},
338 { PROTO_CCP
, ccp_Input
},
339 { PROTO_LQR
, lqr_Input
},
340 { PROTO_CBCP
, cbcp_Input
}
343 #define DSIZE (sizeof despatcher / sizeof despatcher[0])
346 Despatch(struct bundle
*bundle
, struct link
*l
, struct mbuf
*bp
, u_short proto
)
350 for (f
= 0; f
< DSIZE
; f
++)
351 if (despatcher
[f
].proto
== proto
) {
352 bp
= (*despatcher
[f
].fn
)(bundle
, l
, bp
);
357 struct physical
*p
= link2physical(l
);
359 log_Printf(LogPHASE
, "%s protocol 0x%04x (%s)\n",
360 f
== DSIZE
? "Unknown" : "Unexpected", proto
,
361 hdlc_Protocol2Nam(proto
));
362 bp
= m_pullup(proto_Prepend(bp
, proto
, 0, 0));
363 lcp_SendProtoRej(&l
->lcp
, MBUF_CTOP(bp
), bp
->m_len
);
365 p
->hdlc
.lqm
.SaveInDiscards
++;
366 p
->hdlc
.stats
.unknownproto
++;
373 link_ShowLayers(struct cmdargs
const *arg
)
375 struct link
*l
= command_ChooseLink(arg
);
378 for (layer
= l
->nlayers
; layer
; layer
--)
379 prompt_Printf(arg
->prompt
, "%s%s", layer
== l
->nlayers
? "" : ", ",
380 l
->layer
[layer
- 1]->name
);
382 prompt_Printf(arg
->prompt
, "\n");