[thirdparty/systemd.git] / src / test / test-util.c

/* SPDX-License-Identifier: LGPL-2.1+ */
/***
  Copyright 2013 Thomas H.P. Andersen
***/

#include <errno.h>
#include <string.h>
#include <sys/wait.h>
#include <unistd.h>

#include "def.h"
#include "fileio.h"
#include "fs-util.h"
#include "parse-util.h"
#include "process-util.h"
#include "raw-clone.h"
#include "rm-rf.h"
#include "string-util.h"
#include "util.h"

static void test_align_power2(void) {
        unsigned long i, p2;

        assert_se(ALIGN_POWER2(0) == 0);
        assert_se(ALIGN_POWER2(1) == 1);
        assert_se(ALIGN_POWER2(2) == 2);
        assert_se(ALIGN_POWER2(3) == 4);
        assert_se(ALIGN_POWER2(12) == 16);

        assert_se(ALIGN_POWER2(ULONG_MAX) == 0);
        assert_se(ALIGN_POWER2(ULONG_MAX - 1) == 0);
        assert_se(ALIGN_POWER2(ULONG_MAX - 1024) == 0);
        assert_se(ALIGN_POWER2(ULONG_MAX / 2) == ULONG_MAX / 2 + 1);
        assert_se(ALIGN_POWER2(ULONG_MAX + 1) == 0);

        for (i = 1; i < 131071; ++i) {
                for (p2 = 1; p2 < i; p2 <<= 1)
                        /* empty */ ;

                assert_se(ALIGN_POWER2(i) == p2);
        }

        for (i = ULONG_MAX - 1024; i < ULONG_MAX; ++i) {
                for (p2 = 1; p2 && p2 < i; p2 <<= 1)
                        /* empty */ ;

                assert_se(ALIGN_POWER2(i) == p2);
        }
}

static void test_max(void) {
        static const struct {
                int a;
                int b[CONST_MAX(10, 100)];
        } val1 = {
                .a = CONST_MAX(10, 100),
        };
        int d = 0;

        assert_cc(sizeof(val1.b) == sizeof(int) * 100);

        /* CONST_MAX returns (void) instead of a value if the passed arguments
         * are not of the same type or not constant expressions. */
        assert_cc(__builtin_types_compatible_p(typeof(CONST_MAX(1, 10)), int));
        assert_cc(__builtin_types_compatible_p(typeof(CONST_MAX(1, 1U)), void));

        assert_se(val1.a == 100);
        assert_se(MAX(++d, 0) == 1);
        assert_se(d == 1);

        assert_cc(MAXSIZE(char[3], uint16_t) == 3);
        assert_cc(MAXSIZE(char[3], uint32_t) == 4);
        assert_cc(MAXSIZE(char, long) == sizeof(long));

        assert_se(MAX(-5, 5) == 5);
        assert_se(MAX(5, 5) == 5);
        assert_se(MAX(MAX(1, MAX(2, MAX(3, 4))), 5) == 5);
        assert_se(MAX(MAX(1, MAX(2, MAX(3, 2))), 1) == 3);
        assert_se(MAX(MIN(1, MIN(2, MIN(3, 4))), 5) == 5);
        assert_se(MAX(MAX(1, MIN(2, MIN(3, 2))), 1) == 2);
        assert_se(LESS_BY(8, 4) == 4);
        assert_se(LESS_BY(8, 8) == 0);
        assert_se(LESS_BY(4, 8) == 0);
        assert_se(LESS_BY(16, LESS_BY(8, 4)) == 12);
        assert_se(LESS_BY(4, LESS_BY(8, 4)) == 0);
        assert_se(CLAMP(-5, 0, 1) == 0);
        assert_se(CLAMP(5, 0, 1) == 1);
        assert_se(CLAMP(5, -10, 1) == 1);
        assert_se(CLAMP(5, -10, 10) == 5);
        assert_se(CLAMP(CLAMP(0, -10, 10), CLAMP(-5, 10, 20), CLAMP(100, -5, 20)) == 10);
}

#pragma GCC diagnostic push
#ifdef __clang__
#  pragma GCC diagnostic ignored "-Waddress-of-packed-member"
#endif

