NetBSD/games/monop/getinp.c

120 lines
3.2 KiB
C
Raw Permalink Normal View History

2012-06-19 09:30:43 +04:00
/* $NetBSD: getinp.c,v 1.19 2012/06/19 05:35:32 dholland Exp $ */
1993-03-21 12:45:37 +03:00
/*
* Copyright (c) 1980, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03: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.
* 3. Neither the name of the University nor the names of its contributors
1993-03-21 12:45:37 +03:00
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
*/
1997-10-12 21:45:06 +04:00
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
#if 0
static char sccsid[] = "@(#)getinp.c 8.1 (Berkeley) 5/31/93";
#else
2012-06-19 09:30:43 +04:00
__RCSID("$NetBSD: getinp.c,v 1.19 2012/06/19 05:35:32 dholland Exp $");
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
1997-10-12 21:45:06 +04:00
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include "monop.h"
1993-03-21 12:45:37 +03:00
1999-08-21 14:40:03 +04:00
#define LINE 70
1993-03-21 12:45:37 +03:00
static char buf[257];
2004-01-27 23:30:28 +03:00
static int comp(const char *);
1997-10-12 21:45:06 +04:00
int
2012-06-19 09:30:43 +04:00
getinp(const char *prompt, const char *const lst [])
1997-10-12 21:45:06 +04:00
{
1999-08-21 14:40:03 +04:00
int i, n_match, match = 0;
char *sp;
1993-03-21 12:45:37 +03:00
for (;;) {
printf("%s", prompt);
fgets(buf, sizeof(buf), stdin);
if (feof(stdin)) {
return 0;
}
1993-03-21 12:45:37 +03:00
if (buf[0] == '?' && buf[1] == '\n') {
printf("Valid inputs are: ");
2008-01-28 09:16:13 +03:00
for (i = 0, match = 18; lst[i]; i++) {
if ((match+=(n_match=strlen(lst[i]))) > LINE) {
1993-03-21 12:45:37 +03:00
printf("\n\t");
match = n_match + 8;
}
2008-01-28 09:16:13 +03:00
if (*lst[i] == '\0') {
1993-03-21 12:45:37 +03:00
match += 8;
printf("<RETURN>");
}
else
2008-01-28 09:16:13 +03:00
printf("%s", lst[i]);
if (lst[i+1])
1993-03-21 12:45:37 +03:00
printf(", ");
else
putchar('\n');
match += 2;
}
continue;
}
if ((sp = strchr(buf, '\n')) != NULL)
*sp = '\0';
1993-03-21 12:45:37 +03:00
for (sp = buf; *sp; sp++)
*sp = tolower((unsigned char)*sp);
2008-01-28 09:16:13 +03:00
for (i = n_match = 0; lst[i]; i++)
if (comp(lst[i])) {
1993-03-21 12:45:37 +03:00
n_match++;
match = i;
}
if (n_match == 1)
return match;
else if (buf[0] != '\0')
1999-08-21 14:40:03 +04:00
printf("Illegal response: \"%s\". "
"Use '?' to get list of valid answers\n", buf);
1993-03-21 12:45:37 +03:00
}
}
1997-10-12 21:45:06 +04:00
static int
2012-06-19 09:30:43 +04:00
comp(const char *s1)
1997-10-12 21:45:06 +04:00
{
const char *sp, *tsp;
char c;
1993-03-21 12:45:37 +03:00
if (buf[0] != '\0')
for (sp = buf, tsp = s1; *sp; ) {
c = tolower((unsigned char)*tsp);
1993-03-21 12:45:37 +03:00
tsp++;
if (c != *sp++)
return 0;
}
else if (*s1 != '\0')
return 0;
return 1;
}