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