1 .\" $NetBSD: fgets.3,v 1.22 2010/05/13 18:38:24 jruoho Exp $
3 .\" Copyright (c) 1990, 1991, 1993
4 .\" The Regents of the University of California. All rights reserved.
6 .\" This code is derived from software contributed to Berkeley by
7 .\" Chris Torek and the American National Standards Committee X3,
8 .\" on Information Processing Systems.
10 .\" Redistribution and use in source and binary forms, with or without
11 .\" modification, are permitted provided that the following conditions
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. Neither the name of the University nor the names of its contributors
19 .\" may be used to endorse or promote products derived from this software
20 .\" without specific prior written permission.
22 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 .\" @(#)fgets.3 8.1 (Berkeley) 6/4/93
42 .Nd get a line from a stream
48 .Fn fgets "char * restrict str" "int size" "FILE * restrict stream"
55 reads at most one less than the number of characters specified by
59 and stores them in the string
61 Reading stops when a newline character is found,
62 at end-of-file or error.
63 The newline, if any, is retained, and a
65 character is appended to end the string.
78 except that the newline character (if any) is not stored in the string.
79 It is the caller's responsibility to ensure that the input line,
80 if any, is sufficiently short to fit in the string.
82 Upon successful completion,
87 a pointer to the string.
88 If end-of-file or an error occurs before any characters are read,
96 do not distinguish between end-of-file and error, and callers must use
100 to determine which occurred.
106 is not a readable stream.
111 may also fail and set
113 for any of the errors specified for the routines
122 may also fail and set
124 for any of the errors specified for the routine
145 The following bit of code illustrates a case where the programmer assumes a
146 string is too long if it does not contain a newline:
150 while (fgets(buf, sizeof(buf), fp) != NULL) {
151 if ((p = strchr(buf, '\en')) == NULL) {
152 fprintf(stderr, "input line too long.\en");
156 printf("%s\en", buf);
160 While the error would be true if a line longer than 1023 characters
161 were read, it would be false in two other cases:
162 .Bl -enum -offset indent
164 If the last line in a file does not contain a newline, the string returned by
166 will not contain a newline either.
171 and the program will terminate, even if the line was valid.
173 All C string functions, including
175 correctly assume the end of the string is represented by a null
178 If the first character of a line returned by
182 would immediately return without considering the rest of the returned text
183 which may indeed include a newline.
188 instead when dealing with untrusted input.
189 .Sh SECURITY CONSIDERATIONS
190 Since it is usually impossible to ensure that the next input line
191 is less than some arbitrary length, and because overflowing the
192 input buffer is almost invariably a security violation, programs
200 exists purely to conform to