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