aboutsummaryrefslogtreecommitdiffstats
path: root/src/fig0_3.cpp
blob: f07c1f6ab946b4187033b04540f331e6b8365dff (plain)
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
/*
    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 <unordered_set>

static std::unordered_set<int> components_ids_seen;

bool fig0_3_is_complete(int components_id)
{
    bool complete = components_ids_seen.count(components_id);

    if (complete) {
        components_ids_seen.clear();
    }
    else {
        components_ids_seen.insert(components_id);
    }

    return complete;
}


// FIG 0/3 Service component in packet mode with or without Conditional Access
// ETSI EN 300 401 6.3.2
fig_result_t fig0_3(fig0_common_t& fig0, const display_settings_t &disp)
{
    uint16_t SCId, Packet_address, CAOrg;
    uint8_t i = 1, Rfa, DSCTy, SubChId, CAMode, SharedFlag;
    fig_result_t r;
    bool CAOrg_flag, DG_flag, Rfu;

    uint8_t* f = fig0.f;

    while (i < fig0.figlen - 4) {
        // iterate over service component in packet mode
        SCId = ((uint16_t)f[i] << 4) | ((uint16_t)(f[i+1] >> 4) & 0x0F);
        r.complete |= fig0_3_is_complete(SCId);
        Rfa = (f[i+1] >> 1) & 0x07;
        CAOrg_flag = f[i+1] & 0x01;
        DG_flag = (f[i+2] >> 7) & 0x01;
        Rfu = (f[i+2] >> 6) & 0x01;
        DSCTy = f[i+2] & 0x3F;
        SubChId = (f[i+3] >> 2);
        Packet_address = ((uint16_t)(f[i+3] & 0x03) << 8) | ((uint16_t)f[i+4]);
        r.msgs.emplace_back("-");
        r.msgs.emplace_back(1, strprintf("SCId=0x%X", SCId));
        r.msgs.emplace_back(1, strprintf("CAOrg flag=%d CAOrg field %s", CAOrg_flag, CAOrg_flag?"present":"absent"));
        r.msgs.emplace_back(1, strprintf("DG flag=%d", DG_flag));
        r.msgs.emplace_back(1, strprintf("data groups are %sused to transport the service component", DG_flag ? "not ": ""));
        r.msgs.emplace_back(1, strprintf("DSCTy=%d %s", DSCTy, get_dscty_type(DSCTy)));
        r.msgs.emplace_back(1, strprintf("SubChId=0x%X", SubChId));
        r.msgs.emplace_back(1, strprintf("Packet address=0x%X", Packet_address));

        if (Rfa != 0) {
            r.errors.push_back(strprintf("Rfa=%d invalid value", Rfa));
        }

        if (Rfu != 0) {
            r.errors.push_back(strprintf("Rfu=%d invalid value", Rfu));
        }

        i += 5;
        if (CAOrg_flag) {
            if (i < fig0.figlen - 1) {
                CAOrg = ((uint16_t)f[i] << 8) | ((uint16_t)f[i+1]);
                CAMode = (f[i] >> 5);
                SharedFlag = f[i+1];
                r.msgs.emplace_back(1, strprintf("CAOrg=0x%X CAMode=%d \"%s\" SharedFlag=0x%X%s",
                        CAOrg, CAMode, get_ca_mode(CAMode), SharedFlag, (SharedFlag == 0) ? " invalid" : ""));
            }
            else {
                r.errors.push_back("Invalid figlen");
            }
            i += 2;
        }
    }

    return r;
}