static void test_container_of(void) {
        struct mytype {
                uint8_t pad1[3];
                uint64_t v1;
                uint8_t pad2[2];
                uint32_t v2;
        } _packed_ myval = { };

        assert_cc(sizeof(myval) == 17);
        assert_se(container_of(&myval.v1, struct mytype, v1) == &myval);
        assert_se(container_of(&myval.v2, struct mytype, v2) == &myval);
        assert_se(container_of(&container_of(&myval.v2,
                                             struct mytype,
                                             v2)->v1,
                               struct mytype,
                               v1) == &myval);
}

#pragma GCC diagnostic pop

static void test_div_round_up(void) {
        int div;

        /* basic tests */
        assert_se(DIV_ROUND_UP(0, 8) == 0);
        assert_se(DIV_ROUND_UP(1, 8) == 1);
        assert_se(DIV_ROUND_UP(8, 8) == 1);
        assert_se(DIV_ROUND_UP(12, 8) == 2);
        assert_se(DIV_ROUND_UP(16, 8) == 2);

        /* test multiple evaluation */
        div = 0;
        assert_se(DIV_ROUND_UP(div++, 8) == 0 && div == 1);
        assert_se(DIV_ROUND_UP(++div, 8) == 1 && div == 2);
        assert_se(DIV_ROUND_UP(8, div++) == 4 && div == 3);
        assert_se(DIV_ROUND_UP(8, ++div) == 2 && div == 4);

        /* overflow test with exact division */
        assert_se(sizeof(0U) == 4);
        assert_se(0xfffffffaU % 10U == 0U);
        assert_se(0xfffffffaU / 10U == 429496729U);
        assert_se(DIV_ROUND_UP(0xfffffffaU, 10U) == 429496729U);
        assert_se((0xfffffffaU + 10U - 1U) / 10U == 0U);
        assert_se(0xfffffffaU / 10U + !!(0xfffffffaU % 10U) == 429496729U);

        /* overflow test with rounded division */
        assert_se(0xfffffffdU % 10U == 3U);
        assert_se(0xfffffffdU / 10U == 429496729U);
        assert_se(DIV_ROUND_UP(0xfffffffdU, 10U) == 429496730U);
        assert_se((0xfffffffdU + 10U - 1U) / 10U == 0U);
        assert_se(0xfffffffdU / 10U + !!(0xfffffffdU % 10U) == 429496730U);
}

static void test_u64log2(void) {
        assert_se(u64log2(0) == 0);
        assert_se(u64log2(8) == 3);
        assert_se(u64log2(9) == 3);
        assert_se(u64log2(15) == 3);
        assert_se(u64log2(16) == 4);
        assert_se(u64log2(1024*1024) == 20);
        assert_se(u64log2(1024*1024+5) == 20);
}

static void test_protect_errno(void) {
        errno = 12;
        {
                PROTECT_ERRNO;
                errno = 11;
        }
        assert_se(errno == 12);
}

static void test_in_set(void) {
        assert_se(IN_SET(1, 1));
        assert_se(IN_SET(1, 1, 2, 3, 4));
        assert_se(IN_SET(2, 1, 2, 3, 4));
        assert_se(IN_SET(3, 1, 2, 3, 4));
        assert_se(IN_SET(4, 1, 2, 3, 4));
        assert_se(!IN_SET(0, 1));
        assert_se(!IN_SET(0, 1, 2, 3, 4));
}

static void test_log2i(void) {
        assert_se(log2i(1) == 0);
        assert_se(log2i(2) == 1);
        assert_se(log2i(3) == 1);
        assert_se(log2i(4) == 2);
        assert_se(log2i(32) == 5);
        assert_se(log2i(33) == 5);
        assert_se(log2i(63) == 5);
        assert_se(log2i(INT_MAX) == sizeof(int)*8-2);
}

