1 | /*
|
---|
2 | * Copyright (c) 2012 Sean Bartell
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
13 | * documentation and/or other materials provided with the distribution.
|
---|
14 | * - The name of the author may not be used to endorse or promote products
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup bithenge
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /**
|
---|
33 | * @file
|
---|
34 | * Trees and nodes.
|
---|
35 | */
|
---|
36 |
|
---|
37 | #ifndef BITHENGE_TREE_H_
|
---|
38 | #define BITHENGE_TREE_H_
|
---|
39 |
|
---|
40 | #include <assert.h>
|
---|
41 | #include <inttypes.h>
|
---|
42 | #include <sys/types.h>
|
---|
43 | #include "os.h"
|
---|
44 |
|
---|
45 | #ifdef INTMAX_MAX
|
---|
46 | typedef intmax_t bithenge_int_t;
|
---|
47 | #define BITHENGE_PRId PRIdMAX
|
---|
48 | #else
|
---|
49 | typedef int64_t bithenge_int_t;
|
---|
50 | #define BITHENGE_PRId PRId64
|
---|
51 | #endif
|
---|
52 |
|
---|
53 | /** Indicates the type of a tree node. */
|
---|
54 | typedef enum {
|
---|
55 | /** An internal node with labelled edges to other nodes. */
|
---|
56 | BITHENGE_NODE_INTERNAL = 1,
|
---|
57 | /** A leaf node holding a boolean value. */
|
---|
58 | BITHENGE_NODE_BOOLEAN,
|
---|
59 | /** A leaf node holding an integer. */
|
---|
60 | BITHENGE_NODE_INTEGER,
|
---|
61 | /** A leaf node holding a string. */
|
---|
62 | BITHENGE_NODE_STRING,
|
---|
63 | /** A leaf node holding a binary blob. */
|
---|
64 | BITHENGE_NODE_BLOB,
|
---|
65 | } bithenge_node_type_t;
|
---|
66 |
|
---|
67 | typedef struct bithenge_node_t {
|
---|
68 | /** @privatesection */
|
---|
69 | bithenge_node_type_t type;
|
---|
70 | unsigned int refs;
|
---|
71 | union {
|
---|
72 | const struct bithenge_internal_node_ops_t *internal_ops;
|
---|
73 | bool boolean_value;
|
---|
74 | bithenge_int_t integer_value;
|
---|
75 | struct {
|
---|
76 | const char *ptr;
|
---|
77 | bool needs_free;
|
---|
78 | } string_value;
|
---|
79 | const struct bithenge_random_access_blob_ops_t *blob_ops;
|
---|
80 | };
|
---|
81 | } bithenge_node_t;
|
---|
82 |
|
---|
83 | /** A callback function used to iterate over a node's children. It takes
|
---|
84 | * ownership of a reference to both the key and the value.
|
---|
85 | * @memberof bithenge_node_t
|
---|
86 | * @param key The key.
|
---|
87 | * @param value The value.
|
---|
88 | * @param data Data provided to @a bithenge_node_t::bithenge_node_for_each.
|
---|
89 | * @return EOK on success or an error code from errno.h. */
|
---|
90 | typedef int (*bithenge_for_each_func_t)(bithenge_node_t *key, bithenge_node_t *value, void *data);
|
---|
91 |
|
---|
92 | /** Operations providing access to an internal node. */
|
---|
93 | typedef struct bithenge_internal_node_ops_t {
|
---|
94 | /** @copydoc bithenge_node_t::bithenge_node_for_each */
|
---|
95 | int (*for_each)(bithenge_node_t *self, bithenge_for_each_func_t func, void *data);
|
---|
96 | /** Destroys the internal node.
|
---|
97 | * @param self The node to destroy. */
|
---|
98 | void (*destroy)(bithenge_node_t *self);
|
---|
99 | } bithenge_internal_node_ops_t;
|
---|
100 |
|
---|
101 | /** Find the type of a node.
|
---|
102 | * @memberof bithenge_node_t
|
---|
103 | * @param node The node.
|
---|
104 | * @return The type of the node. */
|
---|
105 | static inline bithenge_node_type_t bithenge_node_type(const bithenge_node_t *node)
|
---|
106 | {
|
---|
107 | return node->type;
|
---|
108 | }
|
---|
109 |
|
---|
110 | /** Increment a node's reference count.
|
---|
111 | * @memberof bithenge_node_t
|
---|
112 | * @param node The node to reference. */
|
---|
113 | static inline void bithenge_node_inc_ref(bithenge_node_t *node)
|
---|
114 | {
|
---|
115 | assert(node);
|
---|
116 | node->refs++;
|
---|
117 | }
|
---|
118 |
|
---|
119 | void bithenge_node_dec_ref(bithenge_node_t *node);
|
---|
120 |
|
---|
121 | /** Iterate over a node's children.
|
---|
122 | * @memberof bithenge_node_t
|
---|
123 | * @param self The internal node to iterate over.
|
---|
124 | * @param func The callback function.
|
---|
125 | * @param data Data to provide to the callback function.
|
---|
126 | * @return EOK on success or an error code from errno.h. */
|
---|
127 | static inline int bithenge_node_for_each(bithenge_node_t *self,
|
---|
128 | bithenge_for_each_func_t func, void *data)
|
---|
129 | {
|
---|
130 | assert(self->type == BITHENGE_NODE_INTERNAL);
|
---|
131 | return self->internal_ops->for_each(self, func, data);
|
---|
132 | }
|
---|
133 |
|
---|
134 | /** Get the value of a boolean node.
|
---|
135 | * @memberof bithenge_node_t
|
---|
136 | * @param self The boolean node.
|
---|
137 | * @return The node's value. */
|
---|
138 | static inline bool bithenge_boolean_node_value(bithenge_node_t *self)
|
---|
139 | {
|
---|
140 | assert(self->type == BITHENGE_NODE_BOOLEAN);
|
---|
141 | return self->boolean_value;
|
---|
142 | }
|
---|
143 |
|
---|
144 | /** Get the value of an integer node.
|
---|
145 | * @memberof bithenge_node_t
|
---|
146 | * @param self The integer node.
|
---|
147 | * @return The node's value. */
|
---|
148 | static inline bithenge_int_t bithenge_integer_node_value(bithenge_node_t *self)
|
---|
149 | {
|
---|
150 | assert(self->type == BITHENGE_NODE_INTEGER);
|
---|
151 | return self->integer_value;
|
---|
152 | }
|
---|
153 |
|
---|
154 | /** Get the value of an string node.
|
---|
155 | * @memberof bithenge_node_t
|
---|
156 | * @param self The string node.
|
---|
157 | * @return The node's value. */
|
---|
158 | static inline const char *bithenge_string_node_value(bithenge_node_t *self)
|
---|
159 | {
|
---|
160 | assert(self->type == BITHENGE_NODE_STRING);
|
---|
161 | return self->string_value.ptr;
|
---|
162 | }
|
---|
163 |
|
---|
164 | int bithenge_init_internal_node(bithenge_node_t *,
|
---|
165 | const bithenge_internal_node_ops_t *);
|
---|
166 | int bithenge_new_simple_internal_node(bithenge_node_t **, bithenge_node_t **,
|
---|
167 | bithenge_int_t, bool needs_free);
|
---|
168 | int bithenge_new_boolean_node(bithenge_node_t **, bool);
|
---|
169 | int bithenge_new_integer_node(bithenge_node_t **, bithenge_int_t);
|
---|
170 | int bithenge_new_string_node(bithenge_node_t **, const char *, bool);
|
---|
171 | bool bithenge_node_equal(bithenge_node_t *, bithenge_node_t *);
|
---|
172 |
|
---|
173 | #endif
|
---|
174 |
|
---|
175 | /** @}
|
---|
176 | */
|
---|