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