static void test_raw_clone(void) {
        pid_t parent, pid, pid2;

        parent = getpid();
        log_info("before clone: getpid()→"PID_FMT, parent);
        assert_se(raw_getpid() == parent);

        pid = raw_clone(0);
        assert_se(pid >= 0);

        pid2 = raw_getpid();
        log_info("raw_clone: "PID_FMT" getpid()→"PID_FMT" raw_getpid()→"PID_FMT,
                 pid, getpid(), pid2);
        if (pid == 0) {
                assert_se(pid2 != parent);
                _exit(EXIT_SUCCESS);
        } else {
                int status;

                assert_se(pid2 == parent);
                waitpid(pid, &status, __WCLONE);
                assert_se(WIFEXITED(status) && WEXITSTATUS(status) == EXIT_SUCCESS);
        }

        errno = 0;
        assert_se(raw_clone(CLONE_FS|CLONE_NEWNS) == -1);
        assert_se(errno == EINVAL);
}

static void test_physical_memory(void) {
        uint64_t p;
        char buf[FORMAT_BYTES_MAX];

        p = physical_memory();
        assert_se(p > 0);
        assert_se(p < UINT64_MAX);
        assert_se(p % page_size() == 0);

        log_info("Memory: %s (%" PRIu64 ")", format_bytes(buf, sizeof(buf), p), p);
}

static void test_physical_memory_scale(void) {
        uint64_t p;

        p = physical_memory();

        assert_se(physical_memory_scale(0, 100) == 0);
        assert_se(physical_memory_scale(100, 100) == p);

        log_info("Memory original: %" PRIu64, physical_memory());
        log_info("Memory scaled by 50%%: %" PRIu64, physical_memory_scale(50, 100));
        log_info("Memory divided by 2: %" PRIu64, physical_memory() / 2);
        log_info("Page size: %zu", page_size());

        /* There might be an uneven number of pages, hence permit these calculations to be half a page off... */
        assert_se(page_size()/2 + physical_memory_scale(50, 100) - p/2 <= page_size());
        assert_se(physical_memory_scale(200, 100) == p*2);

        assert_se(physical_memory_scale(0, 1) == 0);
        assert_se(physical_memory_scale(1, 1) == p);
        assert_se(physical_memory_scale(2, 1) == p*2);

        assert_se(physical_memory_scale(0, 2) == 0);

        assert_se(page_size()/2 + physical_memory_scale(1, 2) - p/2 <= page_size());
        assert_se(physical_memory_scale(2, 2) == p);
        assert_se(physical_memory_scale(4, 2) == p*2);

        assert_se(physical_memory_scale(0, UINT32_MAX) == 0);
        assert_se(physical_memory_scale(UINT32_MAX, UINT32_MAX) == p);

        /* overflow */
        assert_se(physical_memory_scale(UINT64_MAX/4, UINT64_MAX) == UINT64_MAX);
}

static void test_system_tasks_max(void) {
        uint64_t t;

        t = system_tasks_max();
        assert_se(t > 0);
        assert_se(t < UINT64_MAX);

        log_info("Max tasks: %" PRIu64, t);
}

static void test_system_tasks_max_scale(void) {
        uint64_t t;

        t = system_tasks_max();

        assert_se(system_tasks_max_scale(0, 100) == 0);
        assert_se(system_tasks_max_scale(100, 100) == t);

        assert_se(system_tasks_max_scale(0, 1) == 0);
        assert_se(system_tasks_max_scale(1, 1) == t);
        assert_se(system_tasks_max_scale(2, 1) == 2*t);

        assert_se(system_tasks_max_scale(0, 2) == 0);
        assert_se(system_tasks_max_scale(1, 2) == t/2);
        assert_se(system_tasks_max_scale(2, 2) == t);
        assert_se(system_tasks_max_scale(3, 2) == (3*t)/2);
        assert_se(system_tasks_max_scale(4, 2) == t*2);

        assert_se(system_tasks_max_scale(0, UINT32_MAX) == 0);
        assert_se(system_tasks_max_scale((UINT32_MAX-1)/2, UINT32_MAX-1) == t/2);
        assert_se(system_tasks_max_scale(UINT32_MAX, UINT32_MAX) == t);

        /* overflow */

        assert_se(system_tasks_max_scale(UINT64_MAX/4, UINT64_MAX) == UINT64_MAX);
}

