GraphManager.hpp 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167
  1. /**
  2. * @file kernel/pdevs/GraphManager.hpp
  3. * @author The PARADEVS Development Team
  4. * See the AUTHORS or Authors.txt file
  5. */
  6. /*
  7. * PARADEVS - the multimodeling and simulation environment
  8. * This file is a part of the PARADEVS environment
  9. *
  10. * Copyright (C) 2013-2016 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 PDEVS_GRAPH_MANANGER
  26. #define PDEVS_GRAPH_MANANGER 1
  27. #include <paradevs/common/Coordinator.hpp>
  28. #include <paradevs/common/Links.hpp>
  29. #include <paradevs/common/Model.hpp>
  30. #include <paradevs/common/Parameters.hpp>
  31. #include <paradevs/common/utils/String.hpp>
  32. #include <sstream>
  33. namespace paradevs { namespace pdevs {
  34. template < class Time,
  35. class GraphParameters = common::NoParameters >
  36. class GraphManager
  37. {
  38. public:
  39. GraphManager(common::Coordinator < Time >* coordinator,
  40. const GraphParameters& /* parameters */) :
  41. _coordinator(coordinator)
  42. { }
  43. virtual ~GraphManager()
  44. { }
  45. void add_child(common::Model < Time >* child)
  46. {
  47. _child_list.push_back(child);
  48. child->set_parent(_coordinator);
  49. }
  50. void add_link(common::Model < Time >* src_model,
  51. const std::string& src_port_name,
  52. common::Model < Time >* dst_model,
  53. const std::string& dst_port_name)
  54. {
  55. assert((src_model != _coordinator and
  56. dst_model != _coordinator and
  57. src_model->exist_out_port(src_port_name) and
  58. dst_model->exist_in_port(dst_port_name)) or
  59. (src_model == _coordinator and
  60. dst_model != _coordinator and
  61. src_model->exist_in_port(src_port_name) and
  62. dst_model->exist_in_port(dst_port_name)) or
  63. (src_model != _coordinator and
  64. dst_model == _coordinator and
  65. src_model->exist_out_port(src_port_name) and
  66. dst_model->exist_out_port(dst_port_name)));
  67. _link_list.add(src_model, src_port_name, dst_model, dst_port_name);
  68. }
  69. const common::Models < Time >& children() const
  70. { return _child_list; }
  71. void dispatch_events(common::Bag < Time > bag,
  72. typename Time::type t)
  73. {
  74. for (auto & ymsg : bag) {
  75. typename common::Links < Time >::Result result_model =
  76. _link_list.find(ymsg.get_model(),
  77. ymsg.get_port_name());
  78. for (typename common::Links < Time >::
  79. const_iterator it = result_model.first;
  80. it != result_model.second; ++it) {
  81. // event on output port of coupled Model
  82. if (it->second.get_model() == _coordinator) {
  83. dispatch_events_to_parent(it->second, ymsg.get_content(),
  84. t);
  85. } else { // event on input port of internal model
  86. it->second.get_model()->post_event(
  87. t, common::ExternalEvent < Time >(
  88. it->second, ymsg.get_content()));
  89. }
  90. }
  91. }
  92. }
  93. virtual void dispatch_events_to_parent(common::Node < Time > node,
  94. const common::Value& content,
  95. typename Time::type t)
  96. {
  97. common::Bag < Time > ymessages;
  98. ymessages.push_back(
  99. common::ExternalEvent <Time >(node, content));
  100. dynamic_cast < common::Coordinator < Time >* >(
  101. _coordinator->get_parent())->dispatch_events(
  102. ymessages, t);
  103. }
  104. bool exist_link(common::Model < Time >* src_model,
  105. const std::string& src_port_name,
  106. common::Model < Time >* dst_model,
  107. const std::string& dst_port_name) const
  108. {
  109. return _link_list.exist(src_model, src_port_name, dst_model,
  110. dst_port_name);
  111. }
  112. common::Coordinator < Time >* get_coordinator() const
  113. { return _coordinator; }
  114. void post_event(typename Time::type t,
  115. const common::ExternalEvent < Time >& event)
  116. {
  117. typename common::Links < Time >::Result result =
  118. _link_list.find(_coordinator, event.get_port_name());
  119. for (typename common::Links < Time >::const_iterator it_r =
  120. result.first; it_r != result.second; ++it_r) {
  121. it_r->second.get_model()->post_event(
  122. t, common::ExternalEvent < Time >(it_r->second,
  123. event.get_content()));
  124. }
  125. }
  126. virtual std::string to_string(int level) const
  127. {
  128. std::ostringstream ss;
  129. ss << common::spaces(level * 2) << "Childs :" << std::endl;
  130. for (auto & child : _child_list) {
  131. ss << child->to_string(level + 1);
  132. }
  133. ss << _link_list.to_string(level);
  134. return ss.str();
  135. }
  136. private:
  137. common::Links < Time > _link_list;
  138. common::Models < Time > _child_list;
  139. common::Coordinator < Time >* _coordinator;
  140. };
  141. } } // namespace paradevs pdevs
  142. #endif