1 /* Copyright (c) 2012. 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. */
8 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(msg_kademlia_node);
11 * Initialize a node answer object.
13 answer_t answer_init(unsigned int destination_id)
15 answer_t answer = xbt_new(s_answer_t, 1);
16 answer->nodes = xbt_dynar_new(sizeof(node_contact_t), NULL);
18 answer->destination_id = destination_id;
24 * Destroys a node answer object.
26 void answer_free(answer_t answer)
29 for (i = 0; i < answer->size; i++) {
30 node_contact_free(*(void **) xbt_dynar_get_ptr(answer->nodes, i));
32 xbt_dynar_free(&answer->nodes);
37 * @brief Prints a answer_t, for debugging purposes
39 void answer_print(answer_t answer)
42 node_contact_t contact;
43 XBT_INFO("Searching %08x, size %d", answer->destination_id, answer->size);
44 xbt_dynar_foreach(answer->nodes, cpt, contact) {
45 XBT_INFO("Node %08x: %08x is at distance %d", cpt, contact->id,
51 * @brief Merge two answer_t together, only keeping the best nodes
52 * @param destination the destination in which the nodes will be put
53 * @param source the source of the nodes to add
55 unsigned int answer_merge(answer_t destination, answer_t source)
57 node_contact_t contact, contact_copy;
59 unsigned int nb_added = 0;
60 /* TODO: Check if same destination */
61 xbt_dynar_foreach(source->nodes, cpt, contact) {
62 if (!answer_contains(destination, contact->id)) {
63 contact_copy = node_contact_copy(contact);
64 xbt_dynar_push(destination->nodes, &contact_copy);
69 answer_sort(destination);
70 answer_trim(destination);
75 * Helper to sort answer_t objects
77 static int _answer_sort_function(const void *e1, const void *e2)
79 node_contact_t c1 = *(void **) e1;
80 node_contact_t c2 = *(void **) e2;
81 return c1->distance >= c2->distance;
85 * Sorts a answer_t, by node distance.
86 * @param answer the answer to sort
87 * @param destination_id the id of the guy we are trying to find
89 void answer_sort(answer_t answer)
91 xbt_dynar_sort(answer->nodes, &_answer_sort_function);
95 * Trims a answer_t, in order for it to have a size of less or equal
97 * @param answer the answer_t to trim
99 void answer_trim(answer_t answer)
101 node_contact_t value;
102 while (answer->size > bucket_size) {
103 xbt_dynar_pop(answer->nodes, &value);
105 node_contact_free(value);
107 xbt_assert(xbt_dynar_length(answer->nodes) == answer->size,
108 "Wrong size for the answer");
112 * Adds the content of a bucket unsigned into a answer object.
113 * @param bucket the bucket we have to had unsigned into
114 * @param answer the answer object we're going to put the data in
115 * @param destination_id the id of the guy we are trying to find.
117 void answer_add_bucket(bucket_t bucket, answer_t answer)
120 unsigned int id, distance;
121 node_contact_t contact;
122 xbt_assert((bucket != NULL), "Provided a NULL bucket");
123 xbt_assert((bucket->nodes != NULL), "Provided a bucket which nodes are NULL");
124 xbt_dynar_foreach(bucket->nodes, cpt, id) {
125 distance = id ^ answer->destination_id;
126 contact = node_contact_new(id, distance);
127 xbt_dynar_push(answer->nodes, &contact);
133 * Returns if the id supplied is in the answer.
134 * @param id : id we're looking for
136 unsigned int answer_contains(answer_t answer, unsigned int id)
138 unsigned int i = 0, size = xbt_dynar_length(answer->nodes);
139 node_contact_t contact;
140 for (i = 0; i < size; i++) {
141 contact = xbt_dynar_get_as(answer->nodes, i, node_contact_t);
142 if (id == contact->id) {
150 * Returns if the destination we are trying to find is found
151 * @param answer the answer
152 * @return if the destination is found.
154 unsigned int answer_destination_found(answer_t answer)
156 if (xbt_dynar_length(answer->nodes) < 1) {
159 node_contact_t contact_tail =
160 xbt_dynar_get_as(answer->nodes, 0, node_contact_t);
161 return contact_tail->distance == 0;