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
|
/*
Copyright (C) 2014 CSP Innovazione nelle ICT s.c.a r.l. (http://www.csp.it/)
Copyright (C) 2016 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/>.
Authors:
Sergio Sagliocco <sergio.sagliocco@csp.it>
Matthias P. Braendli <matthias@mpb.li>
/ | |- ')|) |-|_ _ (|,_ .| _ ,_ \
Data Path \(|(||_(|/_| (||_||(a)_||||(|||.(_()|||/
*/
#include "figs.hpp"
#include <cstdio>
#include <cstring>
#include <map>
#include <unordered_set>
static std::unordered_set<int> links_seen;
bool fig0_6_is_complete(int link_key)
{
bool complete = links_seen.count(link_key);
if (complete) {
links_seen.clear();
}
else {
links_seen.insert(link_key);
}
return complete;
}
// map between fig 0/6 database key and LA to detect activation and deactivation of links
static std::map<uint16_t, bool> fig0_6_key_la;
void fig0_6_cleardb()
{
fig0_6_key_la.clear();
}
// FIG 0/6 Service linking information
// ETSI EN 300 401 8.1.15
bool fig0_6(fig0_common_t& fig0, const display_settings_t &disp)
{
uint32_t j;
uint16_t LSN, key;
uint8_t i = 1, Number_of_Ids, IdLQ;
char signal_link[256];
char desc[256];
bool Id_list_flag, LA, SH, ILS, Shd;
bool complete = false;
uint8_t* f = fig0.f;
while (i < (fig0.figlen - 1)) {
// iterate over service linking
Id_list_flag = (f[i] >> 7) & 0x01;
LA = (f[i] >> 6) & 0x01;
SH = (f[i] >> 5) & 0x01;
ILS = (f[i] >> 4) & 0x01;
LSN = ((f[i] & 0x0F) << 8) | f[i+1];
key = (fig0.oe() << 15) | (fig0.pd() << 14) | (SH << 13) | (ILS << 12) | LSN;
complete |= fig0_6_is_complete(key);
strcpy(signal_link, "");
// check activation / deactivation
if ((fig0_6_key_la.count(key) > 0) && (fig0_6_key_la[key] != LA)) {
if (LA == 0) {
strcat(signal_link, " deactivated");
}
else {
strcat(signal_link, " activated");
}
}
fig0_6_key_la[key] = LA;
i += 2;
if (Id_list_flag == 0) {
if (fig0.cn() == 0) { // Id_list_flag=0 && fig0.cn()=0: CEI Change Event Indication
strcat(signal_link, " CEI");
}
sprintf(desc, "Id list flag=%d, LA=%d %s, S/H=%d %s, ILS=%d %s, LSN=%d, database key=0x%04x%s",
Id_list_flag,
LA, LA ? "active" : "inactive",
SH, SH ? "Hard" : "Soft",
ILS, ILS ? "international" : "national",
LSN, key, signal_link);
printbuf(desc, disp+1, NULL, 0);
}
else { // Id_list_flag == 1
if (i < fig0.figlen) {
Number_of_Ids = (f[i] & 0x0F);
if (fig0.pd() == 0) {
IdLQ = (f[i] >> 5) & 0x03;
Shd = (f[i] >> 4) & 0x01;
sprintf(desc, "Id list flag=%d, LA=%d %s, S/H=%d %s, ILS=%d %s, LSN=%d, "
"database key=0x%04x, IdLQ=%d, Shd=%d %s, Number of Ids=%d%s",
Id_list_flag,
LA, (LA)?"active":"inactive",
SH, (SH)?"Hard":"Soft",
ILS, (ILS)?"international":"national",
LSN, key, IdLQ,
Shd, (Shd)?"b11-8 in 4-F are different services":"single service",
Number_of_Ids, signal_link);
printbuf(desc, disp+1, NULL, 0);
if (ILS == 0) {
// read Id list
for(j = 0; ((j < Number_of_Ids) && ((i+2+(j*2)) < fig0.figlen)); j++) {
// ETSI EN 300 401 8.1.15. Some changes were introducted in spec V2
if (((j == 0) && (fig0.oe() == 0) && (fig0.cn() == 0)) ||
(IdLQ == 0)) {
sprintf(desc, "DAB SId 0x%X",
((f[i+1+(j*2)] << 8) | f[i+2+(j*2)]));
}
else if (IdLQ == 1) {
sprintf(desc, "RDS PI 0x%X",
((f[i+1+(j*2)] << 8) | f[i+2+(j*2)]));
}
else if (IdLQ == 2) {
sprintf(desc, "(AM-FM legacy) 0x%X",
((f[i+1+(j*2)] << 8) | f[i+2+(j*2)]));
}
else { // IdLQ == 3
sprintf(desc, "DRM-AMSS service 0x%X",
((f[i+1+(j*2)] << 8) | f[i+2+(j*2)]));
}
printbuf(desc, disp+2, NULL, 0);
}
// check deadlink
if ((Number_of_Ids == 0) && (IdLQ == 1)) {
sprintf(desc, "deadlink");
printbuf(desc, disp+2, NULL, 0);
}
i += (Number_of_Ids * 2) + 1;
}
else { // fig0.pd() == 0 && ILS == 1
// read Id list
for(j = 0; ((j < Number_of_Ids) && ((i+3+(j*3)) < fig0.figlen)); j++) {
if (((j == 0) && (fig0.oe() == 0) && (fig0.cn() == 0)) ||
(IdLQ == 0)) {
sprintf(desc, "DAB SId ecc 0x%02X Id 0x%04X", f[i+1+(j*3)], ((f[i+2+(j*3)] << 8) | f[i+3+(j*3)]));
}
else if (IdLQ == 1) {
sprintf(desc, "RDS PI ecc 0x%02X Id 0x%04X", f[i+1+(j*3)], ((f[i+2+(j*3)] << 8) | f[i+3+(j*3)]));
}
else if (IdLQ == 2) {
sprintf(desc, "(AM-FM legacy) ecc 0x%02X Id 0x%04X", f[i+1+(j*3)], ((f[i+2+(j*3)] << 8) | f[i+3+(j*3)]));
}
else { // IdLQ == 3
sprintf(desc, "DRM/AMSS service ecc 0x%02X Id 0x%04X", f[i+1+(j*3)], ((f[i+2+(j*3)] << 8) | f[i+3+(j*3)]));
}
printbuf(desc, disp+2, NULL, 0);
}
// check deadlink
if ((Number_of_Ids == 0) && (IdLQ == 1)) {
sprintf(desc, "deadlink");
printbuf(desc, disp+2, NULL, 0);
}
i += (Number_of_Ids * 3) + 1;
}
}
else { // fig0.pd() == 1
sprintf(desc, "Id list flag=%d, LA=%d %s, S/H=%d %s, ILS=%d %s, LSN=%d, database key=0x%04x, Number of Ids=%d%s",
Id_list_flag, LA, (LA)?"active":"inactive", SH, (SH)?"Hard":"Soft", ILS, (ILS)?"international":"national", LSN, key, Number_of_Ids, signal_link);
printbuf(desc, disp+1, NULL, 0);
if (Number_of_Ids > 0) {
// read Id list
for(j = 0; ((j < Number_of_Ids) && ((i+4+(j*4)) < fig0.figlen)); j++) {
sprintf(desc, "SId 0x%X",
((f[i+1+(j*4)] << 24) | (f[i+2+(j*4)] << 16) | (f[i+3+(j*4)] << 8) | f[i+4+(j*4)]));
printbuf(desc, disp+2, NULL, 0);
}
}
i += (Number_of_Ids * 4) + 1;
}
}
}
}
return complete;
}
|
