usr.bin/tee/tee.c

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