wc.c revision 1.33 1 1.33 tron /* $NetBSD: wc.c,v 1.33 2010/02/18 10:43:50 tron Exp $ */
2 1.10 tls
3 1.1 cgd /*
4 1.11 mrg * Copyright (c) 1980, 1987, 1991, 1993
5 1.11 mrg * 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.29 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.13 mrg #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.31 lukem __COPYRIGHT("@(#) Copyright (c) 1980, 1987, 1991, 1993\
35 1.31 lukem The Regents of the University of California. All rights reserved.");
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd #ifndef lint
39 1.11 mrg #if 0
40 1.11 mrg static char sccsid[] = "@(#)wc.c 8.2 (Berkeley) 5/2/95";
41 1.11 mrg #else
42 1.33 tron __RCSID("$NetBSD: wc.c,v 1.33 2010/02/18 10:43:50 tron Exp $");
43 1.11 mrg #endif
44 1.1 cgd #endif /* not lint */
45 1.1 cgd
46 1.33 tron /* wc line, word, char count and optionally longest line. */
47 1.1 cgd
48 1.11 mrg #include <sys/param.h>
49 1.22 enami #include <sys/file.h>
50 1.11 mrg #include <sys/stat.h>
51 1.11 mrg
52 1.22 enami #include <ctype.h>
53 1.11 mrg #include <fcntl.h>
54 1.22 enami #include <err.h>
55 1.11 mrg #include <errno.h>
56 1.22 enami #include <locale.h>
57 1.33 tron #include <stdbool.h>
58 1.1 cgd #include <stdio.h>
59 1.2 jtc #include <stdlib.h>
60 1.2 jtc #include <string.h>
61 1.5 jtc #include <unistd.h>
62 1.21 yamt #include <wchar.h>
63 1.21 yamt #include <wctype.h>
64 1.1 cgd
65 1.17 christos #ifdef NO_QUAD
66 1.17 christos typedef u_long wc_count_t;
67 1.18 mycroft # define WCFMT " %7lu"
68 1.17 christos # define WCCAST unsigned long
69 1.17 christos #else
70 1.17 christos typedef u_quad_t wc_count_t;
71 1.18 mycroft # define WCFMT " %7llu"
72 1.17 christos # define WCCAST unsigned long long
73 1.17 christos #endif
74 1.17 christos
75 1.33 tron static wc_count_t tlinect, twordct, tcharct, tlongest;
76 1.33 tron static bool doline, doword, dobyte, dochar, dolongest;
77 1.14 wsanchez static int rval = 0;
78 1.1 cgd
79 1.32 lukem static void cnt(const char *);
80 1.33 tron static void print_counts(wc_count_t, wc_count_t, wc_count_t, wc_count_t,
81 1.33 tron const char *);
82 1.30 perry static void usage(void);
83 1.30 perry static size_t do_mb(wchar_t *, const char *, size_t, mbstate_t *,
84 1.30 perry size_t *, const char *);
85 1.30 perry int main(int, char *[]);
86 1.11 mrg
87 1.5 jtc int
88 1.30 perry main(int argc, char *argv[])
89 1.1 cgd {
90 1.13 mrg int ch;
91 1.1 cgd
92 1.7 jtc setlocale(LC_ALL, "");
93 1.7 jtc
94 1.33 tron while ((ch = getopt(argc, argv, "lwcmL")) != -1)
95 1.24 enami switch (ch) {
96 1.2 jtc case 'l':
97 1.33 tron doline = true;
98 1.2 jtc break;
99 1.2 jtc case 'w':
100 1.33 tron doword = true;
101 1.2 jtc break;
102 1.4 jtc case 'm':
103 1.33 tron dochar = true;
104 1.21 yamt dobyte = 0;
105 1.21 yamt break;
106 1.21 yamt case 'c':
107 1.21 yamt dochar = 0;
108 1.33 tron dobyte = true;
109 1.33 tron break;
110 1.33 tron case 'L':
111 1.33 tron dolongest = true;
112 1.2 jtc break;
113 1.2 jtc case '?':
114 1.2 jtc default:
115 1.11 mrg usage();
116 1.2 jtc }
117 1.2 jtc argv += optind;
118 1.2 jtc argc -= optind;
119 1.2 jtc
120 1.11 mrg /* Wc's flags are on by default. */
121 1.33 tron if (!(doline || doword || dobyte || dochar || dolongest))
122 1.33 tron doline = doword = dobyte = true;
123 1.1 cgd
124 1.33 tron if (*argv == NULL) {
125 1.11 mrg cnt(NULL);
126 1.2 jtc } else {
127 1.33 tron bool dototal = (argc > 1);
128 1.2 jtc
129 1.2 jtc do {
130 1.2 jtc cnt(*argv);
131 1.2 jtc } while(*++argv);
132 1.2 jtc
133 1.33 tron if (dototal) {
134 1.33 tron print_counts(tlinect, twordct, tcharct, tlongest,
135 1.33 tron "total");
136 1.33 tron }
137 1.1 cgd }
138 1.2 jtc
139 1.6 jtc exit(rval);
140 1.1 cgd }
141 1.1 cgd
142 1.21 yamt static size_t
143 1.32 lukem do_mb(wchar_t *wc, const char *p, size_t len, mbstate_t *st,
144 1.32 lukem size_t *retcnt, const char *file)
145 1.21 yamt {
146 1.21 yamt size_t r;
147 1.21 yamt size_t c = 0;
148 1.21 yamt
149 1.21 yamt do {
150 1.32 lukem r = mbrtowc(wc, p, len, st);
151 1.21 yamt if (r == (size_t)-1) {
152 1.21 yamt warnx("%s: invalid byte sequence", file);
153 1.21 yamt rval = 1;
154 1.21 yamt
155 1.21 yamt /* XXX skip 1 byte */
156 1.32 lukem len--;
157 1.23 enami p++;
158 1.21 yamt memset(st, 0, sizeof(*st));
159 1.26 enami continue;
160 1.23 enami } else if (r == (size_t)-2)
161 1.21 yamt break;
162 1.21 yamt else if (r == 0)
163 1.21 yamt r = 1;
164 1.23 enami c++;
165 1.21 yamt if (wc)
166 1.23 enami wc++;
167 1.32 lukem len -= r;
168 1.21 yamt p += r;
169 1.32 lukem } while (len > 0);
170 1.21 yamt
171 1.32 lukem *retcnt = c;
172 1.21 yamt
173 1.24 enami return (r);
174 1.21 yamt }
175 1.23 enami
176 1.5 jtc static void
177 1.32 lukem cnt(const char *file)
178 1.1 cgd {
179 1.24 enami u_char buf[MAXBSIZE];
180 1.24 enami wchar_t wbuf[MAXBSIZE];
181 1.24 enami struct stat sb;
182 1.33 tron wc_count_t charct, linect, wordct, longest;
183 1.24 enami mbstate_t st;
184 1.13 mrg u_char *C;
185 1.21 yamt wchar_t *WC;
186 1.32 lukem const char *name; /* filename or <stdin> */
187 1.21 yamt size_t r = 0;
188 1.24 enami int fd, gotsp, len = 0;
189 1.1 cgd
190 1.33 tron linect = wordct = charct = longest = 0;
191 1.33 tron if (file != NULL) {
192 1.1 cgd if ((fd = open(file, O_RDONLY, 0)) < 0) {
193 1.11 mrg warn("%s", file);
194 1.6 jtc rval = 1;
195 1.6 jtc return;
196 1.1 cgd }
197 1.27 enami name = file;
198 1.23 enami } else {
199 1.7 jtc fd = STDIN_FILENO;
200 1.27 enami name = "<stdin>";
201 1.7 jtc }
202 1.21 yamt
203 1.21 yamt if (dochar || doword)
204 1.21 yamt memset(&st, 0, sizeof(st));
205 1.23 enami
206 1.7 jtc if (!doword) {
207 1.7 jtc /*
208 1.7 jtc * line counting is split out because it's a lot
209 1.7 jtc * faster to get lines than to get words, since
210 1.7 jtc * the word count requires some logic.
211 1.7 jtc */
212 1.33 tron if (doline || dochar || dolongest) {
213 1.33 tron wc_count_t llen = 0;
214 1.11 mrg while ((len = read(fd, buf, MAXBSIZE)) > 0) {
215 1.21 yamt if (dochar) {
216 1.21 yamt size_t wlen;
217 1.21 yamt
218 1.23 enami r = do_mb(0, (char *)buf, (size_t)len,
219 1.27 enami &st, &wlen, name);
220 1.21 yamt charct += wlen;
221 1.23 enami } else if (dobyte)
222 1.21 yamt charct += len;
223 1.33 tron if (doline || dolongest) {
224 1.33 tron for (C = buf; len--; ++C) {
225 1.33 tron if (*C == '\n') {
226 1.21 yamt ++linect;
227 1.33 tron if (llen > longest)
228 1.33 tron longest = llen;
229 1.33 tron llen = 0;
230 1.33 tron } else {
231 1.33 tron llen++;
232 1.33 tron }
233 1.33 tron }
234 1.33 tron }
235 1.1 cgd }
236 1.7 jtc }
237 1.1 cgd
238 1.7 jtc /*
239 1.7 jtc * if all we need is the number of characters and
240 1.7 jtc * it's a directory or a regular or linked file, just
241 1.7 jtc * stat the puppy. We avoid testing for it not being
242 1.7 jtc * a special device in case someone adds a new type
243 1.7 jtc * of inode.
244 1.7 jtc */
245 1.21 yamt else if (dobyte) {
246 1.11 mrg if (fstat(fd, &sb)) {
247 1.27 enami warn("%s", name);
248 1.7 jtc rval = 1;
249 1.7 jtc } else {
250 1.12 mycroft if (S_ISREG(sb.st_mode) ||
251 1.12 mycroft S_ISLNK(sb.st_mode) ||
252 1.12 mycroft S_ISDIR(sb.st_mode)) {
253 1.11 mrg charct = sb.st_size;
254 1.9 andrew } else {
255 1.23 enami while ((len =
256 1.23 enami read(fd, buf, MAXBSIZE)) > 0)
257 1.9 andrew charct += len;
258 1.1 cgd }
259 1.1 cgd }
260 1.1 cgd }
261 1.23 enami } else {
262 1.7 jtc /* do it the hard way... */
263 1.33 tron wc_count_t llen = 0;
264 1.33 tron
265 1.8 jtc gotsp = 1;
266 1.8 jtc while ((len = read(fd, buf, MAXBSIZE)) > 0) {
267 1.21 yamt size_t wlen;
268 1.21 yamt
269 1.23 enami r = do_mb(wbuf, (char *)buf, (size_t)len, &st, &wlen,
270 1.27 enami name);
271 1.21 yamt if (dochar) {
272 1.21 yamt charct += wlen;
273 1.33 tron } else if (dobyte) {
274 1.21 yamt charct += len;
275 1.33 tron }
276 1.21 yamt for (WC = wbuf; wlen--; ++WC) {
277 1.21 yamt if (iswspace(*WC)) {
278 1.7 jtc gotsp = 1;
279 1.21 yamt if (*WC == L'\n') {
280 1.7 jtc ++linect;
281 1.33 tron if (llen > longest)
282 1.33 tron longest = llen;
283 1.33 tron llen = 0;
284 1.33 tron } else {
285 1.33 tron llen++;
286 1.7 jtc }
287 1.7 jtc } else {
288 1.7 jtc /*
289 1.7 jtc * This line implements the POSIX
290 1.7 jtc * spec, i.e. a word is a "maximal
291 1.7 jtc * string of characters delimited by
292 1.7 jtc * whitespace." Notice nothing was
293 1.7 jtc * said about a character being
294 1.7 jtc * printing or non-printing.
295 1.7 jtc */
296 1.7 jtc if (gotsp) {
297 1.7 jtc gotsp = 0;
298 1.7 jtc ++wordct;
299 1.7 jtc }
300 1.33 tron
301 1.33 tron llen++;
302 1.2 jtc }
303 1.1 cgd }
304 1.2 jtc }
305 1.21 yamt }
306 1.21 yamt
307 1.21 yamt if (len == -1) {
308 1.27 enami warn("%s", name);
309 1.21 yamt rval = 1;
310 1.21 yamt }
311 1.21 yamt if (dochar && r == (size_t)-2) {
312 1.27 enami warnx("%s: incomplete multibyte character", name);
313 1.21 yamt rval = 1;
314 1.1 cgd }
315 1.7 jtc
316 1.33 tron print_counts(linect, wordct, charct, longest, file);
317 1.8 jtc
318 1.23 enami /*
319 1.23 enami * don't bother checkint doline, doword, or dobyte --- speeds
320 1.23 enami * up the common case
321 1.23 enami */
322 1.8 jtc tlinect += linect;
323 1.8 jtc twordct += wordct;
324 1.8 jtc tcharct += charct;
325 1.33 tron if (dolongest && longest > tlongest)
326 1.33 tron tlongest = longest;
327 1.8 jtc
328 1.8 jtc if (close(fd)) {
329 1.27 enami warn("%s", name);
330 1.8 jtc rval = 1;
331 1.1 cgd }
332 1.8 jtc }
333 1.8 jtc
334 1.11 mrg static void
335 1.32 lukem print_counts(wc_count_t lines, wc_count_t words, wc_count_t chars,
336 1.33 tron wc_count_t longest, const char *name)
337 1.8 jtc {
338 1.8 jtc
339 1.8 jtc if (doline)
340 1.33 tron (void)printf(WCFMT, (WCCAST)lines);
341 1.8 jtc if (doword)
342 1.33 tron (void)printf(WCFMT, (WCCAST)words);
343 1.21 yamt if (dobyte || dochar)
344 1.33 tron (void)printf(WCFMT, (WCCAST)chars);
345 1.33 tron if (dolongest)
346 1.33 tron (void)printf(WCFMT, (WCCAST)longest);
347 1.7 jtc
348 1.33 tron if (name != NULL)
349 1.33 tron (void)printf(" %s\n", name);
350 1.19 mycroft else
351 1.33 tron (void)putchar('\n');
352 1.11 mrg }
353 1.11 mrg
354 1.11 mrg static void
355 1.30 perry usage(void)
356 1.11 mrg {
357 1.23 enami
358 1.33 tron (void)fprintf(stderr, "usage: wc [-c | -m] [-Llw] [file ...]\n");
359 1.11 mrg exit(1);
360 1.1 cgd }
361