2 * Copyright (c) 2008, 2009, 2010 Nicira Networks.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
40 struct lan *ports[STP_MAX_PORTS];
44 struct bpdu rxq[RXQ_SIZE];
45 int rxq_head, rxq_tail;
49 struct bridge *bridge;
57 struct lan_conn conns[16];
62 struct bridge *bridges[16];
68 static const char *file_name;
69 static int line_number;
70 static char line[128];
71 static char *pos, *token;
72 static int n_warnings;
74 static struct test_case *
77 struct test_case *tc = xmalloc(sizeof *tc);
84 send_bpdu(struct ofpbuf *pkt, int port_no, void *b_)
86 struct bridge *b = b_;
89 assert(port_no < b->n_ports);
90 lan = b->ports[port_no];
92 const void *data = pkt->l3;
93 size_t size = (char *) ofpbuf_tail(pkt) - (char *) data;
96 for (i = 0; i < lan->n_conns; i++) {
97 struct lan_conn *conn = &lan->conns[i];
98 if (conn->bridge != b || conn->port_no != port_no) {
99 struct bridge *dst = conn->bridge;
100 struct bpdu *bpdu = &dst->rxq[dst->rxq_head++ % RXQ_SIZE];
101 assert(dst->rxq_head - dst->rxq_tail <= RXQ_SIZE);
102 bpdu->data = xmemdup(data, size);
104 bpdu->port_no = conn->port_no;
111 static struct bridge *
112 new_bridge(struct test_case *tc, int id)
114 struct bridge *b = xmalloc(sizeof *b);
118 snprintf(name, sizeof name, "stp%x", id);
119 b->stp = stp_create(name, id, send_bpdu, b);
120 assert(tc->n_bridges < ARRAY_SIZE(tc->bridges));
122 b->rxq_head = b->rxq_tail = 0;
123 tc->bridges[tc->n_bridges++] = b;
128 new_lan(struct test_case *tc, const char *name)
130 struct lan *lan = xmalloc(sizeof *lan);
132 lan->name = xstrdup(name);
134 assert(tc->n_lans < ARRAY_SIZE(tc->lans));
135 tc->lans[tc->n_lans++] = lan;
140 reconnect_port(struct bridge *b, int port_no, struct lan *new_lan)
145 assert(port_no < b->n_ports);
146 old_lan = b->ports[port_no];
147 if (old_lan == new_lan) {
151 /* Disconnect from old_lan. */
153 for (j = 0; j < old_lan->n_conns; j++) {
154 struct lan_conn *c = &old_lan->conns[j];
155 if (c->bridge == b && c->port_no == port_no) {
156 memmove(c, c + 1, sizeof *c * (old_lan->n_conns - j - 1));
163 /* Connect to new_lan. */
164 b->ports[port_no] = new_lan;
166 int conn_no = new_lan->n_conns++;
167 assert(conn_no < ARRAY_SIZE(new_lan->conns));
168 new_lan->conns[conn_no].bridge = b;
169 new_lan->conns[conn_no].port_no = port_no;
174 new_port(struct bridge *b, struct lan *lan, int path_cost)
176 int port_no = b->n_ports++;
177 struct stp_port *p = stp_get_port(b->stp, port_no);
178 assert(port_no < ARRAY_SIZE(b->ports));
179 b->ports[port_no] = NULL;
180 stp_port_set_path_cost(p, path_cost);
182 reconnect_port(b, port_no, lan);
186 dump(struct test_case *tc)
190 for (i = 0; i < tc->n_bridges; i++) {
191 struct bridge *b = tc->bridges[i];
192 struct stp *stp = b->stp;
195 printf("%s:", stp_get_name(stp));
196 if (stp_is_root_bridge(stp)) {
200 for (j = 0; j < b->n_ports; j++) {
201 struct stp_port *p = stp_get_port(stp, j);
202 enum stp_state state = stp_port_get_state(p);
204 printf("\tport %d", j);
206 printf(" (lan %s)", b->ports[j]->name);
208 printf(" (disconnected)");
210 printf(": %s", stp_state_name(state));
211 if (p == stp_get_root_port(stp)) {
212 printf(" (root port, root_path_cost=%u)", stp_get_root_path_cost(stp));
219 static void dump_lan_tree(struct test_case *, struct lan *, int level);
222 dump_bridge_tree(struct test_case *tc, struct bridge *b, int level)
230 for (i = 0; i < level; i++) {
233 printf("%s\n", stp_get_name(b->stp));
234 for (i = 0; i < b->n_ports; i++) {
235 struct lan *lan = b->ports[i];
236 struct stp_port *p = stp_get_port(b->stp, i);
237 if (stp_port_get_state(p) == STP_FORWARDING && lan) {
238 dump_lan_tree(tc, lan, level + 1);
244 dump_lan_tree(struct test_case *tc, struct lan *lan, int level)
252 for (i = 0; i < level; i++) {
255 printf("%s\n", lan->name);
256 for (i = 0; i < lan->n_conns; i++) {
257 struct bridge *b = lan->conns[i].bridge;
258 dump_bridge_tree(tc, b, level + 1);
263 tree(struct test_case *tc)
267 for (i = 0; i < tc->n_bridges; i++) {
268 struct bridge *b = tc->bridges[i];
271 for (i = 0; i < tc->n_lans; i++) {
272 struct lan *lan = tc->lans[i];
273 lan->reached = false;
275 for (i = 0; i < tc->n_bridges; i++) {
276 struct bridge *b = tc->bridges[i];
277 struct stp *stp = b->stp;
278 if (stp_is_root_bridge(stp)) {
279 dump_bridge_tree(tc, b, 0);
285 simulate(struct test_case *tc, int granularity)
289 for (time = 0; time < 1000 * 180; time += granularity) {
293 for (i = 0; i < tc->n_bridges; i++) {
294 stp_tick(tc->bridges[i]->stp, granularity);
296 for (round_trips = 0; round_trips < granularity; round_trips++) {
298 for (i = 0; i < tc->n_bridges; i++) {
299 struct bridge *b = tc->bridges[i];
300 for (; b->rxq_tail != b->rxq_head; b->rxq_tail++) {
301 struct bpdu *bpdu = &b->rxq[b->rxq_tail % RXQ_SIZE];
302 stp_received_bpdu(stp_get_port(b->stp, bpdu->port_no),
303 bpdu->data, bpdu->size);
316 err(const char *message, ...)
321 err(const char *message, ...)
325 fprintf(stderr, "%s:%d:%td: ", file_name, line_number, pos - line);
326 va_start(args, message);
327 vfprintf(stderr, message, args);
335 warn(const char *message, ...)
339 warn(const char *message, ...)
343 fprintf(stderr, "%s:%d: ", file_name, line_number);
344 va_start(args, message);
345 vfprintf(stderr, message, args);
357 while (isspace((unsigned char) *pos)) {
367 if (isalpha((unsigned char) *pos)) {
368 while (isalpha((unsigned char) *++pos)) {
371 } else if (isdigit((unsigned char) *pos)) {
372 if (*pos == '0' && (pos[1] == 'x' || pos[1] == 'X')) {
374 while (isxdigit((unsigned char) *pos)) {
378 while (isdigit((unsigned char) *++pos)) {
387 token = xmemdup0(start, pos - start);
394 char *save_pos = pos;
395 if (token && isdigit((unsigned char) *token)) {
396 *intp = strtol(token, NULL, 0);
406 match(const char *want)
408 if (token && !strcmp(want, token)) {
421 err("expected integer");
427 must_match(const char *want)
430 err("expected \"%s\"", want);
435 main(int argc, char *argv[])
437 struct test_case *tc;
442 ovs_fatal(0, "usage: test-stp INPUT.STP\n");
446 input_file = fopen(file_name, "r");
448 ovs_fatal(errno, "error opening \"%s\"", file_name);
451 tc = new_test_case();
452 for (i = 0; i < 26; i++) {
459 for (line_number = 1; fgets(line, sizeof line, input_file);
462 char *newline, *hash;
464 newline = strchr(line, '\n');
468 hash = strchr(line, '#');
477 if (match("bridge")) {
478 struct bridge *bridge;
479 int bridge_no, port_no;
481 bridge_no = must_get_int();
482 if (bridge_no < tc->n_bridges) {
483 bridge = tc->bridges[bridge_no];
484 } else if (bridge_no == tc->n_bridges) {
485 bridge = new_bridge(tc, must_get_int());
487 err("bridges must be numbered consecutively from 0");
490 stp_set_bridge_priority(bridge->stp, must_get_int());
494 for (port_no = 0; port_no < STP_MAX_PORTS; port_no++) {
495 struct stp_port *p = stp_get_port(bridge->stp, port_no);
496 if (!token || match("X")) {
498 } else if (match("_")) {
504 if (!strcmp(token, "0")) {
506 } else if (strlen(token) == 1
507 && islower((unsigned char)*token)) {
508 lan = tc->lans[*token - 'a'];
510 err("%s is not a valid LAN name "
511 "(0 or a lowercase letter)", token);
515 path_cost = match(":") ? must_get_int() : 10;
516 if (port_no < bridge->n_ports) {
517 stp_port_set_path_cost(p, path_cost);
519 reconnect_port(bridge, port_no, lan);
520 } else if (port_no == bridge->n_ports) {
521 new_port(bridge, lan, path_cost);
523 err("ports must be numbered consecutively");
526 stp_port_set_priority(p, must_get_int());
531 } else if (match("run")) {
532 simulate(tc, must_get_int());
533 } else if (match("dump")) {
535 } else if (match("tree")) {
537 } else if (match("check")) {
540 int bridge_no, port_no;
542 bridge_no = must_get_int();
543 if (bridge_no >= tc->n_bridges) {
544 err("no bridge numbered %d", bridge_no);
546 b = tc->bridges[bridge_no];
551 if (match("rootid")) {
554 rootid = must_get_int();
556 rootid |= (uint64_t) must_get_int() << 48;
558 rootid |= UINT64_C(0x8000) << 48;
560 if (stp_get_designated_root(stp) != rootid) {
561 warn("%s: root %"PRIx64", not %"PRIx64,
562 stp_get_name(stp), stp_get_designated_root(stp),
568 if (stp_get_root_path_cost(stp)) {
569 warn("%s: root path cost of root is %u but should be 0",
570 stp_get_name(stp), stp_get_root_path_cost(stp));
572 if (!stp_is_root_bridge(stp)) {
573 warn("%s: root is %"PRIx64", not %"PRIx64,
575 stp_get_designated_root(stp), stp_get_bridge_id(stp));
577 for (port_no = 0; port_no < b->n_ports; port_no++) {
578 struct stp_port *p = stp_get_port(stp, port_no);
579 enum stp_state state = stp_port_get_state(p);
580 if (!(state & (STP_DISABLED | STP_FORWARDING))) {
581 warn("%s: root port %d in state %s",
582 stp_get_name(b->stp), port_no,
583 stp_state_name(state));
587 for (port_no = 0; port_no < STP_MAX_PORTS; port_no++) {
588 struct stp_port *p = stp_get_port(stp, port_no);
589 enum stp_state state;
590 if (token == NULL || match("D")) {
591 state = STP_DISABLED;
592 } else if (match("B")) {
593 state = STP_BLOCKING;
594 } else if (match("Li")) {
595 state = STP_LISTENING;
596 } else if (match("Le")) {
597 state = STP_LEARNING;
598 } else if (match("F")) {
599 state = STP_FORWARDING;
600 } else if (match("_")) {
603 err("unknown port state %s", token);
605 if (stp_port_get_state(p) != state) {
606 warn("%s port %d: state is %s but should be %s",
607 stp_get_name(stp), port_no,
608 stp_state_name(stp_port_get_state(p)),
609 stp_state_name(state));
611 if (state == STP_FORWARDING) {
612 struct stp_port *root_port = stp_get_root_port(stp);
614 int root_path_cost = must_get_int();
615 if (p != root_port) {
616 warn("%s: port %d is not the root port",
617 stp_get_name(stp), port_no);
619 warn("%s: (there is no root port)",
622 warn("%s: (port %d is the root port)",
624 stp_port_no(root_port));
626 } else if (root_path_cost
627 != stp_get_root_path_cost(stp)) {
628 warn("%s: root path cost is %u, should be %d",
630 stp_get_root_path_cost(stp),
633 } else if (p == root_port) {
634 warn("%s: port %d is the root port but "
635 "not expected to be",
636 stp_get_name(stp), port_no);
646 err("trailing garbage on line");
651 for (i = 0; i < tc->n_lans; i++) {
652 struct lan *lan = tc->lans[i];
653 free((char *) lan->name);
656 for (i = 0; i < tc->n_bridges; i++) {
657 struct bridge *bridge = tc->bridges[i];
658 stp_destroy(bridge->stp);