mirror of https://github.com/OISF/suricata
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
104 lines
2.6 KiB
C
104 lines
2.6 KiB
C
17 years ago
|
#ifndef __UTIL_MPM_B2G_H__
|
||
|
|
#define __UTIL_MPM_B2G_H__
|
||
|
|
|
||
|
|
#include "util-mpm.h"
|
||
|
|
#include "util-bloomfilter.h"
|
||
|
|
|
||
|
|
#define B2G_NOCASE 0x01
|
||
|
|
#define B2G_SCAN 0x02
|
||
|
|
|
||
|
|
//#define B2G_HASHSIZE 65536
|
||
|
|
#define B2G_HASHSIZE 16384
|
||
|
|
//#define B2G_HASHSHIFT 8
|
||
|
|
#define B2G_HASHSHIFT 6
|
||
|
|
#define B2G_TYPE u_int32_t
|
||
|
|
//#define B2G_TYPE u_int16_t
|
||
|
|
//#define B2G_TYPE u_int8_t
|
||
|
|
//#define B2G_WORD_SIZE 16
|
||
|
|
//#define B2G_WORD_SIZE 8
|
||
|
|
#define B2G_WORD_SIZE 32
|
||
|
|
static int B2G_S0 = 1;
|
||
|
|
|
||
|
|
#define B2G_BLOOMSIZE 512
|
||
|
|
|
||
|
|
#define B2G_HASH16(a,b) (((a)<<B2G_HASHSHIFT) | (b))
|
||
|
|
#define B2G_Q 2
|
||
|
|
|
||
|
|
//#define B2G_COUNTERS
|
||
|
|
|
||
|
|
typedef struct _B2gPattern {
|
||
|
|
u_int8_t *cs; /* case sensitive */
|
||
|
|
u_int8_t *ci; /* case INsensitive */
|
||
|
|
u_int16_t len;
|
||
|
|
struct _B2gPattern *next;
|
||
|
|
u_int16_t prefix_ci;
|
||
|
|
u_int16_t prefix_cs;
|
||
|
|
u_int8_t flags;
|
||
|
|
MpmEndMatch *em;
|
||
|
|
} B2gPattern;
|
||
|
|
|
||
|
|
typedef struct _B2gHashItem_ {
|
||
|
|
u_int8_t flags;
|
||
|
|
u_int16_t idx;
|
||
|
|
struct _B2gHashItem_ *nxt;
|
||
|
|
u_int8_t p_min_len;
|
||
|
|
} B2gHashItem;
|
||
|
|
|
||
|
|
typedef struct _B2gCtx {
|
||
|
|
/* hash used during ctx initialization */
|
||
|
|
B2gPattern **init_hash;
|
||
|
|
|
||
|
|
B2G_TYPE scan_m;
|
||
|
|
B2G_TYPE search_m;
|
||
|
|
B2G_TYPE *scan_B2G;
|
||
|
|
B2G_TYPE *search_B2G;
|
||
|
|
|
||
|
|
u_int16_t scan_shiftlen;
|
||
|
|
u_int16_t search_shiftlen;
|
||
|
|
|
||
|
|
u_int32_t scan_hash_size;
|
||
|
|
B2gHashItem **scan_hash;
|
||
|
|
BloomFilter **scan_bloom;
|
||
|
|
B2gHashItem scan_hash1[256];
|
||
|
|
u_int32_t search_hash_size;
|
||
|
|
B2gHashItem **search_hash;
|
||
|
|
B2gHashItem search_hash1[256];
|
||
|
|
|
||
|
|
/* we store our own multi byte scan ptr here for B2gSearch1 */
|
||
|
|
u_int32_t (*MBScan)(struct _MpmCtx *, struct _MpmThreadCtx *, PatternMatcherQueue *, u_int8_t *, u_int16_t);
|
||
|
|
/* we store our own multi byte search ptr here for B2gSearch1 */
|
||
|
|
u_int32_t (*MBSearch)(struct _MpmCtx *, struct _MpmThreadCtx *, PatternMatcherQueue *, u_int8_t *, u_int16_t);
|
||
|
|
|
||
|
|
/* pattern arrays */
|
||
|
|
B2gPattern **parray;
|
||
|
|
} B2gCtx;
|
||
|
|
|
||
|
|
typedef struct _B2gThreadCtx {
|
||
|
|
#ifdef B2G_COUNTERS
|
||
|
|
u_int32_t scan_stat_pminlen_calls;
|
||
|
|
u_int32_t scan_stat_pminlen_total;
|
||
|
|
u_int32_t scan_stat_bloom_calls;
|
||
|
|
u_int32_t scan_stat_bloom_hits;
|
||
|
|
u_int32_t scan_stat_calls;
|
||
|
|
u_int32_t scan_stat_m_total;
|
||
|
|
u_int32_t scan_stat_d0;
|
||
|
|
u_int32_t scan_stat_d0_hashloop;
|
||
|
|
u_int32_t scan_stat_loop_match;
|
||
|
|
u_int32_t scan_stat_loop_no_match;
|
||
|
|
u_int32_t scan_stat_num_shift;
|
||
|
|
u_int32_t scan_stat_total_shift;
|
||
|
|
|
||
|
|
u_int32_t search_stat_d0;
|
||
|
|
u_int32_t search_stat_loop_match;
|
||
|
|
u_int32_t search_stat_loop_no_match;
|
||
|
|
u_int32_t search_stat_num_shift;
|
||
|
|
u_int32_t search_stat_total_shift;
|
||
|
|
#endif /* B2G_COUNTERS */
|
||
|
|
} B2gThreadCtx;
|
||
|
|
|
||
|
|
void MpmB2gRegister(void);
|
||
|
|
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|