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