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 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521
|
/*****
*
* Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 PreludeIDS Technologies. All Rights Reserved.
* Author: Yoann Vandoorselaere <yoann.v@prelude-ids.com>
* Author: Nicolas Delon <nicolas.delon@prelude-ids.com>
*
* This file is part of the Prelude-LML program.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, 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; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*
*****/
#include "config.h"
#include "libmissing.h"
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <sys/types.h>
#include <sys/time.h>
#include <pcre.h>
#include <netdb.h>
#include <libprelude/prelude.h>
#include <libprelude/common.h>
#include <libprelude/idmef.h>
#include <libprelude/prelude-string.h>
#include "prelude-lml.h"
#include "pcre-mod.h"
#include "rule-object.h"
struct rule_object_list {
prelude_list_t rule_object_list;
prelude_list_t referenced_value_list;
};
/*
* List of IDMEF object set by a given rule.
*/
typedef struct {
prelude_list_t list;
idmef_path_t *object;
prelude_list_t rule_object_value_list;
} rule_object_t;
/*
* List of fixed and dynamic value for a given IDMEF object.
*/
typedef struct rule_object_value {
prelude_list_t list;
char *value;
} rule_object_value_t;
typedef struct {
prelude_list_t list;
int refno;
char **value;
} rule_referenced_value_t;
static int referenced_value_add(rule_object_list_t *olist, unsigned int reference, char **value)
{
rule_referenced_value_t *reference_value;
if ( reference >= MAX_REFERENCE_PER_RULE ) {
prelude_log(PRELUDE_LOG_WARN, "reference number %d is too high.\n", reference);
return -1;
}
reference_value = malloc(sizeof(*reference_value));
if ( ! reference_value ) {
prelude_log(PRELUDE_LOG_ERR, "memory exhausted.\n");
return -1;
}
reference_value->value = value;
reference_value->refno = reference;
prelude_list_add_tail(&olist->referenced_value_list, &reference_value->list);
return 0;
}
static int add_dynamic_object_value(rule_object_list_t *olist, rule_object_t *rule_object, unsigned int reference)
{
rule_object_value_t *rovalue;
rovalue = calloc(1, sizeof(*rovalue));
if ( ! rovalue ) {
prelude_log(PRELUDE_LOG_ERR, "memory exhausted.\n");
return -1;
}
if ( referenced_value_add(olist, reference, &rovalue->value) < 0 ) {
free(rovalue);
return -1;
}
prelude_list_add_tail(&rule_object->rule_object_value_list, &rovalue->list);
return 0;
}
static int add_fixed_object_value(rule_object_t *rule_object, prelude_string_t *strbuf)
{
int ret;
rule_object_value_t *rovalue;
rovalue = calloc(1, sizeof(*rovalue));
if ( ! rovalue ) {
prelude_log(PRELUDE_LOG_ERR, "memory exhausted.\n");
return -1;
}
ret = prelude_string_get_string_released(strbuf, &rovalue->value);
if ( ret < 0 ) {
prelude_perror(ret, "error getting released string");
free(rovalue);
return -1;
}
prelude_list_add_tail(&rule_object->rule_object_value_list, &rovalue->list);
return 0;
}
static int parse_rule_object_value(rule_object_list_t *olist, rule_object_t *rule_object, const char *line)
{
int i, ret;
char num[10];
const char *str;
prelude_string_t *strbuf;
str = line;
while ( *str ) {
if ( *str == '$' && *(str + 1) != '$' ) {
i = 0;
str++;
while ( isdigit((int) *str) && i < sizeof(num) )
num[i++] = *str++;
if ( ! i )
return -1;
num[i] = 0;
if ( add_dynamic_object_value(olist, rule_object, atoi(num)) < 0 )
return -1;
continue;
}
ret = prelude_string_new(&strbuf);
if ( ret < 0 ) {
prelude_perror(ret, "error creating new prelude-string");
return -1;
}
while ( *str ) {
if ( *str == '$' ) {
if ( *(str + 1) == '$' )
str++;
else
break;
}
if ( prelude_string_ncat(strbuf, str, 1) < 0 )
return -1;
str++;
}
if ( add_fixed_object_value(rule_object, strbuf) < 0 )
return -1;
prelude_string_destroy(strbuf);
}
return 0;
}
static void free_rule_object_value_list(rule_object_t *object)
{
prelude_list_t *tmp, *bkp;
rule_object_value_t *rovalue;
prelude_list_for_each_safe(&object->rule_object_value_list, tmp, bkp) {
rovalue = prelude_list_entry(tmp, rule_object_value_t, list);
free(rovalue->value);
prelude_list_del(&rovalue->list);
free(rovalue);
}
}
static prelude_string_t *build_message_object_value_string(rule_object_t *rule_object)
{
int ret;
prelude_list_t *tmp;
prelude_string_t *str;
rule_object_value_t *rovalue;
ret = prelude_string_new(&str);
if ( ret < 0 ) {
prelude_perror(ret, "error creating prelude-string");
return NULL;
}
prelude_list_for_each(&rule_object->rule_object_value_list, tmp) {
rovalue = prelude_list_entry(tmp, rule_object_value_t, list);
if ( ! rovalue->value )
continue;
if ( prelude_string_cat(str, rovalue->value) < 0 ) {
prelude_string_destroy(str);
return NULL;
}
}
if ( prelude_string_is_empty(str) ) {
prelude_string_destroy(str);
return NULL;
}
return str;
}
static const char *str_tolower(const char *str, char *buf, size_t size)
{
unsigned int i = 0;
buf[0] = 0;
while ( i < size ) {
buf[i] = tolower(str[i]);
if ( str[i] == 0 )
break;
i++;
}
return buf;
}
static idmef_value_t *build_message_object_value(pcre_rule_t *rule, rule_object_t *rule_object)
{
int ret;
struct servent *service;
prelude_string_t *strbuf;
const char *value_str, *str;
idmef_value_t *value = NULL;
strbuf = build_message_object_value_string(rule_object);
if ( ! strbuf )
return NULL;
value_str = prelude_string_get_string(strbuf);
str = idmef_path_get_name(rule_object->object, idmef_path_get_depth(rule_object->object) - 1);
ret = strcmp(str, "port");
if ( ret != 0 || (ret == 0 && isdigit((int) *value_str)) )
ret = idmef_value_new_from_path(&value, rule_object->object, value_str);
else {
char tmp[32];
service = getservbyname(str_tolower(value_str, tmp, sizeof(tmp)), NULL);
if ( ! service ) {
prelude_log(PRELUDE_LOG_ERR, "could not map service '%s' in rule ID %d.\n", tmp, rule->id);
prelude_string_destroy(strbuf);
return NULL;
}
ret = idmef_value_new_uint16(&value, ntohs(service->s_port));
}
if ( ret < 0 ) {
prelude_perror(ret, "could not create path '%s' with value '%s' in rule ID %d",
idmef_path_get_name(rule_object->object, -1), value_str, rule->id);
value = NULL;
}
prelude_string_destroy(strbuf);
return value;
}
static void resolve_referenced_value(pcre_rule_t *rule, rule_object_list_t *olist,
const lml_log_entry_t *log_entry, int *ovector, size_t osize)
{
int ret;
prelude_list_t *tmp;
char buf[1024] = { 0 };
rule_referenced_value_t *rval;
prelude_list_for_each(&olist->referenced_value_list, tmp) {
rval = prelude_list_entry(tmp, rule_referenced_value_t, list);
ret = pcre_copy_substring(lml_log_entry_get_message(log_entry), ovector, osize, rval->refno, buf, sizeof(buf));
if ( ret < 0 ) {
if ( ret == PCRE_ERROR_NOMEMORY )
prelude_log(PRELUDE_LOG_WARN, "not enough memory to get backward reference %d.\n",
rval->refno);
else if ( ret == PCRE_ERROR_NOSUBSTRING )
prelude_log(PRELUDE_LOG_WARN, "backward reference number %d does not exist in rule id %d.\n",
rval->refno, rule->id);
else
prelude_log(PRELUDE_LOG_WARN, "unknown PCRE error while getting backward reference %d.\n",
rval->refno);
continue;
}
*rval->value = (buf[0]) ? strdup(buf) : NULL;
}
}
static void referenced_value_destroy_content(rule_object_list_t *olist)
{
prelude_list_t *tmp;
rule_referenced_value_t *rvalue;
prelude_list_for_each(&olist->referenced_value_list, tmp) {
rvalue = prelude_list_entry(tmp, rule_referenced_value_t, list);
if ( *rvalue->value ) {
free(*rvalue->value);
*rvalue->value = NULL;
}
}
}
int rule_object_build_message(pcre_rule_t *rule, rule_object_list_t *olist, idmef_message_t **message,
const lml_log_entry_t *log_entry, int *ovector, size_t osize)
{
int ret;
prelude_list_t *tmp;
idmef_value_t *value;
rule_object_t *rule_object;
if ( prelude_list_is_empty(&olist->rule_object_list) )
return 0;
if ( ! *message ) {
ret = idmef_message_new(message);
if ( ret < 0 )
return -1;
}
resolve_referenced_value(rule, olist, log_entry, ovector, osize);
prelude_list_for_each(&olist->rule_object_list, tmp) {
rule_object = prelude_list_entry(tmp, rule_object_t, list);
value = build_message_object_value(rule, rule_object);
if ( ! value )
continue;
ret = idmef_path_set(rule_object->object, *message, value);
idmef_value_destroy(value);
if ( ret < 0 ) {
prelude_perror(ret, "idmef path set failed for %s",
idmef_path_get_name(rule_object->object, -1));
referenced_value_destroy_content(olist);
return -1;
}
}
referenced_value_destroy_content(olist);
return 0;
}
int rule_object_add(rule_object_list_t *olist,
const char *filename, int line,
const char *object_name, const char *value)
{
int ret;
idmef_path_t *object;
rule_object_t *rule_object;
ret = idmef_path_new(&object, "alert.%s", object_name);
if ( ret < 0 ) {
prelude_perror(ret, "%s:%d: could not create 'alert.%s' path", filename, line, object_name);
return -1;
}
if ( idmef_path_is_ambiguous(object) ) {
prelude_log(PRELUDE_LOG_WARN, "%s:%d: Missing index in path '%s'.\n", filename, line, object_name);
idmef_path_destroy(object);
return -1;
}
rule_object = malloc(sizeof(*rule_object));
if ( ! rule_object ) {
prelude_log(PRELUDE_LOG_ERR, "memory exhausted.\n");
idmef_path_destroy(object);
return -1;
}
prelude_list_init(&rule_object->rule_object_value_list);
rule_object->object = object;
if ( parse_rule_object_value(olist, rule_object, value) < 0 ) {
idmef_path_destroy(object);
free(rule_object);
return -1;
}
prelude_list_add_tail(&olist->rule_object_list, &rule_object->list);
return 0;
}
rule_object_list_t *rule_object_list_new(void)
{
rule_object_list_t *olist;
olist = malloc(sizeof(*olist));
if ( ! olist ) {
prelude_log(PRELUDE_LOG_ERR, "memory exhausted.\n");
return NULL;
}
prelude_list_init(&olist->rule_object_list);
prelude_list_init(&olist->referenced_value_list);
return olist;
}
void rule_object_list_destroy(rule_object_list_t *olist)
{
rule_object_t *robject;
prelude_list_t *tmp, *bkp;
rule_referenced_value_t *rvalue;
prelude_list_for_each_safe(&olist->rule_object_list, tmp, bkp) {
robject = prelude_list_entry(tmp, rule_object_t, list);
idmef_path_destroy(robject->object);
free_rule_object_value_list(robject);
prelude_list_del(&robject->list);
free(robject);
}
prelude_list_for_each_safe(&olist->referenced_value_list, tmp, bkp) {
rvalue = prelude_list_entry(tmp, rule_referenced_value_t, list);
prelude_list_del(&rvalue->list);
free(rvalue);
}
free(olist);
}
prelude_bool_t rule_object_list_is_empty(rule_object_list_t *olist)
{
return prelude_list_is_empty(&olist->rule_object_list);
}
|