void
mdef_free_recursive_rc(ph_rc_t * rc)
{
if (rc == NULL)
return;
if (rc->next)
mdef_free_recursive_rc(rc->next);
ckd_free((void *) rc);
}
void
mdef_free(mdef_t * m)
{
int i, j;
if (m) {
if (m->sen2cimap)
ckd_free((void *) m->sen2cimap);
if (m->cd2cisen)
ckd_free((void *) m->cd2cisen);
/* RAH, go down the ->next list and delete all the pieces */
for (i = 0; i < N_WORD_POSN; i++)
for (j = 0; j < m->n_ciphone; j++)
if (m->wpos_ci_lclist[i][j]) {
mdef_free_recursive_lc(m->wpos_ci_lclist[i][j]->next);
mdef_free_recursive_rc(m->wpos_ci_lclist[i][j]->
rclist);
}
for (i = 0; i < N_WORD_POSN; i++)
for (j = 0; j < m->n_ciphone; j++)
if (m->wpos_ci_lclist[i][j])
ckd_free((void *) m->wpos_ci_lclist[i][j]);
if (m->wpos_ci_lclist)
ckd_free_2d((void *) m->wpos_ci_lclist);
if (m->sseq)
ckd_free_2d((void *) m->sseq);
/* Free phone context */
if (m->phone)
ckd_free((void *) m->phone);
if (m->ciphone_ht)
hash_table_free(m->ciphone_ht);
for (i = 0; i < m->n_ciphone; i++) {
if (m->ciphone[i].name)
ckd_free((void *) m->ciphone[i].name);
}
if (m->ciphone)
ckd_free((void *) m->ciphone);
if (m->st2senmap)
ckd_free((void *) m->st2senmap);
ckd_free((void *) m);
}
}
/* RAH 4.19.01, Attempt to free memory that was allocated within this module
I have not verified that all the memory has been freed. I've taken only a
reasonable effort for now.
RAH 4.24.01 - verified that all memory is released.
*/
void
mdef_free_recursive_lc(ph_lc_t * lc)
{
if (lc == NULL)
return;
if (lc->rclist)
mdef_free_recursive_rc(lc->rclist);
if (lc->next)
mdef_free_recursive_lc(lc->next);
ckd_free((void *) lc);
}
