-
Notifications
You must be signed in to change notification settings - Fork 8
/
atcleanup.c
95 lines (73 loc) · 2.31 KB
/
atcleanup.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
/***************************************************************************
SimpleMail - Copyright (C) 2000 Hynek Schlawack and Sebastian Bauer
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
***************************************************************************/
/**
*
* Provides similar function as the atexit() function but happens still
* when being in main().
*
* @file atcleanup.c
*/
#include "atcleanup.h"
#include <stdlib.h>
#include "lists.h"
static struct list atcleanup_list;
static int atcleanup_list_initialized;
struct atcleanup_node
{
struct node node;
void (*cleanup)(void *user_data);
void *user_data;
};
/*****************************************************************************/
int atcleanup(void (*cleanup)(void *user_data),void *user_data)
{
struct atcleanup_node *node;
if (!atcleanup_list_initialized)
{
list_init(&atcleanup_list);
atcleanup_list_initialized = 1;
}
if (!(node = (struct atcleanup_node*)malloc(sizeof(*node))))
return 0;
node->cleanup = cleanup;
node->user_data = user_data;
list_insert_tail(&atcleanup_list,&node->node);
return 1;
}
/**
* Frees the given memory.
*
* @param mem
*/
static void atcleanup_free_callback(void *mem)
{
free(mem);
}
/*****************************************************************************/
int atcleanup_free(void *mem)
{
return atcleanup(atcleanup_free_callback,mem);
}
/*****************************************************************************/
void atcleanup_finalize(void)
{
struct atcleanup_node *node;
if (!atcleanup_list_initialized) return;
while ((node = (struct atcleanup_node*)list_remove_tail(&atcleanup_list)))
{
node->cleanup(node->user_data);
free(node);
}
}