/*
Add Pattern States
*/
static void
AddPatternStates (ACSM_STRUCT * acsm, ACSM_PATTERN * p)
{
unsigned char *pattern;
int state=0, next, n;
n = p->n;
pattern = p->patrn;
/*
* Match up pattern with existing states
*/
for (; n > 0; pattern++, n--)
{
next = acsm->acsmStateTable[state].NextState[*pattern];
if (next == ACSM_FAIL_STATE)
break;
state = next;
}
/*
* Add new states for the rest of the pattern bytes, 1 state per byte
*/
for (; n > 0; pattern++, n--)
{
acsm->acsmNumStates++;
acsm->acsmStateTable[state].NextState[*pattern] = acsm->acsmNumStates;
state = acsm->acsmNumStates;
}
AddMatchListEntry (acsm, state, p);
}
/*
* Add Pattern States
*/
static void AddPatternStates (ACSM_STRUCT * acsm, ACSM_PATTERN * p)
{
unsigned char *pattern;
int state=0, next, n;
n = p->n; /*The number of alpha in the pattern string*/
pattern = p->patrn;
/*
* Match up pattern with existing states
*/
for (; n > 0; pattern++, n--)
{
next = acsm->acsmStateTable[state].NextState[*pattern];
if (next == ACSM_FAIL_STATE)
break;
state = next;
}
/*
* Add new states for the rest of the pattern bytes, 1 state per byte
*/
int i;
for (; n > 0; pattern++, n--)
{
acsm->acsmNumStates++;
/* del by ybr, moidify for c
ACSM_STATETABLE state_p;
state_p.MatchList=0;
acsm->acsmStateTable.push_back(state_p);
for (i = 0; i < ALPHABET_SIZE; i++)
{
acsm->acsmStateTable[acsm->acsmNumStates].NextState[i] = ACSM_FAIL_STATE;
}*/
acsm->acsmStateTable[state].NextState[*pattern] = acsm->acsmNumStates;
state = acsm->acsmNumStates;
}
/*Here,An accept state,just add into the MatchListof the state*/
AddMatchListEntry (acsm, state, p);
}
/*
* Build Non-Deterministic Finite Automata
*/
static void Build_DFA (ACSM_STRUCT * acsm)
{
int r, s;
int i;
QUEUE q, *queue = &q;
ACSM_PATTERN * mlist=0;
ACSM_PATTERN * px=0;
/* Init a Queue */
queue_init (queue);
/* Add the state 0 transitions 1st */
/*1st depth Node's FailState is 0, fail(x)=0 */
for (i = 0; i < ALPHABET_SIZE; i++)
{
s = acsm->acsmStateTable[0].NextState[i];
if (s)
{
queue_add (queue, s);
acsm->acsmStateTable[s].FailState = 0;
}
}
/* Build the fail state transitions for each valid state */
while (queue_count (queue) > 0)
{
r = queue_remove (queue);
/* Find Final States for any Failure */
for (i = 0; i < ALPHABET_SIZE; i++)
{
int fs, next;
/*** Note NextState[i] is a const variable in this block ***/
if ((s = acsm->acsmStateTable[r].NextState[i]) != ACSM_FAIL_STATE)
{
queue_add (queue, s);
fs = acsm->acsmStateTable[r].FailState;
/*
* Locate the next valid state for 'i' starting at s
*/
/**** Note the variable "next" ****/
/*** Note "NextState[i]" is a const variable in this block ***/
while ((next=acsm->acsmStateTable[fs].NextState[i]) ==
ACSM_FAIL_STATE)
{
fs = acsm->acsmStateTable[fs].FailState;
}
/*
* Update 's' state failure state to point to the next valid state
*/
acsm->acsmStateTable[s].FailState = next;
ACSM_PATTERN* pat = acsm->acsmStateTable[next].MatchList;
for (; pat != NULL; pat = pat->next)
{
AddMatchListEntry(acsm, s, pat);
}
}
else
{
acsm->acsmStateTable[r].NextState[i] =
acsm->acsmStateTable[acsm->acsmStateTable[r].FailState].NextState[i];
}
}
}
/* Clean up the queue */
queue_free (queue);
}
