1 /*- 2 * Copyright (c) 2009 The NetBSD Foundation, Inc. 3 * All rights reserved. 4 * 5 * This code is derived from software contributed to The NetBSD Foundation 6 * by David A. Holland. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 18 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 19 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 20 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 21 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 27 * POSSIBILITY OF SUCH DAMAGE. 28 */ 29 30 #include <stdlib.h> 31 #include <string.h> 32 33 #define ARRAYINLINE 34 #include "array.h" 35 36 struct array * 37 array_create(void) 38 { 39 struct array *a; 40 41 a = malloc(sizeof(*a)); 42 if (a != NULL) { 43 array_init(a); 44 } 45 return a; 46 } 47 48 void 49 array_destroy(struct array *a) 50 { 51 array_cleanup(a); 52 free(a); 53 } 54 55 void 56 array_init(struct array *a) 57 { 58 a->num = a->max = 0; 59 a->v = NULL; 60 } 61 62 void 63 array_cleanup(struct array *a) 64 { 65 arrayassert(a->num == 0); 66 free(a->v); 67 #ifdef ARRAYS_CHECKED 68 a->v = NULL; 69 #endif 70 } 71 72 int 73 array_setsize(struct array *a, unsigned num) 74 { 75 unsigned newmax; 76 void **newptr; 77 78 if (num > a->max) { 79 newmax = a->max; 80 while (num > newmax) { 81 newmax = newmax ? newmax*2 : 4; 82 } 83 newptr = realloc(a->v, newmax*sizeof(*a->v)); 84 if (newptr == NULL) { 85 return -1; 86 } 87 a->v = newptr; 88 a->max = newmax; 89 } 90 a->num = num; 91 return 0; 92 } 93 94 int 95 array_insert(struct array *a, unsigned index_) 96 { 97 unsigned movers; 98 99 arrayassert(a->num <= a->max); 100 arrayassert(index_ < a->num); 101 102 movers = a->num - index_; 103 104 if (array_setsize(a, a->num + 1)) { 105 return -1; 106 } 107 108 memmove(a->v + index_+1, a->v + index_, movers*sizeof(*a->v)); 109 return 0; 110 } 111 112 void 113 array_remove(struct array *a, unsigned index_) 114 { 115 unsigned movers; 116 117 arrayassert(a->num <= a->max); 118 arrayassert(index_ < a->num); 119 120 movers = a->num - (index_ + 1); 121 memmove(a->v + index_, a->v + index_+1, movers*sizeof(*a->v)); 122 a->num--; 123 } 124