879ed6fa82
Increment OutPackets for any packet - not just LQRs MFC: o Fix a few comment typos. o Fix ``set timeout'' usage message and documentation. o Change ifOutPackets, ifOutOctets and ifOutLQRs to `u_int32_t's so that they wrap correctly. o Put the LQR in network byte order using the correct struct size (sizeof u_int32_t, not sizeof u_long). o Wrap LQR ECHO counters correctly. o Don't increment OutLQR count if the last LQR hasn't been replied to. o Initialise last received LQR in StartLqm. o Don't start the LQR timer if we're `disabled' and `accepted'. o Generate LQR responses when both sides are using a timer and we're not going to send our next LQR before the peers max timeout.
274 lines
6.6 KiB
C
274 lines
6.6 KiB
C
/*
|
|
* PPP Secret Key Module
|
|
*
|
|
* Written by Toshiharu OHNO (tony-o@iij.ad.jp)
|
|
*
|
|
* Copyright (C) 1994, Internet Initiative Japan, Inc. All rights reserverd.
|
|
*
|
|
* Redistribution and use in source and binary forms are permitted
|
|
* provided that the above copyright notice and this paragraph are
|
|
* duplicated in all such forms and that any documentation,
|
|
* advertising materials, and other materials related to such
|
|
* distribution and use acknowledge that the software was developed
|
|
* by the Internet Initiative Japan, Inc. The name of the
|
|
* IIJ may not be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
*
|
|
* $Id: auth.c,v 1.27.2.11 1998/03/09 19:25:33 brian Exp $
|
|
*
|
|
* TODO:
|
|
* o Implement check against with registered IP addresses.
|
|
*/
|
|
#include <sys/param.h>
|
|
#include <netinet/in.h>
|
|
|
|
#include <assert.h>
|
|
#include <pwd.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <termios.h>
|
|
#include <unistd.h>
|
|
|
|
#include "command.h"
|
|
#include "mbuf.h"
|
|
#include "defs.h"
|
|
#include "timer.h"
|
|
#include "fsm.h"
|
|
#include "iplist.h"
|
|
#include "throughput.h"
|
|
#include "ipcp.h"
|
|
#include "loadalias.h"
|
|
#include "vars.h"
|
|
#include "auth.h"
|
|
#include "systems.h"
|
|
#include "lcp.h"
|
|
#include "lqr.h"
|
|
#include "hdlc.h"
|
|
#include "async.h"
|
|
#include "link.h"
|
|
#include "descriptor.h"
|
|
#include "physical.h"
|
|
#include "chat.h"
|
|
#include "lcpproto.h"
|
|
|
|
const char *
|
|
Auth2Nam(u_short auth)
|
|
{
|
|
switch (auth) {
|
|
case PROTO_PAP:
|
|
return "PAP";
|
|
case PROTO_CHAP:
|
|
return "CHAP";
|
|
case 0:
|
|
return "none";
|
|
}
|
|
return "unknown";
|
|
}
|
|
|
|
void
|
|
LocalAuthInit()
|
|
{
|
|
if (!(mode&MODE_DAEMON))
|
|
/* We're allowed in interactive mode */
|
|
VarLocalAuth = LOCAL_AUTH;
|
|
else if (VarHaveLocalAuthKey)
|
|
VarLocalAuth = *VarLocalAuthKey == '\0' ? LOCAL_AUTH : LOCAL_NO_AUTH;
|
|
else
|
|
switch (LocalAuthValidate(SECRETFILE, VarShortHost, "")) {
|
|
case NOT_FOUND:
|
|
VarLocalAuth = LOCAL_DENY;
|
|
break;
|
|
case VALID:
|
|
VarLocalAuth = LOCAL_AUTH;
|
|
break;
|
|
case INVALID:
|
|
VarLocalAuth = LOCAL_NO_AUTH;
|
|
break;
|
|
}
|
|
}
|
|
|
|
LOCAL_AUTH_VALID
|
|
LocalAuthValidate(const char *fname, const char *system, const char *key)
|
|
{
|
|
FILE *fp;
|
|
int n;
|
|
char *vector[3];
|
|
char buff[LINE_LEN];
|
|
LOCAL_AUTH_VALID rc;
|
|
|
|
rc = NOT_FOUND; /* No system entry */
|
|
fp = OpenSecret(fname);
|
|
if (fp == NULL)
|
|
return (rc);
|
|
while (fgets(buff, sizeof buff, fp)) {
|
|
if (buff[0] == '#')
|
|
continue;
|
|
buff[strlen(buff) - 1] = 0;
|
|
memset(vector, '\0', sizeof vector);
|
|
n = MakeArgs(buff, vector, VECSIZE(vector));
|
|
if (n < 1)
|
|
continue;
|
|
if (strcmp(vector[0], system) == 0) {
|
|
if ((vector[1] == (char *) NULL && (key == NULL || *key == '\0')) ||
|
|
(vector[1] != (char *) NULL && strcmp(vector[1], key) == 0)) {
|
|
rc = VALID; /* Valid */
|
|
} else {
|
|
rc = INVALID; /* Invalid */
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
CloseSecret(fp);
|
|
return (rc);
|
|
}
|
|
|
|
static int
|
|
auth_CheckPasswd(const char *name, const char *data, const char *key)
|
|
{
|
|
if (!strcmp(data, "*")) {
|
|
/* Then look up the real password database */
|
|
struct passwd *pw;
|
|
int result;
|
|
|
|
result = (pw = getpwnam(name)) &&
|
|
!strcmp(crypt(key, pw->pw_passwd), pw->pw_passwd);
|
|
endpwent();
|
|
return result;
|
|
}
|
|
|
|
return !strcmp(data, key);
|
|
}
|
|
|
|
int
|
|
AuthValidate(struct bundle *bundle, const char *fname, const char *system,
|
|
const char *key, struct physical *physical)
|
|
{
|
|
/* Used by PAP routines */
|
|
|
|
FILE *fp;
|
|
int n;
|
|
char *vector[5];
|
|
char buff[LINE_LEN];
|
|
|
|
fp = OpenSecret(fname);
|
|
if (fp != NULL) {
|
|
while (fgets(buff, sizeof buff, fp)) {
|
|
if (buff[0] == '#')
|
|
continue;
|
|
buff[strlen(buff) - 1] = 0;
|
|
memset(vector, '\0', sizeof vector);
|
|
n = MakeArgs(buff, vector, VECSIZE(vector));
|
|
if (n < 2)
|
|
continue;
|
|
if (strcmp(vector[0], system) == 0)
|
|
if (auth_CheckPasswd(vector[0], vector[1], key)) {
|
|
CloseSecret(fp);
|
|
if (n > 2 && !UseHisaddr(bundle, vector[2], 1))
|
|
return (0);
|
|
/* XXX This should be deferred - we may join an existing bundle ! */
|
|
ipcp_Setup(&IpcpInfo);
|
|
if (n > 3)
|
|
SetLabel(vector[3]);
|
|
return 1; /* Valid */
|
|
} else {
|
|
CloseSecret(fp);
|
|
return 0; /* Invalid */
|
|
}
|
|
}
|
|
CloseSecret(fp);
|
|
}
|
|
|
|
#ifndef NOPASSWDAUTH
|
|
if (Enabled(ConfPasswdAuth))
|
|
return auth_CheckPasswd(system, "*", key);
|
|
#endif
|
|
|
|
return 0; /* Invalid */
|
|
}
|
|
|
|
char *
|
|
AuthGetSecret(struct bundle *bundle, const char *fname, const char *system,
|
|
int len, int setaddr, struct physical *physical)
|
|
{
|
|
/* Used by CHAP routines */
|
|
|
|
FILE *fp;
|
|
int n;
|
|
char *vector[5];
|
|
static char buff[LINE_LEN];
|
|
|
|
fp = OpenSecret(fname);
|
|
if (fp == NULL)
|
|
return (NULL);
|
|
|
|
while (fgets(buff, sizeof buff, fp)) {
|
|
if (buff[0] == '#')
|
|
continue;
|
|
buff[strlen(buff) - 1] = 0;
|
|
memset(vector, '\0', sizeof vector);
|
|
n = MakeArgs(buff, vector, VECSIZE(vector));
|
|
if (n < 2)
|
|
continue;
|
|
if (strlen(vector[0]) == len && strncmp(vector[0], system, len) == 0) {
|
|
if (setaddr)
|
|
memset(&IpcpInfo.cfg.peer_range, '\0', sizeof IpcpInfo.cfg.peer_range);
|
|
if (n > 2 && setaddr)
|
|
if (UseHisaddr(bundle, vector[2], 1))
|
|
/* XXX This should be deferred - we may join an existing bundle ! */
|
|
ipcp_Setup(&IpcpInfo);
|
|
else
|
|
return NULL;
|
|
if (n > 3)
|
|
SetLabel(vector[3]);
|
|
return vector[1];
|
|
}
|
|
}
|
|
CloseSecret(fp);
|
|
return (NULL); /* Invalid */
|
|
}
|
|
|
|
static void
|
|
AuthTimeout(void *vauthp)
|
|
{
|
|
struct authinfo *authp = (struct authinfo *)vauthp;
|
|
|
|
StopTimer(&authp->authtimer);
|
|
if (--authp->retry > 0) {
|
|
StartTimer(&authp->authtimer);
|
|
(*authp->ChallengeFunc)(authp, ++authp->id, authp->physical);
|
|
}
|
|
}
|
|
|
|
void
|
|
authinfo_Init(struct authinfo *authinfo)
|
|
{
|
|
memset(authinfo, '\0', sizeof(struct authinfo));
|
|
}
|
|
|
|
void
|
|
StartAuthChallenge(struct authinfo *authp, struct physical *physical,
|
|
void (*fn)(struct authinfo *, int, struct physical *))
|
|
{
|
|
authp->ChallengeFunc = fn;
|
|
authp->physical = physical;
|
|
StopTimer(&authp->authtimer);
|
|
authp->authtimer.func = AuthTimeout;
|
|
authp->authtimer.load = VarRetryTimeout * SECTICKS;
|
|
authp->authtimer.state = TIMER_STOPPED;
|
|
authp->authtimer.arg = (void *) authp;
|
|
authp->retry = 3;
|
|
authp->id = 1;
|
|
(*authp->ChallengeFunc)(authp, authp->id, physical);
|
|
StartTimer(&authp->authtimer);
|
|
}
|
|
|
|
void
|
|
StopAuthTimer(struct authinfo *authp)
|
|
{
|
|
StopTimer(&authp->authtimer);
|
|
authp->physical = NULL;
|
|
}
|