⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 dfa_malloc.c

📁 about sound recognition.i want to downlod
💻 C
字号:
/** * @file   dfa_malloc.c * @author Akinobu LEE * @date   Tue Feb 15 14:16:03 2005 *  * <JA> * @brief  矢恕菇陇挛のメモリ充り烧けと倡庶 * </JA> *  * <EN> * @brief  Memory allocation of grammar information * </EN> *  * $Revision: 1.3 $ *  *//* * Copyright (c) 1991-2006 Kawahara Lab., Kyoto University * Copyright (c) 2000-2005 Shikano Lab., Nara Institute of Science and Technology * Copyright (c) 2005-2006 Julius project team, Nagoya Institute of Technology * All rights reserved */#include <sent/stddefs.h>#include <sent/dfa.h>/**  * Allocate a new grammar information data structure and initialize it. *  * @return pointer to the newly allocated DFA_INFO. */DFA_INFO *dfa_info_new(){  DFA_INFO *new;  new = (DFA_INFO *)mymalloc(sizeof(DFA_INFO));  init_dfa_cp(new);  new->term.tw = NULL;  new->term.term_num = new->term_num = 0;  new->maxstatenum = 0;  new->is_sp = NULL;  new->sp_id = WORD_INVALID;  return new;}/**  * Free all informations in the DFA_INFO. *  * @param dfa [i/o] grammar information data to be freed. */voiddfa_info_free(DFA_INFO *dfa){  DFA_ARC *arc, *tmparc;  TERM_INFO *tinfo;  int i;  /* free category pair info */  free_dfa_cp(dfa);    /* free terminal info */  if (dfa->term_num != 0) {    tinfo = &(dfa->term);    if (tinfo->tw != NULL) {      for(i=0;i<tinfo->term_num;i++) {	free(tinfo->tw[i]);      }      free(tinfo->tw);      free(tinfo->wnum);    }  }  /* free arcs */  if (dfa->maxstatenum > 0) {    for(i=0;i<dfa->state_num;i++) {      arc=dfa->st[i].arc;      while(arc != NULL) {	tmparc = arc->next;	free(arc);	arc = tmparc;      }    }    /* free states */    free(dfa->st);  }  if (dfa->is_sp != NULL) free(dfa->is_sp);  /* free whole */  free(dfa);}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -