2 * Copyright (c) 1980, 1987, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 static char copyright[] =
36 "@(#) Copyright (c) 1980, 1987, 1991, 1993\n\
37 The Regents of the University of California. All rights reserved.\n";
41 static char sccsid[] = "@(#)wc.c 8.1 (Berkeley) 6/6/93";
44 #include <sys/param.h>
54 u_long tlinect, twordct, tcharct;
55 int doline, doword, dochar;
57 void cnt __P((char *));
58 void err __P((const char *, ...));
59 void usage __P((void));
69 while ((ch = getopt(argc, argv, "lwc")) != EOF)
87 /* Wc's flags are on by default. */
88 if (doline + doword + dochar == 0)
89 doline = doword = dochar = 1;
98 (void)printf(" %s\n", *argv);
104 (void)printf(" %7ld", tlinect);
106 (void)printf(" %7ld", twordct);
108 (void)printf(" %7ld", tcharct);
109 (void)printf(" total\n");
119 register short gotsp;
120 register int ch, len;
121 register u_long linect, wordct, charct;
124 u_char buf[MAXBSIZE];
127 linect = wordct = charct = 0;
129 if ((fd = open(file, O_RDONLY, 0)) < 0)
130 err("%s: %s", file, strerror(errno));
134 * Line counting is split out because it's a lot faster to get
135 * lines than to get words, since the word count requires some
139 while (len = read(fd, buf, MAXBSIZE)) {
141 err("%s: %s", file, strerror(errno));
143 for (p = buf; len--; ++p)
148 (void)printf(" %7lu", linect);
151 (void)printf(" %7lu", charct);
157 * If all we need is the number of characters and it's a
158 * regular or linked file, just stat the puppy.
162 err("%s: %s", file, strerror(errno));
163 if (S_ISREG(sb.st_mode) || S_ISLNK(sb.st_mode)) {
164 (void)printf(" %7qu", sb.st_size);
165 tcharct += sb.st_size;
172 /* Do it the hard way... */
173 word: for (gotsp = 1; len = read(fd, buf, MAXBSIZE);) {
175 err("%s: %s", file, strerror(errno));
177 * This loses in the presence of multi-byte characters.
178 * To do it right would require a function to return a
179 * character while knowing how many bytes it consumed.
182 for (p = buf; len--;) {
196 (void)printf(" %7lu", linect);
200 (void)printf(" %7lu", wordct);
204 (void)printf(" %7lu", charct);
212 (void)fprintf(stderr, "usage: wc [-clw] [files]\n");
224 err(const char *fmt, ...)
237 (void)fprintf(stderr, "wc: ");
238 (void)vfprintf(stderr, fmt, ap);
240 (void)fprintf(stderr, "\n");