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
|
/*
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) 2020
Matthias P. Braendli, matthias.braendli@mpb.li
Implementation of the FIG carousel to schedule the FIGs into the
FIBs.
*/
/*
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/>.
*/
#ifndef __FIG_CAROUSEL_H_
#define __FIG_CAROUSEL_H_
#include "fig/FIG.h"
#include "fig/FIG0.h"
#include "fig/FIG1.h"
#include "fig/FIG2.h"
#include <list>
#include <map>
#include <unordered_set>
#include <memory>
#include "MuxElements.h"
namespace FIC {
class FIGCarouselElement {
public:
IFIG* fig;
int deadline; // unit: ms
void reduce_deadline();
void increase_deadline();
/* Returns true if the repetition rate changed and the
* deadline was recalculated */
bool check_deadline();
private:
FIG_rate m_last_rate = FIG_rate::A;
};
enum class FIBAllocation {
FIB0,
FIB1,
FIB2,
FIB3,
FIB_ANY
};
class FIGCarousel {
public:
FIGCarousel(std::shared_ptr<dabEnsemble> ensemble);
void update(unsigned long currentFrame);
/* Write all FIBs to the buffer, including correct padding and crc.
* Returns number of bytes written.
*
* The buffer buf must be large enough to accomodate the FIBs, i.e.
* 32 bytes per FIB.
*/
size_t write_fibs(
uint8_t *buf,
int framephase,
bool fib3_present);
private:
size_t carousel(int fib, uint8_t *buf, size_t bufsize, int framephase);
void load_and_allocate(IFIG& fig, FIBAllocation fib);
std::unordered_set<std::string> m_missed_deadlines;
FIGRuntimeInformation m_rti;
// Some FIGs can be mapped to a specific FIB or to FIB_ANY
std::map<FIBAllocation, std::list<FIGCarouselElement> > m_fibs;
// See in ctor for allocation to FIBs
FIG0_0 m_fig0_0;
FIG0_1 m_fig0_1;
FIG0_2 m_fig0_2;
FIG0_3 m_fig0_3;
FIG0_5 m_fig0_5;
FIG0_6 m_fig0_6;
FIG0_7 m_fig0_7;
FIG0_17 m_fig0_17;
FIG0_8 m_fig0_8;
FIG1_0 m_fig1_0;
FIG0_13 m_fig0_13;
FIG0_14 m_fig0_14;
FIG0_10 m_fig0_10;
FIG0_9 m_fig0_9;
FIG1_1 m_fig1_1;
FIG1_4 m_fig1_4;
FIG1_5 m_fig1_5;
FIG0_18 m_fig0_18;
FIG0_19 m_fig0_19;
FIG0_21 m_fig0_21;
FIG0_24 m_fig0_24;
FIG2_0 m_fig2_0;
FIG2_1_and_5 m_fig2_1;
FIG2_1_and_5 m_fig2_5;
FIG2_4 m_fig2_4;
};
} // namespace FIC
#endif // __FIG_CAROUSEL_H_
|
