xref: /netbsd-src/usr.bin/tee/tee.c (revision ae9172d6cd9432a6a1a56760d86b32c57a66c39c)
1 /*	$NetBSD: tee.c,v 1.5 1994/12/09 01:43:39 jtc Exp $	*/
2 
3 /*
4  * Copyright (c) 1988, 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) 1988, 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[] = "@(#)tee.c	8.1 (Berkeley) 6/6/93";
45 #endif
46 static char rcsid[] = "$NetBSD: tee.c,v 1.5 1994/12/09 01:43:39 jtc Exp $";
47 #endif
48 
49 #include <sys/types.h>
50 #include <sys/stat.h>
51 #include <signal.h>
52 #include <errno.h>
53 #include <fcntl.h>
54 #include <unistd.h>
55 #include <stdio.h>
56 #include <stdlib.h>
57 #include <string.h>
58 #include <locale.h>
59 #include <err.h>
60 
61 typedef struct _list {
62 	struct _list *next;
63 	int fd;
64 	char *name;
65 } LIST;
66 LIST *head;
67 
68 void add __P((int, char *));
69 
70 int
71 main(argc, argv)
72 	int argc;
73 	char *argv[];
74 {
75 	register LIST *p;
76 	register int n, fd, rval, wval;
77 	register char *bp;
78 	int append, ch, exitval;
79 	char *buf;
80 #define	BSIZE (8 * 1024)
81 
82 	setlocale(LC_ALL, "");
83 
84 	append = 0;
85 	while ((ch = getopt(argc, argv, "ai")) != -1)
86 		switch((char)ch) {
87 		case 'a':
88 			append = 1;
89 			break;
90 		case 'i':
91 			(void)signal(SIGINT, SIG_IGN);
92 			break;
93 		case '?':
94 		default:
95 			(void)fprintf(stderr, "usage: tee [-ai] [file ...]\n");
96 			exit(1);
97 		}
98 	argv += optind;
99 	argc -= optind;
100 
101 	if ((buf = malloc((size_t)BSIZE)) == NULL)
102 		err(1, NULL);
103 
104 	add(STDOUT_FILENO, "stdout");
105 
106 	for (exitval = 0; *argv; ++argv)
107 		if ((fd = open(*argv, append ? O_WRONLY|O_CREAT|O_APPEND :
108 		    O_WRONLY|O_CREAT|O_TRUNC, DEFFILEMODE)) < 0) {
109 			warn("%s", *argv);
110 			exitval = 1;
111 		} else
112 			add(fd, *argv);
113 
114 	while ((rval = read(STDIN_FILENO, buf, BSIZE)) > 0)
115 		for (p = head; p; p = p->next) {
116 			n = rval;
117 			bp = buf;
118 			do {
119 				if ((wval = write(p->fd, bp, n)) == -1) {
120 					warn("%s", p->name);
121 					exitval = 1;
122 					break;
123 				}
124 				bp += wval;
125 			} while (n -= wval);
126 		}
127 	if (rval < 0) {
128 		warn("read");
129 		exitval = 1;
130 	}
131 
132 	for (p = head; p; p = p->next) {
133 		if (close(p->fd) == -1) {
134 			warn("%s", p->name);
135 			exitval = 1;
136 		}
137 	}
138 
139 	exit(exitval);
140 }
141 
142 void
143 add(fd, name)
144 	int fd;
145 	char *name;
146 {
147 	LIST *p;
148 
149 	if ((p = malloc((size_t)sizeof(LIST))) == NULL)
150 		err(1, NULL);
151 	p->fd = fd;
152 	p->name = name;
153 	p->next = head;
154 	head = p;
155 }
156