| jardin | eb5d44e | 2003-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 | |
| 27 | enum vertextype { |
| 28 | VTYPE_PSEUDO_IS = 1, |
| 29 | VTYPE_NONPSEUDO_IS, |
| 30 | VTYPE_ES, |
| 31 | VTYPE_IPREACH_INTERNAL, |
| 32 | VTYPE_IPREACH_EXTERNAL |
| 33 | #ifdef HAVE_IPV6 |
| 34 | , |
| 35 | VTYPE_IP6REACH_INTERNAL, |
| 36 | VTYPE_IP6REACH_EXTERNAL |
| 37 | #endif /* HAVE_IPV6 */ |
| 38 | }; |
| 39 | |
| 40 | /* |
| 41 | * Triple <N, d(N), {Adj(N)}> |
| 42 | */ |
| 43 | struct isis_vertex |
| 44 | { |
| 45 | enum vertextype type; |
| 46 | |
| 47 | union { |
| 48 | u_char id [ISIS_SYS_ID_LEN + 1]; |
| 49 | struct prefix prefix; |
| 50 | } N; |
| 51 | |
| 52 | struct isis_lsp *lsp; |
| 53 | u_int32_t d_N; /* d(N) Distance from this IS */ |
| 54 | u_int16_t depth; /* The depth in the imaginary tree */ |
| 55 | |
| 56 | struct list *Adj_N; /* {Adj(N)} */ |
| 57 | }; |
| 58 | |
| 59 | |
| 60 | struct isis_spftree |
| 61 | { |
| 62 | struct thread *t_spf_periodic; /* periodic spf threads */ |
| 63 | time_t lastrun; /* for scheduling */ |
| 64 | int pending; /* already scheduled */ |
| 65 | struct list *paths; /* the SPT */ |
| 66 | struct list *tents; /* TENT */ |
| 67 | |
| 68 | u_int32_t timerun; /* statistics */ |
| 69 | }; |
| 70 | |
| 71 | void spftree_area_init (struct isis_area *area); |
| 72 | int isis_spf_schedule (struct isis_area *area, int level); |
| 73 | void isis_spf_cmds_init (void); |
| 74 | #ifdef HAVE_IPV6 |
| 75 | int isis_spf_schedule6 (struct isis_area *area, int level); |
| 76 | #endif |
| 77 | #endif /* _ZEBRA_ISIS_SPF_H */ |
| 78 | |
| 79 | |
| 80 | |
| 81 | |
| 82 | |
| 83 | |
| 84 | |
| 85 | |