/*-1* SPDX-License-Identifier: BSD-3-Clause2*3* Copyright (c) 1990, 19934* The Regents of the University of California. All rights reserved.5*6* This code is derived from software contributed to Berkeley by7* Chris Torek.8*9* Redistribution and use in source and binary forms, with or without10* modification, are permitted provided that the following conditions11* are met:12* 1. Redistributions of source code must retain the above copyright13* notice, this list of conditions and the following disclaimer.14* 2. Redistributions in binary form must reproduce the above copyright15* notice, this list of conditions and the following disclaimer in the16* documentation and/or other materials provided with the distribution.17* 3. Neither the name of the University nor the names of its contributors18* may be used to endorse or promote products derived from this software19* without specific prior written permission.20*21* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND22* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE23* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE24* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE25* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL26* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS27* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)28* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT29* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY30* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF31* SUCH DAMAGE.32*/3334#include "namespace.h"35#include <errno.h>36#include <stdio.h>37#include <string.h>38#include "un-namespace.h"39#include "local.h"40#include "libc_private.h"4142#undef fgets /* _FORTIFY_SOURCE */4344/*45* Read at most n-1 characters from the given file.46* Stop when a newline has been read, or the count runs out.47* Return first argument, or NULL if no characters were read.48*/49char *50fgets(char * __restrict buf, int n, FILE * __restrict fp)51{52size_t len;53char *s, *ret;54unsigned char *p, *t;5556FLOCKFILE_CANCELSAFE(fp);57ORIENT(fp, -1);5859if (n <= 0) { /* sanity check */60fp->_flags |= __SERR;61errno = EINVAL;62ret = NULL;63goto end;64}6566s = buf;67n--; /* leave space for NUL */68while (n != 0) {69/*70* If the buffer is empty, refill it.71*/72if ((len = fp->_r) <= 0) {73if (__srefill(fp)) {74/* EOF/error: stop with partial or no line */75if (!__sfeof(fp) || s == buf) {76ret = NULL;77goto end;78}79break;80}81len = fp->_r;82}83p = fp->_p;8485/*86* Scan through at most n bytes of the current buffer,87* looking for '\n'. If found, copy up to and including88* newline, and stop. Otherwise, copy entire chunk89* and loop.90*/91if (len > n)92len = n;93t = memchr((void *)p, '\n', len);94if (t != NULL) {95len = ++t - p;96fp->_r -= len;97fp->_p = t;98(void)memcpy((void *)s, (void *)p, len);99s[len] = 0;100ret = buf;101goto end;102}103fp->_r -= len;104fp->_p += len;105(void)memcpy((void *)s, (void *)p, len);106s += len;107n -= len;108}109*s = 0;110ret = buf;111end:112FUNLOCKFILE_CANCELSAFE();113return (ret);114}115116117