re_free
re_free (dfa->org_indices);
re_free (dfa->subexp_map);
re_free (new_array_start);
re_free (new_array_end);
re_free (sbcset);
re_free (mbcset);
re_free (sbcset);
re_free (sbcset);
re_free (sbcset);
re_free (sbcset);
re_free (sbcset);
re_free (cset->mbchars);
re_free (cset->coll_syms);
re_free (cset->equiv_classes);
re_free (cset->range_starts);
re_free (cset->range_ends);
re_free (cset->char_classes);
re_free (cset);
re_free (node->opr.sbcset);
re_free (preg->fastmap);
re_free (dfa->nexts);
re_free (dfa->edests);
re_free (dfa->eclosures);
re_free (dfa->inveclosures);
re_free (dfa->nodes);
re_free (entry->array);
re_free (dfa->state_table);
re_free (dfa->sb_char);
re_free (dfa->subexp_map);
re_free (dfa->re_str);
re_free (dfa);
re_free (preg->fastmap);
re_free (preg->translate);
re_free (storage);
re_free (new_nexts);
re_free (new_indices);
re_free (new_edests);
re_free (new_eclosures);
re_free (state->entrance_nodes);
re_free (state->word_trtable);
re_free (state->trtable);
re_free (state);
re_free (newstate);
re_free (newstate);
re_free (pstr->wcs);
re_free (pstr->offsets);
re_free (pstr->mbs);
#define re_node_set_free(set) re_free ((set)->elems)
re_free (sifted_states);
re_free (lim_states);
re_free (fs->stack[num].regs);
re_free (prev_idx_match);
re_free (prev_idx_match);
re_free (prev_idx_match);
re_free (prev_idx_match);
re_free (prev_idx_match);
re_free (fs->stack[fs_idx].regs);
re_free (fs->stack);
re_free (dests_alloc);
re_free (dest_states);
re_free (dests_alloc);
re_free (dest_states);
re_free (dests_alloc);
re_free (s);
re_free (last->path.array);
re_free (last);
re_free (top->lasts);
re_free (top->path->array);
re_free (top->path);
re_free (top);
re_free (mctx->sub_tops);
re_free (mctx->bkref_ents);
re_free (mctx->bkref_ents);
re_free (pmatch);
re_free (regs->start);
re_free (new_start);
re_free (mctx.state_log);
re_free (lim_states);
re_free (mctx->state_log);