1 /* Copyright (c) 2012-2014. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
9 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(msg_kademlia_node);
11 /** Initialize a node answer object. */
12 answer_t answer_init(unsigned int destination_id)
14 answer_t answer = xbt_new(s_answer_t, 1);
15 answer->nodes = xbt_dynar_new(sizeof(node_contact_t), NULL);
17 answer->destination_id = destination_id;
22 /** Destroys a node answer object. */
23 void answer_free(answer_t answer)
26 for (i = 0; i < answer->size; i++) {
27 node_contact_free(*(void **) xbt_dynar_get_ptr(answer->nodes, i));
29 xbt_dynar_free(&answer->nodes);
33 /** @brief Prints a answer_t, for debugging purposes */
34 void answer_print(answer_t answer)
37 node_contact_t contact;
38 XBT_INFO("Searching %08x, size %d", answer->destination_id, answer->size);
39 xbt_dynar_foreach(answer->nodes, cpt, contact) {
40 XBT_INFO("Node %08x: %08x is at distance %d", cpt, contact->id, contact->distance);
44 /** @brief Merge two answer_t together, only keeping the best nodes
45 * @param destination the destination in which the nodes will be put
46 * @param source the source of the nodes to add
48 unsigned int answer_merge(answer_t destination, answer_t source)
50 node_contact_t contact;
51 node_contact_t contact_copy;
53 unsigned int nb_added = 0;
54 /* TODO: Check if same destination */
55 xbt_dynar_foreach(source->nodes, cpt, contact) {
56 if (answer_contains(destination, contact->id) == 0) {
57 contact_copy = node_contact_copy(contact);
58 xbt_dynar_push(destination->nodes, &contact_copy);
63 answer_sort(destination);
64 answer_trim(destination);
68 /** Helper to sort answer_t objects */
69 static int _answer_sort_function(const void *e1, const void *e2)
71 node_contact_t c1 = *(void **) e1;
72 node_contact_t c2 = *(void **) e2;
73 if (c1->distance == c2->distance)
76 if (c1->distance < c2->distance)
82 /** @brief Sorts a answer_t, by node distance.
83 * @param answer the answer to sort
84 * @param destination_id the id of the guy we are trying to find
86 void answer_sort(answer_t answer)
88 xbt_dynar_sort(answer->nodes, &_answer_sort_function);
91 /** @brief Trims a answer_t, in order for it to have a size of less or equal to "bucket_size"
92 * @param answer the answer_t to trim
94 void answer_trim(answer_t answer)
97 while (answer->size > bucket_size) {
98 xbt_dynar_pop(answer->nodes, &value);
100 node_contact_free(value);
102 xbt_assert(xbt_dynar_length(answer->nodes) == answer->size, "Wrong size for the answer");
105 /** @brief Adds the content of a bucket unsigned into a answer object.
106 * @param bucket the bucket we have to had unsigned into
107 * @param answer the answer object we're going to put the data in
108 * @param destination_id the id of the guy we are trying to find.
110 void answer_add_bucket(bucket_t bucket, answer_t answer)
114 unsigned int distance;
115 node_contact_t contact;
116 xbt_assert((bucket != NULL), "Provided a NULL bucket");
117 xbt_assert((bucket->nodes != NULL), "Provided a bucket which nodes are NULL");
118 xbt_dynar_foreach(bucket->nodes, cpt, id) {
119 distance = id ^ answer->destination_id;
120 contact = node_contact_new(id, distance);
121 xbt_dynar_push(answer->nodes, &contact);
126 /** @brief Returns if the id supplied is in the answer.
127 * @param id : id we're looking for
129 unsigned int answer_contains(answer_t answer, unsigned int id)
132 node_contact_t contact;
133 xbt_dynar_foreach(answer->nodes, i, contact){
134 if (id == contact->id) {
141 /** @brief Returns if the destination we are trying to find is found
142 * @param answer the answer
143 * @return if the destination is found.
145 unsigned int answer_destination_found(answer_t answer)
147 if (xbt_dynar_length(answer->nodes) < 1) {
150 node_contact_t contact_tail = xbt_dynar_get_as(answer->nodes, 0, node_contact_t);
151 return contact_tail->distance == 0;