1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
/*
* Part: Vector structure manipulation.
*
* Version: $Id: vector.c,v 1.0.3 2003/05/11 02:28:03 acassen Exp $
*
* Author: Alexandre Cassen, <acassen@linux-vs.org>
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version
* 2 of the License, or (at your option) any later version.
*
* Copyright (c) 2002, 2003, 2004 Alexandre Cassen
* Copyright (c) 2005 Christophe Varoqui
*/
#include "memory.h"
#include <stdlib.h>
#include "vector.h"
/*
* Initialize vector struct.
* allocated 'size' slot elements then return vector.
*/
vector
vector_alloc(void)
{
vector v = (vector) MALLOC(sizeof (struct _vector));
return v;
}
/* allocated one slot */
void *
vector_alloc_slot(vector v)
{
v->allocated += VECTOR_DEFAULT_SIZE;
if (v->slot)
v->slot = REALLOC(v->slot, sizeof (void *) * v->allocated);
else
v->slot = (void *) MALLOC(sizeof (void *) * v->allocated);
if (!v->slot)
v->allocated -= VECTOR_DEFAULT_SIZE;
return v->slot;
}
void *
vector_insert_slot(vector v, int slot, void *value)
{
int i;
if (!vector_alloc_slot(v))
return NULL;
for (i = (v->allocated /VECTOR_DEFAULT_SIZE) - 2; i >= slot; i--)
v->slot[i + 1] = v->slot[i];
v->slot[slot] = value;
return v->slot[slot];
}
int
find_slot(vector v, void * addr)
{
int i;
for (i = 0; i < (v->allocated / VECTOR_DEFAULT_SIZE); i++)
if (v->slot[i] == addr)
return i;
return -1;
}
void
vector_del_slot(vector v, int slot)
{
int i;
if (!v->allocated || slot < 0 || slot > VECTOR_SIZE(v))
return;
for (i = slot + 1; i < (v->allocated / VECTOR_DEFAULT_SIZE); i++)
v->slot[i-1] = v->slot[i];
v->allocated -= VECTOR_DEFAULT_SIZE;
if (!v->allocated) {
FREE(v->slot);
v->slot = NULL;
}
else
v = REALLOC(v->slot, sizeof (void *) * v->allocated);
}
void
vector_repack(vector v)
{
int i;
if (!v->allocated)
return;
for (i = 0; i < (v->allocated / VECTOR_DEFAULT_SIZE); i++)
if (i > 0 && v->slot[i] == NULL)
vector_del_slot(v, i--);
}
/* Free memory vector allocation */
void
vector_free(vector v)
{
if (!v)
return;
if (v->slot)
FREE(v->slot);
FREE(v);
}
void
free_strvec(vector strvec)
{
int i;
char *str;
if (!strvec)
return;
vector_foreach_slot (strvec, str, i)
if (str)
FREE(str);
vector_free(strvec);
}
/* Set a vector slot value */
void
vector_set_slot(vector v, void *value)
{
unsigned int i = v->allocated - 1;
v->slot[i] = value;
}
|
