tests/utests/data/test_new.c

/**
 * @file test_new.c
 * @author: Michal Vasko <mvasko@cesnet.cz>
 * @brief unit tests for functions for creating data
 *
 * Copyright (c) 2020 CESNET, z.s.p.o.
 *
 * This source code is licensed under BSD 3-Clause License (the "License").
 * You may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     https://opensource.org/licenses/BSD-3-Clause
 */

#include <stdarg.h>
#include <stddef.h>
#include <stdio.h>
#include <setjmp.h>
#include <cmocka.h>

#include "libyang.h"

#define BUFSIZE 1024
char logbuf[BUFSIZE] = {0};
int store = -1; /* negative for infinite logging, positive for limited logging */

struct ly_ctx *ctx; /* context for tests */

/* set to 0 to printing error messages to stderr instead of checking them in code */
#define ENABLE_LOGGER_CHECKING 1

#if ENABLE_LOGGER_CHECKING
static void
logger(LY_LOG_LEVEL level, const char *msg, const char *path)
{
    (void) level; /* unused */
    if (store) {
        if (path && path[0]) {
            snprintf(logbuf, BUFSIZE - 1, "%s %s", msg, path);
        } else {
            strncpy(logbuf, msg, BUFSIZE - 1);
        }
        if (store > 0) {
            --store;
        }
    }
}
#endif

static int
setup(void **state)
{
    (void) state; /* unused */

    const char *schema_a = "module a {namespace urn:tests:a;prefix a;yang-version 1.1;"
            "list l1 { key \"a b\"; leaf a {type string;} leaf b {type string;} leaf c {type string;}}"
            "leaf foo { type uint16;}"
            "leaf-list ll { type string;}"
            "container c {leaf-list x {type string;}}"
            "anydata any {config false;}"
            "list l2 {config false; container c{leaf x {type string;}}}}";

#if ENABLE_LOGGER_CHECKING
    ly_set_log_clb(logger, 1);
#endif

    assert_int_equal(LY_SUCCESS, ly_ctx_new(NULL, 0, &ctx));
    assert_non_null(lys_parse_mem(ctx, schema_a, LYS_IN_YANG));

    return 0;
}

static int
teardown(void **state)
{
#if ENABLE_LOGGER_CHECKING
    if (*state) {
        fprintf(stderr, "%s\n", logbuf);
    }
#else
    (void) state; /* unused */
#endif

    ly_ctx_destroy(ctx, NULL);
    ctx = NULL;

    return 0;
}

void
logbuf_clean(void)
{
    logbuf[0] = '\0';
}

#if ENABLE_LOGGER_CHECKING
#   define logbuf_assert(str) assert_string_equal(logbuf, str)
#else
#   define logbuf_assert(str)
#endif

