mirror of
https://github.com/systemd/systemd.git
synced 2025-02-03 17:47:28 +03:00
Move CLEANUP_ARRAY to src/fundamental
This commit is contained in:
parent
3e5a499009
commit
3b66a6764e
@ -15,7 +15,6 @@
|
||||
|
||||
typedef void (*free_func_t)(void *p);
|
||||
typedef void* (*mfree_func_t)(void *p);
|
||||
typedef void (*free_array_func_t)(void *p, size_t n);
|
||||
|
||||
/* If for some reason more than 4M are allocated on the stack, let's abort immediately. It's better than
|
||||
* proceeding and smashing the stack limits. Note that by default RLIMIT_STACK is 8M on Linux. */
|
||||
|
@ -104,37 +104,3 @@ static inline void erase_and_freep(void *p) {
|
||||
static inline void erase_char(char *p) {
|
||||
explicit_bzero_safe(p, sizeof(char));
|
||||
}
|
||||
|
||||
/* An automatic _cleanup_-like logic for destroy arrays (i.e. pointers + size) when leaving scope */
|
||||
typedef struct ArrayCleanup {
|
||||
void **parray;
|
||||
size_t *pn;
|
||||
free_array_func_t pfunc;
|
||||
} ArrayCleanup;
|
||||
|
||||
static inline void array_cleanup(const ArrayCleanup *c) {
|
||||
assert(c);
|
||||
|
||||
assert(!c->parray == !c->pn);
|
||||
|
||||
if (!c->parray)
|
||||
return;
|
||||
|
||||
if (*c->parray) {
|
||||
assert(c->pfunc);
|
||||
c->pfunc(*c->parray, *c->pn);
|
||||
*c->parray = NULL;
|
||||
}
|
||||
|
||||
*c->pn = 0;
|
||||
}
|
||||
|
||||
#define CLEANUP_ARRAY(array, n, func) \
|
||||
_cleanup_(array_cleanup) _unused_ const ArrayCleanup CONCATENATE(_cleanup_array_, UNIQ) = { \
|
||||
.parray = (void**) &(array), \
|
||||
.pn = &(n), \
|
||||
.pfunc = (free_array_func_t) ({ \
|
||||
void (*_f)(typeof(array[0]) *a, size_t b) = func; \
|
||||
_f; \
|
||||
}), \
|
||||
}
|
||||
|
@ -70,3 +70,39 @@ static inline void erase_varp(struct VarEraser *e) {
|
||||
.p = (ptr), \
|
||||
.size = (sz), \
|
||||
}
|
||||
|
||||
typedef void (*free_array_func_t)(void *p, size_t n);
|
||||
|
||||
/* An automatic _cleanup_-like logic for destroy arrays (i.e. pointers + size) when leaving scope */
|
||||
typedef struct ArrayCleanup {
|
||||
void **parray;
|
||||
size_t *pn;
|
||||
free_array_func_t pfunc;
|
||||
} ArrayCleanup;
|
||||
|
||||
static inline void array_cleanup(const ArrayCleanup *c) {
|
||||
assert(c);
|
||||
|
||||
assert(!c->parray == !c->pn);
|
||||
|
||||
if (!c->parray)
|
||||
return;
|
||||
|
||||
if (*c->parray) {
|
||||
assert(c->pfunc);
|
||||
c->pfunc(*c->parray, *c->pn);
|
||||
*c->parray = NULL;
|
||||
}
|
||||
|
||||
*c->pn = 0;
|
||||
}
|
||||
|
||||
#define CLEANUP_ARRAY(array, n, func) \
|
||||
_cleanup_(array_cleanup) _unused_ const ArrayCleanup CONCATENATE(_cleanup_array_, UNIQ) = { \
|
||||
.parray = (void**) &(array), \
|
||||
.pn = &(n), \
|
||||
.pfunc = (free_array_func_t) ({ \
|
||||
void (*_f)(typeof(array[0]) *a, size_t b) = func; \
|
||||
_f; \
|
||||
}), \
|
||||
}
|
||||
|
Loading…
x
Reference in New Issue
Block a user