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