blob: 408e28b7b562c5d90752f9cb145880c6dbca61ae (
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
|
//
// Copyright 2012 Josh Blum
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#ifndef INCLUDED_LIBGRAS_TAG_HANDLERS_HPP
#define INCLUDED_LIBGRAS_TAG_HANDLERS_HPP
#include <gras_impl/block_actor.hpp>
#include <algorithm>
namespace gras
{
GRAS_FORCE_INLINE void BlockActor::sort_tags(const size_t i)
{
if (not this->input_tags_changed[i]) return;
std::vector<Tag> &tags_i = this->input_tags[i];
std::sort(tags_i.begin(), tags_i.end());
this->input_tags_changed[i] = false;
}
GRAS_FORCE_INLINE void BlockActor::trim_tags(const size_t i)
{
const size_t num_outputs = this->get_num_outputs();
//------------------------------------------------------------------
//-- trim the input tags that are past the consumption zone
//-- and post trimmed tags to the downstream based on policy
//------------------------------------------------------------------
std::vector<Tag> &tags_i = this->input_tags[i];
const size_t items_consumed_i = this->items_consumed[i];
size_t last = 0;
while (last < tags_i.size() and tags_i[last].offset < items_consumed_i)
{
last++;
}
//follow the tag propagation policy before erasure
switch (this->tag_prop_policy)
{
case Block::TPP_DONT: break; //well that was ez
case Block::TPP_ALL_TO_ALL:
for (size_t out_i = 0; out_i < num_outputs; out_i++)
{
for (size_t tag_i = 0; tag_i < last; tag_i++)
{
Tag t = tags_i[tag_i];
t.offset = myullround(t.offset * this->relative_rate);
this->post_downstream(out_i, InputTagMessage(t));
}
}
break;
case Block::TPP_ONE_TO_ONE:
if (i < num_outputs)
{
for (size_t tag_i = 0; tag_i < last; tag_i++)
{
Tag t = tags_i[tag_i];
t.offset = myullround(t.offset * this->relative_rate);
this->post_downstream(i, InputTagMessage(t));
}
}
break;
};
//now its safe to perform the erasure
if (last != 0) tags_i.erase(tags_i.begin(), tags_i.begin()+last);
}
} //namespace gras
#endif /*INCLUDED_LIBGRAS_TAG_HANDLERS_HPP*/
|
