1*640235e2SEnji Cooper /* $NetBSD: t_pslist.c,v 1.1 2016/04/09 04:39:47 riastradh Exp $ */
2*640235e2SEnji Cooper
3*640235e2SEnji Cooper /*-
4*640235e2SEnji Cooper * Copyright (c) 2016 The NetBSD Foundation, Inc.
5*640235e2SEnji Cooper * All rights reserved.
6*640235e2SEnji Cooper *
7*640235e2SEnji Cooper * This code is derived from software contributed to The NetBSD Foundation
8*640235e2SEnji Cooper * by Taylor R. Campbell.
9*640235e2SEnji Cooper *
10*640235e2SEnji Cooper * Redistribution and use in source and binary forms, with or without
11*640235e2SEnji Cooper * modification, are permitted provided that the following conditions
12*640235e2SEnji Cooper * are met:
13*640235e2SEnji Cooper * 1. Redistributions of source code must retain the above copyright
14*640235e2SEnji Cooper * notice, this list of conditions and the following disclaimer.
15*640235e2SEnji Cooper * 2. Redistributions in binary form must reproduce the above copyright
16*640235e2SEnji Cooper * notice, this list of conditions and the following disclaimer in the
17*640235e2SEnji Cooper * documentation and/or other materials provided with the distribution.
18*640235e2SEnji Cooper *
19*640235e2SEnji Cooper * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20*640235e2SEnji Cooper * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21*640235e2SEnji Cooper * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22*640235e2SEnji Cooper * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23*640235e2SEnji Cooper * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24*640235e2SEnji Cooper * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25*640235e2SEnji Cooper * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26*640235e2SEnji Cooper * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27*640235e2SEnji Cooper * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28*640235e2SEnji Cooper * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29*640235e2SEnji Cooper * POSSIBILITY OF SUCH DAMAGE.
30*640235e2SEnji Cooper */
31*640235e2SEnji Cooper
32*640235e2SEnji Cooper #include <sys/pslist.h>
33*640235e2SEnji Cooper
34*640235e2SEnji Cooper #include <atf-c.h>
35*640235e2SEnji Cooper
36*640235e2SEnji Cooper /*
37*640235e2SEnji Cooper * XXX This is a limited test to make sure the operations behave as
38*640235e2SEnji Cooper * described on a sequential machine. It does nothing to test the
39*640235e2SEnji Cooper * pserialize-safety of any operations.
40*640235e2SEnji Cooper */
41*640235e2SEnji Cooper
42*640235e2SEnji Cooper ATF_TC(misc);
ATF_TC_HEAD(misc,tc)43*640235e2SEnji Cooper ATF_TC_HEAD(misc, tc)
44*640235e2SEnji Cooper {
45*640235e2SEnji Cooper atf_tc_set_md_var(tc, "descr", "pserialize-safe list tests");
46*640235e2SEnji Cooper }
ATF_TC_BODY(misc,tc)47*640235e2SEnji Cooper ATF_TC_BODY(misc, tc)
48*640235e2SEnji Cooper {
49*640235e2SEnji Cooper struct pslist_head h = PSLIST_INITIALIZER;
50*640235e2SEnji Cooper struct element {
51*640235e2SEnji Cooper unsigned i;
52*640235e2SEnji Cooper struct pslist_entry entry;
53*640235e2SEnji Cooper } elements[] = {
54*640235e2SEnji Cooper { .i = 0, .entry = PSLIST_ENTRY_INITIALIZER },
55*640235e2SEnji Cooper { .i = 1 },
56*640235e2SEnji Cooper { .i = 2 },
57*640235e2SEnji Cooper { .i = 3 },
58*640235e2SEnji Cooper { .i = 4 },
59*640235e2SEnji Cooper { .i = 5 },
60*640235e2SEnji Cooper { .i = 6 },
61*640235e2SEnji Cooper { .i = 7 },
62*640235e2SEnji Cooper };
63*640235e2SEnji Cooper struct element *element;
64*640235e2SEnji Cooper unsigned i;
65*640235e2SEnji Cooper
66*640235e2SEnji Cooper /* Check PSLIST_INITIALIZER is destroyable. */
67*640235e2SEnji Cooper PSLIST_DESTROY(&h);
68*640235e2SEnji Cooper PSLIST_INIT(&h);
69*640235e2SEnji Cooper
70*640235e2SEnji Cooper /* Check PSLIST_ENTRY_INITIALIZER is destroyable. */
71*640235e2SEnji Cooper PSLIST_ENTRY_DESTROY(&elements[0], entry);
72*640235e2SEnji Cooper
73*640235e2SEnji Cooper for (i = 0; i < __arraycount(elements); i++)
74*640235e2SEnji Cooper PSLIST_ENTRY_INIT(&elements[i], entry);
75*640235e2SEnji Cooper
76*640235e2SEnji Cooper PSLIST_WRITER_INSERT_HEAD(&h, &elements[4], entry);
77*640235e2SEnji Cooper PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[2], entry);
78*640235e2SEnji Cooper PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[3], entry);
79*640235e2SEnji Cooper PSLIST_WRITER_INSERT_BEFORE(&elements[2], &elements[1], entry);
80*640235e2SEnji Cooper PSLIST_WRITER_INSERT_HEAD(&h, &elements[0], entry);
81*640235e2SEnji Cooper PSLIST_WRITER_INSERT_AFTER(&elements[4], &elements[5], entry);
82*640235e2SEnji Cooper PSLIST_WRITER_INSERT_AFTER(&elements[5], &elements[7], entry);
83*640235e2SEnji Cooper PSLIST_WRITER_INSERT_AFTER(&elements[5], &elements[6], entry);
84*640235e2SEnji Cooper
85*640235e2SEnji Cooper PSLIST_WRITER_REMOVE(&elements[0], entry);
86*640235e2SEnji Cooper ATF_CHECK(elements[0].entry.ple_next != NULL);
87*640235e2SEnji Cooper PSLIST_ENTRY_DESTROY(&elements[0], entry);
88*640235e2SEnji Cooper
89*640235e2SEnji Cooper PSLIST_WRITER_REMOVE(&elements[4], entry);
90*640235e2SEnji Cooper ATF_CHECK(elements[4].entry.ple_next != NULL);
91*640235e2SEnji Cooper PSLIST_ENTRY_DESTROY(&elements[4], entry);
92*640235e2SEnji Cooper
93*640235e2SEnji Cooper PSLIST_ENTRY_INIT(&elements[0], entry);
94*640235e2SEnji Cooper PSLIST_WRITER_INSERT_HEAD(&h, &elements[0], entry);
95*640235e2SEnji Cooper
96*640235e2SEnji Cooper PSLIST_ENTRY_INIT(&elements[4], entry);
97*640235e2SEnji Cooper PSLIST_WRITER_INSERT_AFTER(&elements[3], &elements[4], entry);
98*640235e2SEnji Cooper
99*640235e2SEnji Cooper i = 0;
100*640235e2SEnji Cooper PSLIST_WRITER_FOREACH(element, &h, struct element, entry) {
101*640235e2SEnji Cooper ATF_CHECK_EQ(i, element->i);
102*640235e2SEnji Cooper i++;
103*640235e2SEnji Cooper }
104*640235e2SEnji Cooper i = 0;
105*640235e2SEnji Cooper PSLIST_READER_FOREACH(element, &h, struct element, entry) {
106*640235e2SEnji Cooper ATF_CHECK_EQ(i, element->i);
107*640235e2SEnji Cooper i++;
108*640235e2SEnji Cooper }
109*640235e2SEnji Cooper
110*640235e2SEnji Cooper while ((element = PSLIST_WRITER_FIRST(&h, struct element, entry))
111*640235e2SEnji Cooper != NULL) {
112*640235e2SEnji Cooper PSLIST_WRITER_REMOVE(element, entry);
113*640235e2SEnji Cooper PSLIST_ENTRY_DESTROY(element, entry);
114*640235e2SEnji Cooper }
115*640235e2SEnji Cooper
116*640235e2SEnji Cooper PSLIST_DESTROY(&h);
117*640235e2SEnji Cooper }
118*640235e2SEnji Cooper
ATF_TP_ADD_TCS(tp)119*640235e2SEnji Cooper ATF_TP_ADD_TCS(tp)
120*640235e2SEnji Cooper {
121*640235e2SEnji Cooper
122*640235e2SEnji Cooper ATF_TP_ADD_TC(tp, misc);
123*640235e2SEnji Cooper
124*640235e2SEnji Cooper return atf_no_error();
125*640235e2SEnji Cooper }
126