From ecde9b6b2202126151e34998991b6f35e6d7d149 Mon Sep 17 00:00:00 2001 From: Christian Grothoff Date: Tue, 10 Dec 2013 08:41:52 +0000 Subject: [PATCH] -doxygen fixes --- src/ats/plugin_ats_ril.c | 10 ++++--- src/set/gnunet-service-set_intersection.c | 28 +++++++++---------- .../gnunet-service-transport_neighbours.c | 2 +- 3 files changed, 21 insertions(+), 19 deletions(-) diff --git a/src/ats/plugin_ats_ril.c b/src/ats/plugin_ats_ril.c index ee7795638..88120d517 100755 --- a/src/ats/plugin_ats_ril.c +++ b/src/ats/plugin_ats_ril.c @@ -565,13 +565,14 @@ agent_update_weights (struct RIL_Peer_Agent *agent, double reward, double *s_nex /** * 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 @@ agent_modify_eligibility (struct RIL_Peer_Agent *agent, enum RIL_E_Modification } } + static void ril_inform (struct GAS_RIL_Handle *solver, enum GAS_Solver_Operation op, diff --git a/src/set/gnunet-service-set_intersection.c b/src/set/gnunet-service-set_intersection.c index 9fa51e4f1..f2dfb1759 100644 --- a/src/set/gnunet-service-set_intersection.c +++ b/src/set/gnunet-service-set_intersection.c @@ -76,12 +76,12 @@ struct OperationState * 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 @@ fail_intersection_operation (struct Operation *op) /** * 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 @@ send_bloomfilter_multipart (struct Operation *op, uint32_t offset) 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 @@ send_bloomfilter_multipart (struct Operation *op, uint32_t offset) 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 @@ send_bloomfilter_multipart (struct Operation *op, uint32_t offset) op->state->local_bf = NULL; return; } - + send_bloomfilter_multipart (op, offset + chunk_size); } @@ -382,7 +382,7 @@ send_bloomfilter_multipart (struct Operation *op, uint32_t offset) * 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 @@ send_bloomfilter (struct Operation *op) { // 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 @@ send_remaining_elements (void *cls) /** * 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 @@ handle_p2p_element_info (void *cls, const struct GNUNET_MessageHeader *mh) /** * 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 @@ intersection_remove (struct SetState *set_state, /** * 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 diff --git a/src/transport/gnunet-service-transport_neighbours.c b/src/transport/gnunet-service-transport_neighbours.c index 21d40d9be..4d83c716d 100644 --- a/src/transport/gnunet-service-transport_neighbours.c +++ b/src/transport/gnunet-service-transport_neighbours.c @@ -250,7 +250,7 @@ struct MessageQueue * 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). -- 2.25.1