]>
git.proxmox.com Git - systemd.git/blob - src/basic/alloc-util.h
1 /* SPDX-License-Identifier: LGPL-2.1+ */
11 typedef void (*free_func_t
)(void *p
);
13 #define new(t, n) ((t*) malloc_multiply(sizeof(t), (n)))
15 #define new0(t, n) ((t*) calloc((n) ?: 1, sizeof(t)))
19 assert(!size_multiply_overflow(sizeof(t), n)); \
20 (t*) alloca(sizeof(t)*(n)); \
25 assert(!size_multiply_overflow(sizeof(t), n)); \
26 (t*) alloca0(sizeof(t)*(n)); \
29 #define newdup(t, p, n) ((t*) memdup_multiply(p, sizeof(t), (n)))
31 #define newdup_suffix0(t, p, n) ((t*) memdup_suffix0_multiply(p, sizeof(t), (n)))
33 #define malloc0(n) (calloc(1, (n)))
35 static inline void *mfree(void *memory
) {
40 #define free_and_replace(a, b) \
48 void* memdup(const void *p
, size_t l
) _alloc_(2);
49 void* memdup_suffix0(const void *p
, size_t l
) _alloc_(2);
51 #define memdupa(p, l) \
58 #define memdupa_suffix0(p, l) \
61 _q_ = alloca(l + 1); \
62 ((uint8_t*) _q_)[l] = 0; \
66 static inline void freep(void *p
) {
70 #define _cleanup_free_ _cleanup_(freep)
72 static inline bool size_multiply_overflow(size_t size
, size_t need
) {
73 return _unlikely_(need
!= 0 && size
> (SIZE_MAX
/ need
));
76 _malloc_
_alloc_(1, 2) static inline void *malloc_multiply(size_t size
, size_t need
) {
77 if (size_multiply_overflow(size
, need
))
80 return malloc(size
* need
?: 1);
83 #if !HAVE_REALLOCARRAY
84 _alloc_(2, 3) static inline void *reallocarray(void *p
, size_t need
, size_t size
) {
85 if (size_multiply_overflow(size
, need
))
88 return realloc(p
, size
* need
?: 1);
92 _alloc_(2, 3) static inline void *memdup_multiply(const void *p
, size_t size
, size_t need
) {
93 if (size_multiply_overflow(size
, need
))
96 return memdup(p
, size
* need
);
99 _alloc_(2, 3) static inline void *memdup_suffix0_multiply(const void *p
, size_t size
, size_t need
) {
100 if (size_multiply_overflow(size
, need
))
103 return memdup_suffix0(p
, size
* need
);
106 void* greedy_realloc(void **p
, size_t *allocated
, size_t need
, size_t size
);
107 void* greedy_realloc0(void **p
, size_t *allocated
, size_t need
, size_t size
);
109 #define GREEDY_REALLOC(array, allocated, need) \
110 greedy_realloc((void**) &(array), &(allocated), (need), sizeof((array)[0]))
112 #define GREEDY_REALLOC0(array, allocated, need) \
113 greedy_realloc0((void**) &(array), &(allocated), (need), sizeof((array)[0]))
119 _new_ = alloca(_len_); \
120 (void *) memset(_new_, 0, _len_); \
123 /* It's not clear what alignment glibc/gcc alloca() guarantee, hence provide a guaranteed safe version */
124 #define alloca_align(size, align) \
127 size_t _mask_ = (align) - 1; \
128 _ptr_ = alloca((size) + _mask_); \
129 (void*)(((uintptr_t)_ptr_ + _mask_) & ~_mask_); \
132 #define alloca0_align(size, align) \
135 size_t _size_ = (size); \
136 _new_ = alloca_align(_size_, (align)); \
137 (void*)memset(_new_, 0, _size_); \
140 /* Takes inspiration from Rusts's Option::take() method: reads and returns a pointer, but at the same time resets it to
141 * NULL. See: https://doc.rust-lang.org/std/option/enum.Option.html#method.take */
142 #define TAKE_PTR(ptr) \
144 typeof(ptr) _ptr_ = (ptr); \