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
|
/*
* Copyright (C) 2020 NetDEF, Inc.
*
* This program 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 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
* more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; see the file COPYING; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <zebra.h>
#include "log.h"
#include "prefix.h"
#include "table.h"
#include "command.h"
#include "northbound.h"
#include "libfrr.h"
#include "pathd/pathd.h"
#include "pathd/path_nb.h"
/*
* XPath: /frr-pathd:pathd/srte/segment-list
*/
const void *pathd_srte_segment_list_get_next(struct nb_cb_get_next_args *args)
{
struct srte_segment_list *segment_list =
(struct srte_segment_list *)args->list_entry;
if (args->list_entry == NULL)
segment_list =
RB_MIN(srte_segment_list_head, &srte_segment_lists);
else
segment_list = RB_NEXT(srte_segment_list_head, segment_list);
return segment_list;
}
int pathd_srte_segment_list_get_keys(struct nb_cb_get_keys_args *args)
{
const struct srte_segment_list *segment_list =
(struct srte_segment_list *)args->list_entry;
args->keys->num = 1;
snprintf(args->keys->key[0], sizeof(args->keys->key[0]), "%s",
segment_list->name);
return NB_OK;
}
const void *
pathd_srte_segment_list_lookup_entry(struct nb_cb_lookup_entry_args *args)
{
return srte_segment_list_find(args->keys->key[0]);
}
/*
* XPath: /frr-pathd:pathd/srte/policy
*/
const void *pathd_srte_policy_get_next(struct nb_cb_get_next_args *args)
{
struct srte_policy *policy = (struct srte_policy *)args->list_entry;
if (args->list_entry == NULL)
policy = RB_MIN(srte_policy_head, &srte_policies);
else
policy = RB_NEXT(srte_policy_head, policy);
return policy;
}
int pathd_srte_policy_get_keys(struct nb_cb_get_keys_args *args)
{
const struct srte_policy *policy =
(struct srte_policy *)args->list_entry;
args->keys->num = 2;
snprintf(args->keys->key[0], sizeof(args->keys->key[0]), "%u",
policy->color);
ipaddr2str(&policy->endpoint, args->keys->key[1],
sizeof(args->keys->key[1]));
return NB_OK;
}
const void *pathd_srte_policy_lookup_entry(struct nb_cb_lookup_entry_args *args)
{
uint32_t color;
struct ipaddr endpoint;
color = yang_str2uint32(args->keys->key[0]);
yang_str2ip(args->keys->key[1], &endpoint);
return srte_policy_find(color, &endpoint);
}
/*
* XPath: /frr-pathd:pathd/srte/policy/is-operational
*/
struct yang_data *
pathd_srte_policy_is_operational_get_elem(struct nb_cb_get_elem_args *args)
{
struct srte_policy *policy = (struct srte_policy *)args->list_entry;
bool is_operational = false;
if (policy->status == SRTE_POLICY_STATUS_UP)
is_operational = true;
return yang_data_new_bool(args->xpath, is_operational);
}
/*
* XPath: /frr-pathd:pathd/srte/policy/candidate-path
*/
const void *
pathd_srte_policy_candidate_path_get_next(struct nb_cb_get_next_args *args)
{
struct srte_policy *policy =
(struct srte_policy *)args->parent_list_entry;
struct srte_candidate *candidate =
(struct srte_candidate *)args->list_entry;
if (args->list_entry == NULL)
candidate =
RB_MIN(srte_candidate_head, &policy->candidate_paths);
else
candidate = RB_NEXT(srte_candidate_head, candidate);
return candidate;
}
int pathd_srte_policy_candidate_path_get_keys(struct nb_cb_get_keys_args *args)
{
const struct srte_candidate *candidate =
(struct srte_candidate *)args->list_entry;
args->keys->num = 1;
snprintf(args->keys->key[0], sizeof(args->keys->key[0]), "%u",
candidate->preference);
return NB_OK;
}
const void *pathd_srte_policy_candidate_path_lookup_entry(
struct nb_cb_lookup_entry_args *args)
{
struct srte_policy *policy =
(struct srte_policy *)args->parent_list_entry;
uint32_t preference;
preference = yang_str2uint32(args->keys->key[0]);
return srte_candidate_find(policy, preference);
}
/*
* XPath: /frr-pathd:pathd/srte/policy/candidate_path/is-best-candidate-path
*/
struct yang_data *
pathd_srte_policy_candidate_path_is_best_candidate_path_get_elem(
struct nb_cb_get_elem_args *args)
{
struct srte_candidate *candidate =
(struct srte_candidate *)args->list_entry;
return yang_data_new_bool(
args->xpath, CHECK_FLAG(candidate->flags, F_CANDIDATE_BEST));
}
/*
* XPath: /frr-pathd:pathd/srte/policy/candidate-path/discriminator
*/
struct yang_data *pathd_srte_policy_candidate_path_discriminator_get_elem(
struct nb_cb_get_elem_args *args)
{
struct srte_candidate *candidate =
(struct srte_candidate *)args->list_entry;
return yang_data_new_uint32(args->xpath, candidate->discriminator);
}
|
