fgetln.c revision 1.2 1 1.2 jtc /* $NetBSD: fgetln.c,v 1.2 1995/02/02 02:09:10 jtc Exp $ */
2 1.2 jtc
3 1.1 cgd /*-
4 1.1 cgd * Copyright (c) 1990, 1993
5 1.1 cgd * 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.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
40 1.1 cgd /* from: static char sccsid[] = "@(#)fgetline.c 8.1 (Berkeley) 6/4/93"; */
41 1.2 jtc static char *rcsid = "$Id: fgetln.c,v 1.2 1995/02/02 02:09:10 jtc Exp $";
42 1.1 cgd #endif /* LIBC_SCCS and not lint */
43 1.1 cgd
44 1.1 cgd #include <stdio.h>
45 1.1 cgd #include <stdlib.h>
46 1.1 cgd #include <string.h>
47 1.1 cgd #include "local.h"
48 1.1 cgd
49 1.1 cgd /*
50 1.1 cgd * Expand the line buffer. Return -1 on error.
51 1.1 cgd #ifdef notdef
52 1.1 cgd * The `new size' does not account for a terminating '\0',
53 1.1 cgd * so we add 1 here.
54 1.1 cgd #endif
55 1.1 cgd */
56 1.1 cgd int
57 1.1 cgd __slbexpand(fp, newsize)
58 1.1 cgd FILE *fp;
59 1.1 cgd size_t newsize;
60 1.1 cgd {
61 1.1 cgd void *p;
62 1.1 cgd
63 1.1 cgd #ifdef notdef
64 1.1 cgd ++newsize;
65 1.1 cgd #endif
66 1.1 cgd if (fp->_lb._size >= newsize)
67 1.1 cgd return (0);
68 1.1 cgd if ((p = realloc(fp->_lb._base, newsize)) == NULL)
69 1.1 cgd return (-1);
70 1.1 cgd fp->_lb._base = p;
71 1.1 cgd fp->_lb._size = newsize;
72 1.1 cgd return (0);
73 1.1 cgd }
74 1.1 cgd
75 1.1 cgd /*
76 1.1 cgd * Get an input line. The returned pointer often (but not always)
77 1.1 cgd * points into a stdio buffer. Fgetline does not alter the text of
78 1.1 cgd * the returned line (which is thus not a C string because it will
79 1.1 cgd * not necessarily end with '\0'), but does allow callers to modify
80 1.1 cgd * it if they wish. Thus, we set __SMOD in case the caller does.
81 1.1 cgd */
82 1.1 cgd char *
83 1.1 cgd fgetln(fp, lenp)
84 1.1 cgd register FILE *fp;
85 1.1 cgd size_t *lenp;
86 1.1 cgd {
87 1.1 cgd register unsigned char *p;
88 1.1 cgd register size_t len;
89 1.1 cgd size_t off;
90 1.1 cgd
91 1.1 cgd /* make sure there is input */
92 1.1 cgd if (fp->_r <= 0 && __srefill(fp)) {
93 1.1 cgd *lenp = 0;
94 1.1 cgd return (NULL);
95 1.1 cgd }
96 1.1 cgd
97 1.1 cgd /* look for a newline in the input */
98 1.1 cgd if ((p = memchr((void *)fp->_p, '\n', fp->_r)) != NULL) {
99 1.1 cgd register char *ret;
100 1.1 cgd
101 1.1 cgd /*
102 1.1 cgd * Found one. Flag buffer as modified to keep fseek from
103 1.1 cgd * `optimising' a backward seek, in case the user stomps on
104 1.1 cgd * the text.
105 1.1 cgd */
106 1.1 cgd p++; /* advance over it */
107 1.1 cgd ret = (char *)fp->_p;
108 1.1 cgd *lenp = len = p - fp->_p;
109 1.1 cgd fp->_flags |= __SMOD;
110 1.1 cgd fp->_r -= len;
111 1.1 cgd fp->_p = p;
112 1.1 cgd return (ret);
113 1.1 cgd }
114 1.1 cgd
115 1.1 cgd /*
116 1.1 cgd * We have to copy the current buffered data to the line buffer.
117 1.1 cgd * As a bonus, though, we can leave off the __SMOD.
118 1.1 cgd *
119 1.1 cgd * OPTIMISTIC is length that we (optimistically) expect will
120 1.1 cgd * accomodate the `rest' of the string, on each trip through the
121 1.1 cgd * loop below.
122 1.1 cgd */
123 1.1 cgd #define OPTIMISTIC 80
124 1.1 cgd
125 1.1 cgd for (len = fp->_r, off = 0;; len += fp->_r) {
126 1.1 cgd register size_t diff;
127 1.1 cgd
128 1.1 cgd /*
129 1.1 cgd * Make sure there is room for more bytes. Copy data from
130 1.1 cgd * file buffer to line buffer, refill file and look for
131 1.1 cgd * newline. The loop stops only when we find a newline.
132 1.1 cgd */
133 1.1 cgd if (__slbexpand(fp, len + OPTIMISTIC))
134 1.1 cgd goto error;
135 1.1 cgd (void)memcpy((void *)(fp->_lb._base + off), (void *)fp->_p,
136 1.1 cgd len - off);
137 1.1 cgd off = len;
138 1.1 cgd if (__srefill(fp))
139 1.1 cgd break; /* EOF or error: return partial line */
140 1.1 cgd if ((p = memchr((void *)fp->_p, '\n', fp->_r)) == NULL)
141 1.1 cgd continue;
142 1.1 cgd
143 1.1 cgd /* got it: finish up the line (like code above) */
144 1.1 cgd p++;
145 1.1 cgd diff = p - fp->_p;
146 1.1 cgd len += diff;
147 1.1 cgd if (__slbexpand(fp, len))
148 1.1 cgd goto error;
149 1.1 cgd (void)memcpy((void *)(fp->_lb._base + off), (void *)fp->_p,
150 1.1 cgd diff);
151 1.1 cgd fp->_r -= diff;
152 1.1 cgd fp->_p = p;
153 1.1 cgd break;
154 1.1 cgd }
155 1.1 cgd *lenp = len;
156 1.1 cgd #ifdef notdef
157 1.1 cgd fp->_lb._base[len] = 0;
158 1.1 cgd #endif
159 1.1 cgd return ((char *)fp->_lb._base);
160 1.1 cgd
161 1.1 cgd error:
162 1.1 cgd *lenp = 0; /* ??? */
163 1.1 cgd return (NULL); /* ??? */
164 1.1 cgd }
165