1 /* Copyright (c) 2016. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #ifndef SIMGRID_S4U_AS_HPP
7 #define SIMGRID_S4U_AS_HPP
10 #include "xbt/graph.h"
12 #include "simgrid/s4u/forward.hpp"
16 #include "src/surf/xml/platf_private.hpp" // FIXME: kill sg_platf_route_cbarg_t to remove that UGLY include
27 /** @brief Autonomous Systems
29 * An AS is a network container, in charge of routing information between elements (hosts) and to the nearby ASes.
30 * In SimGrid, there is a hierarchy of ASes, with a unique root AS (that you can retrieve from the s4u::Engine).
34 friend simgrid::surf::AsImpl;
40 /** @brief Seal your AS once you're done adding content, and before routing stuff through it */
44 xbt_dict_t children(); // Sub AS
45 xbt_dynar_t hosts(); // my content
47 As *father_ = nullptr; // FIXME: hide me
49 /* Add content to the AS, at parsing time. It should be sealed afterward. */
50 virtual int addComponent(surf::NetCard *elm); /* A host, a router or an AS, whatever */
51 virtual void addRoute(sg_platf_route_cbarg_t route);
52 void addBypassRoute(sg_platf_route_cbarg_t e_route);
55 char *name_ = nullptr;
56 xbt_dict_t children_ = xbt_dict_new_homogeneous(NULL); // sub-ASes
57 xbt_dynar_t vertices_ = xbt_dynar_new(sizeof(char*),NULL); // our content, as known to our graph routing algorithm (maps vertexId -> vertex)
59 std::map<std::pair<std::string, std::string>, std::vector<surf::Link*>*> bypassRoutes_; // srcName x dstName -> route
62 bool sealed_ = false; // We cannot add more content when sealed
65 }}; // Namespace simgrid::s4u
67 #endif /* SIMGRID_S4U_AS_HPP */