static void
test_top_level(void **state)
{
    *state = test_top_level;

    const struct lys_module *mod;
    struct lyd_node *node;

    /* we need the module first */
    mod = ly_ctx_get_module_implemented(ctx, "a");
    assert_non_null(mod);

    /* list */
    node = lyd_new_list(NULL, mod, "l1", "val_a", "val_b");
    assert_non_null(node);
    lyd_free_tree(node);

    node = lyd_new_list2(NULL, mod, "l1", "[]");
    assert_null(node);
    logbuf_assert("Unexpected XPath token ] (]).");

    node = lyd_new_list2(NULL, mod, "l1", "[key1='a'][key2='b']");
    assert_null(node);
    logbuf_assert("Not found node \"key1\" in path.");

    node = lyd_new_list2(NULL, mod, "l1", "[a='a'][b='b'][c='c']");
    assert_null(node);
    logbuf_assert("Key expected instead of leaf \"c\" in path. /a:l1/c");

    node = lyd_new_list2(NULL, mod, "c", "[a='a'][b='b']");
    assert_null(node);
    logbuf_assert("List node \"c\" not found.");

    node = lyd_new_list2(NULL, mod, "l1", "[a='a'][b='b']");
    assert_non_null(node);
    lyd_free_tree(node);

    node = lyd_new_list2(NULL, mod, "l1", "[a=''][b='']");
    assert_non_null(node);
    lyd_free_tree(node);

    node = lyd_new_list2(NULL, mod, "l1", "[a:a='a'][a:b='b']");
    assert_non_null(node);
    lyd_free_tree(node);

    node = lyd_new_list2(NULL, mod, "l1", "[a=   'a']\n[b  =\t'b']");
    assert_non_null(node);
    lyd_free_tree(node);

    /* leaf */
    node = lyd_new_term(NULL, mod, "foo", "[a='a'][b='b'][c='c']");
    assert_null(node);
    logbuf_assert("Invalid uint16 value \"[a='a'][b='b'][c='c']\". /a:foo");

    node = lyd_new_term(NULL, mod, "c", "value");
    assert_null(node);
    logbuf_assert("Term node \"c\" not found.");

    node = lyd_new_term(NULL, mod, "foo", "256");
    assert_non_null(node);
    lyd_free_tree(node);

    /* leaf-list */
    node = lyd_new_term(NULL, mod, "ll", "ahoy");
    assert_non_null(node);
    lyd_free_tree(node);

    /* container */
    node = lyd_new_inner(NULL, mod, "c");
    assert_non_null(node);
    lyd_free_tree(node);

    node = lyd_new_inner(NULL, mod, "l1");
    assert_null(node);
    logbuf_assert("Inner node (and not a list) \"l1\" not found.");

    node = lyd_new_inner(NULL, mod, "l2");
    assert_null(node);
    logbuf_assert("Inner node (and not a list) \"l2\" not found.");

    /* anydata */
    node = lyd_new_any(NULL, mod, "any", "some-value", LYD_ANYDATA_STRING);
    assert_non_null(node);
    lyd_free_tree(node);

    /* key-less list */
    node = lyd_new_list2(NULL, mod, "l2", "[a='a'][b='b']");
    assert_null(node);
    logbuf_assert("List predicate defined for keyless list \"l2\" in path.");

    node = lyd_new_list2(NULL, mod, "l2", "");
    assert_non_null(node);
    lyd_free_tree(node);

    node = lyd_new_list2(NULL, mod, "l2", NULL);
    assert_non_null(node);
    lyd_free_tree(node);

    node = lyd_new_list(NULL, mod, "l2");
    assert_non_null(node);
    lyd_free_tree(node);

    *state = NULL;
}

static void
test_opaq(void **state)
{
    *state = test_opaq;

    struct lyd_node *root, *node;
    struct lyd_node_opaq *opq;

    root = lyd_new_opaq(NULL, ctx, "node1", NULL, "my-module");
    assert_non_null(root);
    assert_null(root->schema);
    opq = (struct lyd_node_opaq *)root;
    assert_string_equal(opq->name, "node1");
    assert_string_equal(opq->value, "");
    assert_string_equal(opq->prefix.ns, "my-module");

    node = lyd_new_opaq(root, NULL, "node2", "value", "my-module2");
    assert_non_null(node);
    assert_null(node->schema);
    opq = (struct lyd_node_opaq *)node;
    assert_string_equal(opq->name, "node2");
    assert_string_equal(opq->value, "value");
    assert_string_equal(opq->prefix.ns, "my-module2");
    assert_ptr_equal(opq->parent, root);

    lyd_free_tree(root);

    *state = NULL;
}

