static int
init_conf(void)
{
Gra2cairoConf = g_malloc(sizeof(*Gra2cairoConf));
if (Gra2cairoConf == NULL)
return 1;
Gra2cairoConf->fontmap = nhash_new();
if (Gra2cairoConf->fontmap == NULL) {
g_free(Gra2cairoConf);
Gra2cairoConf = NULL;
return 1;
}
Gra2cairoConf->fontmap_list_root = NULL;
Gra2cairoConf->font_num = 0;
if (loadconfig()) {
free_fonts(Gra2cairoConf);
nhash_free(Gra2cairoConf->fontmap);
g_free(Gra2cairoConf);
Gra2cairoConf = NULL;
return 1;
}
return 0;
}
static void
free_conf(void)
{
if (Gra2cairoConf == NULL)
return;
free_fonts(Gra2cairoConf);
nhash_free(Gra2cairoConf->fontmap);
g_free(Gra2cairoConf);
Gra2cairoConf = NULL;
}
static void nhash_rebuild_table () {
int i, oldsize;
struct nhash_list *oldtable, *tableptr, *ntableptr, *newptr;
unsigned int hashval;
oldtable = table;
oldsize = nhash_tablesize;
nhash_load = 0;
for (i=0; primes[i] < nhash_tablesize; i++) { }
nhash_tablesize = primes[(i+1)];
table = xxcalloc(nhash_tablesize,sizeof(struct nhash_list));
for (i=0; i < oldsize;i++) {
if ((oldtable+i)->size == 0) {
continue;
}
tableptr = oldtable+i;
for ( ; tableptr != NULL; (tableptr = tableptr->next)) {
/* rehash */
hashval = hashf(set_table+tableptr->set_offset,tableptr->size);
ntableptr = table+hashval;
if (ntableptr->size == 0) {
nhash_load++;
ntableptr->size = tableptr->size;
ntableptr->set_offset = tableptr->set_offset;
ntableptr->setnum = tableptr->setnum;
ntableptr->next = NULL;
} else {
newptr = xxmalloc(sizeof(struct nhash_list));
newptr->next = ntableptr->next;
ntableptr->next = newptr;
newptr->setnum = tableptr->setnum;
newptr->size = tableptr->size;
newptr->set_offset = tableptr->set_offset;
}
}
}
nhash_free(oldtable, oldsize);
}
static struct fsm *fsm_subset(struct fsm *net, int operation) {
int T, U;
if (net->is_deterministic == YES && operation != SUBSET_TEST_STAR_FREE) {
return(net);
}
/* Export this var */
op = operation;
fsm_count(net);
num_states = net->statecount;
deterministic = 1;
init(net);
nhash_init((num_states < 12) ? 6 : num_states/2);
T = initial_e_closure(net);
int_stack_clear();
if (deterministic == 1 && epsilon_symbol == -1 && num_start_states == 1 && numss == 0) {
net->is_deterministic = YES;
net->is_epsilon_free = YES;
nhash_free(table, nhash_tablesize);
xxfree(T_ptr);
xxfree(e_table);
xxfree(trans_list);
xxfree(trans_array);
xxfree(double_sigma_array);
xxfree(single_sigma_array);
xxfree(finals);
xxfree(temp_move);
xxfree(set_table);
return(net);
}
if (operation == SUBSET_EPSILON_REMOVE && epsilon_symbol == -1) {
net->is_epsilon_free = YES;
nhash_free(table, nhash_tablesize);
xxfree(T_ptr);
xxfree(e_table);
xxfree(trans_list);
xxfree(trans_array);
xxfree(double_sigma_array);
xxfree(single_sigma_array);
xxfree(finals);
xxfree(temp_move);
xxfree(set_table);
return(net);
}
if (operation == SUBSET_TEST_STAR_FREE) {
fsm_state_init(sigma_max(net->sigma)+1);
star_free_mark = 0;
} else {
fsm_state_init(sigma_max(net->sigma));
xxfree(net->states);
}
/* init */
do {
int i, j, tail, setsize, *theset, stateno, has_trans, minsym, next_minsym, trgt, symbol_in, symbol_out;
struct trans_list *transitions;
struct trans_array *tptr;
fsm_state_set_current_state(T, (T_ptr+T)->finalstart, T == 0 ? 1 : 0);
/* Prepare set */
setsize = (T_ptr+T)->size;
theset = set_table+(T_ptr+T)->set_offset;
minsym = INT_MAX;
has_trans = 0;
for (i = 0; i < setsize; i++) {
stateno = *(theset+i);
tptr = trans_array+stateno;
tptr->tail = 0;
if (tptr->size == 0)
continue;
if ((tptr->transitions)->inout < minsym) {
minsym = (tptr->transitions)->inout;
has_trans = 1;
}
}
if (!has_trans) {
/* close state */
fsm_state_end_state();
continue;
}
/* While set not empty */
for (next_minsym = INT_MAX; minsym != INT_MAX ; minsym = next_minsym, next_minsym = INT_MAX) {
theset = set_table+(T_ptr+T)->set_offset;
for (i = 0, j = 0 ; i < setsize; i++) {
stateno = *(theset+i);
tptr = trans_array+stateno;
tail = tptr->tail;
transitions = (tptr->transitions)+tail;
while (tail < tptr->size && transitions->inout == minsym) {
trgt = transitions->target;
if (*(e_table+(trgt)) != mainloop) {
*(e_table+(trgt)) = mainloop;
*(temp_move+j) = trgt;
j++;
if (operation == SUBSET_EPSILON_REMOVE) {
mainloop++;
if ((U = e_closure(j)) != -1) {
single_symbol_to_symbol_pair(minsym, &symbol_in, &symbol_out);
fsm_state_add_arc(T, symbol_in, symbol_out, U, (T_ptr+T)->finalstart, T == 0 ? 1 : 0);
j = 0;
}
}
}
tail++;
transitions++;
}
tptr->tail = tail;
if (tail == tptr->size)
continue;
/* Check next minsym */
if (transitions->inout < next_minsym) {
next_minsym = transitions->inout;
}
}
if (operation == SUBSET_DETERMINIZE) {
mainloop++;
if ((U = e_closure(j)) != -1) {
single_symbol_to_symbol_pair(minsym, &symbol_in, &symbol_out);
fsm_state_add_arc(T, symbol_in, symbol_out, U, (T_ptr+T)->finalstart, T == 0 ? 1 : 0);
}
}
if (operation == SUBSET_TEST_STAR_FREE) {
mainloop++;
if ((U = e_closure(j)) != -1) {
single_symbol_to_symbol_pair(minsym, &symbol_in, &symbol_out);
fsm_state_add_arc(T, symbol_in, symbol_out, U, (T_ptr+T)->finalstart, T == 0 ? 1 : 0);
if (star_free_mark == 1) {
//fsm_state_add_arc(T, maxsigma, maxsigma, U, (T_ptr+T)->finalstart, T == 0 ? 1 : 0);
star_free_mark = 0;
}
}
}
}
/* end state */
fsm_state_end_state();
} while ((T = next_unmarked()) != -1);
/* wrapup() */
nhash_free(table, nhash_tablesize);
xxfree(set_table);
xxfree(T_ptr);
xxfree(temp_move);
xxfree(e_table);
xxfree(trans_list);
xxfree(trans_array);
if (epsilon_symbol != -1)
e_closure_free();
xxfree(double_sigma_array);
xxfree(single_sigma_array);
xxfree(finals);
fsm_state_close(net);
return(net);
}
