mirror of
https://git.proxmox.com/git/mirror_frr
synced 2025-11-04 06:38:04 +00:00
81443a283b
In the context of TI-LFA it is necessary to have multiple representations of SPFs for so called P and Q spaces. Hence it makes sense to start with fresh vertex lists, and only delete them when the SPF calculation is not a 'dry run'. Signed-off-by: GalaxyGorilla <sascha@netdef.org>
91 lines
3.1 KiB
C
91 lines
3.1 KiB
C
/*
|
|
* OSPF calculation.
|
|
* Copyright (C) 1999 Kunihiro Ishiguro
|
|
*
|
|
* 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 this program; see the file COPYING; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#ifndef _QUAGGA_OSPF_SPF_H
|
|
#define _QUAGGA_OSPF_SPF_H
|
|
|
|
#include "typesafe.h"
|
|
|
|
/* values for vertex->type */
|
|
#define OSPF_VERTEX_ROUTER 1 /* for a Router-LSA */
|
|
#define OSPF_VERTEX_NETWORK 2 /* for a Network-LSA */
|
|
|
|
/* values for vertex->flags */
|
|
#define OSPF_VERTEX_PROCESSED 0x01
|
|
|
|
/* The "root" is the node running the SPF calculation */
|
|
|
|
PREDECL_SKIPLIST_NONUNIQ(vertex_pqueue)
|
|
/* A router or network in an area */
|
|
struct vertex {
|
|
struct vertex_pqueue_item pqi;
|
|
uint8_t flags;
|
|
uint8_t type; /* copied from LSA header */
|
|
struct in_addr id; /* copied from LSA header */
|
|
struct ospf_lsa *lsa_p;
|
|
struct lsa_header *lsa; /* Router or Network LSA */
|
|
uint32_t distance; /* from root to this vertex */
|
|
struct list *parents; /* list of parents in SPF tree */
|
|
struct list *children; /* list of children in SPF tree*/
|
|
};
|
|
|
|
/* A nexthop taken on the root node to get to this (parent) vertex */
|
|
struct vertex_nexthop {
|
|
struct in_addr router; /* router address to send to */
|
|
int lsa_pos; /* LSA position for resolving the interface */
|
|
};
|
|
|
|
struct vertex_parent {
|
|
struct vertex_nexthop *nexthop; /* nexthop address for this parent */
|
|
struct vertex *parent; /* parent vertex */
|
|
int backlink; /* index back to parent for router-lsa's */
|
|
};
|
|
|
|
/* What triggered the SPF ? */
|
|
typedef enum {
|
|
SPF_FLAG_ROUTER_LSA_INSTALL = 1,
|
|
SPF_FLAG_NETWORK_LSA_INSTALL,
|
|
SPF_FLAG_SUMMARY_LSA_INSTALL,
|
|
SPF_FLAG_ASBR_SUMMARY_LSA_INSTALL,
|
|
SPF_FLAG_MAXAGE,
|
|
SPF_FLAG_ABR_STATUS_CHANGE,
|
|
SPF_FLAG_ASBR_STATUS_CHANGE,
|
|
SPF_FLAG_CONFIG_CHANGE,
|
|
} ospf_spf_reason_t;
|
|
|
|
extern void ospf_spf_calculate_schedule(struct ospf *, ospf_spf_reason_t);
|
|
extern void ospf_spf_calculate(struct ospf_area *area,
|
|
struct ospf_lsa *root_lsa,
|
|
struct route_table *new_table,
|
|
struct route_table *new_rtrs, bool is_dry_run,
|
|
bool is_root_node);
|
|
extern int ospf_spf_calculate_areas(struct ospf *ospf,
|
|
struct route_table *new_table,
|
|
struct route_table *new_rtrs,
|
|
bool is_dry_run, bool is_root_node);
|
|
extern void ospf_rtrs_free(struct route_table *);
|
|
extern void ospf_spf_cleanup(struct vertex *spf, struct list *vertex_list);
|
|
|
|
extern void ospf_spf_print(struct vty *vty, struct vertex *v, int i);
|
|
|
|
/* void ospf_spf_calculate_timer_add (); */
|
|
#endif /* _QUAGGA_OSPF_SPF_H */
|