blob: fa983ef50e6731f4e86ec230fbbd2564a0a986e6 [file] [log] [blame]
Michal Vasko60ea6352020-06-29 13:39:39 +02001/**
2 * @file printer_lyb.c
3 * @author Michal Vasko <mvasko@cesnet.cz>
4 * @brief LYB printer for libyang data structure
5 *
6 * Copyright (c) 2020 CESNET, z.s.p.o.
7 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
14
15#include "lyb.h"
16
17#include <assert.h>
Michal Vasko60ea6352020-06-29 13:39:39 +020018#include <stdint.h>
Michal Vasko69730152020-10-09 16:30:07 +020019#include <stdio.h>
Michal Vasko60ea6352020-06-29 13:39:39 +020020#include <stdlib.h>
21#include <string.h>
22
23#include "common.h"
24#include "compat.h"
Radek Krejciad97c5f2020-06-30 09:19:28 +020025#include "context.h"
26#include "hash_table.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020027#include "log.h"
Radek Krejci47fab892020-11-05 17:02:41 +010028#include "out.h"
Michal Vaskoafac7822020-10-20 14:22:26 +020029#include "out_internal.h"
Radek Krejciad97c5f2020-06-30 09:19:28 +020030#include "printer_data.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020031#include "printer_internal.h"
Radek Krejciad97c5f2020-06-30 09:19:28 +020032#include "set.h"
33#include "tree.h"
Radek Krejci47fab892020-11-05 17:02:41 +010034#include "tree_data.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020035#include "tree_data_internal.h"
Radek Krejci859a15a2021-03-05 20:56:59 +010036#include "tree_edit.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020037#include "tree_schema.h"
38#include "tree_schema_internal.h"
Michal Vasko6b5cb2a2020-11-11 19:11:21 +010039#include "xml.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020040
41/**
42 * @brief Hash table equal callback for checking hash equality only.
Radek Krejci857189e2020-09-01 13:26:36 +020043 *
Michal Vasko62524a92021-02-26 10:08:50 +010044 * Implementation of ::lyht_value_equal_cb.
Michal Vasko60ea6352020-06-29 13:39:39 +020045 */
Radek Krejci857189e2020-09-01 13:26:36 +020046static ly_bool
47lyb_hash_equal_cb(void *UNUSED(val1_p), void *UNUSED(val2_p), ly_bool UNUSED(mod), void *UNUSED(cb_data))
Michal Vasko60ea6352020-06-29 13:39:39 +020048{
49 /* for this purpose, if hash matches, the value does also, we do not want 2 values to have the same hash */
50 return 1;
51}
52
53/**
54 * @brief Hash table equal callback for checking value pointer equality only.
Radek Krejci857189e2020-09-01 13:26:36 +020055 *
Michal Vasko62524a92021-02-26 10:08:50 +010056 * Implementation of ::lyht_value_equal_cb.
Michal Vasko60ea6352020-06-29 13:39:39 +020057 */
Radek Krejci857189e2020-09-01 13:26:36 +020058static ly_bool
59lyb_ptr_equal_cb(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *UNUSED(cb_data))
Michal Vasko60ea6352020-06-29 13:39:39 +020060{
61 struct lysc_node *val1 = *(struct lysc_node **)val1_p;
62 struct lysc_node *val2 = *(struct lysc_node **)val2_p;
63
64 if (val1 == val2) {
65 return 1;
66 }
67 return 0;
68}
69
70/**
71 * @brief Check that sibling collision hash is safe to insert into hash table.
72 *
73 * @param[in] ht Hash table.
74 * @param[in] sibling Hashed sibling.
75 * @param[in] ht_col_id Sibling hash collision ID.
76 * @param[in] compare_col_id Last collision ID to compare with.
77 * @return LY_SUCCESS when the whole hash sequence does not collide,
78 * @return LY_EEXIST when the whole hash sequence sollides.
79 */
80static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +020081lyb_hash_sequence_check(struct hash_table *ht, struct lysc_node *sibling, LYB_HASH ht_col_id, LYB_HASH compare_col_id)
Michal Vasko60ea6352020-06-29 13:39:39 +020082{
Michal Vasko60ea6352020-06-29 13:39:39 +020083 struct lysc_node **col_node;
84
85 /* get the first node inserted with last hash col ID ht_col_id */
Michal Vasko11f76c82021-04-15 14:36:14 +020086 if (lyht_find(ht, &sibling, lyb_get_hash(sibling, ht_col_id), (void **)&col_node)) {
Michal Vasko60ea6352020-06-29 13:39:39 +020087 /* there is none. valid situation */
88 return LY_SUCCESS;
89 }
90
91 lyht_set_cb(ht, lyb_ptr_equal_cb);
92 do {
Radek Krejci1deb5be2020-08-26 16:43:36 +020093 int64_t j;
94 for (j = (int64_t)compare_col_id; j > -1; --j) {
Michal Vasko11f76c82021-04-15 14:36:14 +020095 if (lyb_get_hash(sibling, j) != lyb_get_hash(*col_node, j)) {
Michal Vasko60ea6352020-06-29 13:39:39 +020096 /* one non-colliding hash */
97 break;
98 }
99 }
100 if (j == -1) {
101 /* all whole hash sequences of nodes inserted with last hash col ID compare_col_id collide */
102 lyht_set_cb(ht, lyb_hash_equal_cb);
103 return LY_EEXIST;
104 }
105
106 /* get next node inserted with last hash col ID ht_col_id */
Michal Vasko11f76c82021-04-15 14:36:14 +0200107 } while (!lyht_find_next(ht, col_node, lyb_get_hash(*col_node, ht_col_id), (void **)&col_node));
Michal Vasko60ea6352020-06-29 13:39:39 +0200108
109 lyht_set_cb(ht, lyb_hash_equal_cb);
110 return LY_SUCCESS;
111}
112
113/**
114 * @brief Hash all the siblings and add them also into a separate hash table.
115 *
116 * @param[in] sibling Any sibling in all the siblings on one level.
117 * @param[out] ht_p Created hash table.
118 * @return LY_ERR value.
119 */
120static LY_ERR
121lyb_hash_siblings(struct lysc_node *sibling, struct hash_table **ht_p)
122{
123 struct hash_table *ht;
124 const struct lysc_node *parent;
125 const struct lys_module *mod;
Radek Krejci1deb5be2020-08-26 16:43:36 +0200126 LYB_HASH i;
Michal Vasko1e0a80a2020-12-09 18:12:51 +0100127 uint32_t getnext_opts;
Michal Vasko60ea6352020-06-29 13:39:39 +0200128
129 ht = lyht_new(1, sizeof(struct lysc_node *), lyb_hash_equal_cb, NULL, 1);
130 LY_CHECK_ERR_RET(!ht, LOGMEM(sibling->module->ctx), LY_EMEM);
131
Michal Vasko1e0a80a2020-12-09 18:12:51 +0100132 getnext_opts = 0;
Michal Vaskod1e53b92021-01-28 13:11:06 +0100133 if (sibling->flags & LYS_IS_OUTPUT) {
Michal Vasko1e0a80a2020-12-09 18:12:51 +0100134 getnext_opts = LYS_GETNEXT_OUTPUT;
135 }
136
Michal Vasko60ea6352020-06-29 13:39:39 +0200137 parent = lysc_data_parent(sibling);
138 mod = sibling->module;
139
140 sibling = NULL;
Michal Vasko1e0a80a2020-12-09 18:12:51 +0100141 while ((sibling = (struct lysc_node *)lys_getnext(sibling, parent, mod->compiled, getnext_opts))) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200142 /* find the first non-colliding hash (or specifically non-colliding hash sequence) */
143 for (i = 0; i < LYB_HASH_BITS; ++i) {
144 /* check that we are not colliding with nodes inserted with a lower collision ID than ours */
Radek Krejci1deb5be2020-08-26 16:43:36 +0200145 int64_t j;
146 for (j = (int64_t)i - 1; j > -1; --j) {
147 if (lyb_hash_sequence_check(ht, sibling, (LYB_HASH)j, i)) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200148 break;
149 }
150 }
151 if (j > -1) {
152 /* some check failed, we must use a higher collision ID */
153 continue;
154 }
155
156 /* try to insert node with the current collision ID */
Michal Vasko11f76c82021-04-15 14:36:14 +0200157 if (!lyht_insert_with_resize_cb(ht, &sibling, lyb_get_hash(sibling, i), lyb_ptr_equal_cb, NULL)) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200158 /* success, no collision */
159 break;
160 }
161
162 /* make sure we really cannot insert it with this hash col ID (meaning the whole hash sequence is colliding) */
163 if (i && !lyb_hash_sequence_check(ht, sibling, i, i)) {
164 /* it can be inserted after all, even though there is already a node with the same last collision ID */
165 lyht_set_cb(ht, lyb_ptr_equal_cb);
Michal Vasko11f76c82021-04-15 14:36:14 +0200166 if (lyht_insert(ht, &sibling, lyb_get_hash(sibling, i), NULL)) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200167 LOGINT(sibling->module->ctx);
168 lyht_set_cb(ht, lyb_hash_equal_cb);
169 lyht_free(ht);
170 return LY_EINT;
171 }
172 lyht_set_cb(ht, lyb_hash_equal_cb);
173 break;
174 }
175 /* there is still another colliding schema node with the same hash sequence, try higher collision ID */
176 }
177
178 if (i == LYB_HASH_BITS) {
179 /* wow */
180 LOGINT(sibling->module->ctx);
181 lyht_free(ht);
182 return LY_EINT;
183 }
184 }
185
186 /* change val equal callback so that the HT is usable for finding value hashes */
187 lyht_set_cb(ht, lyb_ptr_equal_cb);
188
189 *ht_p = ht;
190 return LY_SUCCESS;
191}
192
193/**
194 * @brief Find node hash in a hash table.
195 *
196 * @param[in] ht Hash table to search in.
197 * @param[in] node Node to find.
198 * @param[out] hash_p First non-colliding hash found.
199 * @return LY_ERR value.
200 */
201static LY_ERR
202lyb_hash_find(struct hash_table *ht, struct lysc_node *node, LYB_HASH *hash_p)
203{
204 LYB_HASH hash;
205 uint32_t i;
206
207 for (i = 0; i < LYB_HASH_BITS; ++i) {
Michal Vasko11f76c82021-04-15 14:36:14 +0200208 hash = lyb_get_hash(node, i);
Michal Vasko60ea6352020-06-29 13:39:39 +0200209 if (!hash) {
210 LOGINT_RET(node->module->ctx);
211 }
212
213 if (!lyht_find(ht, &node, hash, NULL)) {
214 /* success, no collision */
215 break;
216 }
217 }
218 /* cannot happen, we already calculated the hash */
219 if (i == LYB_HASH_BITS) {
220 LOGINT_RET(node->module->ctx);
221 }
222
223 *hash_p = hash;
224 return LY_SUCCESS;
225}
226
227/**
228 * @brief Write LYB data fully handling the metadata.
229 *
230 * @param[in] out Out structure.
231 * @param[in] buf Source buffer.
232 * @param[in] count Number of bytes to write.
233 * @param[in] lybctx LYB context.
234 * @return LY_ERR value.
235 */
236static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200237lyb_write(struct ly_out *out, const uint8_t *buf, size_t count, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200238{
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200239 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200240 struct lyd_lyb_subtree *full, *iter;
Michal Vasko5233e962020-08-14 14:26:20 +0200241 size_t to_write;
Michal Vasko60ea6352020-06-29 13:39:39 +0200242 uint8_t meta_buf[LYB_META_BYTES];
243
244 while (1) {
245 /* check for full data chunks */
246 to_write = count;
247 full = NULL;
248 LY_ARRAY_FOR(lybctx->subtrees, u) {
249 /* we want the innermost chunks resolved first, so replace previous full chunks */
250 if (lybctx->subtrees[u].written + to_write >= LYB_SIZE_MAX) {
251 /* full chunk, do not write more than allowed */
252 to_write = LYB_SIZE_MAX - lybctx->subtrees[u].written;
253 full = &lybctx->subtrees[u];
254 }
255 }
256
257 if (!full && !count) {
258 break;
259 }
260
261 /* we are actually writing some data, not just finishing another chunk */
262 if (to_write) {
Michal Vasko5233e962020-08-14 14:26:20 +0200263 LY_CHECK_RET(ly_write_(out, (char *)buf, to_write));
Michal Vasko60ea6352020-06-29 13:39:39 +0200264
265 LY_ARRAY_FOR(lybctx->subtrees, u) {
266 /* increase all written counters */
Michal Vasko5233e962020-08-14 14:26:20 +0200267 lybctx->subtrees[u].written += to_write;
Michal Vasko60ea6352020-06-29 13:39:39 +0200268 assert(lybctx->subtrees[u].written <= LYB_SIZE_MAX);
269 }
270 /* decrease count/buf */
Michal Vasko5233e962020-08-14 14:26:20 +0200271 count -= to_write;
272 buf += to_write;
Michal Vasko60ea6352020-06-29 13:39:39 +0200273 }
274
275 if (full) {
276 /* write the meta information (inner chunk count and chunk size) */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100277 meta_buf[0] = full->written & LYB_BYTE_MASK;
278 meta_buf[1] = full->inner_chunks & LYB_BYTE_MASK;
Michal Vasko5233e962020-08-14 14:26:20 +0200279 LY_CHECK_RET(ly_write_skipped(out, full->position, (char *)meta_buf, LYB_META_BYTES));
Michal Vasko60ea6352020-06-29 13:39:39 +0200280
281 /* zero written and inner chunks */
282 full->written = 0;
283 full->inner_chunks = 0;
284
285 /* skip space for another chunk size */
Michal Vasko5233e962020-08-14 14:26:20 +0200286 LY_CHECK_RET(ly_write_skip(out, LYB_META_BYTES, &full->position));
Michal Vasko60ea6352020-06-29 13:39:39 +0200287
288 /* increase inner chunk count */
289 for (iter = &lybctx->subtrees[0]; iter != full; ++iter) {
290 if (iter->inner_chunks == LYB_INCHUNK_MAX) {
291 LOGINT(lybctx->ctx);
292 return LY_EINT;
293 }
294 ++iter->inner_chunks;
295 }
296 }
297 }
298
299 return LY_SUCCESS;
300}
301
302/**
303 * @brief Stop the current subtree - write its final metadata.
304 *
305 * @param[in] out Out structure.
306 * @param[in] lybctx LYB context.
307 * @return LY_ERR value.
308 */
309static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200310lyb_write_stop_subtree(struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200311{
Michal Vasko60ea6352020-06-29 13:39:39 +0200312 uint8_t meta_buf[LYB_META_BYTES];
313
314 /* write the meta chunk information */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100315 meta_buf[0] = LYB_LAST_SUBTREE(lybctx).written & LYB_BYTE_MASK;
316 meta_buf[1] = LYB_LAST_SUBTREE(lybctx).inner_chunks & LYB_BYTE_MASK;
Michal Vasko5233e962020-08-14 14:26:20 +0200317 LY_CHECK_RET(ly_write_skipped(out, LYB_LAST_SUBTREE(lybctx).position, (char *)&meta_buf, LYB_META_BYTES));
Michal Vasko60ea6352020-06-29 13:39:39 +0200318
319 LY_ARRAY_DECREMENT(lybctx->subtrees);
320 return LY_SUCCESS;
321}
322
323/**
324 * @brief Start a new subtree - skip bytes for its metadata.
325 *
326 * @param[in] out Out structure.
327 * @param[in] lybctx LYB context.
328 * @return LY_ERR value.
329 */
330static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200331lyb_write_start_subtree(struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200332{
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200333 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200334
Radek Krejcic7d13e32020-12-09 12:32:24 +0100335 u = LY_ARRAY_COUNT(lybctx->subtrees);
Michal Vasko60ea6352020-06-29 13:39:39 +0200336 if (u == lybctx->subtree_size) {
337 LY_ARRAY_CREATE_RET(lybctx->ctx, lybctx->subtrees, u + LYB_SUBTREE_STEP, LY_EMEM);
338 lybctx->subtree_size = u + LYB_SUBTREE_STEP;
339 }
340
341 LY_ARRAY_INCREMENT(lybctx->subtrees);
342 LYB_LAST_SUBTREE(lybctx).written = 0;
343 LYB_LAST_SUBTREE(lybctx).inner_chunks = 0;
344
345 /* another inner chunk */
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200346 for (u = 0; u < LY_ARRAY_COUNT(lybctx->subtrees) - 1; ++u) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200347 if (lybctx->subtrees[u].inner_chunks == LYB_INCHUNK_MAX) {
348 LOGINT(lybctx->ctx);
Michal Vasko5233e962020-08-14 14:26:20 +0200349 return LY_EINT;
Michal Vasko60ea6352020-06-29 13:39:39 +0200350 }
351 ++lybctx->subtrees[u].inner_chunks;
352 }
353
Michal Vasko5233e962020-08-14 14:26:20 +0200354 LY_CHECK_RET(ly_write_skip(out, LYB_META_BYTES, &LYB_LAST_SUBTREE(lybctx).position));
Michal Vasko60ea6352020-06-29 13:39:39 +0200355
356 return LY_SUCCESS;
357}
358
359/**
360 * @brief Write a number.
361 *
362 * @param[in] num Number to write.
363 * @param[in] bytes Actual accessible bytes of @p num.
364 * @param[in] out Out structure.
365 * @param[in] lybctx LYB context.
366 * @return LY_ERR value.
367 */
368static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200369lyb_write_number(uint64_t num, size_t bytes, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200370{
371 /* correct byte order */
372 num = htole64(num);
373
374 return lyb_write(out, (uint8_t *)&num, bytes, lybctx);
375}
376
377/**
378 * @brief Write a string.
379 *
380 * @param[in] str String to write.
381 * @param[in] str_len Length of @p str.
382 * @param[in] with_length Whether to precede the string with its length.
383 * @param[in] out Out structure.
384 * @param[in] lybctx LYB context.
385 * @return LY_ERR value.
386 */
387static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +0200388lyb_write_string(const char *str, size_t str_len, ly_bool with_length, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200389{
Michal Vasko60ea6352020-06-29 13:39:39 +0200390 if (!str) {
391 str = "";
Michal Vasko30667352020-08-13 09:06:14 +0200392 LY_CHECK_ERR_RET(str_len, LOGINT(lybctx->ctx), LY_EINT);
Michal Vasko60ea6352020-06-29 13:39:39 +0200393 }
394 if (!str_len) {
395 str_len = strlen(str);
396 }
397
398 if (with_length) {
399 /* print length on 2 bytes */
400 if (str_len > UINT16_MAX) {
401 LOGINT(lybctx->ctx);
402 return LY_EINT;
403 }
404 LY_CHECK_RET(lyb_write_number(str_len, 2, out, lybctx));
405 }
406
Michal Vasko63f3d842020-07-08 10:10:14 +0200407 LY_CHECK_RET(lyb_write(out, (const uint8_t *)str, str_len, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200408
409 return LY_SUCCESS;
410}
411
412/**
413 * @brief Print YANG module info.
414 *
415 * @param[in] out Out structure.
416 * @param[in] mod Module to print.
417 * @param[in] lybctx LYB context.
418 * @return LY_ERR value.
419 */
420static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200421lyb_print_model(struct ly_out *out, const struct lys_module *mod, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200422{
Michal Vasko60ea6352020-06-29 13:39:39 +0200423 uint16_t revision;
424
425 /* model name length and model name */
426 if (mod) {
427 LY_CHECK_RET(lyb_write_string(mod->name, 0, 1, out, lybctx));
428 } else {
429 LY_CHECK_RET(lyb_write_string("", 0, 1, out, lybctx));
430 }
431
432 /* model revision as XXXX XXXX XXXX XXXX (2B) (year is offset from 2000)
433 * YYYY YYYM MMMD DDDD */
434 revision = 0;
435 if (mod && mod->revision) {
Radek Krejci1deb5be2020-08-26 16:43:36 +0200436 int r = atoi(mod->revision);
Radek Krejcif13b87b2020-12-01 22:02:17 +0100437 r -= LYB_REV_YEAR_OFFSET;
438 r <<= LYB_REV_YEAR_SHIFT;
Michal Vasko60ea6352020-06-29 13:39:39 +0200439
440 revision |= r;
441
Radek Krejcif13b87b2020-12-01 22:02:17 +0100442 r = atoi(mod->revision + ly_strlen_const("YYYY-"));
443 r <<= LYB_REV_MONTH_SHIFT;
Michal Vasko60ea6352020-06-29 13:39:39 +0200444
445 revision |= r;
446
Radek Krejcif13b87b2020-12-01 22:02:17 +0100447 r = atoi(mod->revision + ly_strlen_const("YYYY-MM-"));
Michal Vasko60ea6352020-06-29 13:39:39 +0200448
449 revision |= r;
450 }
451 LY_CHECK_RET(lyb_write_number(revision, sizeof revision, out, lybctx));
452
Michal Vasko11f76c82021-04-15 14:36:14 +0200453 if (mod) {
454 /* fill cached hashes, if not already */
455 lyb_cache_module_hash(mod);
456 }
457
Michal Vasko60ea6352020-06-29 13:39:39 +0200458 return LY_SUCCESS;
459}
460
461/**
462 * @brief Print all used YANG modules.
463 *
464 * @param[in] out Out structure.
465 * @param[in] root Data root.
466 * @param[in] lybctx LYB context.
467 * @return LY_ERR value.
468 */
469static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200470lyb_print_data_models(struct ly_out *out, const struct lyd_node *root, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200471{
472 struct ly_set *set;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200473 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200474 LY_ERR ret = LY_SUCCESS;
475 struct lys_module *mod;
476 const struct lyd_node *node;
477 uint32_t i;
478
Radek Krejciba03a5a2020-08-27 14:40:41 +0200479 LY_CHECK_RET(ly_set_new(&set));
Michal Vasko60ea6352020-06-29 13:39:39 +0200480
481 /* collect all data node modules */
482 LY_LIST_FOR(root, node) {
483 if (!node->schema) {
484 continue;
485 }
486
487 mod = node->schema->module;
Radek Krejciba03a5a2020-08-27 14:40:41 +0200488 ret = ly_set_add(set, mod, 0, NULL);
489 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200490
491 /* add also their modules deviating or augmenting them */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200492 LY_ARRAY_FOR(mod->deviated_by, u) {
493 ret = ly_set_add(set, mod->deviated_by[u], 0, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +0200494 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200495 }
Michal Vasko7f45cf22020-10-01 12:49:44 +0200496 LY_ARRAY_FOR(mod->augmented_by, u) {
497 ret = ly_set_add(set, mod->augmented_by[u], 0, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +0200498 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200499 }
500 }
501
502 /* now write module count on 2 bytes */
503 LY_CHECK_GOTO(ret = lyb_write_number(set->count, 2, out, lybctx), cleanup);
504
505 /* and all the used models */
506 for (i = 0; i < set->count; ++i) {
507 LY_CHECK_GOTO(ret = lyb_print_model(out, set->objs[i], lybctx), cleanup);
508 }
509
510cleanup:
511 ly_set_free(set, NULL);
512 return ret;
513}
514
515/**
516 * @brief Print LYB magic number.
517 *
518 * @param[in] out Out structure.
Michal Vasko60ea6352020-06-29 13:39:39 +0200519 * @return LY_ERR value.
520 */
521static LY_ERR
Michal Vasko63f3d842020-07-08 10:10:14 +0200522lyb_print_magic_number(struct ly_out *out)
Michal Vasko60ea6352020-06-29 13:39:39 +0200523{
Michal Vasko60ea6352020-06-29 13:39:39 +0200524 /* 'l', 'y', 'b' - 0x6c7962 */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100525 char magic_number[] = {'l', 'y', 'b'};
Michal Vasko60ea6352020-06-29 13:39:39 +0200526
Radek Krejcidefd4d72020-12-01 12:20:30 +0100527 LY_CHECK_RET(ly_write_(out, magic_number, 3));
Michal Vasko60ea6352020-06-29 13:39:39 +0200528
529 return LY_SUCCESS;
530}
531
532/**
533 * @brief Print LYB header.
534 *
535 * @param[in] out Out structure.
Michal Vasko60ea6352020-06-29 13:39:39 +0200536 * @return LY_ERR value.
537 */
538static LY_ERR
Michal Vasko63f3d842020-07-08 10:10:14 +0200539lyb_print_header(struct ly_out *out)
Michal Vasko60ea6352020-06-29 13:39:39 +0200540{
Michal Vasko60ea6352020-06-29 13:39:39 +0200541 uint8_t byte = 0;
542
543 /* version, future flags */
544 byte |= LYB_VERSION_NUM;
545
Michal Vasko5233e962020-08-14 14:26:20 +0200546 LY_CHECK_RET(ly_write_(out, (char *)&byte, 1));
Michal Vasko60ea6352020-06-29 13:39:39 +0200547
548 return LY_SUCCESS;
549}
550
551/**
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100552 * @brief Print prefix data.
Michal Vasko60ea6352020-06-29 13:39:39 +0200553 *
554 * @param[in] out Out structure.
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100555 * @param[in] format Value prefix format.
Radek Krejci8df109d2021-04-23 12:19:08 +0200556 * @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
Michal Vasko60ea6352020-06-29 13:39:39 +0200557 * @param[in] lybctx LYB context.
558 * @return LY_ERR value.
559 */
560static LY_ERR
Radek Krejci8df109d2021-04-23 12:19:08 +0200561lyb_print_prefix_data(struct ly_out *out, LY_VALUE_FORMAT format, const void *prefix_data, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200562{
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100563 const struct ly_set *set;
564 const struct lyxml_ns *ns;
565 uint32_t i;
Michal Vasko60ea6352020-06-29 13:39:39 +0200566
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100567 switch (format) {
Radek Krejci8df109d2021-04-23 12:19:08 +0200568 case LY_VALUE_XML:
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100569 set = prefix_data;
570 if (!set) {
571 /* no prefix data */
572 i = 0;
573 LY_CHECK_RET(lyb_write(out, (uint8_t *)&i, 1, lybctx));
574 break;
575 }
576 if (set->count > UINT8_MAX) {
577 LOGERR(lybctx->ctx, LY_EINT, "Maximum supported number of prefixes is %u.", UINT8_MAX);
578 return LY_EINT;
579 }
Michal Vasko60ea6352020-06-29 13:39:39 +0200580
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100581 /* write number of prefixes on 1 byte */
582 LY_CHECK_RET(lyb_write(out, (uint8_t *)&set->count, 1, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200583
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100584 /* write all the prefixes */
585 for (i = 0; i < set->count; ++i) {
586 ns = set->objs[i];
Michal Vasko60ea6352020-06-29 13:39:39 +0200587
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100588 /* prefix */
589 LY_CHECK_RET(lyb_write_string(ns->prefix, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200590
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100591 /* namespace */
592 LY_CHECK_RET(lyb_write_string(ns->uri, 0, 1, out, lybctx));
593 }
594 break;
Radek Krejci8df109d2021-04-23 12:19:08 +0200595 case LY_VALUE_JSON:
Radek Krejcif9943642021-04-26 10:18:21 +0200596 case LY_VALUE_LYB:
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100597 /* nothing to print */
598 break;
599 default:
600 LOGINT_RET(lybctx->ctx);
Michal Vasko60ea6352020-06-29 13:39:39 +0200601 }
602
603 return LY_SUCCESS;
604}
605
606/**
607 * @brief Print opaque node.
608 *
609 * @param[in] opaq Node to print.
610 * @param[in] out Out structure.
611 * @param[in] lybctx LYB context.
612 * @return LY_ERR value.
613 */
614static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200615lyb_print_opaq(struct lyd_node_opaq *opaq, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200616{
617 /* prefix */
Michal Vaskoad92b672020-11-12 13:11:31 +0100618 LY_CHECK_RET(lyb_write_string(opaq->name.prefix, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200619
Radek Krejci1798aae2020-07-14 13:26:06 +0200620 /* module reference */
Michal Vaskoad92b672020-11-12 13:11:31 +0100621 LY_CHECK_RET(lyb_write_string(opaq->name.module_name, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200622
623 /* name */
Michal Vaskoad92b672020-11-12 13:11:31 +0100624 LY_CHECK_RET(lyb_write_string(opaq->name.name, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200625
Michal Vaskoffc92bf2021-06-21 08:15:14 +0200626 /* value */
627 LY_CHECK_RET(lyb_write_string(opaq->value, 0, 1, out, lybctx));
628
Michal Vasko60ea6352020-06-29 13:39:39 +0200629 /* format */
630 LY_CHECK_RET(lyb_write_number(opaq->format, 1, out, lybctx));
631
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100632 /* value prefixes */
633 LY_CHECK_RET(lyb_print_prefix_data(out, opaq->format, opaq->val_prefix_data, lybctx));
634
Michal Vasko60ea6352020-06-29 13:39:39 +0200635 return LY_SUCCESS;
636}
637
638/**
639 * @brief Print anydata node.
640 *
641 * @param[in] anydata Node to print.
642 * @param[in] out Out structure.
643 * @param[in] lybctx LYB context.
644 * @return LY_ERR value.
645 */
646static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200647lyb_print_anydata(struct lyd_node_any *anydata, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200648{
649 LY_ERR ret = LY_SUCCESS;
650 LYD_ANYDATA_VALUETYPE value_type;
651 int len;
652 char *buf = NULL;
653 const char *str;
654 struct ly_out *out2 = NULL;
655
656 if (anydata->value_type == LYD_ANYDATA_DATATREE) {
657 /* will be printed as a nested LYB data tree */
658 value_type = LYD_ANYDATA_LYB;
659 } else {
660 value_type = anydata->value_type;
661 }
662
663 /* first byte is type */
664 LY_CHECK_GOTO(ret = lyb_write(out, (uint8_t *)&value_type, sizeof value_type, lybctx), cleanup);
665
666 if (anydata->value_type == LYD_ANYDATA_DATATREE) {
667 /* print LYB data tree to memory */
668 LY_CHECK_GOTO(ret = ly_out_new_memory(&buf, 0, &out2), cleanup);
Radek Krejci7931b192020-06-25 17:05:03 +0200669 LY_CHECK_GOTO(ret = lyb_print_data(out2, anydata->value.tree, LYD_PRINT_WITHSIBLINGS), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200670
671 len = lyd_lyb_data_length(buf);
672 assert(len != -1);
673 str = buf;
674 } else if (anydata->value_type == LYD_ANYDATA_LYB) {
675 len = lyd_lyb_data_length(anydata->value.mem);
676 assert(len != -1);
677 str = anydata->value.mem;
678 } else {
679 len = strlen(anydata->value.str);
680 str = anydata->value.str;
681 }
682
683 /* followed by the content */
684 LY_CHECK_GOTO(ret = lyb_write_string(str, (size_t)len, 0, out, lybctx), cleanup);
685
686cleanup:
687 ly_out_free(out2, NULL, 1);
688 return ret;
689}
690
691/**
692 * @brief Print term node.
693 *
694 * @param[in] term Node to print.
695 * @param[in] out Out structure.
696 * @param[in] lybctx LYB context.
697 * @return LY_ERR value.
698 */
699static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200700lyb_print_term(struct lyd_node_term *term, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200701{
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200702 /* print the value */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200703 return lyb_write_string(lyd_get_value(&term->node), 0, 0, out, lybctx);
Michal Vasko60ea6352020-06-29 13:39:39 +0200704}
705
706/**
707 * @brief Print YANG node metadata.
708 *
709 * @param[in] out Out structure.
710 * @param[in] node Data node whose metadata to print.
711 * @param[in] lybctx LYB context.
712 * @return LY_ERR value.
713 */
714static LY_ERR
715lyb_print_metadata(struct ly_out *out, const struct lyd_node *node, struct lyd_lyb_ctx *lybctx)
716{
Michal Vasko60ea6352020-06-29 13:39:39 +0200717 uint8_t count = 0;
718 const struct lys_module *wd_mod = NULL;
719 struct lyd_meta *iter;
Michal Vasko60ea6352020-06-29 13:39:39 +0200720
721 /* with-defaults */
722 if (node->schema->nodetype & LYD_NODE_TERM) {
Radek Krejci7931b192020-06-25 17:05:03 +0200723 if (((node->flags & LYD_DEFAULT) && (lybctx->print_options & (LYD_PRINT_WD_ALL_TAG | LYD_PRINT_WD_IMPL_TAG))) ||
Radek Krejci19611252020-10-04 13:54:53 +0200724 ((lybctx->print_options & LYD_PRINT_WD_ALL_TAG) && lyd_is_default(node))) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200725 /* we have implicit OR explicit default node, print attribute only if context include with-defaults schema */
726 wd_mod = ly_ctx_get_module_latest(node->schema->module->ctx, "ietf-netconf-with-defaults");
727 }
728 }
729
730 /* count metadata */
731 if (wd_mod) {
732 ++count;
733 }
734 for (iter = node->meta; iter; iter = iter->next) {
735 if (count == UINT8_MAX) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200736 LOGERR(lybctx->lybctx->ctx, LY_EINT, "Maximum supported number of data node metadata is %u.", UINT8_MAX);
Michal Vasko60ea6352020-06-29 13:39:39 +0200737 return LY_EINT;
738 }
739 ++count;
740 }
741
742 /* write number of metadata on 1 byte */
Radek Krejci1798aae2020-07-14 13:26:06 +0200743 LY_CHECK_RET(lyb_write(out, &count, 1, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200744
745 if (wd_mod) {
746 /* write the "default" metadata */
Radek Krejci1798aae2020-07-14 13:26:06 +0200747 LY_CHECK_RET(lyb_write_start_subtree(out, lybctx->lybctx));
748 LY_CHECK_RET(lyb_print_model(out, wd_mod, lybctx->lybctx));
749 LY_CHECK_RET(lyb_write_string("default", 0, 1, out, lybctx->lybctx));
750 LY_CHECK_RET(lyb_write_string("true", 0, 0, out, lybctx->lybctx));
751 LY_CHECK_RET(lyb_write_stop_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200752 }
753
754 /* write all the node metadata */
755 LY_LIST_FOR(node->meta, iter) {
756 /* each metadata is a subtree */
Radek Krejci1798aae2020-07-14 13:26:06 +0200757 LY_CHECK_RET(lyb_write_start_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200758
759 /* model */
Radek Krejci1798aae2020-07-14 13:26:06 +0200760 LY_CHECK_RET(lyb_print_model(out, iter->annotation->module, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200761
762 /* annotation name with length */
Radek Krejci1798aae2020-07-14 13:26:06 +0200763 LY_CHECK_RET(lyb_write_string(iter->name, 0, 1, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200764
Michal Vasko60ea6352020-06-29 13:39:39 +0200765 /* metadata value */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200766 LY_CHECK_RET(lyb_write_string(lyd_get_meta_value(iter), 0, 0, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200767
768 /* finish metadata subtree */
Radek Krejci1798aae2020-07-14 13:26:06 +0200769 LY_CHECK_RET(lyb_write_stop_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200770 }
771
772 return LY_SUCCESS;
773}
774
775/**
776 * @brief Print opaque node attributes.
777 *
778 * @param[in] out Out structure.
779 * @param[in] node Opaque node whose attributes to print.
780 * @param[in] lybctx LYB context.
781 * @return LY_ERR value.
782 */
783static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200784lyb_print_attributes(struct ly_out *out, const struct lyd_node_opaq *node, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200785{
786 uint8_t count = 0;
Radek Krejci5536d282020-08-04 23:27:44 +0200787 struct lyd_attr *iter;
Michal Vasko60ea6352020-06-29 13:39:39 +0200788
789 for (iter = node->attr; iter; iter = iter->next) {
790 if (count == UINT8_MAX) {
791 LOGERR(lybctx->ctx, LY_EINT, "Maximum supported number of data node attributes is %u.", UINT8_MAX);
792 return LY_EINT;
793 }
794 ++count;
795 }
796
797 /* write number of attributes on 1 byte */
798 LY_CHECK_RET(lyb_write(out, &count, 1, lybctx));
799
800 /* write all the attributes */
801 LY_LIST_FOR(node->attr, iter) {
802 /* each attribute is a subtree */
803 LY_CHECK_RET(lyb_write_start_subtree(out, lybctx));
804
805 /* prefix */
Michal Vaskoad92b672020-11-12 13:11:31 +0100806 LY_CHECK_RET(lyb_write_string(iter->name.prefix, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200807
808 /* namespace */
Michal Vaskoad92b672020-11-12 13:11:31 +0100809 LY_CHECK_RET(lyb_write_string(iter->name.module_name, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200810
811 /* name */
Michal Vaskoad92b672020-11-12 13:11:31 +0100812 LY_CHECK_RET(lyb_write_string(iter->name.name, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200813
Michal Vasko60ea6352020-06-29 13:39:39 +0200814 /* format */
815 LY_CHECK_RET(lyb_write_number(iter->format, 1, out, lybctx));
816
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100817 /* value prefixes */
818 LY_CHECK_RET(lyb_print_prefix_data(out, iter->format, iter->val_prefix_data, lybctx));
819
Michal Vasko60ea6352020-06-29 13:39:39 +0200820 /* value */
821 LY_CHECK_RET(lyb_write_string(iter->value, 0, 0, out, lybctx));
822
823 /* finish attribute subtree */
824 LY_CHECK_RET(lyb_write_stop_subtree(out, lybctx));
825 }
826
827 return LY_SUCCESS;
828}
829
830/**
831 * @brief Print schema node hash.
832 *
833 * @param[in] out Out structure.
834 * @param[in] schema Schema node whose hash to print.
835 * @param[in,out] sibling_ht Cached hash table for these siblings, created if NULL.
836 * @param[in] lybctx LYB context.
837 * @return LY_ERR value.
838 */
839static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200840lyb_print_schema_hash(struct ly_out *out, struct lysc_node *schema, struct hash_table **sibling_ht, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200841{
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200842 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200843 uint32_t i;
844 LYB_HASH hash;
845 struct lyd_lyb_sib_ht *sib_ht;
846 struct lysc_node *first_sibling;
847
848 if (!schema) {
849 /* opaque node, write empty hash */
850 hash = 0;
851 LY_CHECK_RET(lyb_write(out, &hash, sizeof hash, lybctx));
852 return LY_SUCCESS;
853 }
854
855 /* create whole sibling HT if not already created and saved */
856 if (!*sibling_ht) {
Michal Vasko1e0a80a2020-12-09 18:12:51 +0100857 /* get first schema data sibling */
858 first_sibling = (struct lysc_node *)lys_getnext(NULL, lysc_data_parent(schema), schema->module->compiled,
Michal Vaskod1e53b92021-01-28 13:11:06 +0100859 (schema->flags & LYS_IS_OUTPUT) ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko60ea6352020-06-29 13:39:39 +0200860 LY_ARRAY_FOR(lybctx->sib_hts, u) {
861 if (lybctx->sib_hts[u].first_sibling == first_sibling) {
862 /* we have already created a hash table for these siblings */
863 *sibling_ht = lybctx->sib_hts[u].ht;
864 break;
865 }
866 }
867
868 if (!*sibling_ht) {
869 /* we must create sibling hash table */
870 LY_CHECK_RET(lyb_hash_siblings(first_sibling, sibling_ht));
871
872 /* and save it */
873 LY_ARRAY_NEW_RET(lybctx->ctx, lybctx->sib_hts, sib_ht, LY_EMEM);
874
875 sib_ht->first_sibling = first_sibling;
876 sib_ht->ht = *sibling_ht;
877 }
878 }
879
880 /* get our hash */
881 LY_CHECK_RET(lyb_hash_find(*sibling_ht, schema, &hash));
882
883 /* write the hash */
884 LY_CHECK_RET(lyb_write(out, &hash, sizeof hash, lybctx));
885
886 if (hash & LYB_HASH_COLLISION_ID) {
887 /* no collision for this hash, we are done */
888 return LY_SUCCESS;
889 }
890
891 /* written hash was a collision, write also all the preceding hashes */
Radek Krejci1e008d22020-08-17 11:37:37 +0200892 for (i = 0; !(hash & (LYB_HASH_COLLISION_ID >> i)); ++i) {}
Michal Vasko60ea6352020-06-29 13:39:39 +0200893
Michal Vaskod989ba02020-08-24 10:59:24 +0200894 for ( ; i; --i) {
Michal Vasko11f76c82021-04-15 14:36:14 +0200895 hash = lyb_get_hash(schema, i - 1);
Michal Vasko60ea6352020-06-29 13:39:39 +0200896 if (!hash) {
897 return LY_EINT;
898 }
899 assert(hash & (LYB_HASH_COLLISION_ID >> (i - 1)));
900
901 LY_CHECK_RET(lyb_write(out, &hash, sizeof hash, lybctx));
902 }
903
904 return LY_SUCCESS;
905}
906
907/**
908 * @brief Print data subtree.
909 *
910 * @param[in] out Out structure.
911 * @param[in] node Root node of the subtree to print.
912 * @param[in,out] sibling_ht Cached hash table for these data siblings, created if NULL.
913 * @param[in] lybctx LYB context.
914 * @return LY_ERR value.
915 */
916static LY_ERR
917lyb_print_subtree(struct ly_out *out, const struct lyd_node *node, struct hash_table **sibling_ht, struct lyd_lyb_ctx *lybctx)
918{
919 struct hash_table *child_ht = NULL;
920
921 /* register a new subtree */
Radek Krejci1798aae2020-07-14 13:26:06 +0200922 LY_CHECK_RET(lyb_write_start_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200923
924 /* write model info first */
Michal Vasko9e685082021-01-29 14:49:09 +0100925 if (!node->schema && !lyd_parent(node)) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200926 LY_CHECK_RET(lyb_print_model(out, NULL, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200927 } else if (node->schema && !lysc_data_parent(node->schema)) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200928 LY_CHECK_RET(lyb_print_model(out, node->schema->module, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200929 }
930
931 /* write schema hash */
Radek Krejci1798aae2020-07-14 13:26:06 +0200932 LY_CHECK_RET(lyb_print_schema_hash(out, (struct lysc_node *)node->schema, sibling_ht, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200933
934 /* write any metadata/attributes */
935 if (node->schema) {
936 LY_CHECK_RET(lyb_print_metadata(out, node, lybctx));
937 } else {
Radek Krejci1798aae2020-07-14 13:26:06 +0200938 LY_CHECK_RET(lyb_print_attributes(out, (struct lyd_node_opaq *)node, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200939 }
940
Michal Vaskoc5e866a2020-11-04 17:09:26 +0100941 /* write node flags */
942 LY_CHECK_RET(lyb_write_number(node->flags, sizeof node->flags, out, lybctx->lybctx));
943
Michal Vasko60ea6352020-06-29 13:39:39 +0200944 /* write node content */
945 if (!node->schema) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200946 LY_CHECK_RET(lyb_print_opaq((struct lyd_node_opaq *)node, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200947 } else if (node->schema->nodetype & LYD_NODE_INNER) {
948 /* nothing to write */
949 } else if (node->schema->nodetype & LYD_NODE_TERM) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200950 LY_CHECK_RET(lyb_print_term((struct lyd_node_term *)node, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200951 } else if (node->schema->nodetype & LYD_NODE_ANY) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200952 LY_CHECK_RET(lyb_print_anydata((struct lyd_node_any *)node, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200953 } else {
Radek Krejci1798aae2020-07-14 13:26:06 +0200954 LOGINT_RET(lybctx->lybctx->ctx);
Michal Vasko60ea6352020-06-29 13:39:39 +0200955 }
956
957 /* recursively write all the descendants */
Radek Krejcia1c1e542020-09-29 16:06:52 +0200958 LY_LIST_FOR(lyd_child(node), node) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200959 LY_CHECK_RET(lyb_print_subtree(out, node, &child_ht, lybctx));
960 }
961
962 /* finish this subtree */
Radek Krejci1798aae2020-07-14 13:26:06 +0200963 LY_CHECK_RET(lyb_write_stop_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200964
965 return LY_SUCCESS;
966}
967
968LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200969lyb_print_data(struct ly_out *out, const struct lyd_node *root, uint32_t options)
Michal Vasko60ea6352020-06-29 13:39:39 +0200970{
971 LY_ERR ret = LY_SUCCESS;
972 uint8_t zero = 0;
Michal Vasko60ea6352020-06-29 13:39:39 +0200973 struct hash_table *top_sibling_ht = NULL;
974 const struct lys_module *prev_mod = NULL;
Radek Krejci1798aae2020-07-14 13:26:06 +0200975 struct lyd_lyb_ctx *lybctx;
Michal Vaskob7be7a82020-08-20 09:09:04 +0200976 const struct ly_ctx *ctx = root ? LYD_CTX(root) : NULL;
Michal Vasko60ea6352020-06-29 13:39:39 +0200977
Radek Krejci1798aae2020-07-14 13:26:06 +0200978 lybctx = calloc(1, sizeof *lybctx);
979 LY_CHECK_ERR_RET(!lybctx, LOGMEM(ctx), LY_EMEM);
980 lybctx->lybctx = calloc(1, sizeof *lybctx->lybctx);
981 LY_CHECK_ERR_RET(!lybctx, LOGMEM(ctx), LY_EMEM);
982
983 lybctx->print_options = options;
Michal Vasko60ea6352020-06-29 13:39:39 +0200984 if (root) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200985 lybctx->lybctx->ctx = ctx;
Michal Vasko60ea6352020-06-29 13:39:39 +0200986
987 if (root->schema && lysc_data_parent(root->schema)) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200988 LOGERR(lybctx->lybctx->ctx, LY_EINVAL, "LYB printer supports only printing top-level nodes.");
Michal Vasko9acaf492020-08-13 09:05:58 +0200989 ret = LY_EINVAL;
990 goto cleanup;
Michal Vasko60ea6352020-06-29 13:39:39 +0200991 }
992 }
993
994 /* LYB magic number */
Michal Vasko63f3d842020-07-08 10:10:14 +0200995 LY_CHECK_GOTO(ret = lyb_print_magic_number(out), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200996
997 /* LYB header */
Michal Vasko63f3d842020-07-08 10:10:14 +0200998 LY_CHECK_GOTO(ret = lyb_print_header(out), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200999
1000 /* all used models */
Radek Krejci1798aae2020-07-14 13:26:06 +02001001 LY_CHECK_GOTO(ret = lyb_print_data_models(out, root, lybctx->lybctx), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +02001002
1003 LY_LIST_FOR(root, root) {
1004 /* do not reuse sibling hash tables from different modules */
1005 if (!root->schema || (root->schema->module != prev_mod)) {
1006 top_sibling_ht = NULL;
1007 prev_mod = root->schema ? root->schema->module : NULL;
1008 }
1009
Radek Krejci1798aae2020-07-14 13:26:06 +02001010 LY_CHECK_GOTO(ret = lyb_print_subtree(out, root, &top_sibling_ht, lybctx), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +02001011
Radek Krejci7931b192020-06-25 17:05:03 +02001012 if (!(options & LYD_PRINT_WITHSIBLINGS)) {
Michal Vasko60ea6352020-06-29 13:39:39 +02001013 break;
1014 }
1015 }
1016
1017 /* ending zero byte */
Radek Krejci1798aae2020-07-14 13:26:06 +02001018 LY_CHECK_GOTO(ret = lyb_write(out, &zero, sizeof zero, lybctx->lybctx), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +02001019
1020cleanup:
Radek Krejci1798aae2020-07-14 13:26:06 +02001021 lyd_lyb_ctx_free((struct lyd_ctx *)lybctx);
Michal Vasko60ea6352020-06-29 13:39:39 +02001022 return ret;
1023}