Mercurial > ~dholland > hg > tradcpp > index.cgi
annotate array.c @ 38:b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
author | David A. Holland |
---|---|
date | Sat, 30 Mar 2013 21:02:25 -0400 (2013-03-31) |
parents | 9c1cecba517c |
children | 337110e7240a |
rev | line source |
---|---|
1 | 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 | |
2 | 41 a = domalloc(sizeof(*a)); |
42 array_init(a); | |
1 | 43 return a; |
44 } | |
45 | |
46 void | |
47 array_destroy(struct array *a) | |
48 { | |
49 array_cleanup(a); | |
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
2
diff
changeset
|
50 dofree(a); |
1 | 51 } |
52 | |
53 void | |
54 array_init(struct array *a) | |
55 { | |
56 a->num = a->max = 0; | |
57 a->v = NULL; | |
58 } | |
59 | |
60 void | |
61 array_cleanup(struct array *a) | |
62 { | |
63 arrayassert(a->num == 0); | |
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
2
diff
changeset
|
64 dofree(a->v); |
1 | 65 #ifdef ARRAYS_CHECKED |
66 a->v = NULL; | |
67 #endif | |
68 } | |
69 | |
2 | 70 void |
1 | 71 array_setsize(struct array *a, unsigned num) |
72 { | |
73 unsigned newmax; | |
74 void **newptr; | |
75 | |
76 if (num > a->max) { | |
77 newmax = a->max; | |
78 while (num > newmax) { | |
79 newmax = newmax ? newmax*2 : 4; | |
80 } | |
2 | 81 newptr = dorealloc(a->v, newmax*sizeof(*a->v)); |
1 | 82 a->v = newptr; |
83 a->max = newmax; | |
84 } | |
85 a->num = num; | |
86 } | |
87 | |
2 | 88 void |
1 | 89 array_insert(struct array *a, unsigned index_) |
90 { | |
91 unsigned movers; | |
92 | |
93 arrayassert(a->num <= a->max); | |
94 arrayassert(index_ < a->num); | |
95 | |
96 movers = a->num - index_; | |
97 | |
2 | 98 array_setsize(a, a->num + 1); |
1 | 99 |
100 memmove(a->v + index_+1, a->v + index_, movers*sizeof(*a->v)); | |
101 } | |
102 | |
103 void | |
104 array_remove(struct array *a, unsigned index_) | |
105 { | |
106 unsigned movers; | |
107 | |
108 arrayassert(a->num <= a->max); | |
109 arrayassert(index_ < a->num); | |
110 | |
111 movers = a->num - (index_ + 1); | |
112 memmove(a->v + index_, a->v + index_+1, movers*sizeof(*a->v)); | |
113 a->num--; | |
114 } |