forked from harpreet-s/xgoldmon
-
Notifications
You must be signed in to change notification settings - Fork 6
/
readlog.c
138 lines (106 loc) · 3.09 KB
/
readlog.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
/* (C) 2013 by Tobias Engel <[email protected]>
* All Rights Reserved
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
*/
#include <stdlib.h>
#include <arpa/inet.h>
#include "xgoldmon.h"
int readlog_unescape;
uint8_t read_byte(FILE *f)
{
uint8_t byte;
int rc = fread(&byte, 1, 1, f);
if(rc != 1) {
if(feof(f)) {
DBG(2, printf("** EOF\n"));
exit(EXIT_SUCCESS);
}
if(ferror(f)) {
DBG(0, perror(NULL));
exit(EXIT_FAILURE);
}
exit(EXIT_SUCCESS);
}
return byte;
}
void read_log(FILE *f, uint8_t *buf, uint16_t size)
{
while(size--) {
*buf = read_byte(f);
if(readlog_unescape && (*buf == 0x7d))
*buf = (read_byte(f) & 0x0f) | 0x70;
buf++;
}
}
int find_pattern(uint8_t *pat, int len_pat, FILE *f)
{
uint8_t *p = pat;
uint8_t byte;
int c_read = 0;
while(1) {
read_log(f, &byte, 1);
c_read++;
if(byte == *p) {
p++;
if(p - pat == len_pat)
return c_read;
} else if(p != pat) {
p = pat;
if(byte == *p)
p++;
}
}
}
struct xglog_hdr *read_logmsg(FILE *f, int unescape)
{
uint8_t magic_word[] = { 0xf9, 0x02 };
char *log_err = NULL;
int ebytes, llvl;
static int counter = 0;
static uint8_t buf[sizeof(struct xglog_hdr) + 0xffff + 1];
struct xglog_hdr *log_hdr = (struct xglog_hdr *) buf;
uint16_t len;
static uint8_t seqno_prev = 0;
readlog_unescape = unescape;
ebytes = find_pattern(magic_word, sizeof(magic_word), f);
counter++;
read_log(f, buf, sizeof(struct xglog_hdr));
len = ntohs(log_hdr->len);
if(len != ntohs(log_hdr->msg.len))
log_err = "length fields mismatch";
else if(len > 10000)
log_err = "too long";
else if(len <= sizeof(struct xglog_msg))
log_err = "too short";
else if(log_hdr->seqno != log_hdr->msg.seqno)
log_err = "seqno mismatch";
else {
read_log(f, log_hdr->msg.data, len - sizeof(struct xglog_msg));
}
llvl = (log_err ? 2 : 5);
DBG(llvl, printf("#%6d type: %3d, seq#: %3d, len: %5d",
counter, log_hdr->type, log_hdr->seqno, len));
if(ebytes - sizeof(magic_word))
DBG(llvl, printf(" ** %d extraneous bytes before msg", (int)(ebytes - sizeof(magic_word))));
if(++seqno_prev != log_hdr->seqno)
DBG(llvl, printf(" ** msg out of sequence"));
seqno_prev = log_hdr->seqno;
if(log_err)
DBG(llvl, printf(" ** %s - ignoring msg", log_err));
DBG(llvl, printf("\n"));
return (log_err ? NULL : log_hdr);
}