71 lines
1.4 KiB
C
71 lines
1.4 KiB
C
/* parsechallenge.c: The _opieparsechallenge() library function.
|
|
|
|
%%% copyright-cmetz
|
|
This software is Copyright 1996 by Craig Metz, All Rights Reserved.
|
|
The Inner Net License Version 2 applies to this software.
|
|
You should have received a copy of the license with this software. If
|
|
you didn't get a copy, you may request one from <license@inner.net>.
|
|
|
|
History:
|
|
|
|
Created by cmetz for OPIE 2.3 using generator.c as a guide.
|
|
*/
|
|
|
|
#include "opie_cfg.h"
|
|
#if HAVE_STRING_H
|
|
#include <string.h>
|
|
#endif /* HAVE_STRING_H */
|
|
#include "opie.h"
|
|
|
|
struct algorithm {
|
|
char *name;
|
|
int num;
|
|
};
|
|
|
|
static struct algorithm algorithms[] = {
|
|
{ "md5", 5 },
|
|
{ "md4", 4 },
|
|
{ "sha1", 3 },
|
|
{ NULL, 0 },
|
|
};
|
|
|
|
int _opieparsechallenge FUNCTION((buffer, algorithm, sequence, seed), char *buffer AND int *algorithm AND int *sequence AND char **seed)
|
|
{
|
|
char *c;
|
|
|
|
if (!(c = strchr(buffer, ' ')))
|
|
return 1;
|
|
|
|
{
|
|
struct algorithm *a;
|
|
|
|
for (a = algorithms; a->name && strncmp(buffer, a->name, (int)(c - buffer)); a++);
|
|
if (!a->name)
|
|
return -1;
|
|
|
|
*algorithm = a->num;
|
|
}
|
|
|
|
if ((*sequence = strtoul(++c, &c, 10)) > 9999)
|
|
return -1;
|
|
|
|
while(*c && isspace(*c)) c++;
|
|
if (!*c)
|
|
return -1;
|
|
|
|
buffer = c;
|
|
while(*c && !isspace(*c)) c++;
|
|
|
|
{
|
|
int i = (int)(c - buffer);
|
|
|
|
if ((i > OPIE_SEED_MAX) || (i < OPIE_SEED_MIN))
|
|
return -1;
|
|
}
|
|
|
|
*seed = buffer;
|
|
*c = 0;
|
|
|
|
return 0;
|
|
}
|