*: reindent

[mirror_frr.git] / isisd / isis_spf.h

diff --git a/isisd/isis_spf.h b/isisd/isis_spf.h
index 8c72f45c524c0e68fd9c3d98d7a797b89cc70db3..c7a505489f46596fd25a39d3675aa11e8e90d9e6 100644 (file)
--- a/isisd/isis_spf.h
+++ b/isisd/isis_spf.h
@@ -1,19 +1,19 @@
 /*
  * IS-IS Rout(e)ing protocol - isis_spf.h
- *                             IS-IS Shortest Path First algorithm  
+ *                             IS-IS Shortest Path First algorithm
  *
  * Copyright (C) 2001,2002   Sampo Saaristo
- *                           Tampere University of Technology      
+ *                           Tampere University of Technology
  *                           Institute of Communications Engineering
  *
- * This program is free software; you can redistribute it and/or modify it 
- * under the terms of the GNU General Public Licenseas published by the Free 
- * Software Foundation; either version 2 of the License, or (at your option) 
+ * This program is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public Licenseas published by the Free
+ * Software Foundation; either version 2 of the License, or (at your option)
  * any later version.
  *
- * This program is distributed in the hope that it will be useful,but WITHOUT 
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for 
+ * This program is distributed in the hope that it will be useful,but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
  * more details.
  *
  * You should have received a copy of the GNU General Public License along
@@ -24,18 +24,17 @@
 #ifndef _ZEBRA_ISIS_SPF_H
 #define _ZEBRA_ISIS_SPF_H
 
-enum vertextype
-{
-  VTYPE_PSEUDO_IS = 1,
-  VTYPE_PSEUDO_TE_IS,
-  VTYPE_NONPSEUDO_IS,
-  VTYPE_NONPSEUDO_TE_IS,
-  VTYPE_ES,
-  VTYPE_IPREACH_INTERNAL,
-  VTYPE_IPREACH_EXTERNAL,
-  VTYPE_IPREACH_TE,
-  VTYPE_IP6REACH_INTERNAL,
-  VTYPE_IP6REACH_EXTERNAL
+enum vertextype {
+       VTYPE_PSEUDO_IS = 1,
+       VTYPE_PSEUDO_TE_IS,
+       VTYPE_NONPSEUDO_IS,
+       VTYPE_NONPSEUDO_TE_IS,
+       VTYPE_ES,
+       VTYPE_IPREACH_INTERNAL,
+       VTYPE_IPREACH_EXTERNAL,
+       VTYPE_IPREACH_TE,
+       VTYPE_IP6REACH_INTERNAL,
+       VTYPE_IP6REACH_EXTERNAL
 };
 
 #define VTYPE_IS(t) ((t) >= VTYPE_PSEUDO_IS && (t) <= VTYPE_NONPSEUDO_TE_IS)
@@ -43,45 +42,41 @@ enum vertextype
 #define VTYPE_IP(t) ((t) >= VTYPE_IPREACH_INTERNAL && (t) <= VTYPE_IP6REACH_EXTERNAL)
 
 /*
- * Triple <N, d(N), {Adj(N)}> 
+ * Triple <N, d(N), {Adj(N)}>
  */
-struct isis_vertex
-{
-  enum vertextype type;
+struct isis_vertex {
+       enum vertextype type;
 
-  union
-  {
-    u_char id[ISIS_SYS_ID_LEN + 1];
-    struct prefix prefix;
-  } N;
+       union {
+               u_char id[ISIS_SYS_ID_LEN + 1];
+               struct prefix prefix;
+       } N;
 
-  u_int32_t d_N;               /* d(N) Distance from this IS      */
-  u_int16_t depth;             /* The depth in the imaginary tree */
-  struct list *Adj_N;          /* {Adj(N)} next hop or neighbor list */
-  struct list *parents;         /* list of parents for ECMP */
-  struct list *children;        /* list of children used for tree dump */
+       u_int32_t d_N;   /* d(N) Distance from this IS      */
+       u_int16_t depth;       /* The depth in the imaginary tree */
+       struct list *Adj_N;    /* {Adj(N)} next hop or neighbor list */
+       struct list *parents;  /* list of parents for ECMP */
+       struct list *children; /* list of children used for tree dump */
 };
 
-struct isis_spftree
-{
-  struct list *paths;          /* the SPT */
-  struct list *tents;          /* TENT */
-  struct isis_area *area;       /* back pointer to area */
-  unsigned int runcount;        /* number of runs since uptime */
-  time_t last_run_timestamp;    /* last run timestamp for scheduling */
-  time_t last_run_duration;     /* last run duration in msec */
+struct isis_spftree {
+       struct list *paths;     /* the SPT */
+       struct list *tents;     /* TENT */
+       struct isis_area *area;    /* back pointer to area */
+       unsigned int runcount;     /* number of runs since uptime */
+       time_t last_run_timestamp; /* last run timestamp for scheduling */
+       time_t last_run_duration;  /* last run duration in msec */
 
-  uint16_t mtid;
-  int family;
-  int level;
+       uint16_t mtid;
+       int family;
+       int level;
 };
 
-struct isis_spftree * isis_spftree_new (struct isis_area *area);
-void isis_spftree_del (struct isis_spftree *spftree);
-void spftree_area_init (struct isis_area *area);
-void spftree_area_del (struct isis_area *area);
-void spftree_area_adj_del (struct isis_area *area,
-                           struct isis_adjacency *adj);
-int isis_spf_schedule (struct isis_area *area, int level);
-void isis_spf_cmds_init (void);
+struct isis_spftree *isis_spftree_new(struct isis_area *area);
+void isis_spftree_del(struct isis_spftree *spftree);
+void spftree_area_init(struct isis_area *area);
+void spftree_area_del(struct isis_area *area);
+void spftree_area_adj_del(struct isis_area *area, struct isis_adjacency *adj);
+int isis_spf_schedule(struct isis_area *area, int level);
+void isis_spf_cmds_init(void);
 #endif /* _ZEBRA_ISIS_SPF_H */