Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libc/stdio/fvwrite.c	Lines:	58	81	71.6 %
Date:	2017-11-07	Branches:	44	67	65.7 %


/*	$OpenBSD: fvwrite.c,v 1.20 2017/03/17 16:06:33 millert Exp $ */
/*-
 * Copyright (c) 1990, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Chris Torek.
 *
 * 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.
 * 3. 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.
 */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <unistd.h>
#include "local.h"
#include "fvwrite.h"

/*
 * Write some memory regions.  Return zero on success, EOF on error.
 *
 * This routine is large and unsightly, but most of the ugliness due
 * to the three different kinds of output buffering is handled here.
 */
int
__sfvwrite(FILE *fp, struct __suio *uio)
{
	size_t len;
	char *p;
	struct __siov *iov;
	int w, s;
	char *nl;
	int nlknown, nldist;

	if ((len = uio->uio_resid) == 0)
		return (0);
	/* make sure we can write */
	if (cantwrite(fp)) {
		errno = EBADF;
		return (EOF);
	}

#define	MIN(a, b) ((a) < (b) ? (a) : (b))
#define	COPY(n)	  (void)memcpy(fp->_p, p, n)

	iov = uio->uio_iov;
	p = iov->iov_base;
	len = iov->iov_len;
	iov++;
#define GETIOV(extra_work) \
	while (len == 0) { \
		extra_work; \
		p = iov->iov_base; \
		len = iov->iov_len; \
		iov++; \
	}
	if (fp->_flags & __SNBF) {
		/*
		 * Unbuffered: write up to BUFSIZ bytes at a time.
		 */
		do {
			GETIOV(;);
			w = (*fp->_write)(fp->_cookie, p, MIN(len, BUFSIZ));
			if (w <= 0)
				goto err;
			p += w;
			len -= w;
		} while ((uio->uio_resid -= w) != 0);
	} else if ((fp->_flags & __SLBF) == 0) {
		/*
		 * Fully buffered: fill partially full buffer, if any,
		 * and then flush.  If there is no partial buffer, write
		 * one _bf._size byte chunk directly (without copying).
		 *
		 * String output is a special case: write as many bytes
		 * as fit, but pretend we wrote everything.  This makes
		 * snprintf() return the number of bytes needed, rather
		 * than the number used, and avoids its write function
		 * (so that the write function can be invalid).
		 */
		do {
			GETIOV(;);
			if ((fp->_flags & (__SALC | __SSTR)) ==
			    (__SALC | __SSTR) && fp->_w < len) {
				size_t blen = fp->_p - fp->_bf._base;
				int pgmsk = getpagesize() - 1;
				unsigned char *_base;
				int _size;

				/* Round up to nearest page. */
				_size = ((blen + len + 1 + pgmsk) & ~pgmsk) - 1;
				_base = recallocarray(fp->_bf._base,
				    fp->_bf._size + 1, _size + 1, 1);
				if (_base == NULL)
					goto err;
				fp->_w += _size - fp->_bf._size;
				fp->_bf._base = _base;
				fp->_bf._size = _size;
				fp->_p = _base + blen;
			}
			w = fp->_w;
			if (fp->_flags & __SSTR) {
				if (len < w)
					w = len;
				COPY(w);	/* copy MIN(fp->_w,len), */
				fp->_w -= w;
				fp->_p += w;
				w = len;	/* but pretend copied all */
			} else if (fp->_p > fp->_bf._base && len > w) {
				/* fill and flush */
				COPY(w);
				/* fp->_w -= w; */ /* unneeded */
				fp->_p += w;
				if (__sflush(fp))
					goto err;
			} else if (len >= (w = fp->_bf._size)) {
				/* write directly */
				w = (*fp->_write)(fp->_cookie, p, w);
				if (w <= 0)
					goto err;
			} else {
				/* fill and done */
				w = len;
				COPY(w);
				fp->_w -= w;
				fp->_p += w;
			}
			p += w;
			len -= w;
		} while ((uio->uio_resid -= w) != 0);
	} else {
		/*
		 * Line buffered: like fully buffered, but we
		 * must check for newlines.  Compute the distance
		 * to the first newline (including the newline),
		 * or `infinity' if there is none, then pretend
		 * that the amount to write is MIN(len,nldist).
		 */
		nlknown = 0;
		nldist = 0;	/* XXX just to keep gcc happy */
		do {
			GETIOV(nlknown = 0);
			if (!nlknown) {
				nl = memchr(p, '\n', len);
				nldist = nl ? nl + 1 - p : len + 1;
				nlknown = 1;
			}
			s = MIN(len, nldist);
			w = fp->_w + fp->_bf._size;
			if (fp->_p > fp->_bf._base && s > w) {
				COPY(w);
				/* fp->_w -= w; */
				fp->_p += w;
				if (__sflush(fp))
					goto err;
			} else if (s >= (w = fp->_bf._size)) {
				w = (*fp->_write)(fp->_cookie, p, w);
				if (w <= 0)
				 	goto err;
			} else {
				w = s;
				COPY(w);
				fp->_w -= w;
				fp->_p += w;
			}
			if ((nldist -= w) == 0) {
				/* copied the newline: flush and forget */
				if (__sflush(fp))
					goto err;
				nlknown = 0;
			}
			p += w;
			len -= w;
		} while ((uio->uio_resid -= w) != 0);
	}
	return (0);

err:
	fp->_flags |= __SERR;
	return (EOF);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: fvwrite.c,v 1.20 2017/03/17 16:06:33 millert Exp $ */
2			/*-
3			* Copyright (c) 1990, 1993
4			* The Regents of the University of California. All rights reserved.
5			*
6			* This code is derived from software contributed to Berkeley by
7			* Chris Torek.
8			*
9			* Redistribution and use in source and binary forms, with or without
10			* modification, are permitted provided that the following conditions
11			* are met:
12			* 1. Redistributions of source code must retain the above copyright
13			* notice, this list of conditions and the following disclaimer.
14			* 2. Redistributions in binary form must reproduce the above copyright
15			* notice, this list of conditions and the following disclaimer in the
16			* documentation and/or other materials provided with the distribution.
17			* 3. Neither the name of the University nor the names of its contributors
18			* may be used to endorse or promote products derived from this software
19			* without specific prior written permission.
20			*
21			* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22			* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23			* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24			* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25			* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26			* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27			* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28			* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29			* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30			* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31			* SUCH DAMAGE.
32			*/
33
34			#include <stdio.h>
35			#include <stdlib.h>
36			#include <string.h>
37			#include <errno.h>
38			#include <unistd.h>
39			#include "local.h"
40			#include "fvwrite.h"
41
42			/*
43			* Write some memory regions. Return zero on success, EOF on error.
44			*
45			* This routine is large and unsightly, but most of the ugliness due
46			* to the three different kinds of output buffering is handled here.
47			*/
48			int
49			__sfvwrite(FILE fp, struct __suio uio)
50			{
51			size_t len;
52			char *p;
53			struct __siov *iov;
54			int w, s;
55			char *nl;
56			int nlknown, nldist;
57
58	✗✓	212961898	if ((len = uio->uio_resid) == 0)
59			return (0);
60			/* make sure we can write */
61	✓✓✓✓ ✗✓	212966421	if (cantwrite(fp)) {
62			errno = EBADF;
63			return (EOF);
64			}
65
66			#define MIN(a, b) ((a) < (b) ? (a) : (b))
67			#define COPY(n) (void)memcpy(fp->_p, p, n)
68
69		106480949	iov = uio->uio_iov;
70		106480949	p = iov->iov_base;
71		106480949	len = iov->iov_len;
72		106480949	iov++;
73			#define GETIOV(extra_work) \
74			while (len == 0) { \
75			extra_work; \
76			p = iov->iov_base; \
77			len = iov->iov_len; \
78			iov++; \
79			}
80	✓✓	106480949	if (fp->_flags & __SNBF) {
81			/*
82			* Unbuffered: write up to BUFSIZ bytes at a time.
83			*/
84			do {
85	✗✓	56	GETIOV(;);
86		28	w = (*fp->_write)(fp->_cookie, p, MIN(len, BUFSIZ));
87	✓✗	28	if (w <= 0)
88			goto err;
89		28	p += w;
90		28	len -= w;
91	✗✓	28	} while ((uio->uio_resid -= w) != 0);
92	✓✓	106480921	} else if ((fp->_flags & __SLBF) == 0) {
93			/*
94			* Fully buffered: fill partially full buffer, if any,
95			* and then flush. If there is no partial buffer, write
96			* one _bf._size byte chunk directly (without copying).
97			*
98			* String output is a special case: write as many bytes
99			* as fit, but pretend we wrote everything. This makes
100			* snprintf() return the number of bytes needed, rather
101			* than the number used, and avoids its write function
102			* (so that the write function can be invalid).
103			*/
104			do {
105	✓✓	315439202	GETIOV(;);
106	✗✓	131988104	if ((fp->_flags & (__SALC \| __SSTR)) ==
107	✓✓	131988104	(__SALC \| __SSTR) && fp->_w < len) {
108			size_t blen = fp->_p - fp->_bf._base;
109			int pgmsk = getpagesize() - 1;
110			unsigned char *_base;
111			int _size;
112
113			/* Round up to nearest page. */
114			_size = ((blen + len + 1 + pgmsk) & ~pgmsk) - 1;
115			_base = recallocarray(fp->_bf._base,
116			fp->_bf._size + 1, _size + 1, 1);
117			if (_base == NULL)
118			goto err;
119			fp->_w += _size - fp->_bf._size;
120			fp->_bf._base = _base;
121			fp->_bf._size = _size;
122			fp->_p = _base + blen;
123			}
124		131988088	w = fp->_w;
125	✓✓	131988088	if (fp->_flags & __SSTR) {
126	✓✓	1813063	if (len < w)
127		1812600	w = len;
128		1813063	COPY(w); /* copy MIN(fp->_w,len), */
129		1813063	fp->_w -= w;
130		1813063	fp->_p += w;
131		1813063	w = len; /* but pretend copied all */
132	✓✓✓✓	262135509	} else if (fp->_p > fp->_bf._base && len > w) {
133			/* fill and flush */
134		19892	COPY(w);
135			/* fp->_w -= w; / / unneeded */
136		19892	fp->_p += w;
137	✓✗	19892	if (__sflush(fp))
138			goto err;
139	✗✓	130155133	} else if (len >= (w = fp->_bf._size)) {
140			/* write directly */
141			w = (*fp->_write)(fp->_cookie, p, w);
142			if (w <= 0)
143			goto err;
144			} else {
145			/* fill and done */
146		130155133	w = len;
147		130155133	COPY(w);
148		130155133	fp->_w -= w;
149		130155133	fp->_p += w;
150			}
151		131988088	p += w;
152		131988088	len -= w;
153	✓✓	131988088	} while ((uio->uio_resid -= w) != 0);
154			} else {
155			/*
156			* Line buffered: like fully buffered, but we
157			* must check for newlines. Compute the distance
158			* to the first newline (including the newline),
159			* or `infinity' if there is none, then pretend
160			* that the amount to write is MIN(len,nldist).
161			*/
162			nlknown = 0;
163			nldist = 0; /* XXX just to keep gcc happy */
164		244238	do {
165	✓✓	547164	GETIOV(nlknown = 0);
166	✓✗	258910	if (!nlknown) {
167		258910	nl = memchr(p, '\n', len);
168	✓✓	776730	nldist = nl ? nl + 1 - p : len + 1;
169			nlknown = 1;
170		258910	}
171		258910	s = MIN(len, nldist);
172		258910	w = fp->_w + fp->_bf._size;
173	✓✓✗✓	511640	if (fp->_p > fp->_bf._base && s > w) {
174			COPY(w);
175			/* fp->_w -= w; */
176			fp->_p += w;
177			if (__sflush(fp))
178			goto err;
179	✗✓	258910	} else if (s >= (w = fp->_bf._size)) {
180			w = (*fp->_write)(fp->_cookie, p, w);
181			if (w <= 0)
182			goto err;
183			} else {
184			w = s;
185		258910	COPY(w);
186		258910	fp->_w -= w;
187		258910	fp->_p += w;
188			}
189	✓✓	258910	if ((nldist -= w) == 0) {
190			/* copied the newline: flush and forget */
191	✓✗	27	if (__sflush(fp))
192			goto err;
193			nlknown = 0;
194		27	}
195		258910	p += w;
196		258910	len -= w;
197	✓✓	258910	} while ((uio->uio_resid -= w) != 0);
198			}
199		106480949	return (0);
200
201			err:
202			fp->_flags \|= __SERR;
203			return (EOF);
204		106480949	}