2 * Asterisk -- An open source telephony toolkit.
4 * Copyright (C) 2011, Digium, Inc.
6 * Terry Wilson <twilson@digium.com>
8 * See http://www.asterisk.org for more information about
9 * the Asterisk project. Please do not directly contact
10 * any of the maintainers of this project for assistance;
11 * the project provides a web site, mailing lists and IRC
12 * channels for your use.
14 * This program is free software, distributed under the terms of
15 * the GNU General Public License Version 2. See the LICENSE file
16 * at the top of the source tree.
21 * \brief AstDB Unit Tests
23 * \author Terry Wilson <twilson@digium.com>
28 <depend>TEST_FRAMEWORK</depend>
29 <support_level>core</support_level>
34 ASTERISK_FILE_VERSION(__FILE__, "")
36 #include "asterisk/test.h"
37 #include "asterisk/module.h"
38 #include "asterisk/astdb.h"
39 #include "asterisk/logger.h"
47 /* Longest value we can support is 256 for family/key/ so, with
48 * family = astdbtest and two slashes we are left with 244 bytes */
49 static const char long_val[] = "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx";
51 AST_TEST_DEFINE(put_get_del)
53 int res = AST_TEST_PASS;
54 const char *inputs[][3] = {
55 {"family", "key", "value"},
56 {"astdbtest", "a", "b"},
57 {"astdbtest", "a", "a"},
58 {"astdbtest", "b", "a"},
59 {"astdbtest", "b", "b"},
60 {"astdbtest", "b", "!@#$%^&*()|+-<>?"},
61 {"astdbtest", long_val, "b"},
62 {"astdbtest", "b", long_val},
63 {"astdbtest", "!@#$%^&*()|+-<>?", "b"},
66 char buf[sizeof(long_val)] = { 0, };
70 info->name = "put_get_del";
71 info->category = "/main/astdb/";
72 info->summary = "ast_db_(put|get|del) unit test";
74 "Ensures that the ast_db put, get, and del functions work";
75 return AST_TEST_NOT_RUN;
80 for (x = 0; x < ARRAY_LEN(inputs); x++) {
81 if (ast_db_put(inputs[x][FAMILY], inputs[x][KEY], inputs[x][VALUE])) {
82 ast_test_status_update(test, "Failed to put %s : %s : %s\n", inputs[x][FAMILY], inputs[x][KEY], inputs[x][VALUE]);
85 if (ast_db_get(inputs[x][FAMILY], inputs[x][KEY], buf, sizeof(buf))) {
86 ast_test_status_update(test, "Failed to get %s : %s : %s\n", inputs[x][FAMILY], inputs[x][KEY], inputs[x][VALUE]);
88 } else if (strcmp(buf, inputs[x][VALUE])) {
89 ast_test_status_update(test, "Failed to match key '%s/%s' value '%s' to '%s'\n", inputs[x][FAMILY], inputs[x][KEY], inputs[x][VALUE], buf);
92 if (ast_db_del(inputs[x][FAMILY], inputs[x][KEY])) {
93 ast_test_status_update(test, "Failed to del %s : %s\n", inputs[x][FAMILY], inputs[x][KEY]);
101 AST_TEST_DEFINE(gettree_deltree)
103 int res = AST_TEST_PASS;
104 const char *inputs[][3] = {
105 #define BASE "astdbtest"
108 #define FAM1 BASE "/" SUB1
109 #define FAM2 BASE "/" SUB2
110 {FAM1, "one", "blah"},
111 {FAM1, "two", "bling"},
112 {FAM1, "three", "blast"},
113 {FAM2, "one", "blah"},
114 {FAM2, "two", "bling"},
115 {FAM2, "three", "blast"},
118 struct ast_db_entry *dbes, *cur;
123 info->name = "gettree_deltree";
124 info->category = "/main/astdb/";
125 info->summary = "ast_db_(gettree|deltree) unit test";
127 "Ensures that the ast_db gettree and deltree functions work";
128 return AST_TEST_NOT_RUN;
133 for (x = 0; x < ARRAY_LEN(inputs); x++) {
134 if (ast_db_put(inputs[x][FAMILY], inputs[x][KEY], inputs[x][VALUE])) {
135 ast_test_status_update(test, "Failed to put %s : %s : %s\n", inputs[x][FAMILY], inputs[x][KEY], inputs[x][VALUE]);
140 if (!(dbes = ast_db_gettree(BASE, NULL))) {
141 ast_test_status_update(test, "Failed to ast_db_gettree family %s\n", BASE);
145 for (cur = dbes, x = 0; cur; cur = cur->next, x++) {
148 for (z = 0; z < ARRAY_LEN(inputs); z++) {
150 snprintf(buf, sizeof(buf), "/%s/%s", inputs[z][FAMILY], inputs[z][KEY]);
151 if (!strcmp(buf, cur->key) && !strcmp(inputs[z][VALUE], cur->data)) {
156 ast_test_status_update(test, "inputs array has no entry for %s == %s\n", cur->key, cur->data);
161 if (x != ARRAY_LEN(inputs)) {
162 ast_test_status_update(test, "ast_db_gettree returned %zu entries when we expected %zu\n", x, ARRAY_LEN(inputs));
166 ast_db_freetree(dbes);
168 if (!(dbes = ast_db_gettree(BASE, SUB1))) {
169 ast_test_status_update(test, "Failed to ast_db_gettree for %s/%s\n", BASE, SUB1);
173 for (cur = dbes, x = 0; cur; cur = cur->next, x++) {
176 for (z = 0; z < ARRAY_LEN(inputs); z++) {
178 snprintf(buf, sizeof(buf), "/%s/%s", inputs[z][FAMILY], inputs[z][KEY]);
179 if (!strcmp(buf, cur->key) && !strcmp(inputs[z][VALUE], cur->data)) {
184 ast_test_status_update(test, "inputs array has no entry for %s == %s\n", cur->key, cur->data);
189 if (x != (ARRAY_LEN(inputs) / 2)) {
190 ast_test_status_update(test, "ast_db_gettree returned %zu entries when we expected %zu\n", x, ARRAY_LEN(inputs) / 2);
194 ast_db_freetree(dbes);
196 if ((num_deleted = ast_db_deltree(BASE, SUB2)) != ARRAY_LEN(inputs) / 2) {
197 ast_test_status_update(test, "Failed to deltree %s/%s, expected %zu deletions and got %d\n", BASE, SUB2, ARRAY_LEN(inputs) / 2, num_deleted);
201 if ((num_deleted = ast_db_deltree(BASE, NULL)) != ARRAY_LEN(inputs) / 2) {
202 ast_test_status_update(test, "Failed to deltree %s, expected %zu deletions and got %d\n", BASE, ARRAY_LEN(inputs) / 2, num_deleted);
209 AST_TEST_DEFINE(perftest)
211 int res = AST_TEST_PASS;
217 info->name = "perftest";
218 info->category = "/main/astdb/";
219 info->summary = "astdb performance unit test";
221 "Measure astdb performance";
222 return AST_TEST_NOT_RUN;
227 for (x = 0; x < 100000; x++) {
228 sprintf(buf, "%zu", x);
229 ast_db_put("astdbtest", buf, buf);
231 ast_db_deltree("astdbtest", NULL);
236 AST_TEST_DEFINE(put_get_long)
238 int res = AST_TEST_PASS;
242 #define STR_FILL_32 "abcdefghijklmnopqrstuvwxyz123456"
246 info->name = "put_get_long";
247 info->category = "/main/astdb/";
248 info->summary = "ast_db_(put|get_allocated) unit test";
250 "Ensures that the ast_db_put and ast_db_get_allocated functions work";
251 return AST_TEST_NOT_RUN;
256 if (!(s = ast_str_create(4096))) {
257 return AST_TEST_FAIL;
260 for (i = 1024; i <= 1024 * 1024 * 8; i *= 2) {
265 for (j = 0; j < i; j += sizeof(STR_FILL_32) - 1) {
266 ast_str_append(&s, 0, "%s", STR_FILL_32);
269 if (ast_db_put("astdbtest", "long", ast_str_buffer(s))) {
270 ast_test_status_update(test, "Failed to put value of %zu bytes\n", ast_str_strlen(s));
272 } else if (ast_db_get_allocated("astdbtest", "long", &out)) {
273 ast_test_status_update(test, "Failed to get value of %zu bytes\n", ast_str_strlen(s));
275 } else if (strcmp(ast_str_buffer(s), out)) {
276 ast_test_status_update(test, "Failed to match value of %zu bytes\n", ast_str_strlen(s));
278 } else if (ast_db_del("astdbtest", "long")) {
279 ast_test_status_update(test, "Failed to delete astdbtest/long\n");
293 static int unload_module(void)
295 AST_TEST_UNREGISTER(put_get_del);
296 AST_TEST_UNREGISTER(gettree_deltree);
297 AST_TEST_UNREGISTER(perftest);
298 AST_TEST_UNREGISTER(put_get_long);
302 static int load_module(void)
304 AST_TEST_REGISTER(put_get_del);
305 AST_TEST_REGISTER(gettree_deltree);
306 AST_TEST_REGISTER(perftest);
307 AST_TEST_REGISTER(put_get_long);
308 return AST_MODULE_LOAD_SUCCESS;
311 AST_MODULE_INFO_STANDARD(ASTERISK_GPL_KEY, "AstDB test module");