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