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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
|
/*
Copyright (C) 2014 CSP Innovazione nelle ICT s.c.a r.l. (http://www.csp.it/)
Copyright (C) 2017 Matthias P. Braendli (http://www.opendigitalradio.org)
Copyright (C) 2015 Data Path
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 3 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, see <http://www.gnu.org/licenses/>.
etisnoop.cpp
Parse ETI NI G.703 file
Authors:
Sergio Sagliocco <sergio.sagliocco@csp.it>
Matthias P. Braendli <matthias@mpb.li>
/ | |- ')|) |-|_ _ (|,_ .| _ ,_ \
Data Path \(|(||_(|/_| (||_||(a)_||||(|||.(_()|||/
*/
#include "utils.hpp"
#include <cstring>
#include <stdarg.h>
using namespace std;
static int verbosity = 0;
void set_verbosity(int v)
{
verbosity = v;
}
int get_verbosity()
{
return verbosity;
}
display_settings_t display_settings_t::operator+(int indent_offset) const
{
return display_settings_t(print, indent+indent_offset);
}
std::string strprintf(const char* fmt, ...)
{
int size = 512;
std::string str;
va_list ap;
while (1) {
str.resize(size);
va_start(ap, fmt);
int n = vsnprintf((char *)str.c_str(), size, fmt, ap);
va_end(ap);
if (n > -1 && n < size) {
str.resize(n);
break;
}
if (n > -1)
size = n + 1;
else
size *= 2;
}
return str;
}
void printbuf(std::string header,
int indent,
uint8_t* buffer,
size_t size,
std::string desc)
{
display_settings_t disp(true, indent);
printbuf(header, disp, buffer, size, desc);
}
void printfig(string header,
const display_settings_t &disp,
uint8_t* buffer,
size_t size,
string desc)
{
if (disp.print) {
for (int i = 0; i < disp.indent; i++) {
printf("\t");
}
printf("%s", header.c_str());
if (verbosity > 1) {
if (size != 0) {
printf(": ");
}
for (size_t i = 0; i < size; i++) {
printf("%02x ", buffer[i]);
}
}
if (desc != "") {
printf(" [%s] ", desc.c_str());
}
printf("\n");
}
}
void printbuf(string header,
const display_settings_t &disp,
uint8_t* buffer,
size_t size,
string desc)
{
if (verbosity > 0) {
for (int i = 0; i < disp.indent; i++) {
printf("\t");
}
printf("%s", header.c_str());
if (verbosity > 1) {
if (size != 0) {
printf(": ");
}
for (size_t i = 0; i < size; i++) {
printf("%02x ", buffer[i]);
}
}
if (desc != "") {
printf(" [%s] ", desc.c_str());
}
printf("\n");
}
}
void printinfo(const string &header,
const display_settings_t &disp,
int min_verb)
{
if (verbosity >= min_verb) {
for (int i = 0; i < disp.indent; i++) {
printf("\t");
}
printf("%s\n", header.c_str());
}
}
void printinfo(const std::string &header,
int min_verb)
{
const display_settings_t disp(true, 0);
printinfo(header, min_verb);
}
int sprintfMJD(char *dst, int mjd) {
// EN 62106 Annex G
// These formulas are applicable between the inclusive dates: 1st March 1900 to 28th February 2100
int y, m, k;
struct tm timeDate;
memset(&timeDate, 0, sizeof(struct tm));
// find Y, M, D from MJD
y = (int)(((double)mjd - 15078.2) / 365.25);
m = (int)(((double)mjd - 14956.1 - (int)((double)y * 365.25)) / 30.6001);
timeDate.tm_mday = mjd - 14956 - (int)((double)y * 365.25) - (int)((double)m * 30.6001);
if ((m == 14) || (m == 15)) {
k = 1;
}
else {
k = 0;
}
timeDate.tm_year = y + k;
timeDate.tm_mon = (m - 1 - (k * 12)) - 1;
// find WD from MJD
timeDate.tm_wday = (((mjd + 2) % 7) + 1) % 7;
//timeDate.tm_yday = 0; // Number of days since the first day of January not calculated
timeDate.tm_isdst = -1; // No time print then information not available
// print date string
if ((timeDate.tm_mday < 0) || (timeDate.tm_mon < 0) || (timeDate.tm_year < 0)) {
return sprintf(dst, "invalid MJD mday=%d mon=%d year=%d", timeDate.tm_mday, timeDate.tm_mon, timeDate.tm_year);
}
return strftime(dst, 256, "%a %b %d %Y", &timeDate);
}
std::string pnum_to_str(uint16_t Programme_Number)
{
uint8_t day, hour, minute;
minute = (uint8_t)(Programme_Number & 0x003F);
hour = (uint8_t)((Programme_Number >> 6) & 0x001F);
day = (uint8_t)((Programme_Number >> 11) & 0x001F);
if (day != 0) {
return strprintf("day of month=%d time=%02d:%02d", day, hour, minute);
}
else { // day == 0
// Special codes are allowed when the date part of the PNum field
// signals date = "0". In this case, the hours and minutes part of
// the field shall contain a special code, as follows
if ((hour == 0) && (minute == 0)) {
return "Status code: no meaningful PNum is currently provided";
}
else if ((hour == 0) && (minute == 1)) {
return "Blank code: the current programme is not worth recording";
}
else if ((hour == 0) && (minute == 2)) {
return "Interrupt code: the interrupt is unplanned "
"(for example a traffic announcement)";
}
else {
return "invalid value";
}
}
}
|
