299 |
|
|
300 |
for (m = cur_acct->mboxes; m != NULL; m = m->next) |
for (m = cur_acct->mboxes; m != NULL; m = m->next) |
301 |
if (!strcmp(m->name, s)) |
if (!strcmp(m->name, s)) |
302 |
return m; |
return m; |
303 |
|
|
304 |
node = (mbox_t *) create_node(sizeof(mbox_t)); |
node = (mbox_t *) create_node(sizeof(mbox_t)); |
305 |
|
|
769 |
|
|
770 |
|
|
771 |
/* |
/* |
772 |
|
* Free allocated memory of all data structures. |
773 |
|
*/ |
774 |
|
void |
775 |
|
destroy_all(void) |
776 |
|
{ |
777 |
|
destroy_accounts(accounts); |
778 |
|
accounts = NULL; |
779 |
|
destroy_filters(filters); |
780 |
|
filters = NULL; |
781 |
|
destroy_mboxgrps(mboxgrps); |
782 |
|
mboxgrps = NULL; |
783 |
|
} |
784 |
|
|
785 |
|
|
786 |
|
/* |
787 |
* Free allocated memory of data structures that are not needed anymore. |
* Free allocated memory of data structures that are not needed anymore. |
788 |
*/ |
*/ |
789 |
void |
void |
790 |
destroy_data(void) |
destroy_unneeded(void) |
791 |
{ |
{ |
792 |
destroy_mboxgrps(mboxgrps); |
destroy_mboxgrps(mboxgrps); |
793 |
|
mboxgrps = NULL; |
794 |
} |
} |
795 |
|
|
796 |
|
|