#include "rules.h" #include typedef struct node { compiled_rule *program; int id; int priority; int order; struct node *next; } node; static void dispose(node *head) { while (head) { node *next = head->next; port_release(head->program); free(head); head = next; } } void bank_init(rule_bank *b) { if (b) *b = (rule_bank){NULL, 0, 0}; } void bank_clear(rule_bank *b) { if (!b) return; dispose(b->state); b->state = NULL; b->count = 0; b->generation++; } int bank_replace(rule_bank *b, const rule_input *r, size_t count) { if (!b || count > RULE_LIMIT || (!r && count)) return PORT_ARGUMENT; for (size_t i=0; i 1000000 || r[i].priority < -1000 || r[i].priority > 1000 || r[i].length > PATTERN_LIMIT || (!r[i].pattern && r[i].length)) return PORT_ARGUMENT; for (size_t j=i+1; jprogram); if (status) { free(entry); dispose(prepared); return status; } entry->id = r[i].identifier; entry->priority = r[i].priority; entry->order = (int)i; node **place = &prepared; while (*place && ((*place)->priority > entry->priority || ((*place)->priority == entry->priority && (*place)->order < entry->order))) place = &(*place)->next; entry->next = *place; *place = entry; } node *old = b->state; b->state = prepared; b->count = count; b->generation++; dispose(old); return PORT_OK; } int bank_match(const rule_bank *b, const unsigned char *m, size_t length, rule_result *out) { if (!b || !out || (!m && length) || length > MESSAGE_LIMIT) return PORT_ARGUMENT; rule_result result = {0, 0, 0, -1}; for (const node *n=b->state; n; n=n->next) { if (port_matches(n->program, m, length)) { if (!result.hits) { result.identifier=n->id; result.priority=n->priority; result.input_index=n->order; } result.hits++; } } *out=result; return PORT_OK; }