1 /* SPDX-License-Identifier: LGPL-2.1+ */
3 Copyright 2010 Lennart Poettering
4 Copyright 2013 Thomas H.P. Andersen
15 #include "parse-util.h"
16 #include "process-util.h"
17 #include "raw-clone.h"
19 #include "string-util.h"
22 static void test_align_power2(void) {
25 assert_se(ALIGN_POWER2(0) == 0);
26 assert_se(ALIGN_POWER2(1) == 1);
27 assert_se(ALIGN_POWER2(2) == 2);
28 assert_se(ALIGN_POWER2(3) == 4);
29 assert_se(ALIGN_POWER2(12) == 16);
31 assert_se(ALIGN_POWER2(ULONG_MAX) == 0);
32 assert_se(ALIGN_POWER2(ULONG_MAX - 1) == 0);
33 assert_se(ALIGN_POWER2(ULONG_MAX - 1024) == 0);
34 assert_se(ALIGN_POWER2(ULONG_MAX / 2) == ULONG_MAX / 2 + 1);
35 assert_se(ALIGN_POWER2(ULONG_MAX + 1) == 0);
37 for (i = 1; i < 131071; ++i) {
38 for (p2 = 1; p2 < i; p2 <<= 1)
41 assert_se(ALIGN_POWER2(i) == p2);
44 for (i = ULONG_MAX - 1024; i < ULONG_MAX; ++i) {
45 for (p2 = 1; p2 && p2 < i; p2 <<= 1)
48 assert_se(ALIGN_POWER2(i) == p2);
52 static void test_max(void) {
55 int b[CONST_MAX(10, 100)];
57 .a = CONST_MAX(10, 100),
61 assert_cc(sizeof(val1.b) == sizeof(int) * 100);
63 /* CONST_MAX returns (void) instead of a value if the passed arguments
64 * are not of the same type or not constant expressions. */
65 assert_cc(__builtin_types_compatible_p(typeof(CONST_MAX(1, 10)), int));
66 assert_cc(__builtin_types_compatible_p(typeof(CONST_MAX(1, 1U)), void));
68 assert_se(val1.a == 100);
69 assert_se(MAX(++d, 0) == 1);
72 assert_cc(MAXSIZE(char[3], uint16_t) == 3);
73 assert_cc(MAXSIZE(char[3], uint32_t) == 4);
74 assert_cc(MAXSIZE(char, long) == sizeof(long));
76 assert_se(MAX(-5, 5) == 5);
77 assert_se(MAX(5, 5) == 5);
78 assert_se(MAX(MAX(1, MAX(2, MAX(3, 4))), 5) == 5);
79 assert_se(MAX(MAX(1, MAX(2, MAX(3, 2))), 1) == 3);
80 assert_se(MAX(MIN(1, MIN(2, MIN(3, 4))), 5) == 5);
81 assert_se(MAX(MAX(1, MIN(2, MIN(3, 2))), 1) == 2);
82 assert_se(LESS_BY(8, 4) == 4);
83 assert_se(LESS_BY(8, 8) == 0);
84 assert_se(LESS_BY(4, 8) == 0);
85 assert_se(LESS_BY(16, LESS_BY(8, 4)) == 12);
86 assert_se(LESS_BY(4, LESS_BY(8, 4)) == 0);
87 assert_se(CLAMP(-5, 0, 1) == 0);
88 assert_se(CLAMP(5, 0, 1) == 1);
89 assert_se(CLAMP(5, -10, 1) == 1);
90 assert_se(CLAMP(5, -10, 10) == 5);
91 assert_se(CLAMP(CLAMP(0, -10, 10), CLAMP(-5, 10, 20), CLAMP(100, -5, 20)) == 10);
94 #pragma GCC diagnostic push
96 # pragma GCC diagnostic ignored "-Waddress-of-packed-member"
99 static void test_container_of(void) {
105 } _packed_ myval = { };
107 assert_cc(sizeof(myval) == 17);
108 assert_se(container_of(&myval.v1, struct mytype, v1) == &myval);
109 assert_se(container_of(&myval.v2, struct mytype, v2) == &myval);
110 assert_se(container_of(&container_of(&myval.v2,
117 #pragma GCC diagnostic pop
119 static void test_div_round_up(void) {
123 assert_se(DIV_ROUND_UP(0, 8) == 0);
124 assert_se(DIV_ROUND_UP(1, 8) == 1);
125 assert_se(DIV_ROUND_UP(8, 8) == 1);
126 assert_se(DIV_ROUND_UP(12, 8) == 2);
127 assert_se(DIV_ROUND_UP(16, 8) == 2);
129 /* test multiple evaluation */
131 assert_se(DIV_ROUND_UP(div++, 8) == 0 && div == 1);
132 assert_se(DIV_ROUND_UP(++div, 8) == 1 && div == 2);
133 assert_se(DIV_ROUND_UP(8, div++) == 4 && div == 3);
134 assert_se(DIV_ROUND_UP(8, ++div) == 2 && div == 4);
136 /* overflow test with exact division */
137 assert_se(sizeof(0U) == 4);
138 assert_se(0xfffffffaU % 10U == 0U);
139 assert_se(0xfffffffaU / 10U == 429496729U);
140 assert_se(DIV_ROUND_UP(0xfffffffaU, 10U) == 429496729U);
141 assert_se((0xfffffffaU + 10U - 1U) / 10U == 0U);
142 assert_se(0xfffffffaU / 10U + !!(0xfffffffaU % 10U) == 429496729U);
144 /* overflow test with rounded division */
145 assert_se(0xfffffffdU % 10U == 3U);
146 assert_se(0xfffffffdU / 10U == 429496729U);
147 assert_se(DIV_ROUND_UP(0xfffffffdU, 10U) == 429496730U);
148 assert_se((0xfffffffdU + 10U - 1U) / 10U == 0U);
149 assert_se(0xfffffffdU / 10U + !!(0xfffffffdU % 10U) == 429496730U);
152 static void test_u64log2(void) {
153 assert_se(u64log2(0) == 0);
154 assert_se(u64log2(8) == 3);
155 assert_se(u64log2(9) == 3);
156 assert_se(u64log2(15) == 3);
157 assert_se(u64log2(16) == 4);
158 assert_se(u64log2(1024*1024) == 20);
159 assert_se(u64log2(1024*1024+5) == 20);
162 static void test_protect_errno(void) {
168 assert_se(errno == 12);
171 static void test_in_set(void) {
172 assert_se(IN_SET(1, 1));
173 assert_se(IN_SET(1, 1, 2, 3, 4));
174 assert_se(IN_SET(2, 1, 2, 3, 4));
175 assert_se(IN_SET(3, 1, 2, 3, 4));
176 assert_se(IN_SET(4, 1, 2, 3, 4));
177 assert_se(!IN_SET(0, 1));
178 assert_se(!IN_SET(0, 1, 2, 3, 4));
181 static void test_log2i(void) {
182 assert_se(log2i(1) == 0);
183 assert_se(log2i(2) == 1);
184 assert_se(log2i(3) == 1);
185 assert_se(log2i(4) == 2);
186 assert_se(log2i(32) == 5);
187 assert_se(log2i(33) == 5);
188 assert_se(log2i(63) == 5);
189 assert_se(log2i(INT_MAX) == sizeof(int)*8-2);
192 #if 0 /// UNNEEDED by elogind
193 static void test_raw_clone(void) {
194 pid_t parent, pid, pid2;
197 log_info("before clone: getpid()→"PID_FMT, parent);
198 assert_se(raw_getpid() == parent);
204 log_info("raw_clone: "PID_FMT" getpid()→"PID_FMT" raw_getpid()→"PID_FMT,
205 pid, getpid(), pid2);
207 assert_se(pid2 != parent);
212 assert_se(pid2 == parent);
213 waitpid(pid, &status, __WCLONE);
214 assert_se(WIFEXITED(status) && WEXITSTATUS(status) == EXIT_SUCCESS);
218 assert_se(raw_clone(CLONE_FS|CLONE_NEWNS) == -1);
219 assert_se(errno == EINVAL);
223 static void test_physical_memory(void) {
225 char buf[FORMAT_BYTES_MAX];
227 p = physical_memory();
229 assert_se(p < UINT64_MAX);
230 assert_se(p % page_size() == 0);
232 log_info("Memory: %s (%" PRIu64 ")", format_bytes(buf, sizeof(buf), p), p);
235 static void test_physical_memory_scale(void) {
238 p = physical_memory();
240 assert_se(physical_memory_scale(0, 100) == 0);
241 assert_se(physical_memory_scale(100, 100) == p);
243 log_info("Memory original: %" PRIu64, physical_memory());
244 log_info("Memory scaled by 50%%: %" PRIu64, physical_memory_scale(50, 100));
245 log_info("Memory divided by 2: %" PRIu64, physical_memory() / 2);
246 log_info("Page size: %zu", page_size());
248 /* There might be an uneven number of pages, hence permit these calculations to be half a page off... */
249 assert_se(page_size()/2 + physical_memory_scale(50, 100) - p/2 <= page_size());
250 assert_se(physical_memory_scale(200, 100) == p*2);
252 assert_se(physical_memory_scale(0, 1) == 0);
253 assert_se(physical_memory_scale(1, 1) == p);
254 assert_se(physical_memory_scale(2, 1) == p*2);
256 assert_se(physical_memory_scale(0, 2) == 0);
258 assert_se(page_size()/2 + physical_memory_scale(1, 2) - p/2 <= page_size());
259 assert_se(physical_memory_scale(2, 2) == p);
260 assert_se(physical_memory_scale(4, 2) == p*2);
262 assert_se(physical_memory_scale(0, UINT32_MAX) == 0);
263 assert_se(physical_memory_scale(UINT32_MAX, UINT32_MAX) == p);
266 assert_se(physical_memory_scale(UINT64_MAX/4, UINT64_MAX) == UINT64_MAX);
269 static void test_system_tasks_max(void) {
272 t = system_tasks_max();
274 assert_se(t < UINT64_MAX);
276 log_info("Max tasks: %" PRIu64, t);
279 static void test_system_tasks_max_scale(void) {
282 t = system_tasks_max();
284 assert_se(system_tasks_max_scale(0, 100) == 0);
285 assert_se(system_tasks_max_scale(100, 100) == t);
287 assert_se(system_tasks_max_scale(0, 1) == 0);
288 assert_se(system_tasks_max_scale(1, 1) == t);
289 assert_se(system_tasks_max_scale(2, 1) == 2*t);
291 assert_se(system_tasks_max_scale(0, 2) == 0);
292 assert_se(system_tasks_max_scale(1, 2) == t/2);
293 assert_se(system_tasks_max_scale(2, 2) == t);
294 assert_se(system_tasks_max_scale(3, 2) == (3*t)/2);
295 assert_se(system_tasks_max_scale(4, 2) == t*2);
297 assert_se(system_tasks_max_scale(0, UINT32_MAX) == 0);
298 assert_se(system_tasks_max_scale((UINT32_MAX-1)/2, UINT32_MAX-1) == t/2);
299 assert_se(system_tasks_max_scale(UINT32_MAX, UINT32_MAX) == t);
303 assert_se(system_tasks_max_scale(UINT64_MAX/4, UINT64_MAX) == UINT64_MAX);
306 int main(int argc, char *argv[]) {
307 log_parse_environment();
315 test_protect_errno();
318 #if 0 /// UNNEEDED by elogind
321 test_physical_memory();
322 test_physical_memory_scale();
323 test_system_tasks_max();
324 test_system_tasks_max_scale();