Searched refs:aug_parent (Results 1 – 2 of 2) sorted by relevance
| /dports/net/libyang/libyang-1.0.240/src/ |
| H A D | printer_tree.c | 52 const struct lys_node *aug_parent, int subtree, tp_opts *opts);
75 const struct lys_node *aug_parent, LYS_NODE nodetype) in tree_sibling_is_valid_child() argument
79 assert(!aug_parent || (aug_parent->nodetype == LYS_AUGMENT)); in tree_sibling_is_valid_child()
90 if (aug_parent && (cur->parent != aug_parent)) { in tree_sibling_is_valid_child()
152 tree_next_indent(int level, const struct lys_node *node, const struct lys_node *aug_parent, tp_opts… in tree_next_indent() argument
173 has_next = tree_sibling_is_valid_child(node, 0, opts->module, aug_parent, node->nodetype); in tree_next_indent()
182 tree_get_max_name_len(const struct lys_node *sibling, const struct lys_node *aug_parent, int type_m… in tree_get_max_name_len() argument
194 if (aug_parent && (sub->parent != aug_parent)) { in tree_get_max_name_len()
503 const struct lys_node *aug_parent, int subtree, tp_opts *opts) in tree_print_snode() argument
597 tree_next_indent(level, node, aug_parent, opts); in tree_print_snode()
|
| H A D | tree_schema.c | 266 const struct lys_node *next, *aug_parent; in lys_getnext() local
305 aug_parent = next->parent; in lys_getnext()
307 while (aug_parent && (aug_parent->nodetype != LYS_AUGMENT)) { in lys_getnext()
308 aug_parent = aug_parent->parent; in lys_getnext()
310 if (aug_parent) { in lys_getnext()
311 if (aug_parent == parent) { in lys_getnext()
314 aug_parent = ((struct lys_node_augment *)aug_parent)->target; in lys_getnext()
317 } while (aug_parent); in lys_getnext()
318 if (!aug_parent) { in lys_getnext()
|