source: mainline/uspace/app/bithenge/tree.h@ 8b36bf2

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 8b36bf2 was 8375d0eb, checked in by Sean Bartell <wingedtachikoma@…>, 13 years ago

Bithenge: add Doxygen comments

  • Property mode set to 100644
File size: 5.2 KB
Line 
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 <bool.h>
42#include <inttypes.h>
43#include <sys/types.h>
44
45#ifdef INTMAX_MAX
46typedef intmax_t bithenge_int_t;
47#define BITHENGE_PRId PRIdMAX
48#else
49typedef int64_t bithenge_int_t;
50#define BITHENGE_PRId PRId64
51#endif
52
53/** Indicates the type of a tree node. */
54typedef 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
67typedef struct bithenge_node_t {
68 /** @privatesection */
69 bithenge_node_type_t type;
70 union {
71 const struct bithenge_internal_node_ops_t *internal_ops;
72 bool boolean_value;
73 bithenge_int_t integer_value;
74 struct {
75 const char *ptr;
76 bool needs_free;
77 } string_value;
78 const struct bithenge_random_access_blob_ops_t *blob_ops;
79 };
80} bithenge_node_t;
81
82/** A callback function used to iterate over a node's children.
83 * @memberof bithenge_node_t
84 * @param key The key.
85 * @param value The value.
86 * @param data Data provided to @a bithenge_node_t::bithenge_node_for_each.
87 * @return EOK on success or an error code from errno.h. */
88typedef int (*bithenge_for_each_func_t)(bithenge_node_t *key, bithenge_node_t *value, void *data);
89
90/** Operations providing access to an internal node. */
91typedef struct bithenge_internal_node_ops_t {
92 /** @copydoc bithenge_node_t::bithenge_node_for_each */
93 int (*for_each)(bithenge_node_t *node, bithenge_for_each_func_t func, void *data);
94 /** @copydoc bithenge_node_t::bithenge_node_destroy */
95 int (*destroy)(bithenge_node_t *node);
96} bithenge_internal_node_ops_t;
97
98/** Find the type of a node.
99 * @memberof bithenge_node_t
100 * @param node The node.
101 * @return The type of the node. */
102static inline bithenge_node_type_t bithenge_node_type(const bithenge_node_t *node)
103{
104 return node->type;
105}
106
107/** Iterate over a node's children.
108 * @memberof bithenge_node_t
109 * @param node The internal node to iterate over.
110 * @param func The callback function.
111 * @param data Data to provide to the callback function.
112 * @return EOK on success or an error code from errno.h. */
113static inline int bithenge_node_for_each(bithenge_node_t *node, bithenge_for_each_func_t func, void *data)
114{
115 assert(node->type == BITHENGE_NODE_INTERNAL);
116 return node->internal_ops->for_each(node, func, data);
117}
118
119/** Get the value of a boolean node.
120 * @memberof bithenge_node_t
121 * @param node The boolean node.
122 * @return The node's value. */
123static inline bool bithenge_boolean_node_value(bithenge_node_t *node)
124{
125 assert(node->type == BITHENGE_NODE_BOOLEAN);
126 return node->boolean_value;
127}
128
129/** Get the value of an integer node.
130 * @memberof bithenge_node_t
131 * @param node The integer node.
132 * @return The node's value. */
133static inline bithenge_int_t bithenge_integer_node_value(bithenge_node_t *node)
134{
135 assert(node->type == BITHENGE_NODE_INTEGER);
136 return node->integer_value;
137}
138
139/** Get the value of an string node.
140 * @memberof bithenge_node_t
141 * @param node The string node.
142 * @return The node's value. */
143static inline const char *bithenge_string_node_value(bithenge_node_t *node)
144{
145 assert(node->type == BITHENGE_NODE_STRING);
146 return node->string_value.ptr;
147}
148
149int bithenge_new_simple_internal_node(bithenge_node_t **, bithenge_node_t **,
150 bithenge_int_t, bool needs_free);
151int bithenge_new_boolean_node(bithenge_node_t **, bool);
152int bithenge_new_integer_node(bithenge_node_t **, bithenge_int_t);
153int bithenge_new_string_node(bithenge_node_t **, const char *, bool);
154int bithenge_node_destroy(bithenge_node_t *);
155
156#endif
157
158/** @}
159 */
Note: See TracBrowser for help on using the repository browser.