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
|
/* -*- 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/flb_info.h>
#include <fluent-bit/flb_input.h>
#include <fluent-bit/flb_input_chunk.h>
#include <fluent-bit/flb_task.h>
#include <fluent-bit/flb_config.h>
#include <fluent-bit/flb_storage.h>
#include <fluent-bit/flb_utils.h>
#include <fluent-bit/flb_event.h>
#ifdef FLB_DUMP_STACKTRACE
#include <fluent-bit/flb_stacktrace.h>
#endif
#include <stdio.h>
#include <time.h>
/*
* Input Chunks
* ============
* Every input plugin instance has it own Chunk I/O stream. The stream is used to
* associate data from the specific origin.
*
* This dump prints out information about current status of chunks registered by
* the input plugin interface and resources usage.
*/
static void dump_input_chunks(struct flb_config *ctx)
{
/* general */
int ret;
ssize_t size;
/* tasks */
int task_new;
int task_running;
/* chunks */
int up;
int down;
int busy;
int busy_size_err;
ssize_t busy_size;
char tmp[32];
struct mk_list *head;
struct mk_list *h_chunks;
struct mk_list *h_task;
struct flb_input_instance *i;
struct flb_input_chunk *ic;
struct flb_task *task;
fprintf(stderr, "\n===== Input =====\n");
mk_list_foreach(head, &ctx->inputs) {
i = mk_list_entry(head, struct flb_input_instance, _head);
fprintf(stderr, "%s (%s)\n", flb_input_name(i), i->p->name);
fprintf(stderr, "│\n");
fprintf(stderr, "├─ status\n");
/* Overlimit checks */
ret = FLB_FALSE;
if (i->mem_buf_limit > 0) {
if (i->mem_chunks_size >= i->mem_buf_limit) {
ret = FLB_TRUE;
}
}
fprintf(stderr, "│ └─ overlimit : %s\n",
ret ? "yes" : "no");
/* Current memory size used based on last ingestion */
flb_utils_bytes_to_human_readable_size(i->mem_chunks_size,
tmp, sizeof(tmp) - 1);
fprintf(stderr, "│ ├─ mem size : %s (%lu bytes)\n",
tmp, i->mem_chunks_size);
/* Mem buf limit set */
flb_utils_bytes_to_human_readable_size(i->mem_buf_limit,
tmp, sizeof(tmp) - 1);
fprintf(stderr, "│ └─ mem limit : %s (%lu bytes)\n",
tmp, i->mem_buf_limit);
/*
* Tasks
* =====
* Upon flush time, the engine look for 'chunks' ready to be flushed.
* For each one, it creates a Task, this task can be routed and
* referenced by different output destinations.
*
* For short: every task is a chunk. But it's a different structure
* handled by the engine to coordinate the flush process.
*/
fprintf(stderr, "│\n");
fprintf(stderr, "├─ tasks\n");
fprintf(stderr, "│ ├─ total tasks : %i\n", mk_list_size(&i->tasks));
size = 0;
task_new = 0;
task_running = 0;
/* Iterate tasks and print a summary */
mk_list_foreach(h_task, &i->tasks) {
task = mk_list_entry(h_task, struct flb_task, _head);
size += task->event_chunk->size;
if (task->status == FLB_TASK_NEW) {
task_new++;
}
else if (task->status == FLB_TASK_RUNNING) {
task_running++;
}
}
flb_utils_bytes_to_human_readable_size(size, tmp, sizeof(tmp) - 1);
fprintf(stderr, "│ ├─ new : %i\n", task_new);
fprintf(stderr, "│ ├─ running : %i\n", task_running);
fprintf(stderr, "│ └─ size : %s (%lu bytes)\n", tmp, size);
/*
* Chunks
* ======
* Input plugins ingest record into a 'chunk'. If the storage layer type
* for the instance is memory, all chunks are considered 'up' (meaning:
* up in memory), for filesystem based chunks they can be 'up' or 'down'.
*
* We avoid to have all of them 'up' at the same time since this can
* lead to a high memory consumption. When filesystem mode is used, some
* of them are 'down' and only get 'up' when they are going to be
* processed.
*/
fprintf(stderr, "│\n");
fprintf(stderr, "└─ chunks\n");
/* Number of chunks registered */
fprintf(stderr, " └─ total chunks : %i\n", mk_list_size(&i->chunks));
/* Busy chunks
* -----------
* Chunks marked as 'busy' are 'locked' since they are in a 'flush' state.
* No more data can be appended to a busy chunk.
*/
busy = 0;
busy_size = 0;
busy_size_err = 0;
/* up/down */
up = 0;
down = 0;
/* Iterate chunks for the input instance in question */
mk_list_foreach(h_chunks, &i->chunks) {
ic = mk_list_entry(h_chunks, struct flb_input_chunk, _head);
if (ic->busy == FLB_TRUE) {
busy++;
size = cio_chunk_get_content_size(ic->chunk);
if (size >= 0) {
busy_size += size;
}
else {
busy_size_err++;
}
}
if (cio_chunk_is_up(ic->chunk) == CIO_TRUE) {
up++;
}
else {
down++;
}
}
fprintf(stderr, " ├─ up chunks : %i\n", up);
fprintf(stderr, " ├─ down chunks: %i\n", down);
flb_utils_bytes_to_human_readable_size(busy_size, tmp, sizeof(tmp) - 1);
fprintf(stderr, " └─ busy chunks: %i\n", busy);
fprintf(stderr, " ├─ size : %s (%lu bytes)\n", tmp, busy_size);
fprintf(stderr, " └─ size err: %i\n", busy_size_err);
fprintf(stderr, "\n");
}
}
/*
* Storage
* =======
* Dump Chunk I/O statistics, basic counters
*/
static void dump_storage(struct flb_config *ctx)
{
struct cio_stats storage_st;
fprintf(stderr, "\n===== Storage Layer =====\n");
cio_stats_get(ctx->cio, &storage_st);
fprintf(stderr, "total chunks : %i\n", storage_st.chunks_total);
fprintf(stderr, "├─ mem chunks : %i\n", storage_st.chunks_mem);
fprintf(stderr, "└─ fs chunks : %i\n", storage_st.chunks_fs);
fprintf(stderr, " ├─ up : %i\n", storage_st.chunks_fs_up);
fprintf(stderr, " └─ down : %i\n", storage_st.chunks_fs_down);
}
void flb_dump(struct flb_config *ctx)
{
time_t now;
struct tm *current;
now = time(NULL);
current = localtime(&now);
fprintf(stderr,
"[%i/%02i/%02i %02i:%02i:%02i] Fluent Bit Dump\n",
current->tm_year + 1900,
current->tm_mon + 1,
current->tm_mday,
current->tm_hour,
current->tm_min,
current->tm_sec);
/* Stacktrace */
#ifdef FLB_DUMP_STACKTRACE
/*
* Sorry, I had to disable the stacktrace as part of the dump
* since if backtrace_full() is called while Fluent Bit is
* inside a co-routine (output flush), it might crash.
*
* If we are in a co-routine likely we need a different libbacktrace
* context, but it's just a guess, not tested.
*/
//fprintf(stderr, "\n===== Stacktrace =====\n");
//flb_stacktrace_print();
#endif
/* Input Plugins + Storage */
dump_input_chunks(ctx);
/* Storage Layer */
dump_storage(ctx);
/* Make sure to flush the stdout buffer in case output
* has been redirected to a file
*/
fflush(stderr);
}
|
