← Back to branch summary

~ubuntu-branches/ubuntu/utopic/mtbl/utopic-proposed

« back to all changes in this revision

Viewing changes to libmy/vector.h

  • Committer: Package Import Robot
  • Author(s): Robert S. Edmonds
  • Date: 2014-01-21 16:30:22 UTC
  • mfrom: (1.1.2)
  • Revision ID: package-import@ubuntu.com-20140121163022-g1077ma2csn1gne8
Tags: 0.4-1
New upstream release.

Show diffs side-by-side

added added

removed removed

Lines of Context:
libmy/vector.h
 
1
/*
 
2
 * Copyright (c) 2012, 2013 by Farsight Security, Inc.
 
3
 *
 
4
 * Licensed under the Apache License, Version 2.0 (the "License");
 
5
 * you may not use this file except in compliance with the License.
 
6
 * You may obtain a copy of the License at
 
7
 *
 
8
 *    http://www.apache.org/licenses/LICENSE-2.0
 
9
 *
 
10
 * Unless required by applicable law or agreed to in writing, software
 
11
 * distributed under the License is distributed on an "AS IS" BASIS,
 
12
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 
13
 * See the License for the specific language governing permissions and
 
14
 * limitations under the License.
 
15
 */
 
16
 
 
17
#include <assert.h>
 
18
 
 
19
#include "my_alloc.h"
 
20
 
 
21
#define VECTOR_GENERATE(name, type)                                     \
 
22
typedef struct name##__vector {                                         \
 
23
        type *          _v;                                             \
 
24
        type *          _p;                                             \
 
25
        size_t          _n, _n_alloced, _hint;                          \
 
26
} name;                                                                 \
 
27
static inline name *                                                    \
 
28
name##_init(unsigned hint)                                              \
 
29
{                                                                       \
 
30
        name *vec;                                                      \
 
31
        vec = my_calloc(1, sizeof(name));                               \
 
32
        if (hint == 0) hint = 1;                                        \
 
33
        vec->_hint = vec->_n_alloced = hint;                            \
 
34
        vec->_v = my_malloc(vec->_n_alloced * sizeof(type));            \
 
35
        vec->_p = &(vec->_v[0]);                                        \
 
36
        return (vec);                                                   \
 
37
}                                                                       \
 
38
static inline void                                                      \
 
39
name##_reinit(unsigned hint, name *vec)                                 \
 
40
{                                                                       \
 
41
        if (hint == 0) hint = 1;                                        \
 
42
        vec->_hint = vec->_n_alloced = hint;                            \
 
43
        vec->_n = 0;                                                    \
 
44
        vec->_v = my_malloc(vec->_n_alloced * sizeof(type));            \
 
45
        vec->_p = &(vec->_v[0]);                                        \
 
46
}                                                                       \
 
47
static inline void                                                      \
 
48
name##_detach(name *vec, type **out, size_t *outsz)                     \
 
49
{                                                                       \
 
50
        *(out) = (vec)->_v;                                             \
 
51
        *(outsz) = (vec)->_n;                                           \
 
52
        (vec)->_n = 0;                                                  \
 
53
        (vec)->_n_alloced = (vec)->_hint;                               \
 
54
        (vec)->_v = my_malloc((vec)->_n_alloced * sizeof(type));        \
 
55
        (vec)->_p = &(vec->_v[0]);                                      \
 
56
}                                                                       \
 
57
static inline void                                                      \
 
58
name##_destroy(name **vec)                                              \
 
59
{                                                                       \
 
60
        if (*vec) {                                                     \
 
61
                free((*vec)->_v);                                       \
 
62
                free((*vec));                                           \
 
63
                *vec = NULL;                                            \
 
64
        }                                                               \
 
65
}                                                                       \
 
66
static inline void                                                      \
 
67
name##_reserve(name *vec, size_t n_elems)                               \
 
68
{                                                                       \
 
69
        while ((n_elems) > ((vec)->_n_alloced - (vec)->_n)) {           \
 
70
                (vec)->_n_alloced *= 2;                                 \
 
71
                (vec)->_v = my_realloc((vec)->_v, (vec)->_n_alloced     \
 
72
                                   * sizeof(type));                     \
 
73
                (vec)->_p = &((vec)->_v[(vec)->_n]);                    \
 
74
        }                                                               \
 
75
}                                                                       \
 
