xref: /netbsd-src/games/monop/getinp.c (revision c41a4eebefede43f6950f838a387dc18c6a431bf)
1 /*	$NetBSD: getinp.c,v 1.6 1997/10/12 17:45:10 christos Exp $	*/
2 
3 /*
4  * Copyright (c) 1980, 1993
5  *	The Regents of the University of California.  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
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  * 3. All advertising materials mentioning features or use of this software
16  *    must display the following acknowledgement:
17  *	This product includes software developed by the University of
18  *	California, Berkeley and its contributors.
19  * 4. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 #include <sys/cdefs.h>
37 #ifndef lint
38 #if 0
39 static char sccsid[] = "@(#)getinp.c	8.1 (Berkeley) 5/31/93";
40 #else
41 __RCSID("$NetBSD: getinp.c,v 1.6 1997/10/12 17:45:10 christos Exp $");
42 #endif
43 #endif /* not lint */
44 
45 #include <stdio.h>
46 #include <string.h>
47 #include <ctype.h>
48 #include "monop.ext"
49 
50 # define	LINE	70
51 
52 static char	buf[257];
53 
54 static int comp __P((char *));
55 
56 int
57 getinp(prompt, list)
58 char	*prompt, *list[];
59 {
60 
61 	int	i, n_match, match = 0;
62 	char	*sp;
63 	int	c;
64 
65 	for (;;) {
66 inter:
67 		printf(prompt);
68 		for (sp = buf; (c=getchar()) != '\n'; ) {
69 			*sp = c;
70 			if (c == -1)	/* check for interupted system call */
71 				goto inter;
72 			else if (sp != buf || *sp != ' ')
73 				sp++;
74 		}
75 		*sp = c;
76 		if (buf[0] == '?' && buf[1] == '\n') {
77 			printf("Valid inputs are: ");
78 			for (i = 0, match = 18; list[i]; i++) {
79 				if ((match+=(n_match=strlen(list[i]))) > LINE) {
80 					printf("\n\t");
81 					match = n_match + 8;
82 				}
83 				if (*list[i] == '\0') {
84 					match += 8;
85 					printf("<RETURN>");
86 				}
87 				else
88 					printf(list[i]);
89 				if (list[i+1])
90 					printf(", ");
91 				else
92 					putchar('\n');
93 				match += 2;
94 			}
95 			continue;
96 		}
97 		*sp = '\0';
98 		for (sp = buf; *sp; sp++)
99 			if (isupper(*sp))
100 				*sp = tolower(*sp);
101 		for (i = n_match = 0; list[i]; i++)
102 			if (comp(list[i])) {
103 				n_match++;
104 				match = i;
105 			}
106 		if (n_match == 1)
107 			return match;
108 		else if (buf[0] != '\0')
109 			printf("Illegal response: \"%s\".  Use '?' to get list of valid answers\n", buf);
110 	}
111 }
112 
113 static int
114 comp(s1)
115 char	*s1;
116 {
117 
118 	char	*sp, *tsp, c;
119 
120 	if (buf[0] != '\0')
121 		for (sp = buf, tsp = s1; *sp; ) {
122 			c = isupper(*tsp) ? tolower(*tsp) : *tsp;
123 			tsp++;
124 			if (c != *sp++)
125 				return 0;
126 		}
127 	else if (*s1 != '\0')
128 		return 0;
129 	return 1;
130 }
131