ungetc.c revision 1.7 1 1.7 perry /* $NetBSD: ungetc.c,v 1.7 1998/02/03 18:41:22 perry 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.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.6 christos #include <sys/cdefs.h>
40 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
41 1.4 jtc #if 0
42 1.4 jtc static char sccsid[] = "@(#)ungetc.c 8.2 (Berkeley) 11/3/93";
43 1.6 christos #else
44 1.7 perry __RCSID("$NetBSD: ungetc.c,v 1.7 1998/02/03 18:41:22 perry Exp $");
45 1.4 jtc #endif
46 1.1 cgd #endif /* LIBC_SCCS and not lint */
47 1.1 cgd
48 1.1 cgd #include <stdio.h>
49 1.1 cgd #include <stdlib.h>
50 1.1 cgd #include <string.h>
51 1.1 cgd #include "local.h"
52 1.1 cgd
53 1.6 christos static int __submore __P((FILE *));
54 1.1 cgd /*
55 1.1 cgd * Expand the ungetc buffer `in place'. That is, adjust fp->_p when
56 1.1 cgd * the buffer moves, so that it points the same distance from the end,
57 1.1 cgd * and move the bytes in the buffer around as necessary so that they
58 1.1 cgd * are all at the end (stack-style).
59 1.1 cgd */
60 1.5 jtc static int
61 1.1 cgd __submore(fp)
62 1.7 perry FILE *fp;
63 1.1 cgd {
64 1.7 perry int i;
65 1.7 perry unsigned char *p;
66 1.1 cgd
67 1.1 cgd if (fp->_ub._base == fp->_ubuf) {
68 1.1 cgd /*
69 1.1 cgd * Get a new buffer (rather than expanding the old one).
70 1.1 cgd */
71 1.1 cgd if ((p = malloc((size_t)BUFSIZ)) == NULL)
72 1.1 cgd return (EOF);
73 1.1 cgd fp->_ub._base = p;
74 1.1 cgd fp->_ub._size = BUFSIZ;
75 1.1 cgd p += BUFSIZ - sizeof(fp->_ubuf);
76 1.1 cgd for (i = sizeof(fp->_ubuf); --i >= 0;)
77 1.1 cgd p[i] = fp->_ubuf[i];
78 1.1 cgd fp->_p = p;
79 1.1 cgd return (0);
80 1.1 cgd }
81 1.1 cgd i = fp->_ub._size;
82 1.1 cgd p = realloc(fp->_ub._base, i << 1);
83 1.1 cgd if (p == NULL)
84 1.1 cgd return (EOF);
85 1.4 jtc /* no overlap (hence can use memcpy) because we doubled the size */
86 1.4 jtc (void)memcpy((void *)(p + i), (void *)p, (size_t)i);
87 1.1 cgd fp->_p = p + i;
88 1.1 cgd fp->_ub._base = p;
89 1.1 cgd fp->_ub._size = i << 1;
90 1.1 cgd return (0);
91 1.1 cgd }
92 1.1 cgd
93 1.5 jtc int
94 1.1 cgd ungetc(c, fp)
95 1.1 cgd int c;
96 1.7 perry FILE *fp;
97 1.1 cgd {
98 1.1 cgd if (c == EOF)
99 1.1 cgd return (EOF);
100 1.1 cgd if (!__sdidinit)
101 1.1 cgd __sinit();
102 1.1 cgd if ((fp->_flags & __SRD) == 0) {
103 1.1 cgd /*
104 1.1 cgd * Not already reading: no good unless reading-and-writing.
105 1.1 cgd * Otherwise, flush any current write stuff.
106 1.1 cgd */
107 1.1 cgd if ((fp->_flags & __SRW) == 0)
108 1.1 cgd return (EOF);
109 1.1 cgd if (fp->_flags & __SWR) {
110 1.1 cgd if (__sflush(fp))
111 1.1 cgd return (EOF);
112 1.1 cgd fp->_flags &= ~__SWR;
113 1.1 cgd fp->_w = 0;
114 1.1 cgd fp->_lbfsize = 0;
115 1.1 cgd }
116 1.1 cgd fp->_flags |= __SRD;
117 1.1 cgd }
118 1.1 cgd c = (unsigned char)c;
119 1.1 cgd
120 1.1 cgd /*
121 1.1 cgd * If we are in the middle of ungetc'ing, just continue.
122 1.1 cgd * This may require expanding the current ungetc buffer.
123 1.1 cgd */
124 1.1 cgd if (HASUB(fp)) {
125 1.1 cgd if (fp->_r >= fp->_ub._size && __submore(fp))
126 1.1 cgd return (EOF);
127 1.1 cgd *--fp->_p = c;
128 1.1 cgd fp->_r++;
129 1.1 cgd return (c);
130 1.1 cgd }
131 1.4 jtc fp->_flags &= ~__SEOF;
132 1.1 cgd
133 1.1 cgd /*
134 1.1 cgd * If we can handle this by simply backing up, do so,
135 1.1 cgd * but never replace the original character.
136 1.1 cgd * (This makes sscanf() work when scanning `const' data.)
137 1.1 cgd */
138 1.1 cgd if (fp->_bf._base != NULL && fp->_p > fp->_bf._base &&
139 1.1 cgd fp->_p[-1] == c) {
140 1.1 cgd fp->_p--;
141 1.1 cgd fp->_r++;
142 1.1 cgd return (c);
143 1.1 cgd }
144 1.1 cgd
145 1.1 cgd /*
146 1.1 cgd * Create an ungetc buffer.
147 1.1 cgd * Initially, we will use the `reserve' buffer.
148 1.1 cgd */
149 1.1 cgd fp->_ur = fp->_r;
150 1.1 cgd fp->_up = fp->_p;
151 1.1 cgd fp->_ub._base = fp->_ubuf;
152 1.1 cgd fp->_ub._size = sizeof(fp->_ubuf);
153 1.1 cgd fp->_ubuf[sizeof(fp->_ubuf) - 1] = c;
154 1.1 cgd fp->_p = &fp->_ubuf[sizeof(fp->_ubuf) - 1];
155 1.1 cgd fp->_r = 1;
156 1.1 cgd return (c);
157 1.1 cgd }
158