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