getinp.c 3.3 KB

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