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

/***
  This file is part of systemd

  Copyright 2013 Jan Janssen

  systemd is free software; you can redistribute it and/or modify it
  under the terms of the GNU Lesser General Public License as published by
  the Free Software Foundation; either version 2.1 of the License, or
  (at your option) any later version.

  systemd is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  Lesser General Public License for more details.

  You should have received a copy of the GNU Lesser General Public License
  along with systemd; If not, see <http://www.gnu.org/licenses/>.
***/

#include "list.h"
#include "util.h"

int main(int argc, const char *argv[]) {
        size_t i;
        typedef struct list_item {
                LIST_FIELDS(struct list_item, item);
        } list_item;
        LIST_HEAD(list_item, head);
        list_item items[4];
        list_item *cursor;

        LIST_HEAD_INIT(head);
        assert_se(head == NULL);

        for (i = 0; i < ELEMENTSOF(items); i++) {
                LIST_INIT(item, &items[i]);
                assert_se(LIST_JUST_US(item, &items[i]));
                LIST_PREPEND(item, head, &items[i]);
        }

        i = 0;
        LIST_FOREACH_OTHERS(item, cursor, &items[2]) {
                i++;
                assert_se(cursor != &items[2]);
        }
        assert_se(i == ELEMENTSOF(items)-1);

        i = 0;
        LIST_FOREACH_OTHERS(item, cursor, &items[0]) {
                i++;
                assert_se(cursor != &items[0]);
        }
        assert_se(i == ELEMENTSOF(items)-1);

        i = 0;
        LIST_FOREACH_OTHERS(item, cursor, &items[3]) {
                i++;
                assert_se(cursor != &items[3]);
        }
        assert_se(i == ELEMENTSOF(items)-1);

        assert_se(!LIST_JUST_US(item, head));

        assert_se(items[0].item_next == NULL);
        assert_se(items[1].item_next == &items[0]);
        assert_se(items[2].item_next == &items[1]);
        assert_se(items[3].item_next == &items[2]);

        assert_se(items[0].item_prev == &items[1]);
        assert_se(items[1].item_prev == &items[2]);
        assert_se(items[2].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_FIND_HEAD(item, &items[0], cursor);
        assert_se(cursor == &items[3]);

        LIST_FIND_TAIL(item, &items[3], cursor);
        assert_se(cursor == &items[0]);

        LIST_REMOVE(item, head, &items[1]);
        assert_se(LIST_JUST_US(item, &items[1]));

        assert_se(items[0].item_next == NULL);
        assert_se(items[2].item_next == &items[0]);
        assert_se(items[3].item_next == &items[2]);

        assert_se(items[0].item_prev == &items[2]);
        assert_se(items[2].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_INSERT_AFTER(item, head, &items[3], &items[1]);
        assert_se(items[0].item_next == NULL);
        assert_se(items[2].item_next == &items[0]);
        assert_se(items[1].item_next == &items[2]);
        assert_se(items[3].item_next == &items[1]);

        assert_se(items[0].item_prev == &items[2]);
        assert_se(items[2].item_prev == &items[1]);
        assert_se(items[1].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_REMOVE(item, head, &items[1]);
        assert_se(LIST_JUST_US(item, &items[1]));

        assert_se(items[0].item_next == NULL);
        assert_se(items[2].item_next == &items[0]);
        assert_se(items[3].item_next == &items[2]);

        assert_se(items[0].item_prev == &items[2]);
        assert_se(items[2].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_INSERT_BEFORE(item, head, &items[2], &items[1]);
        assert_se(items[0].item_next == NULL);
        assert_se(items[2].item_next == &items[0]);
        assert_se(items[1].item_next == &items[2]);
        assert_se(items[3].item_next == &items[1]);

        assert_se(items[0].item_prev == &items[2]);
        assert_se(items[2].item_prev == &items[1]);
        assert_se(items[1].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_REMOVE(item, head, &items[0]);
        assert_se(LIST_JUST_US(item, &items[0]));

        assert_se(items[2].item_next == NULL);
        assert_se(items[1].item_next == &items[2]);
        assert_se(items[3].item_next == &items[1]);

        assert_se(items[2].item_prev == &items[1]);
        assert_se(items[1].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_INSERT_BEFORE(item, head, NULL, &items[0]);
        assert_se(items[0].item_next == NULL);
        assert_se(items[2].item_next == &items[0]);
        assert_se(items[1].item_next == &items[2]);
        assert_se(items[3].item_next == &items[1]);

        assert_se(items[0].item_prev == &items[2]);
        assert_se(items[2].item_prev == &items[1]);
        assert_se(items[1].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_REMOVE(item, head, &items[0]);
        assert_se(LIST_JUST_US(item, &items[0]));

        assert_se(items[2].item_next == NULL);
        assert_se(items[1].item_next == &items[2]);
        assert_se(items[3].item_next == &items[1]);

        assert_se(items[2].item_prev == &items[1]);
        assert_se(items[1].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_REMOVE(item, head, &items[1]);
        assert_se(LIST_JUST_US(item, &items[1]));

        assert_se(items[2].item_next == NULL);
        assert_se(items[3].item_next == &items[2]);

        assert_se(items[2].item_prev == &items[3]);
        assert_se(items[3].item_prev == NULL);

        LIST_REMOVE(item, head, &items[2]);
        assert_se(LIST_JUST_US(item, &items[2]));
        assert_se(LIST_JUST_US(item, head));

        LIST_REMOVE(item, head, &items[3]);
        assert_se(LIST_JUST_US(item, &items[3]));

        assert_se(head == NULL);

        for (i = 0; i < ELEMENTSOF(items); i++) {
                assert_se(LIST_JUST_US(item, &items[i]));
                LIST_APPEND(item, head, &items[i]);
        }

        assert_se(!LIST_JUST_US(item, head));

        assert_se(items[0].item_next == &items[1]);
        assert_se(items[1].item_next == &items[2]);
        assert_se(items[2].item_next == &items[3]);
        assert_se(items[3].item_next == NULL);

        assert_se(items[0].item_prev == NULL);
        assert_se(items[1].item_prev == &items[0]);
        assert_se(items[2].item_prev == &items[1]);
        assert_se(items[3].item_prev == &items[2]);

        for (i = 0; i < ELEMENTSOF(items); i++)
                LIST_REMOVE(item, head, &items[i]);

        assert_se(head == NULL);

        return 0;
}
Commit	Line	Data
3b18ae68 JJ	1	/***
	2	This file is part of systemd
	3
	4	Copyright 2013 Jan Janssen
	5
	6	systemd is free software; you can redistribute it and/or modify it
	7	under the terms of the GNU Lesser General Public License as published by
	8	the Free Software Foundation; either version 2.1 of the License, or
	9	(at your option) any later version.
	10
	11	systemd is distributed in the hope that it will be useful, but
	12	WITHOUT ANY WARRANTY; without even the implied warranty of
	13	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	14	Lesser General Public License for more details.
	15
	16	You should have received a copy of the GNU Lesser General Public License
	17	along with systemd; If not, see <http://www.gnu.org/licenses/>.
	18	***/
	19
	20	#include "list.h"
	21	#include "util.h"
	22
	23	int main(int argc, const char *argv[]) {
	24	size_t i;
	25	typedef struct list_item {
	26	LIST_FIELDS(struct list_item, item);
	27	} list_item;
	28	LIST_HEAD(list_item, head);
	29	list_item items[4];
	30	list_item *cursor;
	31
71fda00f	32	LIST_HEAD_INIT(head);
3b18ae68 JJ	33	assert_se(head == NULL);
	34
	35	for (i = 0; i < ELEMENTSOF(items); i++) {
71fda00f	36	LIST_INIT(item, &items[i]);
3b18ae68	37	assert_se(LIST_JUST_US(item, &items[i]));
71fda00f	38	LIST_PREPEND(item, head, &items[i]);
3b18ae68 JJ	39	}
3b18ae68 JJ	40
7663df37 LP	41	i = 0;
	42	LIST_FOREACH_OTHERS(item, cursor, &items[2]) {
	43	i++;
	44	assert_se(cursor != &items[2]);
	45	}
	46	assert_se(i == ELEMENTSOF(items)-1);
	47
3ad85e37 LP	48	i = 0;
	49	LIST_FOREACH_OTHERS(item, cursor, &items[0]) {
	50	i++;
	51	assert_se(cursor != &items[0]);
	52	}
	53	assert_se(i == ELEMENTSOF(items)-1);
	54
	55	i = 0;
	56	LIST_FOREACH_OTHERS(item, cursor, &items[3]) {
	57	i++;
	58	assert_se(cursor != &items[3]);
	59	}
	60	assert_se(i == ELEMENTSOF(items)-1);
	61
3b18ae68 JJ	62	assert_se(!LIST_JUST_US(item, head));
	63
	64	assert_se(items[0].item_next == NULL);
	65	assert_se(items[1].item_next == &items[0]);
	66	assert_se(items[2].item_next == &items[1]);
	67	assert_se(items[3].item_next == &items[2]);
	68
	69	assert_se(items[0].item_prev == &items[1]);
	70	assert_se(items[1].item_prev == &items[2]);
	71	assert_se(items[2].item_prev == &items[3]);
	72	assert_se(items[3].item_prev == NULL);
	73
71fda00f	74	LIST_FIND_HEAD(item, &items[0], cursor);
3b18ae68 JJ	75	assert_se(cursor == &items[3]);
3b18ae68 JJ	76
71fda00f	77	LIST_FIND_TAIL(item, &items[3], cursor);
3b18ae68 JJ	78	assert_se(cursor == &items[0]);
3b18ae68 JJ	79
71fda00f	80	LIST_REMOVE(item, head, &items[1]);
3b18ae68 JJ	81	assert_se(LIST_JUST_US(item, &items[1]));
	82
	83	assert_se(items[0].item_next == NULL);
	84	assert_se(items[2].item_next == &items[0]);
	85	assert_se(items[3].item_next == &items[2]);
	86
	87	assert_se(items[0].item_prev == &items[2]);
	88	assert_se(items[2].item_prev == &items[3]);
	89	assert_se(items[3].item_prev == NULL);
	90
71fda00f	91	LIST_INSERT_AFTER(item, head, &items[3], &items[1]);
3b18ae68 JJ	92	assert_se(items[0].item_next == NULL);
	93	assert_se(items[2].item_next == &items[0]);
	94	assert_se(items[1].item_next == &items[2]);
dbe465c9 AC	95	assert_se(items[3].item_next == &items[1]);
	96
	97	assert_se(items[0].item_prev == &items[2]);
	98	assert_se(items[2].item_prev == &items[1]);
	99	assert_se(items[1].item_prev == &items[3]);
	100	assert_se(items[3].item_prev == NULL);
	101
	102	LIST_REMOVE(item, head, &items[1]);
	103	assert_se(LIST_JUST_US(item, &items[1]));
	104
	105	assert_se(items[0].item_next == NULL);
	106	assert_se(items[2].item_next == &items[0]);
	107	assert_se(items[3].item_next == &items[2]);
	108
	109	assert_se(items[0].item_prev == &items[2]);
	110	assert_se(items[2].item_prev == &items[3]);
	111	assert_se(items[3].item_prev == NULL);
	112
	113	LIST_INSERT_BEFORE(item, head, &items[2], &items[1]);
	114	assert_se(items[0].item_next == NULL);
	115	assert_se(items[2].item_next == &items[0]);
	116	assert_se(items[1].item_next == &items[2]);
	117	assert_se(items[3].item_next == &items[1]);
	118
	119	assert_se(items[0].item_prev == &items[2]);
	120	assert_se(items[2].item_prev == &items[1]);
	121	assert_se(items[1].item_prev == &items[3]);
	122	assert_se(items[3].item_prev == NULL);
	123
	124	LIST_REMOVE(item, head, &items[0]);
	125	assert_se(LIST_JUST_US(item, &items[0]));
	126
	127	assert_se(items[2].item_next == NULL);
	128	assert_se(items[1].item_next == &items[2]);
	129	assert_se(items[3].item_next == &items[1]);
	130
	131	assert_se(items[2].item_prev == &items[1]);
	132	assert_se(items[1].item_prev == &items[3]);
	133	assert_se(items[3].item_prev == NULL);
	134
	135	LIST_INSERT_BEFORE(item, head, NULL, &items[0]);
	136	assert_se(items[0].item_next == NULL);
	137	assert_se(items[2].item_next == &items[0]);
	138	assert_se(items[1].item_next == &items[2]);
3b18ae68 JJ	139	assert_se(items[3].item_next == &items[1]);
	140
	141	assert_se(items[0].item_prev == &items[2]);
	142	assert_se(items[2].item_prev == &items[1]);
	143	assert_se(items[1].item_prev == &items[3]);
	144	assert_se(items[3].item_prev == NULL);
	145
71fda00f	146	LIST_REMOVE(item, head, &items[0]);
3b18ae68 JJ	147	assert_se(LIST_JUST_US(item, &items[0]));
	148
	149	assert_se(items[2].item_next == NULL);
	150	assert_se(items[1].item_next == &items[2]);
	151	assert_se(items[3].item_next == &items[1]);
	152
	153	assert_se(items[2].item_prev == &items[1]);
	154	assert_se(items[1].item_prev == &items[3]);
	155	assert_se(items[3].item_prev == NULL);
	156
71fda00f	157	LIST_REMOVE(item, head, &items[1]);
3b18ae68 JJ	158	assert_se(LIST_JUST_US(item, &items[1]));
	159
	160	assert_se(items[2].item_next == NULL);
	161	assert_se(items[3].item_next == &items[2]);
	162
	163	assert_se(items[2].item_prev == &items[3]);
	164	assert_se(items[3].item_prev == NULL);
	165
71fda00f	166	LIST_REMOVE(item, head, &items[2]);
3b18ae68 JJ	167	assert_se(LIST_JUST_US(item, &items[2]));
	168	assert_se(LIST_JUST_US(item, head));
	169
71fda00f	170	LIST_REMOVE(item, head, &items[3]);
3b18ae68 JJ	171	assert_se(LIST_JUST_US(item, &items[3]));
3b18ae68 JJ	172
502f1733 ZJS	173	assert_se(head == NULL);
	174
	175	for (i = 0; i < ELEMENTSOF(items); i++) {
	176	assert_se(LIST_JUST_US(item, &items[i]));
	177	LIST_APPEND(item, head, &items[i]);
	178	}
	179
	180	assert_se(!LIST_JUST_US(item, head));
	181
	182	assert_se(items[0].item_next == &items[1]);
	183	assert_se(items[1].item_next == &items[2]);
	184	assert_se(items[2].item_next == &items[3]);
	185	assert_se(items[3].item_next == NULL);
	186
	187	assert_se(items[0].item_prev == NULL);
	188	assert_se(items[1].item_prev == &items[0]);
	189	assert_se(items[2].item_prev == &items[1]);
	190	assert_se(items[3].item_prev == &items[2]);
	191
	192	for (i = 0; i < ELEMENTSOF(items); i++)
7663df37	193	LIST_REMOVE(item, head, &items[i]);
502f1733 ZJS	194
	195	assert_se(head == NULL);
	196
3b18ae68 JJ	197	return 0;
3b18ae68 JJ	198	}