wbuf.c revision 1.13 1 1.13 agc /* $NetBSD: wbuf.c,v 1.13 2003/08/07 16:43:35 agc Exp $ */
2 1.4 jtc
3 1.1 cgd /*-
4 1.4 jtc * Copyright (c) 1990, 1993
5 1.4 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Chris Torek.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.13 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.7 christos #include <sys/cdefs.h>
36 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
37 1.4 jtc #if 0
38 1.4 jtc static char sccsid[] = "@(#)wbuf.c 8.1 (Berkeley) 6/4/93";
39 1.7 christos #else
40 1.13 agc __RCSID("$NetBSD: wbuf.c,v 1.13 2003/08/07 16:43:35 agc Exp $");
41 1.4 jtc #endif
42 1.1 cgd #endif /* LIBC_SCCS and not lint */
43 1.1 cgd
44 1.9 lukem #include <assert.h>
45 1.6 kleink #include <errno.h>
46 1.1 cgd #include <stdio.h>
47 1.12 thorpej #include "reentrant.h"
48 1.1 cgd #include "local.h"
49 1.1 cgd
50 1.1 cgd /*
51 1.1 cgd * Write the given character into the (probably full) buffer for
52 1.1 cgd * the given file. Flush the buffer out if it is or becomes full,
53 1.1 cgd * or if c=='\n' and the file is line buffered.
54 1.1 cgd */
55 1.5 jtc int
56 1.1 cgd __swbuf(c, fp)
57 1.8 perry int c;
58 1.8 perry FILE *fp;
59 1.1 cgd {
60 1.8 perry int n;
61 1.9 lukem
62 1.9 lukem _DIAGASSERT(fp != NULL);
63 1.11 yamt
64 1.11 yamt _SET_ORIENTATION(fp, -1);
65 1.1 cgd
66 1.1 cgd /*
67 1.1 cgd * In case we cannot write, or longjmp takes us out early,
68 1.1 cgd * make sure _w is 0 (if fully- or un-buffered) or -_bf._size
69 1.1 cgd * (if line buffered) so that we will get called again.
70 1.1 cgd * If we did not do this, a sufficient number of putc()
71 1.1 cgd * calls might wrap _w from negative to positive.
72 1.1 cgd */
73 1.1 cgd fp->_w = fp->_lbfsize;
74 1.6 kleink if (cantwrite(fp)) {
75 1.6 kleink errno = EBADF;
76 1.1 cgd return (EOF);
77 1.6 kleink }
78 1.1 cgd c = (unsigned char)c;
79 1.1 cgd
80 1.1 cgd /*
81 1.1 cgd * If it is completely full, flush it out. Then, in any case,
82 1.1 cgd * stuff c into the buffer. If this causes the buffer to fill
83 1.1 cgd * completely, or if c is '\n' and the file is line buffered,
84 1.1 cgd * flush it (perhaps a second time). The second flush will always
85 1.1 cgd * happen on unbuffered streams, where _bf._size==1; fflush()
86 1.1 cgd * guarantees that putc() will always call wbuf() by setting _w
87 1.1 cgd * to 0, so we need not do anything else.
88 1.1 cgd */
89 1.1 cgd n = fp->_p - fp->_bf._base;
90 1.1 cgd if (n >= fp->_bf._size) {
91 1.1 cgd if (fflush(fp))
92 1.1 cgd return (EOF);
93 1.1 cgd n = 0;
94 1.1 cgd }
95 1.1 cgd fp->_w--;
96 1.1 cgd *fp->_p++ = c;
97 1.1 cgd if (++n == fp->_bf._size || (fp->_flags & __SLBF && c == '\n'))
98 1.1 cgd if (fflush(fp))
99 1.1 cgd return (EOF);
100 1.1 cgd return (c);
101 1.1 cgd }
102