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 const char copyright[] =
36 "@(#) Copyright (c) 1980, 1987, 1991, 1993\n\
37 The Regents of the University of California. All rights reserved.\n";
42 static const char sccsid[] = "@(#)wc.c 8.1 (Berkeley) 6/6/93";
44 static const char rcsid[] =
49 #include <sys/param.h>
61 u_quad_t tlinect, twordct, tcharct;
62 int doline, doword, dochar;
64 int cnt __P((char *));
65 void usage __P((void));
72 int ch, errors, total;
74 (void) setlocale(LC_CTYPE, "");
76 while ((ch = getopt(argc, argv, "lwc")) != -1)
94 /* Wc's flags are on by default. */
95 if (doline + doword + dochar == 0)
96 doline = doword = dochar = 1;
101 if (cnt((char *)NULL) != 0)
110 (void)printf(" %s\n", *argv);
116 (void)printf(" %7qu", tlinect);
118 (void)printf(" %7qu", twordct);
120 (void)printf(" %7qu", tcharct);
121 (void)printf(" total\n");
123 exit(errors == 0 ? 0 : 1);
131 u_quad_t linect, wordct, charct;
135 u_char buf[MAXBSIZE], ch;
137 linect = wordct = charct = 0;
142 if ((fd = open(file, O_RDONLY, 0)) < 0) {
143 warn("%s: open", file);
149 * Line counting is split out because it's a lot faster to get
150 * lines than to get words, since the word count requires some
154 while ((len = read(fd, buf, MAXBSIZE))) {
156 warn("%s: read", file);
161 for (p = buf; len--; ++p)
166 (void)printf(" %7qu", linect);
169 (void)printf(" %7qu", charct);
175 * If all we need is the number of characters and it's a
176 * regular or linked file, just stat the puppy.
179 if (fstat(fd, &sb)) {
180 warn("%s: fstat", file);
184 if (S_ISREG(sb.st_mode) || S_ISLNK(sb.st_mode)) {
185 (void)printf(" %7lld", (long long)sb.st_size);
186 tcharct += sb.st_size;
193 /* Do it the hard way... */
194 word: for (gotsp = 1; (len = read(fd, buf, MAXBSIZE));) {
196 warn("%s: read", file);
201 * This loses in the presence of multi-byte characters.
202 * To do it right would require a function to return a
203 * character while knowing how many bytes it consumed.
206 for (p = buf; len--;) {
220 (void)printf(" %7qu", linect);
224 (void)printf(" %7qu", wordct);
228 (void)printf(" %7qu", charct);
237 (void)fprintf(stderr, "usage: wc [-clw] [file ...]\n");