]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - pig/pig.c
fix NetBSD RCS ID headers
[bsdgames-darwin.git] / pig / pig.c
1 /* $NetBSD: pig.c,v 1.3 1996/06/07 19:30:50 cgd Exp $ */
2
3 /*-
4 * Copyright (c) 1992, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 #ifndef lint
37 static char copyright[] =
38 "@(#) Copyright (c) 1992, 1993\n\
39 The Regents of the University of California. All rights reserved.\n";
40 #endif /* not lint */
41
42 #ifndef lint
43 #if 0
44 static char sccsid[] = "@(#)pig.c 8.1 (Berkeley) 5/31/93";
45 #else
46 static char rcsid[] = "$NetBSD: pig.c,v 1.3 1996/06/07 19:30:50 cgd Exp $";
47 #endif
48 #endif /* not lint */
49
50 #include <sys/types.h>
51
52 #include <ctype.h>
53 #include <stdio.h>
54 #include <stdlib.h>
55 #include <string.h>
56
57 void pigout __P((char *, int));
58 void usage __P((void));
59
60 int
61 main(argc, argv)
62 int argc;
63 char *argv[];
64 {
65 register int len;
66 int ch;
67 char buf[1024];
68
69 while ((ch = getopt(argc, argv, "")) != EOF)
70 switch(ch) {
71 case '?':
72 default:
73 usage();
74 }
75 argc -= optind;
76 argv += optind;
77
78 for (len = 0; (ch = getchar()) != EOF;) {
79 if (isalpha(ch)) {
80 if (len >= sizeof(buf)) {
81 (void)fprintf(stderr, "pig: ate too much!\n");
82 exit(1);
83 }
84 buf[len++] = ch;
85 continue;
86 }
87 if (len != 0) {
88 pigout(buf, len);
89 len = 0;
90 }
91 (void)putchar(ch);
92 }
93 exit(0);
94 }
95
96 void
97 pigout(buf, len)
98 char *buf;
99 int len;
100 {
101 register int ch, start, i;
102 int olen, allupper, firstupper;
103
104 /* See if the word is all upper case */
105 allupper = firstupper = isupper(buf[0]);
106 for (i = 1; i < len && allupper; i++)
107 allupper = allupper && isupper(buf[i]);
108
109 /*
110 * If the word starts with a vowel, append "way". Don't treat 'y'
111 * as a vowel if it appears first.
112 */
113 if (index("aeiouAEIOU", buf[0]) != NULL) {
114 (void)printf("%.*s%s", len, buf,
115 allupper ? "WAY" : "way");
116 return;
117 }
118
119 /*
120 * Copy leading consonants to the end of the word. The unit "qu"
121 * isn't treated as a vowel.
122 */
123 if (!allupper)
124 buf[0] = tolower(buf[0]);
125 for (start = 0, olen = len;
126 !index("aeiouyAEIOUY", buf[start]) && start < olen;) {
127 ch = buf[len++] = buf[start++];
128 if ((ch == 'q' || ch == 'Q') && start < olen &&
129 (buf[start] == 'u' || buf[start] == 'U'))
130 buf[len++] = buf[start++];
131 }
132 if (firstupper)
133 buf[start] = toupper(buf[start]);
134 (void)printf("%.*s%s", olen, buf + start, allupper ? "AY" : "ay");
135 }
136
137 void
138 usage()
139 {
140 (void)fprintf(stderr, "usage: pig\n");
141 exit(1);
142 }