mirror of
https://git.proxmox.com/git/mirror_frr
synced 2025-08-06 10:54:47 +00:00
52a7c25e63
Now that the IS-IS SPF code is more modular, write some unit tests for it. This commit includes a new test program called "test_isis_spf" which can load any test topology (there are 13 different ones available) and run SPF on any desired node. In the future this same test program and topologies will also be used to test reverse SPF and TI-LFA. The "test_common.c" file contains helper functions used to parse the topology descriptions from "test_topologies.c" into LSP databases that can be used as an input to the SPF code. This commit also introduces the F_ISIS_UNIT_TEST flag which is used to prevent the IS-IS code from scheduling any event when running under the context of an unit test. Signed-off-by: Renato Westphal <renato@opensourcerouting.org>
67 lines
2.5 KiB
C
67 lines
2.5 KiB
C
/*
|
|
* IS-IS Rout(e)ing protocol - isis_spf.h
|
|
* IS-IS Shortest Path First algorithm
|
|
*
|
|
* Copyright (C) 2001,2002 Sampo Saaristo
|
|
* Tampere University of Technology
|
|
* Institute of Communications Engineering
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public Licenseas published by the Free
|
|
* Software Foundation; either version 2 of the License, or (at your option)
|
|
* any later version.
|
|
*
|
|
* This program 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 _ZEBRA_ISIS_SPF_H
|
|
#define _ZEBRA_ISIS_SPF_H
|
|
|
|
struct isis_spftree;
|
|
|
|
struct isis_spf_adj {
|
|
uint8_t id[ISIS_SYS_ID_LEN + 1];
|
|
struct isis_adjacency *adj;
|
|
uint32_t metric;
|
|
struct isis_ext_subtlvs *subtlvs;
|
|
struct {
|
|
uint8_t desig_is_id[ISIS_SYS_ID_LEN + 1];
|
|
struct isis_lsp *lsp_pseudo;
|
|
} lan;
|
|
uint8_t flags;
|
|
#define F_ISIS_SPF_ADJ_BROADCAST 0x01
|
|
#define F_ISIS_SPF_ADJ_OLDMETRIC 0x02
|
|
};
|
|
|
|
struct isis_spftree *isis_spftree_new(struct isis_area *area,
|
|
struct lspdb_head *lspdb,
|
|
const uint8_t *sysid, int level,
|
|
enum spf_tree_id tree_id, uint8_t flags);
|
|
void isis_spf_invalidate_routes(struct isis_spftree *tree);
|
|
void isis_spf_verify_routes(struct isis_area *area,
|
|
struct isis_spftree **trees);
|
|
void isis_spftree_del(struct isis_spftree *spftree);
|
|
void spftree_area_init(struct isis_area *area);
|
|
void spftree_area_del(struct isis_area *area);
|
|
#define isis_spf_schedule(area, level) \
|
|
_isis_spf_schedule((area), (level), __func__, \
|
|
__FILE__, __LINE__)
|
|
int _isis_spf_schedule(struct isis_area *area, int level,
|
|
const char *func, const char *file, int line);
|
|
void isis_print_spftree(struct vty *vty, struct isis_spftree *spftree);
|
|
void isis_print_routes(struct vty *vty, struct isis_spftree *spftree);
|
|
void isis_spf_init(void);
|
|
void isis_spf_print(struct isis_spftree *spftree, struct vty *vty);
|
|
void isis_run_spf(struct isis_spftree *spftree);
|
|
struct isis_spftree *isis_run_hopcount_spf(struct isis_area *area,
|
|
uint8_t *sysid,
|
|
struct isis_spftree *spftree);
|
|
#endif /* _ZEBRA_ISIS_SPF_H */
|