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