src/surf/surf_routing_floyd.c

   1 /* Copyright (c) 2009, 2010, 2011. The SimGrid Team.
   2  * All rights reserved.                                                     */
   3
   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. */
   6
   7 #include "surf_routing_private.h"
   8
   9 /* Global vars */
  10 extern routing_global_t global_routing;
  11
  12 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
  13
  14 #define TO_FLOYD_COST(i,j) (as->cost_table)[(i)+(j)*table_size]
  15 #define TO_FLOYD_PRED(i,j) (as->predecessor_table)[(i)+(j)*table_size]
  16 #define TO_FLOYD_LINK(i,j) (as->link_table)[(i)+(j)*table_size]
  17
  18 /* Routing model structure */
  19
  20 typedef struct {
  21   s_as_t generic_routing;
  22   /* vars for calculate the floyd algorith. */
  23   int *predecessor_table;
  24   double *cost_table;
  25   route_t *link_table;
  26 } s_as_floyd_t, *as_floyd_t;
  27
  28 static void floyd_get_route_and_latency(AS_t asg, const char *src, const char *dst,
  29     route_t res, double *lat);
  30
  31 /* Business methods */
  32 static xbt_dynar_t floyd_get_onelink_routes(AS_t asg)
  33 {
  34   xbt_dynar_t ret = xbt_dynar_new(sizeof(onelink_t), xbt_free);
  35
  36   route_t route =   xbt_new0(s_route_t, 1);
  37   route->link_list = xbt_dynar_new(global_routing->size_of_link, NULL);
  38
  39   xbt_dict_cursor_t c1 = NULL, c2 = NULL;
  40   char *k1, *d1, *k2, *d2;
  41   xbt_dict_foreach(asg->to_index, c1, k1, d1) {
  42     xbt_dict_foreach(asg->to_index, c2, k2, d2) {
  43       xbt_dynar_reset(route->link_list);
  44       floyd_get_route_and_latency(asg, k1, k2, route, NULL);
  45       if (xbt_dynar_length(route->link_list) == 1) {
  46         void *link = *(void **) xbt_dynar_get_ptr(route->link_list, 0);
  47         onelink_t onelink = xbt_new0(s_onelink_t, 1);
  48         onelink->link_ptr = link;
  49         if (asg->hierarchy == SURF_ROUTING_BASE) {
  50           onelink->src = xbt_strdup(k1);
  51           onelink->dst = xbt_strdup(k2);
  52         } else if (asg->hierarchy == SURF_ROUTING_RECURSIVE) {
  53           onelink->src = xbt_strdup(route->src_gateway);
  54           onelink->dst = xbt_strdup(route->dst_gateway);
  55         }
  56         xbt_dynar_push(ret, &onelink);
  57       }
  58     }
  59   }
  60   return ret;
  61 }
  62
  63 static void floyd_get_route_and_latency(AS_t asg, const char *src, const char *dst,
  64     route_t res, double *lat)
  65 {
  66
  67   /* set utils vars */
  68   as_floyd_t as = (as_floyd_t)asg;
  69   size_t table_size = xbt_dict_length(asg->to_index);
  70
  71   generic_src_dst_check(asg, src, dst);
  72   int *src_id = xbt_dict_get_or_null(asg->to_index, src);
  73   int *dst_id = xbt_dict_get_or_null(asg->to_index, dst);
  74   if (src_id == NULL || dst_id == NULL)
  75     THROWF(arg_error,0,"No route from '%s' to '%s'",src,dst);
  76
  77   /* create a result route */
  78
  79   int first = 1;
  80   int pred = *dst_id;
  81   int prev_pred = 0;
  82   char *gw_src = NULL, *gw_dst = NULL, *prev_gw_src, *first_gw = NULL;
  83   unsigned int cpt;
  84   void *link;
  85   xbt_dynar_t links;
  86
  87   do {
  88     prev_pred = pred;
  89     pred = TO_FLOYD_PRED(*src_id, pred);
  90     if (pred == -1)             /* if no pred in route -> no route to host */
  91       break;
  92     xbt_assert(TO_FLOYD_LINK(pred, prev_pred),
  93                 "Invalid link for the route between \"%s\" or \"%s\"", src,
  94                 dst);
  95
  96     prev_gw_src = gw_src;
  97
  98     route_t e_route = TO_FLOYD_LINK(pred, prev_pred);
  99     gw_src = e_route->src_gateway;
 100     gw_dst = e_route->dst_gateway;
 101
 102     if (first)
 103       first_gw = gw_dst;
 104
 105     if (asg->hierarchy == SURF_ROUTING_RECURSIVE && !first
 106         && strcmp(gw_dst, prev_gw_src)) {
 107       xbt_dynar_t e_route_as_to_as;
 108       e_route_as_to_as = xbt_dynar_new(global_routing->size_of_link, NULL);
 109       routing_get_route_and_latency(gw_dst, prev_gw_src,&e_route_as_to_as,NULL);
 110       links = e_route_as_to_as;
 111       int pos = 0;
 112       xbt_dynar_foreach(links, cpt, link) {
 113         xbt_dynar_insert_at(res->link_list, pos, &link);
 114         if (lat)
 115           *lat += surf_network_model->extension.network.get_link_latency(link);
 116         pos++;
 117       }
 118       xbt_dynar_free(&e_route_as_to_as);
 119     }
 120
 121     links = e_route->link_list;
 122     xbt_dynar_foreach(links, cpt, link) {
 123       xbt_dynar_unshift(res->link_list, &link);
 124       if (lat)
 125         *lat += surf_network_model->extension.network.get_link_latency(link);
 126     }
 127     first = 0;
 128
 129   } while (pred != *src_id);
 130   if (pred == -1)
 131     THROWF(arg_error,0,"No route from '%s' to '%s'",src,dst);
 132
 133   if (asg->hierarchy == SURF_ROUTING_RECURSIVE) {
 134     res->src_gateway = xbt_strdup(gw_src);
 135     res->dst_gateway = xbt_strdup(first_gw);
 136   }
 137 }
 138
 139 static void floyd_finalize(AS_t rc)
 140 {
 141   as_floyd_t as = (as_floyd_t) rc;
 142   int i, j;
 143   size_t table_size;
 144   if (as) {
 145     table_size = xbt_dict_length(as->generic_routing.to_index);
 146     /* Delete link_table */
 147     for (i = 0; i < table_size; i++)
 148       for (j = 0; j < table_size; j++)
 149         generic_free_route(TO_FLOYD_LINK(i, j));
 150     xbt_free(as->link_table);
 151     /* Delete bypass dict */
 152     xbt_dict_free(&as->generic_routing.bypassRoutes);
 153     /* Delete index dict */
 154     xbt_dict_free(&(as->generic_routing.to_index));
 155     /* Delete predecessor and cost table */
 156     xbt_free(as->predecessor_table);
 157     xbt_free(as->cost_table);
 158
 159     model_generic_finalize(rc);
 160   }
 161 }
 162
 163 AS_t model_floyd_create(void)
 164 {
 165   as_floyd_t new_component = (as_floyd_t)model_generic_create_sized(sizeof(s_as_floyd_t));
 166   new_component->generic_routing.parse_route = model_floyd_parse_route;
 167   new_component->generic_routing.parse_ASroute = model_floyd_parse_route;
 168   new_component->generic_routing.get_route_and_latency = floyd_get_route_and_latency;
 169   new_component->generic_routing.get_onelink_routes =
 170       floyd_get_onelink_routes;
 171   new_component->generic_routing.finalize = floyd_finalize;
 172   return (AS_t)new_component;
 173 }
 174
 175 void model_floyd_end(AS_t current_routing)
 176 {
 177
 178         as_floyd_t as =
 179           ((as_floyd_t) current_routing);
 180
 181         unsigned int i, j, a, b, c;
 182
 183         /* set the size of table routing */
 184         size_t table_size = xbt_dict_length(as->generic_routing.to_index);
 185
 186         if(!as->link_table)
 187         {
 188                 /* Create Cost, Predecessor and Link tables */
 189                 as->cost_table = xbt_new0(double, table_size * table_size);       /* link cost from host to host */
 190                 as->predecessor_table = xbt_new0(int, table_size * table_size);  /* predecessor host numbers */
 191                 as->link_table = xbt_new0(route_t, table_size * table_size);    /* actual link between src and dst */
 192
 193                 /* Initialize costs and predecessors */
 194                 for (i = 0; i < table_size; i++)
 195                 for (j = 0; j < table_size; j++) {
 196                   TO_FLOYD_COST(i, j) = DBL_MAX;
 197                   TO_FLOYD_PRED(i, j) = -1;
 198                   TO_FLOYD_LINK(i, j) = NULL;       /* fixed, missing in the previous version */
 199                 }
 200         }
 201
 202         /* Add the loopback if needed */
 203         if (current_routing->hierarchy == SURF_ROUTING_BASE) {
 204                 for (i = 0; i < table_size; i++) {
 205                   route_t e_route = TO_FLOYD_LINK(i, i);
 206                   if (!e_route) {
 207                         e_route = xbt_new0(s_route_t, 1);
 208                         e_route->src_gateway = NULL;
 209                         e_route->dst_gateway = NULL;
 210                         e_route->link_list =
 211                                 xbt_dynar_new(global_routing->size_of_link, NULL);
 212                         xbt_dynar_push(e_route->link_list, &global_routing->loopback);
 213                         TO_FLOYD_LINK(i, i) = e_route;
 214                         TO_FLOYD_PRED(i, i) = i;
 215                         TO_FLOYD_COST(i, i) = 1;
 216                   }
 217                 }
 218         }
 219         /* Calculate path costs */
 220         for (c = 0; c < table_size; c++) {
 221                 for (a = 0; a < table_size; a++) {
 222                   for (b = 0; b < table_size; b++) {
 223                         if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
 224                           if (TO_FLOYD_COST(a, b) == DBL_MAX ||
 225                                   (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
 226                                    TO_FLOYD_COST(a, b))) {
 227                                 TO_FLOYD_COST(a, b) =
 228                                         TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
 229                                 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);
 230                           }
 231                         }
 232                   }
 233                 }
 234         }
 235 }
 236
 237 static int floyd_pointer_resource_cmp(const void *a, const void *b) {
 238   return a != b;
 239 }
 240
 241 //FIXME: kill dupplicates in next function with full routing
 242
 243 void model_floyd_parse_route(AS_t rc, const char *src,
 244         const char *dst, route_t route)
 245 {
 246         as_floyd_t as = (as_floyd_t) rc;
 247
 248         /* set the size of table routing */
 249         size_t table_size = xbt_dict_length(rc->to_index);
 250         int *src_id, *dst_id;
 251
 252         src_id = xbt_dict_get_or_null(rc->to_index, src);
 253         dst_id = xbt_dict_get_or_null(rc->to_index, dst);
 254
 255         xbt_assert(src_id, "Network elements %s not found", src);
 256         xbt_assert(dst_id, "Network elements %s not found", dst);
 257
 258         if(!as->link_table)
 259         {
 260           int i,j;
 261                 /* Create Cost, Predecessor and Link tables */
 262                 as->cost_table = xbt_new0(double, table_size * table_size);       /* link cost from host to host */
 263                 as->predecessor_table = xbt_new0(int, table_size * table_size);  /* predecessor host numbers */
 264                 as->link_table = xbt_new0(route_t, table_size * table_size);    /* actual link between src and dst */
 265
 266                 /* Initialize costs and predecessors */
 267                 for (i = 0; i < table_size; i++)
 268                 for (j = 0; j < table_size; j++) {
 269                   TO_FLOYD_COST(i, j) = DBL_MAX;
 270                   TO_FLOYD_PRED(i, j) = -1;
 271                   TO_FLOYD_LINK(i, j) = NULL;       /* fixed, missing in the previous version */
 272                 }
 273         }
 274
 275         if(TO_FLOYD_LINK(*src_id, *dst_id))
 276         {
 277                 if(!route->dst_gateway && !route->src_gateway)
 278                         XBT_DEBUG("See Route from \"%s\" to \"%s\"", src, dst);
 279                 else
 280                         XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", src,
 281                                  route->src_gateway, dst, route->dst_gateway);
 282                 char * link_name;
 283                 unsigned int cpt;
 284                 xbt_dynar_t link_route_to_test = xbt_dynar_new(global_routing->size_of_link, NULL);
 285                 xbt_dynar_foreach(route->link_list,cpt,link_name)
 286                 {
 287                         void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
 288                         xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
 289                         xbt_dynar_push(link_route_to_test,&link);
 290                 }
 291                 xbt_assert(!xbt_dynar_compare(
 292                           (void*)TO_FLOYD_LINK(*src_id, *dst_id)->link_list,
 293                           (void*)link_route_to_test,
 294                           (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
 295                           "The route between \"%s\" and \"%s\" already exists", src,dst);
 296         }
 297         else
 298         {
 299                 if(!route->dst_gateway && !route->src_gateway)
 300                   XBT_DEBUG("Load Route from \"%s\" to \"%s\"", src, dst);
 301                 else{
 302                         XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", src,
 303                                  route->src_gateway, dst, route->dst_gateway);
 304                         if(routing_get_network_element_type((const char*)route->dst_gateway) == SURF_NETWORK_ELEMENT_NULL)
 305                                 xbt_die("The dst_gateway '%s' does not exist!",route->dst_gateway);
 306                         if(routing_get_network_element_type((const char*)route->src_gateway) == SURF_NETWORK_ELEMENT_NULL)
 307                                 xbt_die("The src_gateway '%s' does not exist!",route->src_gateway);
 308                 }
 309             TO_FLOYD_LINK(*src_id, *dst_id) =
 310                         generic_new_extended_route(rc->hierarchy, route, 1);
 311             TO_FLOYD_PRED(*src_id, *dst_id) = *src_id;
 312             TO_FLOYD_COST(*src_id, *dst_id) =
 313                         ((TO_FLOYD_LINK(*src_id, *dst_id))->link_list)->used;   /* count of links, old model assume 1 */
 314         }
 315
 316         if( A_surfxml_route_symmetrical == A_surfxml_route_symmetrical_YES
 317                 || A_surfxml_ASroute_symmetrical == A_surfxml_ASroute_symmetrical_YES )
 318         {
 319                 if(TO_FLOYD_LINK(*dst_id, *src_id))
 320                 {
 321                         if(!route->dst_gateway && !route->src_gateway)
 322                           XBT_DEBUG("See Route from \"%s\" to \"%s\"", dst, src);
 323                         else
 324                           XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
 325                                          route->src_gateway, src, route->dst_gateway);
 326                         char * link_name;
 327                         unsigned int i;
 328                         xbt_dynar_t link_route_to_test = xbt_dynar_new(global_routing->size_of_link, NULL);
 329                         for(i=xbt_dynar_length(route->link_list) ;i>0 ;i--)
 330                         {
 331                                 link_name = xbt_dynar_get_as(route->link_list,i-1,void *);
 332                                 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
 333                                 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
 334                                 xbt_dynar_push(link_route_to_test,&link);
 335                         }
 336                         xbt_assert(!xbt_dynar_compare(
 337                                   (void*)TO_FLOYD_LINK(*dst_id, *src_id)->link_list,
 338                               (void*)link_route_to_test,
 339                                   (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
 340                                   "The route between \"%s\" and \"%s\" already exists", src,dst);
 341                 }
 342                 else
 343                 {
 344                         if(route->dst_gateway && route->src_gateway)
 345                         {
 346                           char *gw_src = route->src_gateway;
 347                           char *gw_dst = route->dst_gateway;
 348                           route->src_gateway = gw_dst;
 349                           route->dst_gateway = gw_src;
 350                         }
 351
 352                         if(!route->dst_gateway && !route->src_gateway)
 353                           XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst, src);
 354                         else
 355                           XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
 356                                          route->src_gateway, src, route->dst_gateway);
 357
 358                     TO_FLOYD_LINK(*dst_id, *src_id) =
 359                                 generic_new_extended_route(rc->hierarchy, route, 0);
 360                     TO_FLOYD_PRED(*dst_id, *src_id) = *dst_id;
 361                     TO_FLOYD_COST(*dst_id, *src_id) =
 362                                 ((TO_FLOYD_LINK(*dst_id, *src_id))->link_list)->used;   /* count of links, old model assume 1 */
 363                 }
 364         }
 365 }