1 /*
2  * Copyright (c) 2022 Omar Polo <op@openbsd.org>
3  *
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.
7  *
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.
15  */
16 
17 #include <err.h>
18 #include <stdio.h>
19 #include <stdlib.h>
20 
21 #include "tmpl.h"
22 #include "lists.h"
23 
24 int	base(struct template *, struct tailhead *);
25 int	my_putc(struct template *, int);
26 int	my_puts(struct template *, const char *);
27 
28 int
29 my_putc(struct template *tp, int c)
30 {
31 	FILE	*fp = tp->tp_arg;
32 
33 	if (putc(c, fp) < 0)
34 		return (-1);
35 
36 	return (0);
37 }
38 
39 int
40 my_puts(struct template *tp, const char *s)
41 {
42 	FILE	*fp = tp->tp_arg;
43 
44 	if (fputs(s, fp) < 0)
45 		return (-1);
46 
47 	return (0);
48 }
49 
50 int
51 main(int argc, char **argv)
52 {
53 	struct template	*tp;
54 	struct tailhead	 head;
55 	struct entry	*np;
56 	int		 i;
57 
58 	if ((tp = template(stdout, my_puts, my_putc)) == NULL)
59 		err(1, "template");
60 
61 	TAILQ_INIT(&head);
62 	for (i = 0; i < 2; ++i) {
63 		if ((np = calloc(1, sizeof(*np))) == NULL)
64 			err(1, "calloc");
65 		if (asprintf(&np->text, "%d", i+1) == -1)
66 			err(1, "asprintf");
67 		TAILQ_INSERT_TAIL(&head, np, entries);
68 	}
69 
70 	if (base(tp, &head) == -1)
71 		return (1);
72 	puts("");
73 
74 	while ((np = TAILQ_FIRST(&head))) {
75 		TAILQ_REMOVE(&head, np, entries);
76 		free(np->text);
77 		free(np);
78 	}
79 
80 	if (base(tp, &head) == -1)
81 		return (1);
82 	puts("");
83 
84 	free(tp);
85 
86 	return (0);
87 }