1 /* Copyright (c) 2009-2011, 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. */
7 #include "surf_routing.hpp"
8 #include "surf_routing_cluster.hpp"
10 #include "simgrid/sg_config.h"
11 #include "storage_interface.hpp"
13 #include "src/surf/surf_routing_cluster_torus.hpp"
14 #include "src/surf/surf_routing_cluster_fat_tree.hpp"
15 #include "src/surf/surf_routing_dijkstra.hpp"
16 #include "src/surf/surf_routing_floyd.hpp"
17 #include "src/surf/surf_routing_full.hpp"
18 #include "src/surf/surf_routing_vivaldi.hpp"
19 #include "src/surf/xml/platf.hpp" // FIXME: move that back to the parsing area
23 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
29 simgrid::xbt::signal<void(simgrid::surf::NetCard*)> netcardCreatedCallbacks;
30 simgrid::xbt::signal<void(simgrid::surf::As*)> asCreatedCallbacks;
32 As::As(const char*name)
33 : name_(xbt_strdup(name))
37 xbt_dict_cursor_t cursor = NULL;
40 xbt_dict_foreach(children_, cursor, key, elem) {
45 xbt_dict_free(&children_);
46 xbt_dynar_free(&vertices_);
47 xbt_dynar_free(&upDownLinks);
48 for (auto &kv : bypassRoutes_)
58 /** @brief Get the common ancestor and its first childs in each line leading to src and dst */
59 static void find_common_ancestors(NetCard *src, NetCard *dst,
60 /* OUT */ As **common_ancestor, As **src_ancestor, As **dst_ancestor)
62 #define ROUTING_HIERARCHY_MAXDEPTH 32 /* increase if it is not enough */
63 simgrid::surf::As *path_src[ROUTING_HIERARCHY_MAXDEPTH];
64 simgrid::surf::As *path_dst[ROUTING_HIERARCHY_MAXDEPTH];
67 simgrid::surf::As *current_src;
68 simgrid::surf::As *current_dst;
69 simgrid::surf::As *father;
71 /* (1) find the path to root of src and dst*/
72 simgrid::surf::As *src_as = src->containingAS();
73 simgrid::surf::As *dst_as = dst->containingAS();
75 xbt_assert(src_as, "Host %s must be in an AS", src->name());
76 xbt_assert(dst_as, "Host %s must be in an AS", dst->name());
78 /* (2) find the path to the root routing component */
79 for (simgrid::surf::As *current = src_as; current != NULL; current = current->father_) {
80 xbt_assert(index_src < ROUTING_HIERARCHY_MAXDEPTH, "ROUTING_HIERARCHY_MAXDEPTH should be increased for element %s", src->name());
81 path_src[index_src++] = current;
83 for (simgrid::surf::As *current = dst_as; current != NULL; current = current->father_) {
84 xbt_assert(index_dst < ROUTING_HIERARCHY_MAXDEPTH,"ROUTING_HIERARCHY_MAXDEPTH should be increased for path_dst");
85 path_dst[index_dst++] = current;
88 /* (3) find the common father.
89 * Before that, index_src and index_dst may be different, they both point to NULL in path_src/path_dst
90 * So we move them down simultaneously as long as they point to the same content.
93 current_src = path_src[--index_src];
94 current_dst = path_dst[--index_dst];
95 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
97 /* (4) if we did not find a difference (index_src or index_dst went to 0), both elements are in the same AS */
98 if (current_src == current_dst)
100 else // we found a difference
101 father = path_src[index_src + 1];
103 /* (5) result generation */
104 *common_ancestor = father; /* the common father of src and dst */
105 *src_ancestor = current_src; /* the first different father of src */
106 *dst_ancestor = current_dst; /* the first different father of dst */
107 #undef ROUTING_HIERARCHY_MAXDEPTH
111 xbt_dynar_t As::getOneLinkRoutes() {
115 int As::addComponent(NetCard *elm) {
116 xbt_dynar_push_as(vertices_, NetCard*, elm);
117 return xbt_dynar_length(vertices_)-1;
120 void As::addRoute(sg_platf_route_cbarg_t /*route*/){
121 xbt_die("AS %s does not accept new routes (wrong class).",name_);
124 /* PRECONDITION: this is the common ancestor of src and dst */
125 std::vector<Link*> *As::getBypassRoute(NetCard *src, NetCard *dst)
127 // If never set a bypass route return NULL without any further computations
128 XBT_DEBUG("generic_get_bypassroute from %s to %s", src->name(), dst->name());
129 if (bypassRoutes_.empty())
132 std::vector<Link*> *bypassedRoute = nullptr;
134 if(dst->containingAS() == this && src->containingAS() == this ){
135 char *route_name = bprintf("%s#%s", src->name(), dst->name());
136 if (bypassRoutes_.find(route_name) != bypassRoutes_.end()) {
137 bypassedRoute = bypassRoutes_.at(route_name);
138 XBT_DEBUG("Found a bypass route with %zu links",bypassedRoute->size());
141 return bypassedRoute;
144 /* (2) find the path to the root routing component */
145 std::vector<As*> path_src;
146 As *current = src->containingAS();
147 while (current != NULL) {
148 path_src.push_back(current);
149 current = current->father_;
152 std::vector<As*> path_dst;
153 current = dst->containingAS();
154 while (current != NULL) {
155 path_dst.push_back(current);
156 current = current->father_;
159 /* (3) find the common father */
160 while (path_src.size() > 1 && path_dst.size() >1
161 && path_src.at(path_src.size() -1) == path_dst.at(path_dst.size() -1)) {
166 int max_index_src = path_src.size() - 1;
167 int max_index_dst = path_dst.size() - 1;
169 int max_index = std::max(max_index_src, max_index_dst);
171 for (int max = 0; max <= max_index; max++) {
172 for (int i = 0; i < max; i++) {
173 if (i <= max_index_src && max <= max_index_dst) {
174 char *route_name = bprintf("%s#%s", path_src.at(i)->name_, path_dst.at(max)->name_);
175 if (bypassRoutes_.find(route_name) != bypassRoutes_.end())
176 bypassedRoute = bypassRoutes_.at(route_name);
177 xbt_free(route_name);
181 if (max <= max_index_src && i <= max_index_dst) {
182 char *route_name = bprintf("%s#%s", path_src.at(max)->name_, path_dst.at(i)->name_);
183 if (bypassRoutes_.find(route_name) != bypassRoutes_.end())
184 bypassedRoute = bypassRoutes_.at(route_name);
185 xbt_free(route_name);
194 if (max <= max_index_src && max <= max_index_dst) {
195 char *route_name = bprintf("%s#%s", path_src.at(max)->name_, path_dst.at(max)->name_);
196 if (bypassRoutes_.find(route_name) != bypassRoutes_.end())
197 bypassedRoute = bypassRoutes_.at(route_name);
198 xbt_free(route_name);
204 return bypassedRoute;
207 void As::addBypassRoute(sg_platf_route_cbarg_t e_route){
208 const char *src = e_route->src;
209 const char *dst = e_route->dst;
211 char *route_name = bprintf("%s#%s", src, dst);
213 /* Argument validity checks */
214 if (e_route->gw_dst) {
215 XBT_DEBUG("Load bypassASroute from %s@%s to %s@%s",
216 src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
217 xbt_assert(!e_route->link_list->empty(), "Bypass route between %s@%s and %s@%s cannot be empty.",
218 src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
219 xbt_assert(bypassRoutes_.find(route_name) == bypassRoutes_.end(), "The bypass route between %s@%s and %s@%s already exists.",
220 src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
222 XBT_DEBUG("Load bypassRoute from %s to %s", src, dst);
223 xbt_assert(!e_route->link_list->empty(), "Bypass route between %s and %s cannot be empty.", src, dst);
224 xbt_assert(bypassRoutes_.find(route_name) == bypassRoutes_.end(), "The bypass route between %s and %s already exists.", src, dst);
227 /* Build a copy that will be stored in the dict */
228 std::vector<Link*> *newRoute = new std::vector<Link*>();
229 for (auto link: *e_route->link_list)
230 newRoute->push_back(link);
233 bypassRoutes_.insert({route_name, newRoute});
234 xbt_free(route_name);
237 }} // namespace simgrid::surf
240 * @ingroup SURF_build_api
241 * @brief A library containing all known hosts
243 xbt_dict_t host_list;
245 int COORD_HOST_LEVEL=0; //Coordinates level
247 int MSG_FILE_LEVEL; //Msg file level
249 int SIMIX_STORAGE_LEVEL; //Simix storage level
250 int MSG_STORAGE_LEVEL; //Msg storage level
252 xbt_lib_t as_router_lib;
253 int ROUTING_ASR_LEVEL; //Routing level
254 int COORD_ASR_LEVEL; //Coordinates level
255 int NS3_ASR_LEVEL; //host node for ns3
256 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
258 /** @brief Retrieve a netcard from its name
260 * Netcards are the thing that connect host or routers to the network
262 simgrid::surf::NetCard *sg_netcard_by_name_or_null(const char *name)
264 sg_host_t h = sg_host_by_name(name);
265 simgrid::surf::NetCard *netcard = h==NULL ? NULL: h->pimpl_netcard;
267 netcard = (simgrid::surf::NetCard*) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
272 simgrid::surf::RoutingPlatf *routing_platf = NULL;
275 /** The current AS in the parsing */
276 static simgrid::surf::As *current_routing = NULL;
277 simgrid::surf::As* routing_get_current()
279 return current_routing;
282 /** @brief Add a link connecting an host to the rest of its AS (which must be cluster or vivaldi) */
283 void sg_platf_new_hostlink(sg_platf_host_link_cbarg_t netcard_arg)
285 simgrid::surf::NetCard *netcard = sg_host_by_name(netcard_arg->id)->pimpl_netcard;
286 xbt_assert(netcard, "Host '%s' not found!", netcard_arg->id);
287 xbt_assert(dynamic_cast<simgrid::surf::AsCluster*>(current_routing) ||
288 dynamic_cast<simgrid::surf::AsVivaldi*>(current_routing),
289 "Only hosts from Cluster and Vivaldi ASes can get a host_link.");
291 s_surf_parsing_link_up_down_t link_up_down;
292 link_up_down.link_up = Link::byName(netcard_arg->link_up);
293 link_up_down.link_down = Link::byName(netcard_arg->link_down);
295 xbt_assert(link_up_down.link_up, "Link '%s' not found!",netcard_arg->link_up);
296 xbt_assert(link_up_down.link_down, "Link '%s' not found!",netcard_arg->link_down);
298 // If dynar is is greater than netcard id and if the host_link is already defined
299 if((int)xbt_dynar_length(current_routing->upDownLinks) > netcard->id() &&
300 xbt_dynar_get_as(current_routing->upDownLinks, netcard->id(), void*))
301 surf_parse_error("Host_link for '%s' is already defined!",netcard_arg->id);
303 XBT_DEBUG("Push Host_link for host '%s' to position %d", netcard->name(), netcard->id());
304 xbt_dynar_set_as(current_routing->upDownLinks, netcard->id(), s_surf_parsing_link_up_down_t, link_up_down);
307 void sg_platf_new_trace(sg_platf_trace_cbarg_t trace)
309 tmgr_trace_t tmgr_trace;
310 if (!trace->file || strcmp(trace->file, "") != 0) {
311 tmgr_trace = tmgr_trace_new_from_file(trace->file);
313 xbt_assert(strcmp(trace->pc_data, ""),
314 "Trace '%s' must have either a content, or point to a file on disk.",trace->id);
315 tmgr_trace = tmgr_trace_new_from_string(trace->id, trace->pc_data, trace->periodicity);
317 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
321 * \brief Make a new routing component to the platform
323 * Add a new autonomous system to the platform. Any elements (such as host,
324 * router or sub-AS) added after this call and before the corresponding call
325 * to sg_platf_new_AS_close() will be added to this AS.
327 * Once this function was called, the configuration concerning the used
328 * models cannot be changed anymore.
330 * @param AS_id name of this autonomous system. Must be unique in the platform
331 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
333 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
335 XBT_DEBUG("routing_AS_begin");
337 xbt_assert(nullptr == xbt_lib_get_or_null(as_router_lib, AS->id, ROUTING_ASR_LEVEL),
338 "Refusing to create a second AS called \"%s\".", AS->id);
340 _sg_cfg_init_status = 2; /* HACK: direct access to the global controlling the level of configuration to prevent
341 * any further config now that we created some real content */
344 /* search the routing model */
345 simgrid::surf::As *new_as = NULL;
347 case A_surfxml_AS_routing_Cluster: new_as = new simgrid::surf::AsCluster(AS->id); break;
348 case A_surfxml_AS_routing_ClusterTorus: new_as = new simgrid::surf::AsClusterTorus(AS->id); break;
349 case A_surfxml_AS_routing_ClusterFatTree: new_as = new simgrid::surf::AsClusterFatTree(AS->id); break;
350 case A_surfxml_AS_routing_Dijkstra: new_as = new simgrid::surf::AsDijkstra(AS->id, 0); break;
351 case A_surfxml_AS_routing_DijkstraCache: new_as = new simgrid::surf::AsDijkstra(AS->id, 1); break;
352 case A_surfxml_AS_routing_Floyd: new_as = new simgrid::surf::AsFloyd(AS->id); break;
353 case A_surfxml_AS_routing_Full: new_as = new simgrid::surf::AsFull(AS->id); break;
354 case A_surfxml_AS_routing_None: new_as = new simgrid::surf::AsNone(AS->id); break;
355 case A_surfxml_AS_routing_Vivaldi: new_as = new simgrid::surf::AsVivaldi(AS->id); break;
356 default: xbt_die("Not a valid model!"); break;
359 /* make a new routing component */
360 simgrid::surf::NetCard *netcard = new simgrid::surf::NetCardImpl(new_as->name_, SURF_NETWORK_ELEMENT_AS, current_routing);
362 if (current_routing == NULL && routing_platf->root_ == NULL) {
363 /* it is the first one */
364 new_as->father_ = NULL;
365 routing_platf->root_ = new_as;
367 } else if (current_routing != NULL && routing_platf->root_ != NULL) {
369 xbt_assert(!xbt_dict_get_or_null(current_routing->children_, AS->id),
370 "The AS \"%s\" already exists", AS->id);
371 /* it is a part of the tree */
372 new_as->father_ = current_routing;
373 /* set the father behavior */
374 if (current_routing->hierarchy_ == SURF_ROUTING_NULL)
375 current_routing->hierarchy_ = SURF_ROUTING_RECURSIVE;
376 /* add to the sons dictionary */
377 xbt_dict_set(current_routing->children_, AS->id, (void *) new_as, NULL);
378 /* add to the father element list */
379 netcard->setId(current_routing->addComponent(netcard));
381 THROWF(arg_error, 0, "All defined components must belong to a AS");
384 xbt_lib_set(as_router_lib, netcard->name(), ROUTING_ASR_LEVEL, (void *) netcard);
385 XBT_DEBUG("Having set name '%s' id '%d'", new_as->name_, netcard->id());
387 /* set the new current component of the tree */
388 current_routing = new_as;
389 current_routing->netcard_ = netcard;
391 simgrid::surf::netcardCreatedCallbacks(netcard);
392 simgrid::surf::asCreatedCallbacks(new_as);
396 * \brief Specify that the current description of AS is finished
398 * Once you've declared all the content of your AS, you have to close
399 * it with this call. Your AS is not usable until you call this function.
401 void routing_AS_end()
403 xbt_assert(current_routing, "Cannot seal the current AS: none under construction");
404 current_routing->Seal();
405 current_routing = current_routing->father_;
412 * \brief Recursive function for getRouteAndLatency
414 * \param src the source host
415 * \param dst the destination host
416 * \param links Where to store the links and the gw information
417 * \param latency If not NULL, the latency of all links will be added in it
419 void As::getRouteRecursive(NetCard *src, NetCard *dst,
420 /* OUT */ std::vector<Link*> * links, double *latency)
422 s_sg_platf_route_cbarg_t route;
423 memset(&route,0,sizeof(route));
425 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->name(), dst->name());
427 /* Find how src and dst are interconnected */
428 simgrid::surf::As *common_ancestor, *src_ancestor, *dst_ancestor;
429 find_common_ancestors(src, dst, &common_ancestor, &src_ancestor, &dst_ancestor);
430 XBT_DEBUG("elements_father: common ancestor '%s' src ancestor '%s' dst ancestor '%s'",
431 common_ancestor->name_, src_ancestor->name_, dst_ancestor->name_);
433 /* Check whether a direct bypass is defined. If so, use it and bail out */
434 std::vector<Link*> *bypassed_route = common_ancestor->getBypassRoute(src, dst);
435 if (nullptr != bypassed_route) {
436 for (Link *link : *bypassed_route) {
437 links->push_back(link);
439 *latency += link->getLatency();
444 /* If src and dst are in the same AS, life is good */
445 if (src_ancestor == dst_ancestor) { /* SURF_ROUTING_BASE */
446 route.link_list = links;
447 common_ancestor->getRouteAndLatency(src, dst, &route, latency);
451 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
453 route.link_list = new std::vector<Link*>();
455 common_ancestor->getRouteAndLatency(src_ancestor->netcard_, dst_ancestor->netcard_, &route, latency);
456 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
457 "bad gateways for route from \"%s\" to \"%s\"", src->name(), dst->name());
459 /* If source gateway is not our source, we have to recursively find our way up to this point */
460 if (src != route.gw_src)
461 getRouteRecursive(src, route.gw_src, links, latency);
462 for (auto link: *route.link_list)
463 links->push_back(link);
465 /* If dest gateway is not our destination, we have to recursively find our way from this point */
466 if (route.gw_dst != dst)
467 getRouteRecursive(route.gw_dst, dst, links, latency);
472 * \brief Find a route between hosts
474 * \param src the network_element_t for src host
475 * \param dst the network_element_t for dst host
476 * \param route where to store the list of links.
477 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
478 * \param latency where to store the latency experienced on the path (or NULL if not interested)
479 * It is the caller responsability to initialize latency to 0 (we add to provided route)
482 * walk through the routing components tree and find a route between hosts
483 * by calling each "get_route" function in each routing component.
485 void RoutingPlatf::getRouteAndLatency(NetCard *src, NetCard *dst, std::vector<Link*> * route, double *latency)
487 XBT_DEBUG("getRouteAndLatency from %s to %s", src->name(), dst->name());
489 As::getRouteRecursive(src, dst, route, latency);
492 static xbt_dynar_t _recursiveGetOneLinkRoutes(As *rc)
494 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
496 //adding my one link routes
497 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
499 xbt_dynar_merge(&ret,&onelink_mine);
503 xbt_dict_cursor_t cursor = NULL;
505 xbt_dict_foreach(rc->children_, cursor, key, rc_child) {
506 xbt_dynar_t onelink_child = _recursiveGetOneLinkRoutes(rc_child);
508 xbt_dynar_merge(&ret,&onelink_child);
513 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
514 return _recursiveGetOneLinkRoutes(root_);
520 /** @brief create the root AS */
521 void routing_model_create(Link *loopback)
523 routing_platf = new simgrid::surf::RoutingPlatf(loopback);
526 /* ************************************************************************** */
527 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
529 void routing_cluster_add_backbone(simgrid::surf::Link* bb) {
530 simgrid::surf::AsCluster *cluster = dynamic_cast<simgrid::surf::AsCluster*>(current_routing);
532 xbt_assert(cluster, "Only hosts from Cluster can get a backbone.");
533 xbt_assert(nullptr == cluster->backbone_, "Cluster %s already has a backbone link!", cluster->name_);
535 cluster->backbone_ = bb;
536 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->name_);
539 void sg_platf_new_cabinet(sg_platf_cabinet_cbarg_t cabinet)
542 char *groups , *host_id , *link_id = NULL;
544 xbt_dynar_t radical_elements;
545 xbt_dynar_t radical_ends;
548 radical_elements = xbt_str_split(cabinet->radical, ",");
549 xbt_dynar_foreach(radical_elements, iter, groups) {
551 radical_ends = xbt_str_split(groups, "-");
552 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
554 switch (xbt_dynar_length(radical_ends)) {
559 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
562 surf_parse_error("Malformed radical");
565 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
566 memset(&host, 0, sizeof(host));
568 host.core_amount = 1;
570 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
571 memset(&link, 0, sizeof(link));
572 link.policy = SURF_LINK_FULLDUPLEX;
573 link.latency = cabinet->lat;
574 link.bandwidth = cabinet->bw;
576 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
577 memset(&host_link, 0, sizeof(host_link));
579 for (i = start; i <= end; i++) {
580 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
581 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
584 host.speed_peak = xbt_dynar_new(sizeof(double), NULL);
585 xbt_dynar_push(host.speed_peak,&cabinet->speed);
586 sg_platf_new_host(&host);
587 xbt_dynar_free(&host.speed_peak);
588 sg_platf_new_link(&link);
590 char* link_up = bprintf("%s_UP",link_id);
591 char* link_down = bprintf("%s_DOWN",link_id);
592 host_link.id = host_id;
593 host_link.link_up = link_up;
594 host_link.link_down = link_down;
595 sg_platf_new_hostlink(&host_link);
603 xbt_dynar_free(&radical_ends);
605 xbt_dynar_free(&radical_elements);
608 void sg_platf_new_peer(sg_platf_peer_cbarg_t peer)
610 using simgrid::surf::NetCard;
611 using simgrid::surf::AsCluster;
613 char *host_id = NULL;
614 char *link_id = NULL;
615 char *router_id = NULL;
618 host_id = bprintf("peer_%s", peer->id);
619 link_id = bprintf("link_%s", peer->id);
620 router_id = bprintf("router_%s", peer->id);
622 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
623 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
625 AS.routing = A_surfxml_AS_routing_Cluster;
626 sg_platf_new_AS_begin(&AS);
628 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->speed);
629 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
630 memset(&host, 0, sizeof(host));
633 host.speed_peak = xbt_dynar_new(sizeof(double), NULL);
634 xbt_dynar_push(host.speed_peak,&peer->speed);
636 //host.power_peak = peer->power;
637 host.speed_trace = peer->availability_trace;
638 host.state_trace = peer->state_trace;
639 host.core_amount = 1;
640 sg_platf_new_host(&host);
641 xbt_dynar_free(&host.speed_peak);
643 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
644 memset(&link, 0, sizeof(link));
645 link.policy = SURF_LINK_SHARED;
646 link.latency = peer->lat;
648 char* link_up = bprintf("%s_UP",link_id);
649 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
650 peer->bw_out, peer->lat);
652 link.bandwidth = peer->bw_out;
653 sg_platf_new_link(&link);
655 char* link_down = bprintf("%s_DOWN",link_id);
656 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
657 peer->bw_in, peer->lat);
659 link.bandwidth = peer->bw_in;
660 sg_platf_new_link(&link);
662 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
663 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
664 memset(&host_link, 0, sizeof(host_link));
665 host_link.id = host_id;
666 host_link.link_up = link_up;
667 host_link.link_down = link_down;
668 sg_platf_new_hostlink(&host_link);
670 XBT_DEBUG("<router id=\"%s\"/>", router_id);
671 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
672 memset(&router, 0, sizeof(router));
673 router.id = router_id;
674 router.coord = peer->coord;
675 sg_platf_new_router(&router);
676 static_cast<AsCluster*>(current_routing)->router_ = static_cast<NetCard*>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
679 sg_platf_new_AS_end();
682 //xbt_dynar_free(&tab_elements_num);
690 static void check_disk_attachment()
692 xbt_lib_cursor_t cursor;
695 simgrid::surf::NetCard *host_elm;
696 xbt_lib_foreach(storage_lib, cursor, key, data) {
697 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
698 simgrid::surf::Storage *storage = static_cast<simgrid::surf::Storage*>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
699 host_elm = sg_netcard_by_name_or_null(storage->p_attach);
701 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
706 void routing_register_callbacks()
708 simgrid::surf::on_postparse.connect(check_disk_attachment);
710 instr_routing_define_callbacks();
713 /** \brief Frees all memory allocated by the routing module */
714 void routing_exit(void) {
715 delete routing_platf;
721 RoutingPlatf::RoutingPlatf(Link *loopback)
722 : loopback_(loopback)
725 RoutingPlatf::~RoutingPlatf()
733 AS_t surf_AS_get_routing_root() {
734 return routing_platf->root_;
737 const char *surf_AS_get_name(simgrid::surf::As *as) {
741 static simgrid::surf::As *surf_AS_recursive_get_by_name(simgrid::surf::As *current, const char * name)
743 xbt_dict_cursor_t cursor = NULL;
746 simgrid::surf::As *tmp = NULL;
748 if(!strcmp(current->name_, name))
751 xbt_dict_foreach(current->children_, cursor, key, elem) {
752 tmp = surf_AS_recursive_get_by_name(elem, name);
760 simgrid::surf::As *surf_AS_get_by_name(const char * name)
762 simgrid::surf::As *as = surf_AS_recursive_get_by_name(routing_platf->root_, name);
764 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
768 xbt_dict_t surf_AS_get_children(simgrid::surf::As *as)
770 return as->children_;
773 xbt_dynar_t surf_AS_get_hosts(simgrid::surf::As *as)
775 xbt_dynar_t elms = as->vertices_;
776 int count = xbt_dynar_length(elms);
777 xbt_dynar_t res = xbt_dynar_new(sizeof(sg_host_t), NULL);
778 for (int index = 0; index < count; index++) {
780 xbt_dynar_get_as(elms, index, simgrid::surf::NetCard*);
781 sg_host_t delm = simgrid::s4u::Host::by_name_or_null(relm->name());
783 xbt_dynar_push(res, &delm);
789 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
790 as->getGraph(graph, nodes, edges);