2 This file is part of GNUnet.
5 GNUnet is free software: you can redistribute it and/or modify it
6 under the terms of the GNU Affero General Public License as published
7 by the Free Software Foundation, either version 3 of the License,
8 or (at your 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 Affero General Public License for more details.
15 You should have received a copy of the GNU Affero General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * @file rps/gnunet-service-rps_view.c
21 * @brief wrapper around the "local view"
22 * @author Julius Bünger
25 #include "gnunet_util_lib.h"
26 #include "gnunet-service-rps_view.h"
31 * Array containing the peers
33 static struct GNUNET_PeerIdentity *array;
36 * (Maximum) length of the view
38 static uint32_t length;
41 * Multipeermap containing the peers
43 static struct GNUNET_CONTAINER_MultiPeerMap *mpm;
47 * Create an empty view.
49 * @param len the maximum length for the view
52 View_create (uint32_t len)
55 array = GNUNET_new_array (len, struct GNUNET_PeerIdentity);
56 mpm = GNUNET_CONTAINER_multipeermap_create (len, GNUNET_NO); /* might even be
61 * Change length of view
63 * If size is decreased, peers with higher indices are removed.
65 * @param len the (maximum) length for the view
68 View_change_len (uint32_t len)
73 if (GNUNET_CONTAINER_multipeermap_size (mpm) < len)
75 /* We might simply clear and free the left over space */
76 GNUNET_array_grow (array, length, len);
78 else /* We have to remove elements */
80 /* TODO find a way to preserve indices */
81 for (i = 0; i < len; i++)
83 index = GNUNET_CONTAINER_multipeermap_get (mpm, &array[i]);
84 GNUNET_assert (NULL != index);
87 GNUNET_array_grow (array, length, len);
88 GNUNET_CONTAINER_multipeermap_destroy (mpm);
89 mpm = GNUNET_CONTAINER_multipeermap_create (len, GNUNET_NO);
90 for (i = 0; i < len; i++)
92 index = GNUNET_new (uint32_t);
94 GNUNET_CONTAINER_multipeermap_put (mpm, &array[i], index,
95 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST);
98 GNUNET_assert (length == len);
102 * Get the view as an array
104 * @return the view in array representation
106 const struct GNUNET_PeerIdentity *
113 * Get the size of the view
115 * @return current number of actually contained peers
120 return GNUNET_CONTAINER_multipeermap_size (mpm);
124 * Insert peer into the view
126 * @param peer the peer to insert
128 * @return GNUNET_OK if peer was actually inserted
129 * GNUNET_NO if peer was not inserted
132 View_put (const struct GNUNET_PeerIdentity *peer)
136 if ((length <= View_size ()) || /* If array is 'full' */
137 (GNUNET_YES == View_contains_peer (peer)))
143 index = GNUNET_new (uint32_t);
144 *index = (uint32_t) View_size ();
145 array[*index] = *peer;
146 GNUNET_CONTAINER_multipeermap_put (mpm, peer, index,
147 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST);
153 * Check whether view contains a peer
155 * @param peer the peer to check for
157 * @return GNUNET_OK if view contains peer
158 * GNUNET_NO otherwise
161 View_contains_peer (const struct GNUNET_PeerIdentity *peer)
163 return GNUNET_CONTAINER_multipeermap_contains (mpm, peer);
167 * Remove peer from view
169 * @param peer the peer to remove
171 * @return GNUNET_OK if view contained peer and removed it successfully
172 * GNUNET_NO if view does not contain peer
175 View_remove_peer (const struct GNUNET_PeerIdentity *peer)
178 uint32_t *swap_index;
181 if (GNUNET_NO == View_contains_peer (peer))
185 index = GNUNET_CONTAINER_multipeermap_get (mpm, peer);
186 GNUNET_assert (NULL != index);
187 last_index = View_size () - 1;
188 if (*index < last_index)
189 { /* Fill the 'gap' in the array with the last peer */
190 array[*index] = array[last_index];
191 GNUNET_assert (GNUNET_YES == View_contains_peer (&array[last_index]));
192 swap_index = GNUNET_CONTAINER_multipeermap_get (mpm, &array[last_index]);
193 GNUNET_assert (NULL != swap_index);
194 *swap_index = *index;
197 GNUNET_CONTAINER_multipeermap_remove_all (mpm, peer);
202 * Get a peer by index
204 * @param index the index of the peer to get
206 * @return peer to the corresponding index.
207 * NULL if this index is not known
209 const struct GNUNET_PeerIdentity *
210 View_get_peer_by_index (uint32_t index)
212 if (index < GNUNET_CONTAINER_multipeermap_size (mpm))
214 return &array[index];
223 * Clear the custom peer map
225 * @param c_peer_map the custom peer map to look in
227 * @return size of the map
235 for (i = 0; 0 < View_size (); i++)
236 { /* Need to free indices stored at peers */
237 GNUNET_assert (GNUNET_YES ==
238 GNUNET_CONTAINER_multipeermap_contains (mpm, &array[i]));
239 index = GNUNET_CONTAINER_multipeermap_get (mpm, &array[i]);
240 GNUNET_assert (NULL != index);
242 GNUNET_CONTAINER_multipeermap_remove_all (mpm, &array[i]);
244 GNUNET_assert (0 == View_size ());
250 * @param c_peer_map the map to destroy
257 GNUNET_CONTAINER_multipeermap_destroy (mpm);
260 /* end of gnunet-service-rps_view.c */