- /* (3) find the common father.
- * Before that, index_src and index_dst may be different, they both point to NULL in path_src/path_dst
- * So we move them down simultaneously as long as they point to the same content.
- */
- do {
- current_src = path_src[--index_src];
- current_dst = path_dst[--index_dst];
- } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
-
- /* (4) if we did not find a difference (index_src or index_dst went to 0), both elements are in the same AS */
- if (current_src == current_dst)
- father = current_src;
- else // we found a difference
- father = path_src[index_src + 1];
-
- /* (5) result generation */
- *common_ancestor = father; /* the common father of src and dst */
- *src_ancestor = current_src; /* the first different father of src */
- *dst_ancestor = current_dst; /* the first different father of dst */
- #undef ROUTING_HIERARCHY_MAXDEPTH
- }
-
-
- xbt_dynar_t As::getOneLinkRoutes() {
- return NULL;
- }
-
- int As::addComponent(NetCard *elm) {
- xbt_dynar_push_as(vertices_, NetCard*, elm);
- return xbt_dynar_length(vertices_)-1;
- }
-
- void As::addRoute(sg_platf_route_cbarg_t /*route*/){
- xbt_die("AS %s does not accept new routes (wrong class).",name_);
- }
-
- /* PRECONDITION: this is the common ancestor of src and dst */
- std::vector<Link*> *As::getBypassRoute(NetCard *src, NetCard *dst)
- {
- // If never set a bypass route return NULL without any further computations
- XBT_DEBUG("generic_get_bypassroute from %s to %s", src->name(), dst->name());
- if (bypassRoutes_.empty())
- return nullptr;
-
- std::vector<Link*> *bypassedRoute = nullptr;
-
- if(dst->containingAS() == this && src->containingAS() == this ){
- char *route_name = bprintf("%s#%s", src->name(), dst->name());
- if (bypassRoutes_.find(route_name) != bypassRoutes_.end()) {
- bypassedRoute = bypassRoutes_.at(route_name);
- XBT_DEBUG("Found a bypass route with %zu links",bypassedRoute->size());
- }
- free(route_name);
- return bypassedRoute;
- }
-
- int index_src, index_dst;
- As **current_src = NULL;
- As **current_dst = NULL;
-
- As *src_as = src->containingAS();
- As *dst_as = dst->containingAS();
-
- /* (2) find the path to the root routing component */
- xbt_dynar_t path_src = xbt_dynar_new(sizeof(As*), NULL);
- As *current = src_as;
- while (current != NULL) {
- xbt_dynar_push(path_src, ¤t);
- current = current->father_;
- }
- xbt_dynar_t path_dst = xbt_dynar_new(sizeof(As*), NULL);
- current = dst_as;
- while (current != NULL) {
- xbt_dynar_push(path_dst, ¤t);
- current = current->father_;
- }
-
- /* (3) find the common father */
- index_src = path_src->used - 1;
- index_dst = path_dst->used - 1;
- current_src = (As **) xbt_dynar_get_ptr(path_src, index_src);
- current_dst = (As **) xbt_dynar_get_ptr(path_dst, index_dst);
- while (index_src >= 0 && index_dst >= 0 && *current_src == *current_dst) {
- xbt_dynar_pop_ptr(path_src);
- xbt_dynar_pop_ptr(path_dst);
- index_src--;
- index_dst--;
- current_src = (As **) xbt_dynar_get_ptr(path_src, index_src);
- current_dst = (As **) xbt_dynar_get_ptr(path_dst, index_dst);
- }
-
- int max_index_src = path_src->used - 1;
- int max_index_dst = path_dst->used - 1;
-
- int max_index = std::max(max_index_src, max_index_dst);
-
- for (int max = 0; max <= max_index; max++) {
- for (int i = 0; i < max; i++) {
- if (i <= max_index_src && max <= max_index_dst) {
- char *route_name = bprintf("%s#%s",
- (*(As **) (xbt_dynar_get_ptr(path_src, i)))->name_,
- (*(As **) (xbt_dynar_get_ptr(path_dst, max)))->name_);
- if (bypassRoutes_.find(route_name) != bypassRoutes_.end())
- bypassedRoute = bypassRoutes_.at(route_name);
- xbt_free(route_name);
- }
- if (bypassedRoute)
- break;
- if (max <= max_index_src && i <= max_index_dst) {
- char *route_name = bprintf("%s#%s",
- (*(As **) (xbt_dynar_get_ptr(path_src, max)))->name_,
- (*(As **) (xbt_dynar_get_ptr(path_dst, i)))->name_);
- if (bypassRoutes_.find(route_name) != bypassRoutes_.end())
- bypassedRoute = bypassRoutes_.at(route_name);
- xbt_free(route_name);
- }
- if (bypassedRoute)
- break;
- }
-
- if (bypassedRoute)
- break;
-
- if (max <= max_index_src && max <= max_index_dst) {
- char *route_name = bprintf("%s#%s",
- (*(As **) (xbt_dynar_get_ptr(path_src, max)))->name_,
- (*(As **) (xbt_dynar_get_ptr(path_dst, max)))->name_);
-
- if (bypassRoutes_.find(route_name) != bypassRoutes_.end())
- bypassedRoute = bypassRoutes_.at(route_name);
- xbt_free(route_name);
- }
- if (bypassedRoute)
- break;
- }
-
- xbt_dynar_free(&path_src);
- xbt_dynar_free(&path_dst);
-
- return bypassedRoute;
- }
-
- void As::addBypassRoute(sg_platf_route_cbarg_t e_route){
- const char *src = e_route->src;
- const char *dst = e_route->dst;
-
- char *route_name = bprintf("%s#%s", src, dst);
-
- /* Argument validity checks */
- if (e_route->gw_dst) {
- XBT_DEBUG("Load bypassASroute from %s@%s to %s@%s",
- src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
- xbt_assert(!e_route->link_list->empty(), "Bypass route between %s@%s and %s@%s cannot be empty.",
- src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
- xbt_assert(bypassRoutes_.find(route_name) == bypassRoutes_.end(), "The bypass route between %s@%s and %s@%s already exists.",
- src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
- } else {
- XBT_DEBUG("Load bypassRoute from %s to %s", src, dst);
- xbt_assert(!e_route->link_list->empty(), "Bypass route between %s and %s cannot be empty.", src, dst);
- xbt_assert(bypassRoutes_.find(route_name) == bypassRoutes_.end(), "The bypass route between %s and %s already exists.", src, dst);
- }
-
- /* Build a copy that will be stored in the dict */
- std::vector<Link*> *newRoute = new std::vector<Link*>();
- for (auto link: *e_route->link_list)
- newRoute->push_back(link);
-
- /* Store it */
- bypassRoutes_.insert({route_name, newRoute});
- xbt_free(route_name);
- }