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
|
/*
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> services_ids_seen;
bool fig0_17_is_complete(int services_id)
{
bool complete = services_ids_seen.count(services_id);
if (complete) {
services_ids_seen.clear();
}
else {
services_ids_seen.insert(services_id);
}
return complete;
}
// FIG 0/17 Programme Type
// ETSI EN 300 401 8.1.5
bool fig0_17(fig0_common_t& fig0, const display_settings_t &disp)
{
uint16_t SId;
uint8_t i = 1, Rfa, Language, Int_code, Comp_code;
char tmpbuf[512];
char desc[512];
bool SD_flag, PS_flag, L_flag, CC_flag, Rfu;
uint8_t* f = fig0.f;
bool complete = false;
while (i < (fig0.figlen - 3)) {
// iterate over announcement support
SId = (f[i] << 8) | f[i+1];
complete |= fig0_17_is_complete(SId);
SD_flag = (f[i+2] >> 7);
PS_flag = ((f[i+2] >> 6) & 0x01);
L_flag = ((f[i+2] >> 5) & 0x01);
CC_flag = ((f[i+2] >> 4) & 0x01);
Rfa = (f[i+2] & 0x0F);
sprintf(desc, "SId=0x%X, S/D=%d Programme Type codes and language (when present), %srepresent the current programme contents, P/S=%d %s service component, L flag=%d language field %s, CC flag=%d complementary code and preceding Rfa and Rfu fields %s",
SId, SD_flag, SD_flag?"":"may not ", PS_flag, PS_flag?"secondary":"primary",
L_flag, L_flag?"present":"absent", CC_flag, CC_flag?"present":"absent");
if (Rfa != 0) {
sprintf(tmpbuf, ", Rfa=0x%X invalid value", Rfa);
strcat(desc, tmpbuf);
}
i += 3;
if (L_flag != 0) {
if (i < fig0.figlen) {
Language = f[i];
sprintf(tmpbuf, ", Language=0x%X %s", Language,
get_language_name(Language));
strcat(desc, tmpbuf);
}
else {
sprintf(tmpbuf, ", Language= invalid FIG length");
strcat(desc, tmpbuf);
}
i++;
}
if (i < fig0.figlen) {
Rfa = f[i] >> 6;
Rfu = (f[i] >> 5) & 0x01;
if (Rfa != 0) {
sprintf(tmpbuf, ", Rfa=0x%X invalid value", Rfa);
strcat(desc, tmpbuf);
}
if (Rfu != 0) {
sprintf(tmpbuf, ", Rfu=%d invalid value", Rfu);
strcat(desc, tmpbuf);
}
Int_code = f[i] & 0x1F;
sprintf(tmpbuf, ", Int code=0x%X %s", Int_code, get_programme_type(get_international_table() , Int_code));
strcat(desc, tmpbuf);
i++;
}
else {
sprintf(tmpbuf, ", Int code= invalid FIG length");
strcat(desc, tmpbuf);
}
if (CC_flag != 0) {
if (i < fig0.figlen) {
Rfa = f[i] >> 6;
Rfu = (f[i] >> 5) & 0x01;
if (Rfa != 0) {
sprintf(tmpbuf, ", Rfa=0x%X invalid value", Rfa);
strcat(desc, tmpbuf);
}
if (Rfu != 0) {
sprintf(tmpbuf, ", Rfu=%d invalid value", Rfu);
strcat(desc, tmpbuf);
}
Comp_code = f[i] & 0x1F;
sprintf(tmpbuf, ", Comp code=0x%X %s", Comp_code, get_programme_type(get_international_table() , Comp_code));
strcat(desc, tmpbuf);
i++;
}
else {
sprintf(tmpbuf, ", Comp code= invalid FIG length");
strcat(desc, tmpbuf);
}
}
printbuf(desc, disp+1, NULL, 0);
}
return complete;
}
|
