1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
3 *
4 * Copyright (c) 2005-2008 Poul-Henning Kamp
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * SUCH DAMAGE.
27 */
28
29 #include <stdio.h>
30 #include <stdlib.h>
31 #include <sysexits.h>
32 #include <err.h>
33 #include <unistd.h>
34 #include <ctype.h>
35 #include <assert.h>
36 #include <poll.h>
37 #include <string.h>
38 #include <zlib.h>
39
40 #include "libfifolog.h"
41
42 static void
usage(void)43 usage(void)
44 {
45 fprintf(stderr,
46 "Usage: fifolog_writer [-w write-rate] [-s sync-rate] "
47 "[-z compression] file\n");
48 exit(EX_USAGE);
49 }
50
51 int
main(int argc,char * const * argv)52 main(int argc, char * const *argv)
53 {
54 struct fifolog_writer *f;
55 const char *es;
56 struct pollfd pfd[1];
57 char buf[BUFSIZ], *p;
58 int i, c;
59 unsigned w_opt = 10;
60 unsigned s_opt = 60;
61 unsigned z_opt = Z_BEST_COMPRESSION;
62
63 while ((c = getopt(argc, argv, "w:s:z:")) != -1) {
64 switch(c) {
65 case 'w':
66 w_opt = strtoul(optarg, NULL, 0);
67 break;
68 case 's':
69 s_opt = strtoul(optarg, NULL, 0);
70 break;
71 case 'z':
72 z_opt = strtoul(optarg, NULL, 0);
73 break;
74 default:
75 usage();
76 }
77 }
78 argc -= optind;
79 argv += optind;
80 if (argc != 1)
81 usage();
82
83 if (z_opt > 9)
84 usage();
85
86 if (w_opt > s_opt)
87 usage();
88
89 f = fifolog_write_new();
90 assert(f != NULL);
91
92 es = fifolog_write_open(f, argv[0], w_opt, s_opt, z_opt);
93 if (es)
94 err(1, "Error: %s", es);
95
96 while (1) {
97 pfd[0].fd = 0;
98 pfd[0].events = POLLIN;
99 i = poll(pfd, 1, 1000);
100 if (i == 1) {
101 if (fgets(buf, sizeof buf, stdin) == NULL)
102 break;
103 p = strchr(buf, '\0');
104 assert(p != NULL);
105 while (p > buf && isspace(p[-1]))
106 p--;
107 *p = '\0';
108 if (*buf != '\0')
109 fifolog_write_record_poll(f, 0, 0, buf, 0);
110 } else if (i == 0)
111 fifolog_write_poll(f, 0);
112 }
113 fifolog_write_close(f);
114 return (0);
115 }
116