1 /* SPDX-License-Identifier: LGPL-2.1+ */
5 This file is part of systemd.
7 Copyright 2010 Lennart Poettering
17 #define new(t, n) ((t*) malloc_multiply(sizeof(t), (n)))
19 #define new0(t, n) ((t*) calloc((n), sizeof(t)))
23 assert(!size_multiply_overflow(sizeof(t), n)); \
24 (t*) alloca(sizeof(t)*(n)); \
29 assert(!size_multiply_overflow(sizeof(t), n)); \
30 (t*) alloca0(sizeof(t)*(n)); \
33 #define newdup(t, p, n) ((t*) memdup_multiply(p, sizeof(t), (n)))
35 #define newdup_suffix0(t, p, n) ((t*) memdup_suffix0_multiply(p, sizeof(t), (n)))
37 #define malloc0(n) (calloc(1, (n)))
39 static inline void *mfree(void *memory) {
44 #define free_and_replace(a, b) \
52 void* memdup(const void *p, size_t l) _alloc_(2);
53 void* memdup_suffix0(const void *p, size_t l) _alloc_(2);
55 static inline void freep(void *p) {
59 #define _cleanup_free_ _cleanup_(freep)
61 static inline bool size_multiply_overflow(size_t size, size_t need) {
62 return _unlikely_(need != 0 && size > (SIZE_MAX / need));
65 _malloc_ _alloc_(1, 2) static inline void *malloc_multiply(size_t size, size_t need) {
66 if (size_multiply_overflow(size, need))
69 return malloc(size * need);
72 #if !HAVE_REALLOCARRAY
73 _alloc_(2, 3) static inline void *reallocarray(void *p, size_t need, size_t size) {
74 if (size_multiply_overflow(size, need))
77 return realloc(p, size * need);
81 _alloc_(2, 3) static inline void *memdup_multiply(const void *p, size_t size, size_t need) {
82 if (size_multiply_overflow(size, need))
85 return memdup(p, size * need);
88 _alloc_(2, 3) static inline void *memdup_suffix0_multiply(const void *p, size_t size, size_t need) {
89 if (size_multiply_overflow(size, need))
92 return memdup_suffix0(p, size * need);
95 void* greedy_realloc(void **p, size_t *allocated, size_t need, size_t size);
96 void* greedy_realloc0(void **p, size_t *allocated, size_t need, size_t size);
98 #define GREEDY_REALLOC(array, allocated, need) \
99 greedy_realloc((void**) &(array), &(allocated), (need), sizeof((array)[0]))
101 #define GREEDY_REALLOC0(array, allocated, need) \
102 greedy_realloc0((void**) &(array), &(allocated), (need), sizeof((array)[0]))
108 _new_ = alloca(_len_); \
109 (void *) memset(_new_, 0, _len_); \
112 /* It's not clear what alignment glibc/gcc alloca() guarantee, hence provide a guaranteed safe version */
113 #define alloca_align(size, align) \
116 size_t _mask_ = (align) - 1; \
117 _ptr_ = alloca((size) + _mask_); \
118 (void*)(((uintptr_t)_ptr_ + _mask_) & ~_mask_); \
121 #define alloca0_align(size, align) \
124 size_t _size_ = (size); \
125 _new_ = alloca_align(_size_, (align)); \
126 (void*)memset(_new_, 0, _size_); \
129 /* Takes inspiration from Rusts's Option::take() method: reads and returns a pointer, but at the same time resets it to
130 * NULL. See: https://doc.rust-lang.org/std/option/enum.Option.html#method.take */
131 #define TAKE_PTR(ptr) \
133 typeof(ptr) _ptr_ = (ptr); \