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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/*
* Copyright (c) 2016 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <vnet/fib/fib_node.h>
#include <vnet/fib/fib_node_list.h>
/*
* The per-type vector of virtual function tables
*/
static fib_node_vft_t *fn_vfts;
/**
* The last registered new type
*/
static fib_node_type_t last_new_type = FIB_NODE_TYPE_LAST;
/*
* the node type names
*/
static const char *fn_type_names[] = FIB_NODE_TYPES;
const char*
fib_node_type_get_name (fib_node_type_t type)
{
if (type < FIB_NODE_TYPE_LAST)
return (fn_type_names[type]);
else
{
if (NULL != fn_vfts[type].fnv_format)
{
return ("fixme");
}
else
{
return ("unknown");
}
}
}
/**
* fib_node_register_type
*
* Register the function table for a given type
*/
void
fib_node_register_type (fib_node_type_t type,
const fib_node_vft_t *vft)
{
/*
* assert that one only registration is made per-node type
*/
if (vec_len(fn_vfts) > type)
ASSERT(NULL == fn_vfts[type].fnv_get);
/*
* Assert that we are getting each of the required functions
*/
ASSERT(NULL != vft->fnv_get);
ASSERT(NULL != vft->fnv_last_lock);
vec_validate(fn_vfts, type);
fn_vfts[type] = *vft;
}
fib_node_type_t
fib_node_register_new_type (const fib_node_vft_t *vft)
{
fib_node_type_t new_type;
new_type = ++last_new_type;
fib_node_register_type(new_type, vft);
return (new_type);
}
static u8*
fib_node_format (fib_node_ptr_t *fnp, u8*s)
{
return (format(s, "{%s:%d}", fn_type_names[fnp->fnp_type], fnp->fnp_index));
}
u32
fib_node_child_add (fib_node_type_t parent_type,
fib_node_index_t parent_index,
fib_node_type_t type,
fib_node_index_t index)
{
fib_node_t *parent;
parent = fn_vfts[parent_type].fnv_get(parent_index);
/*
* return the index of the sibling in the child list
*/
fib_node_lock(parent);
if (FIB_NODE_INDEX_INVALID == parent->fn_children)
{
parent->fn_children = fib_node_list_create();
}
return (fib_node_list_push_front(parent->fn_children,
0, type,
index));
}
void
fib_node_child_remove (fib_node_type_t parent_type,
fib_node_index_t parent_index,
fib_node_index_t sibling_index)
{
fib_node_t *parent;
parent = fn_vfts[parent_type].fnv_get(parent_index);
fib_node_list_remove(parent->fn_children, sibling_index);
if (0 == fib_node_list_get_size(parent->fn_children))
{
fib_node_list_destroy(&parent->fn_children);
}
fib_node_unlock(parent);
}
fib_node_back_walk_rc_t
fib_node_back_walk_one (fib_node_ptr_t *ptr,
fib_node_back_walk_ctx_t *ctx)
{
fib_node_t *node;
node = fn_vfts[ptr->fnp_type].fnv_get(ptr->fnp_index);
return (fn_vfts[ptr->fnp_type].fnv_back_walk(node, ctx));
}
static int
fib_node_ptr_format_one_child (fib_node_ptr_t *ptr,
void *arg)
{
u8 **s = (u8**) arg;
*s = fib_node_format(ptr, *s);
return (1);
}
u8*
fib_node_children_format (fib_node_list_t list,
u8 *s)
{
fib_node_list_walk(list, fib_node_ptr_format_one_child, (void*)&s);
return (s);
}
void
fib_node_init (fib_node_t *node,
fib_node_type_t type)
{
#if CLIB_DEBUG > 0
/**
* The node's type. make sure we are dynamic/down casting correctly
*/
node->fn_type = type;
#endif
node->fn_locks = 0;
node->fn_vft = &fn_vfts[type];
node->fn_children = FIB_NODE_INDEX_INVALID;
}
void
fib_node_deinit (fib_node_t *node)
{
fib_node_list_destroy(&node->fn_children);
}
void
fib_node_lock (fib_node_t *node)
{
node->fn_locks++;
}
void
fib_node_unlock (fib_node_t *node)
{
node->fn_locks--;
if (0 == node->fn_locks)
{
node->fn_vft->fnv_last_lock(node);
}
}
|
