libyang  1.0.253
YANG data modeling language library
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups
tree_data.h
Go to the documentation of this file.
1 
15 #ifndef LY_TREE_DATA_H_
16 #define LY_TREE_DATA_H_
17 
18 #include <stddef.h>
19 #include <stdint.h>
20 
21 #include "libyang.h"
22 #include "tree_schema.h"
23 #include "xml.h"
24 
25 #ifdef __cplusplus
26 extern "C" {
27 #endif
28 
40 typedef enum {
45 } LYD_FORMAT;
46 
50 typedef enum {
74  LYD_ANYDATA_XML = 0x08,
82  LYD_ANYDATA_LYB = 0x20,
90 
94 typedef union lyd_value_u {
95  const char *binary;
96  struct lys_type_bit **bit;
98  int8_t bln;
99  int64_t dec64;
100  struct lys_type_enum *enm;
101  struct lys_ident *ident;
102  struct lyd_node *instance;
105  int8_t int8;
106  int16_t int16;
107  int32_t int32;
108  int64_t int64;
109  struct lyd_node *leafref;
110  const char *string;
111  uint8_t uint8;
112  uint16_t uint16;
113  uint32_t uint32;
114  uint64_t uint64;
115  void *ptr;
116 } lyd_val;
117 
128 struct lyd_attr {
129  struct lyd_node *parent;
130  struct lyd_attr *next;
132  const char *name;
133  const char *value_str;
136  uint8_t value_flags;
137 };
138 
147 #define LYD_VAL_OK 0x00
148 #define LYD_VAL_DUP 0x01
150 #define LYD_VAL_UNIQUE 0x02
151 #define LYD_VAL_MAND 0x04
157 #define LYD_VAL_INUSE 0x80
176 struct lyd_node {
177  struct lys_node *schema;
178  uint8_t validity;
179  uint8_t dflt:1;
180  uint8_t when_status:3;
183  struct lyd_attr *attr;
184  struct lyd_node *next;
185  struct lyd_node *prev;
189  struct lyd_node *parent;
191 #ifdef LY_ENABLED_LYD_PRIV
192  void *priv;
193 #endif
194 
195 #ifdef LY_ENABLED_CACHE
196  uint32_t hash;
197  struct hash_table *ht;
198 #endif
199 
200  struct lyd_node *child;
205 };
206 
217 struct lyd_node_leaf_list {
218  struct lys_node *schema;
220  uint8_t validity;
221  uint8_t dflt:1;
222  uint8_t when_status:3;
225  struct lyd_attr *attr;
226  struct lyd_node *next;
227  struct lyd_node *prev;
231  struct lyd_node *parent;
233 #ifdef LY_ENABLED_LYD_PRIV
234  void *priv;
235 #endif
236 
237 #ifdef LY_ENABLED_CACHE
238  uint32_t hash;
239 #endif
240 
241  /* struct lyd_node *child; should be here, but is not */
242 
243  /* leaflist's specific members */
244  const char *value_str;
245  lyd_val value;
246  LY_DATA_TYPE _PACKED value_type;
247  uint8_t value_flags;
248 };
249 
253 #define LY_VALUE_UNRES 0x01
256 #define LY_VALUE_USER 0x02
257 /* 0x80 is reserved for internal use */
258 
262 typedef union {
263  const char *str;
264  char *mem;
265  struct lyxml_elem *xml;
266  struct lyd_node *tree;
269 
278 struct lyd_node_anydata {
279  struct lys_node *schema;
281  uint8_t validity;
282  uint8_t dflt:1;
283  uint8_t when_status:3;
286  struct lyd_attr *attr;
287  struct lyd_node *next;
288  struct lyd_node *prev;
292  struct lyd_node *parent;
294 #ifdef LY_ENABLED_LYD_PRIV
295  void *priv;
296 #endif
298 #ifdef LY_ENABLED_CACHE
299  uint32_t hash;
300 #endif
302  /* struct lyd_node *child; should be here, but is not */
303 
304  /* anyxml's specific members */
307 };
308 
312 typedef enum {
313  LYD_DIFF_END = 0,
350 } LYD_DIFFTYPE;
351 
355 struct lyd_difflist {
356  LYD_DIFFTYPE *type;
357  struct lyd_node **first;
359  struct lyd_node **second;
361 };
362 
368 void lyd_free_diff(struct lyd_difflist *diff);
369 
415 struct lyd_difflist *lyd_diff(struct lyd_node *first, struct lyd_node *second, int options);
416 
423 /* LYD_DIFFOPT_NOSIBLINGS value is the same as LYD_OPT_NOSIBLINGS due to backward compatibility. The LYD_OPT_NOSIBLINGS
424  * was used previously as an option for lyd_diff(). */
425 #define LYD_DIFFOPT_NOSIBLINGS 0x0800
427 #define LYD_DIFFOPT_WITHDEFAULTS 0x0001
445 char *lyd_path(const struct lyd_node *node);
446 
478 #define LYD_OPT_DATA 0x00
481 #define LYD_OPT_CONFIG 0x01
484 #define LYD_OPT_GET 0x02
490 #define LYD_OPT_GETCONFIG 0x04
497 #define LYD_OPT_EDIT 0x08
503 #define LYD_OPT_RPC 0x10
506 #define LYD_OPT_RPCREPLY 0x20
507 #define LYD_OPT_NOTIF 0x40
510 #define LYD_OPT_NOTIF_FILTER 0x80
513 #define LYD_OPT_TYPEMASK 0x10000ff
516 /* 0x100 reserved, used internally */
517 #define LYD_OPT_STRICT 0x0200
518 #define LYD_OPT_DESTRUCT 0x0400
521 #define LYD_OPT_OBSOLETE 0x0800
522 #define LYD_OPT_NOSIBLINGS 0x1000
524 #define LYD_OPT_TRUSTED 0x2000
528 #define LYD_OPT_WHENAUTODEL 0x4000
531 #define LYD_OPT_NOEXTDEPS 0x8000
533 #define LYD_OPT_DATA_NO_YANGLIB 0x10000
534 #define LYD_OPT_DATA_ADD_YANGLIB 0x20000
537 #define LYD_OPT_VAL_DIFF 0x40000
539 #define LYD_OPT_LYB_MOD_UPDATE 0x80000
540 #define LYD_OPT_DATA_TEMPLATE 0x1000000
541 #define LYD_OPT_MULTI_ERRORS 0x2000000
585 struct lyd_node *lyd_parse_mem(struct ly_ctx *ctx, const char *data, LYD_FORMAT format, int options, ...);
586 
625 struct lyd_node *lyd_parse_fd(struct ly_ctx *ctx, int fd, LYD_FORMAT format, int options, ...);
626 
663 struct lyd_node *lyd_parse_path(struct ly_ctx *ctx, const char *path, LYD_FORMAT format, int options, ...);
664 
711 struct lyd_node *lyd_parse_xml(struct ly_ctx *ctx, struct lyxml_elem **root, int options,...);
712 
724 struct lyd_node *lyd_new(struct lyd_node *parent, const struct lys_module *module, const char *name);
725 
739 struct lyd_node *lyd_new_leaf(struct lyd_node *parent, const struct lys_module *module, const char *name,
740  const char *val_str);
741 
757 int lyd_change_leaf(struct lyd_node_leaf_list *leaf, const char *val_str);
758 
775 struct lyd_node *lyd_new_anydata(struct lyd_node *parent, const struct lys_module *module, const char *name,
776  void *value, LYD_ANYDATA_VALUETYPE value_type);
777 
789 struct lyd_node *lyd_new_output(struct lyd_node *parent, const struct lys_module *module, const char *name);
790 
804 struct lyd_node *lyd_new_output_leaf(struct lyd_node *parent, const struct lys_module *module, const char *name,
805  const char *val_str);
806 
824 struct lyd_node *lyd_new_output_anydata(struct lyd_node *parent, const struct lys_module *module, const char *name,
825  void *value, LYD_ANYDATA_VALUETYPE value_type);
826 
837 struct lyd_node *lyd_new_yangdata(const struct lys_module *module, const char *name_template, const char *name);
838 
852 #define LYD_PATH_OPT_UPDATE 0x01
855 #define LYD_PATH_OPT_NOPARENT 0x02
857 #define LYD_PATH_OPT_OUTPUT 0x04
858 #define LYD_PATH_OPT_DFLT 0x08
863 #define LYD_PATH_OPT_NOPARENTRET 0x10
865 #define LYD_PATH_OPT_EDIT 0x20
898 struct lyd_node *lyd_new_path(struct lyd_node *data_tree, const struct ly_ctx *ctx, const char *path, void *value,
899  LYD_ANYDATA_VALUETYPE value_type, int options);
900 
908 unsigned int lyd_list_pos(const struct lyd_node *node);
909 
922 #define LYD_DUP_OPT_RECURSIVE 0x01
923 #define LYD_DUP_OPT_NO_ATTR 0x02
924 #define LYD_DUP_OPT_WITH_PARENTS 0x04
926 #define LYD_DUP_OPT_WITH_KEYS 0x08
928 #define LYD_DUP_OPT_WITH_WHEN 0x10
946 struct lyd_node *lyd_dup(const struct lyd_node *node, int options);
947 
958 struct lyd_node *lyd_dup_withsiblings(const struct lyd_node *node, int options);
959 
972 struct lyd_node *lyd_dup_to_ctx(const struct lyd_node *node, int options, struct ly_ctx *ctx);
973 
1001 int lyd_merge(struct lyd_node *target, const struct lyd_node *source, int options);
1002 
1023 int lyd_merge_to_ctx(struct lyd_node **trg, const struct lyd_node *src, int options, struct ly_ctx *ctx);
1024 
1025 #define LYD_OPT_EXPLICIT 0x0100
1026 
1055 int lyd_insert(struct lyd_node *parent, struct lyd_node *node);
1056 
1086 int lyd_insert_sibling(struct lyd_node **sibling, struct lyd_node *node);
1087 
1105 int lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node);
1106 
1125 int lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node);
1126 
1139 int lyd_schema_sort(struct lyd_node *sibling, int recursive);
1140 
1151 struct ly_set *lyd_find_path(const struct lyd_node *ctx_node, const char *path);
1152 
1163 struct ly_set *lyd_find_instance(const struct lyd_node *data, const struct lys_node *schema);
1164 
1175 int lyd_find_sibling(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match);
1176 
1188 int lyd_find_sibling_set(const struct lyd_node *siblings, const struct lyd_node *target, struct ly_set **set);
1189 
1214 int lyd_find_sibling_val(const struct lyd_node *siblings, const struct lys_node *schema, const char *key_or_value,
1215  struct lyd_node **match);
1216 
1223 struct lyd_node *lyd_first_sibling(struct lyd_node *node);
1224 
1258 int lyd_validate(struct lyd_node **node, int options, void *var_arg, ...);
1259 
1282 int lyd_validate_modules(struct lyd_node **node, const struct lys_module **modules, int mod_count, int options, ...);
1283 
1289 void lyd_free_val_diff(struct lyd_difflist *diff);
1290 
1305 int lyd_validate_value(struct lys_node *node, const char *value);
1306 
1323 int lyd_value_type(struct lys_node *node, const char *value, struct lys_type **type);
1324 
1332 int lyd_wd_default(struct lyd_node_leaf_list *node);
1333 
1341 int lyd_node_should_print(const struct lyd_node *node, int options);
1342 
1355 int lyd_unlink(struct lyd_node *node);
1356 
1365 void lyd_free(struct lyd_node *node);
1366 
1377 void lyd_free_withsiblings(struct lyd_node *node);
1378 
1395 struct lyd_attr *lyd_insert_attr(struct lyd_node *parent, const struct lys_module *mod, const char *name,
1396  const char *value);
1397 
1410 void lyd_free_attr(struct ly_ctx *ctx, struct lyd_node *parent, struct lyd_attr *attr, int recursive);
1411 
1421 struct lys_module *lyd_node_module(const struct lyd_node *node);
1422 
1432 const struct lys_type *lyd_leaf_type(const struct lyd_node_leaf_list *leaf);
1433 
1444 int lyd_print_mem(char **strp, const struct lyd_node *root, LYD_FORMAT format, int options);
1445 
1456 int lyd_print_fd(int fd, const struct lyd_node *root, LYD_FORMAT format, int options);
1457 
1468 int lyd_print_file(FILE *f, const struct lyd_node *root, LYD_FORMAT format, int options);
1469 
1480 int lyd_print_path(const char *path, const struct lyd_node *root, LYD_FORMAT format, int options);
1481 
1493 int lyd_print_clb(ssize_t (*writeclb)(void *arg, const void *buf, size_t count), void *arg,
1494  const struct lyd_node *root, LYD_FORMAT format, int options);
1495 
1505 double lyd_dec64_to_double(const struct lyd_node *node);
1506 
1513 int lyd_lyb_data_length(const char *data);
1514 
1515 #ifdef LY_ENABLED_LYD_PRIV
1516 
1526 void *lyd_set_private(const struct lyd_node *node, void *priv);
1527 
1541 struct lyd_node *lyd_find_path_hash_based(struct lyd_node *data_tree, const struct ly_ctx *ctx, const char *path,
1542  int output);
1543 
1544 #endif
1545 
1548 #ifdef __cplusplus
1549 }
1550 #endif
1551 
1552 #endif /* LY_TREE_DATA_H_ */
struct lyd_node * lyd_parse_fd(struct ly_ctx *ctx, int fd, LYD_FORMAT format, int options,...)
Read (and validate) data from the given file descriptor.
uint32_t uint32
Definition: tree_data.h:113
const char * name
Definition: tree_data.h:132
void * ptr
Definition: tree_data.h:115
Common structure representing single YANG data statement describing.
Definition: tree_schema.h:1231
int lyd_print_clb(ssize_t(*writeclb)(void *arg, const void *buf, size_t count), void *arg, const struct lyd_node *root, LYD_FORMAT format, int options)
Print data tree in the specified format.
struct lyd_node * lyd_new_anydata(struct lyd_node *parent, const struct lys_module *module, const char *name, void *value, LYD_ANYDATA_VALUETYPE value_type)
Create a new anydata or anyxml node in a data tree.
struct lyd_node * next
Definition: tree_data.h:191
int lyd_validate_modules(struct lyd_node **node, const struct lys_module **modules, int mod_count, int options,...)
Validate node data tree but only subtrees that belong to the schema found in modules. All other schemas are effectively disabled for the validation.
struct lyd_node * lyd_dup_to_ctx(const struct lyd_node *node, int options, struct ly_ctx *ctx)
Create a copy of the specified data tree node in the different context. All the schema references and...
int lyd_find_sibling_set(const struct lyd_node *siblings, const struct lyd_node *target, struct ly_set **set)
Search in the given siblings for all target instances. If cache is enabled and the siblings are NOT t...
const char * value_str
Definition: tree_data.h:133
int lyd_find_sibling_val(const struct lyd_node *siblings, const struct lys_node *schema, const char *key_or_value, struct lyd_node **match)
Search in the given siblings for the schema instance. If cache is enabled and the siblings are NOT to...
int8_t bln
Definition: tree_data.h:98
struct lys_node * schema
Definition: tree_data.h:225
int lyd_validate(struct lyd_node **node, int options, void *var_arg,...)
Validate node data subtree.
uint8_t when_status
Definition: tree_data.h:229
struct lyd_attr * lyd_insert_attr(struct lyd_node *parent, const struct lys_module *mod, const char *name, const char *value)
Insert attribute into the data node.
int lyd_value_type(struct lys_node *node, const char *value, struct lys_type **type)
Check restrictions applicable to the particular leaf/leaf-list on the given string value and optional...
void lyd_free_attr(struct ly_ctx *ctx, struct lyd_node *parent, struct lyd_attr *attr, int recursive)
Destroy data attribute.
int64_t dec64
Definition: tree_data.h:99
struct lyd_attr * attr
Definition: tree_data.h:232
struct lys_ext_instance_complex * annotation
Definition: tree_data.h:131
struct lys_module * lyd_node_module(const struct lyd_node *node)
Return main module of the data tree node.
uint16_t uint16
Definition: tree_data.h:112
struct lyd_node * lyd_dup_withsiblings(const struct lyd_node *node, int options)
Create a copy of the specified data tree and all its siblings (preceding as well as following)...
node&#39;s value representation
Definition: tree_data.h:94
int lyd_print_fd(int fd, const struct lyd_node *root, LYD_FORMAT format, int options)
Print data tree in the specified format.
struct lyd_node * parent
Definition: tree_data.h:129
libyang representation of data model trees.
int lyd_wd_default(struct lyd_node_leaf_list *node)
Get know if the node contain (despite implicit or explicit) default value.
uint64_t uint64
Definition: tree_data.h:114
lyd_anydata_value value
Definition: tree_data.h:315
int lyd_insert(struct lyd_node *parent, struct lyd_node *node)
Insert the node element as child to the parent element. The node is inserted as a last child of the p...
void lyd_free(struct lyd_node *node)
Free (and unlink) the specified data subtree. Use carefully, since libyang silently creates default n...
LY_DATA_TYPE _PACKED value_type
Definition: tree_data.h:135
struct lyd_node * lyd_parse_xml(struct ly_ctx *ctx, struct lyxml_elem **root, int options,...)
Parse (and validate) XML tree.
Single enumeration value specification for lys_type_info_enums.
Definition: tree_schema.h:867
int lyd_node_should_print(const struct lyd_node *node, int options)
Learn if a node is supposed to be printed based on the options.
int64_t int64
Definition: tree_data.h:108
struct lyd_node * lyd_new_output(struct lyd_node *parent, const struct lys_module *module, const char *name)
Create a new container node in a data tree. Ignore RPC/action input nodes and instead use RPC/action ...
const char * string
Definition: tree_data.h:110
uint8_t uint8
Definition: tree_data.h:111
void lyd_free_diff(struct lyd_difflist *diff)
Free the result of lyd_diff(). It frees the structure of the lyd_diff() result, not the referenced no...
LYD_FORMAT
Data input/output formats supported by libyang parser and printer functions.
Definition: tree_data.h:40
int8_t int8
Definition: tree_data.h:105
struct lys_type_bit ** bit
Definition: tree_data.h:96
int16_t int16
Definition: tree_data.h:106
struct lyd_node * lyd_parse_path(struct ly_ctx *ctx, const char *path, LYD_FORMAT format, int options,...)
Read (and validate) data from the given file path.
struct lyd_difflist * lyd_diff(struct lyd_node *first, struct lyd_node *second, int options)
Compare two data trees and provide list of differences.
unsigned int lyd_list_pos(const struct lyd_node *node)
Learn the relative instance position of a list or leaf-list within other instances of the same schema...
int lyd_schema_sort(struct lyd_node *sibling, int recursive)
Order siblings according to the schema node ordering.
Public API of libyang XML parser.
int lyd_find_sibling(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match)
Search in the given siblings for the target instance. If cache is enabled and the siblings are NOT to...
int lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node)
Insert the node element after the sibling element. If node and siblings are already siblings (just mo...
struct lyd_node * lyd_new_output_leaf(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str)
Create a new leaf or leaflist node in a data tree with a string value that is converted to the actual...
Structure describing an element in an XML tree.
Definition: xml.h:92
Structure for data nodes defined as LYS_LEAF or LYS_LEAFLIST.
Definition: tree_data.h:224
struct lyd_node * leafref
Definition: tree_data.h:109
Attribute structure.
Definition: tree_data.h:128
int lyd_insert_sibling(struct lyd_node **sibling, struct lyd_node *node)
Insert the node element as a last sibling of the specified sibling element.
Anydata value union.
Definition: tree_data.h:271
struct lyd_node * lyd_new_leaf(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str)
Create a new leaf or leaflist node in a data tree with a string value that is converted to the actual...
double lyd_dec64_to_double(const struct lyd_node *node)
Get the double value of a decimal64 leaf/leaf-list.
struct lyd_node * child
Definition: tree_data.h:207
struct lyd_node ** second
Definition: tree_data.h:368
struct lys_ident * ident
Definition: tree_data.h:101
int lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node)
Insert the node element after the sibling element. If node and siblings are already siblings (just mo...
Structure for the result of lyd_diff(), describing differences between two data trees.
Definition: tree_data.h:364
Main schema node structure representing YANG module.
Definition: tree_schema.h:673
int lyd_print_mem(char **strp, const struct lyd_node *root, LYD_FORMAT format, int options)
Print data tree in the specified format.
lyd_val value
Definition: tree_data.h:134
Complex extension instance structure.
Definition: tree_schema.h:505
struct ly_set * lyd_find_instance(const struct lyd_node *data, const struct lys_node *schema)
Search in the given data for instances of the provided schema node.
struct lyd_node * lyd_first_sibling(struct lyd_node *node)
Get the first sibling of the given node.
LYD_DIFFTYPE
list of possible types of differences in lyd_difflist
Definition: tree_data.h:321
struct lyd_node * lyd_new_yangdata(const struct lys_module *module, const char *name_template, const char *name)
Create a new yang-data template in a data tree. It creates container, which name is in third paramete...
LY_DATA_TYPE
YANG built-in types.
Definition: tree_schema.h:791
void lyd_free_val_diff(struct lyd_difflist *diff)
Free special diff that was returned by lyd_validate() or lyd_validate_modules().
struct lyd_node * instance
Definition: tree_data.h:102
YANG type structure providing information from the schema.
Definition: tree_schema.h:980
int32_t int32
Definition: tree_data.h:107
struct lyd_node ** first
Definition: tree_data.h:366
struct ly_set * lyd_find_path(const struct lyd_node *ctx_node, const char *path)
Search in the given data for instances of nodes matching the provided path.
Structure to hold information about identity, see RFC 6020 sec. 7.16
Definition: tree_schema.h:2102
struct lyd_node * lyd_new_output_anydata(struct lyd_node *parent, const struct lys_module *module, const char *name, void *value, LYD_ANYDATA_VALUETYPE value_type)
Create a new anydata or anyxml node in a data tree. Ignore RPC/action input nodes and instead use RPC...
struct lyd_node * lyd_new(struct lyd_node *parent, const struct lys_module *module, const char *name)
Create a new container node in a data tree.
int lyd_validate_value(struct lys_node *node, const char *value)
Check restrictions applicable to the particular leaf/leaf-list on the given string value...
union lyd_value_u lyd_val
node&#39;s value representation
Generic structure for a data node, directly applicable to the data nodes defined as LYS_CONTAINER...
Definition: tree_data.h:183
struct lyd_attr * next
Definition: tree_data.h:130
int lyd_print_path(const char *path, const struct lyd_node *root, LYD_FORMAT format, int options)
Print data tree in the specified format.
const char * binary
Definition: tree_data.h:95
LYD_ANYDATA_VALUETYPE
List of possible value types stored in lyd_node_anydata.
Definition: tree_data.h:50
LYD_ANYDATA_VALUETYPE value_type
Definition: tree_data.h:314
int lyd_unlink(struct lyd_node *node)
Unlink the specified data subtree. All referenced namespaces are copied.
struct lys_type * lyd_leaf_type(const struct lyd_node_leaf_list *leaf)
Get the type structure of a leaf.
int lyd_change_leaf(struct lyd_node_leaf_list *leaf, const char *val_str)
Change value of a leaf node.
void lyd_free_withsiblings(struct lyd_node *node)
Free (and unlink) the specified data tree and all its siblings (preceding as well as following)...
int lyd_print_file(FILE *f, const struct lyd_node *root, LYD_FORMAT format, int options)
Print data tree in the specified format.
int lyd_merge(struct lyd_node *target, const struct lyd_node *source, int options)
Merge a (sub)tree into a data tree.
struct lyd_node * prev
Definition: tree_data.h:192
uint8_t value_flags
Definition: tree_data.h:136
Structure for data nodes defined as LYS_ANYDATA or LYS_ANYXML.
Definition: tree_data.h:287
Single bit value specification for lys_type_info_bits.
Definition: tree_schema.h:827
int lyd_merge_to_ctx(struct lyd_node **trg, const struct lyd_node *src, int options, struct ly_ctx *ctx)
Same as lyd_merge(), but moves the resulting data into the specified context.
LYD_DIFFTYPE * type
Definition: tree_data.h:365
int lyd_lyb_data_length(const char *data)
Get the length of a printed LYB data tree.
struct lys_type_enum * enm
Definition: tree_data.h:100