int main(int argc, char *argv[]) {
        log_parse_environment();
        log_open();

        test_align_power2();
        test_max();
        test_container_of();
        test_div_round_up();
        test_u64log2();
        test_protect_errno();
        test_in_set();
        test_log2i();
        test_raw_clone();
        test_physical_memory();
        test_physical_memory_scale();
        test_system_tasks_max();
        test_system_tasks_max_scale();

        return 0;
}
Commit	Line	Data
53e1b683	1	/* SPDX-License-Identifier: LGPL-2.1+ */
539ad707	2	/***
539ad707	3	Copyright 2013 Thomas H.P. Andersen
539ad707 TA	4	***/
539ad707 TA	5
618234a5	6	#include <errno.h>
618234a5	7	#include <string.h>
8852362b	8	#include <sys/wait.h>
618234a5	9	#include <unistd.h>
539ad707	10
65b3903f ZJS	11	#include "def.h"
65b3903f ZJS	12	#include "fileio.h"
f4f15635	13	#include "fs-util.h"
d9ab2bcf	14	#include "parse-util.h"
dccca82b	15	#include "process-util.h"
8869a0b4	16	#include "raw-clone.h"
618234a5	17	#include "rm-rf.h"
07630cea	18	#include "string-util.h"
618234a5	19	#include "util.h"
539ad707	20
625e870b DH	21	static void test_align_power2(void) {
	22	unsigned long i, p2;
	23
	24	assert_se(ALIGN_POWER2(0) == 0);
	25	assert_se(ALIGN_POWER2(1) == 1);
	26	assert_se(ALIGN_POWER2(2) == 2);
	27	assert_se(ALIGN_POWER2(3) == 4);
	28	assert_se(ALIGN_POWER2(12) == 16);
	29
	30	assert_se(ALIGN_POWER2(ULONG_MAX) == 0);
	31	assert_se(ALIGN_POWER2(ULONG_MAX - 1) == 0);
	32	assert_se(ALIGN_POWER2(ULONG_MAX - 1024) == 0);
	33	assert_se(ALIGN_POWER2(ULONG_MAX / 2) == ULONG_MAX / 2 + 1);
	34	assert_se(ALIGN_POWER2(ULONG_MAX + 1) == 0);
	35
	36	for (i = 1; i < 131071; ++i) {
	37	for (p2 = 1; p2 < i; p2 <<= 1)
	38	/* empty */ ;
	39
	40	assert_se(ALIGN_POWER2(i) == p2);
	41	}
	42
	43	for (i = ULONG_MAX - 1024; i < ULONG_MAX; ++i) {
	44	for (p2 = 1; p2 && p2 < i; p2 <<= 1)
	45	/* empty */ ;
	46
	47	assert_se(ALIGN_POWER2(i) == p2);
	48	}
	49	}
	50
