/*
* Compile State Machine
*/
int acsmCompile (ACSM_STRUCT * acsm)
{
int i, k;
ACSM_PATTERN * plist;
/* Count number of states */
acsm->acsmMaxStates = 1; /*State 0*/
for (plist = acsm->acsmPatterns; plist != NULL; plist = plist->next)
{
acsm->acsmMaxStates += plist->n;
}
acsm->acsmStateTable = (ACSM_STATETABLE *) AC_MALLOC (sizeof (ACSM_STATETABLE) * acsm->acsmMaxStates);
// MEMASSERT (acsm->acsmStateTable, "acsmCompile");
memset (acsm->acsmStateTable, 0,sizeof (ACSM_STATETABLE) * acsm->acsmMaxStates);
/* Initialize state zero as a branch */
acsm->acsmNumStates = 0;
/*
//del by ybr, modify to c
ACSM_STATETABLE state_p;
state_p.MatchList=0;
acsm->acsmStateTable.push_back(state_p);
for (i = 0; i < ALPHABET_SIZE; i++)
{
acsm->acsmStateTable[0].NextState[i] = ACSM_FAIL_STATE;
}
*/
/* Initialize all States NextStates to FAILED */
for (k = 0; k < acsm->acsmMaxStates; k++)
{
for (i = 0; i < ALPHABET_SIZE; i++)
{
acsm->acsmStateTable[k].NextState[i] = ACSM_FAIL_STATE;
}
}
/* This is very import */
/* Add each Pattern to the State Table */
for (plist = acsm->acsmPatterns; plist != NULL; plist = plist->next)
{
AddPatternStates (acsm, plist);
}
/* Set all failed state transitions which from state 0 to return to the 0'th state */
for (i = 0; i < ALPHABET_SIZE; i++)
{
if (acsm->acsmStateTable[0].NextState[i] == ACSM_FAIL_STATE)
{
acsm->acsmStateTable[0].NextState[i] = 0;
}
}
/* Build the NFA */
Build_DFA (acsm);
{
// std::vector<ACSM_STATETABLE>(acsm->acsmStateTable).swap(acsm->acsmStateTable);
}
return 0;
}
/*
* Compile State Machine
*/
int
acsmCompile (ACSM_STRUCT * acsm
#ifdef DETECTION_OPTION_TREE
, int (*build_tree)(void * id, void **existing_tree)
#endif
)
{
int i, k;
ACSM_PATTERN * plist;
/* Count number of states */
acsm->acsmMaxStates = 1;
for (plist = acsm->acsmPatterns; plist != NULL; plist = plist->next)
{
acsm->acsmMaxStates += plist->n;
}
acsm->acsmStateTable =
(ACSM_STATETABLE *) AC_MALLOC (sizeof (ACSM_STATETABLE) *
acsm->acsmMaxStates);
MEMASSERT (acsm->acsmStateTable, "acsmCompile");
memset (acsm->acsmStateTable, 0,
sizeof (ACSM_STATETABLE) * acsm->acsmMaxStates);
/* Initialize state zero as a branch */
acsm->acsmNumStates = 0;
/* Initialize all States NextStates to FAILED */
for (k = 0; k < acsm->acsmMaxStates; k++)
{
for (i = 0; i < ALPHABET_SIZE; i++)
{
acsm->acsmStateTable[k].NextState[i] = ACSM_FAIL_STATE;
}
}
/* Add each Pattern to the State Table */
for (plist = acsm->acsmPatterns; plist != NULL; plist = plist->next)
{
AddPatternStates (acsm, plist);
}
/* Set all failed state transitions to return to the 0'th state */
for (i = 0; i < ALPHABET_SIZE; i++)
{
if (acsm->acsmStateTable[0].NextState[i] == ACSM_FAIL_STATE)
{
acsm->acsmStateTable[0].NextState[i] = 0;
}
}
/* Build the NFA */
Build_NFA (acsm);
/* Convert the NFA to a DFA */
Convert_NFA_To_DFA (acsm);
/*
printf ("ACSMX-Max Memory: %d bytes, %d states\n", max_memory,
acsm->acsmMaxStates);
*/
//Print_DFA( acsm );
#ifdef DETECTION_OPTION_TREE
if (build_tree)
{
acsmBuildMatchStateTrees(acsm, build_tree);
}
#endif
return 0;
}