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