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
|
// SPDX-License-Identifier: GPL-2.0-or-later
/*
* RIPng routes function.
* Copyright (C) 1998 Kunihiro Ishiguro
*/
#include <zebra.h>
#include "prefix.h"
#include "agg_table.h"
#include "memory.h"
#include "if.h"
#include "vty.h"
#include "ripngd/ripngd.h"
#include "ripngd/ripng_route.h"
DEFINE_MTYPE_STATIC(RIPNGD, RIPNG_AGGREGATE, "RIPng aggregate");
static struct ripng_aggregate *ripng_aggregate_new(void)
{
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 agg_node *child, struct ripng_info *rinfo)
{
struct agg_node *np;
struct ripng_aggregate *aggregate;
for (np = child; np; np = agg_node_parent(np))
if ((aggregate = np->aggregate) != NULL) {
aggregate->count++;
rinfo->suppress++;
}
}
/* Aggregate count decrement check. */
void ripng_aggregate_decrement(struct agg_node *child, struct ripng_info *rinfo)
{
struct agg_node *np;
struct ripng_aggregate *aggregate;
for (np = child; np; np = agg_node_parent(np))
if ((aggregate = np->aggregate) != NULL) {
aggregate->count--;
rinfo->suppress--;
}
}
/* Aggregate count decrement check for a list. */
void ripng_aggregate_decrement_list(struct agg_node *child, struct list *list)
{
struct agg_node *np;
struct ripng_aggregate *aggregate;
struct ripng_info *rinfo = NULL;
struct listnode *node = NULL;
for (np = child; np; np = agg_node_parent(np))
if ((aggregate = np->aggregate) != NULL)
aggregate->count -= listcount(list);
for (ALL_LIST_ELEMENTS_RO(list, node, rinfo))
rinfo->suppress--;
}
/* RIPng routes treatment. */
int ripng_aggregate_add(struct ripng *ripng, struct prefix *p)
{
struct agg_node *top;
struct agg_node *rp;
struct ripng_info *rinfo;
struct ripng_aggregate *aggregate;
struct ripng_aggregate *sub;
struct list *list = NULL;
struct listnode *node = NULL;
/* Get top node for aggregation. */
top = agg_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 = agg_lock_node(top); rp; rp = agg_route_next_until(rp, top)) {
/* Suppress normal route. */
if ((list = rp->info) != NULL)
for (ALL_LIST_ELEMENTS_RO(list, node, rinfo)) {
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 ripng *ripng, struct prefix *p)
{
struct agg_node *top;
struct agg_node *rp;
struct ripng_info *rinfo;
struct ripng_aggregate *aggregate;
struct ripng_aggregate *sub;
struct list *list = NULL;
struct listnode *node = NULL;
/* Get top node for aggregation. */
top = agg_node_get(ripng->table, p);
/* Allocate new aggregate. */
aggregate = top->aggregate;
/* Suppress routes match to the aggregate. */
for (rp = agg_lock_node(top); rp; rp = agg_route_next_until(rp, top)) {
/* Suppress normal route. */
if ((list = rp->info) != NULL)
for (ALL_LIST_ELEMENTS_RO(list, node, rinfo)) {
aggregate->count--;
rinfo->suppress--;
}
if (rp != top && (sub = rp->aggregate) != NULL) {
aggregate->count--;
sub->suppress--;
}
}
top->aggregate = NULL;
ripng_aggregate_free(aggregate);
agg_unlock_node(top);
agg_unlock_node(top);
return 0;
}
|
