+ var_list = &(sys->saturated_variable_set);
+
+ xbt_swag_foreach(var, var_list) {
+ /* First check if some of these variables have reach their upper
+ bound and update min_usage accordingly. */
+ DEBUG5("var=%p, var->bound=%f, var->weight=%f, min_usage=%f, var->bound*var->weight=%f",
+ var, var->bound, var->weight, min_usage,var->bound * var->weight);
+ if ((var->bound > 0) && (var->bound * var->weight < min_usage)) {
+ min_usage = var->bound * var->weight;
+ DEBUG1("Updated min_usage=%f",min_usage);
+ }
+ }
+
+
+ while ((var = xbt_swag_getFirst(var_list))) {
+ int i;
+
+ var->value = min_usage / var->weight;
+ DEBUG5("Min usage: %f, Var(%p)->weight: %f, Var(%p)->value: %f ",min_usage,var,var->weight,var,var->value);
+
+
+ /* Update usage */
+
+ for (i = 0; i < var->cnsts_number; i++) {
+ elem = &var->cnsts[i];
+ cnst = elem->constraint;
+ if(cnst->shared) {
+ double_update(&(cnst->remaining), elem->value * var->value);
+ double_update(&(cnst->usage), elem->value / var->weight);
+ make_elem_inactive(elem);
+ } else { /* FIXME one day: We recompute usage.... :( */
+ cnst->usage = 0.0;
+ make_elem_inactive(elem);
+ xbt_swag_foreach(elem, elem_list) {
+ if(elem->variable->weight <=0) break;
+ if(elem->variable->value > 0) break;
+ if ((elem->value > 0)) {
+ if(cnst->usage<elem->value / elem->variable->weight)
+ cnst->usage = elem->value / elem->variable->weight;
+ DEBUG2("Constraint Usage %p : %f",cnst,cnst->usage);
+ make_elem_active(elem);
+ }
+ }
+ }
+ }
+ xbt_swag_remove(var, var_list);
+ }
+
+ /* Find out which variables reach the maximum */
+ cnst_list = &(sys->active_constraint_set);
+ min_usage = -1;
+ xbt_swag_foreach(cnst, cnst_list) {
+ saturated_constraint_set_update(sys, cnst, &min_usage);
+ }
+ saturated_variable_set_update(sys);
+
+ } while (xbt_swag_size(&(sys->saturated_variable_set)));
+
+ sys->modified = 0;
+ if(XBT_LOG_ISENABLED(surf_maxmin, xbt_log_priority_debug)) {
+ lmm_print(sys);
+ }
+}
+
+/* Not a O(1) function */
+
+void lmm_update(lmm_system_t sys, lmm_constraint_t cnst,
+ lmm_variable_t var, double value)
+{
+ int i;
+
+ sys->modified = 1;
+ for (i = 0; i < var->cnsts_number; i++)
+ if (var->cnsts[i].constraint == cnst) {
+ var->cnsts[i].value = value;
+ return;
+ }
+}
+
+/** \brief Attribute the value bound to var->bound.
+ *
+ * \param sys the lmm_system_t
+ * \param var the lmm_variable_t
+ * \param bound the new bound to associate with var
+ *
+ * Makes var->bound equal to bound. Whenever this function is called
+ * a change is signed in the system. To
+ * avoid false system changing detection it is a good idea to test
+ * (bound != 0) before calling it.
+ *
+ */
+void lmm_update_variable_bound(lmm_system_t sys, lmm_variable_t var,
+ double bound)
+{
+ sys->modified = 1;
+ var->bound = bound;
+}
+
+/** \brief Add the value delta to var->df (the sum of latencies).
+ *
+ * \param sys the lmm_system_t associated
+ * \param var the lmm_variable_t which need to updated
+ * \param delta the variation of the latency
+ *
+ * Add the value delta to var->df (the sum of latencys associated to the
+ * flow). Whenever this function is called a change is signed in the system. To
+ * avoid false system changing detection it is a good idea to test
+ * (delta != 0) before calling it.
+ *
+ */
+void lmm_update_variable_latency(lmm_system_t sys, lmm_variable_t var,
+ double delta)
+{
+ sys->modified = 1;
+ var->df += delta;
+}
+
+void lmm_update_variable_weight(lmm_system_t sys, lmm_variable_t var,
+ double weight)
+{
+ int i ;
+ lmm_element_t elem;
+
+ XBT_IN3("(sys=%p, var=%p, weight=%f)",sys,var,weight);
+ sys->modified = 1;
+ var->weight = weight;
+ xbt_swag_remove(var,&(sys->variable_set));
+ if(weight) xbt_swag_insert_at_head(var,&(sys->variable_set));
+ else xbt_swag_insert_at_tail(var,&(sys->variable_set));
+
+ for (i = 0; i < var->cnsts_number; i++) {
+ elem = &var->cnsts[i];
+ xbt_swag_remove(elem, &(elem->constraint->element_set));
+ if(weight) xbt_swag_insert_at_head(elem, &(elem->constraint->element_set));
+ else xbt_swag_insert_at_tail(elem, &(elem->constraint->element_set));
+ }
+ XBT_OUT;
+}
+
+double lmm_get_variable_weight(lmm_variable_t var)
+
+{
+ return var->weight;
+}
+
+void lmm_update_constraint_bound(lmm_system_t sys, lmm_constraint_t cnst,
+ double bound)
+{
+ sys->modified = 1;
+ cnst->bound = bound;
+}
+
+int lmm_constraint_used(lmm_system_t sys, lmm_constraint_t cnst)
+{
+ return xbt_swag_belongs(cnst, &(sys->active_constraint_set));
+}
+
+lmm_constraint_t lmm_get_first_active_constraint(lmm_system_t sys)
+{
+ return xbt_swag_getFirst(&(sys->active_constraint_set));
+}
+
+lmm_constraint_t lmm_get_next_active_constraint(lmm_system_t sys, lmm_constraint_t cnst)
+{
+ return xbt_swag_getNext(cnst,(sys->active_constraint_set).offset);
+}
+
+
+
+/** \brief Attribute the value bound to var->bound.
+ *
+ * \param func_f default function f associated with the chosen protocol flavor
+ * \param func_fp partial differential of f (f prime, f')
+ * \param func_fpi inverse of the partial differential of f (f prime inverse, (f')^{-1})
+ * \param func_fpip partial differential of the inverse of the partial differential of f (f prime inverse prime, ((f')^{-1})')
+ *
+ * Set default functions to the ones passed as parameters. This is a polimorfism in C pure, enjoy the roots of programming.
+ *
+ */
+void lmm_set_default_protocol_functions(double (* func_f) (lmm_variable_t var, double x),
+ double (* func_fp) (lmm_variable_t var, double x),
+ double (* func_fpi) (lmm_variable_t var, double x),
+ double (* func_fpip) (lmm_variable_t var, double x))
+
+{
+ func_f_def = func_f;
+ func_fp_def = func_fp;
+ func_fpi_def = func_fpi;
+ func_fpip_def = func_fpip;
+}
+
+
+/*
+ * NOTE for Reno: all functions consider the network
+ * coeficient (alpha) equal to 1.
+ */
+
+/*
+ * For Vegas f: $\alpha_f d_f \log\left(x_f\right)$
+ */
+double func_vegas_f(lmm_variable_t var, double x){
+ return var->df * log(x);
+}
+
+/*
+ * For Vegas fp: $\frac{\alpha D_f}{x}$
+ */
+double func_vegas_fp(lmm_variable_t var, double x){
+ //avoid a disaster value - c'est du bricolage mais ca marche
+/* if(x == 0) x = 10e-8; */
+ return var->df/x;
+}
+
+/*
+ * For Vegas fpi: $\frac{\alpha D_f}{x}$
+ */
+double func_vegas_fpi(lmm_variable_t var, double x){
+ //avoid a disaster value - c'est du bricolage mais ca marche
+/* if(x == 0) x = 10e-8; */
+ return var->df/x;
+}
+
+/*
+ * For Vegas fpip: $-\frac{\alpha D_f}{x^2}$
+ */
+double func_vegas_fpip(lmm_variable_t var, double x){
+ //avoid a disaster value - c'est du bricolage mais ca marche
+/* if(x == 0) x = 10e-8; */
+ return -( var->df/(x*x) ) ;
+}
+
+
+/*
+ * For Reno f: $\frac{\sqrt{\frac{3}{2}}}{D_f} \arctan\left(\sqrt{\frac{3}{2}}x_f D_f\right)$
+ */
+double func_reno_f(lmm_variable_t var, double x){
+ xbt_assert0(var->df>0.0,"Don't call me with stupid values!");
+ // \sqrt{3/2} = 0.8164965808
+ return (0.8164965808 / var->df) * atan( (0.8164965808 / var->df)*x );
+}
+
+/*
+ * For Reno fp: $\frac{3}{3 {D_f}^2 x^2 + 2}$
+ */
+double func_reno_fp(lmm_variable_t var, double x){
+ return 3 / (3*var->df*var->df*x*x + 2);
+}
+
+/*
+ * For Reno fpi: $\sqrt{\frac{1}{{D_f}^2 x} - \frac{2}{3{D_f}^2}}$
+ */
+double func_reno_fpi(lmm_variable_t var, double x){
+ double res_fpi;
+
+ xbt_assert0(var->df>0.0,"Don't call me with stupid values!");
+ xbt_assert0(x>0.0,"Don't call me with stupid values!");
+
+ res_fpi = 1/(var->df*var->df*x) - 2/(3*var->df*var->df);
+ if(res_fpi<=0.0) return 0.0;
+ xbt_assert0(res_fpi>0.0,"Don't call me with stupid values!");
+ return sqrt(res_fpi);
+}
+
+/*
+ * For Reno fpip: $-\frac{1}{2 {D_f}^2 x^2\sqrt{\frac{1}{{D_f}^2 x} - \frac{2}{3{D_f}^2}}}$
+ */
+double func_reno_fpip(lmm_variable_t var, double x){
+ double res_fpip;
+ double critical_test;