diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 18:45:59 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 18:45:59 +0000 |
commit | 19fcec84d8d7d21e796c7624e521b60d28ee21ed (patch) | |
tree | 42d26aa27d1e3f7c0b8bd3fd14e7d7082f5008dc /src/test/mon/test_mon_types.cc | |
parent | Initial commit. (diff) | |
download | ceph-upstream/16.2.11+ds.tar.xz ceph-upstream/16.2.11+ds.zip |
Adding upstream version 16.2.11+ds.upstream/16.2.11+dsupstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'src/test/mon/test_mon_types.cc')
-rw-r--r-- | src/test/mon/test_mon_types.cc | 140 |
1 files changed, 140 insertions, 0 deletions
diff --git a/src/test/mon/test_mon_types.cc b/src/test/mon/test_mon_types.cc new file mode 100644 index 000000000..e9997f14f --- /dev/null +++ b/src/test/mon/test_mon_types.cc @@ -0,0 +1,140 @@ +// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- +// vim: ts=8 sw=2 smarttab +/* + * Ceph - scalable distributed file system + * + * Copyright (C) 2012 Inktank + * + * This is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License version 2.1, as published by the Free Software + * Foundation. See file COPYING. + * + */ +#include <iostream> +#include "mon/mon_types.h" + +#include "gtest/gtest.h" + +TEST(mon_features, supported_v_persistent) { + + mon_feature_t supported = ceph::features::mon::get_supported(); + mon_feature_t persistent = ceph::features::mon::get_persistent(); + + ASSERT_EQ(supported.intersection(persistent), persistent); + ASSERT_TRUE(supported.contains_all(persistent)); + + mon_feature_t diff = supported.diff(persistent); + ASSERT_TRUE((persistent | diff) == supported); + ASSERT_TRUE((supported & persistent) == persistent); +} + +TEST(mon_features, binary_ops) { + + mon_feature_t FEATURE_NONE(0ULL); + mon_feature_t FEATURE_A((1ULL << 1)); + mon_feature_t FEATURE_B((1ULL << 2)); + mon_feature_t FEATURE_C((1ULL << 3)); + mon_feature_t FEATURE_D((1ULL << 4)); + + mon_feature_t FEATURE_ALL( + FEATURE_A | FEATURE_B | + FEATURE_C | FEATURE_D + ); + + mon_feature_t foo(FEATURE_A|FEATURE_B); + mon_feature_t bar(FEATURE_C|FEATURE_D); + + ASSERT_EQ(FEATURE_A|FEATURE_B, foo); + ASSERT_EQ(FEATURE_C|FEATURE_D, bar); + + ASSERT_NE(FEATURE_C, foo); + ASSERT_NE(FEATURE_B, bar); + ASSERT_NE(FEATURE_NONE, foo); + ASSERT_NE(FEATURE_NONE, bar); + + ASSERT_FALSE(foo.empty()); + ASSERT_FALSE(bar.empty()); + ASSERT_TRUE(FEATURE_NONE.empty()); + + ASSERT_EQ(FEATURE_ALL, (foo ^ bar)); + ASSERT_EQ(FEATURE_NONE, (foo & bar)); + + mon_feature_t baz = foo; + ASSERT_EQ(baz, foo); + + baz |= bar; + ASSERT_EQ(FEATURE_ALL, baz); + baz ^= foo; + ASSERT_EQ(baz, bar); + + baz |= FEATURE_A; + ASSERT_EQ(FEATURE_C, baz & FEATURE_C); + ASSERT_EQ((FEATURE_A|FEATURE_D), baz & (FEATURE_A|FEATURE_D)); + ASSERT_EQ(FEATURE_B|FEATURE_C|FEATURE_D, (baz ^ foo)); +} + +TEST(mon_features, set_funcs) { + + mon_feature_t FEATURE_A((1ULL << 1)); + mon_feature_t FEATURE_B((1ULL << 2)); + mon_feature_t FEATURE_C((1ULL << 3)); + mon_feature_t FEATURE_D((1ULL << 4)); + + mon_feature_t FEATURE_ALL( + FEATURE_A | FEATURE_B | + FEATURE_C | FEATURE_D + ); + + mon_feature_t foo(FEATURE_A|FEATURE_B); + mon_feature_t bar(FEATURE_C|FEATURE_D); + + ASSERT_TRUE(FEATURE_ALL.contains_all(foo)); + ASSERT_TRUE(FEATURE_ALL.contains_all(bar)); + ASSERT_TRUE(FEATURE_ALL.contains_all(foo|bar)); + + ASSERT_EQ(foo.diff(bar), foo); + ASSERT_EQ(bar.diff(foo), bar); + ASSERT_EQ(FEATURE_ALL.diff(foo), bar); + ASSERT_EQ(FEATURE_ALL.diff(bar), foo); + + ASSERT_TRUE(foo.contains_any(FEATURE_A|bar)); + ASSERT_TRUE(bar.contains_any(FEATURE_ALL)); + ASSERT_TRUE(FEATURE_ALL.contains_any(foo)); + + mon_feature_t FEATURE_X((1ULL << 10)); + + ASSERT_FALSE(FEATURE_ALL.contains_any(FEATURE_X)); + ASSERT_FALSE(FEATURE_ALL.contains_all(FEATURE_X)); + ASSERT_EQ(FEATURE_ALL.diff(FEATURE_X), FEATURE_ALL); + + ASSERT_EQ(foo.intersection(FEATURE_ALL), foo); + ASSERT_EQ(bar.intersection(FEATURE_ALL), bar); +} + +TEST(mon_features, set_unset) { + + mon_feature_t FEATURE_A((1ULL << 1)); + mon_feature_t FEATURE_B((1ULL << 2)); + mon_feature_t FEATURE_C((1ULL << 3)); + + mon_feature_t foo; + ASSERT_EQ(ceph::features::mon::FEATURE_NONE, foo); + + foo.set_feature(FEATURE_A); + ASSERT_EQ(FEATURE_A, foo); + ASSERT_TRUE(foo.contains_all(FEATURE_A)); + + foo.set_feature(FEATURE_B|FEATURE_C); + ASSERT_EQ((FEATURE_A|FEATURE_B|FEATURE_C), foo); + ASSERT_TRUE(foo.contains_all((FEATURE_A|FEATURE_B|FEATURE_C))); + + foo.unset_feature(FEATURE_A); + ASSERT_EQ((FEATURE_B|FEATURE_C), foo); + ASSERT_FALSE(foo.contains_any(FEATURE_A)); + ASSERT_TRUE(foo.contains_all((FEATURE_B|FEATURE_C))); + + foo.unset_feature(FEATURE_B|FEATURE_C); + ASSERT_EQ(ceph::features::mon::FEATURE_NONE, foo); + ASSERT_FALSE(foo.contains_any(FEATURE_A|FEATURE_B|FEATURE_C)); +} |