1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318
|
/* OSPF SPF calculation.
Copyright (C) 1999, 2000 Kunihiro Ishiguro, Toshiaki Takada
This file is part of GNU Zebra.
GNU Zebra is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
GNU Zebra is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Zebra; see the file COPYING. If not, write to the Free
Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA. */
#include <zebra.h>
#include "thread.h"
#include "memory.h"
#include "hash.h"
#include "linklist.h"
#include "prefix.h"
#include "if.h"
#include "table.h"
#include "log.h"
#include "sockunion.h" /* for inet_ntop () */
#include "ospfd/ospfd.h"
#include "ospfd/ospf_interface.h"
#include "ospfd/ospf_ism.h"
#include "ospfd/ospf_asbr.h"
#include "ospfd/ospf_lsa.h"
#include "ospfd/ospf_lsdb.h"
#include "ospfd/ospf_neighbor.h"
#include "ospfd/ospf_nsm.h"
#include "ospfd/ospf_spf.h"
#include "ospfd/ospf_route.h"
#include "ospfd/ospf_ia.h"
#include "ospfd/ospf_ase.h"
#include "ospfd/ospf_abr.h"
#include "ospfd/ospf_dump.h"
#define DEBUG
struct vertex_nexthop *
vertex_nexthop_new (struct vertex *parent)
{
struct vertex_nexthop *new;
new = XCALLOC (MTYPE_OSPF_NEXTHOP, sizeof (struct vertex_nexthop));
new->parent = parent;
return new;
}
void
vertex_nexthop_free (struct vertex_nexthop *nh)
{
XFREE (MTYPE_OSPF_NEXTHOP, nh);
}
struct vertex_nexthop *
vertex_nexthop_dup (struct vertex_nexthop *nh)
{
struct vertex_nexthop *new;
new = vertex_nexthop_new (nh->parent);
new->oi = nh->oi;
new->router = nh->router;
return new;
}
struct vertex *
ospf_vertex_new (struct ospf_lsa *lsa)
{
struct vertex *new;
new = XMALLOC (MTYPE_OSPF_VERTEX, sizeof (struct vertex));
memset (new, 0, sizeof (struct vertex));
new->flags = 0;
new->type = lsa->data->type;
new->id = lsa->data->id;
new->lsa = lsa->data;
new->distance = 0;
new->child = list_new ();
new->nexthop = list_new ();
new->backlink = -1;
return new;
}
void
ospf_vertex_free (struct vertex *v)
{
struct listnode *node;
list_delete (v->child);
if (listcount (v->nexthop) > 0)
for (node = listhead (v->nexthop); node; nextnode (node))
vertex_nexthop_free (node->data);
list_delete (v->nexthop);
XFREE (MTYPE_OSPF_VERTEX, v);
}
void
ospf_vertex_dump(const char *msg, struct vertex *v,
int print_nexthops, int print_children)
{
if ( ! IS_DEBUG_OSPF_EVENT)
return;
zlog_debug("%s %s vertex %s distance %u backlink %d flags %u",
msg,
v->type == OSPF_VERTEX_ROUTER ? "Router" : "Network",
inet_ntoa(v->lsa->id),
v->distance,
v->backlink,
(unsigned int)v->flags);
if (print_nexthops)
{
struct listnode *nnode;
for (nnode = listhead (v->nexthop); nnode; nextnode (nnode))
{
char buf1[BUFSIZ];
char buf2[BUFSIZ];
struct vertex_nexthop *nexthop;
nexthop = getdata (nnode);
if (nexthop)
{
zlog_debug (" nexthop %s interface %s parent %s",
inet_ntop(AF_INET, &nexthop->router, buf1, BUFSIZ),
nexthop->oi ? IF_NAME(nexthop->oi) : "NULL",
nexthop->parent ? inet_ntop(AF_INET,
&nexthop->parent->id,
buf2, BUFSIZ)
: "NULL");
}
}
}
if (print_children)
{
struct listnode *cnode;
for (cnode = listhead (v->child); cnode; nextnode (cnode))
{
struct vertex *cv = getdata (cnode);
if (cv)
ospf_vertex_dump(" child:", cv, 0, 0);
}
}
}
/* Add a vertex to the list of children in each of its parents. */
void
ospf_vertex_add_parent (struct vertex *v)
{
struct vertex_nexthop *nh;
struct listnode *node;
for (node = listhead (v->nexthop); node; nextnode (node))
{
nh = (struct vertex_nexthop *) getdata (node);
/* No need to add two links from the same parent. */
if (listnode_lookup (nh->parent->child, v) == NULL)
listnode_add (nh->parent->child, v);
}
}
void
ospf_spf_init (struct ospf_area *area)
{
struct vertex *v;
/* Create root node. */
v = ospf_vertex_new (area->router_lsa_self);
area->spf = v;
/* Reset ABR and ASBR router counts. */
area->abr_count = 0;
area->asbr_count = 0;
}
/* Check if the vertex represented by lsa is on the SPF tree. */
int
ospf_spf_has_vertex (struct route_table *rv, struct route_table *nv,
struct lsa_header *lsa)
{
struct prefix p;
struct route_node *rn;
p.family = AF_INET;
p.prefixlen = IPV4_MAX_BITLEN;
p.u.prefix4 = lsa->id;
if (lsa->type == OSPF_ROUTER_LSA)
rn = route_node_get (rv, &p);
else
rn = route_node_get (nv, &p);
if (rn->info != NULL)
{
route_unlock_node (rn);
return 1;
}
return 0;
}
/* Find the vertex specified by the given id and LSA type
* in vlist (the candidate list).
*/
struct listnode *
ospf_vertex_lookup (struct list *vlist, struct in_addr id, int type)
{
struct listnode *node;
struct vertex *v;
for (node = listhead (vlist); node; nextnode (node))
{
v = (struct vertex *) getdata (node);
if (IPV4_ADDR_SAME (&id, &v->id) && type == v->type)
return node;
}
return NULL;
}
/* return index of link back to V from W, or -1 if no link found */
int
ospf_lsa_has_link (struct lsa_header *w, struct lsa_header *v)
{
unsigned int i, length;
struct router_lsa *rl;
struct network_lsa *nl;
/* In case of W is Network LSA. */
if (w->type == OSPF_NETWORK_LSA)
{
if (v->type == OSPF_NETWORK_LSA)
return -1;
nl = (struct network_lsa *) w;
length = (ntohs (w->length) - OSPF_LSA_HEADER_SIZE - 4) / 4;
for (i = 0; i < length; i++)
if (IPV4_ADDR_SAME (&nl->routers[i], &v->id))
return i;
return -1;
}
/* In case of W is Router LSA. */
if (w->type == OSPF_ROUTER_LSA)
{
rl = (struct router_lsa *) w;
length = ntohs (w->length);
for (i = 0;
i < ntohs (rl->links) && length >= sizeof (struct router_lsa);
i++, length -= 12)
{
switch (rl->link[i].type)
{
case LSA_LINK_TYPE_POINTOPOINT:
case LSA_LINK_TYPE_VIRTUALLINK:
/* Router LSA ID. */
if (v->type == OSPF_ROUTER_LSA &&
IPV4_ADDR_SAME (&rl->link[i].link_id, &v->id))
{
return i;
}
break;
case LSA_LINK_TYPE_TRANSIT:
/* Network LSA ID. */
if (v->type == OSPF_NETWORK_LSA &&
IPV4_ADDR_SAME (&rl->link[i].link_id, &v->id))
{
return i;
}
break;
case LSA_LINK_TYPE_STUB:
/* Not take into count? */
continue;
default:
break;
}
}
}
return -1;
}
/* Add the nexthop to the list, only if it is unique.
* If it's not unique, free the nexthop entry.
*/
void
ospf_nexthop_add_unique (struct vertex_nexthop *new, struct list *nexthop)
{
struct vertex_nexthop *nh;
struct listnode *node;
int match;
match = 0;
for (node = listhead (nexthop); node; nextnode (node))
{
nh = node->data;
/* Compare the two entries. */
/* XXX
* Comparing the parent preserves the shortest path tree
* structure even when the nexthops are identical.
*/
if (nh->oi == new->oi &&
IPV4_ADDR_SAME (&nh->router, &new->router) &&
nh->parent == new->parent)
{
match = 1;
break;
}
}
if (!match)
listnode_add (nexthop, new);
else
vertex_nexthop_free (new);
}
/* Merge entries in list b into list a. */
void
ospf_nexthop_merge (struct list *a, struct list *b)
{
struct listnode *n;
for (n = listhead (b); n; nextnode (n))
{
ospf_nexthop_add_unique (n->data, a);
}
}
#define ROUTER_LSA_MIN_SIZE 12
#define ROUTER_LSA_TOS_SIZE 4
/* Find the next link after prev_link from v to w. If prev_link is
* NULL, return the first link from v to w. Ignore stub and virtual links;
* these link types will never be returned.
*/
struct router_lsa_link *
ospf_get_next_link (struct vertex *v, struct vertex *w,
struct router_lsa_link *prev_link)
{
u_char *p;
u_char *lim;
struct router_lsa_link *l;
if (prev_link == NULL)
p = ((u_char *) v->lsa) + OSPF_LSA_HEADER_SIZE + 4;
else
{
p = (u_char *) prev_link;
p += (ROUTER_LSA_MIN_SIZE +
(prev_link->m[0].tos_count * ROUTER_LSA_TOS_SIZE));
}
lim = ((u_char *) v->lsa) + ntohs (v->lsa->length);
while (p < lim)
{
l = (struct router_lsa_link *) p;
p += (ROUTER_LSA_MIN_SIZE + (l->m[0].tos_count * ROUTER_LSA_TOS_SIZE));
if (l->m[0].type == LSA_LINK_TYPE_STUB)
continue;
/* Defer NH calculation via VLs until summaries from
transit areas area confidered */
if (l->m[0].type == LSA_LINK_TYPE_VIRTUALLINK)
continue;
if (IPV4_ADDR_SAME (&l->link_id, &w->id))
return l;
}
return NULL;
}
/*
* Consider supplied next-hop for inclusion to the supplied list of
* equal-cost next-hops, adjust list as neccessary.
*
* (Discussed on GNU Zebra list 27 May 2003, [zebra 19184])
*
* Note that below is a bit of a hack, and limits ECMP to paths that go to
* same nexthop. Where as paths via inequal output_cost interfaces could
* still quite easily be ECMP due to remote cost differences.
*
* TODO: It really should be done by way of recording currently valid
* backlinks and determining the appropriate nexthops from the list of
* backlinks, or even simpler, just flushing nexthop list if we find a lower
* cost path to a candidate vertex in SPF, maybe.
*/
void
ospf_spf_consider_nexthop (struct list *nexthops,
struct vertex_nexthop *newhop)
{
struct vertex_nexthop *hop;
struct listnode *ln, *nn;
/* nexthop list should contain only the set of nexthops that have the lowest
* equal cost
*/
if (nexthops->head != NULL)
{
hop = getdata (nexthops->head);
/* weed out hops with higher cost than the newhop */
if (hop->oi->output_cost > newhop->oi->output_cost)
{
/* delete the existing nexthops */
for (ln = nexthops->head; ln; ln = nn)
{
nn = ln->next;
hop = getdata (ln);
listnode_delete (nexthops, hop);
vertex_nexthop_free (hop);
}
}
else if (hop->oi->output_cost < newhop->oi->output_cost)
return;
}
/* new hop is <= existing hops, add it */
listnode_add (nexthops, newhop);
return;
}
/* 16.1.1. Calculate nexthop from root through V (parent) to
* vertex W (destination).
*/
void
ospf_nexthop_calculation (struct ospf_area *area,
struct vertex *v, struct vertex *w)
{
struct listnode *node;
struct vertex_nexthop *nh, *x;
struct ospf_interface *oi = NULL;
struct router_lsa_link *l = NULL;
if (IS_DEBUG_OSPF_EVENT)
{
zlog_debug ("ospf_nexthop_calculation(): Start");
ospf_vertex_dump("V (parent):", v, 1, 1);
ospf_vertex_dump("W (dest) :", w, 1, 1);
}
if (v == area->spf)
{
/* 16.1.1 para 4. In the first case, the parent vertex (V) is the
root (the calculating router itself). This means that the
destination is either a directly connected network or directly
connected router. The outgoing interface in this case is simply
the OSPF interface connecting to the destination network/router.
*/
if (w->type == OSPF_VERTEX_ROUTER)
{
while ((l = ospf_get_next_link (v, w, l)))
{
/* l is a link from v to w
* l2 will be link from w to v
*/
struct router_lsa_link *l2 = NULL;
if (IS_DEBUG_OSPF_EVENT)
{
char buf1[BUFSIZ];
zlog_debug("ospf_nexthop_calculation(): considering link "
"type %d link_id %s link_data %s",
l->m[0].type,
inet_ntop (AF_INET, &l->link_id, buf1, BUFSIZ),
inet_ntop (AF_INET, &l->link_data, buf1, BUFSIZ));
}
if (l->m[0].type == LSA_LINK_TYPE_POINTOPOINT)
{
/* If the destination is a router which connects to
the calculating router via a Point-to-MultiPoint
network, the destination's next hop IP address(es)
can be determined by examining the destination's
router-LSA: each link pointing back to the
calculating router and having a Link Data field
belonging to the Point-to-MultiPoint network
provides an IP address of the next hop router.
At this point l is a link from V to W, and V is the
root ("us"). Find the local interface associated
with l (its address is in l->link_data). If it
is a point-to-multipoint interface, then look through
the links in the opposite direction (W to V). If
any of them have an address that lands within the
subnet declared by the PtMP link, then that link
is a constituent of the PtMP link, and its address is
a nexthop address for V.
*/
oi = ospf_if_is_configured (area->ospf, &l->link_data);
if (oi && oi->type == OSPF_IFTYPE_POINTOMULTIPOINT)
{
struct prefix_ipv4 la;
la.family = AF_INET;
la.prefixlen = oi->address->prefixlen;
/* V links to W on PtMP interface
- find the interface address on W */
while ((l2 = ospf_get_next_link (w, v, l2)))
{
la.prefix = l2->link_data;
if (prefix_cmp ((struct prefix *) &la,
oi->address) == 0)
/* link_data is on our PtMP network */
break;
}
} /* end l is on point-to-multipoint link */
else
{
/* l is a regular point-to-point link.
Look for a link from W to V.
*/
while ((l2 = ospf_get_next_link (w, v, l2)))
{
oi = ospf_if_is_configured (area->ospf,
&(l2->link_data));
if (oi == NULL)
continue;
if (!IPV4_ADDR_SAME (&oi->address->u.prefix4,
&l->link_data))
continue;
break;
}
}
if (oi && l2)
{
/* found all necessary info to build nexthop */
nh = vertex_nexthop_new (v);
nh->oi = oi;
nh->router = l2->link_data;
ospf_spf_consider_nexthop (w->nexthop, nh);
}
else
{
zlog_info("ospf_nexthop_calculation(): "
"could not determine nexthop for link");
}
} /* end point-to-point link from V to W */
} /* end iterate over links in W */
} /* end W is a Router vertex */
else
{
assert(w->type == OSPF_VERTEX_NETWORK);
while ((l = ospf_get_next_link (v, w, l)))
{
oi = ospf_if_is_configured (area->ospf, &(l->link_data));
if (oi)
{
nh = vertex_nexthop_new (v);
nh->oi = oi;
nh->router.s_addr = 0;
ospf_spf_consider_nexthop (w->nexthop, nh);
}
}
}
return;
} /* end V is the root */
/* Check if W's parent is a network connected to root. */
else if (v->type == OSPF_VERTEX_NETWORK)
{
/* See if any of V's parents are the root. */
for (node = listhead (v->nexthop); node; nextnode (node))
{
x = (struct vertex_nexthop *) getdata (node);
if (x->parent == area->spf) /* connects to root? */
{
/* 16.1.1 para 5. ...the parent vertex is a network that
* directly connects the calculating router to the destination
* router. The list of next hops is then determined by
* examining the destination's router-LSA...
*/
assert(w->type == OSPF_VERTEX_ROUTER);
while ((l = ospf_get_next_link (w, v, l)))
{
/* ...For each link in the router-LSA that points back to the
* parent network, the link's Link Data field provides the IP
* address of a next hop router. The outgoing interface to
* use can then be derived from the next hop IP address (or
* it can be inherited from the parent network).
*/
nh = vertex_nexthop_new (v);
nh->oi = x->oi;
nh->router = l->link_data;
ospf_spf_consider_nexthop (w->nexthop, nh);
}
return;
}
}
}
/* 16.1.1 para 4. If there is at least one intervening router in the
* current shortest path between the destination and the root, the
* destination simply inherits the set of next hops from the
* parent.
*/
for (node = listhead (v->nexthop); node; nextnode (node))
{
nh = vertex_nexthop_dup (node->data);
nh->parent = v;
ospf_nexthop_add_unique (nh, w->nexthop);
}
}
/* Add a vertex to the SPF candidate list. */
void
ospf_install_candidate (struct list *candidate, struct vertex *w)
{
struct listnode *node;
struct vertex *cw;
ospf_vertex_dump("ospf_install_candidate(): add to candidate list", w, 1, 1);
if (list_isempty (candidate))
{
listnode_add (candidate, w);
return;
}
/* Install vertex with sorting by distance. */
for (node = listhead (candidate); node; nextnode (node))
{
cw = (struct vertex *) getdata (node);
if (cw->distance > w->distance)
{
list_add_node_prev (candidate, node, w);
break;
}
else if (node->next == NULL)
{
list_add_node_next (candidate, node, w);
break;
}
}
if (IS_DEBUG_OSPF_EVENT)
{
zlog_debug("ospf_install_candidate(): candidate list now contains:");
for (node = listhead (candidate); node; nextnode (node))
{
cw = (struct vertex *) getdata (node);
ospf_vertex_dump(" candidate:", cw, 0, 0);
}
}
}
/* RFC2328 Section 16.1 (2).
* v is on the SPF tree. Examine the links in v's LSA. Update the list
* of candidates with any vertices not already on the list. If a lower-cost
* path is found to a vertex already on the candidate list, store the new cost.
*/
void
ospf_spf_next (struct vertex *v, struct ospf_area *area,
struct list *candidate, struct route_table *rv,
struct route_table *nv)
{
struct ospf_lsa *w_lsa = NULL;
struct vertex *w, *cw;
u_char *p;
u_char *lim;
struct router_lsa_link *l = NULL;
struct in_addr *r;
struct listnode *node;
int type = 0;
/* If this is a router-LSA, and bit V of the router-LSA (see Section
A.4.2:RFC2328) is set, set Area A's TransitCapability to TRUE. */
if (v->type == OSPF_VERTEX_ROUTER)
{
if (IS_ROUTER_LSA_VIRTUAL ((struct router_lsa *) v->lsa))
area->transit = OSPF_TRANSIT_TRUE;
}
p = ((u_char *) v->lsa) + OSPF_LSA_HEADER_SIZE + 4;
lim = ((u_char *) v->lsa) + ntohs (v->lsa->length);
while (p < lim)
{
int link = -1; /* link index for w's back link */
/* In case of V is Router-LSA. */
if (v->lsa->type == OSPF_ROUTER_LSA)
{
l = (struct router_lsa_link *) p;
p += (ROUTER_LSA_MIN_SIZE +
(l->m[0].tos_count * ROUTER_LSA_TOS_SIZE));
/* (a) If this is a link to a stub network, examine the next
link in V's LSA. Links to stub networks will be
considered in the second stage of the shortest path
calculation. */
if ((type = l->m[0].type) == LSA_LINK_TYPE_STUB)
continue;
/* (b) Otherwise, W is a transit vertex (router or transit
network). Look up the vertex W's LSA (router-LSA or
network-LSA) in Area A's link state database. */
switch (type)
{
case LSA_LINK_TYPE_POINTOPOINT:
case LSA_LINK_TYPE_VIRTUALLINK:
if (type == LSA_LINK_TYPE_VIRTUALLINK)
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("looking up LSA through VL: %s",
inet_ntoa (l->link_id));
}
w_lsa = ospf_lsa_lookup (area, OSPF_ROUTER_LSA, l->link_id,
l->link_id);
if (w_lsa)
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("found Router LSA %s", inet_ntoa (l->link_id));
}
break;
case LSA_LINK_TYPE_TRANSIT:
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("Looking up Network LSA, ID: %s",
inet_ntoa (l->link_id));
w_lsa = ospf_lsa_lookup_by_id (area, OSPF_NETWORK_LSA,
l->link_id);
if (w_lsa)
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("found the LSA");
break;
default:
zlog_warn ("Invalid LSA link type %d", type);
continue;
}
}
else
{
/* In case of V is Network-LSA. */
r = (struct in_addr *) p;
p += sizeof (struct in_addr);
/* Lookup the vertex W's LSA. */
w_lsa = ospf_lsa_lookup_by_id (area, OSPF_ROUTER_LSA, *r);
}
/* (b cont.) If the LSA does not exist, or its LS age is equal
to MaxAge, or it does not have a link back to vertex V,
examine the next link in V's LSA.[23] */
if (w_lsa == NULL)
continue;
if (IS_LSA_MAXAGE (w_lsa))
continue;
if ( (link = ospf_lsa_has_link (w_lsa->data, v->lsa)) < 0 )
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("The LSA doesn't have a link back");
continue;
}
/* (c) If vertex W is already on the shortest-path tree, examine
the next link in the LSA. */
if (ospf_spf_has_vertex (rv, nv, w_lsa->data))
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("The LSA is already in SPF");
continue;
}
/* (d) Calculate the link state cost D of the resulting path
from the root to vertex W. D is equal to the sum of the link
state cost of the (already calculated) shortest path to
vertex V and the advertised cost of the link between vertices
V and W. If D is: */
/* prepare vertex W. */
w = ospf_vertex_new (w_lsa);
/* Save W's back link index number, for use by virtual links */
w->backlink = link;
/* calculate link cost D. */
if (v->lsa->type == OSPF_ROUTER_LSA)
w->distance = v->distance + ntohs (l->m[0].metric);
else /* v is not a Router-LSA */
w->distance = v->distance;
/* Is there already vertex W in candidate list? */
node = ospf_vertex_lookup (candidate, w->id, w->type);
if (node == NULL)
{
/* W is a new candidate. Calculate nexthop to W and add W
* to the candidate list.
*/
ospf_nexthop_calculation (area, v, w);
ospf_install_candidate (candidate, w);
}
else
{
/* W is already on the candidate list; call it cw.
* Compare the previously calculated cost (cw->distance)
* with the cost we just determined (w->distance) to see
* if we've found a shorter path.
*/
cw = (struct vertex *) getdata (node);
/* If the previous cost was lower, we didn't find a
* shorter path, so we're done with w.
*/
if (cw->distance < w->distance)
{
ospf_vertex_free (w);
continue;
}
else if (cw->distance == w->distance)
{
/* Found an equal-cost path to W. Calculate nexthop to W. */
ospf_nexthop_calculation (area, v, w);
ospf_nexthop_merge (cw->nexthop, w->nexthop);
list_delete_all_node (w->nexthop);
ospf_vertex_free (w);
}
else
{
/* Found a lower-cost path to W. Calculate nexthop to W. */
ospf_nexthop_calculation (area, v, w);
/* Remove old vertex from candidate list. */
ospf_vertex_free (cw);
listnode_delete (candidate, cw);
/* Install new W to candidate list. */
ospf_install_candidate (candidate, w);
}
} /* end W is already on the candidate list */
} /* end loop over the links in V's LSA */
}
/* Add vertex V to SPF tree. */
void
ospf_spf_register (struct vertex *v, struct route_table *rv,
struct route_table *nv)
{
struct prefix p;
struct route_node *rn;
ospf_vertex_dump("ospf_spf_register(): adding to SPF tree:", v, 1, 1);
p.family = AF_INET;
p.prefixlen = IPV4_MAX_BITLEN;
p.u.prefix4 = v->id;
if (v->type == OSPF_VERTEX_ROUTER)
rn = route_node_get (rv, &p);
else
rn = route_node_get (nv, &p);
rn->info = v;
}
void
ospf_spf_route_free (struct route_table *table)
{
struct route_node *rn;
struct vertex *v;
for (rn = route_top (table); rn; rn = route_next (rn))
{
if ((v = rn->info))
{
ospf_vertex_free (v);
rn->info = NULL;
}
route_unlock_node (rn);
}
route_table_finish (table);
}
void
ospf_spf_dump (struct vertex *v, int i)
{
struct listnode *cnode;
struct listnode *nnode;
struct vertex_nexthop *nexthop;
if (v->type == OSPF_VERTEX_ROUTER)
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("SPF Result: %d [R] %s", i, inet_ntoa (v->lsa->id));
}
else
{
struct network_lsa *lsa = (struct network_lsa *) v->lsa;
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("SPF Result: %d [N] %s/%d", i, inet_ntoa (v->lsa->id),
ip_masklen (lsa->mask));
}
for (nnode = listhead (v->nexthop); nnode; nextnode (nnode))
{
nexthop = getdata (nnode);
if (IS_DEBUG_OSPF_EVENT)
zlog_debug (" nexthop %s", inet_ntoa (nexthop->router));
}
i++;
for (cnode = listhead (v->child); cnode; nextnode (cnode))
{
v = getdata (cnode);
ospf_spf_dump (v, i);
}
}
/* Second stage of SPF calculation. */
void
ospf_spf_process_stubs (struct ospf_area *area, struct vertex *v,
struct route_table *rt)
{
struct listnode *cnode;
struct vertex *child;
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("ospf_process_stub():processing stubs for area %s",
inet_ntoa (area->area_id));
if (v->type == OSPF_VERTEX_ROUTER)
{
u_char *p;
u_char *lim;
struct router_lsa_link *l;
struct router_lsa *rlsa;
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("ospf_process_stubs():processing router LSA, id: %s",
inet_ntoa (v->lsa->id));
rlsa = (struct router_lsa *) v->lsa;
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("ospf_process_stubs(): we have %d links to process",
ntohs (rlsa->links));
p = ((u_char *) v->lsa) + OSPF_LSA_HEADER_SIZE + 4;
lim = ((u_char *) v->lsa) + ntohs (v->lsa->length);
while (p < lim)
{
l = (struct router_lsa_link *) p;
p += (ROUTER_LSA_MIN_SIZE +
(l->m[0].tos_count * ROUTER_LSA_TOS_SIZE));
if (l->m[0].type == LSA_LINK_TYPE_STUB)
ospf_intra_add_stub (rt, l, v, area);
}
}
ospf_vertex_dump("ospf_process_stubs(): after examining links: ", v, 1, 1);
for (cnode = listhead (v->child); cnode; nextnode (cnode))
{
child = getdata (cnode);
if (CHECK_FLAG (child->flags, OSPF_VERTEX_PROCESSED))
continue;
ospf_spf_process_stubs (area, child, rt);
SET_FLAG (child->flags, OSPF_VERTEX_PROCESSED);
}
}
void
ospf_rtrs_free (struct route_table *rtrs)
{
struct route_node *rn;
struct list *or_list;
struct listnode *node;
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("Route: Router Routing Table free");
for (rn = route_top (rtrs); rn; rn = route_next (rn))
if ((or_list = rn->info) != NULL)
{
for (node = listhead (or_list); node; nextnode (node))
ospf_route_free (node->data);
list_delete (or_list);
/* Unlock the node. */
rn->info = NULL;
route_unlock_node (rn);
}
route_table_finish (rtrs);
}
void
ospf_rtrs_print (struct route_table *rtrs)
{
struct route_node *rn;
struct list *or_list;
struct listnode *ln;
struct listnode *pnode;
struct ospf_route *or;
struct ospf_path *path;
char buf1[BUFSIZ];
char buf2[BUFSIZ];
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("ospf_rtrs_print() start");
for (rn = route_top (rtrs); rn; rn = route_next (rn))
if ((or_list = rn->info) != NULL)
for (ln = listhead (or_list); ln; nextnode (ln))
{
or = getdata (ln);
switch (or->path_type)
{
case OSPF_PATH_INTRA_AREA:
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("%s [%d] area: %s",
inet_ntop (AF_INET, &or->id, buf1, BUFSIZ),
or->cost, inet_ntop (AF_INET, &or->u.std.area_id,
buf2, BUFSIZ));
break;
case OSPF_PATH_INTER_AREA:
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("%s IA [%d] area: %s",
inet_ntop (AF_INET, &or->id, buf1, BUFSIZ),
or->cost, inet_ntop (AF_INET, &or->u.std.area_id,
buf2, BUFSIZ));
break;
default:
break;
}
for (pnode = listhead (or->paths); pnode; nextnode (pnode))
{
path = getdata (pnode);
if (path->nexthop.s_addr == 0)
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug (" directly attached to %s\r\n",
IF_NAME (path->oi));
}
else
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug (" via %s, %s\r\n",
inet_ntoa (path->nexthop), IF_NAME (path->oi));
}
}
}
zlog_debug ("ospf_rtrs_print() end");
}
/* Calculating the shortest-path tree for an area. */
void
ospf_spf_calculate (struct ospf_area *area, struct route_table *new_table,
struct route_table *new_rtrs)
{
struct list *candidate;
struct listnode *node;
struct vertex *v;
struct route_table *rv;
struct route_table *nv;
if (IS_DEBUG_OSPF_EVENT)
{
zlog_debug ("ospf_spf_calculate: Start");
zlog_debug ("ospf_spf_calculate: running Dijkstra for area %s",
inet_ntoa (area->area_id));
}
/* Check router-lsa-self. If self-router-lsa is not yet allocated,
return this area's calculation. */
if (!area->router_lsa_self)
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("ospf_spf_calculate: "
"Skip area %s's calculation due to empty router_lsa_self",
inet_ntoa (area->area_id));
return;
}
/* RFC2328 16.1. (1). */
/* Initialize the algorithm's data structures. */
rv = route_table_init ();
nv = route_table_init ();
/* Clear the list of candidate vertices. */
candidate = list_new ();
/* Initialize the shortest-path tree to only the root (which is the
router doing the calculation). */
ospf_spf_init (area);
v = area->spf;
ospf_spf_register (v, rv, nv);
/* Set Area A's TransitCapability to FALSE. */
area->transit = OSPF_TRANSIT_FALSE;
area->shortcut_capability = 1;
for (;;)
{
/* RFC2328 16.1. (2). */
ospf_spf_next (v, area, candidate, rv, nv);
/* RFC2328 16.1. (3). */
/* If at this step the candidate list is empty, the shortest-
path tree (of transit vertices) has been completely built and
this stage of the procedure terminates. */
if (listcount (candidate) == 0)
break;
/* Otherwise, choose the vertex belonging to the candidate list
that is closest to the root, and add it to the shortest-path
tree (removing it from the candidate list in the
process). */
node = listhead (candidate);
v = getdata (node);
ospf_vertex_add_parent (v);
/* Remove from the candidate list. */
listnode_delete (candidate, v);
/* Add to SPF tree. */
ospf_spf_register (v, rv, nv);
/* Note that when there is a choice of vertices closest to the
root, network vertices must be chosen before router vertices
in order to necessarily find all equal-cost paths. */
/* We don't do this at this moment, we should add the treatment
above codes. -- kunihiro. */
/* RFC2328 16.1. (4). */
if (v->type == OSPF_VERTEX_ROUTER)
ospf_intra_add_router (new_rtrs, v, area);
else
ospf_intra_add_transit (new_table, v, area);
/* RFC2328 16.1. (5). */
/* Iterate the algorithm by returning to Step 2. */
} /* end loop until no more candidate vertices */
if (IS_DEBUG_OSPF_EVENT)
{
ospf_spf_dump (area->spf, 0);
ospf_route_table_dump (new_table);
}
/* Second stage of SPF calculation procedure's */
ospf_spf_process_stubs (area, area->spf, new_table);
/* Free all vertices which allocated for SPF calculation */
ospf_spf_route_free (rv);
ospf_spf_route_free (nv);
/* Free candidate list */
list_free (candidate);
/* Increment SPF Calculation Counter. */
area->spf_calculation++;
area->ospf->ts_spf = time (NULL);
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("ospf_spf_calculate: Stop");
}
/* Timer for SPF calculation. */
int
ospf_spf_calculate_timer (struct thread *thread)
{
struct ospf *ospf = THREAD_ARG (thread);
struct route_table *new_table, *new_rtrs;
struct listnode *node;
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("SPF: Timer (SPF calculation expire)");
ospf->t_spf_calc = NULL;
/* Allocate new table tree. */
new_table = route_table_init ();
new_rtrs = route_table_init ();
ospf_vl_unapprove (ospf);
/* Calculate SPF for each area. */
for (node = listhead (ospf->areas); node; node = nextnode (node))
ospf_spf_calculate (node->data, new_table, new_rtrs);
ospf_vl_shut_unapproved (ospf);
ospf_ia_routing (ospf, new_table, new_rtrs);
ospf_prune_unreachable_networks (new_table);
ospf_prune_unreachable_routers (new_rtrs);
/* AS-external-LSA calculation should not be performed here. */
/* If new Router Route is installed,
then schedule re-calculate External routes. */
if (1)
ospf_ase_calculate_schedule (ospf);
ospf_ase_calculate_timer_add (ospf);
/* Update routing table. */
ospf_route_install (ospf, new_table);
/* Update ABR/ASBR routing table */
if (ospf->old_rtrs)
{
/* old_rtrs's node holds linked list of ospf_route. --kunihiro. */
/* ospf_route_delete (ospf->old_rtrs); */
ospf_rtrs_free (ospf->old_rtrs);
}
ospf->old_rtrs = ospf->new_rtrs;
ospf->new_rtrs = new_rtrs;
if (IS_OSPF_ABR (ospf))
ospf_abr_task (ospf);
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("SPF: calculation complete");
return 0;
}
/* Add schedule for SPF calculation. To avoid frequenst SPF calc, we
set timer for SPF calc. */
void
ospf_spf_calculate_schedule (struct ospf *ospf)
{
time_t ht, delay;
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("SPF: calculation timer scheduled");
/* OSPF instance does not exist. */
if (ospf == NULL)
return;
/* SPF calculation timer is already scheduled. */
if (ospf->t_spf_calc)
{
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("SPF: calculation timer is already scheduled: %p",
ospf->t_spf_calc);
return;
}
ht = time (NULL) - ospf->ts_spf;
/* Get SPF calculation delay time. */
if (ht < ospf->spf_holdtime)
{
if (ospf->spf_holdtime - ht < ospf->spf_delay)
delay = ospf->spf_delay;
else
delay = ospf->spf_holdtime - ht;
}
else
delay = ospf->spf_delay;
if (IS_DEBUG_OSPF_EVENT)
zlog_debug ("SPF: calculation timer delay = %ld", (long)delay);
ospf->t_spf_calc =
thread_add_timer (master, ospf_spf_calculate_timer, ospf, delay);
}
|