getcom.c revision 1.11 1 1.11 agc /* $NetBSD: getcom.c,v 1.11 2003/08/07 09:37:02 agc Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1983, 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.4 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.3 cgd #if 0
35 1.3 cgd static char sccsid[] = "@(#)getcom.c 8.1 (Berkeley) 5/31/93";
36 1.3 cgd #else
37 1.11 agc __RCSID("$NetBSD: getcom.c,v 1.11 2003/08/07 09:37:02 agc Exp $");
38 1.3 cgd #endif
39 1.5 lukem #endif /* not lint */
40 1.1 cgd
41 1.4 lukem #include "extern.h"
42 1.1 cgd
43 1.5 lukem char *
44 1.1 cgd getcom(buf, size, prompt, error)
45 1.5 lukem char *buf;
46 1.5 lukem int size;
47 1.6 hubertf const char *prompt, *error;
48 1.1 cgd {
49 1.1 cgd for (;;) {
50 1.5 lukem fputs(prompt, stdout);
51 1.1 cgd if (fgets(buf, size, stdin) == 0) {
52 1.8 jsm if (feof(stdin))
53 1.8 jsm die();
54 1.1 cgd clearerr(stdin);
55 1.1 cgd continue;
56 1.1 cgd }
57 1.1 cgd while (isspace(*buf))
58 1.1 cgd buf++;
59 1.1 cgd if (*buf)
60 1.1 cgd break;
61 1.1 cgd if (error)
62 1.1 cgd puts(error);
63 1.10 jsm }
64 1.10 jsm /* If we didn't get to the end of the line, don't read it in next time. */
65 1.10 jsm if (buf[strlen(buf) - 1] != '\n') {
66 1.10 jsm int i;
67 1.10 jsm while ((i = getchar()) != '\n' && i != EOF)
68 1.10 jsm continue;
69 1.1 cgd }
70 1.1 cgd return (buf);
71 1.1 cgd }
72 1.1 cgd
73 1.1 cgd
74 1.1 cgd /*
75 1.1 cgd * shifts to UPPERCASE if flag > 0, lowercase if flag < 0,
76 1.1 cgd * and leaves it unchanged if flag = 0
77 1.1 cgd */
78 1.5 lukem char *
79 1.1 cgd getword(buf1, buf2, flag)
80 1.5 lukem char *buf1, *buf2;
81 1.5 lukem int flag;
82 1.1 cgd {
83 1.9 jsm int cnt;
84 1.9 jsm
85 1.9 jsm cnt = 1;
86 1.1 cgd while (isspace(*buf1))
87 1.1 cgd buf1++;
88 1.1 cgd if (*buf1 != ',') {
89 1.1 cgd if (!*buf1) {
90 1.1 cgd *buf2 = 0;
91 1.1 cgd return (0);
92 1.1 cgd }
93 1.9 jsm while (cnt < WORDLEN && *buf1 && !isspace(*buf1) && *buf1 != ',')
94 1.7 jsm if (flag < 0) {
95 1.9 jsm if (isupper(*buf1)) {
96 1.1 cgd *buf2++ = tolower(*buf1++);
97 1.9 jsm cnt++;
98 1.9 jsm } else {
99 1.1 cgd *buf2++ = *buf1++;
100 1.9 jsm cnt++;
101 1.9 jsm }
102 1.7 jsm } else if (flag > 0) {
103 1.9 jsm if (islower(*buf1)) {
104 1.7 jsm *buf2++ = toupper(*buf1++);
105 1.9 jsm cnt++;
106 1.9 jsm } else {
107 1.1 cgd *buf2++ = *buf1++;
108 1.9 jsm cnt++;
109 1.9 jsm }
110 1.9 jsm } else {
111 1.7 jsm *buf2++ = *buf1++;
112 1.9 jsm cnt++;
113 1.9 jsm }
114 1.9 jsm if (cnt == WORDLEN)
115 1.9 jsm while (*buf1 && !isspace(*buf1))
116 1.9 jsm buf1++;
117 1.1 cgd } else
118 1.1 cgd *buf2++ = *buf1++;
119 1.9 jsm *buf2 = '\0';
120 1.1 cgd while (isspace(*buf1))
121 1.1 cgd buf1++;
122 1.9 jsm return (*buf1 ? buf1 : NULL);
123 1.1 cgd }
124