2020-06-15 14:18:57 +00:00
|
|
|
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
2020-06-15 14:18:57 +00:00
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
2020-06-15 14:18:57 +00:00
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
|
|
#include "libc/assert.h"
|
2021-03-27 05:31:41 +00:00
|
|
|
#include "libc/calls/calls.h"
|
2020-06-15 14:18:57 +00:00
|
|
|
#include "libc/errno.h"
|
2021-03-01 07:42:35 +00:00
|
|
|
#include "libc/macros.internal.h"
|
2020-06-15 14:18:57 +00:00
|
|
|
#include "libc/mem/mem.h"
|
2021-03-27 05:31:41 +00:00
|
|
|
#include "libc/runtime/runtime.h"
|
2020-06-15 14:18:57 +00:00
|
|
|
#include "libc/stdio/stdio.h"
|
2021-03-27 05:31:41 +00:00
|
|
|
#include "libc/str/str.h"
|
|
|
|
#include "libc/sysv/consts/o.h"
|
2020-06-15 14:18:57 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Reads string from stream.
|
|
|
|
*
|
2021-03-27 05:31:41 +00:00
|
|
|
* @param s is the caller's buffer (in/out) which is extended or
|
|
|
|
* allocated automatically, also NUL-terminated is guaranteed
|
|
|
|
* @param n is the capacity of s (in/out)
|
2020-06-15 14:18:57 +00:00
|
|
|
* @param delim is the stop char (and NUL is implicitly too)
|
2021-05-02 14:48:59 +00:00
|
|
|
* @return number of bytes read >0, including delim, excluding NUL,
|
|
|
|
* or -1 w/ errno on EOF or error; see ferror() and feof()
|
2020-06-15 14:18:57 +00:00
|
|
|
* @note this function can't punt EINTR to caller
|
2022-04-06 07:13:44 +00:00
|
|
|
* @see getline(), _chomp(), gettok_r()
|
2020-06-15 14:18:57 +00:00
|
|
|
*/
|
2021-03-27 05:31:41 +00:00
|
|
|
ssize_t getdelim(char **s, size_t *n, int delim, FILE *f) {
|
|
|
|
char *p;
|
|
|
|
ssize_t rc;
|
|
|
|
size_t i, m;
|
|
|
|
if ((f->iomode & O_ACCMODE) == O_WRONLY) {
|
|
|
|
f->state = errno = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
2021-09-12 05:30:37 +00:00
|
|
|
if (f->beg > f->end) {
|
2021-03-27 05:31:41 +00:00
|
|
|
f->state = errno = EINVAL;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
if (!*s) *n = 0;
|
|
|
|
for (i = 0;; i += m) {
|
|
|
|
m = f->end - f->beg;
|
|
|
|
if ((p = memchr(f->buf + f->beg, delim, m))) m = p + 1 - (f->buf + f->beg);
|
2021-10-14 00:27:13 +00:00
|
|
|
if (i + m + 1 > *n) {
|
|
|
|
*n = i + m + 1;
|
|
|
|
*s = realloc(*s, *n);
|
|
|
|
if (!*s) {
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
2021-03-27 05:31:41 +00:00
|
|
|
memcpy(*s + i, f->buf + f->beg, m);
|
|
|
|
(*s)[i + m] = '\0';
|
|
|
|
if ((f->beg += m) == f->end) f->beg = f->end = 0;
|
|
|
|
if (p) {
|
|
|
|
return i + m;
|
|
|
|
} else if (f->fd == -1) {
|
2020-06-15 14:18:57 +00:00
|
|
|
break;
|
2021-03-27 05:31:41 +00:00
|
|
|
} else if ((rc = read(f->fd, f->buf, f->size)) != -1) {
|
|
|
|
if (!rc) break;
|
|
|
|
f->end = rc;
|
|
|
|
} else if (errno != EINTR) {
|
|
|
|
f->state = errno;
|
|
|
|
return -1;
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
|
|
|
}
|
2021-03-27 05:31:41 +00:00
|
|
|
f->state = -1;
|
|
|
|
if (i + m) {
|
|
|
|
return i + m;
|
|
|
|
} else {
|
|
|
|
return -1;
|
|
|
|
}
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|