|
|
|
/* Multi pattern matcher */
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
|
|
|
|
#include "decode.h"
|
|
|
|
#include "detect.h"
|
|
|
|
#include "detect-engine.h"
|
|
|
|
#include "detect-engine-siggroup.h"
|
|
|
|
#include "detect-engine-mpm.h"
|
|
|
|
#include "detect-engine-iponly.h"
|
|
|
|
#include "util-mpm.h"
|
|
|
|
|
|
|
|
#include "flow.h"
|
|
|
|
#include "flow-var.h"
|
|
|
|
#include "detect-flow.h"
|
|
|
|
|
|
|
|
#include "detect-content.h"
|
|
|
|
#include "detect-uricontent.h"
|
|
|
|
|
|
|
|
//#define PM MPM_WUMANBER
|
|
|
|
#define PM MPM_B2G
|
|
|
|
//#define PM MPM_B3G
|
|
|
|
|
|
|
|
u_int32_t PacketPatternScan(ThreadVars *t, PatternMatcherThread *pmt, Packet *p) {
|
|
|
|
u_int32_t ret;
|
|
|
|
|
|
|
|
pmt->pmq.mode = PMQ_MODE_SCAN;
|
|
|
|
ret = pmt->sgh->mpm_ctx->Scan(pmt->sgh->mpm_ctx, &pmt->mtc, &pmt->pmq, p->payload, p->payload_len);
|
|
|
|
|
|
|
|
//printf("PacketPatternScan: ret %u\n", ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_int32_t PacketPatternMatch(ThreadVars *t, PatternMatcherThread *pmt, Packet *p) {
|
|
|
|
u_int32_t ret;
|
|
|
|
|
|
|
|
pmt->pmq.mode = PMQ_MODE_SEARCH;
|
|
|
|
ret = pmt->sgh->mpm_ctx->Search(pmt->sgh->mpm_ctx, &pmt->mtc, &pmt->pmq, p->payload, p->payload_len);
|
|
|
|
|
|
|
|
//printf("PacketPatternMatch: ret %u\n", ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* cleans up the mpm instance after a match */
|
|
|
|
void PacketPatternCleanup(ThreadVars *t, PatternMatcherThread *pmt) {
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < pmt->pmq.sig_id_array_cnt; i++) {
|
|
|
|
pmt->pmq.sig_bitarray[(pmt->pmq.sig_id_array[i] / 8)] &= ~(1<<(pmt->pmq.sig_id_array[i] % 8));
|
|
|
|
}
|
|
|
|
pmt->pmq.sig_id_array_cnt = 0;
|
|
|
|
|
|
|
|
if (pmt->sgh == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* content */
|
|
|
|
if (pmt->sgh->mpm_ctx != NULL && pmt->sgh->mpm_ctx->Cleanup != NULL) {
|
|
|
|
pmt->sgh->mpm_ctx->Cleanup(&pmt->mtc);
|
|
|
|
}
|
|
|
|
/* uricontent */
|
|
|
|
if (pmt->sgh->mpm_uri_ctx != NULL && pmt->sgh->mpm_uri_ctx->Cleanup != NULL) {
|
|
|
|
pmt->sgh->mpm_uri_ctx->Cleanup(&pmt->mtcu);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* XXX remove this once we got rid of the global mpm_ctx */
|
|
|
|
void PatternMatchDestroy(MpmCtx *mc) {
|
|
|
|
mc->DestroyCtx(mc);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* TODO remove this when we move to the rule groups completely */
|
|
|
|
void PatternMatchPrepare(MpmCtx *mc)
|
|
|
|
{
|
|
|
|
MpmInitCtx(mc, PM);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* free the pattern matcher part of a SigGroupHead */
|
|
|
|
void PatternMatchDestroyGroup(SigGroupHead *sh) {
|
|
|
|
/* content */
|
|
|
|
if (sh->flags & SIG_GROUP_HAVECONTENT && sh->mpm_ctx != NULL &&
|
|
|
|
!(sh->flags & SIG_GROUP_HEAD_MPM_COPY)) {
|
|
|
|
sh->mpm_ctx->DestroyCtx(sh->mpm_ctx);
|
|
|
|
free(sh->mpm_ctx);
|
|
|
|
|
|
|
|
/* ready for reuse */
|
|
|
|
sh->mpm_ctx = NULL;
|
|
|
|
sh->flags &= ~SIG_GROUP_HAVECONTENT;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* uricontent */
|
|
|
|
if (sh->flags & SIG_GROUP_HAVEURICONTENT && sh->mpm_uri_ctx != NULL &&
|
|
|
|
!(sh->flags & SIG_GROUP_HEAD_MPM_URI_COPY)) {
|
|
|
|
sh->mpm_uri_ctx->DestroyCtx(sh->mpm_uri_ctx);
|
|
|
|
free(sh->mpm_uri_ctx);
|
|
|
|
|
|
|
|
/* ready for reuse */
|
|
|
|
sh->mpm_uri_ctx = NULL;
|
|
|
|
sh->flags &= ~SIG_GROUP_HAVEURICONTENT;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int g_uricontent_scan = 0;
|
|
|
|
static int g_uricontent_search = 0;
|
|
|
|
static int g_content_maxdepth = 0;
|
|
|
|
static int g_content_minoffset = 0;
|
|
|
|
static int g_content_total = 0;
|
|
|
|
|
|
|
|
static int g_content_maxlen = 0;
|
|
|
|
static int g_content_sigcnt = 0;
|
|
|
|
static int g_content_sigcnt1 = 0;
|
|
|
|
static int g_content_sigcnt2 = 0;
|
|
|
|
static int g_content_sigcnt3 = 0;
|
|
|
|
static int g_content_sigcnt4 = 0;
|
|
|
|
static int g_content_sigcnt5 = 0;
|
|
|
|
static int g_content_sigcnt10= 0;
|
|
|
|
|
|
|
|
void DbgPrintScanSearchStats() {
|
|
|
|
#if 0
|
|
|
|
printf(" - MPM: scan %d, search %d (%02.1f%%) :\n", g_content_scan, g_content_search,
|
|
|
|
(float)(g_content_scan/(float)(g_content_scan+g_content_search))*100);
|
|
|
|
printf(" - MPM: maxdepth %d, total %d (%02.1f%%) :\n", g_content_maxdepth, g_content_total,
|
|
|
|
(float)(g_content_maxdepth/(float)(g_content_total))*100);
|
|
|
|
printf(" - MPM: minoffset %d, total %d (%02.1f%%) :\n", g_content_minoffset, g_content_total,
|
|
|
|
(float)(g_content_minoffset/(float)(g_content_total))*100);
|
|
|
|
printf(" - MPM: avg maxlen %02.1f (%u/%u)\n", (float)((float)g_content_maxlen/(float)(g_content_sigcnt)), g_content_maxlen, g_content_sigcnt);
|
|
|
|
printf(" - MPM: 1 len %u (%02.1f%%)\n", g_content_sigcnt1, (float)(g_content_sigcnt1/(float)(g_content_sigcnt))*100);
|
|
|
|
printf(" - MPM: 2 len %u (%02.1f%%)\n", g_content_sigcnt2, (float)(g_content_sigcnt2/(float)(g_content_sigcnt))*100);
|
|
|
|
printf(" - MPM: 3 len %u (%02.1f%%)\n", g_content_sigcnt3, (float)(g_content_sigcnt3/(float)(g_content_sigcnt))*100);
|
|
|
|
printf(" - MPM: 4 len %u (%02.1f%%)\n", g_content_sigcnt4, (float)(g_content_sigcnt4/(float)(g_content_sigcnt))*100);
|
|
|
|
printf(" - MPM: 5+len %u (%02.1f%%)\n", g_content_sigcnt5, (float)(g_content_sigcnt5/(float)(g_content_sigcnt))*100);
|
|
|
|
printf(" - MPM: 10+ln %u (%02.1f%%)\n", g_content_sigcnt10,(float)(g_content_sigcnt10/(float)(g_content_sigcnt))*100);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/* set the mpm_content_maxlen and mpm_uricontent_maxlen variables in
|
|
|
|
* a sig group head */
|
|
|
|
void SigGroupHeadSetMpmMaxlen(DetectEngineCtx *de_ctx, SigGroupHead *sgh)
|
|
|
|
{
|
|
|
|
SigMatch *sm;
|
|
|
|
u_int32_t sig;
|
|
|
|
|
|
|
|
sgh->mpm_content_maxlen = 0;
|
|
|
|
sgh->mpm_uricontent_maxlen = 0;
|
|
|
|
|
|
|
|
/* for each signature in this group do */
|
|
|
|
for (sig = 0; sig < DetectEngineGetMaxSigId(de_ctx); sig++) {
|
|
|
|
if (!(sgh->sig_array[(sig/8)] & (1<<(sig%8))))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
Signature *s = de_ctx->sig_array[sig];
|
|
|
|
if (s == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!(s->flags & SIG_FLAG_MPM))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
u_int16_t content_maxlen = 0, uricontent_maxlen = 0;
|
|
|
|
|
|
|
|
/* determine the length of the longest pattern */
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT && !(sgh->flags & SIG_GROUP_HEAD_MPM_COPY)) {
|
|
|
|
DetectContentData *cd = (DetectContentData *)sm->ctx;
|
|
|
|
|
|
|
|
if (cd->content_len > content_maxlen)
|
|
|
|
content_maxlen = cd->content_len;
|
|
|
|
} else if (sm->type == DETECT_URICONTENT && !(sgh->flags & SIG_GROUP_HEAD_MPM_URI_COPY)) {
|
|
|
|
DetectUricontentData *ud = (DetectUricontentData *)sm->ctx;
|
|
|
|
if (ud->uricontent_len > uricontent_maxlen)
|
|
|
|
uricontent_maxlen = ud->uricontent_len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (sgh->mpm_content_maxlen == 0) sgh->mpm_content_maxlen = content_maxlen;
|
|
|
|
if (sgh->mpm_content_maxlen > content_maxlen)
|
|
|
|
sgh->mpm_content_maxlen = content_maxlen;
|
|
|
|
if (sgh->mpm_uricontent_maxlen == 0) sgh->mpm_uricontent_maxlen = uricontent_maxlen;
|
|
|
|
if (sgh->mpm_uricontent_maxlen > uricontent_maxlen)
|
|
|
|
sgh->mpm_uricontent_maxlen = uricontent_maxlen;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct ContentHash_ {
|
|
|
|
DetectContentData *ptr;
|
|
|
|
u_int16_t cnt;
|
|
|
|
u_int8_t use; /* use no matter what */
|
|
|
|
u_int8_t nosearch; /* single match, no search after
|
|
|
|
* scan match (for this pattern) */
|
|
|
|
} ContentHash;
|
|
|
|
|
|
|
|
u_int32_t ContentHashFunc(HashTable *ht, void *data, u_int16_t datalen) {
|
|
|
|
ContentHash *ch = (ContentHash *)data;
|
|
|
|
DetectContentData *co = ch->ptr;
|
|
|
|
u_int32_t hash = 0;
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < co->content_len; i++) {
|
|
|
|
hash += co->content[i];
|
|
|
|
}
|
|
|
|
hash = hash % ht->array_size;
|
|
|
|
//printf("hash %u\n", hash);
|
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
|
|
|
char ContentHashCompareFunc(void *data1, u_int16_t len1, void *data2, u_int16_t len2) {
|
|
|
|
ContentHash *ch1 = (ContentHash *)data1;
|
|
|
|
ContentHash *ch2 = (ContentHash *)data2;
|
|
|
|
DetectContentData *co1 = ch1->ptr;
|
|
|
|
DetectContentData *co2 = ch2->ptr;
|
|
|
|
|
|
|
|
if (co1->content_len == co2->content_len &&
|
|
|
|
memcmp(co1->content, co2->content, co1->content_len) == 0)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
ContentHash *ContentHashAlloc(DetectContentData *ptr) {
|
|
|
|
ContentHash *ch = malloc(sizeof(ContentHash));
|
|
|
|
if (ch == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
ch->ptr = ptr;
|
|
|
|
ch->cnt = 1;
|
|
|
|
ch->use = 0;
|
|
|
|
ch->nosearch = 0;
|
|
|
|
|
|
|
|
return ch;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ContentHashFree(void *ch) {
|
|
|
|
free(ch);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Predict a strength value for patterns
|
|
|
|
*
|
|
|
|
* Patterns with high character diversity score higher.
|
|
|
|
* Alpha chars score not so high
|
|
|
|
* Other printable + a few common codes a little higher
|
|
|
|
* Everything else highest.
|
|
|
|
* Longer patterns score better than short patters.
|
|
|
|
*/
|
|
|
|
u_int32_t PatternStrength(u_int8_t *pat, u_int16_t patlen, u_int16_t len) {
|
|
|
|
u_int8_t a[256];
|
|
|
|
memset(&a,0,sizeof(a));
|
|
|
|
|
|
|
|
u_int32_t s = 0;
|
|
|
|
u_int16_t u = 0;
|
|
|
|
for (u = 0; u < patlen; u++) {
|
|
|
|
if (a[pat[u]] == 0) {
|
|
|
|
if (isalpha(pat[u]))
|
|
|
|
s+=3;
|
|
|
|
else if (isprint(pat[u]) || pat[u] == 0x00 || pat[u] == 0x01 || pat[u] == 0xFF)
|
|
|
|
s+=4;
|
|
|
|
else
|
|
|
|
s+=6;//5
|
|
|
|
|
|
|
|
a[pat[u]] = 1;
|
|
|
|
} else {
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
int PatternMatchPreprarePopulateMpm(DetectEngineCtx *de_ctx, SigGroupHead *sgh) {
|
|
|
|
u_int32_t sig;
|
|
|
|
|
|
|
|
HashTable *ht = HashTableInit(4096, ContentHashFunc, ContentHashCompareFunc, ContentHashFree);
|
|
|
|
if (ht == NULL)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* add all the contents to a counting hash */
|
|
|
|
for (sig = 0; sig < sgh->sig_cnt; sig++) {
|
|
|
|
u_int32_t num = sgh->match_array[sig];
|
|
|
|
|
|
|
|
Signature *s = de_ctx->sig_array[num];
|
|
|
|
if (s == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
int cnt = 0;
|
|
|
|
SigMatch *sm;
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT) {
|
|
|
|
DetectContentData *co = (DetectContentData *)sm->ctx;
|
|
|
|
if (co == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
cnt++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT) {
|
|
|
|
DetectContentData *co = (DetectContentData *)sm->ctx;
|
|
|
|
if (co == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (co->content_len < sgh->mpm_content_maxlen)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
ContentHash *ch = ContentHashAlloc(co);
|
|
|
|
if (ch == NULL)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
if (cnt == 1) {
|
|
|
|
ch->nosearch = 1;
|
|
|
|
ch->use = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
ContentHash *lookup_ch = (ContentHash *)HashTableLookup(ht, ch, 0);
|
|
|
|
if (lookup_ch == NULL) {
|
|
|
|
int r = HashTableAdd(ht, ch, 0);
|
|
|
|
if (r < 0) printf("Add hash failed\n");
|
|
|
|
} else {
|
|
|
|
/* at least one sig relies soly on this content
|
|
|
|
* so flag that we will use this content no matter
|
|
|
|
* what. */
|
|
|
|
if (cnt == 1) {
|
|
|
|
lookup_ch->use = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* only set the nosearch flag if all sigs have it
|
|
|
|
* as their sole pattern */
|
|
|
|
if (ch->nosearch == 0)
|
|
|
|
lookup_ch->nosearch = 0;
|
|
|
|
|
|
|
|
lookup_ch->cnt++;
|
|
|
|
ContentHashFree(ch);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* now determine which one to add to the scan phase */
|
|
|
|
for (sig = 0; sig < sgh->sig_cnt; sig++) {
|
|
|
|
u_int32_t num = sgh->match_array[sig];
|
|
|
|
|
|
|
|
Signature *s = de_ctx->sig_array[num];
|
|
|
|
if (s == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
ContentHash *scan_ch = NULL;
|
|
|
|
SigMatch *sm = s->match;
|
|
|
|
for ( ; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT) {
|
|
|
|
DetectContentData *co = (DetectContentData *)sm->ctx;
|
|
|
|
if (co == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (co->content_len < sgh->mpm_content_maxlen)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
ContentHash *ch = ContentHashAlloc(co);
|
|
|
|
if (ch == NULL)
|
|
|
|
goto error;
|
|
|
|
//if (s->id == 2002102) {
|
|
|
|
//printf("%p %u Content: ", sgh, s->id); PrintRawUriFp(stdout,co->content,co->content_len);printf(" (strength %u, maxlen %u)\n", PatternStrength(co->content,co->content_len,sgh->mpm_content_maxlen), sgh->mpm_content_maxlen);
|
|
|
|
//}
|
|
|
|
ContentHash *lookup_ch = (ContentHash *)HashTableLookup(ht, ch, 0);
|
|
|
|
if (lookup_ch == NULL) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (scan_ch == NULL) {
|
|
|
|
scan_ch = lookup_ch;
|
|
|
|
} else {
|
|
|
|
if (lookup_ch->use == 0) {
|
|
|
|
u_int32_t ls = PatternStrength(lookup_ch->ptr->content,lookup_ch->ptr->content_len,sgh->mpm_content_maxlen);
|
|
|
|
u_int32_t ss = PatternStrength(scan_ch->ptr->content,scan_ch->ptr->content_len,sgh->mpm_content_maxlen);
|
|
|
|
if (ls > ss)
|
|
|
|
scan_ch = lookup_ch;
|
|
|
|
else if (ls == ss) {
|
|
|
|
if (lookup_ch->ptr->content_len > scan_ch->ptr->content_len)
|
|
|
|
scan_ch = lookup_ch;
|
|
|
|
}
|
|
|
|
|
|
|
|
// if (lookup_ch->cnt > scan_ch->cnt) {
|
|
|
|
// scan_ch = lookup_ch;
|
|
|
|
// } else if (lookup_ch->cnt == scan_ch->cnt) {
|
|
|
|
// if (lookup_ch->ptr->content_len < scan_ch->ptr->content_len)
|
|
|
|
// scan_ch = lookup_ch;
|
|
|
|
// }
|
|
|
|
} else {
|
|
|
|
if (scan_ch->use == 0)
|
|
|
|
scan_ch = lookup_ch;
|
|
|
|
else {
|
|
|
|
u_int32_t ls = PatternStrength(lookup_ch->ptr->content,lookup_ch->ptr->content_len,sgh->mpm_content_maxlen);
|
|
|
|
u_int32_t ss = PatternStrength(scan_ch->ptr->content,scan_ch->ptr->content_len,sgh->mpm_content_maxlen);
|
|
|
|
if (ls > ss)
|
|
|
|
scan_ch = lookup_ch;
|
|
|
|
else if (ls == ss) {
|
|
|
|
if (lookup_ch->ptr->content_len > scan_ch->ptr->content_len)
|
|
|
|
scan_ch = lookup_ch;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
if (lookup_ch->cnt > scan_ch->cnt) {
|
|
|
|
scan_ch = lookup_ch;
|
|
|
|
} else if (lookup_ch->cnt == scan_ch->cnt) {
|
|
|
|
if (lookup_ch->ptr->content_len < scan_ch->ptr->content_len)
|
|
|
|
scan_ch = lookup_ch;
|
|
|
|
}
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ContentHashFree(ch);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* now add the scan_ch to the mpm ctx */
|
|
|
|
if (scan_ch != NULL) {
|
|
|
|
DetectContentData *co = scan_ch->ptr;
|
|
|
|
//if (s->id == 2002102) {
|
|
|
|
//if (sgh->mpm_content_maxlen == 1) {
|
|
|
|
//printf("%p %u SCAN: ", sgh, s->id); PrintRawUriFp(stdout,co->content,co->content_len);printf("\n");
|
|
|
|
//}
|
|
|
|
//if (scan_ch->nosearch == 1) { printf("%3u (%u) Content: ", scan_ch->cnt, scan_ch->use); PrintRawUriFp(stdout,co->content,co->content_len);printf("\n"); }
|
|
|
|
|
|
|
|
u_int16_t offset = s->flags & SIG_FLAG_RECURSIVE ? 0 : co->offset;
|
|
|
|
u_int16_t depth = s->flags & SIG_FLAG_RECURSIVE ? 0 : co->depth;
|
|
|
|
offset = scan_ch->cnt ? 0 : offset;
|
|
|
|
depth = scan_ch->cnt ? 0 : depth;
|
|
|
|
|
|
|
|
if (co->flags & DETECT_CONTENT_NOCASE) {
|
|
|
|
sgh->mpm_ctx->AddScanPatternNocase(sgh->mpm_ctx, co->content, co->content_len, offset, depth, co->id, s->num, scan_ch->nosearch);
|
|
|
|
} else {
|
|
|
|
sgh->mpm_ctx->AddScanPattern(sgh->mpm_ctx, co->content, co->content_len, offset, depth, co->id, s->num, scan_ch->nosearch);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* add the rest of the patterns to the search ctx */
|
|
|
|
for (sm = s->match ; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT) {
|
|
|
|
DetectContentData *co = (DetectContentData *)sm->ctx;
|
|
|
|
if (co == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* skip the one we already added */
|
|
|
|
if (scan_ch != NULL && co == scan_ch->ptr)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
u_int16_t offset = s->flags & SIG_FLAG_RECURSIVE ? 0 : co->offset;
|
|
|
|
u_int16_t depth = s->flags & SIG_FLAG_RECURSIVE ? 0 : co->depth;
|
|
|
|
|
|
|
|
if (co->flags & DETECT_CONTENT_NOCASE) {
|
|
|
|
sgh->mpm_ctx->AddPatternNocase(sgh->mpm_ctx, co->content, co->content_len, offset, depth, co->id, s->num);
|
|
|
|
} else {
|
|
|
|
sgh->mpm_ctx->AddPattern(sgh->mpm_ctx, co->content, co->content_len, offset, depth, co->id, s->num);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
HashTableFree(ht);
|
|
|
|
return 0;
|
|
|
|
error:
|
|
|
|
if (ht != NULL)
|
|
|
|
HashTableFree(ht);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
*
|
|
|
|
* TODO
|
|
|
|
* - determine if a content match can set the 'single' flag
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* XXX do error checking
|
|
|
|
* XXX rewrite the COPY stuff
|
|
|
|
*/
|
|
|
|
int PatternMatchPrepareGroup(DetectEngineCtx *de_ctx, SigGroupHead *sh)
|
|
|
|
{
|
|
|
|
Signature *s;
|
|
|
|
SigMatch *sm;
|
|
|
|
u_int32_t co_cnt = 0;
|
|
|
|
u_int32_t ur_cnt = 0;
|
|
|
|
u_int32_t cnt = 0;
|
|
|
|
u_int32_t sig;
|
|
|
|
|
|
|
|
g_content_sigcnt++;
|
|
|
|
|
|
|
|
if (!(sh->flags & SIG_GROUP_HEAD_MPM_COPY))
|
|
|
|
sh->mpm_content_maxlen = 0;
|
|
|
|
|
|
|
|
if (!(sh->flags & SIG_GROUP_HEAD_MPM_URI_COPY))
|
|
|
|
sh->mpm_uricontent_maxlen = 0;
|
|
|
|
|
|
|
|
/* see if this head has content and/or uricontent */
|
|
|
|
for (sig = 0; sig < sh->sig_cnt; sig++) {
|
|
|
|
u_int32_t num = sh->match_array[sig];
|
|
|
|
|
|
|
|
s = de_ctx->sig_array[num];
|
|
|
|
if (s == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* find flow setting of this rule */
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT) {
|
|
|
|
co_cnt++;
|
|
|
|
s->flags |= SIG_FLAG_MPM;
|
|
|
|
} else if (sm->type == DETECT_URICONTENT) {
|
|
|
|
ur_cnt++;
|
|
|
|
s->flags |= SIG_FLAG_MPM;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (co_cnt > 0) {
|
|
|
|
sh->flags |= SIG_GROUP_HAVECONTENT;
|
|
|
|
}
|
|
|
|
if (ur_cnt > 0) {
|
|
|
|
sh->flags |= SIG_GROUP_HAVEURICONTENT;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* intialize contexes */
|
|
|
|
if (sh->flags & SIG_GROUP_HAVECONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_COPY)) {
|
|
|
|
/* search */
|
|
|
|
sh->mpm_ctx = malloc(sizeof(MpmCtx));
|
|
|
|
if (sh->mpm_ctx == NULL)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
MpmInitCtx(sh->mpm_ctx, PM);
|
|
|
|
}
|
|
|
|
if (sh->flags & SIG_GROUP_HAVEURICONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_URI_COPY)) {
|
|
|
|
sh->mpm_uri_ctx = malloc(sizeof(MpmCtx));
|
|
|
|
if (sh->mpm_uri_ctx == NULL)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
MpmInitCtx(sh->mpm_uri_ctx, PM);
|
|
|
|
}
|
|
|
|
|
|
|
|
//u_int16_t mpm_content_scan_maxlen = 65535, mpm_uricontent_scan_maxlen = 65535;
|
|
|
|
u_int32_t mpm_content_cnt = 0, mpm_uricontent_cnt = 0;
|
|
|
|
u_int16_t mpm_content_maxdepth = 65535, mpm_content_minoffset = 65535;
|
|
|
|
u_int16_t mpm_content_maxdepth_one = 65535, mpm_content_minoffset_one = 65535;
|
|
|
|
int mpm_content_depth_present = -1;
|
|
|
|
int mpm_content_offset_present = -1;
|
|
|
|
|
|
|
|
/* for each signature in this group do */
|
|
|
|
for (sig = 0; sig < sh->sig_cnt; sig++) {
|
|
|
|
u_int32_t num = sh->match_array[sig];
|
|
|
|
|
|
|
|
s = de_ctx->sig_array[num];
|
|
|
|
if (s == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
cnt++;
|
|
|
|
|
|
|
|
char content_added = 0;
|
|
|
|
u_int16_t content_maxlen = 0, uricontent_maxlen = 0;
|
|
|
|
u_int16_t content_minlen = 0, uricontent_minlen = 0;
|
|
|
|
u_int16_t content_cnt = 0, uricontent_cnt = 0;
|
|
|
|
u_int16_t content_maxdepth = 65535;
|
|
|
|
u_int16_t content_maxdepth_one = 65535;
|
|
|
|
u_int16_t content_minoffset = 65535;
|
|
|
|
u_int16_t content_minoffset_one = 65535;
|
|
|
|
SigMatch *sm;
|
|
|
|
|
|
|
|
/* determine the length of the longest pattern */
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_COPY)) {
|
|
|
|
DetectContentData *cd = (DetectContentData *)sm->ctx;
|
|
|
|
|
|
|
|
if (cd->content_len > content_maxlen)
|
|
|
|
content_maxlen = cd->content_len;
|
|
|
|
|
|
|
|
if (content_minlen == 0) content_minlen = cd->content_len;
|
|
|
|
else if (cd->content_len < content_minlen)
|
|
|
|
content_minlen = cd->content_len;
|
|
|
|
|
|
|
|
mpm_content_cnt++;
|
|
|
|
content_cnt++;
|
|
|
|
|
|
|
|
if (!content_added) {
|
|
|
|
content_added = 1;
|
|
|
|
}
|
|
|
|
} else if (sm->type == DETECT_URICONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_URI_COPY)) {
|
|
|
|
DetectUricontentData *ud = (DetectUricontentData *)sm->ctx;
|
|
|
|
if (ud->uricontent_len > uricontent_maxlen)
|
|
|
|
uricontent_maxlen = ud->uricontent_len;
|
|
|
|
|
|
|
|
if (uricontent_minlen == 0) uricontent_minlen = ud->uricontent_len;
|
|
|
|
else if (ud->uricontent_len < uricontent_minlen)
|
|
|
|
uricontent_minlen = ud->uricontent_len;
|
|
|
|
|
|
|
|
mpm_uricontent_cnt++;
|
|
|
|
uricontent_cnt++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* determine the min offset and max depth of the longest pattern(s) */
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_COPY)) {
|
|
|
|
DetectContentData *cd = (DetectContentData *)sm->ctx;
|
|
|
|
//if (content_maxlen < 4) {
|
|
|
|
//printf("\""); PrintRawUriFp(stdout,cd->content,cd->content_len); printf("\" ");
|
|
|
|
//}
|
|
|
|
if (cd->content_len == content_maxlen) {
|
|
|
|
if (content_maxdepth > cd->depth)
|
|
|
|
content_maxdepth = cd->depth;
|
|
|
|
|
|
|
|
if (content_minoffset > cd->offset)
|
|
|
|
content_minoffset = cd->offset;
|
|
|
|
}
|
|
|
|
} else if (sm->type == DETECT_URICONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_URI_COPY)) {
|
|
|
|
DetectUricontentData *ud = (DetectUricontentData *)sm->ctx;
|
|
|
|
if (ud->uricontent_len == uricontent_maxlen) {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
//if (content_maxlen < 4 && content_cnt) printf(" (%u, min %u, max %u)\n", content_cnt, content_minlen, content_maxlen);
|
|
|
|
|
|
|
|
int content_depth_atleastone = 0;
|
|
|
|
int content_offset_atleastone = 0;
|
|
|
|
/* determine if we have at least one pattern with a depth */
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_COPY)) {
|
|
|
|
DetectContentData *cd = (DetectContentData *)sm->ctx;
|
|
|
|
if (cd->depth) {
|
|
|
|
content_depth_atleastone = 1;
|
|
|
|
|
|
|
|
if (content_maxdepth_one > cd->depth)
|
|
|
|
content_maxdepth_one = cd->depth;
|
|
|
|
}
|
|
|
|
if (cd->offset) {
|
|
|
|
content_offset_atleastone = 1;
|
|
|
|
|
|
|
|
if (content_minoffset_one > cd->offset)
|
|
|
|
content_minoffset_one = cd->offset;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mpm_content_depth_present == -1) mpm_content_depth_present = content_depth_atleastone;
|
|
|
|
else if (content_depth_atleastone == 0) {
|
|
|
|
mpm_content_depth_present = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mpm_content_offset_present == -1) mpm_content_offset_present = content_offset_atleastone;
|
|
|
|
else if (content_offset_atleastone == 0) {
|
|
|
|
mpm_content_offset_present = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (content_maxdepth == 65535)
|
|
|
|
content_maxdepth = 0;
|
|
|
|
if (content_maxdepth_one == 65535)
|
|
|
|
content_maxdepth_one = 0;
|
|
|
|
if (content_minoffset == 65535)
|
|
|
|
content_minoffset = 0;
|
|
|
|
if (content_minoffset_one == 65535)
|
|
|
|
content_minoffset_one = 0;
|
|
|
|
|
|
|
|
if (content_maxdepth != 0) {
|
|
|
|
//printf("content_maxdepth %u (sid %u)\n", content_maxdepth, s->id);
|
|
|
|
}
|
|
|
|
if (content_minoffset != 0) {
|
|
|
|
//printf("content_minoffset %u (sid %u)\n", content_minoffset, s->id);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mpm_content_maxdepth > content_maxdepth)
|
|
|
|
mpm_content_maxdepth = content_maxdepth;
|
|
|
|
if (mpm_content_maxdepth_one > content_maxdepth_one)
|
|
|
|
mpm_content_maxdepth_one = content_maxdepth_one;
|
|
|
|
if (mpm_content_minoffset > content_minoffset)
|
|
|
|
mpm_content_minoffset = content_minoffset;
|
|
|
|
if (mpm_content_minoffset_one > content_minoffset_one)
|
|
|
|
mpm_content_minoffset_one = content_minoffset_one;
|
|
|
|
|
|
|
|
if (content_cnt) {
|
|
|
|
if (sh->mpm_content_maxlen == 0) sh->mpm_content_maxlen = content_maxlen;
|
|
|
|
if (sh->mpm_content_maxlen > content_maxlen)
|
|
|
|
sh->mpm_content_maxlen = content_maxlen;
|
|
|
|
}
|
|
|
|
if (uricontent_cnt) {
|
|
|
|
if (sh->mpm_uricontent_maxlen == 0) sh->mpm_uricontent_maxlen = uricontent_maxlen;
|
|
|
|
if (sh->mpm_uricontent_maxlen > uricontent_maxlen)
|
|
|
|
sh->mpm_uricontent_maxlen = uricontent_maxlen;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
g_content_maxlen += sh->mpm_content_maxlen;
|
|
|
|
if (sh->mpm_content_maxlen == 1) g_content_sigcnt1++;
|
|
|
|
if (sh->mpm_content_maxlen == 2) g_content_sigcnt2++;
|
|
|
|
if (sh->mpm_content_maxlen == 3) g_content_sigcnt3++;
|
|
|
|
if (sh->mpm_content_maxlen == 4) g_content_sigcnt4++;
|
|
|
|
if (sh->mpm_content_maxlen >= 5) g_content_sigcnt5++;
|
|
|
|
if (sh->mpm_content_maxlen >= 10) g_content_sigcnt10++;
|
|
|
|
|
|
|
|
/* see if we will use the scanning phase */
|
|
|
|
// if (sh->mpm_content_maxlen == 1) {
|
|
|
|
// sh->flags |= SIG_GROUP_HEAD_MPM_NOSCAN;
|
|
|
|
// printf("(%p) noscan set (%s)\n", sh, sh->flags & SIG_GROUP_HEAD_MPM_NOSCAN ? "TRUE":"FALSE");
|
|
|
|
// }
|
|
|
|
// if (sh->mpm_uricontent_maxlen < 4) sh->flags |= SIG_GROUP_HEAD_MPM_URI_NOSCAN;
|
|
|
|
|
|
|
|
/* add the signatures */
|
|
|
|
for (sig = 0; sig < sh->sig_cnt; sig++) {
|
|
|
|
u_int32_t num = sh->match_array[sig];
|
|
|
|
|
|
|
|
s = de_ctx->sig_array[num];
|
|
|
|
if (s == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
u_int16_t content_maxlen = 0, uricontent_maxlen = 0;
|
|
|
|
u_int16_t content_minlen = 0, uricontent_minlen = 0;
|
|
|
|
|
|
|
|
/* determine the length of the longest pattern */
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_CONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_COPY)) {
|
|
|
|
DetectContentData *cd = (DetectContentData *)sm->ctx;
|
|
|
|
|
|
|
|
if (cd->content_len > content_maxlen)
|
|
|
|
content_maxlen = cd->content_len;
|
|
|
|
|
|
|
|
if (content_minlen == 0) content_minlen = cd->content_len;
|
|
|
|
else if (cd->content_len < content_minlen)
|
|
|
|
content_minlen = cd->content_len;
|
|
|
|
} else if (sm->type == DETECT_URICONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_URI_COPY)) {
|
|
|
|
DetectUricontentData *ud = (DetectUricontentData *)sm->ctx;
|
|
|
|
if (ud->uricontent_len > uricontent_maxlen)
|
|
|
|
uricontent_maxlen = ud->uricontent_len;
|
|
|
|
|
|
|
|
if (uricontent_minlen == 0) uricontent_minlen = ud->uricontent_len;
|
|
|
|
else if (ud->uricontent_len < uricontent_minlen)
|
|
|
|
uricontent_minlen = ud->uricontent_len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
char content_scanadded = 0, uricontent_scanadded = 0;
|
|
|
|
for (sm = s->match; sm != NULL; sm = sm->next) {
|
|
|
|
if (sm->type == DETECT_URICONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_URI_COPY)) {
|
|
|
|
DetectUricontentData *ud = (DetectUricontentData *)sm->ctx;
|
|
|
|
|
|
|
|
/* only add the pattern if:
|
|
|
|
* noscan is not set, we didn't add a pattern already, length
|
|
|
|
* is the same as maxlen (ie we only add the longest pattern) */
|
|
|
|
if (!(sh->flags & SIG_GROUP_HEAD_MPM_URI_NOSCAN) && !uricontent_scanadded && uricontent_maxlen == ud->uricontent_len) {
|
|
|
|
if (ud->flags & DETECT_URICONTENT_NOCASE) {
|
|
|
|
sh->mpm_uri_ctx->AddScanPatternNocase(sh->mpm_uri_ctx, ud->uricontent, ud->uricontent_len, 0, 0, ud->id, s->num, 0);
|
|
|
|
} else {
|
|
|
|
sh->mpm_uri_ctx->AddScanPattern(sh->mpm_uri_ctx, ud->uricontent, ud->uricontent_len, 0, 0, ud->id, s->num, 0);
|
|
|
|
}
|
|
|
|
uricontent_scanadded = 1;
|
|
|
|
} else {
|
|
|
|
if (ud->flags & DETECT_URICONTENT_NOCASE) {
|
|
|
|
sh->mpm_uri_ctx->AddPatternNocase(sh->mpm_uri_ctx, ud->uricontent, ud->uricontent_len, 0, 0, ud->id, s->num);
|
|
|
|
} else {
|
|
|
|
sh->mpm_uri_ctx->AddPattern(sh->mpm_uri_ctx, ud->uricontent, ud->uricontent_len, 0, 0, ud->id, s->num);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
content_scanadded = 0;
|
|
|
|
uricontent_scanadded = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* content */
|
|
|
|
if (sh->flags & SIG_GROUP_HAVECONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_COPY)) {
|
|
|
|
PatternMatchPreprarePopulateMpm(de_ctx, sh);
|
|
|
|
|
|
|
|
if (sh->mpm_ctx->Prepare != NULL) {
|
|
|
|
sh->mpm_ctx->Prepare(sh->mpm_ctx);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mpm_content_maxdepth) {
|
|
|
|
// printf("mpm_content_maxdepth %u\n", mpm_content_maxdepth);
|
|
|
|
g_content_maxdepth++;
|
|
|
|
}
|
|
|
|
if (mpm_content_minoffset) {
|
|
|
|
// printf("mpm_content_minoffset %u\n", mpm_content_minoffset);
|
|
|
|
g_content_minoffset++;
|
|
|
|
}
|
|
|
|
g_content_total++;
|
|
|
|
|
|
|
|
//if (mpm_content_depth_present) printf("(sh %p) at least one depth: %d, depth %u\n", sh, mpm_content_depth_present, mpm_content_maxdepth_one);
|
|
|
|
//if (mpm_content_offset_present) printf("(sh %p) at least one offset: %d, offset %u\n", sh, mpm_content_offset_present, mpm_content_minoffset_one);
|
|
|
|
|
|
|
|
//sh->mpm_ctx->PrintCtx(sh->mpm_ctx);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* uricontent */
|
|
|
|
if (sh->flags & SIG_GROUP_HAVEURICONTENT && !(sh->flags & SIG_GROUP_HEAD_MPM_URI_COPY)) {
|
|
|
|
if (sh->mpm_uri_ctx->Prepare != NULL) {
|
|
|
|
sh->mpm_uri_ctx->Prepare(sh->mpm_uri_ctx);
|
|
|
|
}
|
|
|
|
if (mpm_uricontent_cnt && sh->mpm_uricontent_maxlen > 1) {
|
|
|
|
// printf("mpm_uricontent_cnt %u, mpm_uricontent_maxlen %d\n", mpm_uricontent_cnt, mpm_uricontent_maxlen);
|
|
|
|
g_uricontent_scan++;
|
|
|
|
} else {
|
|
|
|
g_uricontent_search++;
|
|
|
|
}
|
|
|
|
|
|
|
|
//sh->mpm_uri_ctx->PrintCtx(sh->mpm_uri_ctx);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
error:
|
|
|
|
/* XXX */
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int PatternMatcherThreadInit(ThreadVars *t, void *initdata, void **data) {
|
|
|
|
DetectEngineCtx *de_ctx = (DetectEngineCtx *)initdata;
|
|
|
|
if (de_ctx == NULL)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
PatternMatcherThread *pmt = malloc(sizeof(PatternMatcherThread));
|
|
|
|
if (pmt == NULL) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
memset(pmt, 0, sizeof(PatternMatcherThread));
|
|
|
|
|
|
|
|
/* XXX we still depend on the global mpm_ctx here
|
|
|
|
*
|
|
|
|
* Initialize the thread pattern match ctx with the max size
|
|
|
|
* of the content and uricontent id's so our match lookup
|
|
|
|
* table is always big enough
|
|
|
|
*/
|
|
|
|
mpm_ctx[0].InitThreadCtx(&mpm_ctx[0], &pmt->mtc, DetectContentMaxId(de_ctx));
|
|
|
|
mpm_ctx[0].InitThreadCtx(&mpm_ctx[0], &pmt->mtcu, DetectUricontentMaxId(de_ctx));
|
|
|
|
u_int32_t max_sig_id = DetectEngineGetMaxSigId(de_ctx);
|
|
|
|
|
|
|
|
/* sig callback testing stuff below */
|
|
|
|
pmt->pmq.sig_id_array = malloc(max_sig_id * sizeof(u_int32_t));
|
|
|
|
if (pmt->pmq.sig_id_array == NULL) {
|
|
|
|
printf("ERROR: could not setup memory for pattern matcher: %s\n", strerror(errno));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
memset(pmt->pmq.sig_id_array, 0, max_sig_id * sizeof(u_int32_t));
|
|
|
|
pmt->pmq.sig_id_array_cnt = 0;
|
|
|
|
/* lookup bitarray */
|
|
|
|
pmt->pmq.sig_bitarray = malloc(max_sig_id / 8 + 1);
|
|
|
|
if (pmt->pmq.sig_bitarray == NULL) {
|
|
|
|
printf("ERROR: could not setup memory for pattern matcher: %s\n", strerror(errno));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
memset(pmt->pmq.sig_bitarray, 0, max_sig_id / 8 + 1);
|
|
|
|
|
|
|
|
/* IP-ONLY */
|
|
|
|
DetectEngineIPOnlyThreadInit(de_ctx,&pmt->io_ctx);
|
|
|
|
|
|
|
|
*data = (void *)pmt;
|
|
|
|
//printf("PatternMatcherThreadInit: data %p pmt %p\n", *data, pmt);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int PatternMatcherThreadDeinit(ThreadVars *t, void *data) {
|
|
|
|
PatternMatcherThread *pmt = (PatternMatcherThread *)data;
|
|
|
|
|
|
|
|
/* XXX */
|
|
|
|
mpm_ctx[0].DestroyThreadCtx(&mpm_ctx[0], &pmt->mtc);
|
|
|
|
mpm_ctx[0].DestroyThreadCtx(&mpm_ctx[0], &pmt->mtcu);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void PatternMatcherThreadInfo(ThreadVars *t, PatternMatcherThread *pmt) {
|
|
|
|
/* XXX */
|
|
|
|
mpm_ctx[0].PrintThreadCtx(&pmt->mtc);
|
|
|
|
mpm_ctx[0].PrintThreadCtx(&pmt->mtcu);
|
|
|
|
}
|
|
|
|
|