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