2 This file is part of GNUnet.
3 Copyright (C) 2010 GNUnet e.V.
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 3, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
18 Boston, MA 02110-1301, USA.
23 * @brief library for data block manipulation
24 * @author Christian Grothoff
27 #include "gnunet_util_lib.h"
28 #include "gnunet_constants.h"
29 #include "gnunet_signatures.h"
30 #include "gnunet_block_lib.h"
31 #include "gnunet_block_plugin.h"
35 * Handle for a plugin.
40 * Name of the shared library.
47 struct GNUNET_BLOCK_PluginFunctions *api;
52 * Handle to an initialized block library.
54 struct GNUNET_BLOCK_Context
57 * Array of our plugins.
59 struct Plugin **plugins;
62 * Size of the 'plugins' array.
64 unsigned int num_plugins;
69 const struct GNUNET_CONFIGURATION_Handle *cfg;
74 * Mingle hash with the mingle_number to produce different bits.
76 * @param in original hash code
77 * @param mingle_number number for hash permutation
78 * @param hc where to store the result.
81 GNUNET_BLOCK_mingle_hash (const struct GNUNET_HashCode *in,
82 uint32_t mingle_number,
83 struct GNUNET_HashCode *hc)
85 struct GNUNET_HashCode m;
87 GNUNET_CRYPTO_hash (&mingle_number, sizeof (uint32_t), &m);
88 GNUNET_CRYPTO_hash_xor (&m, in, hc);
93 * Add a plugin to the list managed by the block library.
95 * @param cls the block context
96 * @param library_name name of the plugin
97 * @param lib_ret the plugin API
100 add_plugin (void *cls,
101 const char *library_name,
104 struct GNUNET_BLOCK_Context *ctx = cls;
105 struct GNUNET_BLOCK_PluginFunctions *api = lib_ret;
106 struct Plugin *plugin;
108 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
109 "Loading block plugin `%s'\n",
111 plugin = GNUNET_new (struct Plugin);
113 plugin->library_name = GNUNET_strdup (library_name);
114 GNUNET_array_append (ctx->plugins, ctx->num_plugins, plugin);
120 * Create a block context. Loads the block plugins.
122 * @param cfg configuration to use
123 * @return NULL on error
125 struct GNUNET_BLOCK_Context *
126 GNUNET_BLOCK_context_create (const struct GNUNET_CONFIGURATION_Handle *cfg)
128 struct GNUNET_BLOCK_Context *ctx;
130 ctx = GNUNET_new (struct GNUNET_BLOCK_Context);
132 GNUNET_PLUGIN_load_all ("libgnunet_plugin_block_", NULL, &add_plugin, ctx);
138 * Destroy the block context.
140 * @param ctx context to destroy
143 GNUNET_BLOCK_context_destroy (struct GNUNET_BLOCK_Context *ctx)
146 struct Plugin *plugin;
148 for (i = 0; i < ctx->num_plugins; i++)
150 plugin = ctx->plugins[i];
151 GNUNET_break (NULL ==
152 GNUNET_PLUGIN_unload (plugin->library_name, plugin->api));
153 GNUNET_free (plugin->library_name);
154 GNUNET_free (plugin);
156 GNUNET_free (ctx->plugins);
162 * Find a plugin for the given type.
164 * @param ctx context to search
165 * @param type type to look for
166 * @return NULL if no matching plugin exists
168 static struct GNUNET_BLOCK_PluginFunctions *
169 find_plugin (struct GNUNET_BLOCK_Context *ctx,
170 enum GNUNET_BLOCK_Type type)
172 struct Plugin *plugin;
176 for (i = 0; i < ctx->num_plugins; i++)
178 plugin = ctx->plugins[i];
180 while (0 != (plugin->api->types[j]))
182 if (type == plugin->api->types[j])
192 * Function called to validate a reply or a request. For
193 * request evaluation, simply pass "NULL" for the reply_block.
194 * Note that it is assumed that the reply has already been
195 * matched to the key (and signatures checked) as it would
196 * be done with the "get_key" function.
198 * @param ctx block contxt
199 * @param type block type
200 * @param eo control flags
201 * @param query original query (hash)
202 * @param bf pointer to bloom filter associated with query; possibly updated (!)
203 * @param bf_mutator mutation value for @a bf
204 * @param xquery extended query data (can be NULL, depending on type)
205 * @param xquery_size number of bytes in @a xquery
206 * @param reply_block response to validate
207 * @param reply_block_size number of bytes in @a reply_block
208 * @return characterization of result
210 enum GNUNET_BLOCK_EvaluationResult
211 GNUNET_BLOCK_evaluate (struct GNUNET_BLOCK_Context *ctx,
212 enum GNUNET_BLOCK_Type type,
213 enum GNUNET_BLOCK_EvaluationOptions eo,
214 const struct GNUNET_HashCode *query,
215 struct GNUNET_CONTAINER_BloomFilter **bf,
219 const void *reply_block,
220 size_t reply_block_size)
222 struct GNUNET_BLOCK_PluginFunctions *plugin = find_plugin (ctx, type);
225 return GNUNET_BLOCK_EVALUATION_TYPE_NOT_SUPPORTED;
226 return plugin->evaluate (plugin->cls,
240 * Function called to obtain the key for a block.
242 * @param ctx block context
243 * @param type block type
244 * @param block block to get the key for
245 * @param block_size number of bytes in @a block
246 * @param key set to the key (query) for the given block
247 * @return #GNUNET_OK on success, #GNUNET_SYSERR if type not supported
248 * (or if extracting a key from a block of this type does not work)
251 GNUNET_BLOCK_get_key (struct GNUNET_BLOCK_Context *ctx,
252 enum GNUNET_BLOCK_Type type,
255 struct GNUNET_HashCode *key)
257 struct GNUNET_BLOCK_PluginFunctions *plugin = find_plugin (ctx, type);
260 return GNUNET_BLOCK_EVALUATION_TYPE_NOT_SUPPORTED;
261 return plugin->get_key (plugin->cls, type, block, block_size, key);
266 * How many bytes should a bloomfilter be if we have already seen
267 * entry_count responses? Note that #GNUNET_CONSTANTS_BLOOMFILTER_K
268 * gives us the number of bits set per entry. Furthermore, we should
269 * not re-size the filter too often (to keep it cheap).
271 * Since other peers will also add entries but not resize the filter,
272 * we should generally pick a slightly larger size than what the
273 * strict math would suggest.
275 * @param entry_count expected number of entries in the Bloom filter
276 * @return must be a power of two and smaller or equal to 2^15.
279 compute_bloomfilter_size (unsigned int entry_count)
282 unsigned int ideal = (entry_count * GNUNET_CONSTANTS_BLOOMFILTER_K) / 4;
283 uint16_t max = 1 << 15;
285 if (entry_count > max)
288 while ((size < max) && (size < ideal))
297 * Construct a bloom filter that would filter out the given
300 * @param bf_mutator mutation value to use
301 * @param seen_results results already seen
302 * @param seen_results_count number of entries in @a seen_results
303 * @return NULL if seen_results_count is 0, otherwise a BF
304 * that would match the given results.
306 struct GNUNET_CONTAINER_BloomFilter *
307 GNUNET_BLOCK_construct_bloomfilter (int32_t bf_mutator,
308 const struct GNUNET_HashCode *seen_results,
309 unsigned int seen_results_count)
311 struct GNUNET_CONTAINER_BloomFilter *bf;
312 struct GNUNET_HashCode mhash;
316 nsize = compute_bloomfilter_size (seen_results_count);
317 bf = GNUNET_CONTAINER_bloomfilter_init (NULL, nsize,
318 GNUNET_CONSTANTS_BLOOMFILTER_K);
319 for (i = 0; i < seen_results_count; i++)
321 GNUNET_BLOCK_mingle_hash (&seen_results[i], bf_mutator, &mhash);
322 GNUNET_CONTAINER_bloomfilter_add (bf, &mhash);