File: vector.c

package info (click to toggle)
nmh 1.6-2
  • links: PTS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 6,204 kB
  • ctags: 3,851
  • sloc: ansic: 48,922; sh: 16,422; makefile: 559; perl: 509; lex: 402; awk: 74
file content (275 lines) | stat: -rw-r--r-- 6,264 bytes parent folder | download | duplicates (2)
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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
/*
 * vector.c -- dynamically sized vectors
 *
 * This code is Copyright (c) 2013, by the authors of nmh.  See the
 * COPYRIGHT file in the root directory of the nmh distribution for
 * complete copyright information.
 */

/*
 * This file defines several kinds of vectors:
 *   bvector:  bit vector
 *   svector:  vector of char arrays
 *   ivector:  vector of ints
 *
 * The interfaces provide only the capabilities needed by nmh.  The
 * implementations rely on dynamic allocation, so that a vector
 * can be as large as needed, as long as it fits in (virtual) memory.
 */

#include <h/mh.h>
#include <h/utils.h>

#define VEC_INIT_SIZE 256

/*
 * These try to hide the type of the "bits" member of bvector.  But if
 * that is changed to a type that's wider than unsigned long, the 1ul
 * constants in the code below must also be changed to a 1 that's at
 * least as wide as the new type.
 */
#ifndef Nbby
# define Nbby 8
#endif
#define BVEC_WORD(vec, max) ((max) / (sizeof *vec->bits * Nbby))
#define BVEC_OFFSET(vec, max) ((max) % (sizeof *vec->bits * Nbby))
#define BVEC_BYTES(vec, n) \
    ((BVEC_WORD (vec, n) + (BVEC_OFFSET (vec, n) == 0 ? 0 : 1))  * \
    sizeof *vec->bits)

struct bvector {
    unsigned long *bits;
    size_t maxsize;
};

static void bvector_resize (bvector_t, size_t);

bvector_t
bvector_create (size_t init_size) {
    bvector_t vec = mh_xmalloc (sizeof *vec);
    size_t bytes = BVEC_BYTES (vec, init_size  ?  init_size  :  VEC_INIT_SIZE);

    vec->bits = mh_xmalloc (bytes);
    memset (vec->bits, 0, bytes);
    vec->maxsize = bytes * Nbby;

    return vec;
}

void
bvector_copy (bvector_t dest, bvector_t src) {
    size_t bytes = BVEC_BYTES (dest, src->maxsize);

    free (dest->bits);
    dest->bits = mh_xmalloc (bytes);
    memcpy (dest->bits, src->bits, bytes);
    dest->maxsize = src->maxsize;
}

void
bvector_free (bvector_t vec) {
    free (vec->bits);
    free (vec);
}

void
bvector_clear (bvector_t vec, size_t n) {
    size_t word = BVEC_WORD (vec,n);
    size_t offset = BVEC_OFFSET (vec, n);

    if (n >= vec->maxsize) bvector_resize (vec, n);

    assert (sizeof *vec->bits <= sizeof 1ul);
    vec->bits[word] &= ~(1ul << offset);
}


void
bvector_clear_all (bvector_t vec) {
    memset (vec->bits, 0, BVEC_BYTES (vec, vec->maxsize));
}


void
bvector_set (bvector_t vec, size_t n) {
    size_t word = BVEC_WORD (vec, n);
    size_t offset = BVEC_OFFSET (vec, n);

    if (n >= vec->maxsize) bvector_resize (vec, n);
    assert (sizeof *vec->bits <= sizeof 1ul);
    vec->bits[word] |= 1ul << offset;
}

unsigned int
bvector_at (bvector_t vec, size_t i) {
    size_t word = BVEC_WORD (vec, i);
    size_t offset = BVEC_OFFSET (vec, i);

    assert (sizeof *vec->bits <= sizeof 1ul);
    return i < vec->maxsize
        ?  (vec->bits[word] & (1ul << offset) ? 1 : 0)
        :  0;
}

