Gitiles
Code Review Sign In
gerrit.opencord.org / quagga / d3d7474ba98f01e6d9994ff48c0b3a4331a8ef2a / . / isisd / isis_spf.h
blob: 6bdab2da6b9382f6b2b7759c4bc15862594c0ef3 [file] [log] [blame]
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]1/*
2 * IS-IS Rout(e)ing protocol - isis_spf.h
3 * IS-IS Shortest Path First algorithm
4 *
5 * Copyright (C) 2001,2002 Sampo Saaristo
6 * Tampere University of Technology
7 * Institute of Communications Engineering
8 *
9 * This program is free software; you can redistribute it and/or modify it
10 * under the terms of the GNU General Public Licenseas published by the Free
11 * Software Foundation; either version 2 of the License, or (at your option)
12 * any later version.
13 *
14 * This program is distributed in the hope that it will be useful,but WITHOUT
15 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
17 * more details.
18
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write to the Free Software Foundation, Inc.,
21 * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
22 */
23
24#ifndef _ZEBRA_ISIS_SPF_H
25#define _ZEBRA_ISIS_SPF_H
26
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]27enum vertextype
28{
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]29 VTYPE_PSEUDO_IS = 1,
hasso82a84282005-09-26 18:15:36 +0000[diff] [blame]30 VTYPE_PSEUDO_TE_IS,
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]31 VTYPE_NONPSEUDO_IS,
hasso82a84282005-09-26 18:15:36 +0000[diff] [blame]32 VTYPE_NONPSEUDO_TE_IS,
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]33 VTYPE_ES,
34 VTYPE_IPREACH_INTERNAL,
hasso82a84282005-09-26 18:15:36 +0000[diff] [blame]35 VTYPE_IPREACH_EXTERNAL,
36 VTYPE_IPREACH_TE
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]37#ifdef HAVE_IPV6
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]38 ,
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]39 VTYPE_IP6REACH_INTERNAL,
40 VTYPE_IP6REACH_EXTERNAL
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]41#endif /* HAVE_IPV6 */
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]42};
43
44/*
45 * Triple <N, d(N), {Adj(N)}>
46 */
47struct isis_vertex
48{
49 enum vertextype type;
50
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]51 union
52 {
53 u_char id[ISIS_SYS_ID_LEN + 1];
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]54 struct prefix prefix;
55 } N;
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]56
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]57 struct isis_lsp *lsp;
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]58 u_int32_t d_N; /* d(N) Distance from this IS */
59 u_int16_t depth; /* The depth in the imaginary tree */
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]60
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]61 struct list *Adj_N; /* {Adj(N)} */
62};
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]63
64struct isis_spftree
65{
hasso12a5cae2004-09-19 19:39:26 +0000[diff] [blame]66 struct thread *t_spf; /* spf threads */
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]67 time_t lastrun; /* for scheduling */
68 int pending; /* already scheduled */
69 struct list *paths; /* the SPT */
70 struct list *tents; /* TENT */
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]71
hassof390d2c2004-09-10 20:48:21 +0000[diff] [blame]72 u_int32_t timerun; /* statistics */
jardineb5d44e2003-12-23 08:09:43 +0000[diff] [blame]73};
74
75void spftree_area_init (struct isis_area *area);
76int isis_spf_schedule (struct isis_area *area, int level);
77void isis_spf_cmds_init (void);
78#ifdef HAVE_IPV6
79int isis_spf_schedule6 (struct isis_area *area, int level);
80#endif
81#endif /* _ZEBRA_ISIS_SPF_H */