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_private.hpp"
9 #include "surf_routing_cluster.hpp"
11 #include "simgrid/sg_config.h"
12 #include "storage_interface.hpp"
13 #include "surf/surfxml_parse_values.h"
15 #include "src/surf/surf_routing_cluster_torus.hpp"
16 #include "src/surf/surf_routing_cluster_fat_tree.hpp"
17 #include "src/surf/surf_routing_dijkstra.hpp"
18 #include "src/surf/surf_routing_floyd.hpp"
19 #include "src/surf/surf_routing_full.hpp"
20 #include "src/surf/surf_routing_vivaldi.hpp"
21 #include "src/surf/xml/platf.hpp" // FIXME: move that back to the parsing area
25 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
31 simgrid::xbt::signal<void(simgrid::surf::NetCard*)> netcardCreatedCallbacks;
32 simgrid::xbt::signal<void(simgrid::surf::As*)> asCreatedCallbacks;
34 As::As(const char*name)
35 : name_(xbt_strdup(name))
39 xbt_dict_free(&sons_);
40 xbt_dynar_free(&vertices_);
41 xbt_dynar_free(&upDownLinks);
42 if (nullptr != bypassRoutes_)
43 for (auto &kv : *bypassRoutes_)
54 xbt_dynar_t As::getOneLinkRoutes() {
58 int As::addComponent(NetCard *elm) {
59 XBT_DEBUG("Load component \"%s\"", elm->name());
60 xbt_dynar_push_as(vertices_, NetCard*, elm);
61 return xbt_dynar_length(vertices_)-1;
64 void As::addRoute(sg_platf_route_cbarg_t /*route*/){
65 xbt_die("AS %s does not accept new routes (wrong class).",name_);
68 std::vector<Link*> *As::getBypassRoute(NetCard *src, NetCard *dst)
70 // If never set a bypass route return NULL without any further computations
71 XBT_DEBUG("generic_get_bypassroute from %s to %s", src->name(), dst->name());
72 if (bypassRoutes_ == nullptr)
75 std::vector<Link*> *bypassedRoute = nullptr;
77 if(dst->containingAS() == this && src->containingAS() == this ){
78 char *route_name = bprintf("%s#%s", src->name(), dst->name());
79 if (bypassRoutes_->find(route_name) != bypassRoutes_->end()) {
80 bypassedRoute = bypassRoutes_->at(route_name);
81 XBT_DEBUG("Found a bypass route with %zu links",bypassedRoute->size());
87 int index_src, index_dst;
88 As **current_src = NULL;
89 As **current_dst = NULL;
91 As *src_as = src->containingAS();
92 As *dst_as = dst->containingAS();
94 /* (2) find the path to the root routing component */
95 xbt_dynar_t path_src = xbt_dynar_new(sizeof(As*), NULL);
97 while (current != NULL) {
98 xbt_dynar_push(path_src, ¤t);
99 current = current->father_;
101 xbt_dynar_t path_dst = xbt_dynar_new(sizeof(As*), NULL);
103 while (current != NULL) {
104 xbt_dynar_push(path_dst, ¤t);
105 current = current->father_;
108 /* (3) find the common father */
109 index_src = path_src->used - 1;
110 index_dst = path_dst->used - 1;
111 current_src = (As **) xbt_dynar_get_ptr(path_src, index_src);
112 current_dst = (As **) xbt_dynar_get_ptr(path_dst, index_dst);
113 while (index_src >= 0 && index_dst >= 0 && *current_src == *current_dst) {
114 xbt_dynar_pop_ptr(path_src);
115 xbt_dynar_pop_ptr(path_dst);
118 current_src = (As **) xbt_dynar_get_ptr(path_src, index_src);
119 current_dst = (As **) xbt_dynar_get_ptr(path_dst, index_dst);
122 int max_index_src = path_src->used - 1;
123 int max_index_dst = path_dst->used - 1;
125 int max_index = std::max(max_index_src, max_index_dst);
127 for (int max = 0; max <= max_index; max++) {
128 for (int i = 0; i < max; i++) {
129 if (i <= max_index_src && max <= max_index_dst) {
130 char *route_name = bprintf("%s#%s",
131 (*(As **) (xbt_dynar_get_ptr(path_src, i)))->name_,
132 (*(As **) (xbt_dynar_get_ptr(path_dst, max)))->name_);
133 if (bypassRoutes_->find(route_name) != bypassRoutes_->end())
134 bypassedRoute = bypassRoutes_->at(route_name);
135 xbt_free(route_name);
139 if (max <= max_index_src && i <= max_index_dst) {
140 char *route_name = bprintf("%s#%s",
141 (*(As **) (xbt_dynar_get_ptr(path_src, max)))->name_,
142 (*(As **) (xbt_dynar_get_ptr(path_dst, i)))->name_);
143 if (bypassRoutes_->find(route_name) != bypassRoutes_->end())
144 bypassedRoute = bypassRoutes_->at(route_name);
145 xbt_free(route_name);
154 if (max <= max_index_src && max <= max_index_dst) {
155 char *route_name = bprintf("%s#%s",
156 (*(As **) (xbt_dynar_get_ptr(path_src, max)))->name_,
157 (*(As **) (xbt_dynar_get_ptr(path_dst, max)))->name_);
159 if (bypassRoutes_->find(route_name) != bypassRoutes_->end())
160 bypassedRoute = bypassRoutes_->at(route_name);
161 xbt_free(route_name);
167 xbt_dynar_free(&path_src);
168 xbt_dynar_free(&path_dst);
170 return bypassedRoute;
173 void As::addBypassRoute(sg_platf_route_cbarg_t e_route){
174 const char *src = e_route->src;
175 const char *dst = e_route->dst;
177 if(bypassRoutes_ == nullptr)
178 bypassRoutes_ = new std::map<std::string, std::vector<Link*>*>();
180 char *route_name = bprintf("%s#%s", src, dst);
182 /* Argument validity checks */
183 if (e_route->gw_dst) {
184 XBT_DEBUG("Load bypassASroute from %s@%s to %s@%s",
185 src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
186 xbt_assert(!xbt_dynar_is_empty(e_route->link_list), "Bypass route between %s@%s and %s@%s cannot be empty.",
187 src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
188 xbt_assert(bypassRoutes_->find(route_name) == bypassRoutes_->end(),
189 "The bypass route between %s@%s and %s@%s already exists.",
190 src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
192 XBT_DEBUG("Load bypassRoute from %s to %s", src, dst);
193 xbt_assert(!xbt_dynar_is_empty(e_route->link_list), "Bypass route between %s and %s cannot be empty.", src, dst);
194 xbt_assert(bypassRoutes_->find(route_name) == bypassRoutes_->end(), "The bypass route between %s and %s already exists.", src, dst);
197 /* Build the value that will be stored in the dict */
198 std::vector<Link*> *newRoute = new std::vector<Link*>();
201 xbt_dynar_foreach(e_route->link_list, cpt, linkName) {
202 Link *link = Link::byName(linkName);
204 newRoute->push_back(link);
206 THROWF(mismatch_error, 0, "Link '%s' not found", linkName);
210 bypassRoutes_->insert({route_name, newRoute});
211 xbt_free(route_name);
214 }} // namespace simgrid::surf
217 * @ingroup SURF_build_api
218 * @brief A library containing all known hosts
220 xbt_dict_t host_list;
222 int COORD_HOST_LEVEL=0; //Coordinates level
224 int MSG_FILE_LEVEL; //Msg file level
226 int SIMIX_STORAGE_LEVEL; //Simix storage level
227 int MSG_STORAGE_LEVEL; //Msg storage level
229 xbt_lib_t as_router_lib;
230 int ROUTING_ASR_LEVEL; //Routing level
231 int COORD_ASR_LEVEL; //Coordinates level
232 int NS3_ASR_LEVEL; //host node for ns3
233 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
235 /** @brief Retrieve a netcard from its name
237 * Netcards are the thing that connect host or routers to the network
239 simgrid::surf::NetCard *sg_netcard_by_name_or_null(const char *name)
241 sg_host_t h = sg_host_by_name(name);
242 simgrid::surf::NetCard *netcard = h==NULL ? NULL: h->pimpl_netcard;
244 netcard = (simgrid::surf::NetCard*) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
249 simgrid::surf::RoutingPlatf *routing_platf = NULL;
252 /** The current AS in the parsing */
253 static simgrid::surf::As *current_routing = NULL;
254 simgrid::surf::As* routing_get_current()
256 return current_routing;
259 /** @brief Add a link connecting an host to the rest of its AS (which must be cluster or vivaldi) */
260 void sg_platf_new_hostlink(sg_platf_host_link_cbarg_t netcard_arg)
262 simgrid::surf::NetCard *netcard = sg_host_by_name(netcard_arg->id)->pimpl_netcard;
263 xbt_assert(netcard, "Host '%s' not found!", netcard_arg->id);
264 xbt_assert(dynamic_cast<simgrid::surf::AsCluster*>(current_routing) ||
265 dynamic_cast<simgrid::surf::AsVivaldi*>(current_routing),
266 "Only hosts from Cluster and Vivaldi ASes can get a host_link.");
268 s_surf_parsing_link_up_down_t link_up_down;
269 link_up_down.link_up = Link::byName(netcard_arg->link_up);
270 link_up_down.link_down = Link::byName(netcard_arg->link_down);
272 xbt_assert(link_up_down.link_up, "Link '%s' not found!",netcard_arg->link_up);
273 xbt_assert(link_up_down.link_down, "Link '%s' not found!",netcard_arg->link_down);
275 // If dynar is is greater than netcard id and if the host_link is already defined
276 if((int)xbt_dynar_length(current_routing->upDownLinks) > netcard->id() &&
277 xbt_dynar_get_as(current_routing->upDownLinks, netcard->id(), void*))
278 surf_parse_error("Host_link for '%s' is already defined!",netcard_arg->id);
280 XBT_DEBUG("Push Host_link for host '%s' to position %d", netcard->name(), netcard->id());
281 xbt_dynar_set_as(current_routing->upDownLinks, netcard->id(), s_surf_parsing_link_up_down_t, link_up_down);
284 void sg_platf_new_trace(sg_platf_trace_cbarg_t trace)
286 tmgr_trace_t tmgr_trace;
287 if (!trace->file || strcmp(trace->file, "") != 0) {
288 tmgr_trace = tmgr_trace_new_from_file(trace->file);
290 xbt_assert(strcmp(trace->pc_data, ""),
291 "Trace '%s' must have either a content, or point to a file on disk.",trace->id);
292 tmgr_trace = tmgr_trace_new_from_string(trace->id, trace->pc_data, trace->periodicity);
294 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
298 * \brief Make a new routing component to the platform
300 * Add a new autonomous system to the platform. Any elements (such as host,
301 * router or sub-AS) added after this call and before the corresponding call
302 * to sg_platf_new_AS_close() will be added to this AS.
304 * Once this function was called, the configuration concerning the used
305 * models cannot be changed anymore.
307 * @param AS_id name of this autonomous system. Must be unique in the platform
308 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
310 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
312 XBT_DEBUG("routing_AS_begin");
314 xbt_assert(nullptr == xbt_lib_get_or_null(as_router_lib, AS->id, ROUTING_ASR_LEVEL),
315 "Refusing to create a second AS called \"%s\".", AS->id);
317 _sg_cfg_init_status = 2; /* HACK: direct access to the global controlling the level of configuration to prevent
318 * any further config now that we created some real content */
321 /* search the routing model */
322 simgrid::surf::As *new_as = NULL;
324 case A_surfxml_AS_routing_Cluster: new_as = new simgrid::surf::AsCluster(AS->id); break;
325 case A_surfxml_AS_routing_ClusterTorus: new_as = new simgrid::surf::AsClusterTorus(AS->id); break;
326 case A_surfxml_AS_routing_ClusterFatTree: new_as = new simgrid::surf::AsClusterFatTree(AS->id); break;
327 case A_surfxml_AS_routing_Dijkstra: new_as = new simgrid::surf::AsDijkstra(AS->id, 0); break;
328 case A_surfxml_AS_routing_DijkstraCache: new_as = new simgrid::surf::AsDijkstra(AS->id, 1); break;
329 case A_surfxml_AS_routing_Floyd: new_as = new simgrid::surf::AsFloyd(AS->id); break;
330 case A_surfxml_AS_routing_Full: new_as = new simgrid::surf::AsFull(AS->id); break;
331 case A_surfxml_AS_routing_None: new_as = new simgrid::surf::AsNone(AS->id); break;
332 case A_surfxml_AS_routing_Vivaldi: new_as = new simgrid::surf::AsVivaldi(AS->id); break;
333 default: xbt_die("Not a valid model!"); break;
336 /* make a new routing component */
337 simgrid::surf::NetCard *netcard = new simgrid::surf::NetCardImpl(new_as->name_, SURF_NETWORK_ELEMENT_AS, current_routing);
339 if (current_routing == NULL && routing_platf->root_ == NULL) {
340 /* it is the first one */
341 new_as->father_ = NULL;
342 routing_platf->root_ = new_as;
344 } else if (current_routing != NULL && routing_platf->root_ != NULL) {
346 xbt_assert(!xbt_dict_get_or_null(current_routing->sons_, AS->id),
347 "The AS \"%s\" already exists", AS->id);
348 /* it is a part of the tree */
349 new_as->father_ = current_routing;
350 /* set the father behavior */
351 if (current_routing->hierarchy_ == SURF_ROUTING_NULL)
352 current_routing->hierarchy_ = SURF_ROUTING_RECURSIVE;
353 /* add to the sons dictionary */
354 xbt_dict_set(current_routing->sons_, AS->id,
355 (void *) new_as, NULL);
356 /* add to the father element list */
357 netcard->setId(current_routing->addComponent(netcard));
359 THROWF(arg_error, 0, "All defined components must belong to a AS");
362 xbt_lib_set(as_router_lib, netcard->name(), ROUTING_ASR_LEVEL, (void *) netcard);
363 XBT_DEBUG("Having set name '%s' id '%d'", new_as->name_, netcard->id());
365 /* set the new current component of the tree */
366 current_routing = new_as;
367 current_routing->netcard_ = netcard;
369 simgrid::surf::netcardCreatedCallbacks(netcard);
370 simgrid::surf::asCreatedCallbacks(new_as);
374 * \brief Specify that the current description of AS is finished
376 * Once you've declared all the content of your AS, you have to close
377 * it with this call. Your AS is not usable until you call this function.
379 * @fixme: this call is not as robust as wanted: bad things WILL happen
380 * if you call it twice for the same AS, or if you forget calling it, or
381 * even if you add stuff to a closed AS
384 void routing_AS_end()
386 xbt_assert(current_routing, "Cannot seal the current AS: none under construction");
387 current_routing->Seal();
388 current_routing = current_routing->father_;
391 /* Aux Business methods */
394 * \brief Get the AS father and the first elements of the chain
396 * \param src the source host name
397 * \param dst the destination host name
399 * Get the common father of the to processing units, and the first different
400 * father in the chain
402 static void elements_father(sg_netcard_t src, sg_netcard_t dst,
407 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
408 #define ROUTING_HIERARCHY_MAXDEPTH 16 /* increase if it is not enough */
409 simgrid::surf::As *path_src[ROUTING_HIERARCHY_MAXDEPTH];
410 simgrid::surf::As *path_dst[ROUTING_HIERARCHY_MAXDEPTH];
413 simgrid::surf::As *current_src;
414 simgrid::surf::As *current_dst;
415 simgrid::surf::As *father;
417 /* (1) find the path to root of src and dst*/
418 simgrid::surf::As *src_as = src->containingAS();
419 simgrid::surf::As *dst_as = dst->containingAS();
421 xbt_assert(src_as, "Host %s must be in an AS", src->name());
422 xbt_assert(dst_as, "Host %s must be in an AS", dst->name());
424 /* (2) find the path to the root routing component */
425 for (simgrid::surf::As *current = src_as; current != NULL; current = current->father_) {
426 if (index_src >= ROUTING_HIERARCHY_MAXDEPTH)
427 xbt_die("ROUTING_HIERARCHY_MAXDEPTH should be increased for element %s", src->name());
428 path_src[index_src++] = current;
430 for (simgrid::surf::As *current = dst_as; current != NULL; current = current->father_) {
431 if (index_dst >= ROUTING_HIERARCHY_MAXDEPTH)
432 xbt_die("ROUTING_HIERARCHY_MAXDEPTH should be increased for path_dst");
433 path_dst[index_dst++] = current;
436 /* (3) find the common father */
438 current_src = path_src[--index_src];
439 current_dst = path_dst[--index_dst];
440 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
442 /* (4) they are not in the same routing component, make the path */
443 if (current_src == current_dst)
444 father = current_src;
446 father = path_src[index_src + 1];
448 /* (5) result generation */
449 *res_father = father; /* first the common father of src and dst */
450 *res_src = current_src; /* second the first different father of src */
451 *res_dst = current_dst; /* three the first different father of dst */
453 #undef ROUTING_HIERARCHY_MAXDEPTH
457 * \brief Recursive function for get_route_and_latency
459 * \param src the source host name
460 * \param dst the destination host name
461 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
462 * \param *latency the latency, if needed
464 static void _get_route_and_latency(simgrid::surf::NetCard *src, simgrid::surf::NetCard *dst,
465 xbt_dynar_t * links, double *latency)
467 s_sg_platf_route_cbarg_t route = SG_PLATF_ROUTE_INITIALIZER;
468 memset(&route,0,sizeof(route));
470 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
471 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->name(), dst->name());
473 /* Find how src and dst are interconnected */
474 simgrid::surf::As *common_father, *src_father, *dst_father;
475 elements_father(src, dst, &common_father, &src_father, &dst_father);
476 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
477 common_father->name_, src_father->name_, dst_father->name_);
479 /* Check whether a direct bypass is defined. If so, use it and bail out */
480 std::vector<Link*> *bypassed_route = common_father->getBypassRoute(src, dst);
481 if (nullptr != bypassed_route) {
482 for (Link *link : *bypassed_route) {
483 xbt_dynar_push(*links,&link);
485 *latency += link->getLatency();
490 /* If src and dst are in the same AS, life is good */
491 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
492 route.link_list = *links;
493 common_father->getRouteAndLatency(src, dst, &route, latency);
497 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
499 route.link_list = xbt_dynar_new(sizeof(Link*), NULL);
501 common_father->getRouteAndLatency(src_father->netcard_, dst_father->netcard_, &route, latency);
502 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
503 "bad gateways for route from \"%s\" to \"%s\"", src->name(), dst->name());
505 /* If source gateway is not our source, we have to recursively find our way up to this point */
506 if (src != route.gw_src)
507 _get_route_and_latency(src, route.gw_src, links, latency);
508 xbt_dynar_merge(links, &route.link_list);
510 /* If dest gateway is not our destination, we have to recursively find our way from this point */
511 if (route.gw_dst != dst)
512 _get_route_and_latency(route.gw_dst, dst, links, latency);
520 * \brief Find a route between hosts
522 * \param src the network_element_t for src host
523 * \param dst the network_element_t for dst host
524 * \param route where to store the list of links.
525 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
526 * \param latency where to store the latency experienced on the path (or NULL if not interested)
527 * It is the caller responsability to initialize latency to 0 (we add to provided route)
530 * walk through the routing components tree and find a route between hosts
531 * by calling each "get_route" function in each routing component.
533 void RoutingPlatf::getRouteAndLatency(NetCard *src, NetCard *dst, xbt_dynar_t* route, double *latency)
535 XBT_DEBUG("getRouteAndLatency from %s to %s", src->name(), dst->name());
536 if (NULL == *route) {
537 xbt_dynar_reset(routing_platf->lastRoute_);
538 *route = routing_platf->lastRoute_;
541 _get_route_and_latency(src, dst, route, latency);
544 static xbt_dynar_t _recursiveGetOneLinkRoutes(As *rc)
546 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
548 //adding my one link routes
549 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
551 xbt_dynar_merge(&ret,&onelink_mine);
555 xbt_dict_cursor_t cursor = NULL;
557 xbt_dict_foreach(rc->sons_, cursor, key, rc_child) {
558 xbt_dynar_t onelink_child = _recursiveGetOneLinkRoutes(rc_child);
560 xbt_dynar_merge(&ret,&onelink_child);
565 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
566 return _recursiveGetOneLinkRoutes(root_);
572 /** @brief create the root AS */
573 void routing_model_create( void *loopback)
575 routing_platf = new simgrid::surf::RoutingPlatf(loopback);
578 /* ************************************************************************** */
579 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
581 void routing_cluster_add_backbone(simgrid::surf::Link* bb) {
582 simgrid::surf::AsCluster *cluster = dynamic_cast<simgrid::surf::AsCluster*>(current_routing);
584 xbt_assert(cluster, "Only hosts from Cluster can get a backbone.");
585 xbt_assert(nullptr == cluster->backbone_, "Cluster %s already has a backbone link!", cluster->name_);
587 cluster->backbone_ = bb;
588 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->name_);
591 void sg_platf_new_cabinet(sg_platf_cabinet_cbarg_t cabinet)
594 char *groups , *host_id , *link_id = NULL;
596 xbt_dynar_t radical_elements;
597 xbt_dynar_t radical_ends;
600 radical_elements = xbt_str_split(cabinet->radical, ",");
601 xbt_dynar_foreach(radical_elements, iter, groups) {
603 radical_ends = xbt_str_split(groups, "-");
604 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
606 switch (xbt_dynar_length(radical_ends)) {
611 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
614 surf_parse_error("Malformed radical");
617 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
618 memset(&host, 0, sizeof(host));
620 host.core_amount = 1;
622 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
623 memset(&link, 0, sizeof(link));
624 link.policy = SURF_LINK_FULLDUPLEX;
625 link.latency = cabinet->lat;
626 link.bandwidth = cabinet->bw;
628 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
629 memset(&host_link, 0, sizeof(host_link));
631 for (i = start; i <= end; i++) {
632 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
633 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
636 host.speed_peak = xbt_dynar_new(sizeof(double), NULL);
637 xbt_dynar_push(host.speed_peak,&cabinet->speed);
638 sg_platf_new_host(&host);
639 xbt_dynar_free(&host.speed_peak);
640 sg_platf_new_link(&link);
642 char* link_up = bprintf("%s_UP",link_id);
643 char* link_down = bprintf("%s_DOWN",link_id);
644 host_link.id = host_id;
645 host_link.link_up = link_up;
646 host_link.link_down = link_down;
647 sg_platf_new_hostlink(&host_link);
655 xbt_dynar_free(&radical_ends);
657 xbt_dynar_free(&radical_elements);
660 void sg_platf_new_peer(sg_platf_peer_cbarg_t peer)
662 using simgrid::surf::NetCard;
663 using simgrid::surf::AsCluster;
665 char *host_id = NULL;
666 char *link_id = NULL;
667 char *router_id = NULL;
670 host_id = HOST_PEER(peer->id);
671 link_id = LINK_PEER(peer->id);
672 router_id = ROUTER_PEER(peer->id);
674 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
675 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
677 AS.routing = A_surfxml_AS_routing_Cluster;
678 sg_platf_new_AS_begin(&AS);
680 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->speed);
681 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
682 memset(&host, 0, sizeof(host));
685 host.speed_peak = xbt_dynar_new(sizeof(double), NULL);
686 xbt_dynar_push(host.speed_peak,&peer->speed);
688 //host.power_peak = peer->power;
689 host.speed_trace = peer->availability_trace;
690 host.state_trace = peer->state_trace;
691 host.core_amount = 1;
692 sg_platf_new_host(&host);
693 xbt_dynar_free(&host.speed_peak);
695 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
696 memset(&link, 0, sizeof(link));
697 link.policy = SURF_LINK_SHARED;
698 link.latency = peer->lat;
700 char* link_up = bprintf("%s_UP",link_id);
701 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
702 peer->bw_out, peer->lat);
704 link.bandwidth = peer->bw_out;
705 sg_platf_new_link(&link);
707 char* link_down = bprintf("%s_DOWN",link_id);
708 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
709 peer->bw_in, peer->lat);
711 link.bandwidth = peer->bw_in;
712 sg_platf_new_link(&link);
714 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
715 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
716 memset(&host_link, 0, sizeof(host_link));
717 host_link.id = host_id;
718 host_link.link_up = link_up;
719 host_link.link_down = link_down;
720 sg_platf_new_hostlink(&host_link);
722 XBT_DEBUG("<router id=\"%s\"/>", router_id);
723 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
724 memset(&router, 0, sizeof(router));
725 router.id = router_id;
726 router.coord = peer->coord;
727 sg_platf_new_router(&router);
728 static_cast<AsCluster*>(current_routing)->router_ = static_cast<NetCard*>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
731 sg_platf_new_AS_end();
734 //xbt_dynar_free(&tab_elements_num);
742 // static void routing_parse_Srandom(void)
744 // double mean, std, min, max, seed;
745 // char *random_id = A_surfxml_random_id;
746 // char *random_radical = A_surfxml_random_radical;
747 // char *rd_name = NULL;
749 // mean = surf_parse_get_double(A_surfxml_random_mean);
750 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
751 // min = surf_parse_get_double(A_surfxml_random_min);
752 // max = surf_parse_get_double(A_surfxml_random_max);
753 // seed = surf_parse_get_double(A_surfxml_random_seed);
757 // random_data_t random = xbt_new0(s_random_data_t, 1);
760 // xbt_dynar_t radical_elements;
761 // unsigned int iter;
764 // xbt_dynar_t radical_ends;
766 // switch (A_surfxml_random_generator) {
767 // case AU_surfxml_random_generator:
768 // case A_surfxml_random_generator_NONE:
769 // random->generator = NONE;
771 // case A_surfxml_random_generator_DRAND48:
772 // random->generator = DRAND48;
774 // case A_surfxml_random_generator_RAND:
775 // random->generator = RAND;
777 // case A_surfxml_random_generator_RNGSTREAM:
778 // random->generator = RNGSTREAM;
781 // surf_parse_error("Invalid random generator");
784 // random->seed = seed;
785 // random->min = min;
786 // random->max = max;
788 // /* Check user stupidities */
790 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
792 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
794 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
796 // /* normalize the mean and standard deviation before storing */
797 // random->mean = (mean - min) / (max - min);
798 // random->std = std / (max - min);
800 // if (random->mean * (1 - random->mean) < random->std * random->std)
801 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
802 // random->mean, random->std);
805 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
806 // random_id, random->min, random->max, random->mean, random->std,
807 // (int)random->generator, random->seed, random_radical);
809 // if (!random_value)
810 // random_value = xbt_dict_new_homogeneous(free);
812 // if (!strcmp(random_radical, "")) {
813 // res = random_generate(random);
814 // rd_value = bprintf("%f", res);
815 // xbt_dict_set(random_value, random_id, rd_value, NULL);
817 // radical_elements = xbt_str_split(random_radical, ",");
818 // xbt_dynar_foreach(radical_elements, iter, groups) {
819 // radical_ends = xbt_str_split(groups, "-");
820 // switch (xbt_dynar_length(radical_ends)) {
822 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
823 // "Custom Random '%s' already exists !", random_id);
824 // res = random_generate(random);
826 // bprintf("%s%d", random_id,
827 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
828 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
833 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
834 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
835 // for (i = start; i <= end; i++) {
836 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
837 // "Custom Random '%s' already exists !", bprintf("%s%d",
840 // res = random_generate(random);
841 // tmpbuf = bprintf("%s%d", random_id, i);
842 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
847 // XBT_CRITICAL("Malformed radical");
850 // res = random_generate(random);
851 // rd_name = bprintf("%s_router", random_id);
852 // rd_value = bprintf("%f", res);
853 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
855 // xbt_dynar_free(&radical_ends);
858 // xbt_dynar_free(&radical_elements);
862 static void check_disk_attachment()
864 xbt_lib_cursor_t cursor;
867 simgrid::surf::NetCard *host_elm;
868 xbt_lib_foreach(storage_lib, cursor, key, data) {
869 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
870 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));
871 host_elm = sg_netcard_by_name_or_null(storage->p_attach);
873 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
878 void routing_register_callbacks()
880 simgrid::surf::on_postparse.connect(check_disk_attachment);
882 instr_routing_define_callbacks();
886 * \brief Recursive function for finalize
888 * \param rc the source host name
890 * This fuction is call by "finalize". It allow to finalize the
891 * AS or routing components. It delete all the structures.
893 static void finalize_rec(simgrid::surf::As *as) {
894 xbt_dict_cursor_t cursor = NULL;
898 xbt_dict_foreach(as->sons_, cursor, key, elem) {
905 /** \brief Frees all memory allocated by the routing module */
906 void routing_exit(void) {
907 delete routing_platf;
913 RoutingPlatf::RoutingPlatf(void *loopback)
914 : loopback_(loopback)
917 RoutingPlatf::~RoutingPlatf()
919 xbt_dynar_free(&lastRoute_);
926 AS_t surf_AS_get_routing_root() {
927 return routing_platf->root_;
930 const char *surf_AS_get_name(simgrid::surf::As *as) {
934 static simgrid::surf::As *surf_AS_recursive_get_by_name(
935 simgrid::surf::As *current, const char * name)
937 xbt_dict_cursor_t cursor = NULL;
940 simgrid::surf::As *tmp = NULL;
942 if(!strcmp(current->name_, name))
945 xbt_dict_foreach(current->sons_, cursor, key, elem) {
946 tmp = surf_AS_recursive_get_by_name(elem, name);
954 simgrid::surf::As *surf_AS_get_by_name(const char * name)
956 simgrid::surf::As *as = surf_AS_recursive_get_by_name(routing_platf->root_, name);
958 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
962 xbt_dict_t surf_AS_get_routing_sons(simgrid::surf::As *as)
967 xbt_dynar_t surf_AS_get_hosts(simgrid::surf::As *as)
969 xbt_dynar_t elms = as->vertices_;
970 int count = xbt_dynar_length(elms);
971 xbt_dynar_t res = xbt_dynar_new(sizeof(sg_host_t), NULL);
972 for (int index = 0; index < count; index++) {
974 xbt_dynar_get_as(elms, index, simgrid::surf::NetCard*);
975 sg_host_t delm = simgrid::s4u::Host::by_name_or_null(relm->name());
977 xbt_dynar_push(res, &delm);
983 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
984 as->getGraph(graph, nodes, edges);