2 This file is part of GNUnet.
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.
22 * @file rps/gnunet-service-rps_view.c
23 * @brief wrapper around the "local view"
24 * @author Julius Bünger
27 #include "gnunet_util_lib.h"
28 #include "gnunet-service-rps_view.h"
33 * Array containing the peers
35 static struct GNUNET_PeerIdentity *array;
38 * (Maximum) length of the view
40 static uint32_t length;
43 * Multipeermap containing the peers
45 static struct GNUNET_CONTAINER_MultiPeerMap *mpm;
49 * Create an empty view.
51 * @param len the maximum length for the view
54 View_create (uint32_t len)
57 array = GNUNET_new_array (len, struct GNUNET_PeerIdentity);
58 mpm = GNUNET_CONTAINER_multipeermap_create (len, GNUNET_NO); /* might even be
63 * Change length of view
65 * If size is decreased, peers with higher indices are removed.
67 * @param len the (maximum) length for the view
70 View_change_len (uint32_t len)
75 if (GNUNET_CONTAINER_multipeermap_size (mpm) < len)
77 /* We might simply clear and free the left over space */
78 GNUNET_array_grow (array, length, len);
80 else /* We have to remove elements */
82 /* TODO find a way to preserve indices */
83 for (i = 0; i < len; i++)
85 index = GNUNET_CONTAINER_multipeermap_get (mpm, &array[i]);
86 GNUNET_assert (NULL != index);
89 GNUNET_array_grow (array, length, len);
90 GNUNET_CONTAINER_multipeermap_destroy (mpm);
91 mpm = GNUNET_CONTAINER_multipeermap_create (len, GNUNET_NO);
92 for (i = 0; i < len; i++)
94 index = GNUNET_new (uint32_t);
96 GNUNET_CONTAINER_multipeermap_put (mpm, &array[i], index,
97 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST);
100 GNUNET_assert (length == len);
104 * Get the view as an array
106 * @return the view in array representation
108 const struct GNUNET_PeerIdentity *
115 * Get the size of the view
117 * @return current number of actually contained peers
122 return GNUNET_CONTAINER_multipeermap_size (mpm);
126 * Insert peer into the view
128 * @param peer the peer to insert
130 * @return GNUNET_OK if peer was actually inserted
131 * GNUNET_NO if peer was not inserted
134 View_put (const struct GNUNET_PeerIdentity *peer)
138 if ((length <= View_size ()) || /* If array is 'full' */
139 (GNUNET_YES == View_contains_peer (peer)))
145 index = GNUNET_new (uint32_t);
146 *index = (uint32_t) View_size ();
147 array[*index] = *peer;
148 GNUNET_CONTAINER_multipeermap_put (mpm, peer, index,
149 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST);
155 * Check whether view contains a peer
157 * @param peer the peer to check for
159 * @return GNUNET_OK if view contains peer
160 * GNUNET_NO otherwise
163 View_contains_peer (const struct GNUNET_PeerIdentity *peer)
165 return GNUNET_CONTAINER_multipeermap_contains (mpm, peer);
169 * Remove peer from view
171 * @param peer the peer to remove
173 * @return GNUNET_OK if view contained peer and removed it successfully
174 * GNUNET_NO if view does not contain peer
177 View_remove_peer (const struct GNUNET_PeerIdentity *peer)
180 uint32_t *index_swap;
182 if (GNUNET_NO == View_contains_peer (peer))
186 index = GNUNET_CONTAINER_multipeermap_get (mpm, peer);
187 GNUNET_assert (NULL != index);
188 if (*index < (View_size () - 1) )
189 { /* Fill the 'gap' in the array with the last peer */
190 array[*index] = array[(View_size () - 1)];
191 index_swap = GNUNET_CONTAINER_multipeermap_get (mpm, &array[View_size ()]);
192 *index_swap = *index;
195 GNUNET_CONTAINER_multipeermap_remove_all (mpm, peer);
200 * Get a peer by index
202 * @param index the index of the peer to get
204 * @return peer to the corresponding index.
205 * NULL if this index is not known
207 const struct GNUNET_PeerIdentity *
208 View_get_peer_by_index (uint32_t index)
210 if (index < GNUNET_CONTAINER_multipeermap_size (mpm))
212 return &array[index];
221 * Clear the custom peer map
223 * @param c_peer_map the custom peer map to look in
225 * @return size of the map
233 for (i = 0; 0 < View_size (); i++)
234 { /* Need to free indices stored at peers */
235 GNUNET_assert (GNUNET_YES ==
236 GNUNET_CONTAINER_multipeermap_contains (mpm, &array[i]));
237 index = GNUNET_CONTAINER_multipeermap_get (mpm, &array[i]);
238 GNUNET_assert (NULL != index);
240 GNUNET_CONTAINER_multipeermap_remove_all (mpm, &array[i]);
242 GNUNET_assert (0 == View_size ());
248 * @param c_peer_map the map to destroy
255 GNUNET_CONTAINER_multipeermap_destroy (mpm);
258 /* end of gnunet-service-rps_view.c */