]>
Commit | Line | Data |
---|---|---|
44bd5ea7 A |
1 | /* $NetBSD: tee.c,v 1.6 1997/10/20 00:37:11 lukem Exp $ */ |
2 | ||
3 | /* | |
4 | * Copyright (c) 1988, 1993 | |
5 | * The Regents of the University of California. All rights reserved. | |
6 | * | |
7 | * Redistribution and use in source and binary forms, with or without | |
8 | * modification, are permitted provided that the following conditions | |
9 | * are met: | |
10 | * 1. Redistributions of source code must retain the above copyright | |
11 | * notice, this list of conditions and the following disclaimer. | |
12 | * 2. Redistributions in binary form must reproduce the above copyright | |
13 | * notice, this list of conditions and the following disclaimer in the | |
14 | * documentation and/or other materials provided with the distribution. | |
15 | * 3. All advertising materials mentioning features or use of this software | |
16 | * must display the following acknowledgement: | |
17 | * This product includes software developed by the University of | |
18 | * California, Berkeley and its contributors. | |
19 | * 4. Neither the name of the University nor the names of its contributors | |
20 | * may be used to endorse or promote products derived from this software | |
21 | * without specific prior written permission. | |
22 | * | |
23 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
24 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
25 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
26 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
27 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
28 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
29 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
30 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
31 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
32 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
33 | * SUCH DAMAGE. | |
34 | */ | |
35 | ||
36 | #include <sys/cdefs.h> | |
37 | #ifndef lint | |
38 | __COPYRIGHT("@(#) Copyright (c) 1988, 1993\n\ | |
39 | The Regents of the University of California. All rights reserved.\n"); | |
40 | #endif /* not lint */ | |
41 | ||
42 | #ifndef lint | |
43 | #if 0 | |
44 | static char sccsid[] = "@(#)tee.c 8.1 (Berkeley) 6/6/93"; | |
45 | #endif | |
46 | __RCSID("$NetBSD: tee.c,v 1.6 1997/10/20 00:37:11 lukem Exp $"); | |
47 | #endif | |
48 | ||
49 | #include <sys/types.h> | |
50 | #include <sys/stat.h> | |
51 | #include <signal.h> | |
52 | #include <errno.h> | |
53 | #include <fcntl.h> | |
54 | #include <unistd.h> | |
55 | #include <stdio.h> | |
56 | #include <stdlib.h> | |
57 | #include <string.h> | |
58 | #include <locale.h> | |
59 | #include <err.h> | |
60 | ||
61 | typedef struct _list { | |
62 | struct _list *next; | |
63 | int fd; | |
64 | char *name; | |
65 | } LIST; | |
66 | LIST *head; | |
67 | ||
68 | void add __P((int, char *)); | |
69 | int main __P((int, char **)); | |
70 | ||
71 | int | |
72 | main(argc, argv) | |
73 | int argc; | |
74 | char *argv[]; | |
75 | { | |
76 | LIST *p; | |
77 | int n, fd, rval, wval; | |
78 | char *bp; | |
79 | int append, ch, exitval; | |
80 | char *buf; | |
81 | #define BSIZE (8 * 1024) | |
82 | ||
83 | setlocale(LC_ALL, ""); | |
84 | ||
85 | append = 0; | |
86 | while ((ch = getopt(argc, argv, "ai")) != -1) | |
87 | switch((char)ch) { | |
88 | case 'a': | |
89 | append = 1; | |
90 | break; | |
91 | case 'i': | |
92 | (void)signal(SIGINT, SIG_IGN); | |
93 | break; | |
94 | case '?': | |
95 | default: | |
96 | (void)fprintf(stderr, "usage: tee [-ai] [file ...]\n"); | |
97 | exit(1); | |
98 | } | |
99 | argv += optind; | |
100 | argc -= optind; | |
101 | ||
102 | if ((buf = malloc((size_t)BSIZE)) == NULL) | |
103 | err(1, "malloc"); | |
104 | ||
105 | add(STDOUT_FILENO, "stdout"); | |
106 | ||
107 | for (exitval = 0; *argv; ++argv) | |
108 | if ((fd = open(*argv, append ? O_WRONLY|O_CREAT|O_APPEND : | |
109 | O_WRONLY|O_CREAT|O_TRUNC, DEFFILEMODE)) < 0) { | |
110 | warn("%s", *argv); | |
111 | exitval = 1; | |
112 | } else | |
113 | add(fd, *argv); | |
114 | ||
115 | while ((rval = read(STDIN_FILENO, buf, BSIZE)) > 0) | |
116 | for (p = head; p; p = p->next) { | |
117 | n = rval; | |
118 | bp = buf; | |
119 | do { | |
120 | if ((wval = write(p->fd, bp, n)) == -1) { | |
121 | warn("%s", p->name); | |
122 | exitval = 1; | |
123 | break; | |
124 | } | |
125 | bp += wval; | |
126 | } while (n -= wval); | |
127 | } | |
128 | if (rval < 0) { | |
129 | warn("read"); | |
130 | exitval = 1; | |
131 | } | |
132 | ||
133 | for (p = head; p; p = p->next) { | |
134 | if (close(p->fd) == -1) { | |
135 | warn("%s", p->name); | |
136 | exitval = 1; | |
137 | } | |
138 | } | |
139 | ||
140 | exit(exitval); | |
141 | } | |
142 | ||
143 | void | |
144 | add(fd, name) | |
145 | int fd; | |
146 | char *name; | |
147 | { | |
148 | LIST *p; | |
149 | ||
150 | if ((p = malloc((size_t)sizeof(LIST))) == NULL) | |
151 | err(1, "malloc"); | |
152 | p->fd = fd; | |
153 | p->name = name; | |
154 | p->next = head; | |
155 | head = p; | |
156 | } |