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