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
|
/*
Copyright (C) 2014 CSP Innovazione nelle ICT s.c.a r.l. (http://www.csp.it/)
Copyright (C) 2018 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> clusters_seen;
bool fig0_26_is_complete(int cluster_id)
{
bool complete = clusters_seen.count(cluster_id);
if (complete) {
clusters_seen.clear();
}
else {
clusters_seen.insert(cluster_id);
}
return complete;
}
// FIG 0/26 fig0.oe() Announcement switching
// ETSI EN 300 401 8.1.10.5.2
fig_result_t fig0_26(fig0_common_t& fig0, const display_settings_t &disp)
{
uint16_t Asw_flags, EId_Other_Ensemble;
uint8_t i = 1, j, Rfa, Cluster_Id_Current_Ensemble, Region_Id_Current_Ensemble;
uint8_t Cluster_Id_Other_Ensemble, Region_Id_Other_Ensemble;
bool New_flag, Region_flag;
fig_result_t r;
uint8_t* f = fig0.f;
while (i < (fig0.figlen - 6)) {
// iterate over other ensembles announcement switching
Cluster_Id_Current_Ensemble = f[i];
r.complete = fig0_26_is_complete(Cluster_Id_Current_Ensemble);
Asw_flags = ((uint16_t)f[i+1] << 8) | (uint16_t)f[i+2];
New_flag = f[i+3] >> 7;
Region_flag = (f[i+3] >> 6) & 0x01;
Region_Id_Current_Ensemble = f[i+3] & 0x3F;
EId_Other_Ensemble = ((uint16_t)f[i+4] << 8) | (uint16_t)f[i+5];
Cluster_Id_Other_Ensemble = f[i+6];
r.msgs.emplace_back("-");
r.msgs.emplace_back(1, strprintf("Cluster Id Current Ensemble=0x%X", Cluster_Id_Current_Ensemble));
r.msgs.emplace_back(1, strprintf("Asw flags=0x%X", Asw_flags));
r.msgs.emplace_back(1, strprintf("New flag=%d %s announcement", New_flag, New_flag?"newly introduced":"repeated"));
r.msgs.emplace_back(1, strprintf("Region flag=%d last byte %s",
Region_flag, Region_flag?"present":"absent. The announcement concerns the whole service area"));
r.msgs.emplace_back(1, strprintf("Region Id Current Ensemble=0x%X", Region_Id_Current_Ensemble));
r.msgs.emplace_back(1, strprintf("EId Other Ensemble=0x%X", EId_Other_Ensemble));
r.msgs.emplace_back(1, strprintf("Cluster Id Other Ensemble=0x%X", Cluster_Id_Other_Ensemble));
i += 7;
if (Region_flag != 0) {
if (i < fig0.figlen) {
// get Region Id Other Ensemble
Rfa = (f[i] >> 6);
Region_Id_Other_Ensemble = f[i] & 0x3F;
if (Rfa != 0) {
r.errors.push_back(strprintf("Rfa=%d invalid value", Rfa));
}
r.msgs.emplace_back(1, strprintf("Region Id Other Ensemble=0x%X", Region_Id_Other_Ensemble));
}
else {
r.errors.push_back("missing Region Id Other Ensemble, fig length too short !");
}
i++;
}
// decode announcement switching types
r.msgs.emplace_back(1, "Announcement switching:");
for (j = 0; j < 16; j++) {
if (Asw_flags & (1 << j)) {
r.msgs.emplace_back(2, strprintf("- %s", get_announcement_type(j)));
}
}
}
return r;
}
|
