GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: usr.bin/tee/tee.c Lines: 30 43 69.8 %
Date: 2017-11-13 Branches: 19 29 65.5 %

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