2023-01-30 21:59:35 +08:00
|
|
|
/*
|
|
|
|
|
**********************************************************************************************
|
|
|
|
|
* File: maat_expr.cpp
|
|
|
|
|
* Description:
|
|
|
|
|
* Authors: Liu WenTan <liuwentan@geedgenetworks.com>
|
|
|
|
|
* Date: 2022-10-31
|
|
|
|
|
* Copyright: (c) 2018-2022 Geedge Networks, Inc. All rights reserved.
|
|
|
|
|
***********************************************************************************************
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
#include <assert.h>
|
2023-02-09 22:13:15 +08:00
|
|
|
#include <ctype.h>
|
2023-01-30 21:59:35 +08:00
|
|
|
|
|
|
|
|
#include "maat_expr.h"
|
|
|
|
|
#include "adapter_hs.h"
|
|
|
|
|
#include "maat_utils.h"
|
|
|
|
|
#include "maat_kv.h"
|
|
|
|
|
#include "maat_limits.h"
|
|
|
|
|
#include "rcu_hash.h"
|
|
|
|
|
#include "maat_rule.h"
|
2023-01-31 20:39:53 +08:00
|
|
|
#include "maat_compile.h"
|
2023-02-03 17:28:14 +08:00
|
|
|
#include "maat_group.h"
|
|
|
|
|
#include "alignment.h"
|
2023-01-30 21:59:35 +08:00
|
|
|
#include "maat_garbage_collection.h"
|
|
|
|
|
|
|
|
|
|
#define MODULE_EXPR module_name_str("maat.expr")
|
|
|
|
|
|
|
|
|
|
struct expr_schema {
|
|
|
|
|
int item_id_column;
|
|
|
|
|
int group_id_column;
|
|
|
|
|
int district_column;
|
|
|
|
|
int keywords_column;
|
|
|
|
|
int expr_type_column;
|
|
|
|
|
int match_method_column;
|
|
|
|
|
int is_hexbin_column;
|
|
|
|
|
enum hs_scan_mode scan_mode; /* adapter_hs scan mode */
|
2023-02-15 11:53:46 +08:00
|
|
|
enum hs_pattern_type pattern_type; /* literal or regex */
|
2023-01-31 20:39:53 +08:00
|
|
|
int table_id; //ugly
|
2023-02-03 17:28:14 +08:00
|
|
|
struct table_manager *ref_tbl_mgr;
|
2023-01-30 21:59:35 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
enum expr_type {
|
2023-02-16 11:13:23 +08:00
|
|
|
EXPR_TYPE_INVALID = -1,
|
2023-01-30 21:59:35 +08:00
|
|
|
EXPR_TYPE_STRING = 0,
|
|
|
|
|
EXPR_TYPE_AND,
|
|
|
|
|
EXPR_TYPE_REGEX,
|
2023-02-09 22:13:15 +08:00
|
|
|
EXPR_TYPE_OFFSET,
|
2023-01-30 21:59:35 +08:00
|
|
|
EXPR_TYPE_MAX
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
enum match_method {
|
|
|
|
|
MATCH_METHOD_SUB = 0,
|
|
|
|
|
MATCH_METHOD_RIGHT,
|
|
|
|
|
MATCH_METHOD_LEFT,
|
|
|
|
|
MATCH_METHOD_COMPLETE,
|
|
|
|
|
MATCH_METHOD_MAX
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct expr_item {
|
|
|
|
|
int item_id;
|
|
|
|
|
int group_id;
|
2023-02-03 17:28:14 +08:00
|
|
|
int district_id;
|
2023-01-30 21:59:35 +08:00
|
|
|
char keywords[MAX_KEYWORDS_STR];
|
|
|
|
|
enum expr_type expr_type;
|
2023-02-15 11:53:46 +08:00
|
|
|
enum hs_match_mode match_mode;
|
2023-01-30 21:59:35 +08:00
|
|
|
int is_hexbin;
|
|
|
|
|
int is_case_sensitive;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct expr_runtime {
|
|
|
|
|
enum hs_scan_mode scan_mode;
|
2023-02-15 11:53:46 +08:00
|
|
|
enum hs_pattern_type pattern_type;
|
2023-01-30 21:59:35 +08:00
|
|
|
struct adapter_hs *hs;
|
|
|
|
|
struct adapter_hs_stream *hs_stream;
|
|
|
|
|
struct rcu_hash_table *htable;
|
|
|
|
|
struct group2group_runtime *ref_g2g_rt;
|
|
|
|
|
|
|
|
|
|
uint32_t rule_num;
|
|
|
|
|
uint32_t updating_rule_num;
|
|
|
|
|
struct maat_item *item_hash;
|
|
|
|
|
void (*item_user_data_free)(void *);
|
|
|
|
|
|
2023-01-31 20:39:53 +08:00
|
|
|
int n_worker_thread;
|
2023-01-30 21:59:35 +08:00
|
|
|
struct maat_garbage_bin *ref_garbage_bin;
|
|
|
|
|
struct log_handle *logger;
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
long long *scan_cnt;
|
|
|
|
|
long long *hit_cnt;
|
2023-01-30 21:59:35 +08:00
|
|
|
// long long *stream_num;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
enum expr_type int_to_expr_type(int expr_type)
|
|
|
|
|
{
|
2023-02-16 11:13:23 +08:00
|
|
|
enum expr_type type = EXPR_TYPE_INVALID;
|
2023-01-30 21:59:35 +08:00
|
|
|
|
|
|
|
|
switch (expr_type) {
|
|
|
|
|
case 0:
|
|
|
|
|
type = EXPR_TYPE_STRING;
|
|
|
|
|
break;
|
|
|
|
|
case 1:
|
|
|
|
|
type = EXPR_TYPE_AND;
|
|
|
|
|
break;
|
|
|
|
|
case 2:
|
|
|
|
|
type = EXPR_TYPE_REGEX;
|
|
|
|
|
break;
|
2023-02-09 22:13:15 +08:00
|
|
|
case 3:
|
|
|
|
|
type = EXPR_TYPE_OFFSET;
|
|
|
|
|
break;
|
2023-01-30 21:59:35 +08:00
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return type;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
enum hs_match_mode int_to_match_mode(int match_method)
|
2023-01-30 21:59:35 +08:00
|
|
|
{
|
2023-02-16 11:13:23 +08:00
|
|
|
enum hs_match_mode mode = HS_MATCH_MODE_INVALID;
|
2023-01-30 21:59:35 +08:00
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
switch (match_method) {
|
2023-01-30 21:59:35 +08:00
|
|
|
case 0:
|
2023-02-15 11:53:46 +08:00
|
|
|
mode = HS_MATCH_MODE_SUB;
|
2023-01-30 21:59:35 +08:00
|
|
|
break;
|
|
|
|
|
case 1:
|
2023-02-15 11:53:46 +08:00
|
|
|
mode = HS_MATCH_MODE_SUFFIX;
|
2023-01-30 21:59:35 +08:00
|
|
|
break;
|
|
|
|
|
case 2:
|
2023-02-15 11:53:46 +08:00
|
|
|
mode = HS_MATCH_MODE_PREFIX;
|
2023-01-30 21:59:35 +08:00
|
|
|
break;
|
|
|
|
|
case 3:
|
2023-02-15 11:53:46 +08:00
|
|
|
mode = HS_MATCH_MODE_EXACTLY;
|
2023-01-30 21:59:35 +08:00
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
return mode;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct expr_item *expr_item_new(const char *line, struct expr_schema *expr_schema,
|
|
|
|
|
struct log_handle *logger)
|
|
|
|
|
{
|
|
|
|
|
size_t column_offset = 0;
|
|
|
|
|
size_t column_len = 0;
|
|
|
|
|
int db_hexbin = -1;
|
|
|
|
|
int expr_type = -1;
|
|
|
|
|
int match_method_type = -1;
|
2023-02-03 17:28:14 +08:00
|
|
|
enum table_type table_type = TABLE_TYPE_INVALID;
|
2023-01-30 21:59:35 +08:00
|
|
|
struct expr_item *expr_item = ALLOC(struct expr_item, 1);
|
|
|
|
|
|
|
|
|
|
int ret = get_column_pos(line, expr_schema->item_id_column, &column_offset, &column_len);
|
|
|
|
|
if (ret < 0) {
|
2023-02-03 17:28:14 +08:00
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s has no item_id",
|
2023-01-31 20:39:53 +08:00
|
|
|
expr_schema->table_id, line);
|
2023-01-30 21:59:35 +08:00
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
expr_item->item_id = atoi(line + column_offset);
|
|
|
|
|
|
|
|
|
|
ret = get_column_pos(line, expr_schema->group_id_column, &column_offset, &column_len);
|
|
|
|
|
if (ret < 0) {
|
2023-02-03 17:28:14 +08:00
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s has no group_id",
|
2023-01-31 20:39:53 +08:00
|
|
|
expr_schema->table_id, line);
|
2023-01-30 21:59:35 +08:00
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
expr_item->group_id = atoi(line + column_offset);
|
|
|
|
|
|
2023-02-07 11:25:31 +08:00
|
|
|
table_type = table_manager_get_table_type(expr_schema->ref_tbl_mgr, expr_schema->table_id);
|
2023-02-03 17:28:14 +08:00
|
|
|
if (table_type == TABLE_TYPE_EXPR_PLUS) {
|
2023-01-30 21:59:35 +08:00
|
|
|
ret = get_column_pos(line, expr_schema->district_column, &column_offset, &column_len);
|
|
|
|
|
if (ret < 0) {
|
2023-02-03 17:28:14 +08:00
|
|
|
goto error;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (column_len >= MAX_DISTRICT_STR) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
2023-02-03 17:28:14 +08:00
|
|
|
"expr table(table_id:%d) line:%s district length too long",
|
|
|
|
|
expr_schema->table_id, line);
|
|
|
|
|
goto error;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
2023-02-03 17:28:14 +08:00
|
|
|
|
|
|
|
|
char district[MAX_DISTRICT_STR] = {0};
|
|
|
|
|
memcpy(district, (line + column_offset), column_len);
|
|
|
|
|
assert(strlen(district) > 0);
|
|
|
|
|
str_unescape(district);
|
2023-02-06 08:14:25 +08:00
|
|
|
expr_item->district_id = table_manager_get_district_id(expr_schema->ref_tbl_mgr, district);
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ret = get_column_pos(line, expr_schema->expr_type_column, &column_offset, &column_len);
|
|
|
|
|
if (ret < 0) {
|
2023-02-03 17:28:14 +08:00
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s has no expr_type",
|
2023-01-31 20:39:53 +08:00
|
|
|
expr_schema->table_id, line);
|
2023-01-30 21:59:35 +08:00
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
expr_type = atoi(line + column_offset);
|
|
|
|
|
expr_item->expr_type = int_to_expr_type(expr_type);
|
2023-02-16 11:13:23 +08:00
|
|
|
if (expr_item->expr_type == EXPR_TYPE_INVALID) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s has invalid expr_type",
|
|
|
|
|
expr_schema->table_id, line);
|
|
|
|
|
goto error;
|
|
|
|
|
}
|
2023-01-30 21:59:35 +08:00
|
|
|
|
|
|
|
|
ret = get_column_pos(line, expr_schema->match_method_column, &column_offset, &column_len);
|
|
|
|
|
if (ret < 0) {
|
2023-02-03 17:28:14 +08:00
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s has no match_method",
|
2023-01-31 20:39:53 +08:00
|
|
|
expr_schema->table_id, line);
|
2023-01-30 21:59:35 +08:00
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
match_method_type = atoi(line + column_offset);
|
2023-02-15 11:53:46 +08:00
|
|
|
expr_item->match_mode = int_to_match_mode(match_method_type);
|
2023-02-16 11:13:23 +08:00
|
|
|
if (expr_item->match_mode == HS_MATCH_MODE_INVALID) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s has invalid match_method",
|
|
|
|
|
expr_schema->table_id, line);
|
|
|
|
|
goto error;
|
|
|
|
|
}
|
2023-01-30 21:59:35 +08:00
|
|
|
|
|
|
|
|
ret = get_column_pos(line, expr_schema->is_hexbin_column, &column_offset, &column_len);
|
|
|
|
|
if (ret < 0) {
|
2023-02-03 17:28:14 +08:00
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s has no is_hexbin",
|
2023-01-31 20:39:53 +08:00
|
|
|
expr_schema->table_id, line);
|
2023-01-30 21:59:35 +08:00
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
db_hexbin = atoi(line + column_offset);
|
|
|
|
|
|
|
|
|
|
switch (db_hexbin) {
|
|
|
|
|
case 0:
|
|
|
|
|
expr_item->is_hexbin = FALSE;
|
|
|
|
|
expr_item->is_case_sensitive = FALSE;
|
|
|
|
|
break;
|
|
|
|
|
case 1:
|
|
|
|
|
expr_item->is_hexbin = TRUE;
|
|
|
|
|
expr_item->is_case_sensitive = TRUE;
|
|
|
|
|
break;
|
|
|
|
|
case 2:
|
|
|
|
|
expr_item->is_hexbin = FALSE;
|
|
|
|
|
expr_item->is_case_sensitive = TRUE;
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
2023-01-31 20:39:53 +08:00
|
|
|
"expr table(table_id:%d) line:%s has invalid hexbin value:%d",
|
|
|
|
|
expr_schema->table_id, line, db_hexbin);
|
2023-01-30 21:59:35 +08:00
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-09 22:13:15 +08:00
|
|
|
ret = get_column_pos(line, expr_schema->keywords_column, &column_offset, &column_len);
|
|
|
|
|
if (ret < 0) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s has no keywords",
|
|
|
|
|
expr_schema->table_id, line);
|
|
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (column_len >= MAX_KEYWORDS_STR) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr table(table_id:%d) line:%s keywords length too long",
|
|
|
|
|
expr_schema->table_id, line);
|
|
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
memcpy(expr_item->keywords, (line + column_offset), column_len);
|
|
|
|
|
|
2023-01-30 21:59:35 +08:00
|
|
|
return expr_item;
|
|
|
|
|
error:
|
|
|
|
|
FREE(expr_item);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void expr_item_free(struct expr_item *expr_item)
|
|
|
|
|
{
|
|
|
|
|
FREE(expr_item);
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
enum hs_scan_mode scan_mode_str_to_enum(const char *mode_str)
|
|
|
|
|
{
|
|
|
|
|
enum hs_scan_mode scan_mode = HS_SCAN_MODE_MAX;
|
|
|
|
|
|
|
|
|
|
if (strcmp(mode_str, "block") == 0) {
|
|
|
|
|
scan_mode = HS_SCAN_MODE_BLOCK;
|
|
|
|
|
} else if (strcmp(mode_str, "stream") == 0) {
|
|
|
|
|
scan_mode = HS_SCAN_MODE_STREAM;
|
|
|
|
|
} else {
|
|
|
|
|
assert(0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return scan_mode;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
enum hs_pattern_type pattern_type_str_to_enum(const char *type_str)
|
|
|
|
|
{
|
|
|
|
|
enum hs_pattern_type pattern_type = HS_PATTERN_TYPE_MAX;
|
|
|
|
|
|
|
|
|
|
if (strcmp(type_str, "literal") == 0) {
|
|
|
|
|
pattern_type = HS_PATTERN_TYPE_STR;
|
|
|
|
|
} else if (strcmp(type_str, "regex") == 0) {
|
|
|
|
|
pattern_type = HS_PATTERN_TYPE_REG;
|
|
|
|
|
} else {
|
|
|
|
|
assert(0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return pattern_type;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
void *expr_schema_new(cJSON *json, struct table_manager *tbl_mgr,
|
|
|
|
|
const char *table_name, struct log_handle *logger)
|
2023-01-30 21:59:35 +08:00
|
|
|
{
|
|
|
|
|
int read_cnt = 0;
|
|
|
|
|
struct expr_schema *expr_schema = ALLOC(struct expr_schema, 1);
|
|
|
|
|
|
|
|
|
|
cJSON *custom_item = NULL;
|
2023-01-31 20:39:53 +08:00
|
|
|
cJSON *item = cJSON_GetObjectItem(json, "table_id");
|
|
|
|
|
if (item != NULL && item->type == cJSON_Number) {
|
|
|
|
|
expr_schema->table_id = item->valueint;
|
|
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
item = cJSON_GetObjectItem(json, "custom");
|
2023-01-30 21:59:35 +08:00
|
|
|
if (item == NULL || item->type != cJSON_Object) {
|
2023-02-03 17:28:14 +08:00
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"table %s has no custom column", table_name);
|
2023-01-30 21:59:35 +08:00
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
custom_item = cJSON_GetObjectItem(item, "scan_mode");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_String) {
|
2023-02-15 11:53:46 +08:00
|
|
|
expr_schema->scan_mode = scan_mode_str_to_enum(custom_item->valuestring);
|
|
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
custom_item = cJSON_GetObjectItem(item, "pattern_type");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_String) {
|
|
|
|
|
expr_schema->pattern_type = pattern_type_str_to_enum(custom_item->valuestring);
|
2023-01-30 21:59:35 +08:00
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
custom_item = cJSON_GetObjectItem(item, "item_id");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_Number) {
|
|
|
|
|
expr_schema->item_id_column = custom_item->valueint;
|
|
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
custom_item = cJSON_GetObjectItem(item, "group_id");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_Number) {
|
|
|
|
|
expr_schema->group_id_column = custom_item->valueint;
|
|
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
custom_item = cJSON_GetObjectItem(item, "keywords");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_Number) {
|
|
|
|
|
expr_schema->keywords_column = custom_item->valueint;
|
|
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
/* expr_plus has district */
|
2023-01-30 21:59:35 +08:00
|
|
|
custom_item = cJSON_GetObjectItem(item, "district");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_Number) {
|
|
|
|
|
expr_schema->district_column = custom_item->valueint;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
custom_item = cJSON_GetObjectItem(item, "expr_type");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_Number) {
|
|
|
|
|
expr_schema->expr_type_column = custom_item->valueint;
|
|
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
custom_item = cJSON_GetObjectItem(item, "match_method");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_Number) {
|
|
|
|
|
expr_schema->match_method_column = custom_item->valueint;
|
|
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
custom_item = cJSON_GetObjectItem(item, "is_hexbin");
|
|
|
|
|
if (custom_item != NULL && custom_item->type == cJSON_Number) {
|
|
|
|
|
expr_schema->is_hexbin_column = custom_item->valueint;
|
|
|
|
|
read_cnt++;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-07 11:25:31 +08:00
|
|
|
expr_schema->ref_tbl_mgr = tbl_mgr;
|
2023-02-03 17:28:14 +08:00
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
if (read_cnt < 9) {
|
2023-01-30 21:59:35 +08:00
|
|
|
goto error;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return expr_schema;
|
|
|
|
|
error:
|
|
|
|
|
FREE(expr_schema);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void expr_schema_free(void *expr_schema)
|
|
|
|
|
{
|
|
|
|
|
FREE(expr_schema);
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-31 20:39:53 +08:00
|
|
|
void expr_rule_free(and_expr_t *expr_rule)
|
|
|
|
|
{
|
|
|
|
|
if (NULL == expr_rule) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (size_t i = 0; i < expr_rule->n_patterns; i++) {
|
|
|
|
|
FREE(expr_rule->patterns[i].pat);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
FREE(expr_rule);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void expr_ex_data_free(void *user_ctx, void *data)
|
|
|
|
|
{
|
|
|
|
|
and_expr_t *expr_rule = (and_expr_t *)data;
|
|
|
|
|
expr_rule_free(expr_rule);
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
void *expr_runtime_new(void *expr_schema, int max_thread_num,
|
|
|
|
|
struct maat_garbage_bin *garbage_bin,
|
2023-01-30 21:59:35 +08:00
|
|
|
struct log_handle *logger)
|
|
|
|
|
{
|
|
|
|
|
if (NULL == expr_schema) {
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct expr_schema *schema = (struct expr_schema *)expr_schema;
|
|
|
|
|
struct expr_runtime *expr_rt = ALLOC(struct expr_runtime, 1);
|
|
|
|
|
|
|
|
|
|
expr_rt->htable = rcu_hash_new(expr_ex_data_free);
|
|
|
|
|
expr_rt->scan_mode = schema->scan_mode;
|
2023-02-15 11:53:46 +08:00
|
|
|
expr_rt->pattern_type = schema->pattern_type;
|
2023-01-30 21:59:35 +08:00
|
|
|
expr_rt->item_user_data_free = maat_item_inner_free;
|
2023-01-31 20:39:53 +08:00
|
|
|
expr_rt->n_worker_thread = max_thread_num;
|
2023-01-30 21:59:35 +08:00
|
|
|
expr_rt->ref_garbage_bin = garbage_bin;
|
|
|
|
|
expr_rt->logger = logger;
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
expr_rt->hit_cnt = alignment_int64_array_alloc(max_thread_num);
|
|
|
|
|
expr_rt->scan_cnt = alignment_int64_array_alloc(max_thread_num);
|
2023-01-30 21:59:35 +08:00
|
|
|
|
|
|
|
|
return expr_rt;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void expr_runtime_free(void *expr_runtime)
|
|
|
|
|
{
|
|
|
|
|
if (NULL == expr_runtime) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct expr_runtime *expr_rt = (struct expr_runtime *)expr_runtime;
|
|
|
|
|
if (expr_rt->hs != NULL) {
|
|
|
|
|
adapter_hs_destroy(expr_rt->hs);
|
|
|
|
|
expr_rt->hs = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (expr_rt->hs_stream != NULL) {
|
|
|
|
|
adapter_hs_stream_close(expr_rt->hs_stream);
|
|
|
|
|
expr_rt->hs_stream = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (expr_rt->htable != NULL) {
|
|
|
|
|
rcu_hash_free(expr_rt->htable);
|
|
|
|
|
expr_rt->htable = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct maat_item *item = NULL, *tmp = NULL;
|
|
|
|
|
HASH_ITER(hh, expr_rt->item_hash, item, tmp) {
|
|
|
|
|
HASH_DELETE(hh, expr_rt->item_hash, item);
|
|
|
|
|
maat_item_free(item, expr_rt->item_user_data_free);
|
|
|
|
|
}
|
2023-02-03 17:28:14 +08:00
|
|
|
|
|
|
|
|
if (expr_rt->hit_cnt != NULL) {
|
|
|
|
|
alignment_int64_array_free(expr_rt->hit_cnt);
|
|
|
|
|
expr_rt->hit_cnt = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (expr_rt->scan_cnt != NULL) {
|
|
|
|
|
alignment_int64_array_free(expr_rt->scan_cnt);
|
|
|
|
|
expr_rt->scan_cnt = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-30 21:59:35 +08:00
|
|
|
FREE(expr_rt);
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
int expr_runtime_update_row(struct expr_runtime *expr_rt, char *key,
|
2023-02-07 11:25:31 +08:00
|
|
|
size_t key_len, int item_id, and_expr_t *expr_rule,
|
2023-02-03 17:28:14 +08:00
|
|
|
int is_valid, struct log_handle *logger)
|
2023-01-30 21:59:35 +08:00
|
|
|
{
|
|
|
|
|
void *data = NULL;
|
|
|
|
|
|
|
|
|
|
if (0 == is_valid) {
|
|
|
|
|
//delete
|
|
|
|
|
data = rcu_hash_find(expr_rt->htable, key, key_len);
|
|
|
|
|
if (NULL == data) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
2023-02-03 17:28:14 +08:00
|
|
|
"the key of expr rule not exist, can't be deleted, expr_id:%d",
|
2023-02-07 11:25:31 +08:00
|
|
|
item_id);
|
2023-01-30 21:59:35 +08:00
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
rcu_hash_del(expr_rt->htable, key, key_len);
|
|
|
|
|
} else {
|
|
|
|
|
//add
|
|
|
|
|
data = rcu_hash_find(expr_rt->htable, key, key_len);
|
|
|
|
|
if (data != NULL) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
2023-02-03 17:28:14 +08:00
|
|
|
"the key of expr rule already exist, can't be added, expr_id:%d",
|
2023-02-07 11:25:31 +08:00
|
|
|
item_id);
|
2023-01-30 21:59:35 +08:00
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
rcu_hash_add(expr_rt->htable, key, key_len, (void *)expr_rule);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
enum hs_pattern_type expr_type2pattern_type(enum expr_type expr_type)
|
2023-01-31 20:39:53 +08:00
|
|
|
{
|
2023-02-15 11:53:46 +08:00
|
|
|
enum hs_pattern_type pattern_type = HS_PATTERN_TYPE_MAX;
|
2023-01-31 20:39:53 +08:00
|
|
|
|
|
|
|
|
switch (expr_type) {
|
|
|
|
|
case EXPR_TYPE_STRING:
|
|
|
|
|
case EXPR_TYPE_AND:
|
2023-02-09 22:13:15 +08:00
|
|
|
case EXPR_TYPE_OFFSET:
|
2023-02-15 11:53:46 +08:00
|
|
|
pattern_type = HS_PATTERN_TYPE_STR;
|
2023-01-31 20:39:53 +08:00
|
|
|
break;
|
|
|
|
|
case EXPR_TYPE_REGEX:
|
2023-02-15 11:53:46 +08:00
|
|
|
pattern_type = HS_PATTERN_TYPE_REG;
|
2023-01-31 20:39:53 +08:00
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return pattern_type;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-16 11:13:23 +08:00
|
|
|
static int convertHextoint(char srctmp)
|
2023-02-09 22:13:15 +08:00
|
|
|
{
|
|
|
|
|
if (isdigit(srctmp)) {
|
|
|
|
|
return srctmp - '0';
|
|
|
|
|
} else {
|
|
|
|
|
char temp = toupper(srctmp);
|
|
|
|
|
temp = temp - 'A' + 10;
|
|
|
|
|
return temp;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-16 11:13:23 +08:00
|
|
|
static size_t hex2bin(char *hex, int hex_len, char *binary, size_t size)
|
2023-02-09 22:13:15 +08:00
|
|
|
{
|
|
|
|
|
size_t resultlen = 0;
|
|
|
|
|
int high,low;
|
|
|
|
|
for (int i = 0; i < hex_len && size > resultlen; i += 2, resultlen++) {
|
2023-02-15 11:53:46 +08:00
|
|
|
high = convertHextoint(hex[i]);
|
|
|
|
|
low = convertHextoint(hex[i+1]);
|
2023-02-09 22:13:15 +08:00
|
|
|
binary[resultlen] = high * 16 + low;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
size = resultlen;
|
|
|
|
|
binary[resultlen] = '\0';
|
|
|
|
|
|
|
|
|
|
return resultlen;
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-31 20:39:53 +08:00
|
|
|
#define MAAT_MAX_EXPR_ITEM_NUM 8
|
2023-02-07 11:25:31 +08:00
|
|
|
and_expr_t *expr_item_to_expr_rule(struct expr_item *expr_item, void *user_data,
|
2023-02-03 17:28:14 +08:00
|
|
|
struct log_handle *logger)
|
2023-01-30 21:59:35 +08:00
|
|
|
{
|
|
|
|
|
size_t i = 0;
|
|
|
|
|
size_t sub_expr_cnt = 0;
|
|
|
|
|
char *pos = NULL;
|
2023-02-09 22:13:15 +08:00
|
|
|
char *tmp = NULL;
|
2023-01-30 21:59:35 +08:00
|
|
|
char *saveptr = NULL;
|
|
|
|
|
char *sub_key_array[MAAT_MAX_EXPR_ITEM_NUM];
|
2023-02-16 11:13:23 +08:00
|
|
|
int key_left_offset[MAAT_MAX_EXPR_ITEM_NUM];
|
|
|
|
|
int key_right_offset[MAAT_MAX_EXPR_ITEM_NUM];
|
|
|
|
|
|
|
|
|
|
/* -1 means offset no limit, As long as the pattern appears in the scan data, it will hit */
|
|
|
|
|
memset(key_left_offset, -1, sizeof(key_left_offset));
|
|
|
|
|
memset(key_right_offset, -1, sizeof(key_right_offset));
|
|
|
|
|
|
2023-01-30 21:59:35 +08:00
|
|
|
and_expr_t *expr_rule = ALLOC(and_expr_t, 1);
|
|
|
|
|
|
|
|
|
|
switch (expr_item->expr_type) {
|
|
|
|
|
case EXPR_TYPE_AND:
|
|
|
|
|
case EXPR_TYPE_REGEX:
|
|
|
|
|
for (i = 0, pos = expr_item->keywords; ; i++, pos = NULL) {
|
2023-02-09 22:13:15 +08:00
|
|
|
tmp = strtok_r_esc(pos, '&', &saveptr);
|
2023-01-30 21:59:35 +08:00
|
|
|
if (NULL == tmp) {
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (i >= MAAT_MAX_EXPR_ITEM_NUM) {
|
2023-01-31 20:39:53 +08:00
|
|
|
log_error(logger, MODULE_EXPR,
|
2023-02-03 17:28:14 +08:00
|
|
|
"expr item_id:%d too many patterns",
|
|
|
|
|
expr_item->item_id);
|
2023-01-30 21:59:35 +08:00
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
sub_key_array[i] = tmp;
|
|
|
|
|
if (expr_item->expr_type == EXPR_TYPE_REGEX) {
|
|
|
|
|
sub_key_array[i] = str_unescape_and(sub_key_array[i]);
|
|
|
|
|
} else {
|
|
|
|
|
sub_key_array[i] = str_unescape(sub_key_array[i]);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
sub_expr_cnt = i;
|
|
|
|
|
break;
|
2023-02-09 22:13:15 +08:00
|
|
|
case EXPR_TYPE_OFFSET:
|
|
|
|
|
for (i = 0, pos = expr_item->keywords; ; i++, pos = NULL) {
|
|
|
|
|
tmp = strtok_r_esc(pos, '&', &saveptr);
|
|
|
|
|
if (NULL == tmp) {
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (i >= MAAT_MAX_EXPR_ITEM_NUM) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr item_id:%d too many patterns",
|
|
|
|
|
expr_item->item_id);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
sub_key_array[i] = tmp;
|
|
|
|
|
sscanf(sub_key_array[i], "%d-%d:", &(key_left_offset[i]),&(key_right_offset[i]));
|
|
|
|
|
if (!(key_left_offset[i] >= 0 && key_right_offset[i] > 0
|
|
|
|
|
&& key_left_offset[i] <= key_right_offset[i])) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr item:%d has invalid offset.", expr_item->item_id);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
sub_key_array[i] = (char *)memchr(sub_key_array[i], ':', strlen(sub_key_array[i]));
|
|
|
|
|
if (NULL == sub_key_array[i]) {
|
|
|
|
|
log_error(logger, MODULE_EXPR,
|
|
|
|
|
"expr item:%d has invalid offset keyword format.",
|
|
|
|
|
expr_item->item_id);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
sub_key_array[i]++;//jump over ':'
|
|
|
|
|
sub_key_array[i] = str_unescape(sub_key_array[i]);
|
|
|
|
|
}
|
|
|
|
|
sub_expr_cnt = i;
|
|
|
|
|
break;
|
2023-01-30 21:59:35 +08:00
|
|
|
case EXPR_TYPE_STRING:
|
|
|
|
|
sub_expr_cnt = 1;
|
|
|
|
|
sub_key_array[0] = expr_item->keywords;
|
|
|
|
|
sub_key_array[0] = str_unescape(sub_key_array[0]);
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-09 22:13:15 +08:00
|
|
|
size_t region_str_len = 0;
|
|
|
|
|
char *region_string = NULL;
|
|
|
|
|
size_t sub_key_len = 0;
|
|
|
|
|
|
2023-01-30 21:59:35 +08:00
|
|
|
for (i = 0; i < sub_expr_cnt; i++) {
|
2023-02-15 11:53:46 +08:00
|
|
|
|
2023-02-09 22:13:15 +08:00
|
|
|
if (FALSE == expr_item->is_case_sensitive) {
|
|
|
|
|
// insensitive
|
2023-02-15 11:53:46 +08:00
|
|
|
expr_rule->patterns[i].case_sensitive = HS_CASE_INSESITIVE;
|
2023-02-09 22:13:15 +08:00
|
|
|
}
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
enum hs_pattern_type pattern_type = expr_type2pattern_type(expr_item->expr_type);
|
2023-02-09 22:13:15 +08:00
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
if (TRUE == expr_item->is_hexbin && pattern_type != HS_PATTERN_TYPE_REG) {
|
2023-02-09 22:13:15 +08:00
|
|
|
region_str_len = strlen(sub_key_array[i]) + 1;
|
|
|
|
|
region_string = ALLOC(char, region_str_len);
|
|
|
|
|
region_str_len = hex2bin(sub_key_array[i], strlen(sub_key_array[i]), region_string, region_str_len);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (region_string != NULL) {
|
|
|
|
|
expr_rule->patterns[i].pat = ALLOC(char, region_str_len);
|
|
|
|
|
memcpy(expr_rule->patterns[i].pat, region_string, region_str_len);
|
|
|
|
|
expr_rule->patterns[i].pat_len = region_str_len;
|
|
|
|
|
FREE(region_string);
|
|
|
|
|
} else {
|
|
|
|
|
sub_key_len = strlen(sub_key_array[i]);
|
|
|
|
|
expr_rule->patterns[i].pat = ALLOC(char, sub_key_len);
|
|
|
|
|
memcpy(expr_rule->patterns[i].pat, sub_key_array[i], sub_key_len);
|
|
|
|
|
expr_rule->patterns[i].pat_len = sub_key_len;
|
|
|
|
|
}
|
2023-02-15 11:53:46 +08:00
|
|
|
|
|
|
|
|
expr_rule->patterns[i].match_mode = expr_item->match_mode;
|
|
|
|
|
if (expr_rule->patterns[i].match_mode == HS_MATCH_MODE_SUB) {
|
|
|
|
|
expr_rule->patterns[i].l_offset = key_left_offset[i];
|
|
|
|
|
expr_rule->patterns[i].r_offset = key_right_offset[i];
|
|
|
|
|
}
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
2023-02-15 11:53:46 +08:00
|
|
|
expr_rule->expr_id = expr_item->item_id;
|
2023-02-07 11:25:31 +08:00
|
|
|
expr_rule->user_tag = user_data;
|
2023-01-30 21:59:35 +08:00
|
|
|
expr_rule->n_patterns = sub_expr_cnt;
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
//mytest
|
|
|
|
|
// printf("expr_rule->expr_id:%u\n", expr_rule->expr_id);
|
|
|
|
|
// printf("expr_rule->n_patterns:%zu\n", expr_rule->n_patterns);
|
|
|
|
|
// for (size_t i = 0; i < expr_rule->n_patterns; i++) {
|
|
|
|
|
// printf("expr_rule->patterns[%zu].pat:%s\n", i, expr_rule->patterns[i].pat);
|
|
|
|
|
// printf("expr_rule->patterns[%zu].pat_len:%zu\n", i, expr_rule->patterns[i].pat_len);
|
|
|
|
|
// printf("expr_rule->patterns[%zu].l_offset:%d\n", i, expr_rule->patterns[i].l_offset);
|
|
|
|
|
// printf("expr_rule->patterns[%zu].r_offset:%d\n", i, expr_rule->patterns[i].r_offset);
|
|
|
|
|
// }
|
2023-01-30 21:59:35 +08:00
|
|
|
return expr_rule;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
int expr_runtime_update(void *expr_runtime, void *expr_schema,
|
|
|
|
|
const char *line, int valid_column)
|
2023-01-30 21:59:35 +08:00
|
|
|
{
|
2023-02-07 11:25:31 +08:00
|
|
|
if (NULL == expr_runtime || NULL == expr_schema ||
|
|
|
|
|
NULL == line) {
|
2023-01-30 21:59:35 +08:00
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int ret = -1;
|
|
|
|
|
struct maat_item_inner *u_para = NULL;
|
|
|
|
|
struct maat_item *item = NULL;
|
|
|
|
|
and_expr_t *expr_rule = NULL;
|
|
|
|
|
struct expr_schema *schema = (struct expr_schema *)expr_schema;
|
|
|
|
|
struct expr_runtime *expr_rt = (struct expr_runtime *)expr_runtime;
|
|
|
|
|
|
|
|
|
|
int item_id = get_column_value(line, schema->item_id_column);
|
|
|
|
|
int is_valid = get_column_value(line, valid_column);
|
|
|
|
|
if (is_valid < 0) {
|
|
|
|
|
return -1;
|
|
|
|
|
} else if (0 == is_valid) {
|
|
|
|
|
//delete
|
|
|
|
|
HASH_FIND_INT(expr_rt->item_hash, &item_id, item);
|
|
|
|
|
if (NULL == item) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
u_para = (struct maat_item_inner *)item->user_data;
|
|
|
|
|
item->user_data = NULL;
|
|
|
|
|
|
|
|
|
|
if (NULL == u_para) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
HASH_DELETE(hh, expr_rt->item_hash, item);
|
2023-01-31 20:39:53 +08:00
|
|
|
maat_garbage_bagging(expr_rt->ref_garbage_bin, u_para, maat_item_inner_free);
|
2023-01-30 21:59:35 +08:00
|
|
|
} else {
|
|
|
|
|
//add
|
|
|
|
|
HASH_FIND_INT(expr_rt->item_hash, &item_id, item);
|
|
|
|
|
if (item) {
|
|
|
|
|
log_error(expr_rt->logger, MODULE_EXPR,
|
2023-02-03 17:28:14 +08:00
|
|
|
"expr runtime add item %d to item_hash failed, already exist",
|
|
|
|
|
item_id);
|
2023-01-30 21:59:35 +08:00
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct expr_item *expr_item = expr_item_new(line, schema, expr_rt->logger);
|
|
|
|
|
if (NULL == expr_item) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-06 08:14:25 +08:00
|
|
|
u_para = maat_item_inner_new(expr_item->group_id, item_id, expr_item->district_id);
|
2023-01-31 20:39:53 +08:00
|
|
|
item = maat_item_new(item_id, expr_item->group_id, u_para);
|
2023-01-30 21:59:35 +08:00
|
|
|
HASH_ADD_INT(expr_rt->item_hash, item_id, item);
|
|
|
|
|
|
2023-02-07 11:25:31 +08:00
|
|
|
expr_rule = expr_item_to_expr_rule(expr_item, u_para, expr_rt->logger);
|
2023-01-30 21:59:35 +08:00
|
|
|
expr_item_free(expr_item);
|
|
|
|
|
if (NULL == expr_rule) {
|
2023-02-03 17:28:14 +08:00
|
|
|
log_error(expr_rt->logger, MODULE_EXPR,
|
|
|
|
|
"transform expr table(table_id:%d) item to expr_rule failed, item_id:%d",
|
2023-01-31 20:39:53 +08:00
|
|
|
schema->table_id, item_id);
|
2023-01-30 21:59:35 +08:00
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
char *key = (char *)&item_id;
|
2023-02-07 11:25:31 +08:00
|
|
|
ret = expr_runtime_update_row(expr_rt, key, sizeof(int), item_id,
|
|
|
|
|
expr_rule, is_valid, expr_rt->logger);
|
2023-01-30 21:59:35 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
|
if (expr_rule != NULL) {
|
|
|
|
|
expr_rule_free(expr_rule);
|
|
|
|
|
}
|
|
|
|
|
return -1;
|
|
|
|
|
} else {
|
|
|
|
|
if (0 == is_valid) {
|
|
|
|
|
expr_rt->rule_num--;
|
|
|
|
|
} else {
|
|
|
|
|
expr_rt->rule_num++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-09 22:13:15 +08:00
|
|
|
int expr_runtime_commit(void *expr_runtime, const char *table_name)
|
2023-01-30 21:59:35 +08:00
|
|
|
{
|
|
|
|
|
if (NULL == expr_runtime) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int ret = 0;
|
|
|
|
|
struct expr_runtime *expr_rt = (struct expr_runtime *)expr_runtime;
|
|
|
|
|
void **ex_data_array = NULL;
|
|
|
|
|
|
|
|
|
|
size_t rule_cnt = rcu_hash_list_updating_data(expr_rt->htable, &ex_data_array);
|
|
|
|
|
if (0 == rule_cnt) {
|
|
|
|
|
FREE(ex_data_array);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
and_expr_t *rules = ALLOC(and_expr_t, rule_cnt);
|
2023-02-09 22:13:15 +08:00
|
|
|
for (size_t i = 0 ; i < rule_cnt; i++) {
|
2023-01-30 21:59:35 +08:00
|
|
|
rules[i] = *(and_expr_t *)ex_data_array[i];
|
|
|
|
|
}
|
2023-02-09 22:13:15 +08:00
|
|
|
|
2023-01-30 21:59:35 +08:00
|
|
|
struct adapter_hs *new_adapter_hs = NULL;
|
|
|
|
|
struct adapter_hs *old_adapter_hs = NULL;
|
|
|
|
|
|
|
|
|
|
log_info(expr_rt->logger, MODULE_EXPR,
|
2023-02-09 22:13:15 +08:00
|
|
|
"table[%s] committing %zu expr rules for rebuilding adapter_hs engine",
|
|
|
|
|
table_name, rule_cnt);
|
2023-02-15 11:53:46 +08:00
|
|
|
new_adapter_hs = adapter_hs_initialize(expr_rt->scan_mode, expr_rt->pattern_type,
|
2023-02-03 17:28:14 +08:00
|
|
|
expr_rt->n_worker_thread,
|
|
|
|
|
rules, rule_cnt,
|
|
|
|
|
expr_rt->logger);
|
2023-01-30 21:59:35 +08:00
|
|
|
if (NULL == new_adapter_hs) {
|
|
|
|
|
log_error(expr_rt->logger, MODULE_EXPR,
|
2023-02-09 22:13:15 +08:00
|
|
|
"table[%s] rebuild adapter_hs engine failed when update %zu expr rules",
|
|
|
|
|
table_name, rule_cnt);
|
2023-01-30 21:59:35 +08:00
|
|
|
ret = -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
old_adapter_hs = expr_rt->hs;
|
|
|
|
|
expr_rt->hs = new_adapter_hs;
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
maat_garbage_bagging(expr_rt->ref_garbage_bin, old_adapter_hs,
|
|
|
|
|
(void (*)(void*))adapter_hs_destroy);
|
2023-01-30 21:59:35 +08:00
|
|
|
rcu_hash_commit(expr_rt->htable);
|
|
|
|
|
rule_cnt = rcu_hash_updating_count(expr_rt->htable);
|
|
|
|
|
assert(rule_cnt == 0);
|
|
|
|
|
|
|
|
|
|
FREE(rules);
|
|
|
|
|
FREE(ex_data_array);
|
|
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
int expr_runtime_scan(struct expr_runtime *expr_rt, int thread_id,
|
2023-02-07 11:25:31 +08:00
|
|
|
const char *data, size_t data_len,
|
|
|
|
|
int *group_ids, size_t group_ids_size,
|
|
|
|
|
int vtable_id, struct maat_state *state)
|
2023-01-30 21:59:35 +08:00
|
|
|
{
|
|
|
|
|
size_t n_hit_item = 0;
|
2023-02-07 11:25:31 +08:00
|
|
|
struct hs_scan_result hit_results[MAX_SCANNER_HIT_ITEM_NUM] = {0};
|
2023-02-06 08:14:25 +08:00
|
|
|
|
|
|
|
|
int ret = adapter_hs_scan(expr_rt->hs, thread_id, data, data_len,
|
2023-02-07 11:25:31 +08:00
|
|
|
hit_results, MAX_SCANNER_HIT_ITEM_NUM,
|
2023-02-06 08:14:25 +08:00
|
|
|
&n_hit_item);
|
2023-01-30 21:59:35 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
if (0 == n_hit_item) {
|
|
|
|
|
return 0;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
if (n_hit_item > MAX_SCANNER_HIT_ITEM_NUM) {
|
|
|
|
|
log_info(expr_rt->logger, MODULE_EXPR,
|
|
|
|
|
"hit expr item count:%d exceed maxium:%d",
|
|
|
|
|
n_hit_item, MAX_SCANNER_HIT_ITEM_NUM);
|
|
|
|
|
n_hit_item = MAX_SCANNER_HIT_ITEM_NUM;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
2023-02-16 16:45:06 +08:00
|
|
|
int hit_item_ids[MAX_SCANNER_HIT_ITEM_NUM];
|
2023-02-07 11:25:31 +08:00
|
|
|
struct maat_item_inner *item = NULL;
|
|
|
|
|
int real_hit_item_cnt = 0;
|
|
|
|
|
int district_id = state->district_id;
|
2023-02-16 11:13:23 +08:00
|
|
|
|
2023-02-16 16:45:06 +08:00
|
|
|
memset(hit_item_ids, -1, sizeof(hit_item_ids));
|
|
|
|
|
|
2023-02-07 11:25:31 +08:00
|
|
|
for (size_t i = 0; i < n_hit_item; i++) {
|
|
|
|
|
item = (struct maat_item_inner *)(hit_results[i].user_tag);
|
|
|
|
|
if (item->district_id == district_id || district_id == DISTRICT_ANY) {
|
|
|
|
|
hit_item_ids[real_hit_item_cnt++] = hit_results[i].item_id;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
size_t group_hit_cnt = 0;
|
2023-02-06 08:14:25 +08:00
|
|
|
ret = maat_compile_state_update(expr_rt->item_hash, vtable_id, hit_item_ids,
|
2023-02-07 11:25:31 +08:00
|
|
|
real_hit_item_cnt, group_ids, group_ids_size,
|
2023-02-06 08:14:25 +08:00
|
|
|
&group_hit_cnt, state);
|
2023-02-03 17:28:14 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
|
return -1;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
2023-02-03 17:28:14 +08:00
|
|
|
return group_hit_cnt;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void expr_runtime_stream_open(struct expr_runtime *expr_rt, int thread_id)
|
|
|
|
|
{
|
2023-01-31 20:39:53 +08:00
|
|
|
if (NULL == expr_rt) {
|
2023-01-30 21:59:35 +08:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-31 20:39:53 +08:00
|
|
|
struct adapter_hs_stream *hs_stream = adapter_hs_stream_open(expr_rt->hs, thread_id);
|
|
|
|
|
expr_rt->hs_stream = hs_stream;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
2023-02-15 11:53:46 +08:00
|
|
|
int expr_runtime_stream_scan(struct expr_runtime *expr_rt, const char *data,
|
2023-02-07 11:25:31 +08:00
|
|
|
size_t data_len, int *group_ids, size_t group_ids_size,
|
|
|
|
|
int vtable_id, struct maat_state *state)
|
2023-01-30 21:59:35 +08:00
|
|
|
{
|
2023-01-31 20:39:53 +08:00
|
|
|
if (NULL == expr_rt) {
|
2023-01-30 21:59:35 +08:00
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-07 11:25:31 +08:00
|
|
|
size_t n_hit_item = 0;
|
|
|
|
|
struct hs_scan_result hit_results[MAX_SCANNER_HIT_ITEM_NUM] = {0};
|
|
|
|
|
int ret = adapter_hs_scan_stream(expr_rt->hs_stream, data, data_len,
|
|
|
|
|
hit_results, MAX_SCANNER_HIT_ITEM_NUM,
|
|
|
|
|
&n_hit_item);
|
|
|
|
|
if (ret < 0) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (0 == n_hit_item) {
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (n_hit_item > MAX_SCANNER_HIT_ITEM_NUM) {
|
|
|
|
|
log_info(expr_rt->logger, MODULE_EXPR,
|
|
|
|
|
"hit expr item count:%d exceed maxium:%d",
|
|
|
|
|
n_hit_item, MAX_SCANNER_HIT_ITEM_NUM);
|
|
|
|
|
n_hit_item = MAX_SCANNER_HIT_ITEM_NUM;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int hit_item_ids[MAX_SCANNER_HIT_ITEM_NUM] = {-1};
|
|
|
|
|
for (size_t i = 0; i < n_hit_item; i++) {
|
|
|
|
|
hit_item_ids[i] = hit_results[i].item_id;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
size_t group_hit_cnt = 0;
|
|
|
|
|
ret = maat_compile_state_update(expr_rt->item_hash, vtable_id, hit_item_ids,
|
|
|
|
|
n_hit_item, group_ids, group_ids_size,
|
|
|
|
|
&group_hit_cnt, state);
|
|
|
|
|
if (ret < 0) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return group_hit_cnt;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void expr_runtime_stream_close(struct expr_runtime *expr_rt)
|
|
|
|
|
{
|
2023-01-31 20:39:53 +08:00
|
|
|
if (expr_rt != NULL) {
|
|
|
|
|
adapter_hs_stream_close(expr_rt->hs_stream);
|
|
|
|
|
expr_rt->hs_stream = NULL;
|
2023-01-30 21:59:35 +08:00
|
|
|
}
|
|
|
|
|
}
|
2023-02-03 17:28:14 +08:00
|
|
|
|
|
|
|
|
void expr_runtime_scan_hit_inc(struct expr_runtime *expr_rt, int thread_id)
|
|
|
|
|
{
|
|
|
|
|
alignment_int64_array_add(expr_rt->hit_cnt, thread_id, 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
long long expr_runtime_scan_hit_sum(struct expr_runtime *expr_rt, int n_thread)
|
|
|
|
|
{
|
|
|
|
|
return alignment_int64_array_sum(expr_rt->hit_cnt, n_thread);
|
|
|
|
|
}
|