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