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