3 /* Copyright (c) 2004 Arnaud Legrand. All rights reserved. */
5 /* This program is free software; you can redistribute it and/or modify it
6 * under the terms of the license (GNU LGPL) which comes with this package. */
9 #include "xbt/sysdep.h"
11 #include "xbt/mallocator.h"
12 #include "maxmin_private.h"
14 #include <stdio.h> /* sprintf */
16 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_maxmin, surf,
17 "Logging specific to SURF (maxmin)");
19 static void *lmm_variable_mallocator_new_f(void);
20 static void lmm_variable_mallocator_free_f(void *var);
21 static void lmm_variable_mallocator_reset_f(void *var);
23 lmm_system_t lmm_system_new(void)
25 lmm_system_t l = NULL;
27 s_lmm_constraint_t cnst;
29 l = xbt_new0(s_lmm_system_t, 1);
32 xbt_swag_init(&(l->variable_set),
33 xbt_swag_offset(var, variable_set_hookup));
34 xbt_swag_init(&(l->constraint_set),
35 xbt_swag_offset(cnst, constraint_set_hookup));
37 xbt_swag_init(&(l->active_constraint_set),
38 xbt_swag_offset(cnst, active_constraint_set_hookup));
40 xbt_swag_init(&(l->saturated_variable_set),
41 xbt_swag_offset(var, saturated_variable_set_hookup));
42 xbt_swag_init(&(l->saturated_constraint_set),
43 xbt_swag_offset(cnst, saturated_constraint_set_hookup));
45 l->variable_mallocator = xbt_mallocator_new(64,
46 lmm_variable_mallocator_new_f,
47 lmm_variable_mallocator_free_f,
48 lmm_variable_mallocator_reset_f);
53 void lmm_system_free(lmm_system_t sys)
55 lmm_variable_t var = NULL;
56 lmm_constraint_t cnst = NULL;
58 while ((var = extract_variable(sys)))
59 lmm_var_free(sys, var);
61 while ((cnst = extract_constraint(sys)))
62 lmm_cnst_free(sys, cnst);
64 xbt_mallocator_free(sys->variable_mallocator);
68 void lmm_variable_disable(lmm_system_t sys, lmm_variable_t var)
71 lmm_element_t elem = NULL;
73 XBT_IN2("(sys=%p, var=%p)", sys, var);
76 for (i = 0; i < var->cnsts_number; i++) {
77 elem = &var->cnsts[i];
78 xbt_swag_remove(elem, &(elem->constraint->element_set));
79 xbt_swag_remove(elem, &(elem->constraint->active_element_set));
80 if (!xbt_swag_size(&(elem->constraint->element_set)))
81 make_constraint_inactive(sys, elem->constraint);
83 var->cnsts_number = 0;
87 static void lmm_var_free(lmm_system_t sys, lmm_variable_t var)
90 lmm_variable_disable(sys, var);
92 xbt_mallocator_release(sys->variable_mallocator, var);
95 static void lmm_cnst_free(lmm_system_t sys, lmm_constraint_t cnst)
97 /* xbt_assert0(xbt_swag_size(&(cnst->element_set)), */
98 /* "This list should be empty!"); */
99 remove_active_constraint(sys, cnst);
103 lmm_constraint_t lmm_constraint_new(lmm_system_t sys, void *id,
106 lmm_constraint_t cnst = NULL;
107 s_lmm_element_t elem;
109 cnst = xbt_new0(s_lmm_constraint_t, 1);
111 xbt_swag_init(&(cnst->element_set),
112 xbt_swag_offset(elem, element_set_hookup));
113 xbt_swag_init(&(cnst->active_element_set),
114 xbt_swag_offset(elem, active_element_set_hookup));
116 cnst->bound = bound_value;
119 insert_constraint(sys, cnst);
124 void lmm_constraint_shared(lmm_constraint_t cnst)
129 int lmm_constraint_is_shared(lmm_constraint_t cnst)
131 return (cnst->shared);
134 void lmm_constraint_free(lmm_system_t sys, lmm_constraint_t cnst)
136 remove_constraint(sys, cnst);
137 lmm_cnst_free(sys, cnst);
140 static void *lmm_variable_mallocator_new_f(void)
142 return xbt_new(s_lmm_variable_t, 1);
145 static void lmm_variable_mallocator_free_f(void *var)
150 static void lmm_variable_mallocator_reset_f(void *var)
152 /* memset to zero like calloc */
153 memset(var, 0, sizeof(s_lmm_variable_t));
156 lmm_variable_t lmm_variable_new(lmm_system_t sys, void *id,
158 double bound, int number_of_constraints)
160 lmm_variable_t var = NULL;
163 XBT_IN5("(sys=%p, id=%p, weight=%f, bound=%f, num_cons =%d)",
164 sys, id, weight, bound, number_of_constraints);
166 var = xbt_mallocator_get(sys->variable_mallocator);
168 var->cnsts = xbt_new0(s_lmm_element_t, number_of_constraints);
169 for (i = 0; i < number_of_constraints; i++) {
170 /* Should be useless because of the
171 calloc but it seems to help valgrind... */
172 var->cnsts[i].element_set_hookup.next = NULL;
173 var->cnsts[i].element_set_hookup.prev = NULL;
174 var->cnsts[i].active_element_set_hookup.next = NULL;
175 var->cnsts[i].active_element_set_hookup.prev = NULL;
176 var->cnsts[i].constraint = NULL;
177 var->cnsts[i].variable = NULL;
178 var->cnsts[i].value = 0.0;
180 var->cnsts_size = number_of_constraints;
181 var->cnsts_number = 0; /* Should be useless because of the
182 calloc but it seems to help valgrind... */
183 var->weight = weight;
188 var->func_f = func_f_def;
189 var->func_fp = func_fp_def;
190 var->func_fpi = func_fpi_def;
193 xbt_swag_insert_at_head(var, &(sys->variable_set));
195 xbt_swag_insert_at_tail(var, &(sys->variable_set));
200 void lmm_variable_free(lmm_system_t sys, lmm_variable_t var)
202 remove_variable(sys, var);
203 lmm_var_free(sys, var);
206 double lmm_variable_getvalue(lmm_variable_t var)
211 double lmm_variable_getbound(lmm_variable_t var)
216 void lmm_expand(lmm_system_t sys, lmm_constraint_t cnst,
217 lmm_variable_t var, double value)
219 lmm_element_t elem = NULL;
223 xbt_assert0(var->cnsts_number < var->cnsts_size, "Too much constraints");
225 elem = &(var->cnsts[var->cnsts_number++]);
228 elem->constraint = cnst;
229 elem->variable = var;
232 xbt_swag_insert_at_head(elem, &(elem->constraint->element_set));
234 xbt_swag_insert_at_tail(elem, &(elem->constraint->element_set));
236 make_constraint_active(sys, cnst);
239 void lmm_expand_add(lmm_system_t sys, lmm_constraint_t cnst,
240 lmm_variable_t var, double value)
245 for (i = 0; i < var->cnsts_number; i++)
246 if (var->cnsts[i].constraint == cnst)
249 if (i < var->cnsts_number) {
250 if(cnst->shared) var->cnsts[i].value += value;
251 else var->cnsts[i].value = MAX(var->cnsts[i].value,value);
253 lmm_expand(sys, cnst, var, value);
256 void lmm_elem_set_value(lmm_system_t sys, lmm_constraint_t cnst,
257 lmm_variable_t var, double value)
261 for (i = 0; i < var->cnsts_number; i++)
262 if (var->cnsts[i].constraint == cnst)
265 if (i < var->cnsts_number) {
266 var->cnsts[i].value = value;
272 lmm_constraint_t lmm_get_cnst_from_var(lmm_system_t sys,
273 lmm_variable_t var, int num)
275 if (num < var->cnsts_number)
276 return (var->cnsts[num].constraint);
281 int lmm_get_number_of_cnst_from_var(lmm_system_t sys, lmm_variable_t var)
283 return (var->cnsts_number);
286 lmm_variable_t lmm_get_var_from_cnst(lmm_system_t sys,
287 lmm_constraint_t cnst,
288 lmm_element_t * elem)
291 *elem = xbt_swag_getFirst(&(cnst->element_set));
293 *elem = xbt_swag_getNext(*elem, cnst->element_set.offset);
295 return (*elem)->variable;
300 void *lmm_constraint_id(lmm_constraint_t cnst)
305 void *lmm_variable_id(lmm_variable_t var)
310 static void saturated_constraint_set_update(lmm_system_t sys,
311 lmm_constraint_t cnst,
314 lmm_constraint_t useless_cnst = NULL;
316 XBT_IN3("sys=%p, cnst=%p, min_usage=%f", sys, cnst, *min_usage);
317 if (cnst->usage <= 0) {
321 if (cnst->remaining <= 0) {
325 if ((*min_usage < 0) || (*min_usage > cnst->remaining / cnst->usage)) {
326 *min_usage = cnst->remaining / cnst->usage;
327 LOG3(xbt_log_priority_trace,
328 "min_usage=%f (cnst->remaining=%f, cnst->usage=%f)", *min_usage,
329 cnst->remaining, cnst->usage);
330 while ((useless_cnst =
331 xbt_swag_getFirst(&(sys->saturated_constraint_set))))
332 xbt_swag_remove(useless_cnst, &(sys->saturated_constraint_set));
334 xbt_swag_insert(cnst, &(sys->saturated_constraint_set));
335 } else if (*min_usage == cnst->remaining / cnst->usage) {
336 xbt_swag_insert(cnst, &(sys->saturated_constraint_set));
341 static void saturated_variable_set_update(lmm_system_t sys)
343 lmm_constraint_t cnst = NULL;
344 xbt_swag_t cnst_list = NULL;
345 lmm_element_t elem = NULL;
346 xbt_swag_t elem_list = NULL;
348 cnst_list = &(sys->saturated_constraint_set);
349 while ((cnst = xbt_swag_getFirst(cnst_list))) {
350 elem_list = &(cnst->active_element_set);
351 xbt_swag_foreach(elem, elem_list) {
352 if (elem->variable->weight <= 0)
354 if ((elem->value > 0))
355 xbt_swag_insert(elem->variable, &(sys->saturated_variable_set));
357 xbt_swag_remove(cnst, cnst_list);
361 void lmm_print(lmm_system_t sys)
363 lmm_constraint_t cnst = NULL;
364 lmm_element_t elem = NULL;
365 lmm_variable_t var = NULL;
366 xbt_swag_t cnst_list = NULL;
367 xbt_swag_t var_list = NULL;
368 xbt_swag_t elem_list = NULL;
369 char print_buf[1024];
370 char *trace_buf = xbt_malloc0(sizeof(char));
373 /* Printing Objective */
374 var_list = &(sys->variable_set);
375 sprintf(print_buf, "MAX-MIN ( ");
377 xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
378 strcat(trace_buf, print_buf);
379 xbt_swag_foreach(var, var_list) {
380 sprintf(print_buf, "'%p'(%f) ", var, var->weight);
382 xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
383 strcat(trace_buf, print_buf);
385 sprintf(print_buf, ")");
387 xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
388 strcat(trace_buf, print_buf);
389 DEBUG1("%s", trace_buf);
390 trace_buf[0] = '\000';
392 DEBUG0("Constraints");
393 /* Printing Constraints */
394 cnst_list = &(sys->active_constraint_set);
395 xbt_swag_foreach(cnst, cnst_list) {
397 elem_list = &(cnst->element_set);
398 sprintf(print_buf, "\t");
400 xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
401 strcat(trace_buf, print_buf);
402 xbt_swag_foreach(elem, elem_list) {
403 sprintf(print_buf, "%f.'%p'(%f) + ", elem->value,
404 elem->variable, elem->variable->value);
406 xbt_realloc(trace_buf,
407 strlen(trace_buf) + strlen(print_buf) + 1);
408 strcat(trace_buf, print_buf);
409 sum += elem->value * elem->variable->value;
411 sprintf(print_buf, "0 <= %f ('%p')", cnst->bound, cnst);
413 xbt_realloc(trace_buf, strlen(trace_buf) + strlen(print_buf) + 1);
414 strcat(trace_buf, print_buf);
417 sprintf(print_buf, " [MAX-Constraint]");
419 xbt_realloc(trace_buf,
420 strlen(trace_buf) + strlen(print_buf) + 1);
421 strcat(trace_buf, print_buf);
423 DEBUG1("%s", trace_buf);
424 trace_buf[0] = '\000';
425 xbt_assert3(!double_positive(sum - cnst->bound),
426 "Incorrect value (%f is not smaller than %f): %g",
427 sum, cnst->bound, sum - cnst->bound);
431 /* Printing Result */
432 xbt_swag_foreach(var, var_list) {
433 if (var->bound > 0) {
434 DEBUG4("'%p'(%f) : %f (<=%f)", var, var->weight, var->value,
436 xbt_assert2(!double_positive(var->value - var->bound),
437 "Incorrect value (%f is not smaller than %f",
438 var->value, var->bound);
440 DEBUG3("'%p'(%f) : %f", var, var->weight, var->value);
446 void lmm_solve(lmm_system_t sys)
448 lmm_variable_t var = NULL;
449 lmm_constraint_t cnst = NULL;
450 lmm_element_t elem = NULL;
451 xbt_swag_t cnst_list = NULL;
452 xbt_swag_t var_list = NULL;
453 xbt_swag_t elem_list = NULL;
454 double min_usage = -1;
456 if (!(sys->modified))
460 var_list = &(sys->variable_set);
461 DEBUG1("Variable set : %d", xbt_swag_size(var_list));
462 xbt_swag_foreach(var, var_list) {
465 if(var->weight<=0.0) break;
467 for (i = 0; i < var->cnsts_number; i++) {
468 if(var->cnsts[i].value==0.0) nb++;
470 if((nb==var->cnsts_number) && (var->weight>0.0))
475 * Compute Usage and store the variables that reach the maximum.
477 cnst_list = &(sys->active_constraint_set);
478 DEBUG1("Active constraints : %d", xbt_swag_size(cnst_list));
479 xbt_swag_foreach(cnst, cnst_list) {
481 cnst->remaining = cnst->bound;
483 elem_list = &(cnst->element_set);
485 xbt_swag_foreach(elem, elem_list) {
486 if (elem->variable->weight <= 0)
488 if ((elem->value > 0)) {
490 cnst->usage += elem->value / elem->variable->weight;
491 else if (cnst->usage < elem->value / elem->variable->weight)
492 cnst->usage = elem->value / elem->variable->weight;
493 DEBUG2("Constraint Usage %p : %f", cnst, cnst->usage);
494 make_elem_active(elem);
497 /* Saturated constraints update */
498 saturated_constraint_set_update(sys, cnst, &min_usage);
500 saturated_variable_set_update(sys);
502 /* Saturated variables update */
505 /* Fix the variables that have to be */
506 var_list = &(sys->saturated_variable_set);
508 xbt_swag_foreach(var, var_list) {
509 if(var->weight<=0.0) DIE_IMPOSSIBLE;
510 /* First check if some of these variables have reach their upper
511 bound and update min_usage accordingly. */
513 ("var=%p, var->bound=%f, var->weight=%f, min_usage=%f, var->bound*var->weight=%f",
514 var, var->bound, var->weight, min_usage,
515 var->bound * var->weight);
516 if ((var->bound > 0) && (var->bound * var->weight < min_usage)) {
517 min_usage = var->bound * var->weight;
518 DEBUG1("Updated min_usage=%f", min_usage);
523 while ((var = xbt_swag_getFirst(var_list))) {
526 var->value = min_usage / var->weight;
527 DEBUG5("Min usage: %f, Var(%p)->weight: %f, Var(%p)->value: %f ",
528 min_usage, var, var->weight, var, var->value);
533 for (i = 0; i < var->cnsts_number; i++) {
534 elem = &var->cnsts[i];
535 cnst = elem->constraint;
537 double_update(&(cnst->remaining), elem->value * var->value);
538 double_update(&(cnst->usage), elem->value / var->weight);
539 make_elem_inactive(elem);
540 } else { /* FIXME one day: We recompute usage.... :( */
542 make_elem_inactive(elem);
543 xbt_swag_foreach(elem, elem_list) {
544 if (elem->variable->weight <= 0)
546 if (elem->variable->value > 0)
548 if ((elem->value > 0)) {
549 if (cnst->usage < elem->value / elem->variable->weight)
550 cnst->usage = elem->value / elem->variable->weight;
551 DEBUG2("Constraint Usage %p : %f", cnst, cnst->usage);
552 make_elem_active(elem);
557 xbt_swag_remove(var, var_list);
560 /* Find out which variables reach the maximum */
561 cnst_list = &(sys->active_constraint_set);
563 xbt_swag_foreach(cnst, cnst_list) {
564 saturated_constraint_set_update(sys, cnst, &min_usage);
566 saturated_variable_set_update(sys);
568 } while (xbt_swag_size(&(sys->saturated_variable_set)));
571 if (XBT_LOG_ISENABLED(surf_maxmin, xbt_log_priority_debug)) {
576 /* Not a O(1) function */
578 void lmm_update(lmm_system_t sys, lmm_constraint_t cnst,
579 lmm_variable_t var, double value)
584 for (i = 0; i < var->cnsts_number; i++)
585 if (var->cnsts[i].constraint == cnst) {
586 var->cnsts[i].value = value;
591 /** \brief Attribute the value bound to var->bound.
593 * \param sys the lmm_system_t
594 * \param var the lmm_variable_t
595 * \param bound the new bound to associate with var
597 * Makes var->bound equal to bound. Whenever this function is called
598 * a change is signed in the system. To
599 * avoid false system changing detection it is a good idea to test
600 * (bound != 0) before calling it.
603 void lmm_update_variable_bound(lmm_system_t sys, lmm_variable_t var,
610 /** \brief Add the value delta to var->df (the sum of latencies).
612 * \param sys the lmm_system_t associated
613 * \param var the lmm_variable_t which need to updated
614 * \param delta the variation of the latency
616 * Add the value delta to var->df (the sum of latencys associated to the
617 * flow). Whenever this function is called a change is signed in the system. To
618 * avoid false system changing detection it is a good idea to test
619 * (delta != 0) before calling it.
622 void lmm_update_variable_latency(lmm_system_t sys, lmm_variable_t var,
629 void lmm_update_variable_weight(lmm_system_t sys, lmm_variable_t var,
635 if(weight==var->weight) return;
636 XBT_IN3("(sys=%p, var=%p, weight=%f)", sys, var, weight);
638 var->weight = weight;
639 xbt_swag_remove(var, &(sys->variable_set));
641 xbt_swag_insert_at_head(var, &(sys->variable_set));
643 xbt_swag_insert_at_tail(var, &(sys->variable_set));
645 for (i = 0; i < var->cnsts_number; i++) {
646 elem = &var->cnsts[i];
647 xbt_swag_remove(elem, &(elem->constraint->element_set));
649 xbt_swag_insert_at_head(elem, &(elem->constraint->element_set));
651 xbt_swag_insert_at_tail(elem, &(elem->constraint->element_set));
659 double lmm_get_variable_weight(lmm_variable_t var)
664 void lmm_update_constraint_bound(lmm_system_t sys, lmm_constraint_t cnst,
671 int lmm_constraint_used(lmm_system_t sys, lmm_constraint_t cnst)
673 return xbt_swag_belongs(cnst, &(sys->active_constraint_set));
676 lmm_constraint_t lmm_get_first_active_constraint(lmm_system_t sys)
678 return xbt_swag_getFirst(&(sys->active_constraint_set));
681 lmm_constraint_t lmm_get_next_active_constraint(lmm_system_t sys,
682 lmm_constraint_t cnst)
684 return xbt_swag_getNext(cnst, (sys->active_constraint_set).offset);