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 * List of GSF_PendingRequests this request plan
37 struct PendingRequestList;
40 * Transmission plan for a peer.
46 * DLL of request plans a particular pending request is
49 struct GSF_RequestPlanReference
53 * This is a doubly-linked list.
55 struct GSF_RequestPlanReference *next;
58 * This is a doubly-linked list.
60 struct GSF_RequestPlanReference *prev;
63 * Associated request plan.
65 struct GSF_RequestPlan *rp;
68 * Corresponding PendingRequestList.
70 struct PendingRequestList *prl;
75 * List of GSF_PendingRequests this request plan
78 struct PendingRequestList
82 * This is a doubly-linked list.
84 struct PendingRequestList *next;
87 * This is a doubly-linked list.
89 struct PendingRequestList *prev;
92 * Associated pending request.
94 struct GSF_PendingRequest *pr;
97 * Corresponding GSF_RequestPlanReference.
99 struct GSF_RequestPlanReference *rpr;
105 * Information we keep per request per peer. This is a doubly-linked
106 * list (with head and tail in the 'struct GSF_PendingRequestData')
107 * with one entry in each heap of each 'struct PeerPlan'. Each
108 * entry tracks information relevant for this request and this peer.
110 struct GSF_RequestPlan
114 * This is a doubly-linked list.
116 struct GSF_RequestPlan *next;
119 * This is a doubly-linked list.
121 struct GSF_RequestPlan *prev;
124 * Heap node associated with this request and this peer.
126 struct GNUNET_CONTAINER_HeapNode *hn;
129 * The transmission plan for a peer that this request is associated with.
134 * Head of list of associated pending requests.
136 struct PendingRequestList *prl_head;
139 * Tail of list of associated pending requests.
141 struct PendingRequestList *prl_tail;
144 * Earliest time we'd be happy to (re)transmit this request.
146 struct GNUNET_TIME_Absolute earliest_transmission;
149 * When was the last time we transmitted this request to this peer? 0 for never.
151 struct GNUNET_TIME_Absolute last_transmission;
154 * Current priority for this request for this target.
159 * How often did we transmit this request to this peer?
161 unsigned int transmission_counter;
167 * Transmission plan for a peer.
172 * Heap with pending queries (struct GSF_RequestPlan), higher weights mean higher priority.
174 struct GNUNET_CONTAINER_Heap *priority_heap;
177 * Heap with pending queries (struct GSF_RequestPlan), by transmission time, lowest first.
179 struct GNUNET_CONTAINER_Heap *delay_heap;
182 * Map of queries to plan entries. All entries in the priority_heap or delay_heap
183 * should be in the plan map. Note that it IS possible for the plan map to have
184 * multiple entries for the same query.
186 struct GNUNET_CONTAINER_MultiHashMap *plan_map;
189 * Current transmission request handle.
191 struct GSF_PeerTransmitHandle *pth;
194 * Peer for which this is the plan.
196 struct GSF_ConnectedPeer *cp;
199 * Current task for executing the plan.
201 GNUNET_SCHEDULER_TaskIdentifier task;
206 * Hash map from peer identities to PeerPlans.
208 static struct GNUNET_CONTAINER_MultiHashMap *plans;
211 * Sum of all transmission counters (equals total delay for all plan entries).
213 static unsigned long long total_delay;
216 * Number of plan entries.
218 static unsigned long long plan_count;
222 * Return the query (key in the plan_map) for the given request plan.
224 * @param rp a request plan
225 * @return the associated query
227 static const GNUNET_HashCode *
228 get_rp_key (struct GSF_RequestPlan *rp)
230 return &GSF_pending_request_get_data_ (rp->prl_head->pr)->query;
235 * Figure out when and how to transmit to the given peer.
237 * @param cls the 'struct GSF_ConnectedPeer' for transmission
238 * @param tc scheduler context
241 schedule_peer_transmission (void *cls,
242 const struct GNUNET_SCHEDULER_TaskContext *tc);
246 * Insert the given request plan into the heap with the appropriate weight.
248 * @param pp associated peer's plan
249 * @param rp request to plan
252 plan (struct PeerPlan *pp, struct GSF_RequestPlan *rp)
254 struct GSF_PendingRequestData *prd;
255 struct GNUNET_TIME_Relative delay;
257 GNUNET_assert (rp->pp == pp);
258 GNUNET_STATISTICS_set (GSF_stats,
259 gettext_noop ("# average retransmission delay (ms)"),
260 total_delay * 1000LL / plan_count, GNUNET_NO);
261 prd = GSF_pending_request_get_data_ (rp->prl_head->pr);
262 // FIXME: calculate 'rp->priority'!
263 if (rp->transmission_counter < 8)
265 GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
266 rp->transmission_counter);
267 else if (rp->transmission_counter < 32)
269 GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
270 8 + (1LL << (rp->transmission_counter - 8)));
272 delay = GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
274 delay.rel_value = GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
275 delay.rel_value + 1);
276 if (rp->transmission_counter != 0)
277 delay.rel_value += TTL_DECREMENT;
278 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
279 "Considering (re)transmission number %u in %llu ms\n",
280 (unsigned int) rp->transmission_counter,
281 (unsigned long long) delay.rel_value);
282 rp->earliest_transmission = GNUNET_TIME_relative_to_absolute (delay);
284 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
285 "Earliest (re)transmission for `%s' in %us\n",
286 GNUNET_h2s (&prd->query), rp->transmission_counter);
289 GNUNET_assert (rp->hn == NULL);
290 if (GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission).rel_value
292 rp->hn = GNUNET_CONTAINER_heap_insert (pp->priority_heap, rp, rp->priority);
295 GNUNET_CONTAINER_heap_insert (pp->delay_heap, rp,
296 rp->earliest_transmission.abs_value);
297 GNUNET_assert (GNUNET_YES ==
298 GNUNET_CONTAINER_multihashmap_contains_value (pp->plan_map,
301 if (GNUNET_SCHEDULER_NO_TASK != pp->task)
302 GNUNET_SCHEDULER_cancel (pp->task);
303 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
308 * Get the pending request with the highest TTL from the given plan.
310 * @param rp plan to investigate
311 * @return pending request with highest TTL
313 struct GSF_PendingRequest *
314 get_latest (const struct GSF_RequestPlan *rp)
316 struct GSF_PendingRequest *ret;
317 struct PendingRequestList *prl;
324 if (GSF_pending_request_get_data_ (prl->pr)->ttl.abs_value >
325 GSF_pending_request_get_data_ (ret)->ttl.abs_value)
334 * Function called to get a message for transmission.
337 * @param buf_size number of bytes available in buf
338 * @param buf where to copy the message, NULL on error (peer disconnect)
339 * @return number of bytes copied to 'buf', can be 0 (without indicating an error)
342 transmit_message_callback (void *cls, size_t buf_size, void *buf)
344 struct PeerPlan *pp = cls;
345 struct GSF_RequestPlan *rp;
351 /* failed, try again... */
352 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
353 GNUNET_STATISTICS_update (GSF_stats,
354 gettext_noop ("# transmission failed (core has no bandwidth)"), 1,
358 rp = GNUNET_CONTAINER_heap_peek (pp->priority_heap);
361 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
364 msize = GSF_pending_request_get_message_ (get_latest (rp), buf_size, buf);
365 if (msize > buf_size)
367 /* buffer to small (message changed), try again */
368 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
371 /* remove from root, add again elsewhere... */
372 GNUNET_assert (rp == GNUNET_CONTAINER_heap_remove_root (pp->priority_heap));
374 rp->last_transmission = GNUNET_TIME_absolute_get ();
375 rp->transmission_counter++;
378 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
379 "Executing plan %p executed %u times, planning retransmission\n",
380 rp, rp->transmission_counter);
383 GNUNET_STATISTICS_update (GSF_stats,
385 ("# query messages sent to other peers"), 1,
392 * Figure out when and how to transmit to the given peer.
394 * @param cls the 'struct PeerPlan'
395 * @param tc scheduler context
398 schedule_peer_transmission (void *cls,
399 const struct GNUNET_SCHEDULER_TaskContext *tc)
401 struct PeerPlan *pp = cls;
402 struct GSF_RequestPlan *rp;
404 struct GNUNET_TIME_Relative delay;
406 pp->task = GNUNET_SCHEDULER_NO_TASK;
409 GSF_peer_transmit_cancel_ (pp->pth);
412 /* move ready requests to priority queue */
413 while ((NULL != (rp = GNUNET_CONTAINER_heap_peek (pp->delay_heap))) &&
414 (GNUNET_TIME_absolute_get_remaining
415 (rp->earliest_transmission).rel_value == 0))
417 GNUNET_assert (rp == GNUNET_CONTAINER_heap_remove_root (pp->delay_heap));
418 rp->hn = GNUNET_CONTAINER_heap_insert (pp->priority_heap, rp, rp->priority);
420 if (0 == GNUNET_CONTAINER_heap_get_size (pp->priority_heap))
422 /* priority heap (still) empty, check for delay... */
423 rp = GNUNET_CONTAINER_heap_peek (pp->delay_heap);
427 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "No active requests for plan %p.\n",
430 return; /* both queues empty */
432 delay = GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission);
434 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
435 "Sleeping for %llu ms before retrying requests on plan %p.\n",
437 delay.rel_value, pp);
439 GNUNET_STATISTICS_set (GSF_stats,
440 gettext_noop ("# delay heap timeout"),
445 GNUNET_SCHEDULER_add_delayed (delay,
446 &schedule_peer_transmission, pp);
449 GNUNET_STATISTICS_update (GSF_stats,
450 gettext_noop ("# query plans executed"), 1,
452 /* process from priority heap */
453 rp = GNUNET_CONTAINER_heap_peek (pp->priority_heap);
455 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Executing query plan %p\n", rp);
457 GNUNET_assert (NULL != rp);
458 msize = GSF_pending_request_get_message_ (get_latest (rp), 0, NULL);
460 GSF_peer_transmit_ (pp->cp, GNUNET_YES, rp->priority,
461 GNUNET_TIME_UNIT_FOREVER_REL, msize,
462 &transmit_message_callback, pp);
463 GNUNET_assert (NULL != pp->pth);
468 * Closure for 'merge_pr'.
473 struct GSF_PendingRequest *pr;
481 * Iterator that checks if an equivalent request is already
482 * present for this peer.
485 * @param query the query
486 * @param element request plan stored at the node
487 * @return GNUNET_YES if we should continue to iterate,
488 * GNUNET_NO if not (merge success)
492 const GNUNET_HashCode *query,
495 struct MergeContext *mpr = cls;
496 struct GSF_RequestPlan *rp = element;
497 struct GSF_PendingRequestData *prd;
498 struct GSF_RequestPlanReference *rpr;
499 struct PendingRequestList *prl;
500 struct GSF_PendingRequest *latest;
503 GSF_pending_request_is_compatible_ (mpr->pr, rp->prl_head->pr))
505 /* merge new request with existing request plan */
506 rpr = GNUNET_malloc (sizeof (struct GSF_RequestPlanReference));
507 prl = GNUNET_malloc (sizeof (struct PendingRequestList));
512 prd = GSF_pending_request_get_data_ (mpr->pr);
513 GNUNET_CONTAINER_DLL_insert (prd->rpr_head, prd->rpr_tail, rpr);
514 GNUNET_CONTAINER_DLL_insert (rp->prl_head, rp->prl_tail, prl);
515 mpr->merged = GNUNET_YES;
516 GNUNET_STATISTICS_update (GSF_stats, gettext_noop ("# requests merged"), 1,
518 latest = get_latest (rp);
519 if (GSF_pending_request_get_data_ (latest)->ttl.abs_value <
522 GNUNET_STATISTICS_update (GSF_stats, gettext_noop ("# requests refreshed"),
524 rp->transmission_counter = 0; /* reset */
531 * Create a new query plan entry.
533 * @param cp peer with the entry
534 * @param pr request with the entry
537 GSF_plan_add_ (struct GSF_ConnectedPeer *cp, struct GSF_PendingRequest *pr)
539 struct GNUNET_PeerIdentity id;
541 struct GSF_PendingRequestData *prd;
542 struct GSF_RequestPlan *rp;
543 struct GSF_RequestPlanReference *rpr;
544 struct PendingRequestList *prl;
545 struct MergeContext mpc;
547 GNUNET_assert (NULL != cp);
548 GSF_connected_peer_get_identity_ (cp, &id);
549 pp = GNUNET_CONTAINER_multihashmap_get (plans, &id.hashPubKey);
552 pp = GNUNET_malloc (sizeof (struct PeerPlan));
554 GNUNET_CONTAINER_multihashmap_create (128);
556 GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MAX);
558 GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MIN);
560 GNUNET_CONTAINER_multihashmap_put (plans, &id.hashPubKey, pp,
561 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
563 mpc.merged = GNUNET_NO;
565 GNUNET_CONTAINER_multihashmap_get_multiple (pp->plan_map,
566 &GSF_pending_request_get_data_ (pr)->query,
568 if (mpc.merged != GNUNET_NO)
570 GNUNET_CONTAINER_multihashmap_get_multiple (pp->plan_map,
571 &GSF_pending_request_get_data_ (pr)->query,
573 if (mpc.merged != GNUNET_NO)
576 GNUNET_STATISTICS_update (GSF_stats, gettext_noop ("# query plan entries"), 1,
578 prd = GSF_pending_request_get_data_ (pr);
580 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
581 "Planning transmission of query `%s' to peer `%s'\n",
582 GNUNET_h2s (&prd->query), GNUNET_i2s (&id));
584 rp = GNUNET_malloc (sizeof (struct GSF_RequestPlan));
585 rpr = GNUNET_malloc (sizeof (struct GSF_RequestPlanReference));
586 prl = GNUNET_malloc (sizeof (struct PendingRequestList));
591 GNUNET_CONTAINER_DLL_insert (prd->rpr_head, prd->rpr_tail, rpr);
592 GNUNET_CONTAINER_DLL_insert (rp->prl_head, rp->prl_tail, prl);
594 GNUNET_assert (GNUNET_YES ==
595 GNUNET_CONTAINER_multihashmap_put (pp->plan_map,
598 GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE));
604 * Notify the plan about a peer being no longer available;
605 * destroy all entries associated with this peer.
607 * @param cp connected peer
610 GSF_plan_notify_peer_disconnect_ (const struct GSF_ConnectedPeer *cp)
612 struct GNUNET_PeerIdentity id;
614 struct GSF_RequestPlan *rp;
615 struct GSF_PendingRequestData *prd;
616 struct PendingRequestList *prl;
618 GSF_connected_peer_get_identity_ (cp, &id);
619 pp = GNUNET_CONTAINER_multihashmap_get (plans, &id.hashPubKey);
621 return; /* nothing was ever planned for this peer */
622 GNUNET_assert (GNUNET_YES ==
623 GNUNET_CONTAINER_multihashmap_remove (plans, &id.hashPubKey,
626 GSF_peer_transmit_cancel_ (pp->pth);
627 if (GNUNET_SCHEDULER_NO_TASK != pp->task)
629 GNUNET_SCHEDULER_cancel (pp->task);
630 pp->task = GNUNET_SCHEDULER_NO_TASK;
632 while (NULL != (rp = GNUNET_CONTAINER_heap_remove_root (pp->priority_heap)))
634 GNUNET_assert (GNUNET_YES ==
635 GNUNET_CONTAINER_multihashmap_remove (pp->plan_map,
638 while (NULL != (prl = rp->prl_head))
640 GNUNET_CONTAINER_DLL_remove (rp->prl_head, rp->prl_tail, prl);
641 prd = GSF_pending_request_get_data_ (prl->pr);
642 GNUNET_CONTAINER_DLL_remove (prd->rpr_head, prd->rpr_tail, prl->rpr);
643 GNUNET_free (prl->rpr);
648 GNUNET_CONTAINER_heap_destroy (pp->priority_heap);
649 while (NULL != (rp = GNUNET_CONTAINER_heap_remove_root (pp->delay_heap)))
651 GNUNET_CONTAINER_multihashmap_remove (pp->plan_map,
654 while (NULL != (prl = rp->prl_head))
656 GNUNET_CONTAINER_DLL_remove (rp->prl_head, rp->prl_tail, prl);
657 prd = GSF_pending_request_get_data_ (prl->pr);
658 GNUNET_CONTAINER_DLL_remove (prd->rpr_head, prd->rpr_tail, prl->rpr);
659 GNUNET_free (prl->rpr);
664 GNUNET_STATISTICS_set (GSF_stats, gettext_noop ("# query plan entries"),
665 plan_count, GNUNET_NO);
667 GNUNET_CONTAINER_heap_destroy (pp->delay_heap);
668 GNUNET_CONTAINER_multihashmap_destroy (pp->plan_map);
674 * Notify the plan about a request being done; destroy all entries
675 * associated with this request.
677 * @param pr request that is done
680 GSF_plan_notify_request_done_ (struct GSF_PendingRequest *pr)
682 struct GSF_RequestPlan *rp;
683 struct GSF_PendingRequestData *prd;
684 struct GSF_RequestPlanReference *rpr;
686 prd = GSF_pending_request_get_data_ (pr);
687 while (NULL != (rpr = prd->rpr_head))
689 GNUNET_CONTAINER_DLL_remove (prd->rpr_head, prd->rpr_tail, rpr);
691 GNUNET_CONTAINER_DLL_remove (rp->prl_head, rp->prl_tail, rpr->prl);
692 if (NULL == rp->prl_head)
694 GNUNET_CONTAINER_heap_remove_node (rp->hn);
696 GNUNET_CONTAINER_multihashmap_remove (rp->pp->plan_map,
697 &GSF_pending_request_get_data_ (rpr->prl->pr)->query,
701 GNUNET_free (rpr->prl);
704 GNUNET_STATISTICS_set (GSF_stats, gettext_noop ("# query plan entries"),
705 plan_count, GNUNET_NO);
710 * Initialize plan subsystem.
715 plans = GNUNET_CONTAINER_multihashmap_create (256);
720 * Shutdown plan subsystem.
725 GNUNET_assert (0 == GNUNET_CONTAINER_multihashmap_size (plans));
726 GNUNET_CONTAINER_multihashmap_destroy (plans);
731 /* end of gnunet-service-fs_pe.h */