GraphManager.hpp 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163
  1. /**
  2. * @file kernel/dtss/GraphManager.hpp
  3. * @author The ARTIS Development Team
  4. * See the AUTHORS or Authors.txt file
  5. */
  6. /*
  7. * ARTIS - the multimodeling and simulation environment
  8. * This file is a part of the ARTIS environment
  9. *
  10. * Copyright (C) 2013-2019 ULCO http://www.univ-littoral.fr
  11. *
  12. * This program is free software: you can redistribute it and/or modify
  13. * it under the terms of the GNU General Public License as published by
  14. * the Free Software Foundation, either version 3 of the License, or
  15. * (at your option) any later version.
  16. *
  17. * This program is distributed in the hope that it will be useful,
  18. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  19. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  20. * GNU General Public License for more details.
  21. *
  22. * You should have received a copy of the GNU General Public License
  23. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  24. */
  25. #ifndef DTSS_GRAPH_MANAGER
  26. #define DTSS_GRAPH_MANAGER
  27. #include <artis-star/common/Coordinator.hpp>
  28. #include <artis-star/common/GraphManager.hpp>
  29. #include <artis-star/common/Links.hpp>
  30. #include <artis-star/common/Model.hpp>
  31. #include <artis-star/common/Parameters.hpp>
  32. namespace artis {
  33. namespace dtss {
  34. template<class Time,
  35. class Parameters = common::NoParameters,
  36. class GraphParameters = common::NoParameters>
  37. class GraphManager : public common::GraphManager<Time> {
  38. public:
  39. typedef GraphManager<Time, Parameters, GraphParameters> type;
  40. struct ModelPort {
  41. common::Model<Time> *model;
  42. unsigned int port_index;
  43. type *graph_manager;
  44. ModelPort(common::Model<Time> *model, unsigned int port_index)
  45. : model(model),
  46. port_index(port_index),
  47. graph_manager(nullptr) {}
  48. void operator>>(const ModelPort &dst) {
  49. graph_manager->add_link(model, port_index, dst.model, dst.port_index);
  50. }
  51. };
  52. GraphManager(common::Coordinator<Time> *coordinator,
  53. const Parameters & /* parameters */,
  54. const GraphParameters & /* graph_parameters */)
  55. :
  56. common::GraphManager<Time>(coordinator) {}
  57. ~GraphManager() override = default;
  58. ModelPort in(ModelPort p) {
  59. p.graph_manager = this;
  60. return p;
  61. }
  62. ModelPort out(ModelPort p) {
  63. p.graph_manager = this;
  64. return p;
  65. }
  66. void dispatch_events(common::Bag<Time> bag, typename Time::type t) {
  67. for (auto &ymsg : bag) {
  68. typename common::Links<Time>::Result result_model = _link_list.find(
  69. ymsg.get_model(),
  70. ymsg.port_index());
  71. for (typename common::Links<Time>::const_iterator it = result_model.first;
  72. it != result_model.second; ++it) {
  73. // event on output port of coupled Model
  74. if (it->second.get_model() == common::GraphManager<Time>::_coordinator) {
  75. dispatch_events_to_parent(it->second, ymsg.data(), t);
  76. } else { // event on input port of internal model
  77. it->second.get_model()->post_event(t,
  78. common::ExternalEvent<Time>(it->second, ymsg.data()));
  79. }
  80. }
  81. }
  82. }
  83. virtual void
  84. dispatch_events_to_parent(common::Node<Time> node, const common::Value &content,
  85. typename Time::type t) {
  86. common::Bag<Time> ymessages;
  87. ymessages.push_back(common::ExternalEvent<Time>(node, content));
  88. if (common::GraphManager<Time>::_coordinator->get_parent()) {
  89. dynamic_cast < common::Coordinator<Time> * >(common::GraphManager<Time>::_coordinator
  90. ->get_parent())
  91. ->dispatch_events(ymessages, t);
  92. }
  93. }
  94. virtual typename Time::type lookahead(const typename Time::type &t) const { return t; }
  95. void post_event(typename Time::type t, const common::ExternalEvent<Time> &event) {
  96. typename common::Links<Time>::Result result =
  97. _link_list.find(common::GraphManager<Time>::_coordinator,
  98. event.port_index());
  99. for (typename common::Links<Time>::const_iterator it_r = result.first;
  100. it_r != result.second;
  101. ++it_r) {
  102. it_r->second.get_model()->post_event(t,
  103. common::ExternalEvent<Time>(it_r->second, event.data()));
  104. }
  105. }
  106. virtual std::string to_string(int level) const {
  107. std::ostringstream ss;
  108. ss << common::String::make_spaces(level * 2) << "Children :" << std::endl;
  109. for (auto &child : common::GraphManager<Time>::_children) {
  110. ss << child->to_string(level + 1);
  111. }
  112. ss << _link_list.to_string(level);
  113. return ss.str();
  114. }
  115. private:
  116. void add_link(common::Model<Time> *src_model, unsigned int src_port_index,
  117. common::Model<Time> *dst_model, unsigned int dst_port_index) {
  118. assert((src_model != common::GraphManager<Time>::_coordinator and
  119. dst_model != common::GraphManager<Time>::_coordinator and
  120. src_model->exist_out_port(src_port_index) and
  121. dst_model->exist_in_port(dst_port_index)) or
  122. (src_model == common::GraphManager<Time>::_coordinator and
  123. dst_model != common::GraphManager<Time>::_coordinator and
  124. src_model->exist_in_port(src_port_index) and
  125. dst_model->exist_in_port(dst_port_index)) or
  126. (src_model != common::GraphManager<Time>::_coordinator and
  127. dst_model == common::GraphManager<Time>::_coordinator and
  128. src_model->exist_out_port(src_port_index) and
  129. dst_model->exist_out_port(dst_port_index)));
  130. _link_list.add(src_model, src_port_index, dst_model, dst_port_index);
  131. }
  132. common::Links<Time> _link_list;
  133. };
  134. }
  135. } // namespace artis dtss
  136. #endif