76
static inline void                                                      \
 
77
name##_add(name *vec, type elem)                                        \
 
78
{                                                                       \
 
79
        while ((vec)->_n + 1 > (vec)->_n_alloced) {                     \
 
80
                (vec)->_n_alloced *= 2;                                 \
 
81
                (vec)->_v = my_realloc((vec)->_v, (vec)->_n_alloced     \
 
82
                                   * sizeof(type));                     \
 
83
                (vec)->_p = &((vec)->_v[(vec)->_n]);                    \
 
84
        }                                                               \
 
85
        (vec)->_v[(vec)->_n] = elem;                                    \
 
86
        (vec)->_n += 1;                                                 \
 
87
        (vec)->_p = &((vec)->_v[(vec)->_n]);                            \
 
88
}                                                                       \
 
89
static inline void                                                      \
 
90
name##_append(name *vec, type const *elems, size_t n_elems)             \
 
91
{                                                                       \
 
92
        name##_reserve(vec, n_elems);                                   \
 
93
        memcpy((vec)->_v + (vec)->_n, elems, (n_elems) * sizeof(type)); \
 
94
        (vec)->_n += (n_elems);                                         \
 
95
        (vec)->_p = &((vec)->_v[(vec)->_n]);                            \
 
96
}                                                                       \
 
97
static inline void                                                      \
 
98
name##_extend(name *vec0, name *vec1)                                   \
 
99
{                                                                       \
 
100
        name##_append(vec0, (vec1)->_v, (vec1)->_n);                    \
 
101
}                                                                       \
 
102
static inline void                                                      \
 
103
name##_reset(name *vec)                                                 \
 
104
{                                                                       \
 
105
        (vec)->_n = 0;                                                  \
 
106
        if ((vec)->_n_alloced > (vec)->_hint) {                         \
 
107
                (vec)->_n_alloced = (vec)->_hint;                       \
 
108
                (vec)->_v = my_realloc((vec)->_v, (vec)->_n_alloced     \
 
109
                                   * sizeof(type));                     \
 
110
        }                                                               \
 
111
        (vec)->_p = &(vec->_v[0]);                                      \
 
112
}                                                                       \
 
113
static inline void                                                      \
 
114
name##_clip(name *vec, size_t n_elems)                                  \
 
115
{                                                                       \
 
116
        if (n_elems < (vec)->_n) {                                      \
 
117
                (vec)->_n = n_elems;                                    \
 
118
                (vec)->_p = &((vec)->_v[(vec)->_n]);                    \
 
119
        }                                                               \
 
120
}                                                                       \
 
121
static inline size_t                                                    \
 
122
name##_bytes(name *vec)                                                 \
 
123
{                                                                       \
 
124
        return ((vec)->_n * sizeof(type));                              \
 
125
}                                                                       \
 
126
static inline size_t                                                    \
 
127
name##_size(name *vec)                                                  \
 
128
{                                                                       \
 
129
        return ((vec)->_n);                                             \
 
130
}                                                                       \
 
131
static inline type                                                      \
 
132
name##_value(name *vec, size_t i)                                       \
 
133
{                                                                       \
 
134
        assert(i < (vec)->_n);                                          \
 
135
        return ((vec)->_v[i]);                                          \
 
136
}                                                                       \
 
137
static inline type *                                                    \
 
138
name##_ptr(name *vec)                                                   \
 
139
{                                                                       \
 
140
        return ((vec)->_p);                                             \
 
141
}                                                                       \
 
142
static inline type *                                                    \
 
143
name##_data(name *vec)                                                  \
 
144
{                                                                       \
 
145
        return ((vec)->_v);                                             \
 
146
}                                                                       \
 
147
static inline void                                                      \
 
148
name##_advance(name *vec, size_t x)                                     \
 
149
{                                                                       \
 
150
        assert(x <= ((vec)->_n_alloced - (vec)->_n));                   \
 
151
        (vec)->_n += x;                                                 \
 
152
        (vec)->_p = &((vec)->_v[(vec)->_n]);                            \
 
153
}