7242d742 DH	51	static void test_max(void) {
	52	static const struct {
	53	int a;
	54	int b[CONST_MAX(10, 100)];
	55	} val1 = {
	56	.a = CONST_MAX(10, 100),
	57	};
	58	int d = 0;
	59
	60	assert_cc(sizeof(val1.b) == sizeof(int) * 100);
	61
	62	/* CONST_MAX returns (void) instead of a value if the passed arguments
	63	* are not of the same type or not constant expressions. */
	64	assert_cc(__builtin_types_compatible_p(typeof(CONST_MAX(1, 10)), int));
7242d742 DH	65	assert_cc(__builtin_types_compatible_p(typeof(CONST_MAX(1, 1U)), void));
	66
	67	assert_se(val1.a == 100);
	68	assert_se(MAX(++d, 0) == 1);
	69	assert_se(d == 1);
40a1eebd DH	70
	71	assert_cc(MAXSIZE(char[3], uint16_t) == 3);
	72	assert_cc(MAXSIZE(char[3], uint32_t) == 4);
	73	assert_cc(MAXSIZE(char, long) == sizeof(long));
667a0377 DH	74
	75	assert_se(MAX(-5, 5) == 5);
	76	assert_se(MAX(5, 5) == 5);
	77	assert_se(MAX(MAX(1, MAX(2, MAX(3, 4))), 5) == 5);
	78	assert_se(MAX(MAX(1, MAX(2, MAX(3, 2))), 1) == 3);
	79	assert_se(MAX(MIN(1, MIN(2, MIN(3, 4))), 5) == 5);
	80	assert_se(MAX(MAX(1, MIN(2, MIN(3, 2))), 1) == 2);
	81	assert_se(LESS_BY(8, 4) == 4);
	82	assert_se(LESS_BY(8, 8) == 0);
	83	assert_se(LESS_BY(4, 8) == 0);
	84	assert_se(LESS_BY(16, LESS_BY(8, 4)) == 12);
	85	assert_se(LESS_BY(4, LESS_BY(8, 4)) == 0);
	86	assert_se(CLAMP(-5, 0, 1) == 0);
	87	assert_se(CLAMP(5, 0, 1) == 1);
	88	assert_se(CLAMP(5, -10, 1) == 1);
	89	assert_se(CLAMP(5, -10, 10) == 5);
	90	assert_se(CLAMP(CLAMP(0, -10, 10), CLAMP(-5, 10, 20), CLAMP(100, -5, 20)) == 10);
7242d742 DH	91	}
7242d742 DH	92
09571e3f ZJS	93	#pragma GCC diagnostic push
	94	#ifdef __clang__
	95	# pragma GCC diagnostic ignored "-Waddress-of-packed-member"
	96	#endif
	97
fb835651 DH	98	static void test_container_of(void) {
	99	struct mytype {
	100	uint8_t pad1[3];
	101	uint64_t v1;
	102	uint8_t pad2[2];
	103	uint32_t v2;
	104	} _packed_ myval = { };
	105
	106	assert_cc(sizeof(myval) == 17);
	107	assert_se(container_of(&myval.v1, struct mytype, v1) == &myval);
	108	assert_se(container_of(&myval.v2, struct mytype, v2) == &myval);
	109	assert_se(container_of(&container_of(&myval.v2,
	110	struct mytype,
	111	v2)->v1,
	112	struct mytype,
	113	v1) == &myval);
	114	}
	115
09571e3f ZJS	116	#pragma GCC diagnostic pop
09571e3f ZJS	117
180a60bc DH	118	static void test_div_round_up(void) {
	119	int div;
	120
	121	/* basic tests */
	122	assert_se(DIV_ROUND_UP(0, 8) == 0);
	123	assert_se(DIV_ROUND_UP(1, 8) == 1);
	124	assert_se(DIV_ROUND_UP(8, 8) == 1);
	125	assert_se(DIV_ROUND_UP(12, 8) == 2);
	126	assert_se(DIV_ROUND_UP(16, 8) == 2);
	127
	128	/* test multiple evaluation */
	129	div = 0;
	130	assert_se(DIV_ROUND_UP(div++, 8) == 0 && div == 1);
	131	assert_se(DIV_ROUND_UP(++div, 8) == 1 && div == 2);
	132	assert_se(DIV_ROUND_UP(8, div++) == 4 && div == 3);
	133	assert_se(DIV_ROUND_UP(8, ++div) == 2 && div == 4);
	134
	135	/* overflow test with exact division */
	136	assert_se(sizeof(0U) == 4);
	137	assert_se(0xfffffffaU % 10U == 0U);
	138	assert_se(0xfffffffaU / 10U == 429496729U);
	139	assert_se(DIV_ROUND_UP(0xfffffffaU, 10U) == 429496729U);
	140	assert_se((0xfffffffaU + 10U - 1U) / 10U == 0U);
	141	assert_se(0xfffffffaU / 10U + !!(0xfffffffaU % 10U) == 429496729U);
	142
	143	/* overflow test with rounded division */
	144	assert_se(0xfffffffdU % 10U == 3U);
	145	assert_se(0xfffffffdU / 10U == 429496729U);
	146	assert_se(DIV_ROUND_UP(0xfffffffdU, 10U) == 429496730U);
	147	assert_se((0xfffffffdU + 10U - 1U) / 10U == 0U);
	148	assert_se(0xfffffffdU / 10U + !!(0xfffffffdU % 10U) == 429496730U);
	149	}
	150
