2 This file is part of GNUnet.
3 (C) 2011 Christian Grothoff (and other contributing authors)
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., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
22 * @file fs/gnunet-service-fs_pe.c
23 * @brief API to manage query plan
24 * @author Christian Grothoff
27 #include "gnunet-service-fs.h"
28 #include "gnunet-service-fs_cp.h"
29 #include "gnunet-service-fs_pe.h"
30 #include "gnunet-service-fs_pr.h"
34 * Information we keep per request per peer. This is a doubly-linked
35 * list (with head and tail in the 'struct GSF_PendingRequestData')
36 * with one entry in each heap of each 'struct PeerPlan'. Each
37 * entry tracks information relevant for this request and this peer.
39 struct GSF_RequestPlan
43 * This is a doubly-linked list.
45 struct GSF_RequestPlan *next;
48 * This is a doubly-linked list.
50 struct GSF_RequestPlan *prev;
53 * Heap node associated with this request and this peer.
55 struct GNUNET_CONTAINER_HeapNode *hn;
58 * Array of associated pending requests.
60 struct GSF_PendingRequest **prs;
63 * Earliest time we'd be happy to (re)transmit this request.
65 struct GNUNET_TIME_Absolute earliest_transmission;
68 * When was the last time we transmitted this request to this peer? 0 for never.
70 struct GNUNET_TIME_Absolute last_transmission;
73 * Number of entries in 'prs'.
75 unsigned int prs_length;
78 * Current priority for this request for this target.
83 * How often did we transmit this request to this peer?
85 unsigned int transmission_counter;
91 * Transmission plan for a peer.
96 * Heap with pending queries (struct GSF_RequestPlan), higher weights mean higher priority.
98 struct GNUNET_CONTAINER_Heap *priority_heap;
101 * Heap with pending queries (struct GSF_RequestPlan), by transmission time, lowest first.
103 struct GNUNET_CONTAINER_Heap *delay_heap;
106 * Current transmission request handle.
108 struct GSF_PeerTransmitHandle *pth;
111 * Peer for which this is the plan.
113 struct GSF_ConnectedPeer *cp;
116 * Current task for executing the plan.
118 GNUNET_SCHEDULER_TaskIdentifier task;
123 * Hash map from peer identities to PeerPlans.
125 static struct GNUNET_CONTAINER_MultiHashMap *plans;
128 * Sum of all transmission counters (equals total delay for all plan entries).
130 static unsigned long long total_delay;
133 * Number of plan entries.
135 static unsigned long long plan_count;
139 * Figure out when and how to transmit to the given peer.
141 * @param cls the 'struct GSF_ConnectedPeer' for transmission
142 * @param tc scheduler context
145 schedule_peer_transmission (void *cls,
146 const struct GNUNET_SCHEDULER_TaskContext *tc);
150 * Insert the given request plan into the heap with the appropriate weight.
152 * @param pp associated peer's plan
153 * @param rp request to plan
156 plan (struct PeerPlan *pp,
157 struct GSF_RequestPlan *rp)
159 struct GSF_PendingRequestData *prd;
160 struct GNUNET_TIME_Relative delay;
162 GNUNET_STATISTICS_set (GSF_stats,
163 gettext_noop ("# average retransmission delay (ms)"),
164 total_delay * 1000LL / plan_count,
166 prd = GSF_pending_request_get_data_ (rp->prs[0]);
167 // FIXME: calculate 'rp->priority'!
168 if (rp->transmission_counter < 32)
169 delay = GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
170 1LL << rp->transmission_counter);
172 delay = GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
174 rp->earliest_transmission
175 = GNUNET_TIME_relative_to_absolute (delay);
177 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
178 "Earliest (re)transmission for `%s' in %us\n",
179 GNUNET_h2s (&prd->query),
180 rp->transmission_counter);
183 GNUNET_assert (rp->hn == NULL);
184 if (GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission).rel_value == 0)
185 rp->hn = GNUNET_CONTAINER_heap_insert (pp->priority_heap,
189 rp->hn = GNUNET_CONTAINER_heap_insert (pp->delay_heap,
191 rp->earliest_transmission.abs_value);
192 if (GNUNET_SCHEDULER_NO_TASK != pp->task)
193 GNUNET_SCHEDULER_cancel (pp->task);
194 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
199 * Function called to get a message for transmission.
202 * @param buf_size number of bytes available in buf
203 * @param buf where to copy the message, NULL on error (peer disconnect)
204 * @return number of bytes copied to 'buf', can be 0 (without indicating an error)
207 transmit_message_callback (void *cls,
211 struct PeerPlan *pp = cls;
212 struct GSF_RequestPlan *rp;
218 /* failed, try again... */
219 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
222 rp = GNUNET_CONTAINER_heap_peek (pp->priority_heap);
225 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
228 msize = GSF_pending_request_get_message_ (rp->prs[0], buf_size, buf);
229 if (msize > buf_size)
231 /* buffer to small (message changed), try again */
232 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
235 /* remove from root, add again elsewhere... */
236 GNUNET_assert (rp == GNUNET_CONTAINER_heap_remove_root (pp->priority_heap));
238 rp->last_transmission = GNUNET_TIME_absolute_get ();
239 rp->transmission_counter++;
242 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
243 "Executing plan %p executed %u times, planning retransmission\n",
245 rp->transmission_counter);
248 GNUNET_STATISTICS_update (GSF_stats,
249 gettext_noop ("# queries messages sent to other peers"),
257 * Figure out when and how to transmit to the given peer.
259 * @param cls the 'struct PeerPlan'
260 * @param tc scheduler context
263 schedule_peer_transmission (void *cls,
264 const struct GNUNET_SCHEDULER_TaskContext *tc)
266 struct PeerPlan *pp = cls;
267 struct GSF_RequestPlan *rp;
270 pp->task = GNUNET_SCHEDULER_NO_TASK;
273 GSF_peer_transmit_cancel_ (pp->pth);
276 /* move ready requests to priority queue */
277 while ( (NULL != (rp = GNUNET_CONTAINER_heap_peek (pp->delay_heap))) &&
278 (GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission).rel_value == 0) )
280 GNUNET_assert (rp == GNUNET_CONTAINER_heap_remove_root (pp->delay_heap));
281 rp->hn = GNUNET_CONTAINER_heap_insert (pp->priority_heap,
285 if (0 == GNUNET_CONTAINER_heap_get_size (pp->priority_heap))
287 /* priority heap (still) empty, check for delay... */
288 rp = GNUNET_CONTAINER_heap_peek (pp->delay_heap);
292 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
293 "No active requests for plan %p.\n",
296 return; /* both queues empty */
299 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
300 "Sleeping for %llu ms before retrying requests on plan %p.\n",
301 (unsigned long long) GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission).rel_value,
304 pp->task = GNUNET_SCHEDULER_add_delayed (GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission),
305 &schedule_peer_transmission,
309 /* process from priority heap */
310 rp = GNUNET_CONTAINER_heap_peek (pp->priority_heap);
312 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
313 "Executing query plan %p\n",
316 GNUNET_assert (NULL != rp);
317 msize = GSF_pending_request_get_message_ (rp->prs[0], 0, NULL);
318 pp->pth = GSF_peer_transmit_ (pp->cp,
321 GNUNET_TIME_UNIT_FOREVER_REL,
323 &transmit_message_callback,
325 GNUNET_assert (NULL != pp->pth);
330 * Create a new query plan entry.
332 * @param cp peer with the entry
333 * @param pr request with the entry
336 GSF_plan_add_ (struct GSF_ConnectedPeer *cp,
337 struct GSF_PendingRequest *pr)
339 struct GNUNET_PeerIdentity id;
341 struct GSF_PendingRequestData *prd;
342 struct GSF_RequestPlan *rp;
346 GNUNET_assert (NULL != cp);
347 GSF_connected_peer_get_identity_ (cp, &id);
348 pp = GNUNET_CONTAINER_multihashmap_get (plans,
352 pp = GNUNET_malloc (sizeof (struct PeerPlan));
353 pp->priority_heap = GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MAX);
354 pp->delay_heap = GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MIN);
356 GNUNET_CONTAINER_multihashmap_put (plans,
359 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
361 msize = GSF_pending_request_get_message_ (pr, 0, NULL);
362 prd = GSF_pending_request_get_data_ (pr);
363 for (rp = prd->rp_head; NULL != rp; rp = rp->next)
368 GNUNET_assert (msize == GSF_pending_request_get_message_ (pr, msize, mbuf));
369 if ( (msize == GSF_pending_request_get_message_ (rp->prs[0], msize, xbuf)) &&
370 (0 == memcmp (xbuf, mbuf, msize)) )
372 /* add request to existing plan */
373 GNUNET_array_append (rp->prs,
376 for (i=0;i<rp->prs_length;i++)
377 if (GSF_pending_request_get_data_ (rp->prs[0])->ttl.abs_value < prd->ttl.abs_value)
379 GNUNET_STATISTICS_update (GSF_stats,
380 gettext_noop ("# requests refreshed"),
383 rp->transmission_counter = 0; /* reset */
390 GNUNET_STATISTICS_update (GSF_stats,
391 gettext_noop ("# query plan entries"),
394 rp = GNUNET_malloc (sizeof (struct GSF_RequestPlan));
396 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
397 "Planning transmission of query `%s' to peer `%s' (%p)\n",
398 GNUNET_h2s (&prd->query),
402 GNUNET_array_append (rp->prs,
405 GNUNET_CONTAINER_DLL_insert (prd->rp_head,
413 * Notify the plan about a peer being no longer available;
414 * destroy all entries associated with this peer.
416 * @param cp connected peer
419 GSF_plan_notify_peer_disconnect_ (const struct GSF_ConnectedPeer *cp)
421 struct GNUNET_PeerIdentity id;
423 struct GSF_RequestPlan *rp;
424 struct GSF_PendingRequestData *prd;
427 GSF_connected_peer_get_identity_ (cp, &id);
428 pp = GNUNET_CONTAINER_multihashmap_get (plans,
431 return; /* nothing was ever planned for this peer */
432 GNUNET_assert (GNUNET_YES ==
433 GNUNET_CONTAINER_multihashmap_remove (plans,
437 GSF_peer_transmit_cancel_ (pp->pth);
438 if (GNUNET_SCHEDULER_NO_TASK != pp->task)
440 GNUNET_SCHEDULER_cancel (pp->task);
441 pp->task = GNUNET_SCHEDULER_NO_TASK;
443 while (NULL != (rp = GNUNET_CONTAINER_heap_remove_root (pp->priority_heap)))
445 for (i=0;i<rp->prs_length;i++)
447 prd = GSF_pending_request_get_data_ (rp->prs[i]);
448 GNUNET_CONTAINER_DLL_remove (prd->rp_head,
453 GNUNET_array_grow (rp->prs, rp->prs_length, 0);
456 GNUNET_CONTAINER_heap_destroy (pp->priority_heap);
457 while (NULL != (rp = GNUNET_CONTAINER_heap_remove_root (pp->delay_heap)))
459 for (i=0;i<rp->prs_length;i++)
461 prd = GSF_pending_request_get_data_ (rp->prs[i]);
462 GNUNET_CONTAINER_DLL_remove (prd->rp_head,
467 GNUNET_array_grow (rp->prs, rp->prs_length, 0);
470 GNUNET_STATISTICS_set (GSF_stats,
471 gettext_noop ("# query plan entries"),
475 GNUNET_CONTAINER_heap_destroy (pp->delay_heap);
481 * Notify the plan about a request being done; destroy all entries
482 * associated with this request.
484 * @param pr request that is done
487 GSF_plan_notify_request_done_ (struct GSF_PendingRequest *pr)
489 struct GSF_RequestPlan *rp;
490 struct GSF_PendingRequestData *prd;
493 prd = GSF_pending_request_get_data_ (pr);
494 while (NULL != (rp = prd->rp_head))
496 for (i=0;i<rp->prs_length;i++)
498 if (rp->prs[i] == pr)
500 rp->prs[i] = rp->prs[rp->prs_length - 1];
501 GNUNET_array_grow (rp->prs, rp->prs_length, rp->prs_length-1);
502 if (rp->prs_length == 0)
504 GNUNET_CONTAINER_heap_remove_node (rp->hn);
505 GNUNET_CONTAINER_DLL_remove (prd->rp_head,
515 GNUNET_STATISTICS_set (GSF_stats,
516 gettext_noop ("# query plan entries"),
523 * Initialize plan subsystem.
528 plans = GNUNET_CONTAINER_multihashmap_create (256);
533 * Shutdown plan subsystem.
539 GNUNET_CONTAINER_multihashmap_size (plans));
540 GNUNET_CONTAINER_multihashmap_destroy (plans);
545 /* end of gnunet-service-fs_pe.h */