mandoc(1): Update to 1.9.13.
[dragonfly.git] / usr.bin / tee / tee.c
blob1bdd2a99d5003dfc0afa83bbcbf1dba209f69530
1 /*
2 * Copyright (c) 1988, 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
7 * are met:
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
31 * SUCH DAMAGE.
33 * @(#) Copyright (c) 1988, 1993 The Regents of the University of California. All rights reserved.
34 * @(#)tee.c 8.1 (Berkeley) 6/6/93
35 * $FreeBSD: src/usr.bin/tee/tee.c,v 1.4 1999/08/28 01:06:21 peter Exp $
36 * $DragonFly: src/usr.bin/tee/tee.c,v 1.5 2005/02/18 16:33:53 liamfoy Exp $
39 #include <sys/types.h>
40 #include <sys/queue.h>
41 #include <sys/stat.h>
43 #include <err.h>
44 #include <fcntl.h>
45 #include <signal.h>
46 #include <stdio.h>
47 #include <stdlib.h>
48 #include <unistd.h>
50 struct desc_list {
51 SLIST_ENTRY(desc_list) link;
52 int fd;
53 const char *name;
55 SLIST_HEAD(, desc_list) desc_head;
57 static void add(int, const char *);
58 static void usage(void);
60 int
61 main(int argc, char **argv)
63 struct desc_list *p;
64 int n, fd, rval, wval, flags;
65 char *bp, *buf;
66 int append, ch, exitval;
67 #define BSIZE (8 * 1024)
69 append = 0;
70 while ((ch = getopt(argc, argv, "ai")) != -1)
71 switch(ch) {
72 case 'a':
73 append = 1;
74 break;
75 case 'i':
76 if (signal(SIGINT, SIG_IGN) == SIG_ERR)
77 err(1, "signal");
78 break;
79 default:
80 usage();
82 argv += optind;
83 argc -= optind;
85 if ((buf = malloc(BSIZE)) == NULL)
86 err(1, "malloc failed");
88 add(STDOUT_FILENO, "stdout");
90 if (append)
91 flags = O_WRONLY|O_CREAT|O_APPEND;
92 else
93 flags = O_WRONLY|O_CREAT|O_TRUNC;
95 for (exitval = 0; *argv != NULL; ++argv) {
96 if ((fd = open(*argv, flags, DEFFILEMODE)) < 0) {
97 warn("open failed: %s", *argv);
98 exitval = 1;
99 } else {
100 add(fd, *argv);
104 while ((rval = read(STDIN_FILENO, buf, BSIZE)) > 0) {
105 SLIST_FOREACH(p, &desc_head, link) {
106 n = rval;
107 bp = buf;
108 do {
109 if ((wval = write(p->fd, bp, n)) == -1) {
110 warn("write failed: %s", p->name);
111 exitval = 1;
112 break;
114 bp += wval;
115 } while (n -= wval);
118 if (rval < 0)
119 err(1, "read failed");
120 exit(exitval);
123 static void
124 usage(void)
126 fprintf(stderr, "usage: tee [-ai] [file ...]\n");
127 exit(1);
130 static void
131 add(int fd, const char *name)
133 struct desc_list *p;
135 p = malloc(sizeof(struct desc_list));
136 if (p == NULL)
137 err(1, "malloc failed");
138 p->fd = fd;
139 p->name = name;
140 SLIST_INSERT_HEAD(&desc_head, p, link);