| chap.h (78189) | chap.h (93418) |
|---|---|
| 1/*- 2 * Copyright (c) 1996 - 2001 Brian Somers <brian@Awfulhak.org> 3 * based on work by Toshiharu OHNO <tony-o@iij.ad.jp> 4 * Internet Initiative Japan, Inc (IIJ) 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions --- 11 unchanged lines hidden (view full) --- 20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 * | 1/*- 2 * Copyright (c) 1996 - 2001 Brian Somers <brian@Awfulhak.org> 3 * based on work by Toshiharu OHNO <tony-o@iij.ad.jp> 4 * Internet Initiative Japan, Inc (IIJ) 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions --- 11 unchanged lines hidden (view full) --- 20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 * |
| 28 * $FreeBSD: head/usr.sbin/ppp/chap.h 78189 2001-06-13 21:52:19Z brian $ | 28 * $FreeBSD: head/usr.sbin/ppp/chap.h 93418 2002-03-30 12:30:09Z brian $ |
| 29 */ 30 31struct mbuf; 32struct physical; 33 34#define CHAP_CHALLENGE 1 35#define CHAP_RESPONSE 2 36#define CHAP_SUCCESS 3 --- 9 unchanged lines hidden (view full) --- 46 int len; 47 } buf; 48 } child; 49 struct authinfo auth; 50 struct { 51 u_char local[CHAPCHALLENGELEN + AUTHLEN]; /* I invented this one */ 52 u_char peer[CHAPCHALLENGELEN + AUTHLEN]; /* Peer gave us this one */ 53 } challenge; | 29 */ 30 31struct mbuf; 32struct physical; 33 34#define CHAP_CHALLENGE 1 35#define CHAP_RESPONSE 2 36#define CHAP_SUCCESS 3 --- 9 unchanged lines hidden (view full) --- 46 int len; 47 } buf; 48 } child; 49 struct authinfo auth; 50 struct { 51 u_char local[CHAPCHALLENGELEN + AUTHLEN]; /* I invented this one */ 52 u_char peer[CHAPCHALLENGELEN + AUTHLEN]; /* Peer gave us this one */ 53 } challenge; |
| 54#ifdef HAVE_DES | 54#ifndef NODES |
| 55 unsigned NTRespSent : 1; /* Our last response */ 56 int peertries; 57 u_char authresponse[CHAPAUTHRESPONSELEN]; /* CHAP 81 response */ 58#endif 59}; 60 61#define descriptor2chap(d) \ 62 ((d)->type == CHAP_DESCRIPTOR ? (struct chap *)(d) : NULL) 63#define auth2chap(a) \ 64 ((struct chap *)((char *)a - (int)&((struct chap *)0)->auth)) 65 66extern void chap_Init(struct chap *, struct physical *); 67extern void chap_ReInit(struct chap *); 68extern struct mbuf *chap_Input(struct bundle *, struct link *, struct mbuf *); | 55 unsigned NTRespSent : 1; /* Our last response */ 56 int peertries; 57 u_char authresponse[CHAPAUTHRESPONSELEN]; /* CHAP 81 response */ 58#endif 59}; 60 61#define descriptor2chap(d) \ 62 ((d)->type == CHAP_DESCRIPTOR ? (struct chap *)(d) : NULL) 63#define auth2chap(a) \ 64 ((struct chap *)((char *)a - (int)&((struct chap *)0)->auth)) 65 66extern void chap_Init(struct chap *, struct physical *); 67extern void chap_ReInit(struct chap *); 68extern struct mbuf *chap_Input(struct bundle *, struct link *, struct mbuf *); |