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
|
/*
* Copyright (c) 2002-2014 Balabit
* Copyright (c) 1998-2012 Balázs Scheidler
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 as published
* by the Free Software Foundation, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* As an additional exemption you are allowed to compile & link against the
* OpenSSL libraries as published by the OpenSSL project. See the file
* COPYING for details.
*
*/
typedef gboolean (*AggregateFunc)(gpointer, gint64);
static gboolean
tf_num_parse(gint argc, GString *argv[],
const gchar *func_name, gint64 *n, gint64 *m)
{
if (argc != 2)
{
msg_debug("Template function requires two arguments.",
evt_tag_str("function", func_name));
return FALSE;
}
if (!parse_number_with_suffix(argv[0]->str, n))
{
msg_debug("Parsing failed, template function's first argument is not a number",
evt_tag_str("function", func_name),
evt_tag_str("arg1", argv[0]->str));
return FALSE;
}
if (!parse_number_with_suffix(argv[1]->str, m))
{
msg_debug("Parsing failed, template function's second argument is not a number",
evt_tag_str("function", func_name),
evt_tag_str("arg2", argv[1]->str));
return FALSE;
}
return TRUE;
}
static void
tf_num_plus(LogMessage *msg, gint argc, GString *argv[], GString *result)
{
gint64 n, m;
if (!tf_num_parse(argc, argv, "+", &n, &m))
{
g_string_append_len(result, "NaN", 3);
return;
}
format_int64_padded(result, 0, ' ', 10, n + m);
}
TEMPLATE_FUNCTION_SIMPLE(tf_num_plus);
static void
tf_num_minus(LogMessage *msg, gint argc, GString *argv[], GString *result)
{
gint64 n, m;
if (!tf_num_parse(argc, argv, "-", &n, &m))
{
g_string_append_len(result, "NaN", 3);
return;
}
format_int64_padded(result, 0, ' ', 10, n - m);
}
TEMPLATE_FUNCTION_SIMPLE(tf_num_minus);
static void
tf_num_multi(LogMessage *msg, gint argc, GString *argv[], GString *result)
{
gint64 n, m;
if (!tf_num_parse(argc, argv, "*", &n, &m))
{
g_string_append_len(result, "NaN", 3);
return;
}
format_int64_padded(result, 0, ' ', 10, n * m);
}
TEMPLATE_FUNCTION_SIMPLE(tf_num_multi);
static void
tf_num_div(LogMessage *msg, gint argc, GString *argv[], GString *result)
{
gint64 n, m;
if (!tf_num_parse(argc, argv, "/", &n, &m) || !m)
{
g_string_append_len(result, "NaN", 3);
return;
}
format_int64_padded(result, 0, ' ', 10, n / m);
}
TEMPLATE_FUNCTION_SIMPLE(tf_num_div);
static void
tf_num_mod(LogMessage *msg, gint argc, GString *argv[], GString *result)
{
gint64 n, m;
if (!tf_num_parse(argc, argv, "%", &n, &m) || !m)
{
g_string_append_len(result, "NaN", 3);
return;
}
format_uint64_padded(result, 0, ' ', 10, n % m);
}
TEMPLATE_FUNCTION_SIMPLE(tf_num_mod);
static GString *
_get_gstring_scratch_buffer(const LogTemplateInvokeArgs *args,
gsize initial_capacity)
{
if (args->bufs->len == 0)
g_ptr_array_add(args->bufs, g_string_sized_new(initial_capacity));
return (GString *) g_ptr_array_index(args->bufs, 0);
}
static gboolean
_tf_num_parse_arg_with_message(const TFSimpleFuncState *state,
LogMessage *message,
const LogTemplateInvokeArgs *args,
gint64 *number)
{
GString *formatted_template = _get_gstring_scratch_buffer(args, 64);
gint on_error = args->opts->on_error;
log_template_format(state->argv[0], message, args->opts, args->tz,
args->seq_num, args->context_id, formatted_template);
if (!parse_number_with_suffix(formatted_template->str, number))
{
if (!(on_error & ON_ERROR_SILENT))
msg_error("Parsing failed, template function's argument is not a number",
evt_tag_str("arg", formatted_template->str));
return FALSE;
}
return TRUE;
}
static gboolean
tf_num_prepare(LogTemplateFunction *self, gpointer s, LogTemplate *parent,
gint argc, gchar *argv[], GError **error)
{
g_return_val_if_fail(error == NULL || *error == NULL, FALSE);
if (argc != 2)
{
g_set_error(error, LOG_TEMPLATE_ERROR, LOG_TEMPLATE_ERROR_COMPILE,
"$(%s) requires only one argument", argv[0]);
return FALSE;
}
return tf_simple_func_prepare(self, s, parent, argc, argv, error);
}
static gint
_tf_num_filter_iterate(const TFSimpleFuncState *state,
const LogTemplateInvokeArgs *args,
gint message_index,
AggregateFunc aggregate,
gpointer accumulator)
{
for (; message_index < args->num_messages; message_index++)
{
LogMessage *message = args->messages[message_index];
gint64 number;
if ((_tf_num_parse_arg_with_message(state, message, args, &number) &&
(!aggregate(accumulator, number))))
return message_index;
}
return -1;
}
static gboolean
_tf_num_filter(const TFSimpleFuncState *state,
const LogTemplateInvokeArgs *args,
AggregateFunc start,
AggregateFunc aggregate,
gpointer accumulator)
{
gint first = _tf_num_filter_iterate(state, args, 0, start, accumulator);
if (first < 0)
return FALSE;
_tf_num_filter_iterate(state, args, first + 1, aggregate, accumulator);
return TRUE;
}
static gboolean
_tf_num_store_first(gpointer accumulator, gint64 element)
{
gint64 *acc = (gint64 *)accumulator;
*acc = element;
return FALSE;
}
static void
_tf_num_aggregation(TFSimpleFuncState *state, const LogTemplateInvokeArgs *args,
AggregateFunc aggregate, GString *result)
{
gint64 accumulator;
if (!_tf_num_filter(state, args, _tf_num_store_first, aggregate, &accumulator))
return;
format_int64_padded(result, 0, ' ', 10, accumulator);
}
static gboolean
_tf_num_sum(gpointer accumulator, gint64 element)
{
gint64 *acc = (gint64 *)accumulator;
*acc += element;
return TRUE;
}
static void
tf_num_sum_call(LogTemplateFunction *self, gpointer s,
const LogTemplateInvokeArgs *args, GString *result)
{
_tf_num_aggregation((TFSimpleFuncState *) s, args, _tf_num_sum, result);
}
TEMPLATE_FUNCTION(TFSimpleFuncState, tf_num_sum,
tf_num_prepare, NULL, tf_num_sum_call,
tf_simple_func_free_state, NULL);
static gboolean
_tf_num_minimum(gpointer accumulator, gint64 element)
{
gint64 *acc = (gint64 *)accumulator;
if (element < *acc)
*acc = element;
return TRUE;
}
static void
tf_num_min_call(LogTemplateFunction *self, gpointer s,
const LogTemplateInvokeArgs *args, GString *result)
{
_tf_num_aggregation((TFSimpleFuncState *) s, args, _tf_num_minimum, result);
}
TEMPLATE_FUNCTION(TFSimpleFuncState, tf_num_min,
tf_num_prepare, NULL, tf_num_min_call,
tf_simple_func_free_state, NULL);
static gboolean
_tf_num_maximum(gpointer accumulator, gint64 element)
{
gint64 *acc = (gint64 *)accumulator;
if (element > *acc)
*acc = element;
return TRUE;
}
static void
tf_num_max_call(LogTemplateFunction *self, gpointer s,
const LogTemplateInvokeArgs *args, GString *result)
{
_tf_num_aggregation((TFSimpleFuncState *) s, args, _tf_num_maximum, result);
}
TEMPLATE_FUNCTION(TFSimpleFuncState, tf_num_max,
tf_num_prepare, NULL, tf_num_max_call,
tf_simple_func_free_state, NULL);
typedef struct _AverageState
{
gint count;
gint64 sum;
} AverageState;
static gboolean
_tf_num_store_average_first(gpointer accumulator, gint64 element)
{
AverageState *state = (AverageState *) accumulator;
state->count = 1;
state->sum = element;
return FALSE;
}
static gboolean
_tf_num_average(gpointer accumulator, gint64 element)
{
AverageState *state = (AverageState *) accumulator;
++state->count;
state->sum += element;
return TRUE;
}
static void
tf_num_average_call(LogTemplateFunction *self, gpointer s,
const LogTemplateInvokeArgs *args, GString *result)
{
TFSimpleFuncState *state = (TFSimpleFuncState *)s;
AverageState accumulator = {0, 0};
if (!_tf_num_filter(state, args, _tf_num_store_average_first, _tf_num_average, &accumulator))
return;
g_assert(accumulator.count > 0);
gint64 mean = accumulator.sum / accumulator.count;
format_int64_padded(result, 0, ' ', 10, mean);
}
TEMPLATE_FUNCTION(TFSimpleFuncState, tf_num_average,
tf_num_prepare, NULL, tf_num_average_call,
tf_simple_func_free_state, NULL);
|