-
Notifications
You must be signed in to change notification settings - Fork 62
/
trimmer.c
1945 lines (1644 loc) · 50.9 KB
/
trimmer.c
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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* SPDX-License-Identifier: MIT
*
* Copyright 2016 Jérémie Galarneau <jeremie.galarneau@efficios.com>
* Copyright 2019 Philippe Proulx <pproulx@efficios.com>
*/
#define BT_LOG_OUTPUT_LEVEL (trimmer_comp->log_level)
#define BT_LOG_TAG "PLUGIN/FLT.UTILS.TRIMMER"
#include "logging/comp-logging.h"
#include "compat/utc.h"
#include "compat/time.h"
#include <babeltrace2/babeltrace.h>
#include "common/common.h"
#include "common/assert.h"
#include <stdbool.h>
#include <stdint.h>
#include <inttypes.h>
#include <glib.h>
#include "compat/glib.h"
#include "plugins/common/param-validation/param-validation.h"
#include "trimmer.h"
#define NS_PER_S INT64_C(1000000000)
static const char * const in_port_name = "in";
struct trimmer_time {
unsigned int hour, minute, second, ns;
};
struct trimmer_bound {
/*
* Nanoseconds from origin, valid if `is_set` is set and
* `is_infinite` is false.
*/
int64_t ns_from_origin;
/* True if this bound's full time (`ns_from_origin`) is set */
bool is_set;
/*
* True if this bound represents the infinity (negative or
* positive depending on which bound it is). If this is true,
* then we don't care about `ns_from_origin` above.
*/
bool is_infinite;
/*
* This bound's time without the date; this time is used to set
* `ns_from_origin` once we know the date.
*/
struct trimmer_time time;
};
struct trimmer_comp {
struct trimmer_bound begin, end;
bool is_gmt;
bt_logging_level log_level;
bt_self_component *self_comp;
bt_self_component_filter *self_comp_filter;
};
enum trimmer_iterator_state {
/*
* Find the first message's date and set the bounds's times
* accordingly.
*/
TRIMMER_ITERATOR_STATE_SET_BOUNDS_NS_FROM_ORIGIN,
/*
* Initially seek to the trimming range's beginning time.
*/
TRIMMER_ITERATOR_STATE_SEEK_INITIALLY,
/*
* Fill the output message queue for as long as received input
* messages are within the trimming time range.
*/
TRIMMER_ITERATOR_STATE_TRIM,
/* Flush the remaining messages in the output message queue */
TRIMMER_ITERATOR_STATE_ENDING,
/* Trimming operation and message iterator is ended */
TRIMMER_ITERATOR_STATE_ENDED,
};
struct trimmer_iterator {
/* Weak */
struct trimmer_comp *trimmer_comp;
/* Weak */
bt_self_message_iterator *self_msg_iter;
enum trimmer_iterator_state state;
/* Owned by this */
bt_message_iterator *upstream_iter;
struct trimmer_bound begin, end;
/*
* Queue of `const bt_message *` (owned by the queue).
*
* This is where the trimming operation pushes the messages to
* output by this message iterator.
*/
GQueue *output_messages;
/*
* Hash table of `bt_stream *` (weak) to
* `struct trimmer_iterator_stream_state *` (owned by the HT).
*/
GHashTable *stream_states;
};
struct trimmer_iterator_stream_state {
/* Weak */
const bt_stream *stream;
/* Have we seen a message with clock_snapshot going through this stream? */
bool seen_clock_snapshot;
/* Owned by this (`NULL` initially and between packets) */
const bt_packet *cur_packet;
};
static
void destroy_trimmer_comp(struct trimmer_comp *trimmer_comp)
{
BT_ASSERT(trimmer_comp);
g_free(trimmer_comp);
}
static
struct trimmer_comp *create_trimmer_comp(void)
{
return g_new0(struct trimmer_comp, 1);
}
BT_HIDDEN
void trimmer_finalize(bt_self_component_filter *self_comp)
{
struct trimmer_comp *trimmer_comp =
bt_self_component_get_data(
bt_self_component_filter_as_self_component(self_comp));
if (trimmer_comp) {
destroy_trimmer_comp(trimmer_comp);
}
}
/*
* Compile regex in `pattern`, and try to match `string`. If there's a match,
* return true and set `*match_info` to the list of matches. The list of
* matches must be freed by the caller. If there's no match, return false and
* set `*match_info` to NULL;
*/
static
bool compile_and_match(const char *pattern, const char *string, GMatchInfo **match_info) {
bool matches = false;
GError *regex_error = NULL;
GRegex *regex;
regex = g_regex_new(pattern, 0, 0, ®ex_error);
if (!regex) {
goto end;
}
matches = g_regex_match(regex, string, 0, match_info);
if (!matches) {
/*
* g_regex_match allocates `*match_info` even if it returns
* FALSE. If there's no match, we have no use for it, so free
* it immediatly and don't return it to the caller.
*/
g_match_info_free(*match_info);
*match_info = NULL;
}
g_regex_unref(regex);
end:
if (regex_error) {
g_error_free(regex_error);
}
return matches;
}
/*
* Convert the captured text in match number `match_num` in `match_info`
* to an unsigned integer.
*/
static
guint64 match_to_uint(const GMatchInfo *match_info, gint match_num) {
gchar *text, *endptr;
guint64 result;
text = g_match_info_fetch(match_info, match_num);
BT_ASSERT(text);
/*
* Because the input is carefully sanitized with regexes by the caller,
* we assume that g_ascii_strtoull cannot fail.
*/
errno = 0;
result = g_ascii_strtoull(text, &endptr, 10);
BT_ASSERT(endptr > text);
BT_ASSERT(errno == 0);
g_free(text);
return result;
}
/*
* When parsing the nanoseconds part, .512 means .512000000, not .000000512.
* This function is like match_to_uint, but multiplies the parsed number to get
* the expected result.
*/
static
guint64 match_to_uint_ns(const GMatchInfo *match_info, gint match_num) {
guint64 nanoseconds;
gboolean ret;
gint start_pos, end_pos, power;
static int pow10[] = {
1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000,
};
nanoseconds = match_to_uint(match_info, match_num);
/* Multiply by 10 as many times as there are omitted digits. */
ret = g_match_info_fetch_pos(match_info, match_num, &start_pos, &end_pos);
BT_ASSERT(ret);
power = 9 - (end_pos - start_pos);
BT_ASSERT(power >= 0 && power <= 8);
nanoseconds *= pow10[power];
return nanoseconds;
}
/*
* Sets the time (in ns from origin) of a trimmer bound from date and
* time components.
*
* Returns a negative value if anything goes wrong.
*/
static
int set_bound_ns_from_origin(struct trimmer_bound *bound,
unsigned int year, unsigned int month, unsigned int day,
unsigned int hour, unsigned int minute, unsigned int second,
unsigned int ns, bool is_gmt)
{
int ret = 0;
time_t result;
struct tm tm = {
.tm_sec = second,
.tm_min = minute,
.tm_hour = hour,
.tm_mday = day,
.tm_mon = month - 1,
.tm_year = year - 1900,
.tm_isdst = -1,
};
if (is_gmt) {
result = bt_timegm(&tm);
} else {
result = mktime(&tm);
}
if (result < 0) {
ret = -1;
goto end;
}
BT_ASSERT(bound);
bound->ns_from_origin = (int64_t) result;
bound->ns_from_origin *= NS_PER_S;
bound->ns_from_origin += ns;
bound->is_set = true;
end:
return ret;
}
/*
* Parses a timestamp, figuring out its format.
*
* Returns a negative value if anything goes wrong.
*
* Expected formats:
*
* YYYY-MM-DD hh:mm[:ss[.ns]]
* [hh:mm:]ss[.ns]
* [-]s[.ns]
*
* TODO: Check overflows.
*/
static
int set_bound_from_str(struct trimmer_comp *trimmer_comp,
const char *str, struct trimmer_bound *bound, bool is_gmt)
{
/* Matches YYYY-MM-DD */
#define DATE_RE "([0-9]{4})-([0-9]{2})-([0-9]{2})"
/* Matches HH:MM[:SS[.NS]] */
#define TIME_RE "([0-9]{2}):([0-9]{2})(?::([0-9]{2})(?:\\.([0-9]{1,9}))?)?"
/* Matches [-]SS[.NS] */
#define S_NS_RE "^(-?)([0-9]+)(?:\\.([0-9]{1,9}))?$"
GMatchInfo *match_info;
int ret = 0;
/* Try `YYYY-MM-DD hh:mm[:ss[.ns]]` format */
if (compile_and_match("^" DATE_RE " " TIME_RE "$", str, &match_info)) {
unsigned int year = 0, month = 0, day = 0, hours = 0, minutes = 0, seconds = 0, nanoseconds = 0;
gint match_count = g_match_info_get_match_count(match_info);
BT_ASSERT(match_count >= 6 && match_count <= 8);
year = match_to_uint(match_info, 1);
month = match_to_uint(match_info, 2);
day = match_to_uint(match_info, 3);
hours = match_to_uint(match_info, 4);
minutes = match_to_uint(match_info, 5);
if (match_count >= 7) {
seconds = match_to_uint(match_info, 6);
}
if (match_count >= 8) {
nanoseconds = match_to_uint_ns(match_info, 7);
}
set_bound_ns_from_origin(bound, year, month, day, hours, minutes, seconds, nanoseconds, is_gmt);
goto end;
}
if (compile_and_match("^" DATE_RE "$", str, &match_info)) {
unsigned int year = 0, month = 0, day = 0;
BT_ASSERT(g_match_info_get_match_count(match_info) == 4);
year = match_to_uint(match_info, 1);
month = match_to_uint(match_info, 2);
day = match_to_uint(match_info, 3);
set_bound_ns_from_origin(bound, year, month, day, 0, 0, 0, 0, is_gmt);
goto end;
}
/* Try `hh:mm[:ss[.ns]]` format */
if (compile_and_match("^" TIME_RE "$", str, &match_info)) {
gint match_count = g_match_info_get_match_count(match_info);
BT_ASSERT(match_count >= 3 && match_count <= 5);
bound->time.hour = match_to_uint(match_info, 1);
bound->time.minute = match_to_uint(match_info, 2);
if (match_count >= 4) {
bound->time.second = match_to_uint(match_info, 3);
}
if (match_count >= 5) {
bound->time.ns = match_to_uint_ns(match_info, 4);
}
goto end;
}
/* Try `[-]s[.ns]` format */
if (compile_and_match("^" S_NS_RE "$", str, &match_info)) {
gboolean is_neg, fetch_pos_ret;
gint start_pos, end_pos, match_count;
guint64 seconds, nanoseconds = 0;
match_count = g_match_info_get_match_count(match_info);
BT_ASSERT(match_count >= 3 && match_count <= 4);
/* Check for presence of negation sign. */
fetch_pos_ret = g_match_info_fetch_pos(match_info, 1, &start_pos, &end_pos);
BT_ASSERT(fetch_pos_ret);
is_neg = (end_pos - start_pos) > 0;
seconds = match_to_uint(match_info, 2);
if (match_count >= 4) {
nanoseconds = match_to_uint_ns(match_info, 3);
}
bound->ns_from_origin = seconds * NS_PER_S + nanoseconds;
if (is_neg) {
bound->ns_from_origin = -bound->ns_from_origin;
}
bound->is_set = true;
goto end;
}
BT_COMP_LOGE_APPEND_CAUSE(trimmer_comp->self_comp,
"Invalid date/time format: param=\"%s\"", str);
ret = -1;
end:
g_match_info_free(match_info);
return ret;
}
/*
* Sets a trimmer bound's properties from a parameter string/integer
* value.
*
* Returns a negative value if anything goes wrong.
*/
static
int set_bound_from_param(struct trimmer_comp *trimmer_comp,
const char *param_name, const bt_value *param,
struct trimmer_bound *bound, bool is_gmt)
{
int ret;
const char *arg;
char tmp_arg[64];
if (bt_value_is_signed_integer(param)) {
int64_t value = bt_value_integer_signed_get(param);
/*
* Just convert it to a temporary string to handle
* everything the same way.
*/
sprintf(tmp_arg, "%" PRId64, value);
arg = tmp_arg;
} else {
BT_ASSERT(bt_value_is_string(param));
arg = bt_value_string_get(param);
}
ret = set_bound_from_str(trimmer_comp, arg, bound, is_gmt);
return ret;
}
static
int validate_trimmer_bounds(struct trimmer_comp *trimmer_comp,
struct trimmer_bound *begin, struct trimmer_bound *end)
{
int ret = 0;
BT_ASSERT(begin->is_set);
BT_ASSERT(end->is_set);
if (!begin->is_infinite && !end->is_infinite &&
begin->ns_from_origin > end->ns_from_origin) {
BT_COMP_LOGE_APPEND_CAUSE(trimmer_comp->self_comp,
"Trimming time range's beginning time is greater than end time: "
"begin-ns-from-origin=%" PRId64 ", "
"end-ns-from-origin=%" PRId64,
begin->ns_from_origin,
end->ns_from_origin);
ret = -1;
goto end;
}
if (!begin->is_infinite && begin->ns_from_origin == INT64_MIN) {
BT_COMP_LOGE_APPEND_CAUSE(trimmer_comp->self_comp,
"Invalid trimming time range's beginning time: "
"ns-from-origin=%" PRId64,
begin->ns_from_origin);
ret = -1;
goto end;
}
if (!end->is_infinite && end->ns_from_origin == INT64_MIN) {
BT_COMP_LOGE_APPEND_CAUSE(trimmer_comp->self_comp,
"Invalid trimming time range's end time: "
"ns-from-origin=%" PRId64,
end->ns_from_origin);
ret = -1;
goto end;
}
end:
return ret;
}
static
enum bt_param_validation_status validate_bound_type(
const bt_value *value,
struct bt_param_validation_context *context)
{
enum bt_param_validation_status status = BT_PARAM_VALIDATION_STATUS_OK;
if (!bt_value_is_signed_integer(value) &&
!bt_value_is_string(value)) {
status = bt_param_validation_error(context,
"unexpected type: expected-types=[%s, %s], actual-type=%s",
bt_common_value_type_string(BT_VALUE_TYPE_SIGNED_INTEGER),
bt_common_value_type_string(BT_VALUE_TYPE_STRING),
bt_common_value_type_string(bt_value_get_type(value)));
}
return status;
}
static
struct bt_param_validation_map_value_entry_descr trimmer_params[] = {
{ "gmt", BT_PARAM_VALIDATION_MAP_VALUE_ENTRY_OPTIONAL, { .type = BT_VALUE_TYPE_BOOL } },
{ "begin", BT_PARAM_VALIDATION_MAP_VALUE_ENTRY_OPTIONAL, { .validation_func = validate_bound_type } },
{ "end", BT_PARAM_VALIDATION_MAP_VALUE_ENTRY_OPTIONAL, { .validation_func = validate_bound_type } },
BT_PARAM_VALIDATION_MAP_VALUE_ENTRY_END
};
static
bt_component_class_initialize_method_status init_trimmer_comp_from_params(
struct trimmer_comp *trimmer_comp,
const bt_value *params)
{
const bt_value *value;
bt_component_class_initialize_method_status status;
enum bt_param_validation_status validation_status;
gchar *validate_error = NULL;
validation_status = bt_param_validation_validate(params,
trimmer_params, &validate_error);
if (validation_status == BT_PARAM_VALIDATION_STATUS_MEMORY_ERROR) {
status = BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_MEMORY_ERROR;
goto end;
} else if (validation_status == BT_PARAM_VALIDATION_STATUS_VALIDATION_ERROR) {
status = BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_ERROR;
BT_COMP_LOGE_APPEND_CAUSE(trimmer_comp->self_comp, "%s",
validate_error);
goto end;
}
BT_ASSERT(params);
value = bt_value_map_borrow_entry_value_const(params, "gmt");
if (value) {
trimmer_comp->is_gmt = (bool) bt_value_bool_get(value);
}
value = bt_value_map_borrow_entry_value_const(params, "begin");
if (value) {
if (set_bound_from_param(trimmer_comp, "begin", value,
&trimmer_comp->begin, trimmer_comp->is_gmt)) {
/* set_bound_from_param() logs errors */
status = BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_ERROR;
goto end;
}
} else {
trimmer_comp->begin.is_infinite = true;
trimmer_comp->begin.is_set = true;
}
value = bt_value_map_borrow_entry_value_const(params, "end");
if (value) {
if (set_bound_from_param(trimmer_comp, "end", value,
&trimmer_comp->end, trimmer_comp->is_gmt)) {
/* set_bound_from_param() logs errors */
status = BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_ERROR;
goto end;
}
} else {
trimmer_comp->end.is_infinite = true;
trimmer_comp->end.is_set = true;
}
if (trimmer_comp->begin.is_set && trimmer_comp->end.is_set) {
/* validate_trimmer_bounds() logs errors */
if (validate_trimmer_bounds(trimmer_comp,
&trimmer_comp->begin, &trimmer_comp->end)) {
status = BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_ERROR;
goto end;
}
}
status = BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_OK;
end:
g_free(validate_error);
return status;
}
bt_component_class_initialize_method_status trimmer_init(
bt_self_component_filter *self_comp_flt,
bt_self_component_filter_configuration *config,
const bt_value *params, void *init_data)
{
bt_component_class_initialize_method_status status;
bt_self_component_add_port_status add_port_status;
struct trimmer_comp *trimmer_comp = create_trimmer_comp();
bt_self_component *self_comp =
bt_self_component_filter_as_self_component(self_comp_flt);
if (!trimmer_comp) {
status = BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_MEMORY_ERROR;
goto error;
}
trimmer_comp->log_level = bt_component_get_logging_level(
bt_self_component_as_component(self_comp));
trimmer_comp->self_comp = self_comp;
trimmer_comp->self_comp_filter = self_comp_flt;
add_port_status = bt_self_component_filter_add_input_port(
self_comp_flt, in_port_name, NULL, NULL);
if (add_port_status != BT_SELF_COMPONENT_ADD_PORT_STATUS_OK) {
status = (int) add_port_status;
goto error;
}
add_port_status = bt_self_component_filter_add_output_port(
self_comp_flt, "out", NULL, NULL);
if (add_port_status != BT_SELF_COMPONENT_ADD_PORT_STATUS_OK) {
status = (int) add_port_status;
goto error;
}
status = init_trimmer_comp_from_params(trimmer_comp, params);
if (status != BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_OK) {
goto error;
}
bt_self_component_set_data(self_comp, trimmer_comp);
status = BT_COMPONENT_CLASS_INITIALIZE_METHOD_STATUS_OK;
goto end;
error:
if (trimmer_comp) {
destroy_trimmer_comp(trimmer_comp);
}
end:
return status;
}
static
void destroy_trimmer_iterator(struct trimmer_iterator *trimmer_it)
{
if (!trimmer_it) {
goto end;
}
bt_message_iterator_put_ref(
trimmer_it->upstream_iter);
if (trimmer_it->output_messages) {
g_queue_free(trimmer_it->output_messages);
}
if (trimmer_it->stream_states) {
g_hash_table_destroy(trimmer_it->stream_states);
}
g_free(trimmer_it);
end:
return;
}
static
void destroy_trimmer_iterator_stream_state(
struct trimmer_iterator_stream_state *sstate)
{
BT_ASSERT(sstate);
BT_PACKET_PUT_REF_AND_RESET(sstate->cur_packet);
g_free(sstate);
}
BT_HIDDEN
bt_message_iterator_class_initialize_method_status trimmer_msg_iter_init(
bt_self_message_iterator *self_msg_iter,
bt_self_message_iterator_configuration *config,
bt_self_component_port_output *port)
{
bt_message_iterator_class_initialize_method_status status;
bt_message_iterator_create_from_message_iterator_status
msg_iter_status;
struct trimmer_iterator *trimmer_it;
bt_self_component *self_comp =
bt_self_message_iterator_borrow_component(self_msg_iter);
trimmer_it = g_new0(struct trimmer_iterator, 1);
if (!trimmer_it) {
status = BT_MESSAGE_ITERATOR_CLASS_INITIALIZE_METHOD_STATUS_MEMORY_ERROR;
goto error;
}
trimmer_it->trimmer_comp = bt_self_component_get_data(self_comp);
BT_ASSERT(trimmer_it->trimmer_comp);
if (trimmer_it->trimmer_comp->begin.is_set &&
trimmer_it->trimmer_comp->end.is_set) {
/*
* Both trimming time range's bounds are set, so skip
* the
* `TRIMMER_ITERATOR_STATE_SET_BOUNDS_NS_FROM_ORIGIN`
* phase.
*/
trimmer_it->state = TRIMMER_ITERATOR_STATE_SEEK_INITIALLY;
}
trimmer_it->begin = trimmer_it->trimmer_comp->begin;
trimmer_it->end = trimmer_it->trimmer_comp->end;
msg_iter_status =
bt_message_iterator_create_from_message_iterator(
self_msg_iter,
bt_self_component_filter_borrow_input_port_by_name(
trimmer_it->trimmer_comp->self_comp_filter, in_port_name),
&trimmer_it->upstream_iter);
if (msg_iter_status != BT_MESSAGE_ITERATOR_CREATE_FROM_MESSAGE_ITERATOR_STATUS_OK) {
status = (int) msg_iter_status;
goto error;
}
trimmer_it->output_messages = g_queue_new();
if (!trimmer_it->output_messages) {
status = BT_MESSAGE_ITERATOR_CLASS_INITIALIZE_METHOD_STATUS_MEMORY_ERROR;
goto error;
}
trimmer_it->stream_states = g_hash_table_new_full(g_direct_hash,
g_direct_equal, NULL,
(GDestroyNotify) destroy_trimmer_iterator_stream_state);
if (!trimmer_it->stream_states) {
status = BT_MESSAGE_ITERATOR_CLASS_INITIALIZE_METHOD_STATUS_MEMORY_ERROR;
goto error;
}
/*
* The trimmer requires upstream messages to have times, so it can
* always seek forward.
*/
bt_self_message_iterator_configuration_set_can_seek_forward(
config, BT_TRUE);
trimmer_it->self_msg_iter = self_msg_iter;
bt_self_message_iterator_set_data(self_msg_iter, trimmer_it);
status = BT_MESSAGE_ITERATOR_CLASS_INITIALIZE_METHOD_STATUS_OK;
goto end;
error:
destroy_trimmer_iterator(trimmer_it);
end:
return status;
}
static inline
int get_msg_ns_from_origin(const bt_message *msg, int64_t *ns_from_origin,
bool *has_clock_snapshot)
{
const bt_clock_class *clock_class = NULL;
const bt_clock_snapshot *clock_snapshot = NULL;
int ret = 0;
BT_ASSERT_DBG(msg);
BT_ASSERT_DBG(ns_from_origin);
BT_ASSERT_DBG(has_clock_snapshot);
switch (bt_message_get_type(msg)) {
case BT_MESSAGE_TYPE_EVENT:
clock_class =
bt_message_event_borrow_stream_class_default_clock_class_const(
msg);
if (G_UNLIKELY(!clock_class)) {
goto error;
}
clock_snapshot = bt_message_event_borrow_default_clock_snapshot_const(
msg);
break;
case BT_MESSAGE_TYPE_PACKET_BEGINNING:
clock_class =
bt_message_packet_beginning_borrow_stream_class_default_clock_class_const(
msg);
if (G_UNLIKELY(!clock_class)) {
goto error;
}
clock_snapshot = bt_message_packet_beginning_borrow_default_clock_snapshot_const(
msg);
break;
case BT_MESSAGE_TYPE_PACKET_END:
clock_class =
bt_message_packet_end_borrow_stream_class_default_clock_class_const(
msg);
if (G_UNLIKELY(!clock_class)) {
goto error;
}
clock_snapshot = bt_message_packet_end_borrow_default_clock_snapshot_const(
msg);
break;
case BT_MESSAGE_TYPE_STREAM_BEGINNING:
{
enum bt_message_stream_clock_snapshot_state cs_state;
clock_class =
bt_message_stream_beginning_borrow_stream_class_default_clock_class_const(msg);
if (G_UNLIKELY(!clock_class)) {
goto error;
}
cs_state = bt_message_stream_beginning_borrow_default_clock_snapshot_const(msg, &clock_snapshot);
if (cs_state != BT_MESSAGE_STREAM_CLOCK_SNAPSHOT_STATE_KNOWN) {
goto no_clock_snapshot;
}
break;
}
case BT_MESSAGE_TYPE_STREAM_END:
{
enum bt_message_stream_clock_snapshot_state cs_state;
clock_class =
bt_message_stream_end_borrow_stream_class_default_clock_class_const(msg);
if (G_UNLIKELY(!clock_class)) {
goto error;
}
cs_state = bt_message_stream_end_borrow_default_clock_snapshot_const(msg, &clock_snapshot);
if (cs_state != BT_MESSAGE_STREAM_CLOCK_SNAPSHOT_STATE_KNOWN) {
goto no_clock_snapshot;
}
break;
}
case BT_MESSAGE_TYPE_DISCARDED_EVENTS:
clock_class =
bt_message_discarded_events_borrow_stream_class_default_clock_class_const(
msg);
if (G_UNLIKELY(!clock_class)) {
goto error;
}
clock_snapshot = bt_message_discarded_events_borrow_beginning_default_clock_snapshot_const(
msg);
break;
case BT_MESSAGE_TYPE_DISCARDED_PACKETS:
clock_class =
bt_message_discarded_packets_borrow_stream_class_default_clock_class_const(
msg);
if (G_UNLIKELY(!clock_class)) {
goto error;
}
clock_snapshot = bt_message_discarded_packets_borrow_beginning_default_clock_snapshot_const(
msg);
break;
case BT_MESSAGE_TYPE_MESSAGE_ITERATOR_INACTIVITY:
clock_snapshot =
bt_message_message_iterator_inactivity_borrow_clock_snapshot_const(
msg);
break;
default:
goto no_clock_snapshot;
}
ret = bt_clock_snapshot_get_ns_from_origin(clock_snapshot,
ns_from_origin);
if (G_UNLIKELY(ret)) {
goto error;
}
*has_clock_snapshot = true;
goto end;
no_clock_snapshot:
*has_clock_snapshot = false;
goto end;
error:
ret = -1;
end:
return ret;
}
static inline
void put_messages(bt_message_array_const msgs, uint64_t count)
{
uint64_t i;
for (i = 0; i < count; i++) {
BT_MESSAGE_PUT_REF_AND_RESET(msgs[i]);
}
}
static inline
int set_trimmer_iterator_bound(struct trimmer_iterator *trimmer_it,
struct trimmer_bound *bound, int64_t ns_from_origin,
bool is_gmt)
{
struct trimmer_comp *trimmer_comp = trimmer_it->trimmer_comp;
struct tm tm;
struct tm *res;
time_t time_seconds = (time_t) (ns_from_origin / NS_PER_S);
int ret = 0;
BT_ASSERT(!bound->is_set);
errno = 0;
/* We only need to extract the date from this time */
if (is_gmt) {
res = bt_gmtime_r(&time_seconds, &tm);
} else {
res = bt_localtime_r(&time_seconds, &tm);
}
if (!res) {
BT_COMP_LOGE_APPEND_CAUSE_ERRNO(trimmer_comp->self_comp,
"Cannot convert timestamp to date and time",
": ts=%" PRId64, (int64_t) time_seconds);
ret = -1;
goto end;
}
ret = set_bound_ns_from_origin(bound, tm.tm_year + 1900, tm.tm_mon + 1,
tm.tm_mday, bound->time.hour, bound->time.minute,
bound->time.second, bound->time.ns, is_gmt);
end:
return ret;
}
static
bt_message_iterator_class_next_method_status
state_set_trimmer_iterator_bounds(
struct trimmer_iterator *trimmer_it)
{
bt_message_iterator_next_status upstream_iter_status =
BT_MESSAGE_ITERATOR_NEXT_STATUS_OK;
struct trimmer_comp *trimmer_comp = trimmer_it->trimmer_comp;
bt_message_array_const msgs;
uint64_t count = 0;
int64_t ns_from_origin = INT64_MIN;
uint64_t i;
int ret;
BT_ASSERT(!trimmer_it->begin.is_set ||
!trimmer_it->end.is_set);
while (true) {
upstream_iter_status =
bt_message_iterator_next(
trimmer_it->upstream_iter, &msgs, &count);
if (upstream_iter_status != BT_MESSAGE_ITERATOR_NEXT_STATUS_OK) {
goto end;
}
for (i = 0; i < count; i++) {
const bt_message *msg = msgs[i];
bool has_ns_from_origin;
ret = get_msg_ns_from_origin(msg, &ns_from_origin,
&has_ns_from_origin);
if (ret) {
goto error;
}
if (!has_ns_from_origin) {
continue;
}
BT_ASSERT_DBG(ns_from_origin != INT64_MIN &&
ns_from_origin != INT64_MAX);
put_messages(msgs, count);
goto found;
}
put_messages(msgs, count);
}
found:
if (!trimmer_it->begin.is_set) {
BT_ASSERT(!trimmer_it->begin.is_infinite);
ret = set_trimmer_iterator_bound(trimmer_it, &trimmer_it->begin,
ns_from_origin, trimmer_comp->is_gmt);
if (ret) {
goto error;
}
}
if (!trimmer_it->end.is_set) {
BT_ASSERT(!trimmer_it->end.is_infinite);
ret = set_trimmer_iterator_bound(trimmer_it, &trimmer_it->end,
ns_from_origin, trimmer_comp->is_gmt);