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: head/usr.sbin/ppp/link.h 50867 1999-09-04 00:00:21Z brian $
27 *
28 */
29
30
31#define PHYSICAL_LINK 1
32#define LOGICAL_LINK 2
33
34#define NPROTOSTAT 13
35
36struct bundle;
37struct prompt;
38struct cmdargs;
39
40struct link {
41 int type; /* _LINK type */
42 const char *name; /* Points to datalink::name */
43 int len; /* full size of parent struct */
44 struct pppThroughput throughput; /* Link throughput statistics */
45 struct mqueue Queue[2]; /* Our output queue of mbufs */
46
47 u_long proto_in[NPROTOSTAT]; /* outgoing protocol stats */
48 u_long proto_out[NPROTOSTAT]; /* incoming protocol stats */
49
50 struct lcp lcp; /* Our line control FSM */
51 struct ccp ccp; /* Our compression FSM */
52
53 struct layer const *layer[LAYER_MAX]; /* i/o layers */
54 int nlayers;
55};
56
57#define LINK_QUEUES(link) (sizeof (link)->Queue / sizeof (link)->Queue[0])
58#define LINK_HIGHQ(link) ((link)->Queue + LINK_QUEUES(link) - 1)
59
60extern void link_AddInOctets(struct link *, int);
61extern void link_AddOutOctets(struct link *, int);
62
63extern void link_SequenceQueue(struct link *);
64extern void link_DeleteQueue(struct link *);
65extern int link_QueueLen(struct link *);
66extern int link_QueueBytes(struct link *);
67extern struct mbuf *link_Dequeue(struct link *);
68
69extern void link_PushPacket(struct link *, struct mbuf *, struct bundle *,
70 int, u_short);
71extern void link_PullPacket(struct link *, char *, size_t, struct bundle *);
72extern int link_Stack(struct link *, struct layer *);
73extern void link_EmptyStack(struct link *);
74
75#define PROTO_IN 1 /* third arg to link_ProtocolRecord */
76#define PROTO_OUT 2
77extern void link_ProtocolRecord(struct link *, u_short, int);
78extern void link_ReportProtocolStatus(struct link *, struct prompt *);
79extern int link_ShowLayers(struct cmdargs const *);