X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=src%2Ftransport%2Fgnunet-service-transport_ats.c;h=01e115bfca35fbab6d8b8a7840534480ec0ff9c4;hb=0d24b1ba329faa35990034fcc861a264bb985fb1;hp=acbc3878c97fa9876fe92a461500aac6a8a43ee0;hpb=6d6736d720ed24492558f5357993beccd1765d9a;p=oweals%2Fgnunet.git diff --git a/src/transport/gnunet-service-transport_ats.c b/src/transport/gnunet-service-transport_ats.c index acbc3878c..01e115bfc 100644 --- a/src/transport/gnunet-service-transport_ats.c +++ b/src/transport/gnunet-service-transport_ats.c @@ -1,6 +1,6 @@ /* This file is part of GNUnet. - (C) 2009, 2010 Christian Grothoff (and other contributing authors) + Copyright (C) 2015 GNUnet e.V. GNUnet is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published @@ -14,1733 +14,913 @@ You should have received a copy of the GNU General Public License along with GNUnet; see the file COPYING. If not, write to the - Free Software Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. + Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ - /** - * @file transport/transport_ats.c - * @brief automatic transport selection - * @author Matthias Wachs - * + * @file transport/gnunet-service-transport_ats.c + * @brief interfacing between transport and ATS service + * @author Christian Grothoff */ - - +#include "platform.h" +#include "gnunet-service-transport.h" #include "gnunet-service-transport_ats.h" -#include "gnunet_transport_service.h" -#include "gnunet_statistics_service.h" -#include "gnunet_container_lib.h" - - - - - -/* LP/MIP problem object */ - -#if !HAVE_LIBGLPK - -#ifndef GLP_PROB_DEFINED -#define GLP_PROB_DEFINED - typedef struct { double _opaque_prob[100]; } glp_prob; -#endif - -typedef struct -{ /* integer optimizer control parameters */ - int msg_lev; /* message level (see glp_smcp) */ - int br_tech; /* branching technique: */ -#define GLP_BR_FFV 1 /* first fractional variable */ -#define GLP_BR_LFV 2 /* last fractional variable */ -#define GLP_BR_MFV 3 /* most fractional variable */ -#define GLP_BR_DTH 4 /* heuristic by Driebeck and Tomlin */ -#define GLP_BR_PCH 5 /* hybrid pseudocost heuristic */ - int bt_tech; /* backtracking technique: */ -#define GLP_BT_DFS 1 /* depth first search */ -#define GLP_BT_BFS 2 /* breadth first search */ -#define GLP_BT_BLB 3 /* best local bound */ -#define GLP_BT_BPH 4 /* best projection heuristic */ - double tol_int; /* mip.tol_int */ - double tol_obj; /* mip.tol_obj */ - int tm_lim; /* mip.tm_lim (milliseconds) */ - int out_frq; /* mip.out_frq (milliseconds) */ - int out_dly; /* mip.out_dly (milliseconds) */ - /* mip.cb_func */ - void *cb_info; /* mip.cb_info */ - int cb_size; /* mip.cb_size */ - int pp_tech; /* preprocessing technique: */ -#define GLP_PP_NONE 0 /* disable preprocessing */ -#define GLP_PP_ROOT 1 /* preprocessing only on root level */ -#define GLP_PP_ALL 2 /* preprocessing on all levels */ - double mip_gap; /* relative MIP gap tolerance */ - int mir_cuts; /* MIR cuts (GLP_ON/GLP_OFF) */ - int gmi_cuts; /* Gomory's cuts (GLP_ON/GLP_OFF) */ - int cov_cuts; /* cover cuts (GLP_ON/GLP_OFF) */ - int clq_cuts; /* clique cuts (GLP_ON/GLP_OFF) */ - int presolve; /* enable/disable using MIP presolver */ - int binarize; /* try to binarize integer variables */ - int fp_heur; /* feasibility pump heuristic */ -#if 1 /* 28/V-2010 */ - int alien; /* use alien solver */ -#endif - double foo_bar[29]; /* (reserved) */ -} glp_iocp; - -typedef struct -{ /* simplex method control parameters */ - int msg_lev; /* message level: */ -#define GLP_MSG_OFF 0 /* no output */ -#define GLP_MSG_ERR 1 /* warning and error messages only */ -#define GLP_MSG_ON 2 /* normal output */ -#define GLP_MSG_ALL 3 /* full output */ -#define GLP_MSG_DBG 4 /* debug output */ - int meth; /* simplex method option: */ -#define GLP_PRIMAL 1 /* use primal simplex */ -#define GLP_DUALP 2 /* use dual; if it fails, use primal */ -#define GLP_DUAL 3 /* use dual simplex */ - int pricing; /* pricing technique: */ -#define GLP_PT_STD 0x11 /* standard (Dantzig rule) */ -#define GLP_PT_PSE 0x22 /* projected steepest edge */ - int r_test; /* ratio test technique: */ -#define GLP_RT_STD 0x11 /* standard (textbook) */ -#define GLP_RT_HAR 0x22 /* two-pass Harris' ratio test */ - double tol_bnd; /* spx.tol_bnd */ - double tol_dj; /* spx.tol_dj */ - double tol_piv; /* spx.tol_piv */ - double obj_ll; /* spx.obj_ll */ - double obj_ul; /* spx.obj_ul */ - int it_lim; /* spx.it_lim */ - int tm_lim; /* spx.tm_lim (milliseconds) */ - int out_frq; /* spx.out_frq */ - int out_dly; /* spx.out_dly (milliseconds) */ - int presolve; /* enable/disable using LP presolver */ - double foo_bar[36]; /* (reserved) */ -} glp_smcp; - -/* optimization direction flag: */ -#define GLP_MIN 1 /* minimization */ -#define GLP_MAX 2 /* maximization */ - -/* kind of structural variable: */ -#define GLP_CV 1 /* continuous variable */ -#define GLP_IV 2 /* integer variable */ -#define GLP_BV 3 /* binary variable */ - -/* type of auxiliary/structural variable: */ -#define GLP_FR 1 /* free variable */ -#define GLP_LO 2 /* variable with lower bound */ -#define GLP_UP 3 /* variable with upper bound */ -#define GLP_DB 4 /* double-bounded variable */ -#define GLP_FX 5 /* fixed variable */ - -/* solution indicator: */ -#define GLP_SOL 1 /* basic solution */ -#define GLP_IPT 2 /* interior-point solution */ -#define GLP_MIP 3 /* mixed integer solution */ - -/* solution status: */ -#define GLP_UNDEF 1 /* solution is undefined */ -#define GLP_FEAS 2 /* solution is feasible */ -#define GLP_INFEAS 3 /* solution is infeasible */ -#define GLP_NOFEAS 4 /* no feasible solution exists */ -#define GLP_OPT 5 /* solution is optimal */ -#define GLP_UNBND 6 /* solution is unbounded */ - -/* return codes: */ -#define GLP_EBADB 0x01 /* invalid basis */ -#define GLP_ESING 0x02 /* singular matrix */ -#define GLP_ECOND 0x03 /* ill-conditioned matrix */ -#define GLP_EBOUND 0x04 /* invalid bounds */ -#define GLP_EFAIL 0x05 /* solver failed */ -#define GLP_EOBJLL 0x06 /* objective lower limit reached */ -#define GLP_EOBJUL 0x07 /* objective upper limit reached */ -#define GLP_EITLIM 0x08 /* iteration limit exceeded */ -#define GLP_ETMLIM 0x09 /* time limit exceeded */ -#define GLP_ENOPFS 0x0A /* no primal feasible solution */ -#define GLP_ENODFS 0x0B /* no dual feasible solution */ -#define GLP_EROOT 0x0C /* root LP optimum not provided */ -#define GLP_ESTOP 0x0D /* search terminated by application */ -#define GLP_EMIPGAP 0x0E /* relative mip gap tolerance reached */ -#define GLP_ENOFEAS 0x0F /* no primal/dual feasible solution */ -#define GLP_ENOCVG 0x10 /* no convergence */ -#define GLP_EINSTAB 0x11 /* numerical instability */ -#define GLP_EDATA 0x12 /* invalid data */ -#define GLP_ERANGE 0x13 /* result out of range */ - -/* enable/disable flag: */ -#define GLP_ON 1 /* enable something */ -#define GLP_OFF 0 /* disable something */ - -#endif +#include "gnunet-service-transport_manipulation.h" +#include "gnunet-service-transport_plugins.h" +#include "gnunet_ats_service.h" -/* - * Wrappers for GLPK Functions +/** + * Log convenience function. */ +#define LOG(kind,...) GNUNET_log_from(kind, "transport-ats", __VA_ARGS__) -void * _lp_create_prob ( void ) -{ -#if HAVE_LIBGLPK - return glp_create_prob( ); -#else - // Function not implemented - GNUNET_break (0); -#endif - return NULL; -} - -void _lp_set_obj_dir (glp_prob *P, int dir) -{ -#if HAVE_LIBGLPK - return glp_set_obj_dir (P, dir); -#else - // Function not implemented - GNUNET_break (0); -#endif -} +/** + * Information we track for each address known to ATS. + */ +struct AddressInfo +{ + + /** + * The address (with peer identity). Must never change + * while this struct is in the #p2a map. + */ + struct GNUNET_HELLO_Address *address; + + /** + * Session (can be NULL) + */ + struct GNUNET_ATS_Session *session; + + /** + * Record with ATS API for the address. + */ + struct GNUNET_ATS_AddressRecord *ar; + + /** + * Performance properties of this address. + */ + struct GNUNET_ATS_Properties properties; + + /** + * Time until when this address is blocked and should thus not be + * made available to ATS (@e ar should be NULL until this time). + * Used when transport determines that for some reason it + * (temporarily) cannot use an address, even though it has been + * validated. + */ + struct GNUNET_TIME_Absolute blocked; + + /** + * If an address is blocked as part of an exponential back-off, + * we track the current size of the backoff here. + */ + struct GNUNET_TIME_Relative back_off; + + /** + * Task scheduled to unblock an ATS-blocked address at + * @e blocked time, or NULL if the address is not blocked + * (and thus @e ar is non-NULL). + */ + struct GNUNET_SCHEDULER_Task *unblock_task; + + /** + * Set to #GNUNET_YES if the address has expired but we could + * not yet remove it because we still have a valid session. + */ + int expired; + +}; -void _lp_set_prob_name (glp_prob *P, const char *name) -{ -#if HAVE_LIBGLPK - glp_set_prob_name(P, name); -#else - // Function not implemented - GNUNET_break (0); -#endif -} -int _lp_add_cols (glp_prob *P, int ncs) -{ -#if HAVE_LIBGLPK - return glp_add_cols(P, ncs); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0; -} +/** + * Map from peer identities to one or more `struct AddressInfo` values + * for the peer. + */ +static struct GNUNET_CONTAINER_MultiPeerMap *p2a; -int _lp_add_rows (glp_prob *P, int nrs) -{ -#if HAVE_LIBGLPK - return glp_add_rows (P, nrs); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0; -} +/** + * Number of blocked addresses. + */ +static unsigned int num_blocked; -void _lp_set_row_bnds (glp_prob *P, int i, int type, double lb, double ub) +/** + * Closure for #find_ai_cb() and #find_ai_no_session_cb(). + */ +struct FindClosure { -#if HAVE_LIBGLPK - glp_set_row_bnds(P, i , type, lb, ub); -#else - // Function not implemented - GNUNET_break (0); -#endif -} -void _lp_init_smcp (void * parm) -{ -#if HAVE_LIBGLPK - glp_init_smcp(parm); -#else - // Function not implemented - GNUNET_break (0); -#endif -} + /** + * Session to look for (only used if the address is inbound). + */ + struct GNUNET_ATS_Session *session; -void _lp_set_col_name (glp_prob *P, int j, const char *name) -{ -#if HAVE_LIBGLPK - glp_set_col_name (P, j, name); -#else - // Function not implemented - GNUNET_break (0); -#endif -} + /** + * Address to look for. + */ + const struct GNUNET_HELLO_Address *address; -void _lp_set_col_bnds (glp_prob *P, int j, int type, double lb, - double ub) -{ -#if HAVE_LIBGLPK - glp_set_col_bnds(P, j, type, lb, ub); -#else - // Function not implemented - GNUNET_break (0); -#endif -} + /** + * Where to store the result. + */ + struct AddressInfo *ret; -void _lp_set_obj_coef(glp_prob *P, int j, double coef) -{ -#if HAVE_LIBGLPK - glp_set_obj_coef(P, j, coef); -#else - // Function not implemented - GNUNET_break (0); -#endif -} +}; -void _lp_delete_prob (void * P) -{ -#if HAVE_LIBGLPK - glp_delete_prob (P); -#else - // Function not implemented - GNUNET_break (0); -#endif -} -static int _lp_simplex(glp_prob *P, void *parm) -{ -#if HAVE_LIBGLPK - return glp_simplex (P, parm); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0; -} - -static void _lp_load_matrix (glp_prob *P, int ne, const int ia[], - const int ja[], const double ar[]) +/** + * Provide an update on the `p2a` map size to statistics. + * This function should be called whenever the `p2a` map + * is changed. + */ +static void +publish_p2a_stat_update () { -#if HAVE_LIBGLPK - glp_load_matrix(P, ne, ia, ja, ar); -#else - // Function not implemented - GNUNET_break (0); -#endif + GNUNET_STATISTICS_set (GST_stats, + gettext_noop ("# Addresses given to ATS"), + GNUNET_CONTAINER_multipeermap_size (p2a) - num_blocked, + GNUNET_NO); + GNUNET_STATISTICS_set (GST_stats, + "# blocked addresses", + num_blocked, + GNUNET_NO); } -static void _lp_set_mat_row (glp_prob *P, int i, int len, const int ind[], - const double val[]) -{ -#if HAVE_LIBGLPK - glp_set_mat_row (P, i, len, ind, val); -#else - // Function not implemented - GNUNET_break (0); -#endif -} -static int _lp_write_lp (glp_prob *P, const void *parm, const char *fname) -{ -#if HAVE_LIBGLPK - return glp_write_lp ( P, parm, fname); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0; +/** + * Find matching address info. Both the address and the session + * must match; note that expired addresses are still found (as + * the session kind-of keeps those alive). + * + * @param cls the `struct FindClosure` + * @param key which peer is this about + * @param value the `struct AddressInfo` + * @return #GNUNET_YES to continue to iterate, #GNUNET_NO if we found the value + */ +static int +find_ai_cb (void *cls, + const struct GNUNET_PeerIdentity *key, + void *value) +{ + struct FindClosure *fc = cls; + struct AddressInfo *ai = value; + + if ( (0 == + GNUNET_HELLO_address_cmp (fc->address, + ai->address) ) && + (fc->session == ai->session) ) + { + fc->ret = ai; + return GNUNET_NO; + } + return GNUNET_YES; } -static void _lp_init_iocp (void *parm) -{ -#if HAVE_LIBGLPK - glp_init_iocp (parm); -#else - // Function not implemented - GNUNET_break (0); -#endif -} -static int _lp_intopt (glp_prob *P, const void *parm) +/** + * Find the address information struct for the + * given @a address and @a session. + * + * @param address address to look for + * @param session session to match for inbound connections + * @return NULL if this combination is unknown + */ +static struct AddressInfo * +find_ai (const struct GNUNET_HELLO_Address *address, + struct GNUNET_ATS_Session *session) { -#if HAVE_LIBGLPK - return glp_intopt (P, parm); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0; -} + struct FindClosure fc; -static int _lp_get_status (glp_prob *P) -{ -#if HAVE_LIBGLPK - return glp_get_status (P); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0; + fc.address = address; + fc.session = session; + fc.ret = NULL; + GNUNET_CONTAINER_multipeermap_get_multiple (p2a, + &address->peer, + &find_ai_cb, + &fc); + return fc.ret; } -static int _lp_mip_status (glp_prob *P) -{ -#if HAVE_LIBGLPK - return glp_mip_status (P); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0; -} -static void _lp_set_col_kind (glp_prob *P, int j, int kind) -{ -#if HAVE_LIBGLPK - glp_set_col_kind (P, j, kind); -#else - // Function not implemented - GNUNET_break (0); -#endif +/** + * Find matching address info, ignoring sessions and expired + * addresses. + * + * @param cls the `struct FindClosure` + * @param key which peer is this about + * @param value the `struct AddressInfo` + * @return #GNUNET_YES to continue to iterate, #GNUNET_NO if we found the value + */ +static int +find_ai_no_session_cb (void *cls, + const struct GNUNET_PeerIdentity *key, + void *value) +{ + struct FindClosure *fc = cls; + struct AddressInfo *ai = value; + + if (ai->expired) + return GNUNET_YES; /* expired do not count here */ + if (0 == + GNUNET_HELLO_address_cmp (fc->address, + ai->address)) + { + fc->ret = ai; + return GNUNET_NO; + } + return GNUNET_YES; } -static void _lp_free_env (void) -{ -#if HAVE_LIBGLPK - glp_free_env (); -#else - // Function not implemented - GNUNET_break (0); -#endif -} -static const char * _lp_get_col_name ( glp_prob *P, int j) +/** + * Find the address information struct for the + * given address (ignoring sessions) + * + * @param address address to look for + * @return NULL if this combination is unknown + */ +static struct AddressInfo * +find_ai_no_session (const struct GNUNET_HELLO_Address *address) { -#if HAVE_LIBGLPK - return glp_get_col_name (P, j); -#else - // Function not implemented - GNUNET_break (0); -#endif - return NULL; -} + struct FindClosure fc; -static double _lp_mip_obj_val (glp_prob *P) -{ -#if HAVE_LIBGLPK - return glp_mip_obj_val (P); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0.0; + fc.address = address; + fc.session = NULL; + fc.ret = NULL; + GNUNET_CONTAINER_multipeermap_get_multiple (p2a, + &address->peer, + &find_ai_no_session_cb, + &fc); + return fc.ret; } -static double _lp_get_col_prim (glp_prob *P, int j) +/** + * Test if ATS knows about this @a address and @a session. + * Note that even if the address is expired, we return + * #GNUNET_YES if the respective session matches. + * + * @param address the address + * @param session the session + * @return #GNUNET_YES if @a address is known, #GNUNET_NO if not. + */ +int +GST_ats_is_known (const struct GNUNET_HELLO_Address *address, + struct GNUNET_ATS_Session *session) { -#if HAVE_LIBGLPK - return glp_get_col_prim (P , j); -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0.0; + return (NULL != find_ai (address, session)) ? GNUNET_YES : GNUNET_NO; } -static int _lp_print_sol(glp_prob *P, const char *fname) -{ -#if HAVE_LIBGLPK -#else - // Function not implemented - GNUNET_break (0); -#endif - return 0; -} -/* - * Dummy functions for CFLAGS +/** + * Test if ATS knows about this @a address. Note that + * expired addresses do not count. + * + * @param address the address + * @return #GNUNET_YES if @a address is known, #GNUNET_NO if not. */ - -static void _dummy2 (); -static void _dummy () -{ - return; - _lp_get_col_name (NULL, 0); - _lp_mip_obj_val (NULL); - _lp_get_col_prim (NULL, 0); - _lp_set_mat_row(NULL,0,0,NULL,NULL); - _dummy2(); -} - -static void _dummy2 () +int +GST_ats_is_known_no_session (const struct GNUNET_HELLO_Address *address) { - ats_modify_problem_state (NULL, 0); - _dummy(); - int t = ATS_COST_UPDATED + ATS_MODIFIED + ATS_NEW; - t = 0; + return (NULL != find_ai_no_session (address)) + ? GNUNET_YES + : GNUNET_NO; } -/* - * ATS Functions - */ - /** - * Initialize ATS - * @param cfg configuration handle to retrieve configuration (to be removed) - * @return + * The blocking time for an address has expired, allow ATS to + * suggest it again. + * + * @param cls the `struct AddressInfo` of the address to unblock */ - -struct ATS_Handle * ats_init (double D, - double U, - double R, - int v_b_min, - int v_n_min, - int max_iterations, - struct GNUNET_TIME_Relative max_duration, - GNUNET_TRANSPORT_ATS_AddressNotification address_not, - GNUNET_TRANSPORT_ATS_ResultCallback res_cb) +static void +unblock_address (void *cls) { - struct ATS_Handle * ats = NULL; - - ats = GNUNET_malloc(sizeof (struct ATS_Handle)); - - ats->prob = NULL; - - ats->addr_notification = address_not; - ats->result_cb = res_cb; + struct AddressInfo *ai = cls; - ats->max_iterations = max_iterations; - ats->max_exec_duration = max_duration; - - ats->D = D; - ats->U = U; - ats->R = R; - ats->v_b_min = v_b_min; - ats->v_n_min = v_n_min; - ats->dump_min_peers = 0; - ats->dump_min_addr = 0; - ats->dump_overwrite = GNUNET_NO; - ats->mechanisms = NULL; - ats->peers = NULL; - ats->successful_executions = 0; - ats->invalid_executions = 0; - - return ats; + ai->unblock_task = NULL; + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Unblocking address %s of peer %s\n", + GST_plugins_a2s (ai->address), + GNUNET_i2s (&ai->address->peer)); + ai->ar = GNUNET_ATS_address_add (GST_ats, + ai->address, + ai->session, + &ai->properties); + GNUNET_break (NULL != ai->ar); + num_blocked--; + publish_p2a_stat_update (); } -/** solve the bandwidth distribution problem - * @param max_it maximum iterations - * @param max_dur maximum duration in ms - * @param D weight for diversity - * @param U weight for utility - * @param R weight for relativity - * @param v_b_min minimal bandwidth per peer - * @param v_n_min minimum number of connections - * @param stat result struct - * @return GNUNET_SYSERR if glpk is not available, number of mechanisms used +/** + * Temporarily block a valid address for use by ATS for address + * suggestions. This function should be called if an address was + * suggested by ATS but failed to perform (i.e. failure to establish a + * session or to exchange the PING/PONG). + * + * @param address the address to block + * @param session the session (can be NULL) */ -int ats_create_problem (struct ATS_Handle *ats, - struct ATS_internals *stat, - struct ATS_peer *peers, - int c_p, - struct ATS_mechanism *mechanisms, - int c_m) -{ - if ((c_p == 0) || (c_m == 0)) - return GNUNET_SYSERR; - - ats->prob = _lp_create_prob(); - - int c; - int c_c_ressources = available_ressources; - int c_q_metrics = available_quality_metrics; - - double M = VERY_BIG_DOUBLE_VALUE; - double Q[c_q_metrics+1]; - for (c=1; c<=c_q_metrics; c++) - { - Q[c] = 1; - } - - if (ats->v_n_min > c_p) - ats->v_n_min = c_p; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Creating problem with: %i peers, %i mechanisms, %i resource entries, %i quality metrics \n", - c_p, - c_m, - c_c_ressources, - c_q_metrics); -#endif - - int size = 1 + 3 + 10 *c_m + c_p + - (c_q_metrics*c_m)+ c_q_metrics + c_c_ressources * c_m ; - int row_index; - int array_index=1; - int * ia = GNUNET_malloc (size * sizeof (int)); - int * ja = GNUNET_malloc (size * sizeof (int)); - double * ar = GNUNET_malloc(size* sizeof (double)); - - _lp_set_prob_name (ats->prob, "gnunet ats bandwidth distribution"); - _lp_set_obj_dir(ats->prob, GLP_MAX); - - /* adding columns */ - char * name; - _lp_add_cols(ats->prob, 2 * c_m); - /* adding b_t cols */ - for (c=1; c <= c_m; c++) - { - GNUNET_asprintf(&name, - "p_%s_b%i",GNUNET_i2s(&(mechanisms[c].peer->peer)), c); - _lp_set_col_name(ats->prob, c, name); - GNUNET_free (name); - _lp_set_col_bnds(ats->prob, c, GLP_LO, 0.0, 0.0); - _lp_set_col_kind(ats->prob, c, GLP_CV); - _lp_set_obj_coef(ats->prob, c, 0); - } - - /* adding n_t cols */ - for (c=c_m+1; c <= 2*c_m; c++) +void +GST_ats_block_address (const struct GNUNET_HELLO_Address *address, + struct GNUNET_ATS_Session *session) +{ + struct AddressInfo *ai; + + if (0 == + memcmp (&GST_my_identity, + &address->peer, + sizeof (struct GNUNET_PeerIdentity))) + return; /* our own, ignore! */ + ai = find_ai (address, + session); + if (NULL == ai || NULL == ai->ar) { - GNUNET_asprintf(&name, - "p_%s_n%i",GNUNET_i2s(&(mechanisms[c-c_m].peer->peer)),(c-c_m)); - _lp_set_col_name(ats->prob, c, name); - GNUNET_free (name); - _lp_set_col_bnds(ats->prob, c, GLP_DB, 0.0, 1.0); - _lp_set_col_kind(ats->prob, c, GLP_IV); - _lp_set_obj_coef(ats->prob, c, 0); + /* The address is already gone/blocked, this can happen during a blacklist + * callback. */ + return; } - - /* feasibility constraints */ - /* Constraint 1: one address per peer*/ - row_index = 1; - - _lp_add_rows(ats->prob, c_p); - - for (c=1; c<=c_p; c++) + ai->back_off = GNUNET_TIME_STD_BACKOFF (ai->back_off); + if (GNUNET_YES == + GNUNET_HELLO_address_check_option (address, + GNUNET_HELLO_ADDRESS_INFO_INBOUND)) + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Removing address %s of peer %s from use (inbound died)\n", + GST_plugins_a2s (address), + GNUNET_i2s (&address->peer)); + else + LOG (GNUNET_ERROR_TYPE_INFO, + "Blocking address %s of peer %s from use for %s\n", + GST_plugins_a2s (address), + GNUNET_i2s (&address->peer), + GNUNET_STRINGS_relative_time_to_string (ai->back_off, + GNUNET_YES)); + /* destroy session and address */ + if ( (NULL == session) || + (GNUNET_NO == + GNUNET_ATS_address_del_session (ai->ar, + session)) ) { -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", - row_index); -#endif - - _lp_set_row_bnds(ats->prob, row_index, GLP_FX, 1.0, 1.0); - struct ATS_mechanism *m = peers[c].m_head; - while (m!=NULL) - { - ia[array_index] = row_index; - ja[array_index] = (c_m + m->col_index); - ar[array_index] = 1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - m = m->next; - } - row_index++; + GNUNET_ATS_address_destroy (ai->ar); } + /* "ar" has been freed, regardless how the branch + above played out: it was either freed in + #GNUNET_ATS_address_del_session() because it was + incoming, or explicitly in + #GNUNET_ATS_address_del_session(). */ + ai->ar = NULL; - /* Constraint 2: only active mechanism gets bandwidth assigned */ - _lp_add_rows(ats->prob, c_m); - for (c=1; c<=c_m; c++) - { - /* b_t - n_t * M <= 0 */ -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", - row_index); -#endif - _lp_set_row_bnds(ats->prob, row_index, GLP_UP, 0.0, 0.0); - ia[array_index] = row_index; - ja[array_index] = mechanisms[c].col_index; - ar[array_index] = 1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - ia[array_index] = row_index; - ja[array_index] = c_m + mechanisms[c].col_index; - ar[array_index] = -M; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - row_index ++; - } + /* determine when the address should come back to life */ + ai->blocked = GNUNET_TIME_relative_to_absolute (ai->back_off); + ai->unblock_task = GNUNET_SCHEDULER_add_delayed (ai->back_off, + &unblock_address, + ai); + num_blocked++; + publish_p2a_stat_update (); +} - /* Constraint 3: minimum bandwidth*/ - _lp_add_rows(ats->prob, c_m); - for (c=1; c<=c_m; c++) +/** + * Reset address blocking time. Resets the exponential + * back-off timer for this address to zero. Called when + * an address was used to create a successful connection. + * + * @param address the address to reset the blocking timer + * @param session the session (can be NULL) + */ +void +GST_ats_block_reset (const struct GNUNET_HELLO_Address *address, + struct GNUNET_ATS_Session *session) +{ + struct AddressInfo *ai; + + if (0 == + memcmp (&GST_my_identity, + &address->peer, + sizeof (struct GNUNET_PeerIdentity))) + return; /* our own, ignore! */ + ai = find_ai (address, session); + if (NULL == ai) { - /* b_t - n_t * b_min <= 0 */ -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", - row_index); -#endif -#if HAVE_LIBGLPK - _lp_set_row_bnds(ats->prob, row_index, GLP_LO, 0.0, 0.0); -#endif - ia[array_index] = row_index; - ja[array_index] = mechanisms[c].col_index; - ar[array_index] = 1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - ia[array_index] = row_index; - ja[array_index] = c_m + mechanisms[c].col_index; - ar[array_index] = -ats->v_b_min; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - row_index ++; + GNUNET_break (0); + return; } - int c2; - - /* Constraint 4: max ressource capacity */ - /* V cr: bt * ct_r <= cr_max - * */ + /* address is in successful use, so it should not be blocked right now */ + GNUNET_break (NULL == ai->unblock_task); + ai->back_off = GNUNET_TIME_UNIT_ZERO; +} - _lp_add_rows(ats->prob, available_ressources); - double ct_max = VERY_BIG_DOUBLE_VALUE; - double ct_min = 0.0; +/** + * Notify ATS about a new inbound @a address. The @a address in + * combination with the @a session must be new, but this function will + * perform a santiy check. If the @a address is indeed new, make it + * available to ATS. + * + * @param address the address + * @param session the session + * @param prop performance information + */ +void +GST_ats_add_inbound_address (const struct GNUNET_HELLO_Address *address, + struct GNUNET_ATS_Session *session, + const struct GNUNET_ATS_Properties *prop) +{ + struct GNUNET_ATS_AddressRecord *ar; + struct AddressInfo *ai; - stat->begin_cr = array_index; + if (0 == + memcmp (&GST_my_identity, + &address->peer, + sizeof (struct GNUNET_PeerIdentity))) + return; /* our own, ignore! */ - for (c=0; ctransport_name) { - ct_max = ressources[c].c_max; - ct_min = ressources[c].c_min; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] %f..%f\n", - row_index, - ct_min, - ct_max); -#endif -#if HAVE_LIBGLPK - _lp_set_row_bnds(ats->prob, row_index, GLP_DB, ct_min, ct_max); -#endif - for (c2=1; c2<=c_m; c2++) - { - double value = 0; - ia[array_index] = row_index; - ja[array_index] = c2; - value = mechanisms[c2].ressources[c].c; - ar[array_index] = value; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - } - row_index ++; + GNUNET_break(0); + return; } - stat->end_cr = array_index--; - - /* Constraint 5: min number of connections*/ - _lp_add_rows(ats->prob, 1); - - for (c=1; c<=c_m; c++) + GNUNET_break (GNUNET_ATS_NET_UNSPECIFIED != prop->scope); + GNUNET_assert (GNUNET_YES == + GNUNET_HELLO_address_check_option (address, + GNUNET_HELLO_ADDRESS_INFO_INBOUND)); + GNUNET_assert (NULL != session); + ai = find_ai (address, session); + if (NULL != ai) { - // b_t - n_t * b_min >= 0 -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", - row_index); -#endif - _lp_set_row_bnds(ats->prob, row_index, GLP_LO, ats->v_n_min, 0.0); - ia[array_index] = row_index; - ja[array_index] = c_m + mechanisms[c].col_index; - ar[array_index] = 1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; + /* This should only be called for new sessions, and thus + we should not already have the address */ + GNUNET_break (0); + return; } - row_index ++; - - // optimisation constraints - - // adding columns - - // Constraint 6: optimize for diversity - int col_d; - col_d = _lp_add_cols(ats->prob, 1); + /* Is indeed new, let's tell ATS */ + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Notifying ATS about peer `%s''s new inbound address `%s' session %p in network %s\n", + GNUNET_i2s (&address->peer), + GST_plugins_a2s (address), + session, + GNUNET_ATS_print_network_type (prop->scope)); + ar = GNUNET_ATS_address_add (GST_ats, + address, + session, + prop); + GNUNET_assert (NULL != ar); + ai = GNUNET_new (struct AddressInfo); + ai->address = GNUNET_HELLO_address_copy (address); + ai->session = session; + ai->properties = *prop; + ai->ar = ar; + (void) GNUNET_CONTAINER_multipeermap_put (p2a, + &ai->address->peer, + ai, + GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE); + publish_p2a_stat_update (); +} - _lp_set_col_name(ats->prob, col_d, "d"); - _lp_set_obj_coef(ats->prob, col_d, ats->D); - _lp_set_col_bnds(ats->prob, col_d, GLP_LO, 0.0, 0.0); - _lp_add_rows(ats->prob, 1); - _lp_set_row_bnds(ats->prob, row_index, GLP_FX, 0.0, 0.0); - stat->col_d = col_d; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n",row_index); -#endif - for (c=1; c<=c_m; c++) - { - ia[array_index] = row_index; - ja[array_index] = c_m + mechanisms[c].col_index; - ar[array_index] = 1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - } - ia[array_index] = row_index; - ja[array_index] = col_d; - ar[array_index] = -1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - row_index ++; - - // Constraint 7: optimize for quality - int col_qm; - col_qm = _lp_add_cols(ats->prob, c_q_metrics); - - stat->col_qm = col_qm; - //GNUNET_assert (col_qm == (2*c_mechs) + 3 + 1); - for (c=0; c< c_q_metrics; c++) +/** + * Notify ATS about the new address including the network this address is + * located in. The address must NOT be inbound and must be new to ATS. + * + * @param address the address + * @param prop performance information + */ +void +GST_ats_add_address (const struct GNUNET_HELLO_Address *address, + const struct GNUNET_ATS_Properties *prop) +{ + struct GNUNET_ATS_AddressRecord *ar; + struct AddressInfo *ai; + + if (0 == + memcmp (&GST_my_identity, + &address->peer, + sizeof (struct GNUNET_PeerIdentity))) + return; /* our own, ignore! */ + /* validadte address */ + if (NULL == address->transport_name) { - GNUNET_asprintf(&name, "Q_%s",qm[c].name); - _lp_set_col_name (ats->prob, col_qm + c, name); - _lp_set_col_bnds (ats->prob, col_qm + c, GLP_LO, 0.0, 0.0); - GNUNET_free (name); - _lp_set_obj_coef (ats->prob, col_qm + c, Q[c]); + GNUNET_break(0); + return; } + GNUNET_assert (GNUNET_YES != + GNUNET_HELLO_address_check_option (address, + GNUNET_HELLO_ADDRESS_INFO_INBOUND)); + ai = find_ai_no_session (address); + GNUNET_assert (NULL == ai); + GNUNET_break (GNUNET_ATS_NET_UNSPECIFIED != prop->scope); + + /* address seems sane, let's tell ATS */ + LOG (GNUNET_ERROR_TYPE_INFO, + "Notifying ATS about peer %s's new address `%s'\n", + GNUNET_i2s (&address->peer), + GST_plugins_a2s (address)); + ar = GNUNET_ATS_address_add (GST_ats, + address, + NULL, + prop); + GNUNET_assert (NULL != ar); + ai = GNUNET_new (struct AddressInfo); + ai->address = GNUNET_HELLO_address_copy (address); + ai->ar = ar; + ai->properties = *prop; + (void) GNUNET_CONTAINER_multipeermap_put (p2a, + &ai->address->peer, + ai, + GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE); + publish_p2a_stat_update (); +} - _lp_add_rows(ats->prob, available_quality_metrics); - stat->begin_qm = row_index; - for (c=1; c <= c_q_metrics; c++) - { -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", - row_index); -#endif - double value = 1; - _lp_set_row_bnds(ats->prob, row_index, GLP_FX, 0.0, 0.0); - for (c2=1; c2<=c_m; c2++) - { - ia[array_index] = row_index; - ja[array_index] = c2; - if (qm[c-1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DELAY) - { - double v0 = 0, v1 = 0, v2 = 0; - v0 = mechanisms[c2].quality[c-1].values[0]; - if (v1 < 1) v0 = 0.1; - v1 = mechanisms[c2].quality[c-1].values[1]; - if (v1 < 1) v0 = 0.1; - v2 = mechanisms[c2].quality[c-1].values[2]; - if (v1 < 1) v0 = 0.1; - value = 100.0 / ((v0 + 2 * v1 + 3 * v2) / 6.0); - value = 1; - } - if (qm[c-1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DISTANCE) - { - double v0 = 0, v1 = 0, v2 = 0; - v0 = mechanisms[c2].quality[c-1].values[0]; - if (v0 < 1) v0 = 1; - v1 = mechanisms[c2].quality[c-1].values[1]; - if (v1 < 1) v1 = 1; - v2 = mechanisms[c2].quality[c-1].values[2]; - if (v2 < 1) v2 = 1; - value = (v0 + 2 * v1 + 3 * v2) / 6.0; - if (value >= 1) - value = (double) 10 / value; - else - value = 10; - } - ar[array_index] = (mechanisms[c2].peer->f) * value ; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: %s [%i,%i]=%f \n", - array_index, - qm[c-1].name, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - } - ia[array_index] = row_index; - ja[array_index] = col_qm + c - 1; - ar[array_index] = -1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - row_index++; - } - stat->end_qm = row_index-1; - - // Constraint 8: optimize bandwidth utility - int col_u; - - col_u = _lp_add_cols(ats->prob, 1); - - _lp_set_col_name(ats->prob, col_u, "u"); - _lp_set_obj_coef(ats->prob, col_u, ats->U); - _lp_set_col_bnds(ats->prob, col_u, GLP_LO, 0.0, 0.0); - _lp_add_rows(ats->prob, 1); - stat->col_u = col_u; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n",row_index); -#endif - _lp_set_row_bnds(ats->prob, row_index, GLP_FX, 0.0, 0.0); - for (c=1; c<=c_m; c++) - { - ia[array_index] = row_index; - ja[array_index] = c; - ar[array_index] = mechanisms[c].peer->f; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - } - ia[array_index] = row_index; - ja[array_index] = col_u; - ar[array_index] = -1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, ia[array_index], - ja[array_index], - ar[array_index]); -#endif - - array_index++; - row_index ++; - - // Constraint 9: optimize relativity - int col_r; - - col_r = _lp_add_cols(ats->prob, 1); - - _lp_set_col_name(ats->prob, col_r, "r"); - _lp_set_obj_coef(ats->prob, col_r, ats->R); - _lp_set_col_bnds(ats->prob, col_r, GLP_LO, 0.0, 0.0); - _lp_add_rows(ats->prob, c_p); - - stat->col_r = col_r; - for (c=1; c<=c_p; c++) +/** + * Notify ATS about a new @a session now existing for the given + * @a address. Essentially, an outbound @a address was used + * to establish a @a session. It is safe to call this function + * repeatedly for the same @a address and @a session pair. + * + * @param address the address + * @param session the session + */ +void +GST_ats_new_session (const struct GNUNET_HELLO_Address *address, + struct GNUNET_ATS_Session *session) +{ + struct AddressInfo *ai; + + if (0 == + memcmp (&GST_my_identity, + &address->peer, + sizeof (struct GNUNET_PeerIdentity))) + return; /* our own, ignore! */ + ai = find_ai (address, NULL); + if (NULL == ai) { - _lp_set_row_bnds(ats->prob, row_index, GLP_LO, 0.0, 0.0); - struct ATS_mechanism *m = peers[c].m_head; - while (m!=NULL) - { - ia[array_index] = row_index; - ja[array_index] = m->col_index; - ar[array_index] = 1 / mechanisms[c].peer->f; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - m = m->next; - } - ia[array_index] = row_index; - ja[array_index] = col_r; - ar[array_index] = -1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - ia[array_index], - ja[array_index], - ar[array_index]); -#endif - array_index++; - row_index++; + /* We may simply already be aware of the session, even if some + other part of the code could not tell if it just created a new + session or just got one recycled from the plugin; hence, we may + be called with "new" session even for an "old" session; in that + case, check that this is the case, but just ignore it. */ + GNUNET_assert (NULL != (find_ai (address, session))); + return; } - - /* Loading the matrix */ - _lp_load_matrix(ats->prob, array_index-1, ia, ja, ar); - - stat->c_mechs = c_m; - stat->c_peers = c_p; - stat->solution = 0; - stat->valid = GNUNET_YES; - - /* clean up */ - GNUNET_free (ja); - GNUNET_free (ia); - GNUNET_free (ar); - - return GNUNET_OK; + GNUNET_assert (NULL == ai->session); + ai->session = session; + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Telling ATS about new session for peer %s\n", + GNUNET_i2s (&address->peer)); + /* Note that the address might currently be blocked; we only + tell ATS about the session if the address is currently not + blocked; otherwise, ATS will be told about the session on + unblock. */ + if (NULL != ai->ar) + GNUNET_ATS_address_add_session (ai->ar, + session); + else + GNUNET_assert (NULL != ai->unblock_task); } -void ats_delete_problem (struct ATS_Handle * ats) +/** + * Release memory used by the given address data. + * + * @param ai the `struct AddressInfo` + */ +static void +destroy_ai (struct AddressInfo *ai) { -#if DEBUG_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Deleting problem\n"); -#endif - int c; - - for (c=0; c< (ats->internal).c_mechs; c++) - GNUNET_free_non_null (ats->mechanisms[c].rc); - if (ats->mechanisms!=NULL) + GNUNET_assert (NULL == ai->session); + if (NULL != ai->unblock_task) { - GNUNET_free(ats->mechanisms); - ats->mechanisms = NULL; + GNUNET_SCHEDULER_cancel (ai->unblock_task); + ai->unblock_task = NULL; + num_blocked--; } - - if (ats->peers!=NULL) - { - GNUNET_free(ats->peers); - ats->peers = NULL; - } - - if (ats->prob != NULL) + GNUNET_assert (GNUNET_YES == + GNUNET_CONTAINER_multipeermap_remove (p2a, + &ai->address->peer, + ai)); + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Telling ATS to destroy address from peer %s\n", + GNUNET_i2s (&ai->address->peer)); + if (NULL != ai->ar) { - _lp_delete_prob(ats->prob); - ats->prob = NULL; + GNUNET_ATS_address_destroy (ai->ar); + ai->ar = NULL; } - - ats->internal.begin_cr = GNUNET_SYSERR; - ats->internal.begin_qm = GNUNET_SYSERR; - ats->internal.c_mechs = 0; - ats->internal.c_peers = 0; - ats->internal.end_cr = GNUNET_SYSERR; - ats->internal.end_qm = GNUNET_SYSERR; - ats->internal.solution = GNUNET_SYSERR; - ats->internal.valid = GNUNET_SYSERR; + publish_p2a_stat_update (); + GNUNET_HELLO_address_free (ai->address); + GNUNET_free (ai); } -void ats_modify_problem_state (struct ATS_Handle * ats, enum ATS_problem_state s) -{ - if (ats == NULL) - return; - switch (s) - { - case ATS_NEW : - ats->internal.recreate_problem = GNUNET_NO; - ats->internal.modified_quality = GNUNET_NO; - ats->internal.modified_resources = GNUNET_NO; - break; - case ATS_MODIFIED: - ats->internal.recreate_problem = GNUNET_YES; - break; - case ATS_QUALITY_UPDATED : - ats->internal.modified_quality = GNUNET_YES; - break; - case ATS_COST_UPDATED : - ats->internal.modified_resources = GNUNET_YES; - break; - case ATS_QUALITY_COST_UPDATED: - ats->internal.modified_resources = GNUNET_YES; - ats->internal.modified_quality = GNUNET_YES; - break; - default: - return; - } - - - -} -void ats_solve_problem (struct ATS_Handle * ats, - unsigned int max_it, - unsigned int max_dur, - unsigned int c_peers, - unsigned int c_mechs, - struct ATS_internals *stat) +/** + * Notify ATS that the @a session (but not the @a address) of + * a given @a address is no longer relevant. (The @a session + * went down.) This function may be called even if for the + * respective outbound address #GST_ats_new_session() was + * never called and thus the pair is unknown to ATS. In this + * case, the call is simply ignored. + * + * @param address the address + * @param session the session + */ +void +GST_ats_del_session (const struct GNUNET_HELLO_Address *address, + struct GNUNET_ATS_Session *session) { - int result = GNUNET_SYSERR; - int lp_solution = GNUNET_SYSERR; - int mlp_solution = GNUNET_SYSERR; - - // Solving simplex - - glp_smcp opt_lp; - _lp_init_smcp(&opt_lp); -#if VERBOSE_ATS - opt_lp.msg_lev = GLP_MSG_ALL; -#else - opt_lp.msg_lev = GLP_MSG_OFF; -#endif - // setting iteration limit - opt_lp.it_lim = max_it; - // maximum duration - opt_lp.tm_lim = max_dur; - - if (ats->internal.recreate_problem == GNUNET_YES) - opt_lp.presolve = GLP_ON; - - result = _lp_simplex(ats->prob, &opt_lp); - lp_solution = _lp_get_status (ats->prob); - - if ((result == GLP_ETMLIM) || (result == GLP_EITLIM)) + struct AddressInfo *ai; + + if (0 == + memcmp (&GST_my_identity, + &address->peer, + sizeof (struct GNUNET_PeerIdentity))) + return; /* our own, ignore! */ + if (NULL == session) { - ats->internal.valid = GNUNET_NO; - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, - "ATS exceeded time or iteration limit!\n"); + GNUNET_break (0); return; } - - if (ats_evaluate_results(result, lp_solution, "LP") == GNUNET_YES) + ai = find_ai (address, + session); + if (NULL == ai) { - stat->valid = GNUNET_YES; + /* We sometimes create sessions just for sending a PING, + and if those are destroyed they were never known to + ATS which means we end up here (however, in this + case, the address must be an outbound address). */ + GNUNET_break (GNUNET_YES != + GNUNET_HELLO_address_check_option (address, + GNUNET_HELLO_ADDRESS_INFO_INBOUND)); + return; } - else + GNUNET_assert (session == ai->session); + ai->session = NULL; + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Telling ATS to destroy session %p from peer %s\n", + session, + GNUNET_i2s (&address->peer)); + if (GNUNET_YES == ai->expired) { - ats->internal.simplex_rerun_required = GNUNET_YES; - opt_lp.presolve = GLP_ON; - result = _lp_simplex(ats->prob, &opt_lp); - lp_solution = _lp_get_status (ats->prob); - - // TODO: Remove if this does not appear until release - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "" - "EXECUTED SIMPLEX WITH PRESOLVER! %i \n", - lp_solution); - - if (ats_evaluate_results(result, lp_solution, "LP") != GNUNET_YES) + /* last reason to keep this 'ai' around is now gone, the + session is dead as well, clean up */ + if (NULL != ai->ar) { - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, - "After execution simplex with presolver: STILL INVALID!\n"); - char * filename; - GNUNET_asprintf (&filename, - "ats_mlp_p%i_m%i_%llu.mlp", - ats->internal.c_peers, - ats->internal.c_mechs, - GNUNET_TIME_absolute_get().abs_value); - _lp_write_lp ((void *)ats->prob, NULL, filename); - GNUNET_free (filename); - stat->valid = GNUNET_NO; - ats->internal.recreate_problem = GNUNET_YES; - return; + /* Address expired but not blocked, and thus 'ar' was still + live because of the session; deleting just the session + will do for an inbound session, but for an outbound we + then also need to destroy the address with ATS. */ + if (GNUNET_NO == + GNUNET_ATS_address_del_session (ai->ar, + session)) + { + GNUNET_ATS_address_destroy (ai->ar); + } + /* "ar" has been freed, regardless how the branch + above played out: it was either freed in + #GNUNET_ATS_address_del_session() because it was + incoming, or explicitly in + #GNUNET_ATS_address_del_session(). */ + ai->ar = NULL; } - stat->valid = GNUNET_YES; + destroy_ai (ai); + return; } - // Solving mlp - glp_iocp opt_mlp; - _lp_init_iocp(&opt_mlp); - // maximum duration - opt_mlp.tm_lim = max_dur; - // output level -#if VERBOSE_ATS - opt_mlp.msg_lev = GLP_MSG_ALL; -#else - opt_mlp.msg_lev = GLP_MSG_OFF; -#endif - - result = _lp_intopt (ats->prob, &opt_mlp); - mlp_solution = _lp_mip_status (ats->prob); - stat->solution = mlp_solution; - - if (ats_evaluate_results(result, mlp_solution, "MLP") == GNUNET_YES) + if (NULL == ai->ar) { - stat->valid = GNUNET_YES; - } - else - { - // TODO: Remove if this does not appear until release - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, - "MLP solution for %i peers, %i mechs is invalid: %i\n", - ats->internal.c_peers, - ats->internal.c_mechs, - mlp_solution); - stat->valid = GNUNET_NO; + /* If ATS doesn't know about the address/session, this means + this address was blocked. */ + if (GNUNET_YES == + GNUNET_HELLO_address_check_option (address, + GNUNET_HELLO_ADDRESS_INFO_INBOUND)) + { + /* This was a blocked inbound session, which now lost the + session. But inbound addresses are by themselves useless, + so we must forget about the address as well. */ + destroy_ai (ai); + return; + } + /* Otherwise, we are done as we have set `ai->session` to NULL + already and ATS will simply not be told about the session when + the connection is unblocked and the outbound address becomes + available again. . */ + return; } -#if VERBOSE_ATS - if (_lp_get_col_prim(ats->prob,2*c_mechs+1) != 1) - { - int c; - for (c=1; c<= available_quality_metrics; c++ ) + /* This is the "simple" case where ATS knows about the session and + the address is neither blocked nor expired. Delete the session, + and if it was inbound, free the address as well. */ + if (GNUNET_YES == + GNUNET_ATS_address_del_session (ai->ar, + session)) { - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n", - _lp_get_col_name(ats->prob,2*c_mechs+3+c), - _lp_get_col_prim(ats->prob,2*c_mechs+3+c)); + /* This was an inbound address, the session is now gone, so we + need to also forget about the address itself. */ + ai->ar = NULL; + destroy_ai (ai); } - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n", - _lp_get_col_name(ats->prob,2*c_mechs+1), - _lp_get_col_prim(ats->prob,2*c_mechs+1)); - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n", - _lp_get_col_name(ats->prob,2*c_mechs+2), - _lp_get_col_prim(ats->prob,2*c_mechs+2)); - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n", - _lp_get_col_name(ats->prob,2*c_mechs+3), - _lp_get_col_prim(ats->prob,2*c_mechs+3)); - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "objective value: %f\n", - _lp_mip_obj_val(ats->prob)); - } -#endif } -void ats_shutdown (struct ATS_Handle * ats) +/** + * Notify ATS about DV @a distance change to an @a address. + * Does nothing if the @a address is not known to us. + * + * @param address the address + * @param distance new distance value + */ +void +GST_ats_update_distance (const struct GNUNET_HELLO_Address *address, + uint32_t distance) { -#if DEBUG_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "ATS shutdown\n"); -#endif - ats_delete_problem (ats); - _lp_free_env(); + struct AddressInfo *ai; - GNUNET_free (ats); + ai = find_ai_no_session (address); + if (NULL == ai) + { + /* We do not know about this address, do nothing. */ + return; + } + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Updated distance for peer `%s' to %u\n", + GNUNET_i2s (&address->peer), + distance); + ai->properties.distance = distance; + /* Give manipulation its chance to change metrics */ + GST_manipulation_manipulate_metrics (address, + ai->session, + &ai->properties); + /* Address may be blocked, only give ATS if address is + currently active. */ + if (NULL != ai->ar) + GNUNET_ATS_address_update (ai->ar, + &ai->properties); } -void ats_update_problem_qm (struct ATS_Handle * ats) + +/** + * Notify ATS about @a delay changes to properties of an @a address. + * Does nothing if the @a address is not known to us. + * + * @param address the address + * @param delay new delay value + */ +void +GST_ats_update_delay (const struct GNUNET_HELLO_Address *address, + struct GNUNET_TIME_Relative delay) { - int array_index; - int row_index; - int c, c2; - int c_q_metrics = available_quality_metrics; - - int *ja = GNUNET_malloc ((1 + ats->internal.c_mechs*2 + 3 + - available_quality_metrics) * sizeof (int)); - double *ar = GNUNET_malloc ((1 + ats->internal.c_mechs*2 + 3 + - available_quality_metrics) * sizeof (double)); -#if DEBUG_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Updating problem quality metrics\n"); -#endif - row_index = ats->internal.begin_qm; - - for (c=1; c <= c_q_metrics; c++) - { - array_index = 1; - double value = 1; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n",row_index); -#endif - _lp_set_row_bnds(ats->prob, row_index, GLP_FX, 0.0, 0.0); - for (c2=1; c2<=ats->internal.c_mechs; c2++) - { - ja[array_index] = c2; - GNUNET_assert (ats->mechanisms[c2].addr != NULL); - GNUNET_assert (ats->mechanisms[c2].peer != NULL); - - if (qm[c-1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DELAY) - { - double v0 = 0, v1 = 0, v2 = 0; - - v0 = ats->mechanisms[c2].quality[c-1].values[0]; - if (v1 < 1) v0 = 0.1; - v1 = ats->mechanisms[c2].quality[c-1].values[1]; - if (v1 < 1) v0 = 0.1; - v2 = ats->mechanisms[c2].quality[c-1].values[2]; - if (v1 < 1) v0 = 0.1; - value = 100.0 / ((v0 + 2 * v1 + 3 * v2) / 6.0); - //value = 1; - } - if (qm[c-1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DISTANCE) - { - double v0 = 0, v1 = 0, v2 = 0; - v0 = ats->mechanisms[c2].quality[c-1].values[0]; - if (v0 < 1) v0 = 1; - v1 = ats->mechanisms[c2].quality[c-1].values[1]; - if (v1 < 1) v1 = 1; - v2 = ats->mechanisms[c2].quality[c-1].values[2]; - if (v2 < 1) v2 = 1; - value = (v0 + 2 * v1 + 3 * v2) / 6.0; - if (value >= 1) - value = (double) 10 / value; - else - value = 10; - } - ar[array_index] = (ats->mechanisms[c2].peer->f) * value; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: %s [%i,%i]=%f \n", - array_index, - qm[c-1].name, - row_index, - ja[array_index], - ar[array_index]); -#endif - array_index++; - } - ja[array_index] = ats->internal.col_qm + c - 1; - ar[array_index] = -1; - -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - row_index, - ja[array_index], - ar[array_index]); -#endif - _lp_set_mat_row (ats->prob, row_index, array_index, ja, ar); - array_index = 1; - row_index++; - } - GNUNET_free_non_null (ja); - GNUNET_free_non_null (ar); + struct AddressInfo *ai; + ai = find_ai_no_session (address); + if (NULL == ai) + { + /* We do not know about this address, do nothing. */ + return; + } + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Updated latency for peer `%s' to %s\n", + GNUNET_i2s (&address->peer), + GNUNET_STRINGS_relative_time_to_string (delay, + GNUNET_YES)); + ai->properties.delay = delay; + /* Give manipulation its chance to change metrics */ + GST_manipulation_manipulate_metrics (address, + ai->session, + &ai->properties); + /* Address may be blocked, only give ATS if address is + currently active. */ + if (NULL != ai->ar) + GNUNET_ATS_address_update (ai->ar, + &ai->properties); } +/** + * Notify ATS about utilization changes to an @a address. + * Does nothing if the @a address is not known to us. + * + * @param address our information about the address + * @param bps_in new utilization inbound + * @param bps_out new utilization outbound + */ void -ats_calculate_bandwidth_distribution (struct ATS_Handle * ats, - struct GNUNET_STATISTICS_Handle *stats) +GST_ats_update_utilization (const struct GNUNET_HELLO_Address *address, + uint32_t bps_in, + uint32_t bps_out) { - struct GNUNET_TIME_Absolute start; - struct GNUNET_TIME_Relative creation; - struct GNUNET_TIME_Relative solving; - int c_m; - int c_p; - char *text = "unmodified"; - -#if FIXME_WACHS - int dur; - if (INT_MAX < ats->max_exec_duration.rel_value) - dur = INT_MAX; - else - dur = (int) ats->max_exec_duration.rel_value; -#endif - - ats->internal.simplex_rerun_required = GNUNET_NO; - start = GNUNET_TIME_absolute_get(); - if ((ats->internal.recreate_problem == GNUNET_YES) || - (ats->prob==NULL) || - (ats->internal.valid == GNUNET_NO)) - { - text = "new"; - ats->internal.recreate_problem = GNUNET_YES; - ats_delete_problem (ats); - ats->addr_notification(&ats->peers , &c_p, &ats->mechanisms, &c_m); -#if DEBUG_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, - "Service returned: %i peer, %i mechs\n", - c_p, - c_m); -#endif - ats_create_problem (ats, &ats->internal, ats->peers, c_p, ats->mechanisms, c_m); - - -#if DEBUG_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, - "Peers/Addresses were modified... new problem: %i peer, %i mechs\n", - ats->internal.c_peers, - ats->internal.c_mechs); -#endif - } - - else if ((ats->internal.recreate_problem == GNUNET_NO) && - (ats->internal.modified_resources == GNUNET_YES) && - (ats->internal.valid == GNUNET_YES)) - { - text = "modified resources"; - ats_update_problem_cr (ats); - } - else if ((ats->internal.recreate_problem == GNUNET_NO) && - (ats->internal.modified_quality == GNUNET_YES) && - (ats->internal.valid == GNUNET_YES)) - { - text = "modified quality"; - ats_update_problem_qm (ats); - //ats_update_problem_qm_TEST (); - } -#if DEBUG_ATS - else GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Problem is %s\n", text); -#endif - - creation = GNUNET_TIME_absolute_get_difference(start,GNUNET_TIME_absolute_get()); - start = GNUNET_TIME_absolute_get(); - - ats->internal.solution = GLP_UNDEF; - if (ats->internal.valid == GNUNET_YES) - { - ats_solve_problem(ats, - ats->max_iterations, - ats->max_exec_duration.rel_value, - ats->internal.c_peers, - ats->internal.c_mechs, - &ats->internal); - } - solving = GNUNET_TIME_absolute_get_difference(start,GNUNET_TIME_absolute_get()); - - if (ats->internal.valid == GNUNET_YES) - { - /* Telling about new distribution*/ - ats->result_cb (); - - int msg_type = GNUNET_ERROR_TYPE_DEBUG; -#if DEBUG_ATS - msg_type = GNUNET_ERROR_TYPE_ERROR; -#endif - GNUNET_log (msg_type, - "MLP %s: creation time: %llu, execution time: %llu, %i peers, %i mechanisms, simplex rerun: %s, solution %s\n", - text, - creation.rel_value, - solving.rel_value, - ats->internal.c_peers, - ats->internal.c_mechs, - (ats->internal.simplex_rerun_required == GNUNET_NO) ? "NO" : "YES", - (ats->internal.solution == 5) ? "OPTIMAL" : "INVALID"); - ats->successful_executions ++; - GNUNET_STATISTICS_set (stats, "# ATS successful executions", - ats->successful_executions, - GNUNET_NO); - - if ((ats->internal.recreate_problem == GNUNET_YES) || (ats->prob==NULL)) - GNUNET_STATISTICS_set (stats, "ATS state",ATS_NEW, GNUNET_NO); - else if ((ats->internal.modified_resources == GNUNET_YES) && - (ats->internal.modified_quality == GNUNET_NO)) - GNUNET_STATISTICS_set (stats, "ATS state", ATS_COST_UPDATED, GNUNET_NO); - else if ((ats->internal.modified_resources == GNUNET_NO) && - (ats->internal.modified_quality == GNUNET_YES) && - (ats->internal.simplex_rerun_required == GNUNET_NO)) - GNUNET_STATISTICS_set (stats, "ATS state", ATS_QUALITY_UPDATED, GNUNET_NO); - else if ((ats->internal.modified_resources == GNUNET_YES) && - (ats->internal.modified_quality == GNUNET_YES) && - (ats->internal.simplex_rerun_required == GNUNET_NO)) - GNUNET_STATISTICS_set (stats, "ATS state", ATS_QUALITY_COST_UPDATED, GNUNET_NO); - else if (ats->internal.simplex_rerun_required == GNUNET_NO) - GNUNET_STATISTICS_set (stats, "ATS state", ATS_UNMODIFIED, GNUNET_NO); - } - else - { - if (ats->internal.c_peers != 0) - { - ats->invalid_executions ++; - GNUNET_STATISTICS_set (stats, "# ATS invalid executions", - ats->invalid_executions, GNUNET_NO); - } - else - { - GNUNET_STATISTICS_set (stats, "# ATS successful executions", - ats->successful_executions, GNUNET_NO); - } - } - - GNUNET_STATISTICS_set (stats, - "ATS duration", solving.rel_value + creation.rel_value, GNUNET_NO); - GNUNET_STATISTICS_set (stats, - "ATS mechanisms", ats->internal.c_mechs, GNUNET_NO); - GNUNET_STATISTICS_set (stats, - "ATS peers", ats->internal.c_peers, GNUNET_NO); - GNUNET_STATISTICS_set (stats, - "ATS solution", ats->internal.solution, GNUNET_NO); - GNUNET_STATISTICS_set (stats, - "ATS timestamp", start.abs_value, GNUNET_NO); - - if ((ats->save_mlp == GNUNET_YES) && - (ats->internal.c_mechs >= ats->dump_min_peers) && - (ats->internal.c_mechs >= ats->dump_min_addr)) - { - char * filename; - if (ats->dump_overwrite == GNUNET_NO) - { - GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i_%s_%llu.mlp", - ats->internal.c_peers, - ats->internal.c_mechs, - text, - GNUNET_TIME_absolute_get().abs_value); - _lp_write_lp ((void *) ats->prob, NULL, filename); - } - else - { - GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i.mlp", - ats->internal.c_peers, ats->internal.c_mechs ); - _lp_write_lp ((void *) ats->prob, NULL, filename); - } - GNUNET_free (filename); - } - if ((ats->save_solution == GNUNET_YES) && - (ats->internal.c_mechs >= ats->dump_min_peers) && - (ats->internal.c_mechs >= ats->dump_min_addr)) - { - char * filename; - if (ats->dump_overwrite == GNUNET_NO) - { - GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i_%s_%llu.sol", - ats->internal.c_peers, - ats->internal.c_mechs, - text, - GNUNET_TIME_absolute_get().abs_value); - _lp_print_sol (ats->prob, filename); - } - else - { - GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i.sol", - ats->internal.c_peers, ats->internal.c_mechs); - _lp_print_sol (ats->prob, filename); - } - GNUNET_free (filename); - } + struct AddressInfo *ai; - ats->internal.recreate_problem = GNUNET_NO; - ats->internal.modified_resources = GNUNET_NO; - ats->internal.modified_quality = GNUNET_NO; + ai = find_ai_no_session (address); + if (NULL == ai) + { + /* We do not know about this address, do nothing. */ + return; + } + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Updating utilization for peer `%s' address %s: %u/%u\n", + GNUNET_i2s (&address->peer), + GST_plugins_a2s (address), + (unsigned int) bps_in, + (unsigned int) bps_out); + ai->properties.utilization_in = bps_in; + ai->properties.utilization_out = bps_out; + /* Give manipulation its chance to change metrics */ + GST_manipulation_manipulate_metrics (address, + ai->session, + &ai->properties); + /* Address may be blocked, only give ATS if address is + currently active. */ + if (NULL != ai->ar) + GNUNET_ATS_address_update (ai->ar, + &ai->properties); } + /** - * Evaluate the result of the last simplex or mlp solving - * @param result return value returned by the solver - * @param solution solution state - * @param problem mlp or lp - * @return GNUNET_NO if solution is invalid, GNUNET_YES if solution is - * valid + * Notify ATS that the address has expired and thus cannot + * be used any longer. This function must only be called + * if the corresponding session is already gone. + * + * @param address the address */ - -int ats_evaluate_results (int result, int solution, char * problem) -{ - int cont = GNUNET_NO; -#if DEBUG_ATS || VERBOSE_ATS - int error_kind = GNUNET_ERROR_TYPE_DEBUG; -#endif -#if VERBOSE_ATS - error_kind = GNUNET_ERROR_TYPE_ERROR; -#endif - switch (result) { - case GNUNET_SYSERR : /* GNUNET problem, not GLPK related */ -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, - "%s, GLPK solving not executed\n", problem); -#endif - break; - case GLP_ESTOP : /* search terminated by application */ -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, - "%s , Search terminated by application\n", problem); -#endif - break; - case GLP_EITLIM : /* iteration limit exceeded */ -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_WARNING, - "%s Iteration limit exceeded\n", problem); -#endif - break; - case GLP_ETMLIM : /* time limit exceeded */ -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_WARNING, - "%s Time limit exceeded\n", problem); -#endif - break; - case GLP_ENOPFS : /* no primal feasible solution */ - case GLP_ENODFS : /* no dual feasible solution */ -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, - "%s No feasible solution\n", problem); -#endif - break; - case GLP_EBADB : /* invalid basis */ - case GLP_ESING : /* singular matrix */ - case GLP_ECOND : /* ill-conditioned matrix */ - case GLP_EBOUND : /* invalid bounds */ - case GLP_EFAIL : /* solver failed */ - case GLP_EOBJLL : /* objective lower limit reached */ - case GLP_EOBJUL : /* objective upper limit reached */ - case GLP_EROOT : /* root LP optimum not provided */ -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, - "%s Invalid Input data: %i\n", - problem, result); -#endif - break; - case 0: -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, - "%s Problem has been solved\n", problem); -#endif - break; +void +GST_ats_expire_address (const struct GNUNET_HELLO_Address *address) +{ + struct AddressInfo *ai; + + if (0 == + memcmp (&GST_my_identity, + &address->peer, + sizeof (struct GNUNET_PeerIdentity))) + return; /* our own, ignore! */ + LOG (GNUNET_ERROR_TYPE_DEBUG, + "Address %s of peer %s expired\n", + GST_plugins_a2s (address), + GNUNET_i2s (&address->peer)); + ai = find_ai_no_session (address); + if (NULL == ai) + { + GNUNET_assert (0); + return; } - - switch (solution) { - case GLP_UNDEF: -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, - "%s solution is undefined\n", problem); -#endif - break; - case GLP_OPT: -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, - "%s solution is optimal\n", problem); -#endif - cont=GNUNET_YES; - break; - case GLP_FEAS: -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, - "%s solution is %s feasible, however, its optimality (or non-optimality) has not been proven\n", - problem, (0==strcmp(problem,"LP")?"":"integer")); -#endif - cont=GNUNET_YES; - break; - case GLP_NOFEAS: -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, "%s problem has no %sfeasible solution\n", - problem, (0==strcmp(problem,"LP")?"":"integer ")); -#endif - break; - case GLP_INFEAS: -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, "%s problem is infeasible \n", problem); -#endif - break; - case GLP_UNBND: -#if DEBUG_ATS || VERBOSE_ATS - GNUNET_log (error_kind, "%s problem is unbounded \n", problem); -#endif - default: - break; + if (NULL != ai->session) + { + /* Got an active session, just remember the expiration + and act upon it when the session goes down. */ + ai->expired = GNUNET_YES; + return; } -return cont; + /* Address expired, no session, free resources */ + destroy_ai (ai); } -void ats_update_problem_cr (struct ATS_Handle * ats) -{ - int array_index; - int row_index; - int c, c2; - double ct_max, ct_min; - - int *ja = GNUNET_malloc ((1 + ats->internal.c_mechs*2 + 3 + - available_quality_metrics) * sizeof (int)); - double *ar = GNUNET_malloc ((1 + ats->internal.c_mechs*2 + 3 + - available_quality_metrics) * sizeof (double)); - - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Updating problem quality metrics\n"); - row_index = ats->internal.begin_cr; - array_index = 1; - - for (c=0; cprob, row_index, GLP_DB, ct_min, ct_max); - for (c2=1; c2<=ats->internal.c_mechs; c2++) - { - double value = 0; - GNUNET_assert (ats->mechanisms[c2].addr != NULL); - GNUNET_assert (ats->mechanisms[c2].peer != NULL); - - ja[array_index] = c2; - value = ats->mechanisms[c2].ressources[c].c; - ar[array_index] = value; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n", - array_index, - row_index, - ja[array_index], - ar[array_index]); -#endif - array_index++; - } - _lp_set_mat_row (ats->prob, row_index, array_index, ja, ar); - row_index ++; - } - GNUNET_free_non_null (ja); - GNUNET_free_non_null (ar); +/** + * Initialize ATS subsystem. + */ +void +GST_ats_init () +{ + p2a = GNUNET_CONTAINER_multipeermap_create (4, GNUNET_YES); } -void ats_set_logging_options (struct ATS_Handle * ats, - int minimum_addresses, - int minimum_peers, - int overwrite_dump, - int log_solution, - int log_problem) + +/** + * Release memory used by the given address data. + * + * @param cls NULL + * @param key which peer is this about + * @param value the `struct AddressInfo` + * @return #GNUNET_OK (continue to iterate) + */ +static int +destroy_ai_cb (void *cls, + const struct GNUNET_PeerIdentity *key, + void *value) { - if (ats == NULL) - return; + struct AddressInfo *ai = value; - ats->dump_min_addr = minimum_addresses; - ats->dump_min_peers = minimum_peers; - ats->dump_overwrite = overwrite_dump; - ats->save_mlp = log_problem; - ats->save_solution = log_solution; + destroy_ai (ai); + return GNUNET_OK; } -#if 0 -static void ats_update_problem_qm_TEST () + +/** + * Shutdown ATS subsystem. + */ +void +GST_ats_done () { - int row_index; - int c - int c2; - int c_old; - int changed = 0; - - int old_ja[ats->internal.c_mechs + 2]; - double old_ar[ats->internal.c_mechs + 2]; - - int *ja = GNUNET_malloc ((1 + ats->internal.c_mechs*2 + 3 + - available_quality_metrics) * sizeof (int)); - double *ar = GNUNET_malloc ((1 + ats->internal.c_mechs*2 + 3 + - available_quality_metrics) * sizeof (double)); -#if DEBUG_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, - "Updating problem quality metrics TEST\n"); -#endif - if (ats->internal.begin_qm >0) - row_index = ats->internal.begin_qm; - else - return; - for (c=0; cprob, row_index, old_ja, old_ar); - _lp_set_row_bnds(ats->prob, row_index, GLP_FX, 0.0, 0.0); - for (c2=1; c2<=c_old; c2++) - { - ja[c2] = old_ja[c2]; - if ((changed < 3) && (c2>2) && (old_ar[c2] != -1)) - { - ar[c2] = old_ar[c2] + 5 - changed; - changed ++; - } - else - ar[c2] = old_ar[c2]; -#if VERBOSE_ATS - GNUNET_log (GNUNET_ERROR_TYPE_ERROR, - "[index]=[%i]: old [%i,%i]=%f new [%i,%i]=%f\n", - c2, - row_index, - old_ja[c2], - old_ar[c2], - row_index, - ja[c2], - ar[c2]); -#endif - } - _lp_set_mat_row (ats->prob, row_index, c_old, ja, ar); - row_index ++; - } - GNUNET_free_non_null (ja); - GNUNET_free_non_null (ar); + GNUNET_CONTAINER_multipeermap_iterate (p2a, + &destroy_ai_cb, + NULL); + publish_p2a_stat_update (); + GNUNET_CONTAINER_multipeermap_destroy (p2a); + p2a = NULL; } -#endif - - - -/* end of transport_ats.c */ +/* end of gnunet-service-transport_ats.c */