1 /* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9 * or http://www.opensolaris.org/os/licensing. 10 * See the License for the specific language governing permissions 11 * and limitations under the License. 12 * 13 * When distributing Covered Code, include this CDDL HEADER in each 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15 * If applicable, add the following below this CDDL HEADER, with the 16 * fields enclosed by brackets "[]" replaced with your own identifying 17 * information: Portions Copyright [yyyy] [name of copyright owner] 18 * 19 * CDDL HEADER END 20 */ 21 22 /* 23 * Copyright 2006 Sun Microsystems, Inc. All rights reserved. 24 * Use is subject to license terms. 25 * 26 */ 27 28 /* $Id: list.c 146 2006-03-24 00:26:54Z njacobs $ */ 29 30 #pragma ident "%Z%%M% %I% %E% SMI" 31 32 /*LINTLIBRARY*/ 33 34 #include <stdlib.h> 35 #include <stdarg.h> 36 #include <errno.h> 37 38 static int __list_increment = 16; 39 40 int 41 list_append(void ***list, void *item) 42 { 43 int count; 44 45 if ((list == NULL) || (item == NULL)) { 46 errno = EINVAL; 47 return (-1); 48 } 49 50 if (item != NULL) { 51 if (*list == NULL) 52 *list = (void **)calloc(__list_increment, 53 sizeof (void *)); 54 55 for (count = 0; (*list)[count] != NULL; count++); 56 57 if ((count + 1) % __list_increment == 0) { /* expand the list */ 58 void **new_list = NULL; 59 int new_size = (((count + 1) / __list_increment) + 1) * 60 __list_increment; 61 62 new_list = (void **)calloc(new_size, sizeof (void *)); 63 if (new_list == NULL) 64 return (-1); 65 66 for (count = 0; (*list)[count] != NULL; count++) 67 new_list[count] = (*list)[count]; 68 free(*list); 69 *list = new_list; 70 } 71 72 (*list)[count] = item; 73 } 74 75 return (0); 76 } 77 78 /* 79 * list_concatenate() takes in two NULL terminated lists of items (type **) 80 * and creates a new list with items from list2 appended on the end of 81 * the list of items from list1. The result is a list (type **). If 82 * there is a failure, -1 is returned. 83 */ 84 int 85 list_concatenate(void ***result, void **list2) 86 { 87 void **list1; 88 int size1 = 0, 89 size2 = 0, 90 new_size = 0; 91 92 if ((result == NULL) || ((*result == NULL) && (list2 == NULL))) { 93 errno = EINVAL; 94 return (-1); 95 } 96 97 list1 = *result; 98 99 if (list1 != NULL) 100 for (size1 = 0; list1[size1] != NULL; size1++); 101 if (list2 != NULL) 102 for (size2 = 0; list2[size2] != NULL; size2++); 103 104 /* list1 + list2 padded to a multiple of _list_increment */ 105 new_size = ((size1 + size2)/__list_increment + 2) * __list_increment; 106 107 if ((*result = (void **)calloc((new_size), sizeof (void *))) 108 != NULL) { 109 int count = 0; 110 111 if (list1 != NULL) 112 for (size1 = 0; list1[size1] != NULL; size1++) 113 (*result)[count++] = list1[size1]; 114 if (list2 != NULL) 115 for (size2 = 0; list2[size2] != NULL; size2++) 116 (*result)[count++] = list2[size2]; 117 free(list1); 118 } 119 120 return (0); 121 } 122 123 /* 124 * list_locate() iterates through the list passed in and uses the comparison 125 * routine and element passed in to find an element in the list. It 126 * returns the first element matched, or NULL if none exists 127 */ 128 void * 129 list_locate(void **list, int (*compare)(void *, void *), void *element) 130 { 131 int current = 0; 132 133 if ((list != NULL) && (element != NULL)) 134 for (current = 0; list[current] != NULL; current++) 135 if ((compare)(list[current], element) == 0) 136 return (list[current]); 137 return (NULL); 138 } 139 140 void 141 list_remove(void ***list, void *item) 142 { 143 int i, count; 144 void **tmp = NULL; 145 146 if ((list == NULL) || (*list == NULL) || (item == NULL)) 147 return; 148 149 for (count = 0; (*list)[count] != NULL; count++); 150 151 if (count > 0) { 152 int new_size = (((count + 1) / __list_increment) + 1) * 153 __list_increment; 154 155 if ((tmp = (void **)calloc(new_size, sizeof (void *))) != NULL) 156 tmp = *list; 157 158 /* copy up to item */ 159 for (i = 0; (((*list)[i] != NULL) && ((*list)[i] != item)); i++) 160 tmp[i] = (*list)[i]; 161 /* copy after item */ 162 if ((*list)[i] == item) 163 for (++i; ((*list)[i] != NULL); i++) 164 tmp[i-1] = (*list)[i]; 165 } 166 167 /* replace the list */ 168 if (tmp != *list) { 169 free(*list); 170 *list = tmp; 171 } 172 } 173