Data nodes sorted #2128
Data nodes sorted #2128
Commits on Feb 13, 2024
-
-
tree data BUGFIX in lyd_insert_sibling()
The lyd_insert_node() expecting first sibling.
-
parser BUGFIX references to siblings
... when deleting metadata in the lyd_parse_set_data_flags().
-
-
-
-
-
plugins types CHANGE compare function callback
The function now has a new context parameter that may be needed when getting the canonical value. Type API version number has increased.
-
-
-
-
-
-
plugins types FEATURE sort callback in empty
... implemented via new lyplg_type_sort_simple().
-
-
-
-
-
-
plugins types REFACTOR for instanceid
Simplification of sort and compare callback functions. The complexity of the comparison was needed in the old version of libyang.
-
-
-
-
-
-
libyang FEATURE sorting of data nodes
1. Plugin type 'lyds_tree' is integrated. Used in metadata and it is internal, which is distinguished by the unset print callback. Internal metadata must not be printed. 2. Leaf-list and list data instances are now automatically sorted. 3. Both the explicit and implicit YANG statement 'ordered-by system' will cause the nodes to be ordered. 4. The first instance of the list or leaf-list of node contain new metadata named 'lyds_tree'. 5. Data nodes are sorted only if their data types have callback 'sort' set. 6. Sorting can be turned off so far only by adding the 'ordered-by user' statement to the YANG model. 7. If the sort fails for some reason, the node is still inserted as the last instance. A warning message informs about this situation. 8. The time required for sorting should be relatively small thanks to the Red-black tree implementation. 9. Memory requirements will now increase by 40 bytes per list/leaf-list data node, plus metadata structure overhead. 10. New internal lyds_tree plugin type.
-
lyds tree OPTIMIZE flag LYD_PARSE_ORDERED
1. When inserting, the last parameter can also be used for nodes with lyds_tree 2. The principle of lyds_tree is that it is created lazily. That is, if it is certain that the nodes are sorted, no metadata or lyds_tree is created. 3. If it is necessary to modify the sorted nodes, the lyds_tree is created additionally. This means that inserting the first node can lead to a delay. 4. The LYD_PARSE_ORDERED flag now has a positive performance effect because the lyds_tree is created lazily.
-
-
tree data OPTIMIZE unlink-insert for lyds nodes
Unlink and then insert is inefficient for sorted (lyds) list and leaf-list nodes. Also improved lyd_unlink_siblings().
-
lyds tree OPTIMIZE data can be unordered
If the LYD_PARSE_ORDERED flag is set incorrectly, the data may be unordered, a warning will inform about this if the DEBUG variable is set. But as soon as the lyds tree is created later, the data will be sorted.
-
tree data BUGFIX added return value for unlink
Added return value for functions lyd_unlink_siblings() and lyd_unlink_tree(), which causes ABI breaks.
-
tree data OPTIMIZE lyds in lyd_merge()
There is no more freeing of memory and then allocation regarding regarding lyds data. Memory intended to be freed is temporarily not freed and instead waits for an opportunity to use it again.
-
tree data OPTIMIZE added first_sibling parameter
This change avoids unnecessary finding of the first sibling in case the parent node is not available.
-
tree data OPTIMIZE diff and lyd_insert_node()
Function lyd_insert_node() has new options that ignore the ordering of data nodes. This is used in lyd_diff_add() because the diff as such does not need to be sorted.
-
tree data BUGFIX in ly_insert_node()
Restored functionality regarding the sorting of opaq nodes and nodes with the LYD_EXT flag set.
-
tree data OPTIMIZE of lyd_dup() for (leaf-)list
Faster node insertion. There is no need to search for the 'anchor' for instances of the (leaf-)list, thus reducing the number of accesses to the hash table.
