1 /*- 2 * Copyright (c) 1998 Brian Somers <brian@Awfulhak.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 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. 13 * 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 24 * SUCH DAMAGE. 25 * 26 * $FreeBSD$ 27 * 28 */ 29 30 #include <sys/types.h> 31 #include <netinet/in_systm.h> 32 #include <sys/socket.h> 33 #include <sys/un.h> 34 #include <netinet/in.h> 35 #include <netinet/ip.h> 36 37 #include <stdarg.h> 38 #include <stdio.h> 39 #include <string.h> 40 #include <termios.h> 41 42 #include "defs.h" 43 #include "layer.h" 44 #include "mbuf.h" 45 #include "log.h" 46 #include "timer.h" 47 #include "lqr.h" 48 #include "hdlc.h" 49 #include "throughput.h" 50 #include "proto.h" 51 #include "fsm.h" 52 #include "descriptor.h" 53 #include "lcp.h" 54 #include "ccp.h" 55 #include "link.h" 56 #include "prompt.h" 57 #include "async.h" 58 #include "physical.h" 59 #include "mp.h" 60 #include "iplist.h" 61 #include "slcompress.h" 62 #include "ncpaddr.h" 63 #include "ip.h" 64 #include "ipcp.h" 65 #include "ipv6cp.h" 66 #include "auth.h" 67 #include "pap.h" 68 #include "chap.h" 69 #include "cbcp.h" 70 #include "command.h" 71 72 static void Despatch(struct bundle *, struct link *, struct mbuf *, u_short); 73 74 static inline void 75 link_AddInOctets(struct link *l, int n) 76 { 77 if (l->stats.gather) { 78 throughput_addin(&l->stats.total, n); 79 if (l->stats.parent) 80 throughput_addin(l->stats.parent, n); 81 } 82 } 83 84 static inline void 85 link_AddOutOctets(struct link *l, int n) 86 { 87 if (l->stats.gather) { 88 throughput_addout(&l->stats.total, n); 89 if (l->stats.parent) 90 throughput_addout(l->stats.parent, n); 91 } 92 } 93 94 void 95 link_SequenceQueue(struct link *l) 96 { 97 struct mqueue *queue, *highest; 98 99 log_Printf(LogDEBUG, "link_SequenceQueue\n"); 100 101 highest = LINK_HIGHQ(l); 102 for (queue = l->Queue; queue < highest; queue++) 103 while (queue->len) 104 m_enqueue(highest, m_dequeue(queue)); 105 } 106 107 void 108 link_DeleteQueue(struct link *l) 109 { 110 struct mqueue *queue, *highest; 111 112 highest = LINK_HIGHQ(l); 113 for (queue = l->Queue; queue <= highest; queue++) 114 while (queue->top) 115 m_freem(m_dequeue(queue)); 116 } 117 118 size_t 119 link_QueueLen(struct link *l) 120 { 121 int i; 122 size_t len; 123 124 for (i = 0, len = 0; i < LINK_QUEUES(l); i++) 125 len += l->Queue[i].len; 126 127 return len; 128 } 129 130 size_t 131 link_QueueBytes(struct link *l) 132 { 133 int i; 134 size_t len, bytes; 135 struct mbuf *m; 136 137 bytes = 0; 138 for (i = 0, len = 0; i < LINK_QUEUES(l); i++) { 139 len = l->Queue[i].len; 140 m = l->Queue[i].top; 141 while (len--) { 142 bytes += m_length(m); 143 m = m->m_nextpkt; 144 } 145 } 146 147 return bytes; 148 } 149 150 struct mbuf * 151 link_Dequeue(struct link *l) 152 { 153 int pri; 154 struct mbuf *bp; 155 156 for (bp = NULL, pri = LINK_QUEUES(l) - 1; pri >= 0; pri--) 157 if (l->Queue[pri].len) { 158 bp = m_dequeue(l->Queue + pri); 159 log_Printf(LogDEBUG, "link_Dequeue: Dequeued from queue %d," 160 " containing %lu more packets\n", pri, 161 (u_long)l->Queue[pri].len); 162 break; 163 } 164 165 return bp; 166 } 167 168 static struct protostatheader { 169 u_short number; 170 const char *name; 171 } ProtocolStat[NPROTOSTAT] = { 172 { PROTO_IP, "IP" }, 173 { PROTO_VJUNCOMP, "VJ_UNCOMP" }, 174 { PROTO_VJCOMP, "VJ_COMP" }, 175 { PROTO_COMPD, "COMPD" }, 176 { PROTO_ICOMPD, "ICOMPD" }, 177 { PROTO_LCP, "LCP" }, 178 { PROTO_IPCP, "IPCP" }, 179 { PROTO_CCP, "CCP" }, 180 { PROTO_PAP, "PAP" }, 181 { PROTO_LQR, "LQR" }, 182 { PROTO_CHAP, "CHAP" }, 183 { PROTO_MP, "MULTILINK" }, 184 { 0, "Others" } 185 }; 186 187 void 188 link_ProtocolRecord(struct link *l, u_short proto, int type) 189 { 190 int i; 191 192 for (i = 0; i < NPROTOSTAT; i++) 193 if (ProtocolStat[i].number == proto) 194 break; 195 196 if (type == PROTO_IN) 197 l->proto_in[i]++; 198 else 199 l->proto_out[i]++; 200 } 201 202 void 203 link_ReportProtocolStatus(struct link *l, struct prompt *prompt) 204 { 205 int i; 206 207 prompt_Printf(prompt, " Protocol in out " 208 "Protocol in out\n"); 209 for (i = 0; i < NPROTOSTAT; i++) { 210 prompt_Printf(prompt, " %-9s: %8lu, %8lu", 211 ProtocolStat[i].name, l->proto_in[i], l->proto_out[i]); 212 if ((i % 2) == 0) 213 prompt_Printf(prompt, "\n"); 214 } 215 if (!(i % 2)) 216 prompt_Printf(prompt, "\n"); 217 } 218 219 void 220 link_PushPacket(struct link *l, struct mbuf *bp, struct bundle *b, int pri, 221 u_short proto) 222 { 223 int layer; 224 225 /* 226 * When we ``push'' a packet into the link, it gets processed by the 227 * ``push'' function in each layer starting at the top. 228 * We never expect the result of a ``push'' to be more than one 229 * packet (as we do with ``pull''s). 230 */ 231 232 if(pri < 0 || pri >= LINK_QUEUES(l)) 233 pri = 0; 234 235 for (layer = l->nlayers; layer && bp; layer--) 236 if (l->layer[layer - 1]->push != NULL) 237 bp = (*l->layer[layer - 1]->push)(b, l, bp, pri, &proto); 238 239 if (bp) { 240 link_AddOutOctets(l, m_length(bp)); 241 log_Printf(LogDEBUG, "link_PushPacket: Transmit proto 0x%04x\n", proto); 242 m_enqueue(l->Queue + pri, m_pullup(bp)); 243 } 244 } 245 246 void 247 link_PullPacket(struct link *l, char *buf, size_t len, struct bundle *b) 248 { 249 struct mbuf *bp, *lbp[LAYER_MAX], *next; 250 u_short lproto[LAYER_MAX], proto; 251 int layer; 252 253 /* 254 * When we ``pull'' a packet from the link, it gets processed by the 255 * ``pull'' function in each layer starting at the bottom. 256 * Each ``pull'' may produce multiple packets, chained together using 257 * bp->m_nextpkt. 258 * Each packet that results from each pull has to be pulled through 259 * all of the higher layers before the next resulting packet is pulled 260 * through anything; this ensures that packets that depend on the 261 * fsm state resulting from the receipt of the previous packet aren't 262 * surprised. 263 */ 264 265 link_AddInOctets(l, len); 266 267 memset(lbp, '\0', sizeof lbp); 268 lbp[0] = m_get(len, MB_UNKNOWN); 269 memcpy(MBUF_CTOP(lbp[0]), buf, len); 270 lproto[0] = 0; 271 layer = 0; 272 273 while (layer || lbp[layer]) { 274 if (lbp[layer] == NULL) { 275 layer--; 276 continue; 277 } 278 bp = lbp[layer]; 279 lbp[layer] = bp->m_nextpkt; 280 bp->m_nextpkt = NULL; 281 proto = lproto[layer]; 282 283 if (l->layer[layer]->pull != NULL) 284 bp = (*l->layer[layer]->pull)(b, l, bp, &proto); 285 286 if (layer == l->nlayers - 1) { 287 /* We've just done the top layer, despatch the packet(s) */ 288 while (bp) { 289 next = bp->m_nextpkt; 290 bp->m_nextpkt = NULL; 291 log_Printf(LogDEBUG, "link_PullPacket: Despatch proto 0x%04x\n", proto); 292 Despatch(b, l, bp, proto); 293 bp = next; 294 } 295 } else { 296 lbp[++layer] = bp; 297 lproto[layer] = proto; 298 } 299 } 300 } 301 302 int 303 link_Stack(struct link *l, struct layer *layer) 304 { 305 if (l->nlayers == sizeof l->layer / sizeof l->layer[0]) { 306 log_Printf(LogERROR, "%s: Oops, cannot stack a %s layer...\n", 307 l->name, layer->name); 308 return 0; 309 } 310 l->layer[l->nlayers++] = layer; 311 return 1; 312 } 313 314 void 315 link_EmptyStack(struct link *l) 316 { 317 l->nlayers = 0; 318 } 319 320 static const struct { 321 u_short proto; 322 struct mbuf *(*fn)(struct bundle *, struct link *, struct mbuf *); 323 } despatcher[] = { 324 { PROTO_IP, ipv4_Input }, 325 #ifndef NOINET6 326 { PROTO_IPV6, ipv6_Input }, 327 #endif 328 { PROTO_MP, mp_Input }, 329 { PROTO_LCP, lcp_Input }, 330 { PROTO_IPCP, ipcp_Input }, 331 #ifndef NOINET6 332 { PROTO_IPV6CP, ipv6cp_Input }, 333 #endif 334 { PROTO_PAP, pap_Input }, 335 { PROTO_CHAP, chap_Input }, 336 { PROTO_CCP, ccp_Input }, 337 { PROTO_LQR, lqr_Input }, 338 { PROTO_CBCP, cbcp_Input } 339 }; 340 341 #define DSIZE (sizeof despatcher / sizeof despatcher[0]) 342 343 static void 344 Despatch(struct bundle *bundle, struct link *l, struct mbuf *bp, u_short proto) 345 { 346 int f; 347 348 for (f = 0; f < DSIZE; f++) 349 if (despatcher[f].proto == proto) { 350 bp = (*despatcher[f].fn)(bundle, l, bp); 351 break; 352 } 353 354 if (bp) { 355 struct physical *p = link2physical(l); 356 357 log_Printf(LogPHASE, "%s protocol 0x%04x (%s)\n", 358 f == DSIZE ? "Unknown" : "Unexpected", proto, 359 hdlc_Protocol2Nam(proto)); 360 bp = m_pullup(proto_Prepend(bp, proto, 0, 0)); 361 lcp_SendProtoRej(&l->lcp, MBUF_CTOP(bp), bp->m_len); 362 if (p) { 363 p->hdlc.lqm.SaveInDiscards++; 364 p->hdlc.stats.unknownproto++; 365 } 366 m_freem(bp); 367 } 368 } 369 370 int 371 link_ShowLayers(struct cmdargs const *arg) 372 { 373 struct link *l = command_ChooseLink(arg); 374 int layer; 375 376 for (layer = l->nlayers; layer; layer--) 377 prompt_Printf(arg->prompt, "%s%s", layer == l->nlayers ? "" : ", ", 378 l->layer[layer - 1]->name); 379 if (l->nlayers) 380 prompt_Printf(arg->prompt, "\n"); 381 382 return 0; 383 } 384