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
|
/*****
*
* 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 <stdio.h>
#include <string.h>
#include <ctype.h>
#include <sys/types.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"
#include "value-container.h"
struct rule_object_list {
prelude_list_t rule_object_list;
};
/*
* List of IDMEF object set by a given rule.
*/
typedef struct {
prelude_list_t list;
idmef_path_t *object;
value_container_t *vcont;
} rule_object_t;
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, const char *valstr)
{
int ret;
const char *str;
struct servent *service;
idmef_value_t *value = NULL;
str = idmef_path_get_name(rule_object->object, idmef_path_get_depth(rule_object->object) - 1);
ret = strcmp(str, "port");
if ( ret != 0 || isdigit((int) *valstr) )
ret = idmef_value_new_from_path(&value, rule_object->object, valstr);
else {
char tmp[32];
service = getservbyname(str_tolower(valstr, tmp, sizeof(tmp)), NULL);
if ( ! service ) {
prelude_log(PRELUDE_LOG_ERR, "could not map service '%s' in rule ID %d.\n", tmp, rule->id);
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), valstr, rule->id);
value = NULL;
}
return value;
}
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;
prelude_string_t *strbuf;
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;
}
prelude_list_for_each(&olist->rule_object_list, tmp) {
rule_object = prelude_list_entry(tmp, rule_object_t, list);
strbuf = value_container_resolve(rule_object->vcont, rule, log_entry, ovector, osize);
if ( ! strbuf )
continue;
value = build_message_object_value(rule, rule_object, prelude_string_get_string(strbuf));
prelude_string_destroy(strbuf);
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));
idmef_message_destroy(*message);
*message = NULL;
return -1;
}
}
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;
}
rule_object->object = object;
ret = value_container_new(&rule_object->vcont, value);
if ( ret < 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);
return olist;
}
void rule_object_list_destroy(rule_object_list_t *olist)
{
rule_object_t *robject;
prelude_list_t *tmp, *bkp;
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);
value_container_destroy(robject->vcont);
prelude_list_del(&robject->list);
free(robject);
}
free(olist);
}
prelude_bool_t rule_object_list_is_empty(rule_object_list_t *olist)
{
return prelude_list_is_empty(&olist->rule_object_list);
}
|