1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/*
* RIPng routes function.
* Copyright (C) 1998 Kunihiro Ishiguro
*
* This file is part of GNU Zebra.
*
* GNU Zebra is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2, or (at your option) any
* later version.
*
* GNU Zebra 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 with GNU Zebra; see the file COPYING. If not, write to the Free
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*/
#include <zebra.h>
#include "prefix.h"
#include "table.h"
#include "memory.h"
#include "if.h"
#include "vty.h"
#include "ripngd/ripngd.h"
#include "ripngd/ripng_route.h"
struct ripng_aggregate *
ripng_aggregate_new ()
{
struct ripng_aggregate *new;
new = XCALLOC (MTYPE_RIPNG_AGGREGATE, sizeof (struct ripng_aggregate));
return new;
}
void
ripng_aggregate_free (struct ripng_aggregate *aggregate)
{
XFREE (MTYPE_RIPNG_AGGREGATE, aggregate);
}
/* Aggregate count increment check. */
void
ripng_aggregate_increment (struct route_node *child, struct ripng_info *rinfo)
{
struct route_node *np;
struct ripng_aggregate *aggregate;
for (np = child; np; np = np->parent)
if ((aggregate = np->aggregate) != NULL)
{
aggregate->count++;
rinfo->suppress++;
}
}
/* Aggregate count decrement check. */
void
ripng_aggregate_decrement (struct route_node *child, struct ripng_info *rinfo)
{
struct route_node *np;
struct ripng_aggregate *aggregate;
for (np = child; np; np = np->parent)
if ((aggregate = np->aggregate) != NULL)
{
aggregate->count--;
rinfo->suppress--;
}
}
/* RIPng routes treatment. */
int
ripng_aggregate_add (struct prefix *p)
{
struct route_node *top;
struct route_node *rp;
struct ripng_info *rinfo;
struct ripng_aggregate *aggregate;
struct ripng_aggregate *sub;
/* Get top node for aggregation. */
top = route_node_get (ripng->table, p);
/* Allocate new aggregate. */
aggregate = ripng_aggregate_new ();
aggregate->metric = 1;
top->aggregate = aggregate;
/* Suppress routes match to the aggregate. */
for (rp = route_lock_node (top); rp; rp = route_next_until (rp, top))
{
/* Suppress normal route. */
if ((rinfo = rp->info) != NULL)
{
aggregate->count++;
rinfo->suppress++;
}
/* Suppress aggregate route. This may not need. */
if (rp != top && (sub = rp->aggregate) != NULL)
{
aggregate->count++;
sub->suppress++;
}
}
return 0;
}
/* Delete RIPng static route. */
int
ripng_aggregate_delete (struct prefix *p)
{
struct route_node *top;
struct route_node *rp;
struct ripng_info *rinfo;
struct ripng_aggregate *aggregate;
struct ripng_aggregate *sub;
/* Get top node for aggregation. */
top = route_node_get (ripng->table, p);
/* Allocate new aggregate. */
aggregate = top->aggregate;
/* Suppress routes match to the aggregate. */
for (rp = route_lock_node (top); rp; rp = route_next_until (rp, top))
{
/* Suppress normal route. */
if ((rinfo = rp->info) != NULL)
{
aggregate->count--;
rinfo->suppress--;
}
if (rp != top && (sub = rp->aggregate) != NULL)
{
aggregate->count--;
sub->suppress--;
}
}
top->aggregate = NULL;
ripng_aggregate_free (aggregate);
route_unlock_node (top);
route_unlock_node (top);
return 0;
}
|