144e51ec	151	static void test_u64log2(void) {
bdf7026e TA	152	assert_se(u64log2(0) == 0);
	153	assert_se(u64log2(8) == 3);
	154	assert_se(u64log2(9) == 3);
	155	assert_se(u64log2(15) == 3);
	156	assert_se(u64log2(16) == 4);
	157	assert_se(u64log2(1024*1024) == 20);
	158	assert_se(u64log2(1024*1024+5) == 20);
144e51ec CR	159	}
144e51ec CR	160
2a371001 ZJS	161	static void test_protect_errno(void) {
	162	errno = 12;
	163	{
	164	PROTECT_ERRNO;
	165	errno = 11;
	166	}
bdf7026e	167	assert_se(errno == 12);
2a371001 ZJS	168	}
2a371001 ZJS	169
cabb7806 LP	170	static void test_in_set(void) {
	171	assert_se(IN_SET(1, 1));
	172	assert_se(IN_SET(1, 1, 2, 3, 4));
	173	assert_se(IN_SET(2, 1, 2, 3, 4));
	174	assert_se(IN_SET(3, 1, 2, 3, 4));
	175	assert_se(IN_SET(4, 1, 2, 3, 4));
	176	assert_se(!IN_SET(0, 1));
	177	assert_se(!IN_SET(0, 1, 2, 3, 4));
	178	}
	179
8fe90522 ZJS	180	static void test_log2i(void) {
	181	assert_se(log2i(1) == 0);
	182	assert_se(log2i(2) == 1);
	183	assert_se(log2i(3) == 1);
	184	assert_se(log2i(4) == 2);
	185	assert_se(log2i(32) == 5);
	186	assert_se(log2i(33) == 5);
	187	assert_se(log2i(63) == 5);
	188	assert_se(log2i(INT_MAX) == sizeof(int)*8-2);
	189	}
	190
