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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/*
**********************************************************************************************
* File: maat_garbage_collection.c
* Description:
* Authors: Zhengchao <[email protected]>
* Date: 2022-10-31
* Copyright: (c) Since 2022 Geedge Networks, Ltd. All rights reserved.
***********************************************************************************************
*/
#include <time.h>
#include <stdlib.h>
#include <sys/queue.h>
#include <assert.h>
#include "maat_utils.h"
struct maat_garbage_bag {
time_t create_time;
int timeout;
int ok_times;
void *garbage;
void *arg;
void (* garbage_free)(void *garbage, void *arg);
TAILQ_ENTRY(maat_garbage_bag) entries;
};
TAILQ_HEAD(maat_garbage_q, maat_garbage_bag);
struct maat_garbage_bin {
struct maat_garbage_q garbage_q;
size_t bag_cnt;
int timeout_seconds;
};
struct maat_garbage_bin *maat_garbage_bin_new(int default_timeout)
{
struct maat_garbage_bin* bin = ALLOC(struct maat_garbage_bin, 1);
TAILQ_INIT(&bin->garbage_q);
bin->timeout_seconds = default_timeout;
return bin;
}
void maat_garbage_bin_free(struct maat_garbage_bin *bin)
{
if (NULL == bin) {
return;
}
struct maat_garbage_bag *p = NULL;
while ((p = TAILQ_FIRST(&bin->garbage_q)) != NULL) {
p->garbage_free(p->garbage, p->arg);
if (p->arg != NULL) {
FREE(p->arg);
}
TAILQ_REMOVE(&bin->garbage_q, p, entries);
FREE(p);
bin->bag_cnt--;
}
FREE(bin);
}
size_t maat_garbage_bin_get_size(struct maat_garbage_bin *bin)
{
if (NULL == bin) {
return 0;
}
return bin->bag_cnt;
}
void maat_garbage_bagging(struct maat_garbage_bin *bin, void *garbage, void *arg,
void (* func)(void *, void *))
{
struct maat_garbage_bag *bag = ALLOC(struct maat_garbage_bag, 1);
bag->create_time = time(NULL);
bag->timeout = bin->timeout_seconds;
bag->garbage = garbage;
bag->arg = arg;
bag->garbage_free = func;
TAILQ_INSERT_TAIL(&bin->garbage_q, bag, entries);
bin->bag_cnt++;
}
void maat_garbage_collect_routine(struct maat_garbage_bin *bin)
{
struct maat_garbage_bag *p = NULL, *tmp = NULL;
size_t n_clollected = 0, n_bag = 0;
time_t now = time(NULL);
for (p = TAILQ_FIRST(&bin->garbage_q); p != NULL; p = tmp) {
tmp = TAILQ_NEXT(p, entries);
if ((now - p->create_time) > p->timeout || p->timeout == 0) {
p->garbage_free(p->garbage, p->arg);
if (p->arg != NULL) {
FREE(p->arg);
}
TAILQ_REMOVE(&bin->garbage_q, p, entries);
FREE(p);
n_clollected++;
}
n_bag++;
}
assert(bin->bag_cnt == n_bag);
bin->bag_cnt -= n_clollected;
}
void maat_garbage_collect_by_force(struct maat_garbage_bin *bin)
{
struct maat_garbage_bag *p = NULL;
while ((p = TAILQ_FIRST(&bin->garbage_q)) != NULL) {
p->garbage_free(p->garbage, p->arg);
if (p->arg != NULL) {
FREE(p->arg);
}
TAILQ_REMOVE(&bin->garbage_q, p, entries);
FREE(p);
bin->bag_cnt--;
}
}
|
