Home | History | Annotate | Line # | Download | only in monop
      1  1.19  dholland /*	$NetBSD: getinp.c,v 1.19 2012/06/19 05:35:32 dholland 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.11       agc  * 3. Neither the name of the University nor the names of its contributors
     16   1.1       cgd  *    may be used to endorse or promote products derived from this software
     17   1.1       cgd  *    without specific prior written permission.
     18   1.1       cgd  *
     19   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29   1.1       cgd  * SUCH DAMAGE.
     30   1.1       cgd  */
     31   1.1       cgd 
     32   1.6  christos #include <sys/cdefs.h>
     33   1.1       cgd #ifndef lint
     34   1.3       cgd #if 0
     35   1.3       cgd static char sccsid[] = "@(#)getinp.c	8.1 (Berkeley) 5/31/93";
     36   1.3       cgd #else
     37  1.19  dholland __RCSID("$NetBSD: getinp.c,v 1.19 2012/06/19 05:35:32 dholland Exp $");
     38   1.3       cgd #endif
     39   1.1       cgd #endif /* not lint */
     40   1.1       cgd 
     41   1.6  christos #include <stdio.h>
     42   1.6  christos #include <string.h>
     43   1.6  christos #include <ctype.h>
     44  1.18  dholland 
     45  1.18  dholland #include "monop.h"
     46   1.1       cgd 
     47   1.7    simonb #define	LINE	70
     48   1.1       cgd 
     49   1.1       cgd static char	buf[257];
     50   1.1       cgd 
     51  1.12       jsm static int comp(const char *);
     52   1.6  christos 
     53   1.6  christos int
     54  1.19  dholland getinp(const char *prompt, const char *const lst [])
     55   1.6  christos {
     56   1.7    simonb 	int i, n_match, match = 0;
     57   1.7    simonb 	char *sp;
     58   1.1       cgd 
     59   1.1       cgd 	for (;;) {
     60   1.9    itojun 		printf("%s", prompt);
     61  1.17  dholland 		fgets(buf, sizeof(buf), stdin);
     62  1.17  dholland 		if (feof(stdin)) {
     63  1.17  dholland 			return 0;
     64   1.5   thorpej 		}
     65   1.1       cgd 		if (buf[0] == '?' && buf[1] == '\n') {
     66   1.1       cgd 			printf("Valid inputs are: ");
     67  1.15  dholland 			for (i = 0, match = 18; lst[i]; i++) {
     68  1.15  dholland 				if ((match+=(n_match=strlen(lst[i]))) > LINE) {
     69   1.1       cgd 					printf("\n\t");
     70   1.1       cgd 					match = n_match + 8;
     71   1.1       cgd 				}
     72  1.15  dholland 				if (*lst[i] == '\0') {
     73   1.1       cgd 					match += 8;
     74   1.1       cgd 					printf("<RETURN>");
     75   1.1       cgd 				}
     76   1.1       cgd 				else
     77  1.15  dholland 					printf("%s", lst[i]);
     78  1.15  dholland 				if (lst[i+1])
     79   1.1       cgd 					printf(", ");
     80   1.1       cgd 				else
     81   1.1       cgd 					putchar('\n');
     82   1.1       cgd 				match += 2;
     83   1.1       cgd 			}
     84   1.1       cgd 			continue;
     85   1.1       cgd 		}
     86  1.17  dholland 		if ((sp = strchr(buf, '\n')) != NULL)
     87  1.17  dholland 			*sp = '\0';
     88   1.1       cgd 		for (sp = buf; *sp; sp++)
     89  1.13       dsl 			*sp = tolower((unsigned char)*sp);
     90  1.15  dholland 		for (i = n_match = 0; lst[i]; i++)
     91  1.15  dholland 			if (comp(lst[i])) {
     92   1.1       cgd 				n_match++;
     93   1.1       cgd 				match = i;
     94   1.1       cgd 			}
     95   1.1       cgd 		if (n_match == 1)
     96   1.1       cgd 			return match;
     97   1.1       cgd 		else if (buf[0] != '\0')
     98   1.7    simonb 			printf("Illegal response: \"%s\".  "
     99   1.7    simonb 			    "Use '?' to get list of valid answers\n", buf);
    100   1.1       cgd 	}
    101   1.1       cgd }
    102   1.1       cgd 
    103   1.6  christos static int
    104  1.19  dholland comp(const char *s1)
    105   1.6  christos {
    106   1.8       jsm 	const char *sp, *tsp;
    107   1.8       jsm 	char c;
    108   1.1       cgd 
    109   1.1       cgd 	if (buf[0] != '\0')
    110   1.1       cgd 		for (sp = buf, tsp = s1; *sp; ) {
    111  1.13       dsl 			c = tolower((unsigned char)*tsp);
    112   1.1       cgd 			tsp++;
    113   1.1       cgd 			if (c != *sp++)
    114   1.1       cgd 				return 0;
    115   1.1       cgd 		}
    116   1.1       cgd 	else if (*s1 != '\0')
    117   1.1       cgd 		return 0;
    118   1.1       cgd 	return 1;
    119   1.1       cgd }
    120