xref: /dragonfly/usr.bin/tee/tee.c (revision 1de703da)
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.2 2003/06/17 04:29:32 dillon 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 __P((int, char *));
57 static void usage __P((void));
58 
59 int
60 main(argc, argv)
61 	int argc;
62 	char *argv[];
63 {
64 	register LIST *p;
65 	register int n, fd, rval, wval;
66 	register char *bp;
67 	int append, ch, exitval;
68 	char *buf;
69 #define	BSIZE (8 * 1024)
70 
71 	append = 0;
72 	while ((ch = getopt(argc, argv, "ai")) != -1)
73 		switch((char)ch) {
74 		case 'a':
75 			append = 1;
76 			break;
77 		case 'i':
78 			(void)signal(SIGINT, SIG_IGN);
79 			break;
80 		case '?':
81 		default:
82 			usage();
83 		}
84 	argv += optind;
85 	argc -= optind;
86 
87 	if ((buf = malloc((u_int)BSIZE)) == NULL)
88 		errx(1, "malloc");
89 
90 	add(STDOUT_FILENO, "stdout");
91 
92 	for (exitval = 0; *argv; ++argv)
93 		if ((fd = open(*argv, append ? O_WRONLY|O_CREAT|O_APPEND :
94 		    O_WRONLY|O_CREAT|O_TRUNC, DEFFILEMODE)) < 0) {
95 			warn("%s", *argv);
96 			exitval = 1;
97 		} else
98 			add(fd, *argv);
99 
100 	while ((rval = read(STDIN_FILENO, buf, BSIZE)) > 0)
101 		for (p = head; p; p = p->next) {
102 			n = rval;
103 			bp = buf;
104 			do {
105 				if ((wval = write(p->fd, bp, n)) == -1) {
106 					warn("%s", p->name);
107 					exitval = 1;
108 					break;
109 				}
110 				bp += wval;
111 			} while (n -= wval);
112 		}
113 	if (rval < 0)
114 		err(1, "read");
115 	exit(exitval);
116 }
117 
118 static void
119 usage()
120 {
121 	(void)fprintf(stderr, "usage: tee [-ai] [file ...]\n");
122 	exit(1);
123 }
124 
125 void
126 add(fd, name)
127 	int fd;
128 	char *name;
129 {
130 	LIST *p;
131 
132 	if ((p = malloc((u_int)sizeof(LIST))) == NULL)
133 		errx(1, "malloc");
134 	p->fd = fd;
135 	p->name = name;
136 	p->next = head;
137 	head = p;
138 }
139