A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
| inline |
side by side
Spell check.
[simgrid.git]
/
src
/
kernel
/
lmm
/
maxmin.cpp
diff --git
a/src/kernel/lmm/maxmin.cpp
b/src/kernel/lmm/maxmin.cpp
index
25a5f24
..
10499a0
100644
(file)
--- a/
src/kernel/lmm/maxmin.cpp
+++ b/
src/kernel/lmm/maxmin.cpp
@@
-31,7
+31,7
@@
int Element::get_concurrency() const
{
// Ignore element with weight less than one (e.g. cross-traffic)
return (consumption_weight >= 1) ? 1 : 0;
- // There are other alternatives, but they will change the behavio
u
r of the model..
+ // There are other alternatives, but they will change the behavior of the model..
// So do not use it unless you want to make a new model.
// If you do, remember to change the variables concurrency share to reflect it.
// Potential examples are:
@@
-151,7
+151,7
@@
System::~System()
Constraint* cnst;
while ((var = extract_variable())) {
- auto demangled = simgrid::xbt::demangle(
typeid(*var->id_).name()
);
+ auto demangled = simgrid::xbt::demangle(
var->id_ ? typeid(*var->id_).name() : "(unidentified)"
);
XBT_WARN("Probable bug: a %s variable (#%d) not removed before the LMM system destruction.", demangled.get(),
var->rank_);
var_free(var);
@@
-169,7
+169,7
@@
void System::cnst_free(Constraint* cnst)
delete cnst;
}
-Constraint::Constraint(
void
* id_value, double bound_value) : bound_(bound_value), id_(id_value)
+Constraint::Constraint(
resource::Resource
* id_value, double bound_value) : bound_(bound_value), id_(id_value)
{
rank_ = next_rank_++;
@@
-185,7
+185,7
@@
Constraint::Constraint(void* id_value, double bound_value) : bound_(bound_value)
cnst_light_ = nullptr;
}
-Constraint* System::constraint_new(
void
* id, double bound_value)
+Constraint* System::constraint_new(
resource::Resource
* id, double bound_value)
{
Constraint* cnst = new Constraint(id, bound_value);
insert_constraint(cnst);
@@
-224,12
+224,19
@@
void System::variable_free(Variable* var)
var_free(var);
}
+void System::variable_free_all()
+{
+ Variable* var;
+ while ((var = extract_variable()))
+ variable_free(var);
+}
+
void System::expand(Constraint* cnst, Variable* var, double consumption_weight)
{
modified_ = true;
// Check if this variable already has an active element in this constraint
- // If it does, sub
s
tract it from the required slack
+ // If it does, subtract it from the required slack
int current_share = 0;
if (var->concurrency_share_ > 1) {
for (Element& elem : var->cnsts_) {
@@
-590,7
+597,7
@@
template <class CnstList> void System::lmm_solve(CnstList& cnst_list)
XBT_DEBUG("Min usage: %f, Var(%d).penalty: %f, Var(%d).value: %f ", min_usage, var.rank_, var.sharing_penalty_,
var.rank_, var.value_);
- /* Update the usage of contraints where this variable is involved */
+ /* Update the usage of con
s
traints where this variable is involved */
for (Element& elem : var.cnsts_) {
Constraint* cnst = elem.constraint;
if (cnst->sharing_policy_ != s4u::Link::SharingPolicy::FATPIPE) {
@@
-610,7
+617,9
@@
template <class CnstList> void System::lmm_solve(CnstList& cnst_list)
cnst->cnst_light_ = nullptr;
}
} else {
- cnst->cnst_light_->remaining_over_usage = cnst->remaining_ / cnst->usage_;
+ if (cnst->cnst_light_) {
+ cnst->cnst_light_->remaining_over_usage = cnst->remaining_ / cnst->usage_;
+ }
}
elem.make_inactive();
} else {
@@
-639,10
+648,12
@@
template <class CnstList> void System::lmm_solve(CnstList& cnst_list)
cnst->cnst_light_ = nullptr;
}
} else {
- cnst->cnst_light_->remaining_over_usage = cnst->remaining_ / cnst->usage_;
- xbt_assert(not cnst->active_element_set_.empty(),
- "Should not keep a maximum constraint that has no active"
- " element! You want to check the maxmin precision and possible rounding effects.");
+ if (cnst->cnst_light_) {
+ cnst->cnst_light_->remaining_over_usage = cnst->remaining_ / cnst->usage_;
+ xbt_assert(not cnst->active_element_set_.empty(),
+ "Should not keep a maximum constraint that has no active"
+ " element! You want to check the maxmin precision and possible rounding effects.");
+ }
}
}
}
@@
-916,7
+927,7
@@
void System::remove_all_modified_set()
// In effect, the var->visited value will no more be equal to visited counter
// To be clean, when visited counter has wrapped around, we force these var->visited values so that variables that
// were in the modified a long long time ago are not wrongly skipped here, which would lead to very nasty bugs
- // (i.e. not readi
bi
ly reproducible, and requiring a lot of run time before happening).
+ // (i.e. not readily reproducible, and requiring a lot of run time before happening).
if (++visited_counter_ == 1) {
/* the counter wrapped around, reset each variable->visited */
for (Variable& var : variable_set)