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