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
|
/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* Fluent Bit
* ==========
* Copyright (C) 2015-2022 The Fluent Bit Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <fluent-bit/stream_processor/flb_sp.h>
#include <fluent-bit/stream_processor/flb_sp_window.h>
#include <fluent-bit/stream_processor/flb_sp_parser.h>
#include <fluent-bit/stream_processor/flb_sp_groupby.h>
#include <fluent-bit/stream_processor/flb_sp_aggregate_func.h>
void flb_sp_window_prune(struct flb_sp_task *task)
{
int i;
int map_entries;
rb_result_t result;
struct aggregate_node *aggr_node;
struct aggregate_node *aggr_node_hs;
struct mk_list *tmp;
struct mk_list *head;
struct flb_sp_hopping_slot *hs;
struct rb_tree_node *rb_result;
struct flb_sp_cmd_key *ckey;
struct flb_sp_cmd *cmd = task->cmd;
switch (task->window.type) {
case FLB_SP_WINDOW_DEFAULT:
case FLB_SP_WINDOW_TUMBLING:
if (task->window.records > 0) {
mk_list_foreach_safe(head, tmp, &task->window.aggregate_list) {
aggr_node = mk_list_entry(head, struct aggregate_node, _head);
mk_list_del(&aggr_node->_head);
flb_sp_aggregate_node_destroy(cmd, aggr_node);
}
rb_tree_destroy(&task->window.aggregate_tree);
mk_list_init(&task->window.aggregate_list);
rb_tree_new(&task->window.aggregate_tree, flb_sp_groupby_compare);
task->window.records = 0;
}
break;
case FLB_SP_WINDOW_HOPPING:
if (mk_list_size(&task->window.hopping_slot) == 0) {
return;
}
hs = mk_list_entry_first(&task->window.hopping_slot,
struct flb_sp_hopping_slot, _head);
mk_list_foreach_safe(head, tmp, &task->window.aggregate_list) {
aggr_node = mk_list_entry(head, struct aggregate_node, _head);
result = rb_tree_find(&hs->aggregate_tree, aggr_node, &rb_result);
if (result == RB_OK) {
aggr_node_hs = mk_list_entry(rb_result, struct aggregate_node, _rb_head);
if (aggr_node_hs->records == aggr_node->records) {
rb_tree_remove(&task->window.aggregate_tree, &aggr_node->_rb_head);
mk_list_del(&aggr_node->_head);
// Destroy aggregation node
flb_sp_aggregate_node_destroy(cmd, aggr_node);
}
else {
aggr_node->records -= aggr_node_hs->records;
map_entries = mk_list_size(&cmd->keys);
ckey = mk_list_entry_first(&cmd->keys,
struct flb_sp_cmd_key, _head);
for (i = 0; i < map_entries; i++) {
if (ckey->aggr_func) {
aggregate_func_remove[ckey->aggr_func - 1](aggr_node, aggr_node_hs, i);
}
ckey = mk_list_entry_next(&ckey->_head, struct flb_sp_cmd_key,
_head, &cmd->keys);
}
}
}
}
task->window.records -= hs->records;
/* Destroy hopping slot */
mk_list_foreach_safe(head, tmp, &hs->aggregate_list) {
aggr_node_hs = mk_list_entry(head, struct aggregate_node, _head);
mk_list_del(&aggr_node_hs->_head);
flb_sp_aggregate_node_destroy(cmd, aggr_node_hs);
}
rb_tree_destroy(&hs->aggregate_tree);
mk_list_del(&hs->_head);
flb_free(hs);
break;
}
}
int flb_sp_window_populate(struct flb_sp_task *task, const char *buf_data,
size_t buf_size)
{
switch (task->window.type) {
case FLB_SP_WINDOW_DEFAULT:
case FLB_SP_WINDOW_TUMBLING:
case FLB_SP_WINDOW_HOPPING:
break;
default:
flb_error("[sp] error populating window for '%s': window type unknown",
task->name);
return -1;
}
return 0;
}
|
