2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2005-2008 Poul-Henning Kamp
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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.
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
39 #include <sys/endian.h>
42 #include "libfifolog.h"
43 #include "libfifolog_int.h"
46 /*--------------------------------------------------------------------*/
48 struct fifolog_reader {
50 #define FIFOLOG_READER_MAGIC 0x1036d139
51 struct fifolog_file *ff;
57 struct fifolog_reader *
58 fifolog_reader_open(const char *fname)
61 struct fifolog_reader *fr;
64 fr = calloc(1, sizeof(*fr));
66 err(1, "Cannot malloc");
68 retval = fifolog_int_open(&fr->ff, fname, 0);
72 fr->obuf = calloc(16, fr->ff->recsize);
74 err(1, "Cannot malloc");
75 fr->olen = fr->ff->recsize * 16;
77 i = inflateInit(fr->ff->zs);
80 fr->magic = FIFOLOG_READER_MAGIC;
85 * Find the next SYNC block
89 * 1 - found sync block
90 * 2 - would have wrapped around
91 * 3 - End of written log.
95 fifolog_reader_findsync(const struct fifolog_file *ff, off_t *o)
100 assert(*o < ff->logsize);
101 e = fifolog_int_read(ff, *o);
103 err(1, "Read error (%d) while looking for SYNC", e);
104 seq = be32dec(ff->recbuf);
105 if (*o == 0 && seq == 0)
108 if (ff->recbuf[4] & FIFOLOG_FLG_SYNC)
109 return (1); /* That was easy... */
111 assert(*o < ff->logsize);
114 if (*o == ff->logsize)
115 return (2); /* wraparound */
116 e = fifolog_int_read(ff, *o);
118 err(1, "Read error (%d) while looking for SYNC", e);
119 seqs = be32dec(ff->recbuf);
121 return (3); /* End of log */
122 if (ff->recbuf[4] & FIFOLOG_FLG_SYNC)
123 return (1); /* Bingo! */
128 * Seek out a given timestamp
132 fifolog_reader_seek(const struct fifolog_reader *fr, time_t t0)
140 CHECK_OBJ_NOTNULL(fr, FIFOLOG_READER_MAGIC);
143 * First, find the first SYNC block
146 e = fifolog_reader_findsync(fr->ff, &o);
148 return (0); /* empty fifolog */
151 assert(fr->ff->recbuf[4] & FIFOLOG_FLG_SYNC);
152 seq = be32dec(fr->ff->recbuf);
153 t = be32dec(fr->ff->recbuf + 5);
156 /* Check if there is a second older part we can use */
157 retval = fifolog_int_findend(fr->ff, &s);
159 err(1, "%s", retval);
161 e = fifolog_reader_findsync(fr->ff, &s);
163 return (0); /* empty fifolog */
166 seq = be32dec(fr->ff->recbuf);
167 t = be32dec(fr->ff->recbuf + 5);
171 /* Now do a binary search to find the sync block right before t0 */
172 s = st = (fr->ff->logsize - o) / 2;
174 /* We know we shouldn't wrap */
175 if (o + st > fr->ff->logsize + 1) {
179 e = fifolog_int_read(fr->ff, o + st);
184 /* If not in same part, sequence won't match */
185 seqs = be32dec(fr->ff->recbuf);
186 if (seqs != seq + st) {
190 /* If not sync block, try next */
191 if (!(fr->ff->recbuf[4] & FIFOLOG_FLG_SYNC)) {
195 /* Check timestamp */
196 tt = be32dec(fr->ff->recbuf + 5);
204 fprintf(stderr, "Read from %jx\n", o * fr->ff->recsize);
208 static unsigned char *
209 fifolog_reader_chop(struct fifolog_reader *fr, fifolog_reader_render_t *func, void *priv)
215 q = fr->obuf + (fr->olen - fr->ff->zs->avail_out);
218 /* Make sure we have a complete header */
223 if (u & FIFOLOG_TIMESTAMP) {
224 fr->now = be32dec(p + 4);
227 if (u & FIFOLOG_LENGTH) {
233 for (v = 0; p + v + w < q && p[v + w] != '\0'; v++)
239 func(priv, fr->now, u, p + w, v);
245 * Process fifolog until end of written log or provided timestamp
249 fifolog_reader_process(struct fifolog_reader *fr, off_t from, fifolog_reader_render_t *func, void *priv, time_t end)
258 CHECK_OBJ_NOTNULL(fr, FIFOLOG_READER_MAGIC);
262 e = fifolog_int_read(fr->ff, o);
264 err(1, "Read error (%d)", e);
265 if (++o >= fr->ff->logsize)
267 seq = be32dec(fr->ff->recbuf);
268 if (lseq != 0 && seq != lseq + 1)
271 zs->avail_in = fr->ff->recsize - 5;
272 zs->next_in = fr->ff->recbuf + 5;
273 if (fr->ff->recbuf[4] & FIFOLOG_FLG_1BYTE)
274 zs->avail_in -= fr->ff->recbuf[fr->ff->recsize - 1];
275 if (fr->ff->recbuf[4] & FIFOLOG_FLG_4BYTE)
277 be32dec(fr->ff->recbuf + fr->ff->recsize - 4);
278 if (fr->ff->recbuf[4] & FIFOLOG_FLG_SYNC) {
279 i = inflateReset(zs);
281 zs->next_out = fr->obuf;
282 zs->avail_out = fr->olen;
283 t = be32dec(fr->ff->recbuf + 5);
290 while(zs->avail_in > 0) {
292 if (i == Z_BUF_ERROR) {
295 "Z_BUF_ERROR [%d,%d] [%d,%d,%d]\n",
296 (int)(zs->next_in - fr->ff->recbuf),
298 (int)(zs->next_out - fr->obuf),
299 zs->avail_out, fr->olen);
306 if (i == Z_STREAM_END) {
307 i = inflateReset(zs);
310 fprintf(stderr, "inflate = %d\n", i);
314 if (zs->avail_out != fr->olen) {
315 q = fr->obuf + (fr->olen - zs->avail_out);
316 p = fifolog_reader_chop(fr, func, priv);
318 (void)memmove(fr->obuf, p, q - p);
319 zs->avail_out = fr->olen - (q - p);
320 zs->next_out = fr->obuf + (q - p);