2 * IS-IS Rout(e)ing protocol - isis_spf.h
3 * IS-IS Shortest Path First algorithm
5 * Copyright (C) 2001,2002 Sampo Saaristo
6 * Tampere University of Technology
7 * Institute of Communications Engineering
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)
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
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.
24 #ifndef _ZEBRA_ISIS_SPF_H
25 #define _ZEBRA_ISIS_SPF_H
32 VTYPE_NONPSEUDO_TE_IS
,
34 VTYPE_IPREACH_INTERNAL
,
35 VTYPE_IPREACH_EXTERNAL
,
39 VTYPE_IP6REACH_INTERNAL
,
40 VTYPE_IP6REACH_EXTERNAL
41 #endif /* HAVE_IPV6 */
45 * Triple <N, d(N), {Adj(N)}>
53 u_char id
[ISIS_SYS_ID_LEN
+ 1];
58 u_int32_t d_N
; /* d(N) Distance from this IS */
59 u_int16_t depth
; /* The depth in the imaginary tree */
61 struct list
*Adj_N
; /* {Adj(N)} */
66 struct thread
*t_spf
; /* spf threads */
67 time_t lastrun
; /* for scheduling */
68 int pending
; /* already scheduled */
69 struct list
*paths
; /* the SPT */
70 struct list
*tents
; /* TENT */
72 u_int32_t timerun
; /* statistics */
75 void spftree_area_init (struct isis_area
*area
);
76 int isis_spf_schedule (struct isis_area
*area
, int level
);
77 void isis_spf_cmds_init (void);
79 int isis_spf_schedule6 (struct isis_area
*area
, int level
);
81 #endif /* _ZEBRA_ISIS_SPF_H */