Home | History | Annotate | Line # | Download | only in sys
t_list.c revision 1.3
      1  1.3    rillig /*	$NetBSD: t_list.c,v 1.3 2024/07/10 20:52:32 rillig Exp $	*/
      2  1.1  pgoyette 
      3  1.1  pgoyette /*-
      4  1.1  pgoyette  * Copyright (c) 2017 The NetBSD Foundation, Inc.
      5  1.1  pgoyette  * All rights reserved.
      6  1.1  pgoyette  *
      7  1.1  pgoyette  * This code is derived from software contributed to The NetBSD Foundation
      8  1.1  pgoyette  * by Paul Goyette
      9  1.1  pgoyette  *
     10  1.1  pgoyette  * Redistribution and use in source and binary forms, with or without
     11  1.1  pgoyette  * modification, are permitted provided that the following conditions
     12  1.1  pgoyette  * are met:
     13  1.1  pgoyette  * 1. Redistributions of source code must retain the above copyright
     14  1.1  pgoyette  *    notice, this list of conditions and the following disclaimer.
     15  1.1  pgoyette  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.1  pgoyette  *    notice, this list of conditions and the following disclaimer in the
     17  1.1  pgoyette  *    documentation and/or other materials provided with the distribution.
     18  1.1  pgoyette  *
     19  1.1  pgoyette  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     20  1.1  pgoyette  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     21  1.1  pgoyette  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     22  1.1  pgoyette  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     23  1.1  pgoyette  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     24  1.1  pgoyette  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     25  1.1  pgoyette  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     26  1.1  pgoyette  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     27  1.1  pgoyette  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     28  1.1  pgoyette  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     29  1.1  pgoyette  * POSSIBILITY OF SUCH DAMAGE.
     30  1.1  pgoyette  */
     31  1.1  pgoyette 
     32  1.1  pgoyette #include <stdlib.h>
     33  1.1  pgoyette #include <string.h>
     34  1.1  pgoyette 
     35  1.1  pgoyette #include <sys/queue.h>
     36  1.1  pgoyette 
     37  1.1  pgoyette #include <atf-c.h>
     38  1.1  pgoyette 
     39  1.1  pgoyette /*
     40  1.1  pgoyette  * XXX This is a limited test to make sure the operations behave as
     41  1.1  pgoyette  * described on a sequential machine.  It does nothing to test the
     42  1.1  pgoyette  * pserialize-safety of any operations.
     43  1.1  pgoyette  */
     44  1.1  pgoyette 
     45  1.1  pgoyette ATF_TC(list_move);
     46  1.1  pgoyette ATF_TC_HEAD(list_move, tc)
     47  1.1  pgoyette {
     48  1.1  pgoyette 	atf_tc_set_md_var(tc, "descr", "LIST_MOVE verification");
     49  1.1  pgoyette }
     50  1.1  pgoyette ATF_TC_BODY(list_move, tc)
     51  1.1  pgoyette {
     52  1.1  pgoyette 	LIST_HEAD(listhead, entry) old_head, new_head, old_copy;
     53  1.1  pgoyette 	struct entry {
     54  1.1  pgoyette 		LIST_ENTRY(entry) entries;
     55  1.1  pgoyette 		uint64_t	value;
     56  1.1  pgoyette 	} *n1, *n2, *n3;
     57  1.1  pgoyette 
     58  1.1  pgoyette 	LIST_INIT(&old_head);
     59  1.1  pgoyette 
     60  1.1  pgoyette 	n1 = malloc(sizeof(struct entry));
     61  1.1  pgoyette 	n1->value = 1;
     62  1.1  pgoyette 	LIST_INSERT_HEAD(&old_head, n1, entries);
     63  1.1  pgoyette 
     64  1.1  pgoyette 	n2 = malloc(sizeof(struct entry));
     65  1.1  pgoyette 	n2->value = 2;
     66  1.1  pgoyette 	LIST_INSERT_HEAD(&old_head, n2, entries);
     67  1.1  pgoyette 
     68  1.2  pgoyette 	LIST_MOVE(&old_head, &new_head, entries);
     69  1.1  pgoyette 
     70  1.1  pgoyette 	memcpy(&old_copy, &old_head, sizeof(old_head));
     71  1.1  pgoyette 
     72  1.1  pgoyette 	n3 = LIST_FIRST(&new_head);
     73  1.3    rillig 	ATF_CHECK_MSG(n3->value == 2, "Unexpected value for LIST_FIRST");
     74  1.1  pgoyette 
     75  1.1  pgoyette 	LIST_REMOVE(n3, entries);
     76  1.1  pgoyette 	ATF_CHECK_MSG(memcmp(&old_copy, &old_head, sizeof(old_head)) == 0,
     77  1.1  pgoyette 	    "Unexpected modification of old_head during LIST_REMOVE");
     78  1.1  pgoyette 
     79  1.1  pgoyette 	LIST_REMOVE(LIST_FIRST(&new_head), entries);
     80  1.1  pgoyette 	ATF_CHECK_MSG(LIST_EMPTY(&new_head), "New list not empty!");
     81  1.1  pgoyette }
     82  1.1  pgoyette 
     83  1.1  pgoyette ATF_TP_ADD_TCS(tp)
     84  1.1  pgoyette {
     85  1.1  pgoyette 
     86  1.1  pgoyette 	ATF_TP_ADD_TC(tp, list_move);
     87  1.1  pgoyette 
     88  1.1  pgoyette 	return atf_no_error();
     89  1.1  pgoyette }
     90