link.h (3b0f8d2ed641ceeded11c0d3f253b0cacbf00880) | link.h (b6217683dc0269a53b799399522dbdfb5a4919cc) |
---|---|
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 unchanged lines hidden (view full) --- 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 * | 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 unchanged lines hidden (view full) --- 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 * $Id: link.h,v 1.1.2.6 1998/02/23 00:38:34 brian Exp $ | 26 * $Id: link.h,v 1.1.2.7 1998/04/03 19:21:33 brian Exp $ |
27 * 28 */ 29 30 31#define PHYSICAL_LINK 1 32#define MP_LINK 2 33 34#define LINK_QUEUES (PRI_MAX + 1) 35#define NPROTOSTAT 12 36 37struct bundle; | 27 * 28 */ 29 30 31#define PHYSICAL_LINK 1 32#define MP_LINK 2 33 34#define LINK_QUEUES (PRI_MAX + 1) 35#define NPROTOSTAT 12 36 37struct bundle; |
38struct prompt; |
|
38 39struct link { 40 int type; /* _LINK type */ 41 char *name; /* unique id per link type */ 42 int len; /* full size of parent struct */ 43 struct pppThroughput throughput; /* Link throughput statistics */ 44 struct pppTimer Timer; /* inactivity timeout */ 45 struct mqueue Queue[LINK_QUEUES]; /* Our output queue of mbufs */ --- 14 unchanged lines hidden (view full) --- 60extern struct mbuf *link_Dequeue(struct link *); 61extern void link_Write(struct link *, int, const char *, int); 62extern void link_StartOutput(struct link *, struct bundle *); 63extern void link_Output(struct link *, int, struct mbuf *); 64 65#define PROTO_IN 1 /* third arg to link_ProtocolRecord */ 66#define PROTO_OUT 2 67extern void link_ProtocolRecord(struct link *, u_short, int); | 39 40struct link { 41 int type; /* _LINK type */ 42 char *name; /* unique id per link type */ 43 int len; /* full size of parent struct */ 44 struct pppThroughput throughput; /* Link throughput statistics */ 45 struct pppTimer Timer; /* inactivity timeout */ 46 struct mqueue Queue[LINK_QUEUES]; /* Our output queue of mbufs */ --- 14 unchanged lines hidden (view full) --- 61extern struct mbuf *link_Dequeue(struct link *); 62extern void link_Write(struct link *, int, const char *, int); 63extern void link_StartOutput(struct link *, struct bundle *); 64extern void link_Output(struct link *, int, struct mbuf *); 65 66#define PROTO_IN 1 /* third arg to link_ProtocolRecord */ 67#define PROTO_OUT 2 68extern void link_ProtocolRecord(struct link *, u_short, int); |
68extern void link_ReportProtocolStatus(struct link *); | 69extern void link_ReportProtocolStatus(struct link *, struct prompt *); |