shaba/lvm2
1
0
Fork 0
mirror of git://sourceware.org/git/lvm2.git synced 2024-12-22 17:35:59 +03:00
Code Releases Activity
8c4b8c6e27
lvm2/test/unit/units.h

56 lines
1.7 KiB
C
Raw Normal View History

[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
/*
* Copyright (C) 2018 Red Hat, Inc. All rights reserved.
*
* This file is part of LVM2.
*
* This copyrighted material is made available to anyone wishing to use,
* modify, copy, or redistribute it subject to the terms and conditions
* of the GNU General Public License v.2.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef TEST_UNIT_UNITS_H
#define TEST_UNIT_UNITS_H
#include "framework.h"
//-----------------------------------------------------------------
// Declare the function that adds tests suites here ...
void bcache_tests(struct dm_list *suites);
unit-test: a bunch of tests for bcache-utils
2018-05-03 22:13:13 +03:00
void bcache_utils_tests(struct dm_list *suites);
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
void bitset_tests(struct dm_list *suites);
void config_tests(struct dm_list *suites);
void dm_list_tests(struct dm_list *suites);
void dm_status_tests(struct dm_list *suites);
bcache: write some sanity checks for the asyn io engine Mainly checks aio is installed properly.
2018-04-27 16:24:05 +03:00
void io_engine_tests(struct dm_list *suites);
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
void percent_tests(struct dm_list *suites);
radix-tree: First drop of radix tree. An implementation of an adaptive radix tree. Has the following nice properties: - At least as fast as the hash table - Uses less memory - You don't need to give an expected size when you create - It scales nicely (ie. no large reallocations like the hash table). - You can iterate the keys in lexicographical order. Only insert and lookup are implemented so far. Plus there's a lot more performance to come.
2018-05-11 08:10:01 +03:00
void radix_tree_tests(struct dm_list *suites);
void regex_tests(struct dm_list *suites);
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
void string_tests(struct dm_list *suites);
vdo status: Unit tests + fix bugs
2018-05-10 15:01:26 +03:00
void vdo_tests(struct dm_list *suites);
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
// ... and call it in here.
static inline void register_all_tests(struct dm_list *suites)
{
bcache_tests(suites);
unit-test: a bunch of tests for bcache-utils
2018-05-03 22:13:13 +03:00
bcache_utils_tests(suites);
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
bitset_tests(suites);
config_tests(suites);
dm_list_tests(suites);
dm_status_tests(suites);
bcache: write some sanity checks for the asyn io engine Mainly checks aio is installed properly.
2018-04-27 16:24:05 +03:00
io_engine_tests(suites);
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
percent_tests(suites);
radix-tree: First drop of radix tree. An implementation of an adaptive radix tree. Has the following nice properties: - At least as fast as the hash table - Uses less memory - You don't need to give an expected size when you create - It scales nicely (ie. no large reallocations like the hash table). - You can iterate the keys in lexicographical order. Only insert and lookup are implemented so far. Plus there's a lot more performance to come.
2018-05-11 08:10:01 +03:00
radix_tree_tests(suites);
regex_tests(suites);
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
string_tests(suites);
vdo status: Unit tests + fix bugs
2018-05-10 15:01:26 +03:00
vdo_tests(suites);
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
}
//-----------------------------------------------------------------
radix-tree: First drop of radix tree. An implementation of an adaptive radix tree. Has the following nice properties: - At least as fast as the hash table - Uses less memory - You don't need to give an expected size when you create - It scales nicely (ie. no large reallocations like the hash table). - You can iterate the keys in lexicographical order. Only insert and lookup are implemented so far. Plus there's a lot more performance to come.
2018-05-11 08:10:01 +03:00
[unit-test] Push the new unit test framwork. See doc/unit-test.txt for details. Some bcache tests failing. Probably due to dct changing semantics, will fix in follow up patch.
2018-04-26 13:59:39 +03:00
#endif
Copy Permalink