projects / mirror_frr.git / blame
| Commit | Line | Data |
|---|---|---|
| eb5d44eb | 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 | ||
| f390d2c7 | 27 | enum vertextype |
| 28 | { | |
| eb5d44eb | 29 | VTYPE_PSEUDO_IS = 1, |
| 82a8428c | 30 | VTYPE_PSEUDO_TE_IS, |
| eb5d44eb | 31 | VTYPE_NONPSEUDO_IS, |
| 82a8428c | 32 | VTYPE_NONPSEUDO_TE_IS, |
| eb5d44eb | 33 | VTYPE_ES, |
| 34 | VTYPE_IPREACH_INTERNAL, | |
| 82a8428c | 35 | VTYPE_IPREACH_EXTERNAL, |
| 36 | VTYPE_IPREACH_TE | |
| eb5d44eb | 37 | #ifdef HAVE_IPV6 |
| f390d2c7 | 38 | , |
| eb5d44eb | 39 | VTYPE_IP6REACH_INTERNAL, |
| 40 | VTYPE_IP6REACH_EXTERNAL | |
| f390d2c7 | 41 | #endif /* HAVE_IPV6 */ |
| eb5d44eb | 42 | }; |
| 43 | ||
| 44 | /* | |
| 45 | * Triple <N, d(N), {Adj(N)}> | |
| 46 | */ | |
| 47 | struct isis_vertex | |
| 48 | { | |
| 49 | enum vertextype type; | |
| 50 | ||
| f390d2c7 | 51 | union |
| 52 | { | |
| 53 | u_char id[ISIS_SYS_ID_LEN + 1]; | |
| eb5d44eb | 54 | struct prefix prefix; |
| 55 | } N; | |
| eb5d44eb | 56 | |
| f390d2c7 | 57 | u_int32_t d_N; /* d(N) Distance from this IS */ |
| 58 | u_int16_t depth; /* The depth in the imaginary tree */ | |
| 3f045a08 JB |
59 | struct list *Adj_N; /* {Adj(N)} next hop or neighbor list */ |
| 60 | struct list *parents; /* list of parents for ECMP */ | |
| 61 | struct list *children; /* list of children used for tree dump */ | |
| f390d2c7 | 62 | }; |
| eb5d44eb | 63 | |
| 64 | struct isis_spftree | |
| 65 | { | |
| 12a5cae7 | 66 | struct thread *t_spf; /* spf threads */ |
| f390d2c7 | 67 | struct list *paths; /* the SPT */ |
| 68 | struct list *tents; /* TENT */ | |
| 3f045a08 JB |
69 | struct isis_area *area; /* back pointer to area */ |
| 70 | int pending; /* already scheduled */ | |
| 3f045a08 | 71 | unsigned int runcount; /* number of runs since uptime */ |
| e38e0df0 SV |
72 | time_t last_run_timestamp; /* last run timestamp for scheduling */ |
| 73 | time_t last_run_duration; /* last run duration in msec */ | |
| eb5d44eb | 74 | }; |
| 75 | ||
| 3f045a08 JB |
76 | struct isis_spftree * isis_spftree_new (struct isis_area *area); |
| 77 | void isis_spftree_del (struct isis_spftree *spftree); | |
| 78 | void isis_spftree_adj_del (struct isis_spftree *spftree, | |
| 79 | struct isis_adjacency *adj); | |
| eb5d44eb | 80 | void spftree_area_init (struct isis_area *area); |
| 3f045a08 JB |
81 | void spftree_area_del (struct isis_area *area); |
| 82 | void spftree_area_adj_del (struct isis_area *area, | |
| 83 | struct isis_adjacency *adj); | |
| eb5d44eb | 84 | int isis_spf_schedule (struct isis_area *area, int level); |
| 85 | void isis_spf_cmds_init (void); | |
| 86 | #ifdef HAVE_IPV6 | |
| 87 | int isis_spf_schedule6 (struct isis_area *area, int level); | |
| 88 | #endif | |
| 89 | #endif /* _ZEBRA_ISIS_SPF_H */ |