static void
test_path(void **state)
{
    *state = test_path;

    LY_ERR ret;
    struct lyd_node *root, *node, *parent;
    int dynamic;

    /* create 2 nodes */
    ret = lyd_new_path2(NULL, ctx, "/a:c/x[.='val']", "vvv", 0, 0, &root, &node);
    assert_int_equal(ret, LY_SUCCESS);
    assert_non_null(root);
    assert_string_equal(root->schema->name, "c");
    assert_non_null(node);
    assert_string_equal(node->schema->name, "x");
    assert_string_equal("val", lyd_value2str((struct lyd_node_term *)node, &dynamic));
    assert_int_equal(dynamic, 0);

    /* append another */
    ret = lyd_new_path2(root, NULL, "/a:c/x", "val2", 0, 0, &parent, &node);
    assert_int_equal(ret, LY_SUCCESS);
    assert_ptr_equal(parent, node);
    assert_string_equal(node->schema->name, "x");
    assert_string_equal("val2", lyd_value2str((struct lyd_node_term *)node, &dynamic));
    assert_int_equal(dynamic, 0);

    /* and a last one */
    ret = lyd_new_path2(root, NULL, "x", "val3", 0, 0, &parent, &node);
    assert_int_equal(ret, LY_SUCCESS);
    assert_ptr_equal(parent, node);
    assert_string_equal(node->schema->name, "x");
    assert_string_equal("val3", lyd_value2str((struct lyd_node_term *)node, &dynamic));
    assert_int_equal(dynamic, 0);

    lyd_free_tree(root);

    /* try LYD_NEWOPT_OPAQ */
    ret = lyd_new_path2(NULL, ctx, "/a:l1", NULL, 0, 0, NULL, NULL);
    assert_int_equal(ret, LY_EINVAL);
    logbuf_assert("Predicate missing for list \"l1\" in path.");

    ret = lyd_new_path2(NULL, ctx, "/a:l1", NULL, 0, LYD_NEWOPT_OPAQ, NULL, &root);
    assert_int_equal(ret, LY_SUCCESS);
    assert_non_null(root);
    assert_null(root->schema);

    lyd_free_tree(root);

    ret = lyd_new_path2(NULL, ctx, "/a:foo", NULL, 0, 0, NULL, NULL);
    assert_int_equal(ret, LY_EVALID);
    logbuf_assert("Invalid empty uint16 value. /a:foo");

    ret = lyd_new_path2(NULL, ctx, "/a:foo", NULL, 0, LYD_NEWOPT_OPAQ, NULL, &root);
    assert_int_equal(ret, LY_SUCCESS);
    assert_non_null(root);
    assert_null(root->schema);

    lyd_free_tree(root);

    /* try LYD_NEWOPT_UPDATE */
    ret = lyd_new_path2(NULL, ctx, "/a:l2[1]/c/x", "val", 0, 0, &root, &node);
    assert_int_equal(ret, LY_SUCCESS);
    assert_non_null(root);
    assert_string_equal(node->schema->name, "x");
    assert_string_equal("val", lyd_value2str((struct lyd_node_term *)node, &dynamic));
    assert_int_equal(dynamic, 0);

    ret = lyd_new_path2(root, NULL, "/a:l2[1]/c/x", "val", 0, 0, NULL, &node);
    assert_int_equal(ret, LY_EEXIST);

    ret = lyd_new_path2(root, NULL, "/a:l2[1]/c/x", "val", 0, LYD_NEWOPT_UPDATE, NULL, &node);
    assert_int_equal(ret, LY_SUCCESS);
    assert_null(node);

    ret = lyd_new_path2(root, NULL, "/a:l2[1]/c/x", "val2", 0, LYD_NEWOPT_UPDATE, NULL, &node);
    assert_int_equal(ret, LY_SUCCESS);
    assert_non_null(node);
    assert_string_equal(node->schema->name, "x");
    assert_string_equal("val2", lyd_value2str((struct lyd_node_term *)node, &dynamic));
    assert_int_equal(dynamic, 0);

    lyd_free_tree(root);

    *state = NULL;
}

int main(void)
{
    const struct CMUnitTest tests[] = {
        cmocka_unit_test_setup_teardown(test_top_level, setup, teardown),
        cmocka_unit_test_setup_teardown(test_opaq, setup, teardown),
        cmocka_unit_test_setup_teardown(test_path, setup, teardown),
    };

    return cmocka_run_group_tests(tests, NULL, NULL);
}