X-Git-Url: http://bilbo.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/3f50aa3d0ce380b0f9bcd5a217c5015e6bd3db18..e6be248713757287eb951054a63c9f251d52ee0a:/include/simgrid/kernel/resource/Model.hpp diff --git a/include/simgrid/kernel/resource/Model.hpp b/include/simgrid/kernel/resource/Model.hpp index dc228ad614..045d201d60 100644 --- a/include/simgrid/kernel/resource/Model.hpp +++ b/include/simgrid/kernel/resource/Model.hpp @@ -8,19 +8,6 @@ #include -extern "C" { - -/** @brief Possible update mechanisms */ -enum e_UM_t { - UM_FULL, /**< Full update mechanism: the remaining time of every action is recomputed at each step */ - UM_LAZY, /**< Lazy update mechanism: only the modified actions get recomputed. - It may be slower than full if your system is tightly coupled to the point where every action - gets recomputed anyway. In that case, you'd better not try to be cleaver with lazy and go for - a simple full update. */ - UM_UNDEFINED /**< Mechanism not defined */ -}; -} - namespace simgrid { namespace kernel { namespace resource { @@ -31,7 +18,17 @@ namespace resource { */ class XBT_PUBLIC Model { public: - Model(); + /** @brief Possible update mechanisms */ + enum class UpdateAlgo { + Full, /**< Full update mechanism: the remaining time of every action is recomputed at each step */ + Lazy /**< Lazy update mechanism: only the modified actions get recomputed. + It may be slower than full if your system is tightly coupled to the point where every action + gets recomputed anyway. In that case, you'd better not try to be cleaver with lazy and go for + a simple full update. */ + }; + + explicit Model(Model::UpdateAlgo algo); + virtual ~Model(); /** @brief Get the set of [actions](@ref Action) in *ready* state */ @@ -52,19 +49,14 @@ public: /** @brief Get the maxmin system of the current Model */ lmm::System* get_maxmin_system() const { return maxmin_system_; } - /** - * @brief Get the update mechanism of the current Model - * @see e_UM_t - */ - e_UM_t getUpdateMechanism() const { return update_mechanism_; } - void setUpdateMechanism(e_UM_t mechanism) { update_mechanism_ = mechanism; } + /** @brief Set the maxmin system of the current Model */ + void set_maxmin_system(lmm::System* system) { maxmin_system_ = system; } - /** @brief Get Action heap */ - heap_type& getActionHeap() { return action_heap_; } + /** @brief Get the update algorithm of the current Model */ + UpdateAlgo get_update_algorithm() const { return update_algorithm_; } - double actionHeapTopDate() const { return action_heap_.top().first; } - Action* actionHeapPop(); - bool actionHeapIsEmpty() const { return action_heap_.empty(); } + /** @brief Get Action heap */ + ActionHeap& get_action_heap() { return action_heap_; } /** * @brief Share the resources between the actions @@ -86,23 +78,21 @@ public: virtual void update_actions_state_lazy(double now, double delta); virtual void update_actions_state_full(double now, double delta); - /** @brief Returns whether this model have an idempotent shareResource() + /** @brief Returns whether this model have an idempotent share_resource() * * The only model that is not is NS3: computing the next timestamp moves the model up to that point, * so we need to call it only when the next timestamp of other sources is computed. */ - virtual bool nextOccuringEventIsIdempotent() { return true; } - -protected: - lmm::System* maxmin_system_ = nullptr; + virtual bool next_occuring_event_is_idempotent() { return true; } private: - e_UM_t update_mechanism_ = UM_UNDEFINED; + lmm::System* maxmin_system_ = nullptr; + const UpdateAlgo update_algorithm_; Action::StateSet* ready_action_set_ = new Action::StateSet(); /**< Actions in state SURF_ACTION_READY */ Action::StateSet* running_action_set_ = new Action::StateSet(); /**< Actions in state SURF_ACTION_RUNNING */ Action::StateSet* failed_action_set_ = new Action::StateSet(); /**< Actions in state SURF_ACTION_FAILED */ Action::StateSet* done_action_set_ = new Action::StateSet(); /**< Actions in state SURF_ACTION_DONE */ - heap_type action_heap_; + ActionHeap action_heap_; }; } // namespace resource