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
|
/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* Fluent Bit
* ==========
* Copyright (C) 2015-2023 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/flb_info.h>
#include <fluent-bit/flb_mem.h>
#include <fluent-bit/flb_log.h>
#include <fluent-bit/flb_sds.h>
#include "vivo.h"
#include "vivo_stream.h"
static inline void stream_lock(struct vivo_stream *vs)
{
pthread_mutex_lock(&vs->stream_mutex);
}
static inline void stream_unlock(struct vivo_stream *vs)
{
pthread_mutex_unlock(&vs->stream_mutex);
}
struct vivo_stream *vivo_stream_create(struct vivo_exporter *ctx)
{
struct vivo_stream *vs;
vs = flb_calloc(1, sizeof(struct vivo_stream));
if (!vs) {
flb_errno();
return NULL;
}
vs->parent = ctx;
vs->entries_added = 0;
pthread_mutex_init(&vs->stream_mutex, NULL);
mk_list_init(&vs->entries);
mk_list_init(&vs->purge);
return vs;
}
static uint64_t vivo_stream_get_new_id(struct vivo_stream *vs)
{
uint64_t id = 0;
stream_lock(vs);
/* to get the next id, we simply use the value of the counter 'entries' added */
id = vs->entries_added;
stream_unlock(vs);
return id;
}
struct vivo_stream_entry *vivo_stream_entry_create(struct vivo_stream *vs,
void *data, size_t size)
{
struct vivo_stream_entry *e;
if (size == 0) {
return NULL;
}
e = flb_calloc(1, sizeof(struct vivo_stream_entry));
if (!e) {
flb_errno();
return NULL;
}
e->id = vivo_stream_get_new_id(vs);
e->data = flb_sds_create_len(data, size);
if (!e->data) {
flb_free(e);
return NULL;
}
return e;
}
/*
* NOTE: this function must always invoked under the stream_mutex in a locked state, we don't do the lock
* inside the function since the caller might be itering the parent list
*/
static void vivo_stream_entry_destroy(struct vivo_stream *vs, struct vivo_stream_entry *e)
{
mk_list_del(&e->_head);
vs->current_bytes_size -= flb_sds_len(e->data);
flb_sds_destroy(e->data);
flb_free(e);
}
/* NOTE: this function must run inside a stream_lock()/stream_unlock() protection */
static void vivo_stream_cleanup(struct vivo_stream *vs)
{
struct mk_list *tmp;
struct mk_list *head;
struct vivo_stream_entry *e;
mk_list_foreach_safe(head, tmp, &vs->entries) {
e = mk_list_entry(head, struct vivo_stream_entry, _head);
vivo_stream_entry_destroy(vs, e);
}
}
void vivo_stream_destroy(struct vivo_stream *vs)
{
struct mk_list *tmp;
struct mk_list *head;
struct vivo_stream_entry *e;
stream_lock(vs);
mk_list_foreach_safe(head, tmp, &vs->entries) {
e = mk_list_entry(head, struct vivo_stream_entry, _head);
vivo_stream_entry_destroy(vs, e);
}
stream_unlock(vs);
flb_free(vs);
}
flb_sds_t vivo_stream_get_content(struct vivo_stream *vs, int64_t from, int64_t to,
int64_t limit,
int64_t *stream_start_id, int64_t *stream_end_id)
{
int64_t count = 0;
flb_sds_t buf;
struct mk_list *head;
struct vivo_stream_entry *e;
struct vivo_exporter *ctx = vs->parent;
buf = flb_sds_create_size(vs->current_bytes_size);
if (!buf) {
return NULL;
}
stream_lock(vs);
mk_list_foreach(head, &vs->entries) {
e = mk_list_entry(head, struct vivo_stream_entry, _head);
if (e->id < from && from != -1) {
continue;
}
if (e->id > to && to != -1 && to != 0) {
break;
}
if (count == 0) {
*stream_start_id = e->id;
}
flb_sds_cat_safe(&buf, e->data, flb_sds_len(e->data));
*stream_end_id = e->id;
count++;
if (limit > 0 && count >= limit) {
break;
}
}
if (ctx->empty_stream_on_read) {
vivo_stream_cleanup(vs);
}
stream_unlock(vs);
return buf;
}
/* Remove entries from the stream until cleanup 'size' bytes. This function is inside a stream_lock()/stream_unlock() */
static void vivo_stream_make_room(struct vivo_stream *vs, size_t size)
{
size_t deleted = 0;
struct mk_list *tmp;
struct mk_list *head;
struct vivo_stream_entry *e;
mk_list_foreach_safe(head, tmp, &vs->entries) {
e = mk_list_entry(head, struct vivo_stream_entry, _head);
deleted += flb_sds_len(e->data);
vivo_stream_entry_destroy(vs, e);
if (deleted >= size) {
break;
}
}
}
struct vivo_stream_entry *vivo_stream_append(struct vivo_stream *vs, void *data, size_t size)
{
struct vivo_stream_entry *e;
struct vivo_exporter *ctx = vs->parent;
e = vivo_stream_entry_create(vs, data, size);
if (!e) {
return NULL;
}
stream_lock(vs);
/* check queue space */
if (vs->current_bytes_size + size > ctx->stream_queue_size) {
/* free up some space */
if (mk_list_size(&vs->entries) == 0) {
/* do nothing, the user size setup is smaller that the incoming size, let it pass */
}
else {
/* release at least 'size' bytes */
vivo_stream_make_room(vs, size);
}
}
/* add entry to the end of the list */
mk_list_add(&e->_head, &vs->entries);
vs->entries_added++;
vs->current_bytes_size += size;
stream_unlock(vs);
return e;
}
|
