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
|
/* -*- 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 <stdio.h>
#include <sys/types.h>
#include <fluent-bit/flb_time.h>
#include <fluent-bit/flb_mem.h>
#include <fluent-bit/flb_log.h>
#include "window.h"
#include "throttle.h"
struct throttle_window *window_create(size_t size) {
struct throttle_window *tw;
if (size <= 0) {
return NULL;
}
tw = flb_malloc(sizeof(struct throttle_window));
if (!tw) {
flb_errno();
return NULL;
}
tw->size = size;
tw->total = 0;
tw->current_timestamp = 0;
tw->max_index = -1;
tw->table = flb_calloc(size, sizeof(struct throttle_pane));
if (!tw->table) {
flb_errno();
flb_free(tw);
return NULL;
}
return tw;
}
int window_get(struct throttle_window *tw, long timestamp) {
int i;
for (i=0; i< tw->size; i++ ) {
if (tw->table[i].timestamp == timestamp) {
return i;
}
}
return NOT_FOUND;
}
int window_add(struct throttle_window *tw, long timestamp, int val) {
int i, index, size;
int sum = 0;
tw->current_timestamp = timestamp;
size = tw->size;
index = window_get(tw, timestamp);
if (index == NOT_FOUND) {
if (size - 1 == tw->max_index) {
/* window must be shifted */
tw->max_index = -1;
}
tw->max_index += 1;
tw->table[tw->max_index].timestamp= timestamp;
tw->table[tw->max_index].counter = val;
} else {
tw->table[index].counter += val;
}
for (i=0; i < tw->size; i++ ) {
sum += tw->table[i].counter;
flb_debug("timestamp: %ld, value: %ld",
tw->table[i].timestamp, tw->table[i].counter);
}
tw->total = sum;
flb_debug("total: %i", tw->total);
return 0;
}
|