static void
bvector_resize (bvector_t vec, size_t maxsize) {
    size_t old_maxsize = vec->maxsize;
    size_t bytes;
    size_t i;

    while ((vec->maxsize *= 2) < maxsize) continue;
    bytes = BVEC_BYTES (vec, vec->maxsize);
    vec->bits = mh_xrealloc (vec->bits, bytes);
    for (i = old_maxsize; i < vec->maxsize; ++i) bvector_clear (vec, i);
}

const unsigned long *
bvector_bits (bvector_t vec) {
    return vec->bits;
}

size_t
bvector_maxsize (bvector_t vec) {
    return vec->maxsize;
}


struct svector {
    char **strs;
    size_t maxsize;
    size_t size;
};

static void svector_resize (svector_t, size_t);

svector_t
svector_create (size_t init_size) {
    svector_t vec = mh_xmalloc (sizeof *vec);
    size_t bytes;

    vec->maxsize = init_size ? init_size : VEC_INIT_SIZE;
    bytes = vec->maxsize * sizeof (char *);
    vec->strs = mh_xmalloc (bytes);
    memset (vec->strs, 0, bytes);
    vec->size = 0;

    return vec;
}

void
svector_free (svector_t vec) {
    free (vec->strs);
    free (vec);
}

char *
svector_push_back (svector_t vec, char *s) {
    if (++vec->size >= vec->maxsize) svector_resize (vec, vec->size);
    return vec->strs[vec->size-1] = s;
}

char *
svector_at (svector_t vec, size_t i) {
    if (i >= vec->maxsize) svector_resize (vec, i);
    return vec->strs[i];
}

/*
 * Return address of first element that stringwise matches s.
 * The caller can replace the contents of the return address.
 */
char **
svector_find (svector_t vec, const char *s) {
    size_t i;
    char **str = vec->strs;

    for (i = 0; i < vec->size; ++i, ++str) {
        if (*str  &&  ! strcmp(*str, s)) {
            return str;
        }
    }

    return NULL;
}

char **
svector_strs (svector_t vec) {
    return vec->strs;
}

size_t
svector_size (svector_t vec) {
    return vec->size;
}

static void
svector_resize (svector_t vec, size_t maxsize) {
    size_t old_maxsize = vec->maxsize;
    size_t i;

    while ((vec->maxsize *= 2) < maxsize) continue;
    vec->strs = mh_xrealloc (vec->strs, vec->maxsize * sizeof (char *));
    for (i = old_maxsize; i < vec->maxsize; ++i) vec->strs[i] = NULL;
}


struct ivector {
    int *ints;
    size_t maxsize;
    size_t size;
};

static void ivector_resize (ivector_t, size_t);

ivector_t
ivector_create (size_t init_size) {
    ivector_t vec = mh_xmalloc (sizeof *vec);
    size_t bytes;

    vec->maxsize = init_size ? init_size : VEC_INIT_SIZE;
    bytes = vec->maxsize * sizeof (int);
    vec->ints = mh_xmalloc (bytes);
    memset (vec->ints, 0, bytes);
    vec->size = 0;

    return vec;
}

void
ivector_free (ivector_t vec) {
    free (vec->ints);
    free (vec);
}

int
ivector_push_back (ivector_t vec, int n) {
    if (++vec->size >= vec->maxsize) ivector_resize (vec, vec->size);
    return vec->ints[vec->size-1] = n;
}

int
ivector_at (ivector_t vec, size_t i) {
    if (i >= vec->maxsize) ivector_resize (vec, i);
    return vec->ints[i];
}

int *
ivector_atp (ivector_t vec, size_t i) {
    if (i >= vec->maxsize) ivector_resize (vec, i);
    return &vec->ints[i];
}

size_t
ivector_size (ivector_t vec) {
    return vec->size;
}

static void
ivector_resize (ivector_t vec, size_t maxsize) {
    size_t old_maxsize = vec->maxsize;
    size_t i;

    while ((vec->maxsize *= 2) < maxsize) continue;
    vec->ints = mh_xrealloc (vec->ints, vec->maxsize * sizeof (int));
    for (i = old_maxsize; i < vec->maxsize; ++i) vec->ints[i] = 0;
}