2001-06-13 21:52:19 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1996 - 2001 Brian Somers <brian@Awfulhak.org>
|
|
|
|
* based on work by Toshiharu OHNO <tony-o@iij.ad.jp>
|
|
|
|
* Internet Initiative Japan, Inc (IIJ)
|
|
|
|
* All rights reserved.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
2001-06-13 21:52:19 +00:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
2001-06-13 21:52:19 +00:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
1999-08-28 01:35:59 +00:00
|
|
|
* $FreeBSD$
|
1995-01-31 06:29:58 +00:00
|
|
|
*/
|
2001-06-13 21:52:19 +00:00
|
|
|
|
1999-01-28 01:56:34 +00:00
|
|
|
#include <sys/param.h>
|
1997-10-26 01:04:02 +00:00
|
|
|
#include <netinet/in.h>
|
1998-05-21 21:49:08 +00:00
|
|
|
#include <netinet/in_systm.h>
|
|
|
|
#include <netinet/ip.h>
|
2001-08-14 16:05:52 +00:00
|
|
|
#include <sys/socket.h>
|
1998-05-21 21:49:08 +00:00
|
|
|
#include <sys/un.h>
|
|
|
|
|
1999-02-06 02:54:47 +00:00
|
|
|
#include <stdlib.h>
|
1999-08-06 20:04:08 +00:00
|
|
|
#include <string.h> /* strlen/memcpy */
|
1998-05-21 21:49:08 +00:00
|
|
|
#include <termios.h>
|
1997-10-26 01:04:02 +00:00
|
|
|
|
1999-05-08 11:07:56 +00:00
|
|
|
#include "layer.h"
|
1997-10-26 01:04:02 +00:00
|
|
|
#include "mbuf.h"
|
|
|
|
#include "log.h"
|
|
|
|
#include "defs.h"
|
|
|
|
#include "timer.h"
|
1995-01-31 06:29:58 +00:00
|
|
|
#include "fsm.h"
|
1998-05-21 21:49:08 +00:00
|
|
|
#include "auth.h"
|
1995-01-31 06:29:58 +00:00
|
|
|
#include "pap.h"
|
1998-05-21 21:49:08 +00:00
|
|
|
#include "lqr.h"
|
1995-01-31 06:29:58 +00:00
|
|
|
#include "hdlc.h"
|
2000-07-19 02:10:35 +00:00
|
|
|
#include "lcp.h"
|
1999-05-08 11:07:56 +00:00
|
|
|
#include "proto.h"
|
1998-05-21 21:49:08 +00:00
|
|
|
#include "async.h"
|
|
|
|
#include "throughput.h"
|
|
|
|
#include "ccp.h"
|
|
|
|
#include "link.h"
|
|
|
|
#include "descriptor.h"
|
|
|
|
#include "physical.h"
|
|
|
|
#include "iplist.h"
|
|
|
|
#include "slcompress.h"
|
2001-08-14 16:05:52 +00:00
|
|
|
#include "ncpaddr.h"
|
1998-05-21 21:49:08 +00:00
|
|
|
#include "ipcp.h"
|
|
|
|
#include "filter.h"
|
|
|
|
#include "mp.h"
|
1999-01-28 01:56:34 +00:00
|
|
|
#ifndef NORADIUS
|
|
|
|
#include "radius.h"
|
|
|
|
#endif
|
2001-08-14 16:05:52 +00:00
|
|
|
#include "ipv6cp.h"
|
|
|
|
#include "ncp.h"
|
1998-05-21 21:49:08 +00:00
|
|
|
#include "bundle.h"
|
|
|
|
#include "chat.h"
|
|
|
|
#include "chap.h"
|
1998-08-07 18:42:51 +00:00
|
|
|
#include "cbcp.h"
|
1998-05-21 21:49:08 +00:00
|
|
|
#include "datalink.h"
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1999-12-27 11:54:57 +00:00
|
|
|
static const char * const papcodes[] = {
|
|
|
|
"???", "REQUEST", "SUCCESS", "FAILURE"
|
|
|
|
};
|
1999-02-06 02:54:47 +00:00
|
|
|
#define MAXPAPCODE (sizeof papcodes / sizeof papcodes[0] - 1)
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1999-02-06 02:54:47 +00:00
|
|
|
static void
|
|
|
|
pap_Req(struct authinfo *authp)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
1999-02-06 02:54:47 +00:00
|
|
|
struct bundle *bundle = authp->physical->dl->bundle;
|
1995-01-31 06:29:58 +00:00
|
|
|
struct fsmheader lh;
|
|
|
|
struct mbuf *bp;
|
|
|
|
u_char *cp;
|
|
|
|
int namelen, keylen, plen;
|
|
|
|
|
1999-02-06 02:54:47 +00:00
|
|
|
namelen = strlen(bundle->cfg.auth.name);
|
|
|
|
keylen = strlen(bundle->cfg.auth.key);
|
1995-01-31 06:29:58 +00:00
|
|
|
plen = namelen + keylen + 2;
|
1999-02-06 02:54:47 +00:00
|
|
|
log_Printf(LogDEBUG, "pap_Req: namelen = %d, keylen = %d\n", namelen, keylen);
|
|
|
|
log_Printf(LogPHASE, "Pap Output: %s ********\n", bundle->cfg.auth.name);
|
|
|
|
if (*bundle->cfg.auth.name == '\0')
|
1998-07-28 21:54:30 +00:00
|
|
|
log_Printf(LogWARN, "Sending empty PAP authname!\n");
|
1995-01-31 06:29:58 +00:00
|
|
|
lh.code = PAP_REQUEST;
|
1999-02-06 02:54:47 +00:00
|
|
|
lh.id = authp->id;
|
1995-01-31 06:29:58 +00:00
|
|
|
lh.length = htons(plen + sizeof(struct fsmheader));
|
1999-12-20 20:29:47 +00:00
|
|
|
bp = m_get(plen + sizeof(struct fsmheader), MB_PAPOUT);
|
1997-10-26 01:04:02 +00:00
|
|
|
memcpy(MBUF_CTOP(bp), &lh, sizeof(struct fsmheader));
|
1995-01-31 06:29:58 +00:00
|
|
|
cp = MBUF_CTOP(bp) + sizeof(struct fsmheader);
|
|
|
|
*cp++ = namelen;
|
1999-02-06 02:54:47 +00:00
|
|
|
memcpy(cp, bundle->cfg.auth.name, namelen);
|
1995-01-31 06:29:58 +00:00
|
|
|
cp += namelen;
|
|
|
|
*cp++ = keylen;
|
1999-02-06 02:54:47 +00:00
|
|
|
memcpy(cp, bundle->cfg.auth.key, keylen);
|
1999-09-04 00:00:21 +00:00
|
|
|
link_PushPacket(&authp->physical->link, bp, bundle,
|
|
|
|
LINK_QUEUES(&authp->physical->link) - 1, PROTO_PAP);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
1999-02-06 02:54:47 +00:00
|
|
|
SendPapCode(struct authinfo *authp, int code, const char *message)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
|
|
|
struct fsmheader lh;
|
|
|
|
struct mbuf *bp;
|
|
|
|
u_char *cp;
|
|
|
|
int plen, mlen;
|
|
|
|
|
|
|
|
lh.code = code;
|
1999-02-06 02:54:47 +00:00
|
|
|
lh.id = authp->id;
|
1995-01-31 06:29:58 +00:00
|
|
|
mlen = strlen(message);
|
|
|
|
plen = mlen + 1;
|
|
|
|
lh.length = htons(plen + sizeof(struct fsmheader));
|
1999-12-20 20:29:47 +00:00
|
|
|
bp = m_get(plen + sizeof(struct fsmheader), MB_PAPOUT);
|
1997-10-26 01:04:02 +00:00
|
|
|
memcpy(MBUF_CTOP(bp), &lh, sizeof(struct fsmheader));
|
1995-01-31 06:29:58 +00:00
|
|
|
cp = MBUF_CTOP(bp) + sizeof(struct fsmheader);
|
1999-11-26 22:44:45 +00:00
|
|
|
/*
|
|
|
|
* If our message is longer than 255 bytes, truncate the length to
|
|
|
|
* 255 and send the entire message anyway. Maybe the other end will
|
|
|
|
* display it... (see pap_Input() !)
|
|
|
|
*/
|
|
|
|
*cp++ = mlen > 255 ? 255 : mlen;
|
1997-10-26 01:04:02 +00:00
|
|
|
memcpy(cp, message, mlen);
|
1998-07-28 21:54:30 +00:00
|
|
|
log_Printf(LogPHASE, "Pap Output: %s\n", papcodes[code]);
|
1999-02-06 02:54:47 +00:00
|
|
|
|
1999-05-08 11:07:56 +00:00
|
|
|
link_PushPacket(&authp->physical->link, bp, authp->physical->dl->bundle,
|
1999-09-04 00:00:21 +00:00
|
|
|
LINK_QUEUES(&authp->physical->link) - 1, PROTO_PAP);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
|
|
|
|
1999-02-06 02:54:47 +00:00
|
|
|
static void
|
|
|
|
pap_Success(struct authinfo *authp)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
2002-05-10 03:11:35 +00:00
|
|
|
struct bundle *bundle = authp->physical->dl->bundle;
|
|
|
|
|
1999-02-06 02:54:47 +00:00
|
|
|
datalink_GotAuthname(authp->physical->dl, authp->in.name);
|
2002-05-10 03:11:35 +00:00
|
|
|
#ifndef NORADIUS
|
|
|
|
if (*bundle->radius.cfg.file && bundle->radius.repstr)
|
|
|
|
SendPapCode(authp, PAP_ACK, bundle->radius.repstr);
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
SendPapCode(authp, PAP_ACK, "Greetings!!");
|
1999-02-06 02:54:47 +00:00
|
|
|
authp->physical->link.lcp.auth_ineed = 0;
|
2002-05-10 03:11:35 +00:00
|
|
|
if (Enabled(bundle, OPT_UTMP))
|
1999-02-06 02:54:47 +00:00
|
|
|
physical_Login(authp->physical, authp->in.name);
|
|
|
|
|
|
|
|
if (authp->physical->link.lcp.auth_iwait == 0)
|
|
|
|
/*
|
|
|
|
* Either I didn't need to authenticate, or I've already been
|
|
|
|
* told that I got the answer right.
|
|
|
|
*/
|
|
|
|
datalink_AuthOk(authp->physical->dl);
|
|
|
|
}
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1999-02-06 02:54:47 +00:00
|
|
|
static void
|
|
|
|
pap_Failure(struct authinfo *authp)
|
|
|
|
{
|
|
|
|
SendPapCode(authp, PAP_NAK, "Login incorrect");
|
|
|
|
datalink_AuthNotOk(authp->physical->dl);
|
|
|
|
}
|
1996-10-06 13:32:37 +00:00
|
|
|
|
1999-02-06 02:54:47 +00:00
|
|
|
void
|
|
|
|
pap_Init(struct authinfo *pap, struct physical *p)
|
|
|
|
{
|
|
|
|
auth_Init(pap, p, pap_Req, pap_Success, pap_Failure);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
|
|
|
|
1999-05-08 11:07:56 +00:00
|
|
|
struct mbuf *
|
|
|
|
pap_Input(struct bundle *bundle, struct link *l, struct mbuf *bp)
|
1995-01-31 06:29:58 +00:00
|
|
|
{
|
1999-05-08 11:07:56 +00:00
|
|
|
struct physical *p = link2physical(l);
|
1999-02-06 02:54:47 +00:00
|
|
|
struct authinfo *authp = &p->dl->pap;
|
|
|
|
u_char nlen, klen, *key;
|
1999-11-26 22:44:45 +00:00
|
|
|
const char *txt;
|
|
|
|
int txtlen;
|
1999-02-06 02:54:47 +00:00
|
|
|
|
1999-05-08 11:07:56 +00:00
|
|
|
if (p == NULL) {
|
|
|
|
log_Printf(LogERROR, "pap_Input: Not a physical link - dropped\n");
|
1999-12-20 20:29:47 +00:00
|
|
|
m_freem(bp);
|
1999-05-08 11:07:56 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (bundle_Phase(bundle) != PHASE_NETWORK &&
|
|
|
|
bundle_Phase(bundle) != PHASE_AUTHENTICATE) {
|
1999-04-01 11:05:23 +00:00
|
|
|
log_Printf(LogPHASE, "Unexpected pap input - dropped !\n");
|
1999-12-20 20:29:47 +00:00
|
|
|
m_freem(bp);
|
1999-05-08 11:07:56 +00:00
|
|
|
return NULL;
|
1999-04-01 11:05:23 +00:00
|
|
|
}
|
|
|
|
|
1999-02-20 01:12:45 +00:00
|
|
|
if ((bp = auth_ReadHeader(authp, bp)) == NULL &&
|
|
|
|
ntohs(authp->in.hdr.length) == 0) {
|
|
|
|
log_Printf(LogWARN, "Pap Input: Truncated header !\n");
|
1999-05-08 11:07:56 +00:00
|
|
|
return NULL;
|
1999-02-20 01:12:45 +00:00
|
|
|
}
|
1999-02-06 02:54:47 +00:00
|
|
|
|
|
|
|
if (authp->in.hdr.code == 0 || authp->in.hdr.code > MAXPAPCODE) {
|
|
|
|
log_Printf(LogPHASE, "Pap Input: %d: Bad PAP code !\n", authp->in.hdr.code);
|
1999-12-20 20:29:47 +00:00
|
|
|
m_freem(bp);
|
1999-05-08 11:07:56 +00:00
|
|
|
return NULL;
|
1999-02-06 02:54:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (authp->in.hdr.code != PAP_REQUEST && authp->id != authp->in.hdr.id &&
|
1999-05-08 11:07:56 +00:00
|
|
|
Enabled(bundle, OPT_IDCHECK)) {
|
1999-02-06 02:54:47 +00:00
|
|
|
/* Wrong conversation dude ! */
|
|
|
|
log_Printf(LogPHASE, "Pap Input: %s dropped (got id %d, not %d)\n",
|
|
|
|
papcodes[authp->in.hdr.code], authp->in.hdr.id, authp->id);
|
1999-12-20 20:29:47 +00:00
|
|
|
m_freem(bp);
|
1999-05-08 11:07:56 +00:00
|
|
|
return NULL;
|
1999-02-06 02:54:47 +00:00
|
|
|
}
|
1999-12-20 20:29:47 +00:00
|
|
|
m_settype(bp, MB_PAPIN);
|
1999-02-06 02:54:47 +00:00
|
|
|
authp->id = authp->in.hdr.id; /* We respond with this id */
|
|
|
|
|
|
|
|
if (bp) {
|
|
|
|
bp = mbuf_Read(bp, &nlen, 1);
|
1999-11-26 22:44:45 +00:00
|
|
|
if (authp->in.hdr.code == PAP_ACK) {
|
|
|
|
/*
|
|
|
|
* Don't restrict the length of our acknowledgement freetext to
|
|
|
|
* nlen (a one-byte length). Show the rest of the ack packet
|
|
|
|
* instead. This isn't really part of the protocol.....
|
|
|
|
*/
|
1999-12-20 20:29:47 +00:00
|
|
|
bp = m_pullup(bp);
|
1999-11-26 22:44:45 +00:00
|
|
|
txt = MBUF_CTOP(bp);
|
1999-12-20 20:29:47 +00:00
|
|
|
txtlen = m_length(bp);
|
1999-11-26 22:44:45 +00:00
|
|
|
} else {
|
|
|
|
bp = auth_ReadName(authp, bp, nlen);
|
|
|
|
txt = authp->in.name;
|
|
|
|
txtlen = strlen(authp->in.name);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
txt = "";
|
|
|
|
txtlen = 0;
|
1999-02-06 02:54:47 +00:00
|
|
|
}
|
|
|
|
|
1999-11-26 22:44:45 +00:00
|
|
|
log_Printf(LogPHASE, "Pap Input: %s (%.*s)\n",
|
|
|
|
papcodes[authp->in.hdr.code], txtlen, txt);
|
1999-02-06 02:54:47 +00:00
|
|
|
|
|
|
|
switch (authp->in.hdr.code) {
|
|
|
|
case PAP_REQUEST:
|
|
|
|
if (bp == NULL) {
|
|
|
|
log_Printf(LogPHASE, "Pap Input: No key given !\n");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
bp = mbuf_Read(bp, &klen, 1);
|
1999-12-20 20:29:47 +00:00
|
|
|
if (m_length(bp) < klen) {
|
1999-02-06 02:54:47 +00:00
|
|
|
log_Printf(LogERROR, "Pap Input: Truncated key !\n");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((key = malloc(klen+1)) == NULL) {
|
|
|
|
log_Printf(LogERROR, "Pap Input: Out of memory !\n");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
bp = mbuf_Read(bp, key, klen);
|
|
|
|
key[klen] = '\0';
|
|
|
|
|
|
|
|
#ifndef NORADIUS
|
2002-05-16 13:34:20 +00:00
|
|
|
if (*bundle->radius.cfg.file) {
|
|
|
|
if (!radius_Authenticate(&bundle->radius, authp, authp->in.name,
|
2002-06-17 01:12:38 +00:00
|
|
|
key, strlen(key), NULL, 0))
|
2002-05-16 13:34:20 +00:00
|
|
|
pap_Failure(authp);
|
|
|
|
} else
|
1999-02-06 02:54:47 +00:00
|
|
|
#endif
|
2004-09-05 01:46:52 +00:00
|
|
|
if (auth_Validate(bundle, authp->in.name, key))
|
1999-02-06 02:54:47 +00:00
|
|
|
pap_Success(authp);
|
|
|
|
else
|
|
|
|
pap_Failure(authp);
|
|
|
|
|
|
|
|
free(key);
|
|
|
|
break;
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1999-02-06 02:54:47 +00:00
|
|
|
case PAP_ACK:
|
|
|
|
auth_StopTimer(authp);
|
|
|
|
if (p->link.lcp.auth_iwait == PROTO_PAP) {
|
|
|
|
p->link.lcp.auth_iwait = 0;
|
|
|
|
if (p->link.lcp.auth_ineed == 0)
|
|
|
|
/*
|
|
|
|
* We've succeeded in our ``login''
|
|
|
|
* If we're not expecting the peer to authenticate (or he already
|
|
|
|
* has), proceed to network phase.
|
|
|
|
*/
|
|
|
|
datalink_AuthOk(p->dl);
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
1999-02-06 02:54:47 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PAP_NAK:
|
|
|
|
auth_StopTimer(authp);
|
|
|
|
datalink_AuthNotOk(p->dl);
|
|
|
|
break;
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|
1999-02-06 02:54:47 +00:00
|
|
|
|
1999-12-20 20:29:47 +00:00
|
|
|
m_freem(bp);
|
1999-05-08 11:07:56 +00:00
|
|
|
return NULL;
|
1995-01-31 06:29:58 +00:00
|
|
|
}
|