getcom.c revision 1.10 1 1.10 jsm /* $NetBSD: getcom.c,v 1.10 2000/09/24 15:51:40 jsm 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.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.4 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.3 cgd #if 0
39 1.3 cgd static char sccsid[] = "@(#)getcom.c 8.1 (Berkeley) 5/31/93";
40 1.3 cgd #else
41 1.10 jsm __RCSID("$NetBSD: getcom.c,v 1.10 2000/09/24 15:51:40 jsm Exp $");
42 1.3 cgd #endif
43 1.5 lukem #endif /* not lint */
44 1.1 cgd
45 1.4 lukem #include "extern.h"
46 1.1 cgd
47 1.5 lukem char *
48 1.1 cgd getcom(buf, size, prompt, error)
49 1.5 lukem char *buf;
50 1.5 lukem int size;
51 1.6 hubertf const char *prompt, *error;
52 1.1 cgd {
53 1.1 cgd for (;;) {
54 1.5 lukem fputs(prompt, stdout);
55 1.1 cgd if (fgets(buf, size, stdin) == 0) {
56 1.8 jsm if (feof(stdin))
57 1.8 jsm die();
58 1.1 cgd clearerr(stdin);
59 1.1 cgd continue;
60 1.1 cgd }
61 1.1 cgd while (isspace(*buf))
62 1.1 cgd buf++;
63 1.1 cgd if (*buf)
64 1.1 cgd break;
65 1.1 cgd if (error)
66 1.1 cgd puts(error);
67 1.10 jsm }
68 1.10 jsm /* If we didn't get to the end of the line, don't read it in next time. */
69 1.10 jsm if (buf[strlen(buf) - 1] != '\n') {
70 1.10 jsm int i;
71 1.10 jsm while ((i = getchar()) != '\n' && i != EOF)
72 1.10 jsm continue;
73 1.1 cgd }
74 1.1 cgd return (buf);
75 1.1 cgd }
76 1.1 cgd
77 1.1 cgd
78 1.1 cgd /*
79 1.1 cgd * shifts to UPPERCASE if flag > 0, lowercase if flag < 0,
80 1.1 cgd * and leaves it unchanged if flag = 0
81 1.1 cgd */
82 1.5 lukem char *
83 1.1 cgd getword(buf1, buf2, flag)
84 1.5 lukem char *buf1, *buf2;
85 1.5 lukem int flag;
86 1.1 cgd {
87 1.9 jsm int cnt;
88 1.9 jsm
89 1.9 jsm cnt = 1;
90 1.1 cgd while (isspace(*buf1))
91 1.1 cgd buf1++;
92 1.1 cgd if (*buf1 != ',') {
93 1.1 cgd if (!*buf1) {
94 1.1 cgd *buf2 = 0;
95 1.1 cgd return (0);
96 1.1 cgd }
97 1.9 jsm while (cnt < WORDLEN && *buf1 && !isspace(*buf1) && *buf1 != ',')
98 1.7 jsm if (flag < 0) {
99 1.9 jsm if (isupper(*buf1)) {
100 1.1 cgd *buf2++ = tolower(*buf1++);
101 1.9 jsm cnt++;
102 1.9 jsm } else {
103 1.1 cgd *buf2++ = *buf1++;
104 1.9 jsm cnt++;
105 1.9 jsm }
106 1.7 jsm } else if (flag > 0) {
107 1.9 jsm if (islower(*buf1)) {
108 1.7 jsm *buf2++ = toupper(*buf1++);
109 1.9 jsm cnt++;
110 1.9 jsm } else {
111 1.1 cgd *buf2++ = *buf1++;
112 1.9 jsm cnt++;
113 1.9 jsm }
114 1.9 jsm } else {
115 1.7 jsm *buf2++ = *buf1++;
116 1.9 jsm cnt++;
117 1.9 jsm }
118 1.9 jsm if (cnt == WORDLEN)
119 1.9 jsm while (*buf1 && !isspace(*buf1))
120 1.9 jsm buf1++;
121 1.1 cgd } else
122 1.1 cgd *buf2++ = *buf1++;
123 1.9 jsm *buf2 = '\0';
124 1.1 cgd while (isspace(*buf1))
125 1.1 cgd buf1++;
126 1.9 jsm return (*buf1 ? buf1 : NULL);
127 1.1 cgd }
128