1 /* Copyright (c) 2013-2015. The SimGrid Team.
2 * All rights reserved. */
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. */
8 #include "trace_mgr_private.h"
11 #ifndef SURF_MODEL_CPUTI_H_
12 #define SURF_MODEL_CPUTI_H_
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_cpu_ti, surf_cpu,
15 "Logging specific to the SURF CPU TRACE INTEGRATION module");
21 void cpu_ti_action_update_index_heap(void *action, int i)
23 ((simgrid::surf::CpuTiAction*)action)->updateIndexHeap(i);
30 CpuTiTrace::CpuTiTrace(tmgr_trace_t speedTrace)
37 p_timePoints = (double*) xbt_malloc0(sizeof(double) *
38 (xbt_dynar_length(speedTrace->s_list.event_list) + 1));
39 p_integral = (double*) xbt_malloc0(sizeof(double) *
40 (xbt_dynar_length(speedTrace->s_list.event_list) + 1));
41 m_nbPoints = xbt_dynar_length(speedTrace->s_list.event_list) + 1;
42 xbt_dynar_foreach(speedTrace->s_list.event_list, cpt, val) {
43 p_timePoints[i] = time;
44 p_integral[i] = integral;
45 integral += val.delta * val.value;
49 p_timePoints[i] = time;
50 p_integral[i] = integral;
53 CpuTiTrace::~CpuTiTrace()
55 xbt_free(p_timePoints);
59 CpuTiTgmr::~CpuTiTgmr()
66 * \brief Integrate trace
68 * Wrapper around surf_cpu_integrate_trace_simple() to get
71 * \param trace Trace structure.
72 * \param a Begin of interval
73 * \param b End of interval
74 * \return the integrate value. -1 if an error occurs.
76 double CpuTiTgmr::integrate(double a, double b)
83 if ((a < 0.0) || (a > b)) {
85 ("Error, invalid integration interval [%.2f,%.2f]. You probably have a task executing with negative computation amount. Check your code.",
92 if (m_type == TRACE_FIXED) {
93 return ((b - a) * m_value);
96 if (ceil(a / m_lastTime) == a / m_lastTime)
97 a_index = 1 + (int) (ceil(a / m_lastTime));
99 a_index = (int) (ceil(a / m_lastTime));
101 b_index = (int) (floor(b / m_lastTime));
103 if (a_index > b_index) { /* Same chunk */
104 return p_trace->integrateSimple(a - (a_index -
111 first_chunk = p_trace->integrateSimple(a - (a_index -
115 middle_chunk = (b_index - a_index) * m_total;
116 last_chunk = p_trace->integrateSimple(0.0,
121 XBT_DEBUG("first_chunk=%.2f middle_chunk=%.2f last_chunk=%.2f\n",
122 first_chunk, middle_chunk, last_chunk);
124 return (first_chunk + middle_chunk + last_chunk);
128 * \brief Auxiliary function to compute the integral between a and b.
129 * It simply computes the integrals at point a and b and returns the difference between them.
130 * \param trace Trace structure
131 * \param a Initial point
132 * \param b Final point
135 double CpuTiTrace::integrateSimple(double a, double b)
137 return integrateSimplePoint(b) - integrateSimplePoint(a);
141 * \brief Auxiliary function to compute the integral at point a.
142 * \param trace Trace structure
146 double CpuTiTrace::integrateSimplePoint(double a)
151 ind = binarySearch(p_timePoints, a, 0, m_nbPoints - 1);
152 integral += p_integral[ind];
154 ("a %f ind %d integral %f ind + 1 %f ind %f time +1 %f time %f",
155 a, ind, integral, p_integral[ind + 1], p_integral[ind],
156 p_timePoints[ind + 1], p_timePoints[ind]);
157 double_update(&a_aux, p_timePoints[ind], sg_maxmin_precision*sg_surf_precision);
160 ((p_integral[ind + 1] -
161 p_integral[ind]) / (p_timePoints[ind + 1] -
162 p_timePoints[ind])) * (a - p_timePoints[ind]);
163 XBT_DEBUG("Integral a %f = %f", a, integral);
169 * \brief Computes the time needed to execute "amount" on cpu.
171 * Here, amount can span multiple trace periods
173 * \param trace CPU trace structure
174 * \param a Initial time
175 * \param amount Amount to be executed
178 double CpuTiTgmr::solve(double a, double amount)
182 double reduced_amount;
186 /* Fix very small negative numbers */
187 if ((a < 0.0) && (a > -EPSILON)) {
190 if ((amount < 0.0) && (amount > -EPSILON)) {
195 if ((a < 0.0) || (amount < 0.0)) {
197 ("Error, invalid parameters [a = %.2f, amount = %.2f]. You probably have a task executing with negative computation amount. Check your code.",
202 /* At this point, a and amount are positive */
204 if (amount < EPSILON)
207 /* Is the trace fixed ? */
208 if (m_type == TRACE_FIXED) {
209 return (a + (amount / m_value));
212 XBT_DEBUG("amount %f total %f", amount, m_total);
213 /* Reduce the problem to one where amount <= trace_total */
214 quotient = (int) (floor(amount / m_total));
215 reduced_amount = (m_total) * ((amount / m_total) -
216 floor(amount / m_total));
217 reduced_a = a - (m_lastTime) * (int) (floor(a / m_lastTime));
219 XBT_DEBUG("Quotient: %d reduced_amount: %f reduced_a: %f", quotient,
220 reduced_amount, reduced_a);
222 /* Now solve for new_amount which is <= trace_total */
224 fprintf(stderr,"reduced_a = %.2f\n",reduced_a);
225 fprintf(stderr,"reduced_amount = %.2f\n",reduced_amount);
227 reduced_b = solveSomewhatSimple(reduced_a, reduced_amount);
229 /* Re-map to the original b and amount */
230 b = (m_lastTime) * (int) (floor(a / m_lastTime)) +
231 (quotient * m_lastTime) + reduced_b;
236 * \brief Auxiliary function to solve integral
238 * Here, amount is <= trace->total
239 * and a <=trace->last_time
242 double CpuTiTgmr::solveSomewhatSimple(double a, double amount)
244 double amount_till_end;
247 XBT_DEBUG("Solve integral: [%.2f, amount=%.2f]", a, amount);
248 amount_till_end = integrate(a, m_lastTime);
250 fprintf(stderr,"amount_till_end=%.2f\n",amount_till_end);
253 if (amount_till_end > amount) {
254 b = p_trace->solveSimple(a, amount);
256 b = m_lastTime + p_trace->solveSimple(0.0, amount - amount_till_end);
262 * \brief Auxiliary function to solve integral.
263 * It returns the date when the requested amount of flops is available
264 * \param trace Trace structure
265 * \param a Initial point
266 * \param amount Amount of flops
267 * \return The date when amount is available.
269 double CpuTiTrace::solveSimple(double a, double amount)
274 integral_a = integrateSimplePoint(a);
275 ind = binarySearch(p_integral, integral_a + amount, 0, m_nbPoints - 1);
276 time = p_timePoints[ind];
278 (integral_a + amount -
279 p_integral[ind]) / ((p_integral[ind + 1] -
281 (p_timePoints[ind + 1] -
288 * \brief Auxiliary function to update the CPU speed scale.
290 * This function uses the trace structure to return the speed scale at the determined time a.
291 * \param trace Trace structure to search the updated speed scale
293 * \return CPU speed scale
295 double CpuTiTgmr::getPowerScale(double a)
301 reduced_a = a - floor(a / m_lastTime) * m_lastTime;
302 point = p_trace->binarySearch(p_trace->p_timePoints, reduced_a, 0,
303 p_trace->m_nbPoints - 1);
304 xbt_dynar_get_cpy(p_speedTrace->s_list.event_list, point, &val);
309 * \brief Creates a new integration trace from a tmgr_trace_t
311 * \param speedTrace CPU availability trace
312 * \param value Percentage of CPU speed available (useful to fixed tracing)
313 * \param spacing Initial spacing
314 * \return Integration trace structure
316 CpuTiTgmr::CpuTiTgmr(tmgr_trace_t speedTrace, double value)
318 double total_time = 0.0;
323 /* no availability file, fixed trace */
325 m_type = TRACE_FIXED;
327 XBT_DEBUG("No availability trace. Constant value = %f", value);
331 /* only one point available, fixed trace */
332 if (xbt_dynar_length(speedTrace->s_list.event_list) == 1) {
333 xbt_dynar_get_cpy(speedTrace->s_list.event_list, 0, &val);
334 m_type = TRACE_FIXED;
339 m_type = TRACE_DYNAMIC;
340 p_speedTrace = speedTrace;
342 /* count the total time of trace file */
343 xbt_dynar_foreach(speedTrace->s_list.event_list, cpt, val) {
344 total_time += val.delta;
346 p_trace = new CpuTiTrace(speedTrace);
347 m_lastTime = total_time;
348 m_total = p_trace->integrateSimple(0, total_time);
350 XBT_DEBUG("Total integral %f, last_time %f ",
351 m_total, m_lastTime);
355 * \brief Binary search in array.
356 * It returns the first point of the interval in which "a" is.
358 * \param a Value to search
359 * \param low Low bound to search in array
360 * \param high Upper bound to search in array
361 * \return Index of point
363 int CpuTiTrace::binarySearch(double *array, double a, int low, int high)
365 xbt_assert(low < high, "Wrong parameters: low (%d) should be smaller than"
366 " high (%d)", low, high);
370 mid = low + (high - low) / 2;
371 XBT_DEBUG("a %f low %d high %d mid %d value %f", a, low, high, mid,
379 while (low < high - 1);
391 static void cpu_ti_define_callbacks()
393 sg_platf_postparse_add_cb(simgrid::surf::cpu_add_traces);
400 void surf_cpu_model_init_ti()
402 xbt_assert(!surf_cpu_model_pm,"CPU model already initialized. This should not happen.");
403 xbt_assert(!surf_cpu_model_vm,"CPU model already initialized. This should not happen.");
405 surf_cpu_model_pm = new simgrid::surf::CpuTiModel();
406 surf_cpu_model_vm = new simgrid::surf::CpuTiModel();
408 cpu_ti_define_callbacks();
409 simgrid::surf::Model *model_pm = static_cast<simgrid::surf::Model*>(surf_cpu_model_pm);
410 simgrid::surf::Model *model_vm = static_cast<simgrid::surf::Model*>(surf_cpu_model_vm);
411 xbt_dynar_push(all_existing_models, &model_pm);
412 xbt_dynar_push(all_existing_models, &model_vm);
418 CpuTiModel::CpuTiModel() : CpuModel()
420 p_runningActionSetThatDoesNotNeedBeingChecked = new ActionList();
422 p_modifiedCpu = new CpuTiList();
424 p_tiActionHeap = xbt_heap_new(8, NULL);
425 xbt_heap_set_update_callback(p_tiActionHeap,
426 cpu_ti_action_update_index_heap);
429 CpuTiModel::~CpuTiModel()
431 surf_cpu_model_pm = NULL;
432 delete p_runningActionSetThatDoesNotNeedBeingChecked;
433 delete p_modifiedCpu;
434 xbt_heap_free(p_tiActionHeap);
437 Cpu *CpuTiModel::createCpu(simgrid::Host *host,
438 xbt_dynar_t speedPeak,
441 tmgr_trace_t speedTrace,
444 tmgr_trace_t stateTrace)
446 xbt_assert(core==1,"Multi-core not handled with this model yet");
447 xbt_assert(xbt_dynar_getfirst_as(speedPeak, double) > 0.0,
448 "Speed has to be >0.0. Did you forget to specify the mandatory speed attribute?");
449 CpuTi *cpu = new CpuTi(this, host, speedPeak, pstate, speedScale, speedTrace,
450 core, initiallyOn, stateTrace);
454 double CpuTiModel::shareResources(double now)
456 double min_action_duration = -1;
458 /* iterates over modified cpus to update share resources */
459 for(CpuTiList::iterator it(p_modifiedCpu->begin()), itend(p_modifiedCpu->end())
463 ti->updateActionsFinishTime(now);
466 /* get the min next event if heap not empty */
467 if (xbt_heap_size(p_tiActionHeap) > 0)
468 min_action_duration = xbt_heap_maxkey(p_tiActionHeap) - now;
470 XBT_DEBUG("Share resources, min next event date: %f", min_action_duration);
472 return min_action_duration;
475 void CpuTiModel::updateActionsState(double now, double /*delta*/)
477 while ((xbt_heap_size(p_tiActionHeap) > 0)
478 && (xbt_heap_maxkey(p_tiActionHeap) <= now)) {
479 CpuTiAction *action = (CpuTiAction*) xbt_heap_pop(p_tiActionHeap);
480 XBT_DEBUG("Action %p: finish", action);
482 /* set the remains to 0 due to precision problems when updating the remaining amount */
483 action->setRemains(0);
484 action->setState(SURF_ACTION_DONE);
485 /* update remaining amount of all actions */
486 action->p_cpu->updateRemainingAmount(surf_get_clock());
490 void CpuTiModel::addTraces()
492 xbt_dict_cursor_t cursor = NULL;
493 char *trace_name, *elm;
495 static int called = 0;
501 /* connect all traces relative to hosts */
502 xbt_dict_foreach(trace_connect_list_host_avail, cursor, trace_name, elm) {
503 tmgr_trace_t trace = (tmgr_trace_t) xbt_dict_get_or_null(traces_set_list, trace_name);
504 CpuTi *cpu = static_cast<CpuTi*>(sg_host_by_name(elm)->p_cpu);
506 xbt_assert(cpu, "Host %s undefined", elm);
507 xbt_assert(trace, "Trace %s undefined", trace_name);
509 if (cpu->p_stateEvent) {
510 XBT_DEBUG("Trace already configured for this CPU(%s), ignoring it",
514 XBT_DEBUG("Add state trace: %s to CPU(%s)", trace_name, elm);
515 cpu->p_stateEvent = tmgr_history_add_trace(history, trace, 0.0, 0, cpu);
518 xbt_dict_foreach(trace_connect_list_power, cursor, trace_name, elm) {
519 tmgr_trace_t trace = (tmgr_trace_t) xbt_dict_get_or_null(traces_set_list, trace_name);
520 CpuTi *cpu = static_cast<CpuTi*>(sg_host_by_name(elm)->p_cpu);
522 xbt_assert(cpu, "Host %s undefined", elm);
523 xbt_assert(trace, "Trace %s undefined", trace_name);
525 XBT_DEBUG("Add speed trace: %s to CPU(%s)", trace_name, elm);
526 if (cpu->p_availTrace)
527 delete cpu->p_availTrace;
529 cpu->p_availTrace = new CpuTiTgmr(trace, cpu->m_speedScale);
531 /* add a fake trace event if periodicity == 0 */
532 if (trace && xbt_dynar_length(trace->s_list.event_list) > 1) {
534 xbt_dynar_get_cpy(trace->s_list.event_list,
535 xbt_dynar_length(trace->s_list.event_list) - 1, &val);
536 if (val.delta == 0) {
537 tmgr_trace_t empty_trace;
538 empty_trace = tmgr_empty_trace_new();
540 tmgr_history_add_trace(history, empty_trace,
541 cpu->p_availTrace->m_lastTime, 0, cpu);
550 CpuTi::CpuTi(CpuTiModel *model, simgrid::Host *host, xbt_dynar_t speedPeak,
551 int pstate, double speedScale, tmgr_trace_t speedTrace, int core,
552 int initiallyOn, tmgr_trace_t stateTrace)
553 : Cpu(model, host, NULL, pstate, core, 0, speedScale, initiallyOn)
555 xbt_assert(core==1,"Multi-core not handled by this model yet");
558 m_speedScale = speedScale;
559 p_availTrace = new CpuTiTgmr(speedTrace, speedScale);
561 p_actionSet = new ActionTiList();
563 xbt_dynar_get_cpy(speedPeak, 0, &m_speedPeak);
564 XBT_DEBUG("CPU create: peak=%f", m_speedPeak);
567 p_stateEvent = tmgr_history_add_trace(history, stateTrace, 0.0, 0, this);
569 if (speedTrace && xbt_dynar_length(speedTrace->s_list.event_list) > 1) {
571 // add a fake trace event if periodicity == 0
572 xbt_dynar_get_cpy(speedTrace->s_list.event_list,
573 xbt_dynar_length(speedTrace->s_list.event_list) - 1, &val);
574 if (val.delta == 0) {
575 tmgr_trace_t empty_trace = tmgr_empty_trace_new();
576 p_speedEvent = tmgr_history_add_trace(history, empty_trace, p_availTrace->m_lastTime, 0, this);
588 void CpuTi::updateState(tmgr_trace_event_t event_type,
589 double value, double date)
593 if (event_type == p_speedEvent) {
594 tmgr_trace_t speedTrace;
598 XBT_DEBUG("Finish trace date: %f value %f date %f", surf_get_clock(),
600 /* update remaining of actions and put in modified cpu swag */
601 updateRemainingAmount(date);
605 speedTrace = p_availTrace->p_speedTrace;
606 xbt_dynar_get_cpy(speedTrace->s_list.event_list,
607 xbt_dynar_length(speedTrace->s_list.event_list) - 1, &val);
610 m_speedScale = val.value;
612 trace = new CpuTiTgmr(TRACE_FIXED, val.value);
613 XBT_DEBUG("value %f", val.value);
615 p_availTrace = trace;
617 if (tmgr_trace_event_free(event_type))
620 } else if (event_type == p_stateEvent) {
623 xbt_dynar_push_as(host_that_restart, char*, (char *)getName());
628 /* put all action running on cpu to failed */
629 for(ActionTiList::iterator it(p_actionSet->begin()), itend(p_actionSet->end())
630 ; it != itend ; ++it) {
632 if (action->getState() == SURF_ACTION_RUNNING
633 || action->getState() == SURF_ACTION_READY
634 || action->getState() == SURF_ACTION_NOT_IN_THE_SYSTEM) {
635 action->setFinishTime(date);
636 action->setState(SURF_ACTION_FAILED);
637 if (action->m_indexHeap >= 0) {
638 CpuTiAction *heap_act = (CpuTiAction*)
639 xbt_heap_remove(static_cast<CpuTiModel*>(getModel())->p_tiActionHeap, action->m_indexHeap);
640 if (heap_act != action)
646 if (tmgr_trace_event_free(event_type))
649 XBT_CRITICAL("Unknown event ! \n");
656 void CpuTi::updateActionsFinishTime(double now)
659 double sum_priority = 0.0, total_area, min_finish = -1;
661 /* update remaining amount of actions */
662 updateRemainingAmount(now);
664 for(ActionTiList::iterator it(p_actionSet->begin()), itend(p_actionSet->end())
665 ; it != itend ; ++it) {
667 /* action not running, skip it */
668 if (action->getStateSet() !=
669 surf_cpu_model_pm->getRunningActionSet())
672 /* bogus priority, skip it */
673 if (action->getPriority() <= 0)
676 /* action suspended, skip it */
677 if (action->m_suspended != 0)
680 sum_priority += 1.0 / action->getPriority();
682 m_sumPriority = sum_priority;
684 for(ActionTiList::iterator it(p_actionSet->begin()), itend(p_actionSet->end())
685 ; it != itend ; ++it) {
688 /* action not running, skip it */
689 if (action->getStateSet() !=
690 surf_cpu_model_pm->getRunningActionSet())
693 /* verify if the action is really running on cpu */
694 if (action->m_suspended == 0 && action->getPriority() > 0) {
695 /* total area needed to finish the action. Used in trace integration */
697 (action->getRemains()) * sum_priority *
698 action->getPriority();
700 total_area /= m_speedPeak;
702 action->setFinishTime(p_availTrace->solve(now, total_area));
703 /* verify which event will happen before (max_duration or finish time) */
704 if (action->getMaxDuration() != NO_MAX_DURATION &&
705 action->getStartTime() + action->getMaxDuration() < action->m_finish)
706 min_finish = action->getStartTime() + action->getMaxDuration();
708 min_finish = action->m_finish;
710 /* put the max duration time on heap */
711 if (action->getMaxDuration() != NO_MAX_DURATION)
712 min_finish = action->getStartTime() + action->getMaxDuration();
714 /* add in action heap */
715 XBT_DEBUG("action(%p) index %d", action, action->m_indexHeap);
716 if (action->m_indexHeap >= 0) {
717 CpuTiAction *heap_act = (CpuTiAction*)
718 xbt_heap_remove(static_cast<CpuTiModel*>(getModel())->p_tiActionHeap, action->m_indexHeap);
719 if (heap_act != action)
722 if (min_finish != NO_MAX_DURATION)
723 xbt_heap_push(static_cast<CpuTiModel*>(getModel())->p_tiActionHeap, action, min_finish);
726 ("Update finish time: Cpu(%s) Action: %p, Start Time: %f Finish Time: %f Max duration %f",
727 getName(), action, action->getStartTime(),
729 action->getMaxDuration());
731 /* remove from modified cpu */
737 return !p_actionSet->empty();
740 double CpuTi::getAvailableSpeed()
742 m_speedScale = p_availTrace->getPowerScale(surf_get_clock());
743 return Cpu::getAvailableSpeed();
746 /** @brief Update the remaining amount of actions */
747 void CpuTi::updateRemainingAmount(double now)
752 /* already updated */
753 if (m_lastUpdate >= now)
756 /* compute the integration area */
757 area_total = p_availTrace->integrate(m_lastUpdate, now) * m_speedPeak;
758 XBT_DEBUG("Flops total: %f, Last update %f", area_total,
761 for(ActionTiList::iterator it(p_actionSet->begin()), itend(p_actionSet->end())
762 ; it != itend ; ++it) {
764 /* action not running, skip it */
765 if (action->getStateSet() !=
766 getModel()->getRunningActionSet())
769 /* bogus priority, skip it */
770 if (action->getPriority() <= 0)
773 /* action suspended, skip it */
774 if (action->m_suspended != 0)
777 /* action don't need update */
778 if (action->getStartTime() >= now)
781 /* skip action that are finishing now */
782 if (action->m_finish >= 0
783 && action->m_finish <= now)
786 /* update remaining */
787 action->updateRemains(area_total / (m_sumPriority * action->getPriority()));
788 XBT_DEBUG("Update remaining action(%p) remaining %f", action,
794 CpuAction *CpuTi::execute(double size)
796 XBT_IN("(%s,%g)", getName(), size);
797 CpuTiAction *action = new CpuTiAction(static_cast<CpuTiModel*>(getModel()), size, isOff(), this);
799 p_actionSet->push_back(*action);
806 CpuAction *CpuTi::sleep(double duration)
809 duration = MAX(duration, sg_surf_precision);
811 XBT_IN("(%s,%g)", getName(), duration);
812 CpuTiAction *action = new CpuTiAction(static_cast<CpuTiModel*>(getModel()), 1.0, isOff(), this);
814 action->m_maxDuration = duration;
815 action->m_suspended = 2;
816 if (duration == NO_MAX_DURATION) {
817 /* Move to the *end* of the corresponding action set. This convention
818 is used to speed up update_resource_state */
819 action->getStateSet()->erase(action->getStateSet()->iterator_to(*action));
820 action->p_stateSet = static_cast<CpuTiModel*>(getModel())->p_runningActionSetThatDoesNotNeedBeingChecked;
821 action->getStateSet()->push_back(*action);
824 p_actionSet->push_back(*action);
830 void CpuTi::modified(bool modified){
831 CpuTiList *modifiedCpu = static_cast<CpuTiModel*>(getModel())->p_modifiedCpu;
833 if (!cpu_ti_hook.is_linked()) {
834 modifiedCpu->push_back(*this);
837 if (cpu_ti_hook.is_linked()) {
838 modifiedCpu->erase(modifiedCpu->iterator_to(*this));
847 CpuTiAction::CpuTiAction(CpuTiModel *model_, double cost, bool failed,
849 : CpuAction(model_, cost, failed)
853 p_cpu->modified(true);
856 void CpuTiAction::updateIndexHeap(int i)
861 void CpuTiAction::setState(e_surf_action_state_t state)
863 CpuAction::setState(state);
864 p_cpu->modified(true);
867 int CpuTiAction::unref()
871 if (action_hook.is_linked())
872 getStateSet()->erase(getStateSet()->iterator_to(*this));
873 /* remove from action_set */
874 if (action_ti_hook.is_linked())
875 p_cpu->p_actionSet->erase(p_cpu->p_actionSet->iterator_to(*this));
876 /* remove from heap */
877 xbt_heap_remove(static_cast<CpuTiModel*>(getModel())->p_tiActionHeap, this->m_indexHeap);
878 p_cpu->modified(true);
885 void CpuTiAction::cancel()
887 this->setState(SURF_ACTION_FAILED);
888 xbt_heap_remove(getModel()->getActionHeap(), this->m_indexHeap);
889 p_cpu->modified(true);
893 void CpuTiAction::suspend()
895 XBT_IN("(%p)", this);
896 if (m_suspended != 2) {
898 xbt_heap_remove(getModel()->getActionHeap(), m_indexHeap);
899 p_cpu->modified(true);
904 void CpuTiAction::resume()
906 XBT_IN("(%p)", this);
907 if (m_suspended != 2) {
909 p_cpu->modified(true);
914 void CpuTiAction::setMaxDuration(double duration)
918 XBT_IN("(%p,%g)", this, duration);
920 m_maxDuration = duration;
923 min_finish = (getStartTime() + getMaxDuration()) < getFinishTime() ?
924 (getStartTime() + getMaxDuration()) : getFinishTime();
926 min_finish = getFinishTime();
928 /* add in action heap */
929 if (m_indexHeap >= 0) {
930 CpuTiAction *heap_act = (CpuTiAction*)
931 xbt_heap_remove(getModel()->getActionHeap(), m_indexHeap);
932 if (heap_act != this)
935 xbt_heap_push(getModel()->getActionHeap(), this, min_finish);
940 void CpuTiAction::setPriority(double priority)
942 XBT_IN("(%p,%g)", this, priority);
943 m_priority = priority;
944 p_cpu->modified(true);
948 double CpuTiAction::getRemains()
950 XBT_IN("(%p)", this);
951 p_cpu->updateRemainingAmount(surf_get_clock());
959 #endif /* SURF_MODEL_CPUTI_H_ */