[GNUnet-SVN] r31245 - in gnunet/src: ats set transport

[gnunet]

Author: grothoff
Date: 2013-12-10 09:41:52 +0100 (Tue, 10 Dec 2013)
New Revision: 31245

Modified:
   gnunet/src/ats/plugin_ats_ril.c
   gnunet/src/set/gnunet-service-set_intersection.c
   gnunet/src/transport/gnunet-service-transport_neighbours.c
Log:
-doxygen fixes

Modified: gnunet/src/ats/plugin_ats_ril.c
===================================================================
--- gnunet/src/ats/plugin_ats_ril.c     2013-12-10 07:58:08 UTC (rev 31244)
+++ gnunet/src/ats/plugin_ats_ril.c     2013-12-10 08:41:52 UTC (rev 31245)
@@ -565,13 +565,14 @@
 
 /**
  * Changes the eligibility trace vector e in various manners:
- * RIL_E_ACCUMULATE - adds 1 to each component as in accumulating eligibility 
traces
- * RIL_E_REPLACE - resets each component to 1 as in replacing traces
- * RIL_E_SET - multiplies e with discount factor and lambda as in the update 
rule
- * RIL_E_ZERO - sets e to 0 as in Watkin's Q-learning algorithm when exploring 
and when initializing
+ * #RIL_E_ACCUMULATE - adds @a f to each component as in accumulating 
eligibility traces
+ * #RIL_E_REPLACE - resets each component to @f  as in replacing traces
+ * #RIL_E_SET - multiplies e with discount factor and lambda as in the update 
rule
+ * #RIL_E_ZERO - sets e to 0 as in Watkin's Q-learning algorithm when 
exploring and when initializing
  *
  * @param agent the agent handle
  * @param mod the kind of modification
+ * @param f how much to change
  */
 static void
 agent_modify_eligibility (struct RIL_Peer_Agent *agent, enum 
RIL_E_Modification mod, double *f)
@@ -599,6 +600,7 @@
   }
 }
 
+
 static void
 ril_inform (struct GAS_RIL_Handle *solver,
     enum GAS_Solver_Operation op,

Modified: gnunet/src/set/gnunet-service-set_intersection.c
===================================================================
--- gnunet/src/set/gnunet-service-set_intersection.c    2013-12-10 07:58:08 UTC 
(rev 31244)
+++ gnunet/src/set/gnunet-service-set_intersection.c    2013-12-10 08:41:52 UTC 
(rev 31245)
@@ -76,12 +76,12 @@
    * BF of the set's element.
    */
   struct GNUNET_CONTAINER_BloomFilter *local_bf;
-  
+
   /**
    * for multipart msgs we have to store the bloomfilter-data until we fully 
sent it.
    */
   char * local_bf_data;
-  
+
   /**
    * for multipart msgs we have to store the bloomfilter-data until we fully 
sent it.
    */
@@ -304,7 +304,7 @@
 /**
  * Send a request for the evaluate operation to a remote peer
  *
- * @param eo operation with the other peer
+ * @param op operation with the other peer
  */
 static void
 send_operation_request (struct Operation *op)
@@ -348,13 +348,13 @@
   struct BFMessage *msg;
   uint32_t chunk_size = (GNUNET_SERVER_MAX_MESSAGE_SIZE - sizeof(struct 
BFMessage));
   uint32_t todo_size = op->state->local_bf_data_size - offset;
-  
+
   if (todo_size < chunk_size)
     // we probably need many chunks, thus we assume a maximum packet size by 
default
     chunk_size = todo_size;
-  
+
   ev = GNUNET_MQ_msg_extra (msg, chunk_size, 
GNUNET_MESSAGE_TYPE_SET_INTERSECTION_P2P_BF);
-    
+
   msg->reserved = 0;
   msg->bloomfilter_total_length = htonl (op->state->local_bf_data_size);
   msg->bloomfilter_length = htonl (chunk_size);
@@ -362,7 +362,7 @@
   memcpy(&msg[1], op->state->local_bf, chunk_size);
 
   GNUNET_MQ_send (op->mq, ev);
-  
+
   if (op->state->local_bf_data_size == offset + chunk_size)
   {
     // done
@@ -372,7 +372,7 @@
     op->state->local_bf = NULL;
     return;
   }
-  
+
   send_bloomfilter_multipart (op, offset + chunk_size);
 }
 
@@ -382,7 +382,7 @@
  * After the result done message has been sent to the client,
  * destroy the evaluate operation.
  *
- * @param eo intersection operation
+ * @param op intersection operation
  */
 static void
 send_bloomfilter (struct Operation *op)
@@ -399,10 +399,10 @@
   {
     // singlepart
     ev = GNUNET_MQ_msg_extra (msg, bf_size, 
GNUNET_MESSAGE_TYPE_SET_INTERSECTION_P2P_BF);
-    
+
     GNUNET_CONTAINER_bloomfilter_free (op->state->local_bf);
     op->state->local_bf = NULL;
-    
+
     msg->reserved = 0;
     msg->sender_element_count = htonl (op->state->my_element_count);
     msg->bloomfilter_length = htonl (bf_size);
@@ -487,7 +487,7 @@
 /**
  * Inform the peer that this operation is complete.
  *
- * @param eo the intersection operation to fail
+ * @param op the intersection operation to fail
  */
 static void
 send_peer_done (struct Operation *op)
@@ -617,7 +617,7 @@
 /**
  * Send our element to the peer, in case our element count is lower than his
  *
- * @param eo intersection operation
+ * @param op intersection operation
  */
 static void
 send_element_count (struct Operation *op)
@@ -804,7 +804,7 @@
 /**
  * Dispatch messages for a intersection operation.
  *
- * @param eo the state of the intersection evaluate operation
+ * @param op the state of the intersection evaluate operation
  * @param mh the received message
  * @return #GNUNET_SYSERR if the tunnel should be disconnected,
  *         #GNUNET_OK otherwise

Modified: gnunet/src/transport/gnunet-service-transport_neighbours.c
===================================================================
--- gnunet/src/transport/gnunet-service-transport_neighbours.c  2013-12-10 
07:58:08 UTC (rev 31244)
+++ gnunet/src/transport/gnunet-service-transport_neighbours.c  2013-12-10 
08:41:52 UTC (rev 31245)
@@ -250,7 +250,7 @@
  * have a new address, we go to #S_RECONNECT_BLACKLIST to check the new
  * address against the blacklist.  If the blacklist approves, we enter
  * #S_RECONNECT_SENT and send a CONNECT message.  If we receive a
- * #CONNECT_ACK, we go to #S_CONNECTED and nobody noticed that we had
+ * CONNECT_ACK, we go to #S_CONNECTED and nobody noticed that we had
  * trouble; we also send a SESSION_ACK at this time just in case.  If
  * the operation times out, we go to S_DISCONNECT (and notify everyone
  * about the lost connection).