Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
Merge branch 'surf++'
[simgrid.git] / src / surf / maxmin.c
1 /* Copyright (c) 2004-2013. The SimGrid Team.
2  * All rights reserved.                                                     */
3
4 /* This program is free software; you can redistribute it and/or modify it
5  * under the terms of the license (GNU LGPL) which comes with this package. */
6
7
8 #include "xbt/sysdep.h"
9 #include "xbt/log.h"
10 #include "xbt/mallocator.h"
11 #include "maxmin_private.h"
12 #include <stdlib.h>
13 #include <stdio.h>              /* sprintf */
14 #include <math.h>
15 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_maxmin, surf,
16                                 "Logging specific to SURF (maxmin)");
17
18 typedef struct s_dyn_light {
19   int *data;
20   int pos;
21   int size;
22 } s_dyn_light_t, *dyn_light_t;
23
24 XBT_EXPORT_NO_IMPORT(double) sg_maxmin_precision = 0.00001;
25
26 static void *lmm_variable_mallocator_new_f(void);
27 static void lmm_variable_mallocator_free_f(void *var);
28 #define lmm_variable_mallocator_reset_f ((void_f_pvoid_t)NULL)
29 static void lmm_update_modified_set(lmm_system_t sys,
30                                     lmm_constraint_t cnst);
31 static void lmm_remove_all_modified_set(lmm_system_t sys);
32 static int Global_debug_id = 1;
33 static int Global_const_debug_id = 1;
34
35 static void lmm_var_free(lmm_system_t sys, lmm_variable_t var);
36 static XBT_INLINE void lmm_cnst_free(lmm_system_t sys,
37                                      lmm_constraint_t cnst);
38
39 lmm_system_t lmm_system_new(int selective_update)
40 {
41   lmm_system_t l = NULL;
42   s_lmm_variable_t var;
43   s_lmm_constraint_t cnst;
44
45   l = xbt_new0(s_lmm_system_t, 1);
46
47   l->modified = 0;
48   l->selective_update_active = selective_update;
49   l->visited_counter = 1;
50
51   XBT_DEBUG("Setting selective_update_active flag to %d\n",
52          l->selective_update_active);
53
54   xbt_swag_init(&(l->variable_set),
55                 xbt_swag_offset(var, variable_set_hookup));
56   xbt_swag_init(&(l->constraint_set),
57                 xbt_swag_offset(cnst, constraint_set_hookup));
58
59   xbt_swag_init(&(l->active_constraint_set),
60                 xbt_swag_offset(cnst, active_constraint_set_hookup));
61
62   xbt_swag_init(&(l->modified_constraint_set),
63                 xbt_swag_offset(cnst, modified_constraint_set_hookup));
64   xbt_swag_init(&(l->saturated_variable_set),
65                 xbt_swag_offset(var, saturated_variable_set_hookup));
66   xbt_swag_init(&(l->saturated_constraint_set),
67                 xbt_swag_offset(cnst, saturated_constraint_set_hookup));
68
69   l->variable_mallocator = xbt_mallocator_new(65536,
70                                               lmm_variable_mallocator_new_f,
71                                               lmm_variable_mallocator_free_f,
72                                               lmm_variable_mallocator_reset_f);
73
74   return l;
75 }
76
77 void lmm_system_free(lmm_system_t sys)
78 {
79   lmm_variable_t var = NULL;
80   lmm_constraint_t cnst = NULL;
81
82   while ((var = extract_variable(sys))) {
83     XBT_WARN
84         ("Variable %p (%d) still in LMM system when freing it: this may be a bug",
85          var, var->id_int);
86     lmm_var_free(sys, var);
87   }
88
89   while ((cnst = extract_constraint(sys)))
90     lmm_cnst_free(sys, cnst);
91
92   xbt_mallocator_free(sys->variable_mallocator);
93   free(sys);
94 }
95
96 static XBT_INLINE void lmm_variable_disable(lmm_system_t sys, lmm_variable_t var)
97 {
98   int i;
99   int n;
100
101   lmm_element_t elem = NULL;
102
103   XBT_IN("(sys=%p, var=%p)", sys, var);
104   sys->modified = 1;
105
106   n = 0;
107   for (i = 0; i < var->cnsts_number; i++) {
108     elem = &var->cnsts[i];
109     xbt_swag_remove(elem, &(elem->constraint->element_set));
110     xbt_swag_remove(elem, &(elem->constraint->active_element_set));
111     if (!xbt_swag_size(&(elem->constraint->element_set)))
112       make_constraint_inactive(sys, elem->constraint);
113     else {
114       if (n < i)
115         var->cnsts[n].constraint = elem->constraint;
116       n++;
117     }
118   }
119   if (n) {
120     var->cnsts_number = n;
121     lmm_update_modified_set(sys, var->cnsts[0].constraint);
122   }
123
124   var->cnsts_number = 0;
125   XBT_OUT();
126 }
127
128 static void lmm_var_free(lmm_system_t sys, lmm_variable_t var)
129 {
130
131   lmm_variable_disable(sys, var);
132   xbt_mallocator_release(sys->variable_mallocator, var);
133 }
134
135 static XBT_INLINE void lmm_cnst_free(lmm_system_t sys,
136                                      lmm_constraint_t cnst)
137 {
138 /*   xbt_assert(xbt_swag_size(&(cnst->element_set)), */
139 /*         "This list should be empty!"); */
140   make_constraint_inactive(sys, cnst);
141   free(cnst);
142 }
143
144 lmm_constraint_t lmm_constraint_new(lmm_system_t sys, void *id,
145                                     double bound_value)
146 {
147   lmm_constraint_t cnst = NULL;
148   s_lmm_element_t elem;
149
150   cnst = xbt_new0(s_lmm_constraint_t, 1);
151   cnst->id = id;
152   cnst->id_int = Global_const_debug_id++;
153   xbt_swag_init(&(cnst->element_set),
154                 xbt_swag_offset(elem, element_set_hookup));
155   xbt_swag_init(&(cnst->active_element_set),
156                 xbt_swag_offset(elem, active_element_set_hookup));
157
158   cnst->bound = bound_value;
159   cnst->usage = 0;
160   cnst->shared = 1;
161   insert_constraint(sys, cnst);
162
163   return cnst;
164 }
165
166 XBT_INLINE void lmm_constraint_shared(lmm_constraint_t cnst)
167 {
168   cnst->shared = 0;
169 }
170
171 XBT_INLINE int lmm_constraint_is_shared(lmm_constraint_t cnst)
172 {
173   return (cnst->shared);
174 }
175
176 XBT_INLINE void lmm_constraint_free(lmm_system_t sys,
177                                     lmm_constraint_t cnst)
178 {
179   remove_constraint(sys, cnst);
180   lmm_cnst_free(sys, cnst);
181 }
182
183 static void *lmm_variable_mallocator_new_f(void)
184 {
185   lmm_variable_t var = xbt_new(s_lmm_variable_t, 1);
186   var->cnsts = NULL; /* will be created by realloc */
187   return var;
188 }
189
190 static void lmm_variable_mallocator_free_f(void *var)
191 {
192   xbt_free(((lmm_variable_t) var)->cnsts);
193   xbt_free(var);
194 }
195
196 lmm_variable_t lmm_variable_new(lmm_system_t sys, void *id,
197                                 double weight,
198                                 double bound, int number_of_constraints)
199 {
200   lmm_variable_t var = NULL;
201   int i;
202
203   XBT_IN("(sys=%p, id=%p, weight=%f, bound=%f, num_cons =%d)",
204           sys, id, weight, bound, number_of_constraints);
205
206   var = xbt_mallocator_get(sys->variable_mallocator);
207   var->id = id;
208   var->id_int = Global_debug_id++;
209   var->cnsts = xbt_realloc(var->cnsts, number_of_constraints * sizeof(s_lmm_element_t));
210   for (i = 0; i < number_of_constraints; i++) {
211     var->cnsts[i].element_set_hookup.next = NULL;
212     var->cnsts[i].element_set_hookup.prev = NULL;
213     var->cnsts[i].active_element_set_hookup.next = NULL;
214     var->cnsts[i].active_element_set_hookup.prev = NULL;
215     var->cnsts[i].constraint = NULL;
216     var->cnsts[i].variable = NULL;
217     var->cnsts[i].value = 0.0;
218   }
219   var->cnsts_size = number_of_constraints;
220   var->cnsts_number = 0;
221   var->weight = weight;
222   var->bound = bound;
223   var->value = 0.0;
224   var->visited = sys->visited_counter - 1;
225   var->mu = 0.0;
226   var->new_mu = 0.0;
227   var->func_f = func_f_def;
228   var->func_fp = func_fp_def;
229   var->func_fpi = func_fpi_def;
230
231   var->variable_set_hookup.next = NULL;
232   var->variable_set_hookup.prev = NULL;
233   var->saturated_variable_set_hookup.next = NULL;
234   var->saturated_variable_set_hookup.prev = NULL;
235
236   if (weight)
237     xbt_swag_insert_at_head(var, &(sys->variable_set));
238   else
239     xbt_swag_insert_at_tail(var, &(sys->variable_set));
240
241   XBT_OUT(" returns %p", var);
242   return var;
243 }
244
245 void lmm_variable_free(lmm_system_t sys, lmm_variable_t var)
246 {
247   remove_variable(sys, var);
248   lmm_var_free(sys, var);
249 }
250
251 XBT_INLINE double lmm_variable_getvalue(lmm_variable_t var)
252 {
253   return (var->value);
254 }
255
256 XBT_INLINE double lmm_variable_getbound(lmm_variable_t var)
257 {
258   return (var->bound);
259 }
260
261 /* Replace the content of elem_a with elem_b. The content of elem_b is cleared. */
262 static void renew_elem_entry(lmm_element_t elem_a, lmm_element_t elem_b)
263 {
264     elem_a->constraint = elem_b->constraint;
265     elem_a->variable   = elem_b->variable;
266     elem_a->value      = elem_b->value;
267
268     /* If elem_b is in the element_set swag, register the new element to the swag. */
269     if (xbt_swag_remove(elem_b, &(elem_b->constraint->element_set))) {
270       if (elem_a->variable->weight)
271         xbt_swag_insert_at_head(elem_a, &(elem_a->constraint->element_set));
272       else
273         xbt_swag_insert_at_tail(elem_a, &(elem_a->constraint->element_set));
274     }
275
276     if (xbt_swag_remove(elem_b, &(elem_b->constraint->active_element_set))) {
277       if (elem_a->variable->weight)
278         xbt_swag_insert_at_head(elem_a, &(elem_a->constraint->active_element_set));
279       else
280         xbt_swag_insert_at_tail(elem_a, &(elem_a->constraint->active_element_set));
281     }
282
283     elem_b->constraint = NULL;
284     elem_b->variable   = NULL;
285     elem_b->value      = 0;
286 }
287
288 void lmm_shrink(lmm_system_t sys, lmm_constraint_t cnst,
289                 lmm_variable_t var)
290 {
291   lmm_element_t elem = NULL;
292   int found = 0;
293
294   int i;
295   for (i = 0; i < var->cnsts_number; i++) {
296     elem = &(var->cnsts[i]);
297     if (elem->constraint == cnst) {
298       found = 1;
299       break;
300     }
301   }
302
303   if (!found) {
304     XBT_DEBUG("cnst %p is not found in var %p", cnst, var);
305     return;
306   }
307
308   sys->modified = 1;
309
310   XBT_DEBUG("remove elem(value %lf, cnst %p, var %p) in var %p",
311       elem->value, elem->constraint, elem->variable, var);
312
313
314
315   /* We are going to change the constraint object and the variable object.
316    * Propagate this change to other objects. Calling here (not after
317    * modification) is correct? */
318   lmm_update_modified_set(sys, cnst);
319   lmm_update_modified_set(sys, var->cnsts[0].constraint); // will look up element_set of this constraint, and then each var in the element_set, and each var->cnsts[i].
320
321
322
323   /* now var->cnsts[i] is not necessary any more */
324
325   xbt_swag_remove(elem, &(elem->constraint->element_set));
326   xbt_swag_remove(elem, &(elem->constraint->active_element_set));
327   elem->constraint = NULL;
328   elem->variable = NULL;
329   elem->value = 0;
330
331
332
333   /* We do not want to have an empty element entry before the last entry. So,
334    * plug up the hole with the last one. */
335   if (i < var->cnsts_number - 1)
336     renew_elem_entry(&var->cnsts[i], &var->cnsts[var->cnsts_number - 1]);
337
338   var->cnsts_number -= 1;
339
340
341   if (xbt_swag_size(&(cnst->element_set)) == 0)
342     make_constraint_inactive(sys, cnst);
343 }
344
345 void lmm_expand(lmm_system_t sys, lmm_constraint_t cnst,
346                 lmm_variable_t var, double value)
347 {
348   lmm_element_t elem = NULL;
349
350   sys->modified = 1;
351
352   xbt_assert(var->cnsts_number < var->cnsts_size, "Too much constraints");
353
354   elem = &(var->cnsts[var->cnsts_number++]);
355
356   elem->value = value;
357   elem->constraint = cnst;
358   elem->variable = var;
359
360   if (var->weight)
361     xbt_swag_insert_at_head(elem, &(elem->constraint->element_set));
362   else
363     xbt_swag_insert_at_tail(elem, &(elem->constraint->element_set));
364   if(!sys->selective_update_active) {
365     make_constraint_active(sys, cnst);
366   } else if(elem->value>0 || var->weight >0) {
367     make_constraint_active(sys, cnst);
368     lmm_update_modified_set(sys, cnst);
369     if (var->cnsts_number > 1)
370       lmm_update_modified_set(sys, var->cnsts[0].constraint);
371   }
372 }
373
374 void lmm_expand_add(lmm_system_t sys, lmm_constraint_t cnst,
375                     lmm_variable_t var, double value)
376 {
377   int i;
378   sys->modified = 1;
379
380   for (i = 0; i < var->cnsts_number; i++)
381     if (var->cnsts[i].constraint == cnst)
382       break;
383
384   if (i < var->cnsts_number) {
385     if (cnst->shared)
386       var->cnsts[i].value += value;
387     else
388       var->cnsts[i].value = MAX(var->cnsts[i].value, value);
389     lmm_update_modified_set(sys, cnst);
390   } else
391     lmm_expand(sys, cnst, var, value);
392 }
393
394 void lmm_elem_set_value(lmm_system_t sys, lmm_constraint_t cnst,
395                         lmm_variable_t var, double value)
396 {
397   int i;
398
399   for (i = 0; i < var->cnsts_number; i++)
400     if (var->cnsts[i].constraint == cnst)
401       break;
402
403   if (i < var->cnsts_number) {
404     var->cnsts[i].value = value;
405     sys->modified = 1;
406     lmm_update_modified_set(sys, cnst);
407   } else
408     DIE_IMPOSSIBLE;
409 }
410
411 XBT_INLINE lmm_constraint_t lmm_get_cnst_from_var(lmm_system_t sys,
412                                                   lmm_variable_t var,
413                                                   int num)
414 {
415   if (num < var->cnsts_number)
416     return (var->cnsts[num].constraint);
417   else
418     return NULL;
419 }
420
421 XBT_INLINE double lmm_get_cnst_weight_from_var(lmm_system_t sys,
422                                                          lmm_variable_t var,
423                                                          int num)
424 {
425   if (num < var->cnsts_number)
426     return (var->cnsts[num].value);
427   else
428     return 0.0;
429 }
430
431 XBT_INLINE int lmm_get_number_of_cnst_from_var(lmm_system_t sys,
432                                                lmm_variable_t var)
433 {
434   return (var->cnsts_number);
435 }
436
437 lmm_variable_t lmm_get_var_from_cnst(lmm_system_t sys,
438                                      lmm_constraint_t cnst,
439                                      lmm_element_t * elem)
440 {
441   if (!(*elem))
442     *elem = xbt_swag_getFirst(&(cnst->element_set));
443   else
444     *elem = xbt_swag_getNext(*elem, cnst->element_set.offset);
445   if (*elem)
446     return (*elem)->variable;
447   else
448     return NULL;
449 }
450
451 XBT_INLINE void *lmm_constraint_id(lmm_constraint_t cnst)
452 {
453   return cnst->id;
454 }
455
456 XBT_INLINE void *lmm_variable_id(lmm_variable_t var)
457 {
458   return var->id;
459 }
460
461 static XBT_INLINE void saturated_constraint_set_update(double usage,
462                                                       int cnst_light_num,
463                                                       dyn_light_t saturated_constraint_set,
464                                                       double *min_usage)
465 {
466   xbt_assert(usage > 0,"Impossible");
467
468   if (*min_usage < 0 || *min_usage > usage) {
469     *min_usage = usage;
470     // XBT_HERE(" min_usage=%f (cnst->remaining / cnst->usage =%f)", *min_usage, usage);
471     saturated_constraint_set->data[0] = cnst_light_num;
472     saturated_constraint_set->pos = 1;
473   } else if (*min_usage == usage) {
474     if(saturated_constraint_set->pos == saturated_constraint_set->size) { // realloc the size
475       saturated_constraint_set->size *= 2;
476       saturated_constraint_set->data = xbt_realloc(saturated_constraint_set->data, (saturated_constraint_set->size) * sizeof(int));
477     }
478     saturated_constraint_set->data[saturated_constraint_set->pos] = cnst_light_num;
479     saturated_constraint_set->pos++;
480   }
481 }
482
483 static XBT_INLINE void saturated_variable_set_update(
484     s_lmm_constraint_light_t *cnst_light_tab,
485     dyn_light_t saturated_constraint_set,
486     lmm_system_t sys)
487 {
488   lmm_constraint_light_t cnst = NULL;
489   lmm_element_t elem = NULL;
490   xbt_swag_t elem_list = NULL;
491   int i;
492   for(i = 0; i< saturated_constraint_set->pos; i++){
493     cnst = &cnst_light_tab[saturated_constraint_set->data[i]];
494     elem_list = &(cnst->cnst->active_element_set);
495     xbt_swag_foreach(elem, elem_list) {
496       if (elem->variable->weight <= 0)
497         break;
498       if ((elem->value > 0))
499         xbt_swag_insert(elem->variable, &(sys->saturated_variable_set));
500     }
501   }
502 }
503
504 void lmm_print(lmm_system_t sys)
505 {
506   lmm_constraint_t cnst = NULL;
507   lmm_element_t elem = NULL;
508   lmm_variable_t var = NULL;
509   xbt_swag_t cnst_list = NULL;
510   xbt_swag_t var_list = NULL;
511   xbt_swag_t elem_list = NULL;
512   char print_buf[1024];
513   char *trace_buf = xbt_malloc0(sizeof(char));
514   double sum = 0.0;
515
516   /* Printing Objective */
517   var_list = &(sys->variable_set);
518   sprintf(print_buf, "MAX-MIN ( ");
519   trace_buf =
520       xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
521   strcat(trace_buf, print_buf);
522   xbt_swag_foreach(var, var_list) {
523     sprintf(print_buf, "'%d'(%f) ", var->id_int, var->weight);
524     trace_buf =
525         xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
526     strcat(trace_buf, print_buf);
527   }
528   sprintf(print_buf, ")");
529   trace_buf =
530       xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
531   strcat(trace_buf, print_buf);
532   XBT_DEBUG("%20s", trace_buf);
533   trace_buf[0] = '\000';
534
535   XBT_DEBUG("Constraints");
536   /* Printing Constraints */
537   cnst_list = &(sys->active_constraint_set);
538   xbt_swag_foreach(cnst, cnst_list) {
539     sum = 0.0;
540     elem_list = &(cnst->element_set);
541     sprintf(print_buf, "\t");
542     trace_buf =
543         xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
544     strcat(trace_buf, print_buf);
545     sprintf(print_buf, "%s(",(cnst->shared)?"":"max");
546     trace_buf =
547       xbt_realloc(trace_buf,
548       strlen(trace_buf) + strlen(print_buf) + 1);
549     strcat(trace_buf, print_buf);      
550     xbt_swag_foreach(elem, elem_list) {
551       sprintf(print_buf, "%f.'%d'(%f) %s ", elem->value,
552               elem->variable->id_int, elem->variable->value,(cnst->shared)?"+":",");
553       trace_buf =
554           xbt_realloc(trace_buf,
555                       strlen(trace_buf) + strlen(print_buf) + 1);
556       strcat(trace_buf, print_buf);
557       if(cnst->shared) 
558   sum += elem->value * elem->variable->value;
559       else 
560   sum = MAX(sum,elem->value * elem->variable->value);
561     }
562     sprintf(print_buf, "0) <= %f ('%d')", cnst->bound, cnst->id_int);
563     trace_buf =
564         xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
565     strcat(trace_buf, print_buf);
566
567     if (!cnst->shared) {
568       sprintf(print_buf, " [MAX-Constraint]");
569       trace_buf =
570           xbt_realloc(trace_buf,
571                       strlen(trace_buf) + strlen(print_buf) + 1);
572       strcat(trace_buf, print_buf);
573     }
574     XBT_DEBUG("%s", trace_buf);
575     trace_buf[0] = '\000';
576     xbt_assert(!double_positive(sum - cnst->bound),
577                 "Incorrect value (%f is not smaller than %f): %g",
578                 sum, cnst->bound, sum - cnst->bound);
579   }
580
581   XBT_DEBUG("Variables");
582   /* Printing Result */
583   xbt_swag_foreach(var, var_list) {
584     if (var->bound > 0) {
585       XBT_DEBUG("'%d'(%f) : %f (<=%f)", var->id_int, var->weight, var->value,
586              var->bound);
587       xbt_assert(!double_positive(var->value - var->bound),
588                   "Incorrect value (%f is not smaller than %f",
589                   var->value, var->bound);
590     } else {
591       XBT_DEBUG("'%d'(%f) : %f", var->id_int, var->weight, var->value);
592     }
593   }
594
595   free(trace_buf);
596 }
597
598 void lmm_solve(lmm_system_t sys)
599 {
600   lmm_variable_t var = NULL;
601   lmm_constraint_t cnst = NULL;
602   lmm_constraint_t cnst_next = NULL;
603   lmm_element_t elem = NULL;
604   xbt_swag_t cnst_list = NULL;
605   xbt_swag_t var_list = NULL;
606   xbt_swag_t elem_list = NULL;
607   double min_usage = -1;
608   double min_bound = -1;
609
610   if (!(sys->modified))
611     return;
612
613   XBT_IN("(sys=%p)", sys);
614
615   /*
616    * Compute Usage and store the variables that reach the maximum.
617    */
618   cnst_list =
619       sys->
620       selective_update_active ? &(sys->modified_constraint_set) :
621       &(sys->active_constraint_set);
622
623   XBT_DEBUG("Active constraints : %d", xbt_swag_size(cnst_list));
624   /* Init: Only modified code portions */
625   xbt_swag_foreach(cnst, cnst_list) {
626     elem_list = &(cnst->element_set);
627     //XBT_DEBUG("Variable set : %d", xbt_swag_size(elem_list));
628     xbt_swag_foreach(elem, elem_list) {
629       var = elem->variable;
630       if (var->weight <= 0.0)
631         break;
632       var->value = 0.0;
633     }
634   }
635
636   s_lmm_constraint_light_t *cnst_light_tab = (s_lmm_constraint_light_t *)xbt_malloc0(xbt_swag_size(cnst_list)*sizeof(s_lmm_constraint_light_t));
637   int cnst_light_num = 0;
638   dyn_light_t saturated_constraint_set = xbt_new0(s_dyn_light_t,1);
639   saturated_constraint_set->size = 5;
640   saturated_constraint_set->data = xbt_new0(int, saturated_constraint_set->size);
641
642   xbt_swag_foreach_safe(cnst, cnst_next, cnst_list) {
643     /* INIT */
644     cnst->remaining = cnst->bound;
645     if (cnst->remaining == 0)
646       continue;
647     cnst->usage = 0;
648     elem_list = &(cnst->element_set);
649     xbt_swag_foreach(elem, elem_list) {
650       /* 0-weighted elements (ie, sleep actions) are at the end of the swag and we don't want to consider them */
651       if (elem->variable->weight <= 0)
652         break;
653       if ((elem->value > 0)) {
654         if (cnst->shared)
655           cnst->usage += elem->value / elem->variable->weight;
656         else if (cnst->usage < elem->value / elem->variable->weight)
657           cnst->usage = elem->value / elem->variable->weight;
658
659         make_elem_active(elem);
660         if (sys->keep_track)
661           xbt_swag_insert(elem->variable->id, sys->keep_track);
662       }
663     }
664     XBT_DEBUG("Constraint Usage '%d' : %f", cnst->id_int, cnst->usage);
665     /* Saturated constraints update */
666
667     if(cnst->usage > 0) {
668       cnst_light_tab[cnst_light_num].cnst = cnst;
669       cnst->cnst_light = &(cnst_light_tab[cnst_light_num]);
670       cnst_light_tab[cnst_light_num].remaining_over_usage = cnst->remaining / cnst->usage;
671       saturated_constraint_set_update(cnst_light_tab[cnst_light_num].remaining_over_usage,
672         cnst_light_num, saturated_constraint_set, &min_usage);
673       cnst_light_num++;
674     }
675   }
676
677   saturated_variable_set_update(  cnst_light_tab,
678                                   saturated_constraint_set,
679                                   sys);
680
681   /* Saturated variables update */
682
683   do {
684     /* Fix the variables that have to be */
685     var_list = &(sys->saturated_variable_set);
686
687     xbt_swag_foreach(var, var_list) {
688       if (var->weight <= 0.0)
689         DIE_IMPOSSIBLE;
690       /* First check if some of these variables have reach their upper
691          bound and update min_usage accordingly. */
692       XBT_DEBUG
693           ("var=%d, var->bound=%f, var->weight=%f, min_usage=%f, var->bound*var->weight=%f",
694            var->id_int, var->bound, var->weight, min_usage,
695            var->bound * var->weight);
696       if ((var->bound > 0) && (var->bound * var->weight < min_usage)) {
697         if (min_bound < 0)
698           min_bound = var->bound;
699         else
700           min_bound = MIN(min_bound, var->bound);
701         XBT_DEBUG("Updated min_bound=%f", min_bound);
702       }
703     }
704
705
706     while ((var = xbt_swag_getFirst(var_list))) {
707       int i;
708
709       if (min_bound < 0) {
710         var->value = min_usage / var->weight;
711       } else {
712         if (min_bound == var->bound)
713           var->value = var->bound;
714         else {
715           xbt_swag_remove(var, var_list);
716           continue;
717         }
718       }
719       XBT_DEBUG("Min usage: %f, Var(%d)->weight: %f, Var(%d)->value: %f ",
720              min_usage, var->id_int, var->weight, var->id_int, var->value);
721
722
723       /* Update usage */
724
725       for (i = 0; i < var->cnsts_number; i++) {
726         elem = &var->cnsts[i];
727         cnst = elem->constraint;
728         if (cnst->shared) {
729           double_update(&(cnst->remaining), elem->value * var->value);
730           double_update(&(cnst->usage), elem->value / var->weight);
731           if(cnst->usage<=0 || cnst->remaining<=0) {
732             if (cnst->cnst_light) {
733               int index = (cnst->cnst_light-cnst_light_tab);
734               XBT_DEBUG("index: %d \t cnst_light_num: %d \t || \t cnst: %p \t cnst->cnst_light: %p \t cnst_light_tab: %p ",
735                   index,cnst_light_num, cnst, cnst->cnst_light, cnst_light_tab);
736               cnst_light_tab[index]=cnst_light_tab[cnst_light_num-1];
737               cnst_light_tab[index].cnst->cnst_light = &cnst_light_tab[index];
738               cnst_light_num--;
739               cnst->cnst_light = NULL;
740             }
741           } else {
742             cnst->cnst_light->remaining_over_usage = cnst->remaining / cnst->usage;
743           }
744           make_elem_inactive(elem);
745         } else {
746           cnst->usage = 0.0;
747           make_elem_inactive(elem);
748           elem_list = &(cnst->element_set);
749           xbt_swag_foreach(elem, elem_list) {
750             if (elem->variable->weight <= 0 || elem->variable->value > 0)
751               break;
752             if (elem->value > 0)
753               cnst->usage = MAX(cnst->usage, elem->value / elem->variable->weight);
754           }
755           if (cnst->usage<=0 || cnst->remaining<=0) {
756             if(cnst->cnst_light) {
757               int index = (cnst->cnst_light-cnst_light_tab);
758               XBT_DEBUG("index: %d \t cnst_light_num: %d \t || \t cnst: %p \t cnst->cnst_light: %p \t cnst_light_tab: %p ",
759                   index,cnst_light_num, cnst, cnst->cnst_light, cnst_light_tab);
760               cnst_light_tab[index]=cnst_light_tab[cnst_light_num-1];
761               cnst_light_tab[index].cnst->cnst_light = &cnst_light_tab[index];
762               cnst_light_num--;
763               cnst->cnst_light = NULL;
764             }
765           } else {
766             cnst->cnst_light->remaining_over_usage = cnst->remaining / cnst->usage;
767           }
768         }
769       }
770       xbt_swag_remove(var, var_list);
771     }
772
773     /* Find out which variables reach the maximum */
774     min_usage = -1;
775     min_bound = -1;
776     saturated_constraint_set->pos = 0;
777     int pos;
778     for(pos=0; pos<cnst_light_num; pos++)
779       saturated_constraint_set_update(
780           cnst_light_tab[pos].remaining_over_usage,
781           pos,
782           saturated_constraint_set,
783           &min_usage);
784
785     saturated_variable_set_update(  cnst_light_tab,
786                                     saturated_constraint_set,
787                                     sys);
788
789   } while (cnst_light_num > 0);
790
791   sys->modified = 0;
792   if (sys->selective_update_active)
793     lmm_remove_all_modified_set(sys);
794
795   if (XBT_LOG_ISENABLED(surf_maxmin, xbt_log_priority_debug)) {
796     lmm_print(sys);
797   }
798
799   xbt_free(saturated_constraint_set->data);
800   xbt_free(saturated_constraint_set);
801   xbt_free(cnst_light_tab);
802   XBT_OUT();
803 }
804
805 /* Not a O(1) function */
806
807 void lmm_update(lmm_system_t sys, lmm_constraint_t cnst,
808                 lmm_variable_t var, double value)
809 {
810   int i;
811
812   for (i = 0; i < var->cnsts_number; i++)
813     if (var->cnsts[i].constraint == cnst) {
814       var->cnsts[i].value = value;
815       sys->modified = 1;
816       lmm_update_modified_set(sys, cnst);
817       return;
818     }
819 }
820
821 /** \brief Attribute the value bound to var->bound.
822  * 
823  *  \param sys the lmm_system_t
824  *  \param var the lmm_variable_t
825  *  \param bound the new bound to associate with var
826  * 
827  *  Makes var->bound equal to bound. Whenever this function is called 
828  *  a change is  signed in the system. To
829  *  avoid false system changing detection it is a good idea to test 
830  *  (bound != 0) before calling it.
831  *
832  */
833 void lmm_update_variable_bound(lmm_system_t sys, lmm_variable_t var,
834                                double bound)
835 {
836   sys->modified = 1;
837   var->bound = bound;
838
839   if (var->cnsts_number)
840     lmm_update_modified_set(sys, var->cnsts[0].constraint);
841 }
842
843
844 void lmm_update_variable_weight(lmm_system_t sys, lmm_variable_t var,
845                                 double weight)
846 {
847   int i;
848   lmm_element_t elem;
849
850   if (weight == var->weight)
851     return;
852   XBT_IN("(sys=%p, var=%p, weight=%f)", sys, var, weight);
853   sys->modified = 1;
854   var->weight = weight;
855   xbt_swag_remove(var, &(sys->variable_set));
856   if (weight)
857     xbt_swag_insert_at_head(var, &(sys->variable_set));
858   else
859     xbt_swag_insert_at_tail(var, &(sys->variable_set));
860
861   for (i = 0; i < var->cnsts_number; i++) {
862     elem = &var->cnsts[i];
863     xbt_swag_remove(elem, &(elem->constraint->element_set));
864     if (weight)
865       xbt_swag_insert_at_head(elem, &(elem->constraint->element_set));
866     else
867       xbt_swag_insert_at_tail(elem, &(elem->constraint->element_set));
868
869     if (i == 0)
870       lmm_update_modified_set(sys, elem->constraint);
871   }
872   if (!weight)
873     var->value = 0.0;
874
875   XBT_OUT();
876 }
877
878 XBT_INLINE double lmm_get_variable_weight(lmm_variable_t var)
879 {
880   return var->weight;
881 }
882
883 XBT_INLINE void lmm_update_constraint_bound(lmm_system_t sys,
884                                             lmm_constraint_t cnst,
885                                             double bound)
886 {
887   sys->modified = 1;
888   lmm_update_modified_set(sys, cnst);
889   cnst->bound = bound;
890 }
891
892 XBT_INLINE int lmm_constraint_used(lmm_system_t sys, lmm_constraint_t cnst)
893 {
894   return xbt_swag_belongs(cnst, &(sys->active_constraint_set));
895 }
896
897 XBT_INLINE lmm_constraint_t lmm_get_first_active_constraint(lmm_system_t
898                                                             sys)
899 {
900   return xbt_swag_getFirst(&(sys->active_constraint_set));
901 }
902
903 XBT_INLINE lmm_constraint_t lmm_get_next_active_constraint(lmm_system_t
904                                                            sys,
905                                                            lmm_constraint_t
906                                                            cnst)
907 {
908   return xbt_swag_getNext(cnst, (sys->active_constraint_set).offset);
909 }
910
911 #ifdef HAVE_LATENCY_BOUND_TRACKING
912 XBT_INLINE int lmm_is_variable_limited_by_latency(lmm_variable_t var)
913 {
914   return (double_equals(var->bound, var->value));
915 }
916 #endif
917
918
919 /** \brief Update the constraint set propagating recursively to
920  *  other constraints so the system should not be entirely computed.
921  *
922  *  \param sys the lmm_system_t
923  *  \param cnst the lmm_constraint_t affected by the change
924  *
925  *  A recursive algorithm to optimize the system recalculation selecting only
926  *  constraints that have changed. Each constraint change is propagated
927  *  to the list of constraints for each variable.
928  */
929 static void lmm_update_modified_set_rec(lmm_system_t sys,
930                                         lmm_constraint_t cnst)
931 {
932   lmm_element_t elem;
933
934   xbt_swag_foreach(elem, &cnst->element_set) {
935     lmm_variable_t var = elem->variable;
936     s_lmm_element_t *cnsts = var->cnsts;
937     int i;
938     for (i = 0; var->visited != sys->visited_counter
939              && i < var->cnsts_number ; i++) {
940       if (cnsts[i].constraint != cnst
941           && !xbt_swag_belongs(cnsts[i].constraint,
942                                &sys->modified_constraint_set)) {
943         xbt_swag_insert(cnsts[i].constraint, &sys->modified_constraint_set);
944         lmm_update_modified_set_rec(sys, cnsts[i].constraint);
945       }
946     }
947     var->visited = sys->visited_counter;
948   }
949 }
950
951 static void lmm_update_modified_set(lmm_system_t sys,
952                                     lmm_constraint_t cnst)
953 {
954   /* nothing to do if selective update isn't active */
955   if (sys->selective_update_active
956       && !xbt_swag_belongs(cnst, &sys->modified_constraint_set)) {
957     xbt_swag_insert(cnst, &sys->modified_constraint_set);
958     lmm_update_modified_set_rec(sys, cnst);
959   }
960 }
961
962 /** \brief Remove all constraints of the modified_constraint_set.
963  *
964  *  \param sys the lmm_system_t
965  */
966 static void lmm_remove_all_modified_set(lmm_system_t sys)
967 {
968   if (++sys->visited_counter == 1) {
969     /* the counter wrapped around, reset each variable->visited */
970     lmm_variable_t var;
971     xbt_swag_foreach(var, &sys->variable_set)
972       var->visited = 0;
973   }
974   xbt_swag_reset(&sys->modified_constraint_set);
975 }
976
977 /**
978  *  Returns total resource load
979  *
980  *  \param cnst the lmm_constraint_t associated to the resource
981  *
982  */
983 double lmm_constraint_get_usage(lmm_constraint_t cnst) {
984    double usage = 0.0;
985    xbt_swag_t elem_list = &(cnst->element_set);
986    lmm_element_t elem = NULL;
987
988    xbt_swag_foreach(elem, elem_list) {
989      /* 0-weighted elements (ie, sleep actions) are at the end of the swag and we don't want to consider them */
990      if (elem->variable->weight <= 0)
991        break;
992      if ((elem->value > 0)) {
993        if (cnst->shared)
994          usage += elem->value * elem->variable->value;
995        else if (usage < elem->value * elem->variable->value)
996          usage = elem->value * elem->variable->value;
997      }
998    }
999   return usage;
1000 }
1001
1002