blob: e45a9195f10451c83c006b07e2100d8ca16f9608 [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>
18#include <stdio.h>
19#include <stdint.h>
20#include <stdlib.h>
21#include <string.h>
Radek Krejciad97c5f2020-06-30 09:19:28 +020022#include <sys/types.h>
Michal Vasko60ea6352020-06-29 13:39:39 +020023
24#include "common.h"
25#include "compat.h"
Radek Krejciad97c5f2020-06-30 09:19:28 +020026#include "context.h"
27#include "hash_table.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020028#include "log.h"
Radek Krejci7931b192020-06-25 17:05:03 +020029#include "parser_data.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020030#include "printer.h"
Radek Krejciad97c5f2020-06-30 09:19:28 +020031#include "printer_data.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020032#include "printer_internal.h"
Radek Krejciad97c5f2020-06-30 09:19:28 +020033#include "set.h"
34#include "tree.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020035#include "tree_data_internal.h"
36#include "tree_schema.h"
37#include "tree_schema_internal.h"
38
39/**
40 * @brief Hash table equal callback for checking hash equality only.
Radek Krejci857189e2020-09-01 13:26:36 +020041 *
42 * Implementation of ::values_equal_cb.
Michal Vasko60ea6352020-06-29 13:39:39 +020043 */
Radek Krejci857189e2020-09-01 13:26:36 +020044static ly_bool
45lyb_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 +020046{
47 /* for this purpose, if hash matches, the value does also, we do not want 2 values to have the same hash */
48 return 1;
49}
50
51/**
52 * @brief Hash table equal callback for checking value pointer equality only.
Radek Krejci857189e2020-09-01 13:26:36 +020053 *
54 * Implementation of ::values_equal_cb.
Michal Vasko60ea6352020-06-29 13:39:39 +020055 */
Radek Krejci857189e2020-09-01 13:26:36 +020056static ly_bool
57lyb_ptr_equal_cb(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *UNUSED(cb_data))
Michal Vasko60ea6352020-06-29 13:39:39 +020058{
59 struct lysc_node *val1 = *(struct lysc_node **)val1_p;
60 struct lysc_node *val2 = *(struct lysc_node **)val2_p;
61
62 if (val1 == val2) {
63 return 1;
64 }
65 return 0;
66}
67
68/**
69 * @brief Check that sibling collision hash is safe to insert into hash table.
70 *
71 * @param[in] ht Hash table.
72 * @param[in] sibling Hashed sibling.
73 * @param[in] ht_col_id Sibling hash collision ID.
74 * @param[in] compare_col_id Last collision ID to compare with.
75 * @return LY_SUCCESS when the whole hash sequence does not collide,
76 * @return LY_EEXIST when the whole hash sequence sollides.
77 */
78static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +020079lyb_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 +020080{
Michal Vasko60ea6352020-06-29 13:39:39 +020081 struct lysc_node **col_node;
82
83 /* get the first node inserted with last hash col ID ht_col_id */
84 if (lyht_find(ht, &sibling, lyb_hash(sibling, ht_col_id), (void **)&col_node)) {
85 /* there is none. valid situation */
86 return LY_SUCCESS;
87 }
88
89 lyht_set_cb(ht, lyb_ptr_equal_cb);
90 do {
Radek Krejci1deb5be2020-08-26 16:43:36 +020091 int64_t j;
92 for (j = (int64_t)compare_col_id; j > -1; --j) {
Michal Vasko60ea6352020-06-29 13:39:39 +020093 if (lyb_hash(sibling, j) != lyb_hash(*col_node, j)) {
94 /* one non-colliding hash */
95 break;
96 }
97 }
98 if (j == -1) {
99 /* all whole hash sequences of nodes inserted with last hash col ID compare_col_id collide */
100 lyht_set_cb(ht, lyb_hash_equal_cb);
101 return LY_EEXIST;
102 }
103
104 /* get next node inserted with last hash col ID ht_col_id */
105 } while (!lyht_find_next(ht, col_node, lyb_hash(*col_node, ht_col_id), (void **)&col_node));
106
107 lyht_set_cb(ht, lyb_hash_equal_cb);
108 return LY_SUCCESS;
109}
110
111/**
112 * @brief Hash all the siblings and add them also into a separate hash table.
113 *
114 * @param[in] sibling Any sibling in all the siblings on one level.
115 * @param[out] ht_p Created hash table.
116 * @return LY_ERR value.
117 */
118static LY_ERR
119lyb_hash_siblings(struct lysc_node *sibling, struct hash_table **ht_p)
120{
121 struct hash_table *ht;
122 const struct lysc_node *parent;
123 const struct lys_module *mod;
Radek Krejci1deb5be2020-08-26 16:43:36 +0200124 LYB_HASH i;
Michal Vasko60ea6352020-06-29 13:39:39 +0200125
126 ht = lyht_new(1, sizeof(struct lysc_node *), lyb_hash_equal_cb, NULL, 1);
127 LY_CHECK_ERR_RET(!ht, LOGMEM(sibling->module->ctx), LY_EMEM);
128
129 parent = lysc_data_parent(sibling);
130 mod = sibling->module;
131
132 sibling = NULL;
133 /* ignore features so that their state does not affect hashes */
134 while ((sibling = (struct lysc_node *)lys_getnext(sibling, parent, mod->compiled, LYS_GETNEXT_NOSTATECHECK))) {
135 /* find the first non-colliding hash (or specifically non-colliding hash sequence) */
136 for (i = 0; i < LYB_HASH_BITS; ++i) {
137 /* check that we are not colliding with nodes inserted with a lower collision ID than ours */
Radek Krejci1deb5be2020-08-26 16:43:36 +0200138 int64_t j;
139 for (j = (int64_t)i - 1; j > -1; --j) {
140 if (lyb_hash_sequence_check(ht, sibling, (LYB_HASH)j, i)) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200141 break;
142 }
143 }
144 if (j > -1) {
145 /* some check failed, we must use a higher collision ID */
146 continue;
147 }
148
149 /* try to insert node with the current collision ID */
150 if (!lyht_insert_with_resize_cb(ht, &sibling, lyb_hash(sibling, i), lyb_ptr_equal_cb, NULL)) {
151 /* success, no collision */
152 break;
153 }
154
155 /* make sure we really cannot insert it with this hash col ID (meaning the whole hash sequence is colliding) */
156 if (i && !lyb_hash_sequence_check(ht, sibling, i, i)) {
157 /* it can be inserted after all, even though there is already a node with the same last collision ID */
158 lyht_set_cb(ht, lyb_ptr_equal_cb);
159 if (lyht_insert(ht, &sibling, lyb_hash(sibling, i), NULL)) {
160 LOGINT(sibling->module->ctx);
161 lyht_set_cb(ht, lyb_hash_equal_cb);
162 lyht_free(ht);
163 return LY_EINT;
164 }
165 lyht_set_cb(ht, lyb_hash_equal_cb);
166 break;
167 }
168 /* there is still another colliding schema node with the same hash sequence, try higher collision ID */
169 }
170
171 if (i == LYB_HASH_BITS) {
172 /* wow */
173 LOGINT(sibling->module->ctx);
174 lyht_free(ht);
175 return LY_EINT;
176 }
177 }
178
179 /* change val equal callback so that the HT is usable for finding value hashes */
180 lyht_set_cb(ht, lyb_ptr_equal_cb);
181
182 *ht_p = ht;
183 return LY_SUCCESS;
184}
185
186/**
187 * @brief Find node hash in a hash table.
188 *
189 * @param[in] ht Hash table to search in.
190 * @param[in] node Node to find.
191 * @param[out] hash_p First non-colliding hash found.
192 * @return LY_ERR value.
193 */
194static LY_ERR
195lyb_hash_find(struct hash_table *ht, struct lysc_node *node, LYB_HASH *hash_p)
196{
197 LYB_HASH hash;
198 uint32_t i;
199
200 for (i = 0; i < LYB_HASH_BITS; ++i) {
201 hash = lyb_hash(node, i);
202 if (!hash) {
203 LOGINT_RET(node->module->ctx);
204 }
205
206 if (!lyht_find(ht, &node, hash, NULL)) {
207 /* success, no collision */
208 break;
209 }
210 }
211 /* cannot happen, we already calculated the hash */
212 if (i == LYB_HASH_BITS) {
213 LOGINT_RET(node->module->ctx);
214 }
215
216 *hash_p = hash;
217 return LY_SUCCESS;
218}
219
220/**
221 * @brief Write LYB data fully handling the metadata.
222 *
223 * @param[in] out Out structure.
224 * @param[in] buf Source buffer.
225 * @param[in] count Number of bytes to write.
226 * @param[in] lybctx LYB context.
227 * @return LY_ERR value.
228 */
229static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200230lyb_write(struct ly_out *out, const uint8_t *buf, size_t count, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200231{
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200232 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200233 struct lyd_lyb_subtree *full, *iter;
Michal Vasko5233e962020-08-14 14:26:20 +0200234 size_t to_write;
Michal Vasko60ea6352020-06-29 13:39:39 +0200235 uint8_t meta_buf[LYB_META_BYTES];
236
237 while (1) {
238 /* check for full data chunks */
239 to_write = count;
240 full = NULL;
241 LY_ARRAY_FOR(lybctx->subtrees, u) {
242 /* we want the innermost chunks resolved first, so replace previous full chunks */
243 if (lybctx->subtrees[u].written + to_write >= LYB_SIZE_MAX) {
244 /* full chunk, do not write more than allowed */
245 to_write = LYB_SIZE_MAX - lybctx->subtrees[u].written;
246 full = &lybctx->subtrees[u];
247 }
248 }
249
250 if (!full && !count) {
251 break;
252 }
253
254 /* we are actually writing some data, not just finishing another chunk */
255 if (to_write) {
Michal Vasko5233e962020-08-14 14:26:20 +0200256 LY_CHECK_RET(ly_write_(out, (char *)buf, to_write));
Michal Vasko60ea6352020-06-29 13:39:39 +0200257
258 LY_ARRAY_FOR(lybctx->subtrees, u) {
259 /* increase all written counters */
Michal Vasko5233e962020-08-14 14:26:20 +0200260 lybctx->subtrees[u].written += to_write;
Michal Vasko60ea6352020-06-29 13:39:39 +0200261 assert(lybctx->subtrees[u].written <= LYB_SIZE_MAX);
262 }
263 /* decrease count/buf */
Michal Vasko5233e962020-08-14 14:26:20 +0200264 count -= to_write;
265 buf += to_write;
Michal Vasko60ea6352020-06-29 13:39:39 +0200266 }
267
268 if (full) {
269 /* write the meta information (inner chunk count and chunk size) */
270 meta_buf[0] = full->written & 0xFF;
271 meta_buf[1] = full->inner_chunks & 0xFF;
Michal Vasko5233e962020-08-14 14:26:20 +0200272 LY_CHECK_RET(ly_write_skipped(out, full->position, (char *)meta_buf, LYB_META_BYTES));
Michal Vasko60ea6352020-06-29 13:39:39 +0200273
274 /* zero written and inner chunks */
275 full->written = 0;
276 full->inner_chunks = 0;
277
278 /* skip space for another chunk size */
Michal Vasko5233e962020-08-14 14:26:20 +0200279 LY_CHECK_RET(ly_write_skip(out, LYB_META_BYTES, &full->position));
Michal Vasko60ea6352020-06-29 13:39:39 +0200280
281 /* increase inner chunk count */
282 for (iter = &lybctx->subtrees[0]; iter != full; ++iter) {
283 if (iter->inner_chunks == LYB_INCHUNK_MAX) {
284 LOGINT(lybctx->ctx);
285 return LY_EINT;
286 }
287 ++iter->inner_chunks;
288 }
289 }
290 }
291
292 return LY_SUCCESS;
293}
294
295/**
296 * @brief Stop the current subtree - write its final metadata.
297 *
298 * @param[in] out Out structure.
299 * @param[in] lybctx LYB context.
300 * @return LY_ERR value.
301 */
302static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200303lyb_write_stop_subtree(struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200304{
Michal Vasko60ea6352020-06-29 13:39:39 +0200305 uint8_t meta_buf[LYB_META_BYTES];
306
307 /* write the meta chunk information */
308 meta_buf[0] = LYB_LAST_SUBTREE(lybctx).written & 0xFF;
309 meta_buf[1] = LYB_LAST_SUBTREE(lybctx).inner_chunks & 0xFF;
Michal Vasko5233e962020-08-14 14:26:20 +0200310 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 +0200311
312 LY_ARRAY_DECREMENT(lybctx->subtrees);
313 return LY_SUCCESS;
314}
315
316/**
317 * @brief Start a new subtree - skip bytes for its metadata.
318 *
319 * @param[in] out Out structure.
320 * @param[in] lybctx LYB context.
321 * @return LY_ERR value.
322 */
323static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200324lyb_write_start_subtree(struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200325{
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200326 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200327
328 if (!lybctx->subtrees) {
Radek Krejcif6d14cb2020-07-02 16:11:45 +0200329 assert(lybctx->subtree_size == 0);
Michal Vasko60ea6352020-06-29 13:39:39 +0200330 u = 0;
331 } else {
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200332 u = LY_ARRAY_COUNT(lybctx->subtrees);
Michal Vasko60ea6352020-06-29 13:39:39 +0200333 }
334 if (u == lybctx->subtree_size) {
335 LY_ARRAY_CREATE_RET(lybctx->ctx, lybctx->subtrees, u + LYB_SUBTREE_STEP, LY_EMEM);
336 lybctx->subtree_size = u + LYB_SUBTREE_STEP;
337 }
338
339 LY_ARRAY_INCREMENT(lybctx->subtrees);
340 LYB_LAST_SUBTREE(lybctx).written = 0;
341 LYB_LAST_SUBTREE(lybctx).inner_chunks = 0;
342
343 /* another inner chunk */
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200344 for (u = 0; u < LY_ARRAY_COUNT(lybctx->subtrees) - 1; ++u) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200345 if (lybctx->subtrees[u].inner_chunks == LYB_INCHUNK_MAX) {
346 LOGINT(lybctx->ctx);
Michal Vasko5233e962020-08-14 14:26:20 +0200347 return LY_EINT;
Michal Vasko60ea6352020-06-29 13:39:39 +0200348 }
349 ++lybctx->subtrees[u].inner_chunks;
350 }
351
Michal Vasko5233e962020-08-14 14:26:20 +0200352 LY_CHECK_RET(ly_write_skip(out, LYB_META_BYTES, &LYB_LAST_SUBTREE(lybctx).position));
Michal Vasko60ea6352020-06-29 13:39:39 +0200353
354 return LY_SUCCESS;
355}
356
357/**
358 * @brief Write a number.
359 *
360 * @param[in] num Number to write.
361 * @param[in] bytes Actual accessible bytes of @p num.
362 * @param[in] out Out structure.
363 * @param[in] lybctx LYB context.
364 * @return LY_ERR value.
365 */
366static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200367lyb_write_number(uint64_t num, size_t bytes, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200368{
369 /* correct byte order */
370 num = htole64(num);
371
372 return lyb_write(out, (uint8_t *)&num, bytes, lybctx);
373}
374
375/**
376 * @brief Write a string.
377 *
378 * @param[in] str String to write.
379 * @param[in] str_len Length of @p str.
380 * @param[in] with_length Whether to precede the string with its length.
381 * @param[in] out Out structure.
382 * @param[in] lybctx LYB context.
383 * @return LY_ERR value.
384 */
385static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +0200386lyb_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 +0200387{
Michal Vasko60ea6352020-06-29 13:39:39 +0200388 if (!str) {
389 str = "";
Michal Vasko30667352020-08-13 09:06:14 +0200390 LY_CHECK_ERR_RET(str_len, LOGINT(lybctx->ctx), LY_EINT);
Michal Vasko60ea6352020-06-29 13:39:39 +0200391 }
392 if (!str_len) {
393 str_len = strlen(str);
394 }
395
396 if (with_length) {
397 /* print length on 2 bytes */
398 if (str_len > UINT16_MAX) {
399 LOGINT(lybctx->ctx);
400 return LY_EINT;
401 }
402 LY_CHECK_RET(lyb_write_number(str_len, 2, out, lybctx));
403 }
404
Michal Vasko63f3d842020-07-08 10:10:14 +0200405 LY_CHECK_RET(lyb_write(out, (const uint8_t *)str, str_len, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200406
407 return LY_SUCCESS;
408}
409
410/**
411 * @brief Print YANG module info.
412 *
413 * @param[in] out Out structure.
414 * @param[in] mod Module to print.
415 * @param[in] lybctx LYB context.
416 * @return LY_ERR value.
417 */
418static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200419lyb_print_model(struct ly_out *out, const struct lys_module *mod, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200420{
Michal Vasko60ea6352020-06-29 13:39:39 +0200421 uint16_t revision;
422
423 /* model name length and model name */
424 if (mod) {
425 LY_CHECK_RET(lyb_write_string(mod->name, 0, 1, out, lybctx));
426 } else {
427 LY_CHECK_RET(lyb_write_string("", 0, 1, out, lybctx));
428 }
429
430 /* model revision as XXXX XXXX XXXX XXXX (2B) (year is offset from 2000)
431 * YYYY YYYM MMMD DDDD */
432 revision = 0;
433 if (mod && mod->revision) {
Radek Krejci1deb5be2020-08-26 16:43:36 +0200434 int r = atoi(mod->revision);
Michal Vasko60ea6352020-06-29 13:39:39 +0200435 r -= 2000;
436 r <<= 9;
437
438 revision |= r;
439
440 r = atoi(mod->revision + 5);
441 r <<= 5;
442
443 revision |= r;
444
445 r = atoi(mod->revision + 8);
446
447 revision |= r;
448 }
449 LY_CHECK_RET(lyb_write_number(revision, sizeof revision, out, lybctx));
450
451 return LY_SUCCESS;
452}
453
454/**
455 * @brief Print all used YANG modules.
456 *
457 * @param[in] out Out structure.
458 * @param[in] root Data root.
459 * @param[in] lybctx LYB context.
460 * @return LY_ERR value.
461 */
462static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200463lyb_print_data_models(struct ly_out *out, const struct lyd_node *root, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200464{
465 struct ly_set *set;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200466 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200467 LY_ERR ret = LY_SUCCESS;
468 struct lys_module *mod;
469 const struct lyd_node *node;
470 uint32_t i;
471
Radek Krejciba03a5a2020-08-27 14:40:41 +0200472 LY_CHECK_RET(ly_set_new(&set));
Michal Vasko60ea6352020-06-29 13:39:39 +0200473
474 /* collect all data node modules */
475 LY_LIST_FOR(root, node) {
476 if (!node->schema) {
477 continue;
478 }
479
480 mod = node->schema->module;
Radek Krejciba03a5a2020-08-27 14:40:41 +0200481 ret = ly_set_add(set, mod, 0, NULL);
482 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200483
484 /* add also their modules deviating or augmenting them */
485 LY_ARRAY_FOR(mod->compiled->deviated_by, u) {
Radek Krejciba03a5a2020-08-27 14:40:41 +0200486 ret = ly_set_add(set, mod->compiled->deviated_by[u], 0, NULL);
487 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200488 }
489 LY_ARRAY_FOR(mod->compiled->augmented_by, u) {
Radek Krejciba03a5a2020-08-27 14:40:41 +0200490 ret = ly_set_add(set, mod->compiled->augmented_by[u], 0, NULL);
491 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200492 }
493 }
494
495 /* now write module count on 2 bytes */
496 LY_CHECK_GOTO(ret = lyb_write_number(set->count, 2, out, lybctx), cleanup);
497
498 /* and all the used models */
499 for (i = 0; i < set->count; ++i) {
500 LY_CHECK_GOTO(ret = lyb_print_model(out, set->objs[i], lybctx), cleanup);
501 }
502
503cleanup:
504 ly_set_free(set, NULL);
505 return ret;
506}
507
508/**
509 * @brief Print LYB magic number.
510 *
511 * @param[in] out Out structure.
Michal Vasko60ea6352020-06-29 13:39:39 +0200512 * @return LY_ERR value.
513 */
514static LY_ERR
Michal Vasko63f3d842020-07-08 10:10:14 +0200515lyb_print_magic_number(struct ly_out *out)
Michal Vasko60ea6352020-06-29 13:39:39 +0200516{
Michal Vasko60ea6352020-06-29 13:39:39 +0200517 uint32_t magic_number;
518
519 /* 'l', 'y', 'b' - 0x6c7962 */
520 ((char *)&magic_number)[0] = 'l';
521 ((char *)&magic_number)[1] = 'y';
522 ((char *)&magic_number)[2] = 'b';
523
Michal Vasko5233e962020-08-14 14:26:20 +0200524 LY_CHECK_RET(ly_write_(out, (char *)&magic_number, 3));
Michal Vasko60ea6352020-06-29 13:39:39 +0200525
526 return LY_SUCCESS;
527}
528
529/**
530 * @brief Print LYB header.
531 *
532 * @param[in] out Out structure.
Michal Vasko60ea6352020-06-29 13:39:39 +0200533 * @return LY_ERR value.
534 */
535static LY_ERR
Michal Vasko63f3d842020-07-08 10:10:14 +0200536lyb_print_header(struct ly_out *out)
Michal Vasko60ea6352020-06-29 13:39:39 +0200537{
Michal Vasko60ea6352020-06-29 13:39:39 +0200538 uint8_t byte = 0;
539
540 /* version, future flags */
541 byte |= LYB_VERSION_NUM;
542
Michal Vasko5233e962020-08-14 14:26:20 +0200543 LY_CHECK_RET(ly_write_(out, (char *)&byte, 1));
Michal Vasko60ea6352020-06-29 13:39:39 +0200544
545 return LY_SUCCESS;
546}
547
548/**
549 * @brief Print opaque prefixes.
550 *
551 * @param[in] out Out structure.
552 * @param[in] prefs Prefixes to print.
553 * @param[in] lybctx LYB context.
554 * @return LY_ERR value.
555 */
556static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200557lyb_print_opaq_prefixes(struct ly_out *out, const struct ly_prefix *prefs, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200558{
559 uint8_t count;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200560 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200561
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200562 if (prefs && (LY_ARRAY_COUNT(prefs) > UINT8_MAX)) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200563 LOGERR(lybctx->ctx, LY_EINT, "Maximum supported number of prefixes is %u.", UINT8_MAX);
564 return LY_EINT;
565 }
566
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200567 count = prefs ? LY_ARRAY_COUNT(prefs) : 0;
Michal Vasko60ea6352020-06-29 13:39:39 +0200568
569 /* write number of prefixes on 1 byte */
570 LY_CHECK_RET(lyb_write(out, &count, 1, lybctx));
571
572 /* write all the prefixes */
573 LY_ARRAY_FOR(prefs, u) {
574 /* prefix */
Radek Krejci1798aae2020-07-14 13:26:06 +0200575 LY_CHECK_RET(lyb_write_string(prefs[u].id, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200576
577 /* namespace */
Radek Krejci1798aae2020-07-14 13:26:06 +0200578 LY_CHECK_RET(lyb_write_string(prefs[u].module_name, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200579 }
580
581 return LY_SUCCESS;
582}
583
584/**
585 * @brief Print opaque node.
586 *
587 * @param[in] opaq Node to print.
588 * @param[in] out Out structure.
589 * @param[in] lybctx LYB context.
590 * @return LY_ERR value.
591 */
592static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200593lyb_print_opaq(struct lyd_node_opaq *opaq, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200594{
595 /* prefix */
Radek Krejci1798aae2020-07-14 13:26:06 +0200596 LY_CHECK_RET(lyb_write_string(opaq->prefix.id, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200597
Radek Krejci1798aae2020-07-14 13:26:06 +0200598 /* module reference */
599 LY_CHECK_RET(lyb_write_string(opaq->prefix.module_name, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200600
601 /* name */
602 LY_CHECK_RET(lyb_write_string(opaq->name, 0, 1, out, lybctx));
603
604 /* value prefixes */
605 LY_CHECK_RET(lyb_print_opaq_prefixes(out, opaq->val_prefs, lybctx));
606
607 /* format */
608 LY_CHECK_RET(lyb_write_number(opaq->format, 1, out, lybctx));
609
610 /* value */
611 LY_CHECK_RET(lyb_write_string(opaq->value, 0, 0, out, lybctx));
612
613 return LY_SUCCESS;
614}
615
616/**
617 * @brief Print anydata node.
618 *
619 * @param[in] anydata Node to print.
620 * @param[in] out Out structure.
621 * @param[in] lybctx LYB context.
622 * @return LY_ERR value.
623 */
624static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200625lyb_print_anydata(struct lyd_node_any *anydata, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200626{
627 LY_ERR ret = LY_SUCCESS;
628 LYD_ANYDATA_VALUETYPE value_type;
629 int len;
630 char *buf = NULL;
631 const char *str;
632 struct ly_out *out2 = NULL;
633
634 if (anydata->value_type == LYD_ANYDATA_DATATREE) {
635 /* will be printed as a nested LYB data tree */
636 value_type = LYD_ANYDATA_LYB;
637 } else {
638 value_type = anydata->value_type;
639 }
640
641 /* first byte is type */
642 LY_CHECK_GOTO(ret = lyb_write(out, (uint8_t *)&value_type, sizeof value_type, lybctx), cleanup);
643
644 if (anydata->value_type == LYD_ANYDATA_DATATREE) {
645 /* print LYB data tree to memory */
646 LY_CHECK_GOTO(ret = ly_out_new_memory(&buf, 0, &out2), cleanup);
Radek Krejci7931b192020-06-25 17:05:03 +0200647 LY_CHECK_GOTO(ret = lyb_print_data(out2, anydata->value.tree, LYD_PRINT_WITHSIBLINGS), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200648
649 len = lyd_lyb_data_length(buf);
650 assert(len != -1);
651 str = buf;
652 } else if (anydata->value_type == LYD_ANYDATA_LYB) {
653 len = lyd_lyb_data_length(anydata->value.mem);
654 assert(len != -1);
655 str = anydata->value.mem;
656 } else {
657 len = strlen(anydata->value.str);
658 str = anydata->value.str;
659 }
660
661 /* followed by the content */
662 LY_CHECK_GOTO(ret = lyb_write_string(str, (size_t)len, 0, out, lybctx), cleanup);
663
664cleanup:
665 ly_out_free(out2, NULL, 1);
666 return ret;
667}
668
669/**
670 * @brief Print term node.
671 *
672 * @param[in] term Node to print.
673 * @param[in] out Out structure.
674 * @param[in] lybctx LYB context.
675 * @return LY_ERR value.
676 */
677static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200678lyb_print_term(struct lyd_node_term *term, struct ly_out *out, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200679{
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200680 /* print the value */
Michal Vaskob7be7a82020-08-20 09:09:04 +0200681 return lyb_write_string(LYD_CANON_VALUE(term), 0, 0, out, lybctx);
Michal Vasko60ea6352020-06-29 13:39:39 +0200682}
683
684/**
685 * @brief Print YANG node metadata.
686 *
687 * @param[in] out Out structure.
688 * @param[in] node Data node whose metadata to print.
689 * @param[in] lybctx LYB context.
690 * @return LY_ERR value.
691 */
692static LY_ERR
693lyb_print_metadata(struct ly_out *out, const struct lyd_node *node, struct lyd_lyb_ctx *lybctx)
694{
Michal Vasko60ea6352020-06-29 13:39:39 +0200695 uint8_t count = 0;
696 const struct lys_module *wd_mod = NULL;
697 struct lyd_meta *iter;
Michal Vasko60ea6352020-06-29 13:39:39 +0200698
699 /* with-defaults */
700 if (node->schema->nodetype & LYD_NODE_TERM) {
Radek Krejci7931b192020-06-25 17:05:03 +0200701 if (((node->flags & LYD_DEFAULT) && (lybctx->print_options & (LYD_PRINT_WD_ALL_TAG | LYD_PRINT_WD_IMPL_TAG))) ||
702 ((lybctx->print_options & LYD_PRINT_WD_ALL_TAG) && ly_is_default(node))) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200703 /* we have implicit OR explicit default node, print attribute only if context include with-defaults schema */
704 wd_mod = ly_ctx_get_module_latest(node->schema->module->ctx, "ietf-netconf-with-defaults");
705 }
706 }
707
708 /* count metadata */
709 if (wd_mod) {
710 ++count;
711 }
712 for (iter = node->meta; iter; iter = iter->next) {
713 if (count == UINT8_MAX) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200714 LOGERR(lybctx->lybctx->ctx, LY_EINT, "Maximum supported number of data node metadata is %u.", UINT8_MAX);
Michal Vasko60ea6352020-06-29 13:39:39 +0200715 return LY_EINT;
716 }
717 ++count;
718 }
719
720 /* write number of metadata on 1 byte */
Radek Krejci1798aae2020-07-14 13:26:06 +0200721 LY_CHECK_RET(lyb_write(out, &count, 1, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200722
723 if (wd_mod) {
724 /* write the "default" metadata */
Radek Krejci1798aae2020-07-14 13:26:06 +0200725 LY_CHECK_RET(lyb_write_start_subtree(out, lybctx->lybctx));
726 LY_CHECK_RET(lyb_print_model(out, wd_mod, lybctx->lybctx));
727 LY_CHECK_RET(lyb_write_string("default", 0, 1, out, lybctx->lybctx));
728 LY_CHECK_RET(lyb_write_string("true", 0, 0, out, lybctx->lybctx));
729 LY_CHECK_RET(lyb_write_stop_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200730 }
731
732 /* write all the node metadata */
733 LY_LIST_FOR(node->meta, iter) {
734 /* each metadata is a subtree */
Radek Krejci1798aae2020-07-14 13:26:06 +0200735 LY_CHECK_RET(lyb_write_start_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200736
737 /* model */
Radek Krejci1798aae2020-07-14 13:26:06 +0200738 LY_CHECK_RET(lyb_print_model(out, iter->annotation->module, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200739
740 /* annotation name with length */
Radek Krejci1798aae2020-07-14 13:26:06 +0200741 LY_CHECK_RET(lyb_write_string(iter->name, 0, 1, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200742
Michal Vasko60ea6352020-06-29 13:39:39 +0200743 /* metadata value */
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200744 LY_CHECK_RET(lyb_write_string(iter->value.canonical, 0, 0, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200745
746 /* finish metadata subtree */
Radek Krejci1798aae2020-07-14 13:26:06 +0200747 LY_CHECK_RET(lyb_write_stop_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200748 }
749
750 return LY_SUCCESS;
751}
752
753/**
754 * @brief Print opaque node attributes.
755 *
756 * @param[in] out Out structure.
757 * @param[in] node Opaque node whose attributes to print.
758 * @param[in] lybctx LYB context.
759 * @return LY_ERR value.
760 */
761static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200762lyb_print_attributes(struct ly_out *out, const struct lyd_node_opaq *node, struct lylyb_ctx *lybctx)
Michal Vasko60ea6352020-06-29 13:39:39 +0200763{
764 uint8_t count = 0;
Radek Krejci5536d282020-08-04 23:27:44 +0200765 struct lyd_attr *iter;
Michal Vasko60ea6352020-06-29 13:39:39 +0200766
767 for (iter = node->attr; iter; iter = iter->next) {
768 if (count == UINT8_MAX) {
769 LOGERR(lybctx->ctx, LY_EINT, "Maximum supported number of data node attributes is %u.", UINT8_MAX);
770 return LY_EINT;
771 }
772 ++count;
773 }
774
775 /* write number of attributes on 1 byte */
776 LY_CHECK_RET(lyb_write(out, &count, 1, lybctx));
777
778 /* write all the attributes */
779 LY_LIST_FOR(node->attr, iter) {
780 /* each attribute is a subtree */
781 LY_CHECK_RET(lyb_write_start_subtree(out, lybctx));
782
783 /* prefix */
Radek Krejci1798aae2020-07-14 13:26:06 +0200784 LY_CHECK_RET(lyb_write_string(iter->prefix.id, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200785
786 /* namespace */
Radek Krejci1798aae2020-07-14 13:26:06 +0200787 LY_CHECK_RET(lyb_write_string(iter->prefix.module_name, 0, 1, out, lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200788
789 /* name */
790 LY_CHECK_RET(lyb_write_string(iter->name, 0, 1, out, lybctx));
791
792 /* value prefixes */
793 LY_CHECK_RET(lyb_print_opaq_prefixes(out, iter->val_prefs, lybctx));
794
795 /* format */
796 LY_CHECK_RET(lyb_write_number(iter->format, 1, out, lybctx));
797
798 /* value */
799 LY_CHECK_RET(lyb_write_string(iter->value, 0, 0, out, lybctx));
800
801 /* finish attribute subtree */
802 LY_CHECK_RET(lyb_write_stop_subtree(out, lybctx));
803 }
804
805 return LY_SUCCESS;
806}
807
808/**
809 * @brief Print schema node hash.
810 *
811 * @param[in] out Out structure.
812 * @param[in] schema Schema node whose hash to print.
813 * @param[in,out] sibling_ht Cached hash table for these siblings, created if NULL.
814 * @param[in] lybctx LYB context.
815 * @return LY_ERR value.
816 */
817static LY_ERR
Radek Krejci1798aae2020-07-14 13:26:06 +0200818lyb_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 +0200819{
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200820 LY_ARRAY_COUNT_TYPE u;
Michal Vasko60ea6352020-06-29 13:39:39 +0200821 uint32_t i;
822 LYB_HASH hash;
823 struct lyd_lyb_sib_ht *sib_ht;
824 struct lysc_node *first_sibling;
825
826 if (!schema) {
827 /* opaque node, write empty hash */
828 hash = 0;
829 LY_CHECK_RET(lyb_write(out, &hash, sizeof hash, lybctx));
830 return LY_SUCCESS;
831 }
832
833 /* create whole sibling HT if not already created and saved */
834 if (!*sibling_ht) {
835 /* get first schema data sibling (or input/output) */
836 first_sibling = (struct lysc_node *)lys_getnext(NULL, lysc_data_parent(schema), schema->module->compiled, 0);
837 LY_ARRAY_FOR(lybctx->sib_hts, u) {
838 if (lybctx->sib_hts[u].first_sibling == first_sibling) {
839 /* we have already created a hash table for these siblings */
840 *sibling_ht = lybctx->sib_hts[u].ht;
841 break;
842 }
843 }
844
845 if (!*sibling_ht) {
846 /* we must create sibling hash table */
847 LY_CHECK_RET(lyb_hash_siblings(first_sibling, sibling_ht));
848
849 /* and save it */
850 LY_ARRAY_NEW_RET(lybctx->ctx, lybctx->sib_hts, sib_ht, LY_EMEM);
851
852 sib_ht->first_sibling = first_sibling;
853 sib_ht->ht = *sibling_ht;
854 }
855 }
856
857 /* get our hash */
858 LY_CHECK_RET(lyb_hash_find(*sibling_ht, schema, &hash));
859
860 /* write the hash */
861 LY_CHECK_RET(lyb_write(out, &hash, sizeof hash, lybctx));
862
863 if (hash & LYB_HASH_COLLISION_ID) {
864 /* no collision for this hash, we are done */
865 return LY_SUCCESS;
866 }
867
868 /* written hash was a collision, write also all the preceding hashes */
Radek Krejci1e008d22020-08-17 11:37:37 +0200869 for (i = 0; !(hash & (LYB_HASH_COLLISION_ID >> i)); ++i) {}
Michal Vasko60ea6352020-06-29 13:39:39 +0200870
Michal Vaskod989ba02020-08-24 10:59:24 +0200871 for ( ; i; --i) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200872 hash = lyb_hash(schema, i - 1);
873 if (!hash) {
874 return LY_EINT;
875 }
876 assert(hash & (LYB_HASH_COLLISION_ID >> (i - 1)));
877
878 LY_CHECK_RET(lyb_write(out, &hash, sizeof hash, lybctx));
879 }
880
881 return LY_SUCCESS;
882}
883
884/**
885 * @brief Print data subtree.
886 *
887 * @param[in] out Out structure.
888 * @param[in] node Root node of the subtree to print.
889 * @param[in,out] sibling_ht Cached hash table for these data siblings, created if NULL.
890 * @param[in] lybctx LYB context.
891 * @return LY_ERR value.
892 */
893static LY_ERR
894lyb_print_subtree(struct ly_out *out, const struct lyd_node *node, struct hash_table **sibling_ht, struct lyd_lyb_ctx *lybctx)
895{
896 struct hash_table *child_ht = NULL;
897
898 /* register a new subtree */
Radek Krejci1798aae2020-07-14 13:26:06 +0200899 LY_CHECK_RET(lyb_write_start_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200900
901 /* write model info first */
902 if (!node->schema && !((struct lyd_node_opaq *)node)->parent) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200903 LY_CHECK_RET(lyb_print_model(out, NULL, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200904 } else if (node->schema && !lysc_data_parent(node->schema)) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200905 LY_CHECK_RET(lyb_print_model(out, node->schema->module, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200906 }
907
908 /* write schema hash */
Radek Krejci1798aae2020-07-14 13:26:06 +0200909 LY_CHECK_RET(lyb_print_schema_hash(out, (struct lysc_node *)node->schema, sibling_ht, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200910
911 /* write any metadata/attributes */
912 if (node->schema) {
913 LY_CHECK_RET(lyb_print_metadata(out, node, lybctx));
914 } else {
Radek Krejci1798aae2020-07-14 13:26:06 +0200915 LY_CHECK_RET(lyb_print_attributes(out, (struct lyd_node_opaq *)node, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200916 }
917
918 /* write node content */
919 if (!node->schema) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200920 LY_CHECK_RET(lyb_print_opaq((struct lyd_node_opaq *)node, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200921 } else if (node->schema->nodetype & LYD_NODE_INNER) {
922 /* nothing to write */
923 } else if (node->schema->nodetype & LYD_NODE_TERM) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200924 LY_CHECK_RET(lyb_print_term((struct lyd_node_term *)node, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200925 } else if (node->schema->nodetype & LYD_NODE_ANY) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200926 LY_CHECK_RET(lyb_print_anydata((struct lyd_node_any *)node, out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200927 } else {
Radek Krejci1798aae2020-07-14 13:26:06 +0200928 LOGINT_RET(lybctx->lybctx->ctx);
Michal Vasko60ea6352020-06-29 13:39:39 +0200929 }
930
931 /* recursively write all the descendants */
932 LY_LIST_FOR(lyd_node_children(node, 0), node) {
933 LY_CHECK_RET(lyb_print_subtree(out, node, &child_ht, lybctx));
934 }
935
936 /* finish this subtree */
Radek Krejci1798aae2020-07-14 13:26:06 +0200937 LY_CHECK_RET(lyb_write_stop_subtree(out, lybctx->lybctx));
Michal Vasko60ea6352020-06-29 13:39:39 +0200938
939 return LY_SUCCESS;
940}
941
942LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200943lyb_print_data(struct ly_out *out, const struct lyd_node *root, uint32_t options)
Michal Vasko60ea6352020-06-29 13:39:39 +0200944{
945 LY_ERR ret = LY_SUCCESS;
946 uint8_t zero = 0;
Michal Vasko60ea6352020-06-29 13:39:39 +0200947 struct hash_table *top_sibling_ht = NULL;
948 const struct lys_module *prev_mod = NULL;
Radek Krejci1798aae2020-07-14 13:26:06 +0200949 struct lyd_lyb_ctx *lybctx;
Michal Vaskob7be7a82020-08-20 09:09:04 +0200950 const struct ly_ctx *ctx = root ? LYD_CTX(root) : NULL;
Michal Vasko60ea6352020-06-29 13:39:39 +0200951
Radek Krejci1798aae2020-07-14 13:26:06 +0200952 lybctx = calloc(1, sizeof *lybctx);
953 LY_CHECK_ERR_RET(!lybctx, LOGMEM(ctx), LY_EMEM);
954 lybctx->lybctx = calloc(1, sizeof *lybctx->lybctx);
955 LY_CHECK_ERR_RET(!lybctx, LOGMEM(ctx), LY_EMEM);
956
957 lybctx->print_options = options;
Michal Vasko60ea6352020-06-29 13:39:39 +0200958 if (root) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200959 lybctx->lybctx->ctx = ctx;
Michal Vasko60ea6352020-06-29 13:39:39 +0200960
961 if (root->schema && lysc_data_parent(root->schema)) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200962 LOGERR(lybctx->lybctx->ctx, LY_EINVAL, "LYB printer supports only printing top-level nodes.");
Michal Vasko9acaf492020-08-13 09:05:58 +0200963 ret = LY_EINVAL;
964 goto cleanup;
Michal Vasko60ea6352020-06-29 13:39:39 +0200965 }
966 }
967
968 /* LYB magic number */
Michal Vasko63f3d842020-07-08 10:10:14 +0200969 LY_CHECK_GOTO(ret = lyb_print_magic_number(out), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200970
971 /* LYB header */
Michal Vasko63f3d842020-07-08 10:10:14 +0200972 LY_CHECK_GOTO(ret = lyb_print_header(out), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200973
974 /* all used models */
Radek Krejci1798aae2020-07-14 13:26:06 +0200975 LY_CHECK_GOTO(ret = lyb_print_data_models(out, root, lybctx->lybctx), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200976
977 LY_LIST_FOR(root, root) {
978 /* do not reuse sibling hash tables from different modules */
979 if (!root->schema || (root->schema->module != prev_mod)) {
980 top_sibling_ht = NULL;
981 prev_mod = root->schema ? root->schema->module : NULL;
982 }
983
Radek Krejci1798aae2020-07-14 13:26:06 +0200984 LY_CHECK_GOTO(ret = lyb_print_subtree(out, root, &top_sibling_ht, lybctx), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200985
Radek Krejci7931b192020-06-25 17:05:03 +0200986 if (!(options & LYD_PRINT_WITHSIBLINGS)) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200987 break;
988 }
989 }
990
991 /* ending zero byte */
Radek Krejci1798aae2020-07-14 13:26:06 +0200992 LY_CHECK_GOTO(ret = lyb_write(out, &zero, sizeof zero, lybctx->lybctx), cleanup);
Michal Vasko60ea6352020-06-29 13:39:39 +0200993
994cleanup:
Radek Krejci1798aae2020-07-14 13:26:06 +0200995 lyd_lyb_ctx_free((struct lyd_ctx *)lybctx);
Michal Vasko60ea6352020-06-29 13:39:39 +0200996 return ret;
997}