2 * Copyright (c) 2022 Omar Polo <op@openbsd.org>
4 * Permission to use, copy, modify, and distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
24 int base(struct template *, struct tailhead *);
25 int my_write(void *, const void *, size_t);
28 my_write(void *arg, const void *s, size_t len)
32 if (fwrite(s, 1, len, fp) < 0)
39 main(int argc, char **argv)
46 /* use a ridiculously small buffer in regress */
48 if ((tp = template(stdout, my_write, buf, sizeof(buf))) == NULL)
52 for (i = 0; i < 2; ++i) {
53 if ((np = calloc(1, sizeof(*np))) == NULL)
55 if (asprintf(&np->text, "%d", i+1) == -1)
57 TAILQ_INSERT_TAIL(&head, np, entries);
60 if (base(tp, &head) == -1 ||
61 template_flush(tp) == -1)
65 while ((np = TAILQ_FIRST(&head))) {
66 TAILQ_REMOVE(&head, np, entries);
71 if (base(tp, &head) == -1 ||
72 template_flush(tp) == -1)