Searched refs:lyd_insert (Results 1 – 10 of 10) sorted by relevance
| /dports/net/libyang/libyang-1.0.240/tests/internal/ |
| H A D | test_state_lists.c | 97 assert_int_equal(lyd_insert(st->root1, root->child), 0); in test_hash()
314 assert_int_equal(lyd_insert(st->root2, node), 0); in test_merge_equal_list()
375 assert_int_equal(lyd_insert(st->root2, node), 0); in test_merge_nonequal_list()
436 assert_int_equal(lyd_insert(st->root2, node), 0); in test_diff_equal_list()
459 assert_int_equal(lyd_insert(st->root2, node), 0); in test_diff_nonequal_list()
|
| /dports/net/libyang/libyang-1.0.240/tests/data/ |
| H A D | test_leafref_remove.c | 105 lyd_insert(st->data->child, node); in test_leafref_unlink()
122 lyd_insert(st->data, node); in test_leafref_unlink2()
|
| H A D | test_instid_remove.c | 90 lyd_insert(st->data, node); in test_instid_unlink()
|
| /dports/net/libyang/libyang-1.0.240/tests/callgrind/ |
| H A D | list_manipulation.c | 58 if (lyd_insert(data1, node)) { in main()
|
| /dports/net/libyang/libyang-1.0.240/tests/api/ |
| H A D | test_tree_data.c | 767 rc = lyd_insert(node, new); in test_lyd_insert()
787 assert_int_equal(lyd_insert(node, new->child), 0); in test_lyd_insert()
826 rc = lyd_insert(root, new); in test_lyd_insert_before()
861 rc = lyd_insert(root, new); in test_lyd_insert_after()
1143 rc = lyd_insert(root, new); in test_lyd_validate()
1168 rc = lyd_insert(root, new); in test_lyd_unlink()
1219 rc = lyd_insert(copy, new); in test_lyd_free_withsiblings()
1998 rc = lyd_insert(node,child); in test_lyd_first_sibling()
|
| /dports/net/libyang/libyang-1.0.240/src/ |
| H A D | tree_data.h | 1055 int lyd_insert(struct lyd_node *parent, struct lyd_node *node);
|
| H A D | tree_data.c | 1169 if (lyd_insert(parent, ret)) { in _lyd_new()
1254 if (lyd_insert(parent, ret)) { in _lyd_new_leaf()
1469 if (lyd_insert(parent, (struct lyd_node*)ret)) { in lyd_create_anydata()
2858 if (lyd_insert(trg_parent_backup, src_elem_backup)) { in lyd_merge_parent_children()
3121 if (lyd_insert(node2, src_merge_start)) { in lyd_merge_to_ctx()
4543 lyd_insert(struct lyd_node *parent, struct lyd_node *node) in lyd_insert() function
5665 if (lyd_insert(new_list, key_dup)) { in lyd_dup_keys()
5753 if (parent && lyd_insert(parent, new_node)) { in lyd_dup_to_ctx()
5828 if (lyd_insert(new_node, parent)) { in lyd_dup_to_ctx()
6959 if (!node || lyd_insert(target, node)) { in lyd_find_sibling_val()
|
| H A D | libyang.h.in | 730 …* Working with two data subtrees can also be performed two ways. Usually, you would use lyd_insert…
744 * - lyd_insert()
776 …* change is done on the data tree (via a combination of \b lyd_change_*(), \b lyd_insert*(), \b ly…
851 …* modified data tree (via e.g. lyd_insert() or lyd_free()), some of the default nodes can be missi…
1053 * - data manipulation (lyd_new(), lyd_insert(), lyd_unlink(), lyd_free() and many other
|
| /dports/net/libyang/libyang-1.0.240/swig/cpp/src/ |
| H A D | Tree_Data.cpp | 291 ret = lyd_insert(node, new_node->node); in insert()
|
| /dports/net/libyang/libyang-1.0.240/ |
| H A D | libyang.dump | 1124 'lyd_insert' => 1,
|