1 /* SPDX-License-Identifier: LGPL-2.1+ */
5 Copyright 2010 Lennart Poettering
15 #define new(t, n) ((t*) malloc_multiply(sizeof(t), (n)))
17 #define new0(t, n) ((t*) calloc((n), sizeof(t)))
21 assert(!size_multiply_overflow(sizeof(t), n)); \
22 (t*) alloca(sizeof(t)*(n)); \
27 assert(!size_multiply_overflow(sizeof(t), n)); \
28 (t*) alloca0(sizeof(t)*(n)); \
31 #define newdup(t, p, n) ((t*) memdup_multiply(p, sizeof(t), (n)))
33 #define newdup_suffix0(t, p, n) ((t*) memdup_suffix0_multiply(p, sizeof(t), (n)))
35 #define malloc0(n) (calloc(1, (n)))
37 static inline void *mfree(void *memory) {
42 #define free_and_replace(a, b) \
50 void* memdup(const void *p, size_t l) _alloc_(2);
51 void* memdup_suffix0(const void *p, size_t l) _alloc_(2);
53 static inline void freep(void *p) {
57 #define _cleanup_free_ _cleanup_(freep)
59 static inline bool size_multiply_overflow(size_t size, size_t need) {
60 return _unlikely_(need != 0 && size > (SIZE_MAX / need));
63 _malloc_ _alloc_(1, 2) static inline void *malloc_multiply(size_t size, size_t need) {
64 if (size_multiply_overflow(size, need))
67 return malloc(size * need);
70 #if !HAVE_REALLOCARRAY
71 _alloc_(2, 3) static inline void *reallocarray(void *p, size_t need, size_t size) {
72 if (size_multiply_overflow(size, need))
75 return realloc(p, size * need);
79 _alloc_(2, 3) static inline void *memdup_multiply(const void *p, size_t size, size_t need) {
80 if (size_multiply_overflow(size, need))
83 return memdup(p, size * need);
86 _alloc_(2, 3) static inline void *memdup_suffix0_multiply(const void *p, size_t size, size_t need) {
87 if (size_multiply_overflow(size, need))
90 return memdup_suffix0(p, size * need);
93 void* greedy_realloc(void **p, size_t *allocated, size_t need, size_t size);
94 void* greedy_realloc0(void **p, size_t *allocated, size_t need, size_t size);
96 #define GREEDY_REALLOC(array, allocated, need) \
97 greedy_realloc((void**) &(array), &(allocated), (need), sizeof((array)[0]))
99 #define GREEDY_REALLOC0(array, allocated, need) \
100 greedy_realloc0((void**) &(array), &(allocated), (need), sizeof((array)[0]))
106 _new_ = alloca(_len_); \
107 (void *) memset(_new_, 0, _len_); \
110 /* It's not clear what alignment glibc/gcc alloca() guarantee, hence provide a guaranteed safe version */
111 #define alloca_align(size, align) \
114 size_t _mask_ = (align) - 1; \
115 _ptr_ = alloca((size) + _mask_); \
116 (void*)(((uintptr_t)_ptr_ + _mask_) & ~_mask_); \
119 #define alloca0_align(size, align) \
122 size_t _size_ = (size); \
123 _new_ = alloca_align(_size_, (align)); \
124 (void*)memset(_new_, 0, _size_); \
127 /* Takes inspiration from Rusts's Option::take() method: reads and returns a pointer, but at the same time resets it to
128 * NULL. See: https://doc.rust-lang.org/std/option/enum.Option.html#method.take */
129 #define TAKE_PTR(ptr) \
131 typeof(ptr) _ptr_ = (ptr); \