forked from AliceO2Group/AliceO2
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDataModelViews.h
More file actions
239 lines (222 loc) · 7.5 KB
/
DataModelViews.h
File metadata and controls
239 lines (222 loc) · 7.5 KB
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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
// Copyright 2019-2025 CERN and copyright holders of ALICE O2.
// See https://alice-o2.web.cern.ch/copyright for details of the copyright holders.
// All rights not expressly granted are reserved.
//
// This software is distributed under the terms of the GNU General Public
// License v3 (GPL Version 3), copied verbatim in the file "COPYING".
//
// In applying this license CERN does not waive the privileges and immunities
// granted to it by virtue of its status as an Intergovernmental Organization
// or submit itself to any jurisdiction.
#ifndef O2_FRAMEWORK_DATASPECVIEWS_H_
#define O2_FRAMEWORK_DATASPECVIEWS_H_
#include <fairmq/FwdDecls.h>
#include <fairmq/Message.h>
#include "DomainInfoHeader.h"
#include "SourceInfoHeader.h"
#include "Headers/DataHeader.h"
#include <ranges>
namespace o2::framework
{
struct count_payloads {
// ends the pipeline, returns the container
template <typename R>
requires std::ranges::random_access_range<R> && std::ranges::sized_range<R>
friend size_t operator|(R&& r, count_payloads self)
{
size_t count = 0;
size_t mi = 0;
while (mi < r.size()) {
auto* header = o2::header::get<o2::header::DataHeader*>(r[mi]->GetData());
if (!header) {
throw std::runtime_error("Not a DataHeader");
}
if (header->splitPayloadParts > 1 && header->splitPayloadIndex == header->splitPayloadParts) {
count += header->splitPayloadParts;
mi += header->splitPayloadParts + 1;
} else {
count += header->splitPayloadParts ? header->splitPayloadParts : 1;
mi += header->splitPayloadParts ? 2 * header->splitPayloadParts : 2;
}
}
return count;
}
};
struct count_parts {
// ends the pipeline, returns the number of parts
template <typename R>
requires std::ranges::random_access_range<R> && std::ranges::sized_range<R>
friend size_t operator|(R&& r, count_parts self)
{
size_t count = 0;
size_t mi = 0;
while (mi < r.size()) {
auto* header = o2::header::get<o2::header::DataHeader*>(r[mi]->GetData());
auto* sih = o2::header::get<o2::framework::SourceInfoHeader*>(r[mi]->GetData());
auto* dih = o2::header::get<o2::framework::DomainInfoHeader*>(r[mi]->GetData());
if (!header && !sih && !dih) {
throw std::runtime_error("Header information not found");
}
// We skip oldest possible timeframe / end of stream and not consider it
// as actual parts.
if (dih || sih) {
count += 1;
mi += 2;
} else if (header->splitPayloadParts > 1 && header->splitPayloadIndex == header->splitPayloadParts) {
count += 1;
mi += header->splitPayloadParts + 1;
} else {
count += header->splitPayloadParts;
mi += header->splitPayloadParts ? 2 * header->splitPayloadParts : 2;
}
}
return count;
}
};
struct DataRefIndices {
size_t headerIdx;
size_t payloadIdx;
};
struct get_pair {
size_t pairId;
template <typename R>
requires std::ranges::random_access_range<R> && std::ranges::sized_range<R>
friend DataRefIndices operator|(R&& r, get_pair self)
{
size_t count = 0;
size_t mi = 0;
while (mi < r.size()) {
auto* header = o2::header::get<o2::header::DataHeader*>(r[mi]->GetData());
if (!header) {
throw std::runtime_error("Not a DataHeader");
}
size_t diff = self.pairId - count;
if (header->splitPayloadParts > 1 && header->splitPayloadIndex == header->splitPayloadParts) {
count += header->splitPayloadParts;
if (self.pairId < count) {
return {mi, mi + 1 + diff};
}
mi += header->splitPayloadParts + 1;
} else {
count += header->splitPayloadParts ? header->splitPayloadParts : 1;
if (self.pairId < count) {
return {mi, mi + 2 * diff + 1};
}
mi += header->splitPayloadParts ? 2 * header->splitPayloadParts : 2;
}
}
throw std::runtime_error("Payload not found");
}
};
struct get_dataref_indices {
size_t part;
size_t subPart;
// ends the pipeline, returns the number of parts
template <typename R>
requires std::ranges::random_access_range<R> && std::ranges::sized_range<R>
friend DataRefIndices operator|(R&& r, get_dataref_indices self)
{
size_t count = 0;
size_t mi = 0;
while (mi < r.size()) {
auto* header = o2::header::get<o2::header::DataHeader*>(r[mi]->GetData());
if (!header) {
throw std::runtime_error("Not a DataHeader");
}
if (header->splitPayloadParts > 1 && header->splitPayloadIndex == header->splitPayloadParts) {
if (self.part == count) {
return {mi, mi + 1 + self.subPart};
}
count += 1;
mi += header->splitPayloadParts + 1;
} else {
if (self.part == count) {
return {mi, mi + 2 * self.subPart + 1};
}
count += 1;
mi += header->splitPayloadParts ? 2 * header->splitPayloadParts : 2;
}
}
throw std::runtime_error("Payload not found");
}
};
struct get_header {
size_t id;
// ends the pipeline, returns the number of parts
template <typename R>
requires std::ranges::random_access_range<R> && std::ranges::sized_range<R>
friend fair::mq::MessagePtr& operator|(R&& r, get_header self)
{
return r[(r | get_dataref_indices{self.id, 0}).headerIdx];
}
};
struct get_payload {
size_t part;
size_t subPart;
// ends the pipeline, returns the number of parts
template <typename R>
requires std::ranges::random_access_range<R> && std::ranges::sized_range<R>
friend fair::mq::MessagePtr& operator|(R&& r, get_payload self)
{
return r[(r | get_dataref_indices{self.part, self.subPart}).payloadIdx];
}
};
struct get_num_payloads {
size_t id;
// ends the pipeline, returns the number of parts
template <typename R>
requires std::ranges::random_access_range<R> && std::ranges::sized_range<R>
friend size_t operator|(R&& r, get_num_payloads self)
{
size_t count = 0;
size_t mi = 0;
while (mi < r.size()) {
auto* header = o2::header::get<o2::header::DataHeader*>(r[mi]->GetData());
if (!header) {
throw std::runtime_error("Not a DataHeader");
}
if (self.id == count) {
if (header->splitPayloadParts > 1 && (header->splitPayloadIndex == header->splitPayloadParts)) {
return header->splitPayloadParts;
} else {
return 1;
}
}
if (header->splitPayloadParts > 1 && (header->splitPayloadIndex == header->splitPayloadParts)) {
count += 1;
mi += header->splitPayloadParts + 1;
} else {
count += 1;
mi += header->splitPayloadParts ? 2 * header->splitPayloadParts : 2;
}
}
return 0;
}
};
struct MessageSet;
struct MessageStore {
std::span<MessageSet> sets;
size_t inputsPerSlot = 0;
};
struct inputs_for_slot {
TimesliceSlot slot;
template <typename R>
requires requires(R r) { std::ranges::random_access_range<decltype(r.sets)>; }
friend std::span<o2::framework::MessageSet> operator|(R&& r, inputs_for_slot self)
{
return std::span(r.sets[self.slot.index * r.inputsPerSlot]);
}
};
struct messages_for_input {
size_t inputIdx;
template <typename R>
requires std::ranges::random_access_range<R>
friend std::span<fair::mq::MessagePtr> operator|(R&& r, messages_for_input self)
{
return r[self.inputIdx].messages;
}
};
// FIXME: we should use special index classes in place of size_t
// FIXME: we need something to substitute a range in the store with another
} // namespace o2::framework
#endif // O2_FRAMEWORK_DATASPECVIEWS_H_