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
|
/*
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) 2015
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/>.
*/
#include "fig/FIGCarousel.h"
#include <iostream>
/**************** FIGCarouselElement ****************/
void FIGCarouselElement::reduce_deadline()
{
deadline -= 24; //ms
}
void FIGCarouselElement::increase_deadline()
{
deadline += rate_increment_ms(fig->repetition_rate());
std::cerr << "FIG " << fig->name() <<
" deadline: " << deadline << std::endl;
if (deadline < 0) {
std::cerr << "FIG " << fig->name() <<
" has negative scheduling deadline" << std::endl;
}
}
/**************** FIGCarousel *****************/
FIGCarousel::FIGCarousel(boost::shared_ptr<dabEnsemble> ensemble) :
m_rti(ensemble),
m_fig0_0(&m_rti),
m_fig0_1(&m_rti),
m_fig0_2(&m_rti),
m_fig0_3(&m_rti),
m_fig0_17(&m_rti)
{
m_figs_available[std::make_pair(0, 0)] = &m_fig0_0;
m_figs_available[std::make_pair(0, 1)] = &m_fig0_1;
m_figs_available[std::make_pair(0, 2)] = &m_fig0_2;
m_figs_available[std::make_pair(0, 3)] = &m_fig0_3;
m_figs_available[std::make_pair(0, 17)] = &m_fig0_17;
const int fib0 = 0;
allocate_fig_to_fib(0, 0, fib0);
allocate_fig_to_fib(0, 1, fib0);
allocate_fig_to_fib(0, 2, fib0);
allocate_fig_to_fib(0, 3, fib0);
allocate_fig_to_fib(0, 17, fib0);
}
void FIGCarousel::set_currentFrame(unsigned long currentFrame)
{
m_rti.currentFrame = currentFrame;
}
void FIGCarousel::allocate_fig_to_fib(int figtype, int extension, int fib)
{
if (fib < 0 or fib >= 3) {
throw std::out_of_range("Invalid FIB");
}
auto fig = m_figs_available.find(std::make_pair(figtype, extension));
if (fig != m_figs_available.end()) {
FIGCarouselElement el;
el.fig = fig->second;
el.deadline = 0;
m_fibs[fib].push_back(el);
}
else {
std::stringstream ss;
ss << "No FIG " << figtype << "/" << extension << " available";
throw std::runtime_error(ss.str());
}
}
size_t FIGCarousel::fib0(uint8_t *buf, size_t bufsize, int framephase) {
std::list<FIGCarouselElement> figs = m_fibs[0];
std::cerr << "fib0(framephase=" << framephase << ")" << std::endl;
std::vector<FIGCarouselElement> sorted_figs;
/* Decrement all deadlines */
for (auto& fig_el : figs) {
fig_el.reduce_deadline();
sorted_figs.push_back(fig_el);
}
/* Sort the FIGs in the FIB according to their deadline */
std::sort(sorted_figs.begin(), sorted_figs.end(),
[]( const FIGCarouselElement& left,
const FIGCarouselElement& right) {
return left.deadline < right.deadline;
});
/* Data structure to carry FIB */
size_t available_size = bufsize;
/* Take special care for FIG0/0 */
auto fig0_0 = find_if(sorted_figs.begin(), sorted_figs.end(),
[](const FIGCarouselElement& f) {
return f.fig->repetition_rate() == FIG_rate::FIG0_0;
});
if (fig0_0 != sorted_figs.end()) {
std::cerr << "Special FIG 0/0" << std::endl;
sorted_figs.erase(fig0_0);
if (framephase == 0) { // TODO check for all TM
size_t written = fig0_0->fig->fill(buf, available_size);
if (written > 0) {
available_size -= written;
buf += written;
}
else {
throw std::runtime_error("Failed to write FIG0/0");
}
}
}
for (auto& fig : sorted_figs) {
std::cerr << " FIG:" << fig.fig->name() << std::endl;
}
/* Fill the FIB with the FIGs, taking the earliest deadline first */
while (available_size > 0 and not sorted_figs.empty()) {
auto fig_el = sorted_figs.begin();
size_t written = fig_el->fig->fill(buf, available_size);
if (written > 0) {
available_size -= written;
buf += written;
fig_el->increase_deadline();
}
sorted_figs.erase(fig_el);
}
return bufsize - available_size;
}
|