ee05e779 ZJS	191	static void test_raw_clone(void) {
	192	pid_t parent, pid, pid2;
	193
	194	parent = getpid();
	195	log_info("before clone: getpid()→"PID_FMT, parent);
	196	assert_se(raw_getpid() == parent);
	197
8869a0b4	198	pid = raw_clone(0);
e50221bf	199	assert_se(pid >= 0);
ee05e779 ZJS	200
	201	pid2 = raw_getpid();
	202	log_info("raw_clone: "PID_FMT" getpid()→"PID_FMT" raw_getpid()→"PID_FMT,
	203	pid, getpid(), pid2);
0289a5bc	204	if (pid == 0) {
e50221bf	205	assert_se(pid2 != parent);
0289a5bc FB	206	_exit(EXIT_SUCCESS);
	207	} else {
	208	int status;
	209
e50221bf	210	assert_se(pid2 == parent);
0289a5bc FB	211	waitpid(pid, &status, __WCLONE);
	212	assert_se(WIFEXITED(status) && WEXITSTATUS(status) == EXIT_SUCCESS);
	213	}
96f64eb5 MG	214
	215	errno = 0;
	216	assert_se(raw_clone(CLONE_FS\|CLONE_NEWNS) == -1);
	217	assert_se(errno == EINVAL);
ee05e779 ZJS	218	}
ee05e779 ZJS	219
d9ab2bcf LP	220	static void test_physical_memory(void) {
	221	uint64_t p;
	222	char buf[FORMAT_BYTES_MAX];
	223
	224	p = physical_memory();
	225	assert_se(p > 0);
	226	assert_se(p < UINT64_MAX);
	227	assert_se(p % page_size() == 0);
	228
d8cf2ac7 LP	229	log_info("Memory: %s (%" PRIu64 ")", format_bytes(buf, sizeof(buf), p), p);
	230	}
	231
	232	static void test_physical_memory_scale(void) {
	233	uint64_t p;
	234
	235	p = physical_memory();
	236
	237	assert_se(physical_memory_scale(0, 100) == 0);
	238	assert_se(physical_memory_scale(100, 100) == p);
	239
	240	log_info("Memory original: %" PRIu64, physical_memory());
	241	log_info("Memory scaled by 50%%: %" PRIu64, physical_memory_scale(50, 100));
	242	log_info("Memory divided by 2: %" PRIu64, physical_memory() / 2);
	243	log_info("Page size: %zu", page_size());
	244
	245	/* There might be an uneven number of pages, hence permit these calculations to be half a page off... */
	246	assert_se(page_size()/2 + physical_memory_scale(50, 100) - p/2 <= page_size());
	247	assert_se(physical_memory_scale(200, 100) == p*2);
	248
	249	assert_se(physical_memory_scale(0, 1) == 0);
	250	assert_se(physical_memory_scale(1, 1) == p);
	251	assert_se(physical_memory_scale(2, 1) == p*2);
	252
	253	assert_se(physical_memory_scale(0, 2) == 0);
	254
	255	assert_se(page_size()/2 + physical_memory_scale(1, 2) - p/2 <= page_size());
	256	assert_se(physical_memory_scale(2, 2) == p);
	257	assert_se(physical_memory_scale(4, 2) == p*2);
	258
	259	assert_se(physical_memory_scale(0, UINT32_MAX) == 0);
	260	assert_se(physical_memory_scale(UINT32_MAX, UINT32_MAX) == p);
	261
	262	/* overflow */
	263	assert_se(physical_memory_scale(UINT64_MAX/4, UINT64_MAX) == UINT64_MAX);
83f8e808 LP	264	}
	265
	266	static void test_system_tasks_max(void) {
	267	uint64_t t;
	268
	269	t = system_tasks_max();
	270	assert_se(t > 0);
	271	assert_se(t < UINT64_MAX);
	272
	273	log_info("Max tasks: %" PRIu64, t);
	274	}
	275
	276	static void test_system_tasks_max_scale(void) {
	277	uint64_t t;
	278
	279	t = system_tasks_max();
	280
	281	assert_se(system_tasks_max_scale(0, 100) == 0);
	282	assert_se(system_tasks_max_scale(100, 100) == t);
	283
	284	assert_se(system_tasks_max_scale(0, 1) == 0);
	285	assert_se(system_tasks_max_scale(1, 1) == t);
	286	assert_se(system_tasks_max_scale(2, 1) == 2*t);
	287
	288	assert_se(system_tasks_max_scale(0, 2) == 0);
	289	assert_se(system_tasks_max_scale(1, 2) == t/2);
	290	assert_se(system_tasks_max_scale(2, 2) == t);
	291	assert_se(system_tasks_max_scale(3, 2) == (3*t)/2);
	292	assert_se(system_tasks_max_scale(4, 2) == t*2);
	293
	294	assert_se(system_tasks_max_scale(0, UINT32_MAX) == 0);
	295	assert_se(system_tasks_max_scale((UINT32_MAX-1)/2, UINT32_MAX-1) == t/2);
	296	assert_se(system_tasks_max_scale(UINT32_MAX, UINT32_MAX) == t);
	297
	298	/* overflow */
d8cf2ac7	299
83f8e808	300	assert_se(system_tasks_max_scale(UINT64_MAX/4, UINT64_MAX) == UINT64_MAX);
d9ab2bcf LP	301	}
d9ab2bcf LP	302
539ad707	303	int main(int argc, char *argv[]) {
9480794b ZJS	304	log_parse_environment();
	305	log_open();
	306
625e870b	307	test_align_power2();
7242d742	308	test_max();
fb835651	309	test_container_of();
180a60bc	310	test_div_round_up();
144e51ec	311	test_u64log2();
2a371001	312	test_protect_errno();
cabb7806	313	test_in_set();
8fe90522	314	test_log2i();
ee05e779	315	test_raw_clone();
d9ab2bcf	316	test_physical_memory();
d8cf2ac7	317	test_physical_memory_scale();
83f8e808 LP	318	test_system_tasks_max();
83f8e808 LP	319	test_system_tasks_max_scale();
539ad707 TA	320
	321	return 0;
	322	}