pig.c revision 1.8 1 1.8 jsm /* $NetBSD: pig.c,v 1.8 1999/09/18 19:38:53 jsm Exp $ */
2 1.2 cgd
3 1.1 cgd /*-
4 1.1 cgd * Copyright (c) 1992, 1993
5 1.1 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.5 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.5 lukem __COPYRIGHT("@(#) Copyright (c) 1992, 1993\n\
39 1.5 lukem The Regents of the University of California. All rights reserved.\n");
40 1.1 cgd #endif /* not lint */
41 1.1 cgd
42 1.1 cgd #ifndef lint
43 1.2 cgd #if 0
44 1.4 tls static char sccsid[] = "@(#)pig.c 8.2 (Berkeley) 5/4/95";
45 1.2 cgd #else
46 1.8 jsm __RCSID("$NetBSD: pig.c,v 1.8 1999/09/18 19:38:53 jsm Exp $");
47 1.2 cgd #endif
48 1.1 cgd #endif /* not lint */
49 1.1 cgd
50 1.1 cgd #include <sys/types.h>
51 1.1 cgd
52 1.1 cgd #include <ctype.h>
53 1.6 lukem #include <err.h>
54 1.1 cgd #include <stdio.h>
55 1.1 cgd #include <stdlib.h>
56 1.1 cgd #include <string.h>
57 1.4 tls #include <unistd.h>
58 1.1 cgd
59 1.5 lukem int main __P((int, char *[]));
60 1.1 cgd void pigout __P((char *, int));
61 1.7 hubertf void usage __P((void)) __attribute__((__noreturn__));
62 1.1 cgd
63 1.1 cgd int
64 1.1 cgd main(argc, argv)
65 1.1 cgd int argc;
66 1.1 cgd char *argv[];
67 1.1 cgd {
68 1.5 lukem int len;
69 1.1 cgd int ch;
70 1.1 cgd char buf[1024];
71 1.1 cgd
72 1.5 lukem while ((ch = getopt(argc, argv, "")) != -1)
73 1.1 cgd switch(ch) {
74 1.1 cgd case '?':
75 1.1 cgd default:
76 1.1 cgd usage();
77 1.1 cgd }
78 1.1 cgd argc -= optind;
79 1.1 cgd argv += optind;
80 1.1 cgd
81 1.1 cgd for (len = 0; (ch = getchar()) != EOF;) {
82 1.1 cgd if (isalpha(ch)) {
83 1.8 jsm if ((size_t)len >= sizeof(buf))
84 1.6 lukem errx(1, "ate too much!");
85 1.1 cgd buf[len++] = ch;
86 1.1 cgd continue;
87 1.1 cgd }
88 1.1 cgd if (len != 0) {
89 1.1 cgd pigout(buf, len);
90 1.1 cgd len = 0;
91 1.1 cgd }
92 1.1 cgd (void)putchar(ch);
93 1.1 cgd }
94 1.1 cgd exit(0);
95 1.1 cgd }
96 1.1 cgd
97 1.1 cgd void
98 1.1 cgd pigout(buf, len)
99 1.1 cgd char *buf;
100 1.1 cgd int len;
101 1.1 cgd {
102 1.5 lukem int ch, start, i;
103 1.3 cgd int olen, allupper, firstupper;
104 1.3 cgd
105 1.3 cgd /* See if the word is all upper case */
106 1.3 cgd allupper = firstupper = isupper(buf[0]);
107 1.3 cgd for (i = 1; i < len && allupper; i++)
108 1.3 cgd allupper = allupper && isupper(buf[i]);
109 1.1 cgd
110 1.1 cgd /*
111 1.1 cgd * If the word starts with a vowel, append "way". Don't treat 'y'
112 1.1 cgd * as a vowel if it appears first.
113 1.1 cgd */
114 1.6 lukem if (strchr("aeiouAEIOU", buf[0]) != NULL) {
115 1.3 cgd (void)printf("%.*s%s", len, buf,
116 1.3 cgd allupper ? "WAY" : "way");
117 1.1 cgd return;
118 1.1 cgd }
119 1.1 cgd
120 1.1 cgd /*
121 1.1 cgd * Copy leading consonants to the end of the word. The unit "qu"
122 1.1 cgd * isn't treated as a vowel.
123 1.1 cgd */
124 1.3 cgd if (!allupper)
125 1.3 cgd buf[0] = tolower(buf[0]);
126 1.1 cgd for (start = 0, olen = len;
127 1.6 lukem !strchr("aeiouyAEIOUY", buf[start]) && start < olen;) {
128 1.1 cgd ch = buf[len++] = buf[start++];
129 1.1 cgd if ((ch == 'q' || ch == 'Q') && start < olen &&
130 1.1 cgd (buf[start] == 'u' || buf[start] == 'U'))
131 1.1 cgd buf[len++] = buf[start++];
132 1.1 cgd }
133 1.3 cgd if (firstupper)
134 1.3 cgd buf[start] = toupper(buf[start]);
135 1.3 cgd (void)printf("%.*s%s", olen, buf + start, allupper ? "AY" : "ay");
136 1.1 cgd }
137 1.1 cgd
138 1.1 cgd void
139 1.1 cgd usage()
140 1.1 cgd {
141 1.1 cgd (void)fprintf(stderr, "usage: pig\n");
142 1.1 cgd exit(1);
143 1.1 cgd }
144