/*
* Tests exercising the ldb parse operations.
*
* Copyright (C) Catalyst.NET Ltd 2017
* Copyright (C) Michael Hanselmann 2019
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*
*/
#include
#include
#include
#include
#include
#include "../include/ldb.h"
struct test_ctx { uint8_t dummy; };
static int setup(void **state)
{
struct test_ctx *ctx;
ctx = talloc_zero(NULL, struct test_ctx);
assert_non_null(ctx);
*state = ctx;
return 0;
}
static int teardown(void **state)
{
struct test_ctx *ctx =
talloc_get_type_abort(*state, struct test_ctx);
talloc_free(ctx);
return 0;
}
static void test_roundtrip(TALLOC_CTX *mem_ctx, const char *filter, const char *expected)
{
struct ldb_parse_tree *tree;
char *serialized;
assert_non_null(filter);
assert_non_null(expected);
tree = ldb_parse_tree(mem_ctx, filter);
assert_non_null(tree);
serialized = ldb_filter_from_tree(mem_ctx, tree);
assert_non_null(serialized);
assert_string_equal(serialized, expected);
}
static void test_parse_filtertype(void **state)
{
struct test_ctx *ctx =
talloc_get_type_abort(*state, struct test_ctx);
test_roundtrip(ctx, "", "(|(objectClass=*)(distinguishedName=*))");
test_roundtrip(ctx, "a=value", "(a=value)");
test_roundtrip(ctx, "(|(foo=bar)(baz=hello))", "(|(foo=bar)(baz=hello))");
test_roundtrip(ctx, " ", "(|(objectClass=*)(distinguishedName=*))");
}
/*
* Test that a nested query with 128 levels of nesting is accepted
*/
static void test_nested_filter_eq_limit(void **state)
{
struct test_ctx *ctx =
talloc_get_type_abort(*state, struct test_ctx);
/*
* 128 nested clauses
*/
const char *nested_query = ""
"(|(!(|(&(|(|(|(|(|(|(|(|(|(|(|(|"
"(|(!(|(&(|(|(|(|(|(|(!(|(!(|(|(|"
"(|(!(|(&(|(|(&(|(|(|(|(|(!(!(!(|"
"(|(!(|(&(|(|(|(|(|(|(|(|(|(|(|(|"
"(|(!(|(&(|(|(|(!(|(|(&(|(|(|(|(|"
"(|(!(|(&(|(|(&(|(|(|(|(|(&(&(|(|"
"(|(!(|(&(|(|(|(|(|(|(!(|(|(|(|(|"
"(|(!(|(&(|(|(!(|(|(|(|(|(|(|(|(|"
"(a=b)"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))";
struct ldb_parse_tree *tree = ldb_parse_tree(ctx, nested_query);
assert_non_null(tree);
/*
* Check that we get the same query back
*/
test_roundtrip(ctx, nested_query, nested_query);
}
/*
* Test that a nested query with 129 levels of nesting is rejected.
*/
static void test_nested_filter_gt_limit(void **state)
{
struct test_ctx *ctx =
talloc_get_type_abort(*state, struct test_ctx);
/*
* 129 nested clauses
*/
const char *nested_query = ""
"(|(!(|(|(&(|(|(|(|(&(|(|(|(|(|(|"
"(|(!(|(|(&(|(|(|(|(|(|(|(|(|(|(|"
"(|(!(|(|(&(|(|(!(|(|(|(|(!(|(|(|"
"(|(!(|(|(&(|(|(|(|(|(|(|(|(|(|(|"
"(|(!(|(|(&(|(|(|(!(&(|(|(|(|(|(|"
"(|(!(|(|(&(|(|(|(|(|(|(|(|(|(|(|"
"(|(!(|(|(&(|(|(|(|(|(|(|(|(|(|(|"
"(|(!(|(|(&(|(|(|(|(|(|(|(|(&(|(|"
"(|"
"(a=b)"
")"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))"
"))))))))))))))))";
struct ldb_parse_tree *tree = ldb_parse_tree(ctx, nested_query);
assert_null(tree);
}
int main(int argc, const char **argv)
{
const struct CMUnitTest tests[] = {
cmocka_unit_test_setup_teardown(
test_parse_filtertype, setup, teardown),
cmocka_unit_test_setup_teardown(
test_nested_filter_eq_limit, setup, teardown),
cmocka_unit_test_setup_teardown(
test_nested_filter_gt_limit, setup, teardown),
};
cmocka_set_message_output(CM_OUTPUT_SUBUNIT);
return cmocka_run_group_tests(tests, NULL, NULL);
}