Subversion Repositories shark

Rev

Rev 2 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 pj 1
/*-
2
 * Copyright (c) 1990, 1993
3
 *      The Regents of the University of California.  All rights reserved.
4
 *
5
 * This code is derived from software contributed to Berkeley by
6
 * Chris Torek.
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. All advertising materials mentioning features or use of this software
17
 *    must display the following acknowledgement:
18
 *      This product includes software developed by the University of
19
 *      California, Berkeley and its contributors.
20
 * 4. Neither the name of the University nor the names of its contributors
21
 *    may be used to endorse or promote products derived from this software
22
 *    without specific prior written permission.
23
 *
24
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34
 * SUCH DAMAGE.
35
 */
36
 
37
#if defined(LIBC_SCCS) && !defined(lint)
38
#if 0
39
static char sccsid[] = "@(#)wbuf.c      8.1 (Berkeley) 6/4/93";
40
#endif
41
static const char rcsid[] =
42
                "$\Id: wbuf.c,v 1.3 1996/06/22 10:34:13 jraynard Exp $";
43
#endif /* LIBC_SCCS and not lint */
44
 
45
#include <stdio.h>
46
#include "local.h"
47
 
48
/*
49
 * Write the given character into the (probably full) buffer for
50
 * the given file.  Flush the buffer out if it is or becomes full,
51
 * or if c=='\n' and the file is line buffered.
52
 */
53
int
54
__swbuf(c, fp)
55
        register int c;
56
        register FILE *fp;
57
{
58
        register int n;
59
 
60
        /*
61
         * In case we cannot write, or longjmp takes us out early,
62
         * make sure _w is 0 (if fully- or un-buffered) or -_bf._size
63
         * (if line buffered) so that we will get called again.
64
         * If we did not do this, a sufficient number of putc()
65
         * calls might wrap _w from negative to positive.
66
         */
67
        fp->_w = fp->_lbfsize;
68
        if (cantwrite(fp))
69
                return (EOF);
70
        c = (unsigned char)c;
71
 
72
        /*
73
         * If it is completely full, flush it out.  Then, in any case,
74
         * stuff c into the buffer.  If this causes the buffer to fill
75
         * completely, or if c is '\n' and the file is line buffered,
76
         * flush it (perhaps a second time).  The second flush will always
77
         * happen on unbuffered streams, where _bf._size==1; fflush()
78
         * guarantees that putc() will always call wbuf() by setting _w
79
         * to 0, so we need not do anything else.
80
         */
81
        n = fp->_p - fp->_bf._base;
82
        if (n >= fp->_bf._size) {
83
                if (fflush(fp))
84
                        return (EOF);
85
                n = 0;
86
        }
87
        fp->_w--;
88
        *fp->_p++ = c;
89
        if (++n == fp->_bf._size || (fp->_flags & __SLBF && c == '\n'))
90
                if (fflush(fp))
91
                        return (EOF);
92
        return (c);
93
}