isisd/isis_spf.h

   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; see the file COPYING; if not, write to the Free Software
  21  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 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_PSEUDO_TE_IS,
  30         VTYPE_NONPSEUDO_IS,
  31         VTYPE_NONPSEUDO_TE_IS,
  32         VTYPE_ES,
  33         VTYPE_IPREACH_INTERNAL,
  34         VTYPE_IPREACH_EXTERNAL,
  35         VTYPE_IPREACH_TE,
  36         VTYPE_IP6REACH_INTERNAL,
  37         VTYPE_IP6REACH_EXTERNAL
  38 };
  39
  40 #define VTYPE_IS(t) ((t) >= VTYPE_PSEUDO_IS && (t) <= VTYPE_NONPSEUDO_TE_IS)
  41 #define VTYPE_ES(t) ((t) == VTYPE_ES)
  42 #define VTYPE_IP(t) ((t) >= VTYPE_IPREACH_INTERNAL && (t) <= VTYPE_IP6REACH_EXTERNAL)
  43
  44 /*
  45  * Triple <N, d(N), {Adj(N)}>
  46  */
  47 struct isis_vertex {
  48         enum vertextype type;
  49
  50         union {
  51                 u_char id[ISIS_SYS_ID_LEN + 1];
  52                 struct prefix prefix;
  53         } N;
  54
  55         u_int32_t d_N;   /* d(N) Distance from this IS      */
  56         u_int16_t depth;       /* The depth in the imaginary tree */
  57         struct list *Adj_N;    /* {Adj(N)} next hop or neighbor list */
  58         struct list *parents;  /* list of parents for ECMP */
  59         struct list *children; /* list of children used for tree dump */
  60 };
  61
  62 struct isis_spftree {
  63         struct list *paths;     /* the SPT */
  64         struct list *tents;     /* TENT */
  65         struct isis_area *area;    /* back pointer to area */
  66         unsigned int runcount;     /* number of runs since uptime */
  67         time_t last_run_timestamp; /* last run timestamp for scheduling */
  68         time_t last_run_duration;  /* last run duration in msec */
  69
  70         uint16_t mtid;
  71         int family;
  72         int level;
  73 };
  74
  75 struct isis_spftree *isis_spftree_new(struct isis_area *area);
  76 void isis_spftree_del(struct isis_spftree *spftree);
  77 void spftree_area_init(struct isis_area *area);
  78 void spftree_area_del(struct isis_area *area);
  79 void spftree_area_adj_del(struct isis_area *area, struct isis_adjacency *adj);
  80 int isis_spf_schedule(struct isis_area *area, int level);
  81 void isis_spf_cmds_init(void);
  82 #endif /* _ZEBRA_ISIS_SPF_H */