Example cleaning

[simgrid.git] / examples / msg / kademlia / node.h

diff --git a/examples/msg/kademlia/node.h b/examples/msg/kademlia/node.h
index 2db9a51..9a5eab2 100644 (file)
--- a/examples/msg/kademlia/node.h
+++ b/examples/msg/kademlia/node.h
@@ -1,5 +1,4 @@
-
-/* Copyright (c) 2012. The SimGrid Team.
+/* Copyright (c) 2012, 2014-2016. The SimGrid Team.
  * All rights reserved.                                                     */
 
 /* This program is free software; you can redistribute it and/or modify it
@@ -8,23 +7,19 @@
 #ifndef _MSG_EXAMPLES_ROUTING_H
 #define _MSG_EXAMPLES_ROUTING_H
 #include "xbt/dynar.h"
-#include "msg/msg.h"
+#include "simgrid/msg.h"
 
 #include "common.h"
-
 #include "answer.h"
 #include "routing_table.h"
-/**
-  * Information about a foreign node
-  */
+
+/* Information about a foreign node */
 typedef struct s_node_contact {
   unsigned int id;              //The node identifier
   unsigned int distance;        //The distance from the node
 } s_node_contact_t, *node_contact_t;
 
-/*
- * Node data
- */
+/* Node data */
 typedef struct s_node {
   unsigned int id;              //node id - 160 bits
   routing_table_t table;        //node routing table
@@ -40,11 +35,9 @@ typedef struct s_node {
 // node functions
 node_t node_init(unsigned int id);
 void node_free(node_t node);
-
 void node_routing_table_update(node_t node, unsigned int id);
 answer_t node_find_closest(node_t node, unsigned int destination_id);
 
-
 // identifier functions
 unsigned int get_id_in_prefix(unsigned int id, unsigned int prefix);
 unsigned int get_node_prefix(unsigned int id, unsigned int nb_bits);