summaryrefslogtreecommitdiffstats
path: root/src/fig/FIG0_24.cpp
blob: af3f043d9307261c2692a13a45f764a88dbf7b66 (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
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
/*
   Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
   2011, 2012 Her Majesty the Queen in Right of Canada (Communications
   Research Center Canada)

   Copyright (C) 2017
   Matthias P. Braendli, matthias.braendli@mpb.li
   */
/*
   This file is part of ODR-DabMux.

   ODR-DabMux 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.

   ODR-DabMux 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 ODR-DabMux.  If not, see <http://www.gnu.org/licenses/>.
*/

#include "fig/FIG0structs.h"
#include "fig/FIG0_24.h"
#include "utils.h"

#warning "fig0/24 rate"

namespace FIC {

struct FIGtype0_24_audioservice {
    uint16_t SId;
    uint8_t Length:4;
    uint8_t CAId:3;
    uint8_t rfa:1;
} PACKED;

struct FIGtype0_24_dataservice {
    uint32_t SId;
    uint8_t Length:4;
    uint8_t CAId:3;
    uint8_t rfa:1;
} PACKED;


FIG0_24::FIG0_24(FIGRuntimeInformation *rti) :
    m_rti(rti),
    m_initialised(false),
    m_inserting_audio_not_data(false)
{
}

FillStatus FIG0_24::fill(uint8_t *buf, size_t max_size)
{
#define FIG0_24_TRACE debug
    using namespace std;

    FillStatus fs;
    FIGtype0* fig0 = nullptr;
    ssize_t remaining = max_size;

    const auto ensemble = m_rti->ensemble;

    etiLog.level(FIG0_24_TRACE) << "FIG0_24::fill init " << (m_initialised ? 1 : 0) <<
        " ********************************";

    if (not m_initialised) {
        serviceFIG0_24 = ensemble->services.begin();
        m_initialised = true;
    }

    const auto last_service = ensemble->services.end();

    // Rotate through the subchannels until there is no more
    // space
    for (; serviceFIG0_24 != last_service; ++serviceFIG0_24) {
        const auto type = (*serviceFIG0_24)->getType(ensemble);
        const auto isProgramme = (*serviceFIG0_24)->isProgramme(ensemble);

        etiLog.log(FIG0_24_TRACE, "FIG0_24::fill  loop SId=%04x %s/%s",
                (*serviceFIG0_24)->id,
                m_inserting_audio_not_data ? "AUDIO" : "DATA",
                type == subchannel_type_t::Audio ? "Audio" :
                type == subchannel_type_t::Packet ? "Packet" :
                type == subchannel_type_t::DataDmb ? "DataDmb" :
                type == subchannel_type_t::Fidc ? "Fidc" : "?");

        // Skip services that are not in other ensembles
        if ((*serviceFIG0_24)->other_ensembles.empty()) {
            continue;
        }

        const ssize_t required_size =
            (isProgramme ? 2 : 4) + 1 +
            (*serviceFIG0_24)->other_ensembles.size() * 2;


        if (fig0 == nullptr) {
            etiLog.level(FIG0_24_TRACE) << "FIG0_24::fill  header";
            if (remaining < 2 + required_size) {
                etiLog.level(FIG0_24_TRACE) << "FIG0_24::fill  header no place" <<
                    " rem=" << remaining << " req=" << 2 + required_size;
                break;
            }
            fig0 = (FIGtype0*)buf;

            fig0->FIGtypeNumber = 0;
            fig0->Length = 1;
            fig0->CN = 0;
            fig0->OE = 0;
            fig0->PD = isProgramme ? 0 : 1;
            fig0->Extension = 2;
            buf += 2;
            remaining -= 2;
        }
        else if (remaining < required_size) {
            etiLog.level(FIG0_24_TRACE) << "FIG0_24::fill  no place" <<
                " rem=" << remaining << " req=" << required_size;
            break;
        }

        if (type == subchannel_type_t::Audio) {
            auto fig0_2serviceAudio = (FIGtype0_24_audioservice*)buf;

            fig0_2serviceAudio->SId = htons((*serviceFIG0_24)->id);
            fig0_2serviceAudio->rfa = 0;
            fig0_2serviceAudio->CAId = 0;
            fig0_2serviceAudio->Length = (*serviceFIG0_24)->other_ensembles.size();
            buf += 3;
            fig0->Length += 3;
            remaining -= 3;

            etiLog.log(FIG0_24_TRACE, "FIG0_24::fill  audio SId=%04x",
               (*serviceFIG0_24)->id);
        }
        else {
            auto fig0_2serviceData = (FIGtype0_24_dataservice*)buf;

            fig0_2serviceData->SId = htonl((*serviceFIG0_24)->id);
            fig0_2serviceData->rfa = 0;
            fig0_2serviceData->CAId = 0;
            fig0_2serviceData->Length = (*serviceFIG0_24)->other_ensembles.size();
            buf += 4;
            fig0->Length += 4;
            remaining -= 4;

            etiLog.log(FIG0_24_TRACE, "FIG0_24::fill  data SId=%04x",
               (*serviceFIG0_24)->id);
        }

        for (const uint16_t oe : (*serviceFIG0_24)->other_ensembles) {
            buf[0] = oe >> 8;
            buf[1] = oe & 0xFF;

            buf += 2;
            fig0->Length += 2;
            remaining -= 2;
        }
    }

    if (serviceFIG0_24 == last_service) {
        etiLog.log(FIG0_24_TRACE, "FIG0_24::loop reached last");
        fs.complete_fig_transmitted = true;
        m_initialised = false;
    }

    etiLog.log(FIG0_24_TRACE, "FIG0_24::loop end complete=%d",
            fs.complete_fig_transmitted ? 1 : 0);

    fs.num_bytes_written = max_size - remaining;
    return fs;
}

}