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