IR_GVN::~IR_GVN() { for (SVECTOR<VN*> * v = m_vec_lst.get_head(); v != NULL; v = m_vec_lst.get_next()) { delete v; } smpool_free_handle(m_pool); }
void GRAPH::destroy() { if (m_pool == NULL) return; m_edges.destroy(); m_vertexs.destroy(); //Set if edge and vertex would not be redundantly. m_is_unique = false; m_is_direction = false; //Set if graph is direction. m_e_free_list.clean(); //edge free list m_el_free_list.clean(); //edge-list free list m_v_free_list.clean(); //vertex free list smpool_free_handle(m_pool); m_pool = NULL; }