]> git.proxmox.com Git - mirror_frr.git/blob - lib/northbound.c
Merge pull request #10816 from anlancs/fix-bgdp-local-es-rt
[mirror_frr.git] / lib / northbound.c
1 /*
2 * Copyright (C) 2018 NetDEF, Inc.
3 * Renato Westphal
4 *
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License as published by the Free
7 * Software Foundation; either version 2 of the License, or (at your option)
8 * any later version.
9 *
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
13 * more details.
14 *
15 * You should have received a copy of the GNU General Public License along
16 * with this program; see the file COPYING; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
18 */
19
20 #include <zebra.h>
21
22 #include "libfrr.h"
23 #include "log.h"
24 #include "lib_errors.h"
25 #include "hash.h"
26 #include "command.h"
27 #include "debug.h"
28 #include "db.h"
29 #include "frr_pthread.h"
30 #include "northbound.h"
31 #include "northbound_cli.h"
32 #include "northbound_db.h"
33 #include "frrstr.h"
34
35 DEFINE_MTYPE_STATIC(LIB, NB_NODE, "Northbound Node");
36 DEFINE_MTYPE_STATIC(LIB, NB_CONFIG, "Northbound Configuration");
37 DEFINE_MTYPE_STATIC(LIB, NB_CONFIG_ENTRY, "Northbound Configuration Entry");
38
39 /* Running configuration - shouldn't be modified directly. */
40 struct nb_config *running_config;
41
42 /* Hash table of user pointers associated with configuration entries. */
43 static struct hash *running_config_entries;
44
45 /* Management lock for the running configuration. */
46 static struct {
47 /* Mutex protecting this structure. */
48 pthread_mutex_t mtx;
49
50 /* Actual lock. */
51 bool locked;
52
53 /* Northbound client who owns this lock. */
54 enum nb_client owner_client;
55
56 /* Northbound user who owns this lock. */
57 const void *owner_user;
58 } running_config_mgmt_lock;
59
60 /* Knob to record config transaction */
61 static bool nb_db_enabled;
62 /*
63 * Global lock used to prevent multiple configuration transactions from
64 * happening concurrently.
65 */
66 static bool transaction_in_progress;
67
68 static int nb_callback_pre_validate(struct nb_context *context,
69 const struct nb_node *nb_node,
70 const struct lyd_node *dnode, char *errmsg,
71 size_t errmsg_len);
72 static int nb_callback_configuration(struct nb_context *context,
73 const enum nb_event event,
74 struct nb_config_change *change,
75 char *errmsg, size_t errmsg_len);
76 static struct nb_transaction *
77 nb_transaction_new(struct nb_context *context, struct nb_config *config,
78 struct nb_config_cbs *changes, const char *comment,
79 char *errmsg, size_t errmsg_len);
80 static void nb_transaction_free(struct nb_transaction *transaction);
81 static int nb_transaction_process(enum nb_event event,
82 struct nb_transaction *transaction,
83 char *errmsg, size_t errmsg_len);
84 static void nb_transaction_apply_finish(struct nb_transaction *transaction,
85 char *errmsg, size_t errmsg_len);
86 static int nb_oper_data_iter_node(const struct lysc_node *snode,
87 const char *xpath, const void *list_entry,
88 const struct yang_list_keys *list_keys,
89 struct yang_translator *translator,
90 bool first, uint32_t flags,
91 nb_oper_data_cb cb, void *arg);
92
93 static int nb_node_check_config_only(const struct lysc_node *snode, void *arg)
94 {
95 bool *config_only = arg;
96
97 if (CHECK_FLAG(snode->flags, LYS_CONFIG_R)) {
98 *config_only = false;
99 return YANG_ITER_STOP;
100 }
101
102 return YANG_ITER_CONTINUE;
103 }
104
105 static int nb_node_new_cb(const struct lysc_node *snode, void *arg)
106 {
107 struct nb_node *nb_node;
108 struct lysc_node *sparent, *sparent_list;
109
110 nb_node = XCALLOC(MTYPE_NB_NODE, sizeof(*nb_node));
111 yang_snode_get_path(snode, YANG_PATH_DATA, nb_node->xpath,
112 sizeof(nb_node->xpath));
113 nb_node->priority = NB_DFLT_PRIORITY;
114 sparent = yang_snode_real_parent(snode);
115 if (sparent)
116 nb_node->parent = sparent->priv;
117 sparent_list = yang_snode_parent_list(snode);
118 if (sparent_list)
119 nb_node->parent_list = sparent_list->priv;
120
121 /* Set flags. */
122 if (CHECK_FLAG(snode->nodetype, LYS_CONTAINER | LYS_LIST)) {
123 bool config_only = true;
124
125 (void)yang_snodes_iterate_subtree(snode, NULL,
126 nb_node_check_config_only, 0,
127 &config_only);
128 if (config_only)
129 SET_FLAG(nb_node->flags, F_NB_NODE_CONFIG_ONLY);
130 }
131 if (CHECK_FLAG(snode->nodetype, LYS_LIST)) {
132 if (yang_snode_num_keys(snode) == 0)
133 SET_FLAG(nb_node->flags, F_NB_NODE_KEYLESS_LIST);
134 }
135
136 /*
137 * Link the northbound node and the libyang schema node with one
138 * another.
139 */
140 nb_node->snode = snode;
141 assert(snode->priv == NULL);
142 ((struct lysc_node *)snode)->priv = nb_node;
143
144 return YANG_ITER_CONTINUE;
145 }
146
147 static int nb_node_del_cb(const struct lysc_node *snode, void *arg)
148 {
149 struct nb_node *nb_node;
150
151 nb_node = snode->priv;
152 if (nb_node) {
153 ((struct lysc_node *)snode)->priv = NULL;
154 XFREE(MTYPE_NB_NODE, nb_node);
155 }
156
157 return YANG_ITER_CONTINUE;
158 }
159
160 void nb_nodes_create(void)
161 {
162 yang_snodes_iterate(NULL, nb_node_new_cb, 0, NULL);
163 }
164
165 void nb_nodes_delete(void)
166 {
167 yang_snodes_iterate(NULL, nb_node_del_cb, 0, NULL);
168 }
169
170 struct nb_node *nb_node_find(const char *path)
171 {
172 const struct lysc_node *snode;
173
174 /*
175 * Use libyang to find the schema node associated to the path and get
176 * the northbound node from there (snode private pointer).
177 */
178 snode = lys_find_path(ly_native_ctx, NULL, path, 0);
179 if (!snode)
180 return NULL;
181
182 return snode->priv;
183 }
184
185 void nb_node_set_dependency_cbs(const char *dependency_xpath,
186 const char *dependant_xpath,
187 struct nb_dependency_callbacks *cbs)
188 {
189 struct nb_node *dependency = nb_node_find(dependency_xpath);
190 struct nb_node *dependant = nb_node_find(dependant_xpath);
191
192 if (!dependency || !dependant)
193 return;
194
195 dependency->dep_cbs.get_dependant_xpath = cbs->get_dependant_xpath;
196 dependant->dep_cbs.get_dependency_xpath = cbs->get_dependency_xpath;
197 }
198
199 bool nb_node_has_dependency(struct nb_node *node)
200 {
201 return node->dep_cbs.get_dependency_xpath != NULL;
202 }
203
204 static int nb_node_validate_cb(const struct nb_node *nb_node,
205 enum nb_operation operation,
206 int callback_implemented, bool optional)
207 {
208 bool valid;
209
210 valid = nb_operation_is_valid(operation, nb_node->snode);
211
212 /*
213 * Add an exception for operational data callbacks. A rw list usually
214 * doesn't need any associated operational data callbacks. But if this
215 * rw list is augmented by another module which adds state nodes under
216 * it, then this list will need to have the 'get_next()', 'get_keys()'
217 * and 'lookup_entry()' callbacks. As such, never log a warning when
218 * these callbacks are implemented when they are not needed, since this
219 * depends on context (e.g. some daemons might augment "frr-interface"
220 * while others don't).
221 */
222 if (!valid && callback_implemented && operation != NB_OP_GET_NEXT
223 && operation != NB_OP_GET_KEYS && operation != NB_OP_LOOKUP_ENTRY)
224 flog_warn(EC_LIB_NB_CB_UNNEEDED,
225 "unneeded '%s' callback for '%s'",
226 nb_operation_name(operation), nb_node->xpath);
227
228 if (!optional && valid && !callback_implemented) {
229 flog_err(EC_LIB_NB_CB_MISSING, "missing '%s' callback for '%s'",
230 nb_operation_name(operation), nb_node->xpath);
231 return 1;
232 }
233
234 return 0;
235 }
236
237 /*
238 * Check if the required callbacks were implemented for the given northbound
239 * node.
240 */
241 static unsigned int nb_node_validate_cbs(const struct nb_node *nb_node)
242
243 {
244 unsigned int error = 0;
245
246 error += nb_node_validate_cb(nb_node, NB_OP_CREATE,
247 !!nb_node->cbs.create, false);
248 error += nb_node_validate_cb(nb_node, NB_OP_MODIFY,
249 !!nb_node->cbs.modify, false);
250 error += nb_node_validate_cb(nb_node, NB_OP_DESTROY,
251 !!nb_node->cbs.destroy, false);
252 error += nb_node_validate_cb(nb_node, NB_OP_MOVE, !!nb_node->cbs.move,
253 false);
254 error += nb_node_validate_cb(nb_node, NB_OP_PRE_VALIDATE,
255 !!nb_node->cbs.pre_validate, true);
256 error += nb_node_validate_cb(nb_node, NB_OP_APPLY_FINISH,
257 !!nb_node->cbs.apply_finish, true);
258 error += nb_node_validate_cb(nb_node, NB_OP_GET_ELEM,
259 !!nb_node->cbs.get_elem, false);
260 error += nb_node_validate_cb(nb_node, NB_OP_GET_NEXT,
261 !!nb_node->cbs.get_next, false);
262 error += nb_node_validate_cb(nb_node, NB_OP_GET_KEYS,
263 !!nb_node->cbs.get_keys, false);
264 error += nb_node_validate_cb(nb_node, NB_OP_LOOKUP_ENTRY,
265 !!nb_node->cbs.lookup_entry, false);
266 error += nb_node_validate_cb(nb_node, NB_OP_RPC, !!nb_node->cbs.rpc,
267 false);
268
269 return error;
270 }
271
272 static unsigned int nb_node_validate_priority(const struct nb_node *nb_node)
273 {
274 /* Top-level nodes can have any priority. */
275 if (!nb_node->parent)
276 return 0;
277
278 if (nb_node->priority < nb_node->parent->priority) {
279 flog_err(EC_LIB_NB_CB_INVALID_PRIO,
280 "node has higher priority than its parent [xpath %s]",
281 nb_node->xpath);
282 return 1;
283 }
284
285 return 0;
286 }
287
288 static int nb_node_validate(const struct lysc_node *snode, void *arg)
289 {
290 struct nb_node *nb_node = snode->priv;
291 unsigned int *errors = arg;
292
293 /* Validate callbacks and priority. */
294 if (nb_node) {
295 *errors += nb_node_validate_cbs(nb_node);
296 *errors += nb_node_validate_priority(nb_node);
297 }
298
299 return YANG_ITER_CONTINUE;
300 }
301
302 struct nb_config *nb_config_new(struct lyd_node *dnode)
303 {
304 struct nb_config *config;
305
306 config = XCALLOC(MTYPE_NB_CONFIG, sizeof(*config));
307 if (dnode)
308 config->dnode = dnode;
309 else
310 config->dnode = yang_dnode_new(ly_native_ctx, true);
311 config->version = 0;
312
313 return config;
314 }
315
316 void nb_config_free(struct nb_config *config)
317 {
318 if (config->dnode)
319 yang_dnode_free(config->dnode);
320 XFREE(MTYPE_NB_CONFIG, config);
321 }
322
323 struct nb_config *nb_config_dup(const struct nb_config *config)
324 {
325 struct nb_config *dup;
326
327 dup = XCALLOC(MTYPE_NB_CONFIG, sizeof(*dup));
328 dup->dnode = yang_dnode_dup(config->dnode);
329 dup->version = config->version;
330
331 return dup;
332 }
333
334 int nb_config_merge(struct nb_config *config_dst, struct nb_config *config_src,
335 bool preserve_source)
336 {
337 int ret;
338
339 ret = lyd_merge_siblings(&config_dst->dnode, config_src->dnode, 0);
340 if (ret != 0)
341 flog_warn(EC_LIB_LIBYANG, "%s: lyd_merge() failed", __func__);
342
343 if (!preserve_source)
344 nb_config_free(config_src);
345
346 return (ret == 0) ? NB_OK : NB_ERR;
347 }
348
349 void nb_config_replace(struct nb_config *config_dst,
350 struct nb_config *config_src, bool preserve_source)
351 {
352 /* Update version. */
353 if (config_src->version != 0)
354 config_dst->version = config_src->version;
355
356 /* Update dnode. */
357 if (config_dst->dnode)
358 yang_dnode_free(config_dst->dnode);
359 if (preserve_source) {
360 config_dst->dnode = yang_dnode_dup(config_src->dnode);
361 } else {
362 config_dst->dnode = config_src->dnode;
363 config_src->dnode = NULL;
364 nb_config_free(config_src);
365 }
366 }
367
368 /* Generate the nb_config_cbs tree. */
369 static inline int nb_config_cb_compare(const struct nb_config_cb *a,
370 const struct nb_config_cb *b)
371 {
372 /* Sort by priority first. */
373 if (a->nb_node->priority < b->nb_node->priority)
374 return -1;
375 if (a->nb_node->priority > b->nb_node->priority)
376 return 1;
377
378 /*
379 * Preserve the order of the configuration changes as told by libyang.
380 */
381 if (a->seq < b->seq)
382 return -1;
383 if (a->seq > b->seq)
384 return 1;
385
386 /*
387 * All 'apply_finish' callbacks have their sequence number set to zero.
388 * In this case, compare them using their dnode pointers (the order
389 * doesn't matter for callbacks that have the same priority).
390 */
391 if (a->dnode < b->dnode)
392 return -1;
393 if (a->dnode > b->dnode)
394 return 1;
395
396 return 0;
397 }
398 RB_GENERATE(nb_config_cbs, nb_config_cb, entry, nb_config_cb_compare);
399
400 static void nb_config_diff_add_change(struct nb_config_cbs *changes,
401 enum nb_operation operation,
402 uint32_t *seq,
403 const struct lyd_node *dnode)
404 {
405 struct nb_config_change *change;
406
407 /* Ignore unimplemented nodes. */
408 if (!dnode->schema->priv)
409 return;
410
411 change = XCALLOC(MTYPE_TMP, sizeof(*change));
412 change->cb.operation = operation;
413 change->cb.seq = *seq;
414 *seq = *seq + 1;
415 change->cb.nb_node = dnode->schema->priv;
416 change->cb.dnode = dnode;
417
418 RB_INSERT(nb_config_cbs, changes, &change->cb);
419 }
420
421 static void nb_config_diff_del_changes(struct nb_config_cbs *changes)
422 {
423 while (!RB_EMPTY(nb_config_cbs, changes)) {
424 struct nb_config_change *change;
425
426 change = (struct nb_config_change *)RB_ROOT(nb_config_cbs,
427 changes);
428 RB_REMOVE(nb_config_cbs, changes, &change->cb);
429 XFREE(MTYPE_TMP, change);
430 }
431 }
432
433 /*
434 * Helper function used when calculating the delta between two different
435 * configurations. Given a new subtree, calculate all new YANG data nodes,
436 * excluding default leafs and leaf-lists. This is a recursive function.
437 */
438 static void nb_config_diff_created(const struct lyd_node *dnode, uint32_t *seq,
439 struct nb_config_cbs *changes)
440 {
441 enum nb_operation operation;
442 struct lyd_node *child;
443
444 /* Ignore unimplemented nodes. */
445 if (!dnode->schema->priv)
446 return;
447
448 switch (dnode->schema->nodetype) {
449 case LYS_LEAF:
450 case LYS_LEAFLIST:
451 if (lyd_is_default(dnode))
452 break;
453
454 if (nb_operation_is_valid(NB_OP_CREATE, dnode->schema))
455 operation = NB_OP_CREATE;
456 else if (nb_operation_is_valid(NB_OP_MODIFY, dnode->schema))
457 operation = NB_OP_MODIFY;
458 else
459 return;
460
461 nb_config_diff_add_change(changes, operation, seq, dnode);
462 break;
463 case LYS_CONTAINER:
464 case LYS_LIST:
465 if (nb_operation_is_valid(NB_OP_CREATE, dnode->schema))
466 nb_config_diff_add_change(changes, NB_OP_CREATE, seq,
467 dnode);
468
469 /* Process child nodes recursively. */
470 LY_LIST_FOR (lyd_child(dnode), child) {
471 nb_config_diff_created(child, seq, changes);
472 }
473 break;
474 default:
475 break;
476 }
477 }
478
479 static void nb_config_diff_deleted(const struct lyd_node *dnode, uint32_t *seq,
480 struct nb_config_cbs *changes)
481 {
482 /* Ignore unimplemented nodes. */
483 if (!dnode->schema->priv)
484 return;
485
486 if (nb_operation_is_valid(NB_OP_DESTROY, dnode->schema))
487 nb_config_diff_add_change(changes, NB_OP_DESTROY, seq, dnode);
488 else if (CHECK_FLAG(dnode->schema->nodetype, LYS_CONTAINER)) {
489 struct lyd_node *child;
490
491 /*
492 * Non-presence containers need special handling since they
493 * don't have "destroy" callbacks. In this case, what we need to
494 * do is to call the "destroy" callbacks of their child nodes
495 * when applicable (i.e. optional nodes).
496 */
497 LY_LIST_FOR (lyd_child(dnode), child) {
498 nb_config_diff_deleted(child, seq, changes);
499 }
500 }
501 }
502
503 static int nb_lyd_diff_get_op(const struct lyd_node *dnode)
504 {
505 const struct lyd_meta *meta;
506 LY_LIST_FOR (dnode->meta, meta) {
507 if (strcmp(meta->name, "operation")
508 || strcmp(meta->annotation->module->name, "yang"))
509 continue;
510 return lyd_get_meta_value(meta)[0];
511 }
512 return 'n';
513 }
514
515 #if 0 /* Used below in nb_config_diff inside normally disabled code */
516 static inline void nb_config_diff_dnode_log_path(const char *context,
517 const char *path,
518 const struct lyd_node *dnode)
519 {
520 if (dnode->schema->nodetype & LYD_NODE_TERM)
521 zlog_debug("nb_config_diff: %s: %s: %s", context, path,
522 lyd_get_value(dnode));
523 else
524 zlog_debug("nb_config_diff: %s: %s", context, path);
525 }
526
527 static inline void nb_config_diff_dnode_log(const char *context,
528 const struct lyd_node *dnode)
529 {
530 if (!dnode) {
531 zlog_debug("nb_config_diff: %s: NULL", context);
532 return;
533 }
534
535 char *path = lyd_path(dnode, LYD_PATH_STD, NULL, 0);
536 nb_config_diff_dnode_log_path(context, path, dnode);
537 free(path);
538 }
539 #endif
540
541 /* Calculate the delta between two different configurations. */
542 static void nb_config_diff(const struct nb_config *config1,
543 const struct nb_config *config2,
544 struct nb_config_cbs *changes)
545 {
546 struct lyd_node *diff = NULL;
547 const struct lyd_node *root, *dnode;
548 struct lyd_node *target;
549 int op;
550 LY_ERR err;
551 char *path;
552
553 #if 0 /* Useful (noisy) when debugging diff code, and for improving later */
554 if (DEBUG_MODE_CHECK(&nb_dbg_cbs_config, DEBUG_MODE_ALL)) {
555 LY_LIST_FOR(config1->dnode, root) {
556 LYD_TREE_DFS_BEGIN(root, dnode) {
557 nb_config_diff_dnode_log("from", dnode);
558 LYD_TREE_DFS_END(root, dnode);
559 }
560 }
561 LY_LIST_FOR(config2->dnode, root) {
562 LYD_TREE_DFS_BEGIN(root, dnode) {
563 nb_config_diff_dnode_log("to", dnode);
564 LYD_TREE_DFS_END(root, dnode);
565 }
566 }
567 }
568 #endif
569
570 err = lyd_diff_siblings(config1->dnode, config2->dnode,
571 LYD_DIFF_DEFAULTS, &diff);
572 assert(!err);
573
574 if (diff && DEBUG_MODE_CHECK(&nb_dbg_cbs_config, DEBUG_MODE_ALL)) {
575 char *s;
576
577 if (!lyd_print_mem(&s, diff, LYD_JSON,
578 LYD_PRINT_WITHSIBLINGS | LYD_PRINT_WD_ALL)) {
579 zlog_debug("%s: %s", __func__, s);
580 free(s);
581 }
582 }
583
584 uint32_t seq = 0;
585
586 LY_LIST_FOR (diff, root) {
587 LYD_TREE_DFS_BEGIN (root, dnode) {
588 op = nb_lyd_diff_get_op(dnode);
589
590 path = lyd_path(dnode, LYD_PATH_STD, NULL, 0);
591
592 #if 0 /* Useful (noisy) when debugging diff code, and for improving later */
593 if (DEBUG_MODE_CHECK(&nb_dbg_cbs_config, DEBUG_MODE_ALL)) {
594 char context[80];
595 snprintf(context, sizeof(context),
596 "iterating diff: oper: %c seq: %u", op, seq);
597 nb_config_diff_dnode_log_path(context, path, dnode);
598 }
599 #endif
600 switch (op) {
601 case 'c': /* create */
602 /*
603 * This is rather inefficient, but when we use
604 * dnode from the diff instead of the
605 * candidate config node we get failures when
606 * looking up default values, etc, based on
607 * the diff tree.
608 */
609 target = yang_dnode_get(config2->dnode, path);
610 assert(target);
611 nb_config_diff_created(target, &seq, changes);
612
613 /* Skip rest of sub-tree, move to next sibling
614 */
615 LYD_TREE_DFS_continue = 1;
616 break;
617 case 'd': /* delete */
618 target = yang_dnode_get(config1->dnode, path);
619 assert(target);
620 nb_config_diff_deleted(target, &seq, changes);
621
622 /* Skip rest of sub-tree, move to next sibling
623 */
624 LYD_TREE_DFS_continue = 1;
625 break;
626 case 'r': /* replace */
627 /* either moving an entry or changing a value */
628 target = yang_dnode_get(config2->dnode, path);
629 assert(target);
630 nb_config_diff_add_change(changes, NB_OP_MODIFY,
631 &seq, target);
632 break;
633 case 'n': /* none */
634 default:
635 break;
636 }
637 free(path);
638 LYD_TREE_DFS_END(root, dnode);
639 }
640 }
641
642 lyd_free_all(diff);
643 }
644
645 int nb_candidate_edit(struct nb_config *candidate,
646 const struct nb_node *nb_node,
647 enum nb_operation operation, const char *xpath,
648 const struct yang_data *previous,
649 const struct yang_data *data)
650 {
651 struct lyd_node *dnode, *dep_dnode;
652 char xpath_edit[XPATH_MAXLEN];
653 char dep_xpath[XPATH_MAXLEN];
654 LY_ERR err;
655
656 /* Use special notation for leaf-lists (RFC 6020, section 9.13.5). */
657 if (nb_node->snode->nodetype == LYS_LEAFLIST)
658 snprintf(xpath_edit, sizeof(xpath_edit), "%s[.='%s']", xpath,
659 data->value);
660 else
661 strlcpy(xpath_edit, xpath, sizeof(xpath_edit));
662
663 switch (operation) {
664 case NB_OP_CREATE:
665 case NB_OP_MODIFY:
666 err = lyd_new_path(candidate->dnode, ly_native_ctx, xpath_edit,
667 (void *)data->value, LYD_NEW_PATH_UPDATE,
668 &dnode);
669 if (err) {
670 flog_warn(EC_LIB_LIBYANG,
671 "%s: lyd_new_path(%s) failed: %d", __func__,
672 xpath_edit, err);
673 return NB_ERR;
674 } else if (dnode) {
675 /* Create default nodes */
676 LY_ERR err = lyd_new_implicit_tree(
677 dnode, LYD_IMPLICIT_NO_STATE, NULL);
678 if (err) {
679 flog_warn(EC_LIB_LIBYANG,
680 "%s: lyd_new_implicit_all failed: %d",
681 __func__, err);
682 }
683 /*
684 * create dependency
685 *
686 * dnode returned by the lyd_new_path may be from a
687 * different schema, so we need to update the nb_node
688 */
689 nb_node = dnode->schema->priv;
690 if (nb_node->dep_cbs.get_dependency_xpath) {
691 nb_node->dep_cbs.get_dependency_xpath(
692 dnode, dep_xpath);
693
694 err = lyd_new_path(candidate->dnode,
695 ly_native_ctx, dep_xpath,
696 NULL, LYD_NEW_PATH_UPDATE,
697 &dep_dnode);
698 /* Create default nodes */
699 if (!err && dep_dnode)
700 err = lyd_new_implicit_tree(
701 dep_dnode,
702 LYD_IMPLICIT_NO_STATE, NULL);
703 if (err) {
704 flog_warn(
705 EC_LIB_LIBYANG,
706 "%s: dependency: lyd_new_path(%s) failed: %d",
707 __func__, dep_xpath, err);
708 return NB_ERR;
709 }
710 }
711 }
712 break;
713 case NB_OP_DESTROY:
714 dnode = yang_dnode_get(candidate->dnode, xpath_edit);
715 if (!dnode)
716 /*
717 * Return a special error code so the caller can choose
718 * whether to ignore it or not.
719 */
720 return NB_ERR_NOT_FOUND;
721 /* destroy dependant */
722 if (nb_node->dep_cbs.get_dependant_xpath) {
723 nb_node->dep_cbs.get_dependant_xpath(dnode, dep_xpath);
724
725 dep_dnode = yang_dnode_get(candidate->dnode, dep_xpath);
726 if (dep_dnode)
727 lyd_free_tree(dep_dnode);
728 }
729 lyd_free_tree(dnode);
730 break;
731 case NB_OP_MOVE:
732 /* TODO: update configuration. */
733 break;
734 default:
735 flog_warn(EC_LIB_DEVELOPMENT,
736 "%s: unknown operation (%u) [xpath %s]", __func__,
737 operation, xpath_edit);
738 return NB_ERR;
739 }
740
741 return NB_OK;
742 }
743
744 bool nb_candidate_needs_update(const struct nb_config *candidate)
745 {
746 if (candidate->version < running_config->version)
747 return true;
748
749 return false;
750 }
751
752 int nb_candidate_update(struct nb_config *candidate)
753 {
754 struct nb_config *updated_config;
755
756 updated_config = nb_config_dup(running_config);
757 if (nb_config_merge(updated_config, candidate, true) != NB_OK)
758 return NB_ERR;
759
760 nb_config_replace(candidate, updated_config, false);
761
762 return NB_OK;
763 }
764
765 /*
766 * Perform YANG syntactic and semantic validation.
767 *
768 * WARNING: lyd_validate() can change the configuration as part of the
769 * validation process.
770 */
771 static int nb_candidate_validate_yang(struct nb_config *candidate, char *errmsg,
772 size_t errmsg_len)
773 {
774 if (lyd_validate_all(&candidate->dnode, ly_native_ctx,
775 LYD_VALIDATE_NO_STATE, NULL)
776 != 0) {
777 yang_print_errors(ly_native_ctx, errmsg, errmsg_len);
778 return NB_ERR_VALIDATION;
779 }
780
781 return NB_OK;
782 }
783
784 /* Perform code-level validation using the northbound callbacks. */
785 static int nb_candidate_validate_code(struct nb_context *context,
786 struct nb_config *candidate,
787 struct nb_config_cbs *changes,
788 char *errmsg, size_t errmsg_len)
789 {
790 struct nb_config_cb *cb;
791 struct lyd_node *root, *child;
792 int ret;
793
794 /* First validate the candidate as a whole. */
795 LY_LIST_FOR (candidate->dnode, root) {
796 LYD_TREE_DFS_BEGIN (root, child) {
797 struct nb_node *nb_node;
798
799 nb_node = child->schema->priv;
800 if (!nb_node || !nb_node->cbs.pre_validate)
801 goto next;
802
803 ret = nb_callback_pre_validate(context, nb_node, child,
804 errmsg, errmsg_len);
805 if (ret != NB_OK)
806 return NB_ERR_VALIDATION;
807
808 next:
809 LYD_TREE_DFS_END(root, child);
810 }
811 }
812
813 /* Now validate the configuration changes. */
814 RB_FOREACH (cb, nb_config_cbs, changes) {
815 struct nb_config_change *change = (struct nb_config_change *)cb;
816
817 ret = nb_callback_configuration(context, NB_EV_VALIDATE, change,
818 errmsg, errmsg_len);
819 if (ret != NB_OK)
820 return NB_ERR_VALIDATION;
821 }
822
823 return NB_OK;
824 }
825
826 int nb_candidate_validate(struct nb_context *context,
827 struct nb_config *candidate, char *errmsg,
828 size_t errmsg_len)
829 {
830 struct nb_config_cbs changes;
831 int ret;
832
833 if (nb_candidate_validate_yang(candidate, errmsg, errmsg_len) != NB_OK)
834 return NB_ERR_VALIDATION;
835
836 RB_INIT(nb_config_cbs, &changes);
837 nb_config_diff(running_config, candidate, &changes);
838 ret = nb_candidate_validate_code(context, candidate, &changes, errmsg,
839 errmsg_len);
840 nb_config_diff_del_changes(&changes);
841
842 return ret;
843 }
844
845 int nb_candidate_commit_prepare(struct nb_context *context,
846 struct nb_config *candidate,
847 const char *comment,
848 struct nb_transaction **transaction,
849 char *errmsg, size_t errmsg_len)
850 {
851 struct nb_config_cbs changes;
852
853 if (nb_candidate_validate_yang(candidate, errmsg, errmsg_len)
854 != NB_OK) {
855 flog_warn(EC_LIB_NB_CANDIDATE_INVALID,
856 "%s: failed to validate candidate configuration",
857 __func__);
858 return NB_ERR_VALIDATION;
859 }
860
861 RB_INIT(nb_config_cbs, &changes);
862 nb_config_diff(running_config, candidate, &changes);
863 if (RB_EMPTY(nb_config_cbs, &changes)) {
864 snprintf(
865 errmsg, errmsg_len,
866 "No changes to apply were found during preparation phase");
867 return NB_ERR_NO_CHANGES;
868 }
869
870 if (nb_candidate_validate_code(context, candidate, &changes, errmsg,
871 errmsg_len)
872 != NB_OK) {
873 flog_warn(EC_LIB_NB_CANDIDATE_INVALID,
874 "%s: failed to validate candidate configuration",
875 __func__);
876 nb_config_diff_del_changes(&changes);
877 return NB_ERR_VALIDATION;
878 }
879
880 *transaction = nb_transaction_new(context, candidate, &changes, comment,
881 errmsg, errmsg_len);
882 if (*transaction == NULL) {
883 flog_warn(EC_LIB_NB_TRANSACTION_CREATION_FAILED,
884 "%s: failed to create transaction: %s", __func__,
885 errmsg);
886 nb_config_diff_del_changes(&changes);
887 return NB_ERR_LOCKED;
888 }
889
890 return nb_transaction_process(NB_EV_PREPARE, *transaction, errmsg,
891 errmsg_len);
892 }
893
894 void nb_candidate_commit_abort(struct nb_transaction *transaction, char *errmsg,
895 size_t errmsg_len)
896 {
897 (void)nb_transaction_process(NB_EV_ABORT, transaction, errmsg,
898 errmsg_len);
899 nb_transaction_free(transaction);
900 }
901
902 void nb_candidate_commit_apply(struct nb_transaction *transaction,
903 bool save_transaction, uint32_t *transaction_id,
904 char *errmsg, size_t errmsg_len)
905 {
906 (void)nb_transaction_process(NB_EV_APPLY, transaction, errmsg,
907 errmsg_len);
908 nb_transaction_apply_finish(transaction, errmsg, errmsg_len);
909
910 /* Replace running by candidate. */
911 transaction->config->version++;
912 nb_config_replace(running_config, transaction->config, true);
913
914 /* Record transaction. */
915 if (save_transaction && nb_db_enabled
916 && nb_db_transaction_save(transaction, transaction_id) != NB_OK)
917 flog_warn(EC_LIB_NB_TRANSACTION_RECORD_FAILED,
918 "%s: failed to record transaction", __func__);
919
920 nb_transaction_free(transaction);
921 }
922
923 int nb_candidate_commit(struct nb_context *context, struct nb_config *candidate,
924 bool save_transaction, const char *comment,
925 uint32_t *transaction_id, char *errmsg,
926 size_t errmsg_len)
927 {
928 struct nb_transaction *transaction = NULL;
929 int ret;
930
931 ret = nb_candidate_commit_prepare(context, candidate, comment,
932 &transaction, errmsg, errmsg_len);
933 /*
934 * Apply the changes if the preparation phase succeeded. Otherwise abort
935 * the transaction.
936 */
937 if (ret == NB_OK)
938 nb_candidate_commit_apply(transaction, save_transaction,
939 transaction_id, errmsg, errmsg_len);
940 else if (transaction != NULL)
941 nb_candidate_commit_abort(transaction, errmsg, errmsg_len);
942
943 return ret;
944 }
945
946 int nb_running_lock(enum nb_client client, const void *user)
947 {
948 int ret = -1;
949
950 frr_with_mutex (&running_config_mgmt_lock.mtx) {
951 if (!running_config_mgmt_lock.locked) {
952 running_config_mgmt_lock.locked = true;
953 running_config_mgmt_lock.owner_client = client;
954 running_config_mgmt_lock.owner_user = user;
955 ret = 0;
956 }
957 }
958
959 return ret;
960 }
961
962 int nb_running_unlock(enum nb_client client, const void *user)
963 {
964 int ret = -1;
965
966 frr_with_mutex (&running_config_mgmt_lock.mtx) {
967 if (running_config_mgmt_lock.locked
968 && running_config_mgmt_lock.owner_client == client
969 && running_config_mgmt_lock.owner_user == user) {
970 running_config_mgmt_lock.locked = false;
971 running_config_mgmt_lock.owner_client = NB_CLIENT_NONE;
972 running_config_mgmt_lock.owner_user = NULL;
973 ret = 0;
974 }
975 }
976
977 return ret;
978 }
979
980 int nb_running_lock_check(enum nb_client client, const void *user)
981 {
982 int ret = -1;
983
984 frr_with_mutex (&running_config_mgmt_lock.mtx) {
985 if (!running_config_mgmt_lock.locked
986 || (running_config_mgmt_lock.owner_client == client
987 && running_config_mgmt_lock.owner_user == user))
988 ret = 0;
989 }
990
991 return ret;
992 }
993
994 static void nb_log_config_callback(const enum nb_event event,
995 enum nb_operation operation,
996 const struct lyd_node *dnode)
997 {
998 const char *value;
999 char xpath[XPATH_MAXLEN];
1000
1001 if (!DEBUG_MODE_CHECK(&nb_dbg_cbs_config, DEBUG_MODE_ALL))
1002 return;
1003
1004 yang_dnode_get_path(dnode, xpath, sizeof(xpath));
1005 if (yang_snode_is_typeless_data(dnode->schema))
1006 value = "(none)";
1007 else
1008 value = yang_dnode_get_string(dnode, NULL);
1009
1010 zlog_debug(
1011 "northbound callback: event [%s] op [%s] xpath [%s] value [%s]",
1012 nb_event_name(event), nb_operation_name(operation), xpath,
1013 value);
1014 }
1015
1016 static int nb_callback_create(struct nb_context *context,
1017 const struct nb_node *nb_node,
1018 enum nb_event event, const struct lyd_node *dnode,
1019 union nb_resource *resource, char *errmsg,
1020 size_t errmsg_len)
1021 {
1022 struct nb_cb_create_args args = {};
1023 bool unexpected_error = false;
1024 int ret;
1025
1026 nb_log_config_callback(event, NB_OP_CREATE, dnode);
1027
1028 args.context = context;
1029 args.event = event;
1030 args.dnode = dnode;
1031 args.resource = resource;
1032 args.errmsg = errmsg;
1033 args.errmsg_len = errmsg_len;
1034 ret = nb_node->cbs.create(&args);
1035
1036 /* Detect and log unexpected errors. */
1037 switch (ret) {
1038 case NB_OK:
1039 case NB_ERR:
1040 break;
1041 case NB_ERR_VALIDATION:
1042 if (event != NB_EV_VALIDATE)
1043 unexpected_error = true;
1044 break;
1045 case NB_ERR_RESOURCE:
1046 if (event != NB_EV_PREPARE)
1047 unexpected_error = true;
1048 break;
1049 case NB_ERR_INCONSISTENCY:
1050 if (event == NB_EV_VALIDATE)
1051 unexpected_error = true;
1052 break;
1053 default:
1054 unexpected_error = true;
1055 break;
1056 }
1057 if (unexpected_error)
1058 DEBUGD(&nb_dbg_cbs_config,
1059 "northbound callback: unexpected return value: %s",
1060 nb_err_name(ret));
1061
1062 return ret;
1063 }
1064
1065 static int nb_callback_modify(struct nb_context *context,
1066 const struct nb_node *nb_node,
1067 enum nb_event event, const struct lyd_node *dnode,
1068 union nb_resource *resource, char *errmsg,
1069 size_t errmsg_len)
1070 {
1071 struct nb_cb_modify_args args = {};
1072 bool unexpected_error = false;
1073 int ret;
1074
1075 nb_log_config_callback(event, NB_OP_MODIFY, dnode);
1076
1077 args.context = context;
1078 args.event = event;
1079 args.dnode = dnode;
1080 args.resource = resource;
1081 args.errmsg = errmsg;
1082 args.errmsg_len = errmsg_len;
1083 ret = nb_node->cbs.modify(&args);
1084
1085 /* Detect and log unexpected errors. */
1086 switch (ret) {
1087 case NB_OK:
1088 case NB_ERR:
1089 break;
1090 case NB_ERR_VALIDATION:
1091 if (event != NB_EV_VALIDATE)
1092 unexpected_error = true;
1093 break;
1094 case NB_ERR_RESOURCE:
1095 if (event != NB_EV_PREPARE)
1096 unexpected_error = true;
1097 break;
1098 case NB_ERR_INCONSISTENCY:
1099 if (event == NB_EV_VALIDATE)
1100 unexpected_error = true;
1101 break;
1102 default:
1103 unexpected_error = true;
1104 break;
1105 }
1106 if (unexpected_error)
1107 DEBUGD(&nb_dbg_cbs_config,
1108 "northbound callback: unexpected return value: %s",
1109 nb_err_name(ret));
1110
1111 return ret;
1112 }
1113
1114 static int nb_callback_destroy(struct nb_context *context,
1115 const struct nb_node *nb_node,
1116 enum nb_event event,
1117 const struct lyd_node *dnode, char *errmsg,
1118 size_t errmsg_len)
1119 {
1120 struct nb_cb_destroy_args args = {};
1121 bool unexpected_error = false;
1122 int ret;
1123
1124 nb_log_config_callback(event, NB_OP_DESTROY, dnode);
1125
1126 args.context = context;
1127 args.event = event;
1128 args.dnode = dnode;
1129 args.errmsg = errmsg;
1130 args.errmsg_len = errmsg_len;
1131 ret = nb_node->cbs.destroy(&args);
1132
1133 /* Detect and log unexpected errors. */
1134 switch (ret) {
1135 case NB_OK:
1136 case NB_ERR:
1137 break;
1138 case NB_ERR_VALIDATION:
1139 if (event != NB_EV_VALIDATE)
1140 unexpected_error = true;
1141 break;
1142 case NB_ERR_INCONSISTENCY:
1143 if (event == NB_EV_VALIDATE)
1144 unexpected_error = true;
1145 break;
1146 default:
1147 unexpected_error = true;
1148 break;
1149 }
1150 if (unexpected_error)
1151 DEBUGD(&nb_dbg_cbs_config,
1152 "northbound callback: unexpected return value: %s",
1153 nb_err_name(ret));
1154
1155 return ret;
1156 }
1157
1158 static int nb_callback_move(struct nb_context *context,
1159 const struct nb_node *nb_node, enum nb_event event,
1160 const struct lyd_node *dnode, char *errmsg,
1161 size_t errmsg_len)
1162 {
1163 struct nb_cb_move_args args = {};
1164 bool unexpected_error = false;
1165 int ret;
1166
1167 nb_log_config_callback(event, NB_OP_MOVE, dnode);
1168
1169 args.context = context;
1170 args.event = event;
1171 args.dnode = dnode;
1172 args.errmsg = errmsg;
1173 args.errmsg_len = errmsg_len;
1174 ret = nb_node->cbs.move(&args);
1175
1176 /* Detect and log unexpected errors. */
1177 switch (ret) {
1178 case NB_OK:
1179 case NB_ERR:
1180 break;
1181 case NB_ERR_VALIDATION:
1182 if (event != NB_EV_VALIDATE)
1183 unexpected_error = true;
1184 break;
1185 case NB_ERR_INCONSISTENCY:
1186 if (event == NB_EV_VALIDATE)
1187 unexpected_error = true;
1188 break;
1189 default:
1190 unexpected_error = true;
1191 break;
1192 }
1193 if (unexpected_error)
1194 DEBUGD(&nb_dbg_cbs_config,
1195 "northbound callback: unexpected return value: %s",
1196 nb_err_name(ret));
1197
1198 return ret;
1199 }
1200
1201 static int nb_callback_pre_validate(struct nb_context *context,
1202 const struct nb_node *nb_node,
1203 const struct lyd_node *dnode, char *errmsg,
1204 size_t errmsg_len)
1205 {
1206 struct nb_cb_pre_validate_args args = {};
1207 bool unexpected_error = false;
1208 int ret;
1209
1210 nb_log_config_callback(NB_EV_VALIDATE, NB_OP_PRE_VALIDATE, dnode);
1211
1212 args.dnode = dnode;
1213 args.errmsg = errmsg;
1214 args.errmsg_len = errmsg_len;
1215 ret = nb_node->cbs.pre_validate(&args);
1216
1217 /* Detect and log unexpected errors. */
1218 switch (ret) {
1219 case NB_OK:
1220 case NB_ERR_VALIDATION:
1221 break;
1222 default:
1223 unexpected_error = true;
1224 break;
1225 }
1226 if (unexpected_error)
1227 DEBUGD(&nb_dbg_cbs_config,
1228 "northbound callback: unexpected return value: %s",
1229 nb_err_name(ret));
1230
1231 return ret;
1232 }
1233
1234 static void nb_callback_apply_finish(struct nb_context *context,
1235 const struct nb_node *nb_node,
1236 const struct lyd_node *dnode, char *errmsg,
1237 size_t errmsg_len)
1238 {
1239 struct nb_cb_apply_finish_args args = {};
1240
1241 nb_log_config_callback(NB_EV_APPLY, NB_OP_APPLY_FINISH, dnode);
1242
1243 args.context = context;
1244 args.dnode = dnode;
1245 args.errmsg = errmsg;
1246 args.errmsg_len = errmsg_len;
1247 nb_node->cbs.apply_finish(&args);
1248 }
1249
1250 struct yang_data *nb_callback_get_elem(const struct nb_node *nb_node,
1251 const char *xpath,
1252 const void *list_entry)
1253 {
1254 struct nb_cb_get_elem_args args = {};
1255
1256 DEBUGD(&nb_dbg_cbs_state,
1257 "northbound callback (get_elem): xpath [%s] list_entry [%p]",
1258 xpath, list_entry);
1259
1260 args.xpath = xpath;
1261 args.list_entry = list_entry;
1262 return nb_node->cbs.get_elem(&args);
1263 }
1264
1265 const void *nb_callback_get_next(const struct nb_node *nb_node,
1266 const void *parent_list_entry,
1267 const void *list_entry)
1268 {
1269 struct nb_cb_get_next_args args = {};
1270
1271 DEBUGD(&nb_dbg_cbs_state,
1272 "northbound callback (get_next): node [%s] parent_list_entry [%p] list_entry [%p]",
1273 nb_node->xpath, parent_list_entry, list_entry);
1274
1275 args.parent_list_entry = parent_list_entry;
1276 args.list_entry = list_entry;
1277 return nb_node->cbs.get_next(&args);
1278 }
1279
1280 int nb_callback_get_keys(const struct nb_node *nb_node, const void *list_entry,
1281 struct yang_list_keys *keys)
1282 {
1283 struct nb_cb_get_keys_args args = {};
1284
1285 DEBUGD(&nb_dbg_cbs_state,
1286 "northbound callback (get_keys): node [%s] list_entry [%p]",
1287 nb_node->xpath, list_entry);
1288
1289 args.list_entry = list_entry;
1290 args.keys = keys;
1291 return nb_node->cbs.get_keys(&args);
1292 }
1293
1294 const void *nb_callback_lookup_entry(const struct nb_node *nb_node,
1295 const void *parent_list_entry,
1296 const struct yang_list_keys *keys)
1297 {
1298 struct nb_cb_lookup_entry_args args = {};
1299
1300 DEBUGD(&nb_dbg_cbs_state,
1301 "northbound callback (lookup_entry): node [%s] parent_list_entry [%p]",
1302 nb_node->xpath, parent_list_entry);
1303
1304 args.parent_list_entry = parent_list_entry;
1305 args.keys = keys;
1306 return nb_node->cbs.lookup_entry(&args);
1307 }
1308
1309 int nb_callback_rpc(const struct nb_node *nb_node, const char *xpath,
1310 const struct list *input, struct list *output, char *errmsg,
1311 size_t errmsg_len)
1312 {
1313 struct nb_cb_rpc_args args = {};
1314
1315 DEBUGD(&nb_dbg_cbs_rpc, "northbound RPC: %s", xpath);
1316
1317 args.xpath = xpath;
1318 args.input = input;
1319 args.output = output;
1320 args.errmsg = errmsg;
1321 args.errmsg_len = errmsg_len;
1322 return nb_node->cbs.rpc(&args);
1323 }
1324
1325 /*
1326 * Call the northbound configuration callback associated to a given
1327 * configuration change.
1328 */
1329 static int nb_callback_configuration(struct nb_context *context,
1330 const enum nb_event event,
1331 struct nb_config_change *change,
1332 char *errmsg, size_t errmsg_len)
1333 {
1334 enum nb_operation operation = change->cb.operation;
1335 char xpath[XPATH_MAXLEN];
1336 const struct nb_node *nb_node = change->cb.nb_node;
1337 const struct lyd_node *dnode = change->cb.dnode;
1338 union nb_resource *resource;
1339 int ret = NB_ERR;
1340
1341 if (event == NB_EV_VALIDATE)
1342 resource = NULL;
1343 else
1344 resource = &change->resource;
1345
1346 switch (operation) {
1347 case NB_OP_CREATE:
1348 ret = nb_callback_create(context, nb_node, event, dnode,
1349 resource, errmsg, errmsg_len);
1350 break;
1351 case NB_OP_MODIFY:
1352 ret = nb_callback_modify(context, nb_node, event, dnode,
1353 resource, errmsg, errmsg_len);
1354 break;
1355 case NB_OP_DESTROY:
1356 ret = nb_callback_destroy(context, nb_node, event, dnode,
1357 errmsg, errmsg_len);
1358 break;
1359 case NB_OP_MOVE:
1360 ret = nb_callback_move(context, nb_node, event, dnode, errmsg,
1361 errmsg_len);
1362 break;
1363 default:
1364 yang_dnode_get_path(dnode, xpath, sizeof(xpath));
1365 flog_err(EC_LIB_DEVELOPMENT,
1366 "%s: unknown operation (%u) [xpath %s]", __func__,
1367 operation, xpath);
1368 exit(1);
1369 }
1370
1371 if (ret != NB_OK) {
1372 yang_dnode_get_path(dnode, xpath, sizeof(xpath));
1373
1374 switch (event) {
1375 case NB_EV_VALIDATE:
1376 flog_warn(EC_LIB_NB_CB_CONFIG_VALIDATE,
1377 "error processing configuration change: error [%s] event [%s] operation [%s] xpath [%s]%s%s",
1378 nb_err_name(ret), nb_event_name(event),
1379 nb_operation_name(operation), xpath,
1380 errmsg[0] ? " message: " : "", errmsg);
1381 break;
1382 case NB_EV_PREPARE:
1383 flog_warn(EC_LIB_NB_CB_CONFIG_PREPARE,
1384 "error processing configuration change: error [%s] event [%s] operation [%s] xpath [%s]%s%s",
1385 nb_err_name(ret), nb_event_name(event),
1386 nb_operation_name(operation), xpath,
1387 errmsg[0] ? " message: " : "", errmsg);
1388 break;
1389 case NB_EV_ABORT:
1390 flog_warn(EC_LIB_NB_CB_CONFIG_ABORT,
1391 "error processing configuration change: error [%s] event [%s] operation [%s] xpath [%s]%s%s",
1392 nb_err_name(ret), nb_event_name(event),
1393 nb_operation_name(operation), xpath,
1394 errmsg[0] ? " message: " : "", errmsg);
1395 break;
1396 case NB_EV_APPLY:
1397 flog_err(EC_LIB_NB_CB_CONFIG_APPLY,
1398 "error processing configuration change: error [%s] event [%s] operation [%s] xpath [%s]%s%s",
1399 nb_err_name(ret), nb_event_name(event),
1400 nb_operation_name(operation), xpath,
1401 errmsg[0] ? " message: " : "", errmsg);
1402 break;
1403 default:
1404 flog_err(EC_LIB_DEVELOPMENT,
1405 "%s: unknown event (%u) [xpath %s]", __func__,
1406 event, xpath);
1407 exit(1);
1408 }
1409 }
1410
1411 return ret;
1412 }
1413
1414 static struct nb_transaction *
1415 nb_transaction_new(struct nb_context *context, struct nb_config *config,
1416 struct nb_config_cbs *changes, const char *comment,
1417 char *errmsg, size_t errmsg_len)
1418 {
1419 struct nb_transaction *transaction;
1420
1421 if (nb_running_lock_check(context->client, context->user)) {
1422 strlcpy(errmsg,
1423 "running configuration is locked by another client",
1424 errmsg_len);
1425 return NULL;
1426 }
1427
1428 if (transaction_in_progress) {
1429 strlcpy(errmsg,
1430 "there's already another transaction in progress",
1431 errmsg_len);
1432 return NULL;
1433 }
1434 transaction_in_progress = true;
1435
1436 transaction = XCALLOC(MTYPE_TMP, sizeof(*transaction));
1437 transaction->context = context;
1438 if (comment)
1439 strlcpy(transaction->comment, comment,
1440 sizeof(transaction->comment));
1441 transaction->config = config;
1442 transaction->changes = *changes;
1443
1444 return transaction;
1445 }
1446
1447 static void nb_transaction_free(struct nb_transaction *transaction)
1448 {
1449 nb_config_diff_del_changes(&transaction->changes);
1450 XFREE(MTYPE_TMP, transaction);
1451 transaction_in_progress = false;
1452 }
1453
1454 /* Process all configuration changes associated to a transaction. */
1455 static int nb_transaction_process(enum nb_event event,
1456 struct nb_transaction *transaction,
1457 char *errmsg, size_t errmsg_len)
1458 {
1459 struct nb_config_cb *cb;
1460
1461 RB_FOREACH (cb, nb_config_cbs, &transaction->changes) {
1462 struct nb_config_change *change = (struct nb_config_change *)cb;
1463 int ret;
1464
1465 /*
1466 * Only try to release resources that were allocated
1467 * successfully.
1468 */
1469 if (event == NB_EV_ABORT && !change->prepare_ok)
1470 break;
1471
1472 /* Call the appropriate callback. */
1473 ret = nb_callback_configuration(transaction->context, event,
1474 change, errmsg, errmsg_len);
1475 switch (event) {
1476 case NB_EV_PREPARE:
1477 if (ret != NB_OK)
1478 return ret;
1479 change->prepare_ok = true;
1480 break;
1481 case NB_EV_ABORT:
1482 case NB_EV_APPLY:
1483 /*
1484 * At this point it's not possible to reject the
1485 * transaction anymore, so any failure here can lead to
1486 * inconsistencies and should be treated as a bug.
1487 * Operations prone to errors, like validations and
1488 * resource allocations, should be performed during the
1489 * 'prepare' phase.
1490 */
1491 break;
1492 default:
1493 break;
1494 }
1495 }
1496
1497 return NB_OK;
1498 }
1499
1500 static struct nb_config_cb *
1501 nb_apply_finish_cb_new(struct nb_config_cbs *cbs, const struct nb_node *nb_node,
1502 const struct lyd_node *dnode)
1503 {
1504 struct nb_config_cb *cb;
1505
1506 cb = XCALLOC(MTYPE_TMP, sizeof(*cb));
1507 cb->nb_node = nb_node;
1508 cb->dnode = dnode;
1509 RB_INSERT(nb_config_cbs, cbs, cb);
1510
1511 return cb;
1512 }
1513
1514 static struct nb_config_cb *
1515 nb_apply_finish_cb_find(struct nb_config_cbs *cbs,
1516 const struct nb_node *nb_node,
1517 const struct lyd_node *dnode)
1518 {
1519 struct nb_config_cb s;
1520
1521 s.seq = 0;
1522 s.nb_node = nb_node;
1523 s.dnode = dnode;
1524 return RB_FIND(nb_config_cbs, cbs, &s);
1525 }
1526
1527 /* Call the 'apply_finish' callbacks. */
1528 static void nb_transaction_apply_finish(struct nb_transaction *transaction,
1529 char *errmsg, size_t errmsg_len)
1530 {
1531 struct nb_config_cbs cbs;
1532 struct nb_config_cb *cb;
1533
1534 /* Initialize tree of 'apply_finish' callbacks. */
1535 RB_INIT(nb_config_cbs, &cbs);
1536
1537 /* Identify the 'apply_finish' callbacks that need to be called. */
1538 RB_FOREACH (cb, nb_config_cbs, &transaction->changes) {
1539 struct nb_config_change *change = (struct nb_config_change *)cb;
1540 const struct lyd_node *dnode = change->cb.dnode;
1541
1542 /*
1543 * Iterate up to the root of the data tree. When a node is being
1544 * deleted, skip its 'apply_finish' callback if one is defined
1545 * (the 'apply_finish' callbacks from the node ancestors should
1546 * be called though).
1547 */
1548 if (change->cb.operation == NB_OP_DESTROY) {
1549 char xpath[XPATH_MAXLEN];
1550
1551 dnode = lyd_parent(dnode);
1552 if (!dnode)
1553 break;
1554
1555 /*
1556 * The dnode from 'delete' callbacks point to elements
1557 * from the running configuration. Use yang_dnode_get()
1558 * to get the corresponding dnode from the candidate
1559 * configuration that is being committed.
1560 */
1561 yang_dnode_get_path(dnode, xpath, sizeof(xpath));
1562 dnode = yang_dnode_get(transaction->config->dnode,
1563 xpath);
1564 }
1565 while (dnode) {
1566 struct nb_node *nb_node;
1567
1568 nb_node = dnode->schema->priv;
1569 if (!nb_node || !nb_node->cbs.apply_finish)
1570 goto next;
1571
1572 /*
1573 * Don't call the callback more than once for the same
1574 * data node.
1575 */
1576 if (nb_apply_finish_cb_find(&cbs, nb_node, dnode))
1577 goto next;
1578
1579 nb_apply_finish_cb_new(&cbs, nb_node, dnode);
1580
1581 next:
1582 dnode = lyd_parent(dnode);
1583 }
1584 }
1585
1586 /* Call the 'apply_finish' callbacks, sorted by their priorities. */
1587 RB_FOREACH (cb, nb_config_cbs, &cbs)
1588 nb_callback_apply_finish(transaction->context, cb->nb_node,
1589 cb->dnode, errmsg, errmsg_len);
1590
1591 /* Release memory. */
1592 while (!RB_EMPTY(nb_config_cbs, &cbs)) {
1593 cb = RB_ROOT(nb_config_cbs, &cbs);
1594 RB_REMOVE(nb_config_cbs, &cbs, cb);
1595 XFREE(MTYPE_TMP, cb);
1596 }
1597 }
1598
1599 static int nb_oper_data_iter_children(const struct lysc_node *snode,
1600 const char *xpath, const void *list_entry,
1601 const struct yang_list_keys *list_keys,
1602 struct yang_translator *translator,
1603 bool first, uint32_t flags,
1604 nb_oper_data_cb cb, void *arg)
1605 {
1606 const struct lysc_node *child;
1607
1608 LY_LIST_FOR (lysc_node_child(snode), child) {
1609 int ret;
1610
1611 ret = nb_oper_data_iter_node(child, xpath, list_entry,
1612 list_keys, translator, false,
1613 flags, cb, arg);
1614 if (ret != NB_OK)
1615 return ret;
1616 }
1617
1618 return NB_OK;
1619 }
1620
1621 static int nb_oper_data_iter_leaf(const struct nb_node *nb_node,
1622 const char *xpath, const void *list_entry,
1623 const struct yang_list_keys *list_keys,
1624 struct yang_translator *translator,
1625 uint32_t flags, nb_oper_data_cb cb, void *arg)
1626 {
1627 struct yang_data *data;
1628
1629 if (CHECK_FLAG(nb_node->snode->flags, LYS_CONFIG_W))
1630 return NB_OK;
1631
1632 /* Ignore list keys. */
1633 if (lysc_is_key(nb_node->snode))
1634 return NB_OK;
1635
1636 data = nb_callback_get_elem(nb_node, xpath, list_entry);
1637 if (data == NULL)
1638 /* Leaf of type "empty" is not present. */
1639 return NB_OK;
1640
1641 return (*cb)(nb_node->snode, translator, data, arg);
1642 }
1643
1644 static int nb_oper_data_iter_container(const struct nb_node *nb_node,
1645 const char *xpath,
1646 const void *list_entry,
1647 const struct yang_list_keys *list_keys,
1648 struct yang_translator *translator,
1649 uint32_t flags, nb_oper_data_cb cb,
1650 void *arg)
1651 {
1652 if (CHECK_FLAG(nb_node->flags, F_NB_NODE_CONFIG_ONLY))
1653 return NB_OK;
1654
1655 /* Presence containers. */
1656 if (nb_node->cbs.get_elem) {
1657 struct yang_data *data;
1658 int ret;
1659
1660 data = nb_callback_get_elem(nb_node, xpath, list_entry);
1661 if (data == NULL)
1662 /* Presence container is not present. */
1663 return NB_OK;
1664
1665 ret = (*cb)(nb_node->snode, translator, data, arg);
1666 if (ret != NB_OK)
1667 return ret;
1668 }
1669
1670 /* Iterate over the child nodes. */
1671 return nb_oper_data_iter_children(nb_node->snode, xpath, list_entry,
1672 list_keys, translator, false, flags,
1673 cb, arg);
1674 }
1675
1676 static int
1677 nb_oper_data_iter_leaflist(const struct nb_node *nb_node, const char *xpath,
1678 const void *parent_list_entry,
1679 const struct yang_list_keys *parent_list_keys,
1680 struct yang_translator *translator, uint32_t flags,
1681 nb_oper_data_cb cb, void *arg)
1682 {
1683 const void *list_entry = NULL;
1684
1685 if (CHECK_FLAG(nb_node->snode->flags, LYS_CONFIG_W))
1686 return NB_OK;
1687
1688 do {
1689 struct yang_data *data;
1690 int ret;
1691
1692 list_entry = nb_callback_get_next(nb_node, parent_list_entry,
1693 list_entry);
1694 if (!list_entry)
1695 /* End of the list. */
1696 break;
1697
1698 data = nb_callback_get_elem(nb_node, xpath, list_entry);
1699 if (data == NULL)
1700 continue;
1701
1702 ret = (*cb)(nb_node->snode, translator, data, arg);
1703 if (ret != NB_OK)
1704 return ret;
1705 } while (list_entry);
1706
1707 return NB_OK;
1708 }
1709
1710 static int nb_oper_data_iter_list(const struct nb_node *nb_node,
1711 const char *xpath_list,
1712 const void *parent_list_entry,
1713 const struct yang_list_keys *parent_list_keys,
1714 struct yang_translator *translator,
1715 uint32_t flags, nb_oper_data_cb cb, void *arg)
1716 {
1717 const struct lysc_node *snode = nb_node->snode;
1718 const void *list_entry = NULL;
1719 uint32_t position = 1;
1720
1721 if (CHECK_FLAG(nb_node->flags, F_NB_NODE_CONFIG_ONLY))
1722 return NB_OK;
1723
1724 /* Iterate over all list entries. */
1725 do {
1726 const struct lysc_node_leaf *skey;
1727 struct yang_list_keys list_keys;
1728 char xpath[XPATH_MAXLEN * 2];
1729 int ret;
1730
1731 /* Obtain list entry. */
1732 list_entry = nb_callback_get_next(nb_node, parent_list_entry,
1733 list_entry);
1734 if (!list_entry)
1735 /* End of the list. */
1736 break;
1737
1738 if (!CHECK_FLAG(nb_node->flags, F_NB_NODE_KEYLESS_LIST)) {
1739 /* Obtain the list entry keys. */
1740 if (nb_callback_get_keys(nb_node, list_entry,
1741 &list_keys)
1742 != NB_OK) {
1743 flog_warn(EC_LIB_NB_CB_STATE,
1744 "%s: failed to get list keys",
1745 __func__);
1746 return NB_ERR;
1747 }
1748
1749 /* Build XPath of the list entry. */
1750 strlcpy(xpath, xpath_list, sizeof(xpath));
1751 unsigned int i = 0;
1752 LY_FOR_KEYS (snode, skey) {
1753 assert(i < list_keys.num);
1754 snprintf(xpath + strlen(xpath),
1755 sizeof(xpath) - strlen(xpath),
1756 "[%s='%s']", skey->name,
1757 list_keys.key[i]);
1758 i++;
1759 }
1760 assert(i == list_keys.num);
1761 } else {
1762 /*
1763 * Keyless list - build XPath using a positional index.
1764 */
1765 snprintf(xpath, sizeof(xpath), "%s[%u]", xpath_list,
1766 position);
1767 position++;
1768 }
1769
1770 /* Iterate over the child nodes. */
1771 ret = nb_oper_data_iter_children(
1772 nb_node->snode, xpath, list_entry, &list_keys,
1773 translator, false, flags, cb, arg);
1774 if (ret != NB_OK)
1775 return ret;
1776 } while (list_entry);
1777
1778 return NB_OK;
1779 }
1780
1781 static int nb_oper_data_iter_node(const struct lysc_node *snode,
1782 const char *xpath_parent,
1783 const void *list_entry,
1784 const struct yang_list_keys *list_keys,
1785 struct yang_translator *translator,
1786 bool first, uint32_t flags,
1787 nb_oper_data_cb cb, void *arg)
1788 {
1789 struct nb_node *nb_node;
1790 char xpath[XPATH_MAXLEN];
1791 int ret = NB_OK;
1792
1793 if (!first && CHECK_FLAG(flags, NB_OPER_DATA_ITER_NORECURSE)
1794 && CHECK_FLAG(snode->nodetype, LYS_CONTAINER | LYS_LIST))
1795 return NB_OK;
1796
1797 /* Update XPath. */
1798 strlcpy(xpath, xpath_parent, sizeof(xpath));
1799 if (!first && snode->nodetype != LYS_USES) {
1800 struct lysc_node *parent;
1801
1802 /* Get the real parent. */
1803 parent = snode->parent;
1804
1805 /*
1806 * When necessary, include the namespace of the augmenting
1807 * module.
1808 */
1809 if (parent && parent->module != snode->module)
1810 snprintf(xpath + strlen(xpath),
1811 sizeof(xpath) - strlen(xpath), "/%s:%s",
1812 snode->module->name, snode->name);
1813 else
1814 snprintf(xpath + strlen(xpath),
1815 sizeof(xpath) - strlen(xpath), "/%s",
1816 snode->name);
1817 }
1818
1819 nb_node = snode->priv;
1820 switch (snode->nodetype) {
1821 case LYS_CONTAINER:
1822 ret = nb_oper_data_iter_container(nb_node, xpath, list_entry,
1823 list_keys, translator, flags,
1824 cb, arg);
1825 break;
1826 case LYS_LEAF:
1827 ret = nb_oper_data_iter_leaf(nb_node, xpath, list_entry,
1828 list_keys, translator, flags, cb,
1829 arg);
1830 break;
1831 case LYS_LEAFLIST:
1832 ret = nb_oper_data_iter_leaflist(nb_node, xpath, list_entry,
1833 list_keys, translator, flags,
1834 cb, arg);
1835 break;
1836 case LYS_LIST:
1837 ret = nb_oper_data_iter_list(nb_node, xpath, list_entry,
1838 list_keys, translator, flags, cb,
1839 arg);
1840 break;
1841 case LYS_USES:
1842 ret = nb_oper_data_iter_children(snode, xpath, list_entry,
1843 list_keys, translator, false,
1844 flags, cb, arg);
1845 break;
1846 default:
1847 break;
1848 }
1849
1850 return ret;
1851 }
1852
1853 int nb_oper_data_iterate(const char *xpath, struct yang_translator *translator,
1854 uint32_t flags, nb_oper_data_cb cb, void *arg)
1855 {
1856 struct nb_node *nb_node;
1857 const void *list_entry = NULL;
1858 struct yang_list_keys list_keys;
1859 struct list *list_dnodes;
1860 struct lyd_node *dnode, *dn;
1861 struct listnode *ln;
1862 int ret;
1863
1864 nb_node = nb_node_find(xpath);
1865 if (!nb_node) {
1866 flog_warn(EC_LIB_YANG_UNKNOWN_DATA_PATH,
1867 "%s: unknown data path: %s", __func__, xpath);
1868 return NB_ERR;
1869 }
1870
1871 /* For now this function works only with containers and lists. */
1872 if (!CHECK_FLAG(nb_node->snode->nodetype, LYS_CONTAINER | LYS_LIST)) {
1873 flog_warn(
1874 EC_LIB_NB_OPERATIONAL_DATA,
1875 "%s: can't iterate over YANG leaf or leaf-list [xpath %s]",
1876 __func__, xpath);
1877 return NB_ERR;
1878 }
1879
1880 /*
1881 * Create a data tree from the XPath so that we can parse the keys of
1882 * all YANG lists (if any).
1883 */
1884
1885 LY_ERR err = lyd_new_path(NULL, ly_native_ctx, xpath, NULL,
1886 LYD_NEW_PATH_UPDATE, &dnode);
1887 if (err || !dnode) {
1888 const char *errmsg =
1889 err ? ly_errmsg(ly_native_ctx) : "node not found";
1890 flog_warn(EC_LIB_LIBYANG, "%s: lyd_new_path() failed %s",
1891 __func__, errmsg);
1892 return NB_ERR;
1893 }
1894
1895 /*
1896 * Create a linked list to sort the data nodes starting from the root.
1897 */
1898 list_dnodes = list_new();
1899 for (dn = dnode; dn; dn = lyd_parent(dn)) {
1900 if (dn->schema->nodetype != LYS_LIST || !lyd_child(dn))
1901 continue;
1902 listnode_add_head(list_dnodes, dn);
1903 }
1904 /*
1905 * Use the northbound callbacks to find list entry pointer corresponding
1906 * to the given XPath.
1907 */
1908 for (ALL_LIST_ELEMENTS_RO(list_dnodes, ln, dn)) {
1909 struct lyd_node *child;
1910 struct nb_node *nn;
1911 unsigned int n = 0;
1912
1913 /* Obtain the list entry keys. */
1914 memset(&list_keys, 0, sizeof(list_keys));
1915 LY_LIST_FOR (lyd_child(dn), child) {
1916 if (!lysc_is_key(child->schema))
1917 break;
1918 strlcpy(list_keys.key[n],
1919 yang_dnode_get_string(child, NULL),
1920 sizeof(list_keys.key[n]));
1921 n++;
1922 }
1923 list_keys.num = n;
1924 if (list_keys.num != yang_snode_num_keys(dn->schema)) {
1925 list_delete(&list_dnodes);
1926 yang_dnode_free(dnode);
1927 return NB_ERR_NOT_FOUND;
1928 }
1929
1930 /* Find the list entry pointer. */
1931 nn = dn->schema->priv;
1932 if (!nn->cbs.lookup_entry) {
1933 flog_warn(
1934 EC_LIB_NB_OPERATIONAL_DATA,
1935 "%s: data path doesn't support iteration over operational data: %s",
1936 __func__, xpath);
1937 list_delete(&list_dnodes);
1938 yang_dnode_free(dnode);
1939 return NB_ERR;
1940 }
1941
1942 list_entry =
1943 nb_callback_lookup_entry(nn, list_entry, &list_keys);
1944 if (list_entry == NULL) {
1945 list_delete(&list_dnodes);
1946 yang_dnode_free(dnode);
1947 return NB_ERR_NOT_FOUND;
1948 }
1949 }
1950
1951 /* If a list entry was given, iterate over that list entry only. */
1952 if (dnode->schema->nodetype == LYS_LIST && lyd_child(dnode))
1953 ret = nb_oper_data_iter_children(
1954 nb_node->snode, xpath, list_entry, &list_keys,
1955 translator, true, flags, cb, arg);
1956 else
1957 ret = nb_oper_data_iter_node(nb_node->snode, xpath, list_entry,
1958 &list_keys, translator, true,
1959 flags, cb, arg);
1960
1961 list_delete(&list_dnodes);
1962 yang_dnode_free(dnode);
1963
1964 return ret;
1965 }
1966
1967 bool nb_operation_is_valid(enum nb_operation operation,
1968 const struct lysc_node *snode)
1969 {
1970 struct nb_node *nb_node = snode->priv;
1971 struct lysc_node_container *scontainer;
1972 struct lysc_node_leaf *sleaf;
1973
1974 switch (operation) {
1975 case NB_OP_CREATE:
1976 if (!CHECK_FLAG(snode->flags, LYS_CONFIG_W))
1977 return false;
1978
1979 switch (snode->nodetype) {
1980 case LYS_LEAF:
1981 sleaf = (struct lysc_node_leaf *)snode;
1982 if (sleaf->type->basetype != LY_TYPE_EMPTY)
1983 return false;
1984 break;
1985 case LYS_CONTAINER:
1986 scontainer = (struct lysc_node_container *)snode;
1987 if (!CHECK_FLAG(scontainer->flags, LYS_PRESENCE))
1988 return false;
1989 break;
1990 case LYS_LIST:
1991 case LYS_LEAFLIST:
1992 break;
1993 default:
1994 return false;
1995 }
1996 return true;
1997 case NB_OP_MODIFY:
1998 if (!CHECK_FLAG(snode->flags, LYS_CONFIG_W))
1999 return false;
2000
2001 switch (snode->nodetype) {
2002 case LYS_LEAF:
2003 sleaf = (struct lysc_node_leaf *)snode;
2004 if (sleaf->type->basetype == LY_TYPE_EMPTY)
2005 return false;
2006
2007 /* List keys can't be modified. */
2008 if (lysc_is_key(sleaf))
2009 return false;
2010 break;
2011 default:
2012 return false;
2013 }
2014 return true;
2015 case NB_OP_DESTROY:
2016 if (!CHECK_FLAG(snode->flags, LYS_CONFIG_W))
2017 return false;
2018
2019 switch (snode->nodetype) {
2020 case LYS_LEAF:
2021 sleaf = (struct lysc_node_leaf *)snode;
2022
2023 /* List keys can't be deleted. */
2024 if (lysc_is_key(sleaf))
2025 return false;
2026
2027 /*
2028 * Only optional leafs can be deleted, or leafs whose
2029 * parent is a case statement.
2030 */
2031 if (snode->parent->nodetype == LYS_CASE)
2032 return true;
2033 if (sleaf->when)
2034 return true;
2035 if (CHECK_FLAG(sleaf->flags, LYS_MAND_TRUE)
2036 || sleaf->dflt)
2037 return false;
2038 break;
2039 case LYS_CONTAINER:
2040 scontainer = (struct lysc_node_container *)snode;
2041 if (!CHECK_FLAG(scontainer->flags, LYS_PRESENCE))
2042 return false;
2043 break;
2044 case LYS_LIST:
2045 case LYS_LEAFLIST:
2046 break;
2047 default:
2048 return false;
2049 }
2050 return true;
2051 case NB_OP_MOVE:
2052 if (!CHECK_FLAG(snode->flags, LYS_CONFIG_W))
2053 return false;
2054
2055 switch (snode->nodetype) {
2056 case LYS_LIST:
2057 case LYS_LEAFLIST:
2058 if (!CHECK_FLAG(snode->flags, LYS_ORDBY_USER))
2059 return false;
2060 break;
2061 default:
2062 return false;
2063 }
2064 return true;
2065 case NB_OP_PRE_VALIDATE:
2066 case NB_OP_APPLY_FINISH:
2067 if (!CHECK_FLAG(snode->flags, LYS_CONFIG_W))
2068 return false;
2069 return true;
2070 case NB_OP_GET_ELEM:
2071 if (!CHECK_FLAG(snode->flags, LYS_CONFIG_R))
2072 return false;
2073
2074 switch (snode->nodetype) {
2075 case LYS_LEAF:
2076 case LYS_LEAFLIST:
2077 break;
2078 case LYS_CONTAINER:
2079 scontainer = (struct lysc_node_container *)snode;
2080 if (!CHECK_FLAG(scontainer->flags, LYS_PRESENCE))
2081 return false;
2082 break;
2083 default:
2084 return false;
2085 }
2086 return true;
2087 case NB_OP_GET_NEXT:
2088 switch (snode->nodetype) {
2089 case LYS_LIST:
2090 if (CHECK_FLAG(nb_node->flags, F_NB_NODE_CONFIG_ONLY))
2091 return false;
2092 break;
2093 case LYS_LEAFLIST:
2094 if (CHECK_FLAG(snode->flags, LYS_CONFIG_W))
2095 return false;
2096 break;
2097 default:
2098 return false;
2099 }
2100 return true;
2101 case NB_OP_GET_KEYS:
2102 case NB_OP_LOOKUP_ENTRY:
2103 switch (snode->nodetype) {
2104 case LYS_LIST:
2105 if (CHECK_FLAG(nb_node->flags, F_NB_NODE_CONFIG_ONLY))
2106 return false;
2107 if (CHECK_FLAG(nb_node->flags, F_NB_NODE_KEYLESS_LIST))
2108 return false;
2109 break;
2110 default:
2111 return false;
2112 }
2113 return true;
2114 case NB_OP_RPC:
2115 if (CHECK_FLAG(snode->flags, LYS_CONFIG_W | LYS_CONFIG_R))
2116 return false;
2117
2118 switch (snode->nodetype) {
2119 case LYS_RPC:
2120 case LYS_ACTION:
2121 break;
2122 default:
2123 return false;
2124 }
2125 return true;
2126 default:
2127 return false;
2128 }
2129 }
2130
2131 DEFINE_HOOK(nb_notification_send, (const char *xpath, struct list *arguments),
2132 (xpath, arguments));
2133
2134 int nb_notification_send(const char *xpath, struct list *arguments)
2135 {
2136 int ret;
2137
2138 DEBUGD(&nb_dbg_notif, "northbound notification: %s", xpath);
2139
2140 ret = hook_call(nb_notification_send, xpath, arguments);
2141 if (arguments)
2142 list_delete(&arguments);
2143
2144 return ret;
2145 }
2146
2147 /* Running configuration user pointers management. */
2148 struct nb_config_entry {
2149 char xpath[XPATH_MAXLEN];
2150 void *entry;
2151 };
2152
2153 static bool running_config_entry_cmp(const void *value1, const void *value2)
2154 {
2155 const struct nb_config_entry *c1 = value1;
2156 const struct nb_config_entry *c2 = value2;
2157
2158 return strmatch(c1->xpath, c2->xpath);
2159 }
2160
2161 static unsigned int running_config_entry_key_make(const void *value)
2162 {
2163 return string_hash_make(value);
2164 }
2165
2166 static void *running_config_entry_alloc(void *p)
2167 {
2168 struct nb_config_entry *new, *key = p;
2169
2170 new = XCALLOC(MTYPE_NB_CONFIG_ENTRY, sizeof(*new));
2171 strlcpy(new->xpath, key->xpath, sizeof(new->xpath));
2172
2173 return new;
2174 }
2175
2176 static void running_config_entry_free(void *arg)
2177 {
2178 XFREE(MTYPE_NB_CONFIG_ENTRY, arg);
2179 }
2180
2181 void nb_running_set_entry(const struct lyd_node *dnode, void *entry)
2182 {
2183 struct nb_config_entry *config, s;
2184
2185 yang_dnode_get_path(dnode, s.xpath, sizeof(s.xpath));
2186 config = hash_get(running_config_entries, &s,
2187 running_config_entry_alloc);
2188 config->entry = entry;
2189 }
2190
2191 void nb_running_move_tree(const char *xpath_from, const char *xpath_to)
2192 {
2193 struct nb_config_entry *entry;
2194 struct list *entries = hash_to_list(running_config_entries);
2195 struct listnode *ln;
2196
2197 for (ALL_LIST_ELEMENTS_RO(entries, ln, entry)) {
2198 if (!frrstr_startswith(entry->xpath, xpath_from))
2199 continue;
2200
2201 hash_release(running_config_entries, entry);
2202
2203 char *newpath =
2204 frrstr_replace(entry->xpath, xpath_from, xpath_to);
2205 strlcpy(entry->xpath, newpath, sizeof(entry->xpath));
2206 XFREE(MTYPE_TMP, newpath);
2207
2208 hash_get(running_config_entries, entry, hash_alloc_intern);
2209 }
2210
2211 list_delete(&entries);
2212 }
2213
2214 static void *nb_running_unset_entry_helper(const struct lyd_node *dnode)
2215 {
2216 struct nb_config_entry *config, s;
2217 struct lyd_node *child;
2218 void *entry = NULL;
2219
2220 yang_dnode_get_path(dnode, s.xpath, sizeof(s.xpath));
2221 config = hash_release(running_config_entries, &s);
2222 if (config) {
2223 entry = config->entry;
2224 running_config_entry_free(config);
2225 }
2226
2227 /* Unset user pointers from the child nodes. */
2228 if (CHECK_FLAG(dnode->schema->nodetype, LYS_LIST | LYS_CONTAINER)) {
2229 LY_LIST_FOR (lyd_child(dnode), child) {
2230 (void)nb_running_unset_entry_helper(child);
2231 }
2232 }
2233
2234 return entry;
2235 }
2236
2237 void *nb_running_unset_entry(const struct lyd_node *dnode)
2238 {
2239 void *entry;
2240
2241 entry = nb_running_unset_entry_helper(dnode);
2242 assert(entry);
2243
2244 return entry;
2245 }
2246
2247 static void *nb_running_get_entry_worker(const struct lyd_node *dnode,
2248 const char *xpath,
2249 bool abort_if_not_found,
2250 bool rec_search)
2251 {
2252 const struct lyd_node *orig_dnode = dnode;
2253 char xpath_buf[XPATH_MAXLEN];
2254 bool rec_flag = true;
2255
2256 assert(dnode || xpath);
2257
2258 if (!dnode)
2259 dnode = yang_dnode_get(running_config->dnode, xpath);
2260
2261 while (rec_flag && dnode) {
2262 struct nb_config_entry *config, s;
2263
2264 yang_dnode_get_path(dnode, s.xpath, sizeof(s.xpath));
2265 config = hash_lookup(running_config_entries, &s);
2266 if (config)
2267 return config->entry;
2268
2269 rec_flag = rec_search;
2270
2271 dnode = lyd_parent(dnode);
2272 }
2273
2274 if (!abort_if_not_found)
2275 return NULL;
2276
2277 yang_dnode_get_path(orig_dnode, xpath_buf, sizeof(xpath_buf));
2278 flog_err(EC_LIB_YANG_DNODE_NOT_FOUND,
2279 "%s: failed to find entry [xpath %s]", __func__, xpath_buf);
2280 zlog_backtrace(LOG_ERR);
2281 abort();
2282 }
2283
2284 void *nb_running_get_entry(const struct lyd_node *dnode, const char *xpath,
2285 bool abort_if_not_found)
2286 {
2287 return nb_running_get_entry_worker(dnode, xpath, abort_if_not_found,
2288 true);
2289 }
2290
2291 void *nb_running_get_entry_non_rec(const struct lyd_node *dnode,
2292 const char *xpath, bool abort_if_not_found)
2293 {
2294 return nb_running_get_entry_worker(dnode, xpath, abort_if_not_found,
2295 false);
2296 }
2297
2298 /* Logging functions. */
2299 const char *nb_event_name(enum nb_event event)
2300 {
2301 switch (event) {
2302 case NB_EV_VALIDATE:
2303 return "validate";
2304 case NB_EV_PREPARE:
2305 return "prepare";
2306 case NB_EV_ABORT:
2307 return "abort";
2308 case NB_EV_APPLY:
2309 return "apply";
2310 default:
2311 return "unknown";
2312 }
2313 }
2314
2315 const char *nb_operation_name(enum nb_operation operation)
2316 {
2317 switch (operation) {
2318 case NB_OP_CREATE:
2319 return "create";
2320 case NB_OP_MODIFY:
2321 return "modify";
2322 case NB_OP_DESTROY:
2323 return "destroy";
2324 case NB_OP_MOVE:
2325 return "move";
2326 case NB_OP_PRE_VALIDATE:
2327 return "pre_validate";
2328 case NB_OP_APPLY_FINISH:
2329 return "apply_finish";
2330 case NB_OP_GET_ELEM:
2331 return "get_elem";
2332 case NB_OP_GET_NEXT:
2333 return "get_next";
2334 case NB_OP_GET_KEYS:
2335 return "get_keys";
2336 case NB_OP_LOOKUP_ENTRY:
2337 return "lookup_entry";
2338 case NB_OP_RPC:
2339 return "rpc";
2340 default:
2341 return "unknown";
2342 }
2343 }
2344
2345 const char *nb_err_name(enum nb_error error)
2346 {
2347 switch (error) {
2348 case NB_OK:
2349 return "ok";
2350 case NB_ERR:
2351 return "generic error";
2352 case NB_ERR_NO_CHANGES:
2353 return "no changes";
2354 case NB_ERR_NOT_FOUND:
2355 return "element not found";
2356 case NB_ERR_LOCKED:
2357 return "resource is locked";
2358 case NB_ERR_VALIDATION:
2359 return "validation";
2360 case NB_ERR_RESOURCE:
2361 return "failed to allocate resource";
2362 case NB_ERR_INCONSISTENCY:
2363 return "internal inconsistency";
2364 default:
2365 return "unknown";
2366 }
2367 }
2368
2369 const char *nb_client_name(enum nb_client client)
2370 {
2371 switch (client) {
2372 case NB_CLIENT_CLI:
2373 return "CLI";
2374 case NB_CLIENT_CONFD:
2375 return "ConfD";
2376 case NB_CLIENT_SYSREPO:
2377 return "Sysrepo";
2378 case NB_CLIENT_GRPC:
2379 return "gRPC";
2380 default:
2381 return "unknown";
2382 }
2383 }
2384
2385 static void nb_load_callbacks(const struct frr_yang_module_info *module)
2386 {
2387 for (size_t i = 0; module->nodes[i].xpath; i++) {
2388 struct nb_node *nb_node;
2389 uint32_t priority;
2390
2391 if (i > YANG_MODULE_MAX_NODES) {
2392 zlog_err(
2393 "%s: %s.yang has more than %u nodes. Please increase YANG_MODULE_MAX_NODES to fix this problem.",
2394 __func__, module->name, YANG_MODULE_MAX_NODES);
2395 exit(1);
2396 }
2397
2398 nb_node = nb_node_find(module->nodes[i].xpath);
2399 if (!nb_node) {
2400 flog_warn(EC_LIB_YANG_UNKNOWN_DATA_PATH,
2401 "%s: unknown data path: %s", __func__,
2402 module->nodes[i].xpath);
2403 continue;
2404 }
2405
2406 nb_node->cbs = module->nodes[i].cbs;
2407 priority = module->nodes[i].priority;
2408 if (priority != 0)
2409 nb_node->priority = priority;
2410 }
2411 }
2412
2413 void nb_validate_callbacks(void)
2414 {
2415 unsigned int errors = 0;
2416
2417 yang_snodes_iterate(NULL, nb_node_validate, 0, &errors);
2418 if (errors > 0) {
2419 flog_err(
2420 EC_LIB_NB_CBS_VALIDATION,
2421 "%s: failed to validate northbound callbacks: %u error(s)",
2422 __func__, errors);
2423 exit(1);
2424 }
2425 }
2426
2427
2428 void nb_init(struct thread_master *tm,
2429 const struct frr_yang_module_info *const modules[],
2430 size_t nmodules, bool db_enabled)
2431 {
2432 struct yang_module *loaded[nmodules], **loadedp = loaded;
2433 bool explicit_compile;
2434
2435 /*
2436 * Currently using this explicit compile feature in libyang2 leads to
2437 * incorrect behavior in FRR. The functionality suppresses the compiling
2438 * of modules until they have all been loaded into the context. This
2439 * avoids multiple recompiles of the same modules as they are
2440 * imported/augmented etc.
2441 */
2442 explicit_compile = false;
2443
2444 nb_db_enabled = db_enabled;
2445
2446 yang_init(true, explicit_compile);
2447
2448 /* Load YANG modules and their corresponding northbound callbacks. */
2449 for (size_t i = 0; i < nmodules; i++) {
2450 DEBUGD(&nb_dbg_events, "northbound: loading %s.yang",
2451 modules[i]->name);
2452 *loadedp++ = yang_module_load(modules[i]->name);
2453 }
2454
2455 if (explicit_compile)
2456 yang_init_loading_complete();
2457
2458 /* Initialize the compiled nodes with northbound data */
2459 for (size_t i = 0; i < nmodules; i++) {
2460 yang_snodes_iterate(loaded[i]->info, nb_node_new_cb, 0, NULL);
2461 nb_load_callbacks(modules[i]);
2462 }
2463
2464 /* Validate northbound callbacks. */
2465 nb_validate_callbacks();
2466
2467 /* Create an empty running configuration. */
2468 running_config = nb_config_new(NULL);
2469 running_config_entries = hash_create(running_config_entry_key_make,
2470 running_config_entry_cmp,
2471 "Running Configuration Entries");
2472 pthread_mutex_init(&running_config_mgmt_lock.mtx, NULL);
2473
2474 /* Initialize the northbound CLI. */
2475 nb_cli_init(tm);
2476 }
2477
2478 void nb_terminate(void)
2479 {
2480 /* Terminate the northbound CLI. */
2481 nb_cli_terminate();
2482
2483 /* Delete all nb_node's from all YANG modules. */
2484 nb_nodes_delete();
2485
2486 /* Delete the running configuration. */
2487 hash_clean(running_config_entries, running_config_entry_free);
2488 hash_free(running_config_entries);
2489 nb_config_free(running_config);
2490 pthread_mutex_destroy(&running_config_mgmt_lock.mtx);
2491 }