2 * Copyright (c) 2005-2008 Poul-Henning Kamp
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #include <sys/endian.h>
40 #include "libfifolog.h"
41 #include "libfifolog_int.h"
44 /*--------------------------------------------------------------------*/
46 struct fifolog_reader {
48 #define FIFOLOG_READER_MAGIC 0x1036d139
49 struct fifolog_file *ff;
55 struct fifolog_reader *
56 fifolog_reader_open(const char *fname)
59 struct fifolog_reader *fr;
62 fr = calloc(sizeof *fr, 1);
64 err(1, "Cannot malloc");
66 retval = fifolog_int_open(&fr->ff, fname, 0);
70 fr->obuf = calloc(16, fr->ff->recsize);
72 err(1, "Cannot malloc");
73 fr->olen = fr->ff->recsize * 16;
75 i = inflateInit(fr->ff->zs);
78 fr->magic = FIFOLOG_READER_MAGIC;
83 * Find the next SYNC block
87 * 1 - found sync block
88 * 2 - would have wrapped around
89 * 3 - End of written log.
93 fifolog_reader_findsync(const struct fifolog_file *ff, off_t *o)
98 assert(*o < ff->logsize);
99 e = fifolog_int_read(ff, *o);
101 err(1, "Read error (%d) while looking for SYNC", e);
102 seq = be32dec(ff->recbuf);
103 if (*o == 0 && seq == 0)
106 if (ff->recbuf[4] & FIFOLOG_FLG_SYNC)
107 return (1); /* That was easy... */
109 assert(*o < ff->logsize);
112 if (*o == ff->logsize)
113 return (2); /* wraparound */
114 e = fifolog_int_read(ff, *o);
116 err(1, "Read error (%d) while looking for SYNC", e);
117 seqs = be32dec(ff->recbuf);
119 return (3); /* End of log */
120 if (ff->recbuf[4] & FIFOLOG_FLG_SYNC)
121 return (1); /* Bingo! */
126 * Seek out a given timestamp
130 fifolog_reader_seek(const struct fifolog_reader *fr, time_t t0)
138 CHECK_OBJ_NOTNULL(fr, FIFOLOG_READER_MAGIC);
141 * First, find the first SYNC block
144 e = fifolog_reader_findsync(fr->ff, &o);
146 return (0); /* empty fifolog */
149 assert(fr->ff->recbuf[4] & FIFOLOG_FLG_SYNC);
150 seq = be32dec(fr->ff->recbuf);
151 t = be32dec(fr->ff->recbuf + 5);
154 /* Check if there is a second older part we can use */
155 retval = fifolog_int_findend(fr->ff, &s);
157 err(1, "%s", retval);
159 e = fifolog_reader_findsync(fr->ff, &s);
161 return (0); /* empty fifolog */
164 seq = be32dec(fr->ff->recbuf);
165 t = be32dec(fr->ff->recbuf + 5);
169 /* Now do a binary search to find the sync block right before t0 */
170 s = st = (fr->ff->logsize - o) / 2;
172 /* We know we shouldn't wrap */
173 if (o + st > fr->ff->logsize + 1) {
177 e = fifolog_int_read(fr->ff, o + st);
182 /* If not in same part, sequence won't match */
183 seqs = be32dec(fr->ff->recbuf);
184 if (seqs != seq + st) {
188 /* If not sync block, try next */
189 if (!(fr->ff->recbuf[4] & FIFOLOG_FLG_SYNC)) {
193 /* Check timestamp */
194 tt = be32dec(fr->ff->recbuf + 5);
202 fprintf(stderr, "Read from %jx\n", o * fr->ff->recsize);
206 static unsigned char *
207 fifolog_reader_chop(struct fifolog_reader *fr, fifolog_reader_render_t *func, void *priv)
213 q = fr->obuf + (fr->olen - fr->ff->zs->avail_out);
216 /* Make sure we have a complete header */
221 if (u & FIFOLOG_TIMESTAMP) {
222 fr->now = be32dec(p + 4);
225 if (u & FIFOLOG_LENGTH) {
231 for (v = 0; p + v + w < q && p[v + w] != '\0'; v++)
237 func(priv, fr->now, u, p + w, v);
243 * Process fifolog until end of written log or provided timestamp
247 fifolog_reader_process(struct fifolog_reader *fr, off_t from, fifolog_reader_render_t *func, void *priv, time_t end)
256 CHECK_OBJ_NOTNULL(fr, FIFOLOG_READER_MAGIC);
260 e = fifolog_int_read(fr->ff, o);
262 err(1, "Read error (%d)", e);
263 if (++o >= fr->ff->logsize)
265 seq = be32dec(fr->ff->recbuf);
266 if (lseq != 0 && seq != lseq + 1)
269 zs->avail_in = fr->ff->recsize - 5;
270 zs->next_in = fr->ff->recbuf + 5;
271 if (fr->ff->recbuf[4] & FIFOLOG_FLG_1BYTE)
272 zs->avail_in -= fr->ff->recbuf[fr->ff->recsize - 1];
273 if (fr->ff->recbuf[4] & FIFOLOG_FLG_4BYTE)
275 be32dec(fr->ff->recbuf + fr->ff->recsize - 4);
276 if (fr->ff->recbuf[4] & FIFOLOG_FLG_SYNC) {
277 i = inflateReset(zs);
279 zs->next_out = fr->obuf;
280 zs->avail_out = fr->olen;
281 t = be32dec(fr->ff->recbuf + 5);
288 while(zs->avail_in > 0) {
290 if (i == Z_BUF_ERROR) {
293 "Z_BUF_ERROR [%d,%d] [%d,%d,%d]\n",
294 (int)(zs->next_in - fr->ff->recbuf),
296 (int)(zs->next_out - fr->obuf),
297 zs->avail_out, fr->olen);
304 if (i == Z_STREAM_END) {
305 i = inflateReset(zs);
308 fprintf(stderr, "inflate = %d\n", i);
312 if (zs->avail_out != fr->olen) {
313 q = fr->obuf + (fr->olen - zs->avail_out);
314 p = fifolog_reader_chop(fr, func, priv);
316 (void)memmove(fr->obuf, p, q - p);
317 zs->avail_out = fr->olen - (q - p);
318 zs->next_out = fr->obuf + (q - p);