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