xref: /freebsd/usr.bin/tee/tee.c (revision 6ff6d951ade3f3379932df7f878ef3ea272cfc59)
1 /*
2  * Copyright (c) 1988, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
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.
20  *
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.
32  */
33 
34 #ifndef lint
35 static const char copyright[] =
36 "@(#) Copyright (c) 1988, 1993\n\
37 	The Regents of the University of California.  All rights reserved.\n";
38 #endif /* not lint */
39 
40 #ifndef lint
41 #if 0
42 static char sccsid[] = "@(#)tee.c	8.1 (Berkeley) 6/6/93";
43 #endif
44 static const char rcsid[] =
45   "$FreeBSD$";
46 #endif /* not lint */
47 
48 #include <sys/types.h>
49 #include <sys/stat.h>
50 #include <err.h>
51 #include <fcntl.h>
52 #include <signal.h>
53 #include <stdio.h>
54 #include <stdlib.h>
55 #include <string.h>
56 #include <unistd.h>
57 
58 typedef struct _list {
59 	struct _list *next;
60 	int fd;
61 	const char *name;
62 } LIST;
63 LIST *head;
64 
65 void add(int, const char *);
66 static void usage(void);
67 
68 int
69 main(int argc, char *argv[])
70 {
71 	LIST *p;
72 	int n, fd, rval, wval;
73 	char *bp;
74 	int append, ch, exitval;
75 	char *buf;
76 #define	BSIZE (8 * 1024)
77 
78 	append = 0;
79 	while ((ch = getopt(argc, argv, "ai")) != -1)
80 		switch((char)ch) {
81 		case 'a':
82 			append = 1;
83 			break;
84 		case 'i':
85 			(void)signal(SIGINT, SIG_IGN);
86 			break;
87 		case '?':
88 		default:
89 			usage();
90 		}
91 	argv += optind;
92 	argc -= optind;
93 
94 	if ((buf = malloc(BSIZE)) == NULL)
95 		err(1, "malloc");
96 
97 	add(STDOUT_FILENO, "stdout");
98 
99 	for (exitval = 0; *argv; ++argv)
100 		if ((fd = open(*argv, append ? O_WRONLY|O_CREAT|O_APPEND :
101 		    O_WRONLY|O_CREAT|O_TRUNC, DEFFILEMODE)) < 0) {
102 			warn("%s", *argv);
103 			exitval = 1;
104 		} else
105 			add(fd, *argv);
106 
107 	while ((rval = read(STDIN_FILENO, buf, BSIZE)) > 0)
108 		for (p = head; p; p = p->next) {
109 			n = rval;
110 			bp = buf;
111 			do {
112 				if ((wval = write(p->fd, bp, n)) == -1) {
113 					warn("%s", p->name);
114 					exitval = 1;
115 					break;
116 				}
117 				bp += wval;
118 			} while (n -= wval);
119 		}
120 	if (rval < 0)
121 		err(1, "read");
122 	exit(exitval);
123 }
124 
125 static void
126 usage(void)
127 {
128 	(void)fprintf(stderr, "usage: tee [-ai] [file ...]\n");
129 	exit(1);
130 }
131 
132 void
133 add(int fd, const char *name)
134 {
135 	LIST *p;
136 
137 	if ((p = malloc(sizeof(LIST))) == NULL)
138 		err(1, "malloc");
139 	p->fd = fd;
140 	p->name = name;
141 	p->next = head;
142 	head = p;
143 }
144