surf_callback(void, void) surfExitCallbacks;
s_surf_model_description_t surf_plugin_description[] = {
- {"Energy",
- "Cpu energy consumption.",
- sg_energy_plugin_init},
- {NULL, NULL, NULL} /* this array must be NULL terminated */
+ {"Energy",
+ "Cpu energy consumption.",
+ sg_energy_plugin_init},
+ {NULL, NULL, NULL} /* this array must be NULL terminated */
};
/* Don't forget to update the option description in smx_config when you change this */
{
//FIXME: set the good function once and for all
if (p_updateMechanism == UM_LAZY)
- return shareResourcesLazy(now);
+ return shareResourcesLazy(now);
else if (p_updateMechanism == UM_FULL)
- return shareResourcesFull(now);
+ return shareResourcesFull(now);
else
- xbt_die("Invalid cpu update mechanism!");
+ xbt_die("Invalid cpu update mechanism!");
}
double Model::shareResourcesLazy(double now)
continue;
/* bogus priority, skip it */
- if (action->getPriority() <= 0 || action->getHeapActionType()==LATENCY)
+ if (action->getPriority() <= 0 || action->getHat()==LATENCY)
continue;
action->updateRemainingLazy(now);
action->getMaxDuration());
if (min != -1) {
- action->heapRemove();
- action->heapInsert(min, max_dur_flag ? MAX_DURATION : NORMAL);
+ action->heapRemove(p_actionHeap);
+ action->heapInsert(p_actionHeap, min, max_dur_flag ? MAX_DURATION : NORMAL);
XBT_DEBUG("Insert at heap action(%p) min %f now %f", action, min,
now);
} else DIE_IMPOSSIBLE;
}
//hereafter must have already the min value for this resource model
- if (!p_actionHeap->empty()) {
- min = p_actionHeap->topKey() - now;
- } else
+ if (xbt_heap_size(p_actionHeap) > 0)
+ min = xbt_heap_maxkey(p_actionHeap) - now;
+ else
min = -1;
XBT_DEBUG("The minimum with the HEAP %f", min);
ActionList::iterator it(running_actions->begin()), itend(running_actions->end());
for(; it != itend ; ++it) {
- action = &*it;
+ action = &*it;
value = lmm_variable_getvalue(action->getVariable());
if ((value > 0) || (action->getMaxDuration() >= 0))
break;
xbt_dict_t Resource::getProperties() {
if (p_properties==NULL)
- p_properties = xbt_dict_new();
+ p_properties = xbt_dict_new();
return p_properties;
}
p_stateSet = NULL;
if (p_stateSet)
- p_stateSet->push_back(*this);
+ p_stateSet->push_back(*this);
XBT_OUT();
}
lmm_update_variable_bound(getModel()->getMaxminSystem(), getVariable(), bound);
if (getModel()->getUpdateMechanism() == UM_LAZY && getLastUpdate()!=surf_get_clock())
- heapRemove();
+ heapRemove(getModel()->getActionHeap());
XBT_OUT();
}
XBT_IN("(%p,%g)", this, duration);
m_maxDuration = duration;
if (getModel()->getUpdateMechanism() == UM_LAZY) // remove action from the heap
- heapRemove();
+ heapRemove(getModel()->getActionHeap());
XBT_OUT();
}
lmm_update_variable_weight(getModel()->getMaxminSystem(), getVariable(), priority);
if (getModel()->getUpdateMechanism() == UM_LAZY)
- heapRemove();
+ heapRemove(getModel()->getActionHeap());
XBT_OUT();
}
void Action::cancel(){
setState(SURF_ACTION_FAILED);
if (getModel()->getUpdateMechanism() == UM_LAZY) {
- if (actionLmmHook::is_linked())
- getModel()->getModifiedSet()->erase(getModel()->getModifiedSet()->iterator_to(*this));
- heapRemove();
+ if (actionLmmHook::is_linked())
+ getModel()->getModifiedSet()->erase(getModel()->getModifiedSet()->iterator_to(*this));
+ heapRemove(getModel()->getActionHeap());
}
}
int Action::unref(){
m_refcount--;
if (!m_refcount) {
- if (actionHook::is_linked())
- p_stateSet->erase(p_stateSet->iterator_to(*this));
- if (getVariable())
- lmm_variable_free(getModel()->getMaxminSystem(), getVariable());
- if (getModel()->getUpdateMechanism() == UM_LAZY) {
- /* remove from heap */
- heapRemove();
+ if (actionHook::is_linked())
+ p_stateSet->erase(p_stateSet->iterator_to(*this));
+ if (getVariable())
+ lmm_variable_free(getModel()->getMaxminSystem(), getVariable());
+ if (getModel()->getUpdateMechanism() == UM_LAZY) {
+ /* remove from heap */
+ heapRemove(getModel()->getActionHeap());
if (actionLmmHook::is_linked())
- getModel()->getModifiedSet()->erase(getModel()->getModifiedSet()->iterator_to(*this));
+ getModel()->getModifiedSet()->erase(getModel()->getModifiedSet()->iterator_to(*this));
}
- delete this;
- return 1;
+ delete this;
+ return 1;
}
return 0;
}
lmm_update_variable_weight(getModel()->getMaxminSystem(), getVariable(), 0.0);
m_suspended = 1;
if (getModel()->getUpdateMechanism() == UM_LAZY)
- heapRemove();
+ heapRemove(getModel()->getActionHeap());
}
XBT_OUT();
}
lmm_update_variable_weight(getModel()->getMaxminSystem(), getVariable(), m_priority);
m_suspended = 0;
if (getModel()->getUpdateMechanism() == UM_LAZY)
- heapRemove();
+ heapRemove(getModel()->getActionHeap());
}
XBT_OUT();
}
* LATENCY = this is a heap entry to warn us when the latency is payed
* MAX_DURATION =this is a heap entry to warn us when the max_duration limit is reached
*/
-void Action::heapInsert(double key, enum heap_action_type hat)
+void Action::heapInsert(xbt_heap_t heap, double key, enum heap_action_type hat)
{
m_hat = hat;
- sp_heapHandle = getModel()->getActionHeap()->push(key, this);
+ xbt_heap_push(heap, this, key);
}
-void Action::heapRemove()
+void Action::heapRemove(xbt_heap_t heap)
{
m_hat = NOTSET;
- if (sp_heapHandle) {
- getModel()->getActionHeap()->erase(sp_heapHandle);
- sp_heapHandle.reset();
+ if (m_indexHeap >= 0) {
+ xbt_heap_remove(heap, m_indexHeap);
}
}
+/* added to manage the communication action's heap */
+void surf_action_lmm_update_index_heap(void *action, int i) {
+ ((ActionPtr)action)->updateIndexHeap(i);
+}
+
+void Action::updateIndexHeap(int i) {
+ m_indexHeap = i;
+}
+
double Action::getRemains()
{
XBT_IN("(%p)", this);
(lmm_get_variable_weight(getVariable()) > 0)) {
finish();
setState(SURF_ACTION_DONE);
- heapRemove();
+ heapRemove(getModel()->getActionHeap());
} else if (((m_maxDuration != NO_MAX_DURATION)
&& (m_maxDuration <= 0))) {
finish();
setState(SURF_ACTION_DONE);
- heapRemove();
+ heapRemove(getModel()->getActionHeap());
}
}