freebsd-skq/usr.bin/tee/tee.c

140 lines
3.5 KiB
C
Raw Normal View History

1994-05-27 12:33:43 +00:00
/*
* Copyright (c) 1988, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
static const char copyright[] =
1994-05-27 12:33:43 +00:00
"@(#) Copyright (c) 1988, 1993\n\
The Regents of the University of California. All rights reserved.\n";
#endif /* not lint */
#ifndef lint
#if 0
1994-05-27 12:33:43 +00:00
static char sccsid[] = "@(#)tee.c 8.1 (Berkeley) 6/6/93";
#endif
static const char rcsid[] =
1999-08-28 01:08:13 +00:00
"$FreeBSD$";
1994-05-27 12:33:43 +00:00
#endif /* not lint */
#include <sys/types.h>
#include <sys/stat.h>
#include <err.h>
1994-05-27 12:33:43 +00:00
#include <fcntl.h>
#include <signal.h>
1994-05-27 12:33:43 +00:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
1994-05-27 12:33:43 +00:00
typedef struct _list {
struct _list *next;
int fd;
const char *name;
1994-05-27 12:33:43 +00:00
} LIST;
2011-11-06 08:17:35 +00:00
static LIST *head;
1994-05-27 12:33:43 +00:00
2011-11-06 08:17:35 +00:00
static void add(int, const char *);
2002-03-22 01:42:45 +00:00
static void usage(void);
1994-05-27 12:33:43 +00:00
int
main(int argc, char *argv[])
1994-05-27 12:33:43 +00:00
{
LIST *p;
int n, fd, rval, wval;
char *bp;
1994-05-27 12:33:43 +00:00
int append, ch, exitval;
char *buf;
#define BSIZE (8 * 1024)
append = 0;
while ((ch = getopt(argc, argv, "ai")) != -1)
1994-05-27 12:33:43 +00:00
switch((char)ch) {
case 'a':
append = 1;
break;
case 'i':
(void)signal(SIGINT, SIG_IGN);
break;
case '?':
default:
usage();
1994-05-27 12:33:43 +00:00
}
argv += optind;
argc -= optind;
if ((buf = malloc(BSIZE)) == NULL)
err(1, "malloc");
1994-05-27 12:33:43 +00:00
add(STDOUT_FILENO, "stdout");
for (exitval = 0; *argv; ++argv)
if ((fd = open(*argv, append ? O_WRONLY|O_CREAT|O_APPEND :
O_WRONLY|O_CREAT|O_TRUNC, DEFFILEMODE)) < 0) {
warn("%s", *argv);
1994-05-27 12:33:43 +00:00
exitval = 1;
} else
add(fd, *argv);
while ((rval = read(STDIN_FILENO, buf, BSIZE)) > 0)
for (p = head; p; p = p->next) {
n = rval;
bp = buf;
do {
if ((wval = write(p->fd, bp, n)) == -1) {
warn("%s", p->name);
exitval = 1;
break;
1994-05-27 12:33:43 +00:00
}
bp += wval;
} while (n -= wval);
}
if (rval < 0)
err(1, "read");
exit(exitval);
1994-05-27 12:33:43 +00:00
}
static void
usage(void)
{
(void)fprintf(stderr, "usage: tee [-ai] [file ...]\n");
exit(1);
}
2011-11-06 08:17:35 +00:00
static void
add(int fd, const char *name)
1994-05-27 12:33:43 +00:00
{
LIST *p;
if ((p = malloc(sizeof(LIST))) == NULL)
err(1, "malloc");
1994-05-27 12:33:43 +00:00
p->fd = fd;
p->name = name;
p->next = head;
head = p;
}