+++ /dev/null
-// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
-// vim: ts=8 sw=2 smarttab
-/*
- * Ceph distributed storage system
- *
- * Copyright (C) 2013,2014 Cloudwatt <libre.licensing@cloudwatt.com>
- * Copyright (C) 2014 Red Hat <contact@redhat.com>
- *
- * Author: Loic Dachary <loic@dachary.org>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- */
-
-#include <errno.h>
-#include <stdlib.h>
-
-#include "crush/CrushWrapper.h"
-#include "include/stringify.h"
-#include "erasure-code/jerasure/ErasureCodeJerasure.h"
-#include "global/global_context.h"
-#include "common/config.h"
-#include "gtest/gtest.h"
-
-
-template <typename T>
-class ErasureCodeTest : public ::testing::Test {
- public:
-};
-
-typedef ::testing::Types<
- ErasureCodeJerasureReedSolomonVandermonde,
- ErasureCodeJerasureReedSolomonRAID6,
- ErasureCodeJerasureCauchyOrig,
- ErasureCodeJerasureCauchyGood,
- ErasureCodeJerasureLiberation,
- ErasureCodeJerasureBlaumRoth,
- ErasureCodeJerasureLiber8tion
-> JerasureTypes;
-TYPED_TEST_CASE(ErasureCodeTest, JerasureTypes);
-
-TYPED_TEST(ErasureCodeTest, sanity_check_k)
-{
- TypeParam jerasure;
- ErasureCodeProfile profile;
- profile["k"] = "1";
- profile["m"] = "1";
- profile["packetsize"] = "8";
- ostringstream errors;
- EXPECT_EQ(-EINVAL, jerasure.init(profile, &errors));
- EXPECT_NE(std::string::npos, errors.str().find("must be >= 2"));
-}
-
-TYPED_TEST(ErasureCodeTest, encode_decode)
-{
- const char *per_chunk_alignments[] = { "false", "true" };
- for (int per_chunk_alignment = 0 ;
- per_chunk_alignment < 2;
- per_chunk_alignment++) {
- TypeParam jerasure;
- ErasureCodeProfile profile;
- profile["k"] = "2";
- profile["m"] = "2";
- profile["packetsize"] = "8";
- profile["jerasure-per-chunk-alignment"] =
- per_chunk_alignments[per_chunk_alignment];
- jerasure.init(profile, &cerr);
-
-#define LARGE_ENOUGH 2048
- bufferptr in_ptr(buffer::create_page_aligned(LARGE_ENOUGH));
- in_ptr.zero();
- in_ptr.set_length(0);
- const char *payload =
- "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"
- "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"
- "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"
- "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"
- "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
- in_ptr.append(payload, strlen(payload));
- bufferlist in;
- in.push_front(in_ptr);
- int want_to_encode[] = { 0, 1, 2, 3 };
- map<int, bufferlist> encoded;
- EXPECT_EQ(0, jerasure.encode(set<int>(want_to_encode, want_to_encode+4),
- in,
- &encoded));
- EXPECT_EQ(4u, encoded.size());
- unsigned length = encoded[0].length();
- EXPECT_EQ(0, memcmp(encoded[0].c_str(), in.c_str(), length));
- EXPECT_EQ(0, memcmp(encoded[1].c_str(), in.c_str() + length,
- in.length() - length));
-
-
- // all chunks are available
- {
- int want_to_decode[] = { 0, 1 };
- map<int, bufferlist> decoded;
- EXPECT_EQ(0, jerasure.decode(set<int>(want_to_decode, want_to_decode+2),
- encoded,
- &decoded));
- EXPECT_EQ(2u, decoded.size());
- EXPECT_EQ(length, decoded[0].length());
- EXPECT_EQ(0, memcmp(decoded[0].c_str(), in.c_str(), length));
- EXPECT_EQ(0, memcmp(decoded[1].c_str(), in.c_str() + length,
- in.length() - length));
- }
-
- // two chunks are missing
- {
- map<int, bufferlist> degraded = encoded;
- degraded.erase(0);
- degraded.erase(1);
- EXPECT_EQ(2u, degraded.size());
- int want_to_decode[] = { 0, 1 };
- map<int, bufferlist> decoded;
- EXPECT_EQ(0, jerasure.decode(set<int>(want_to_decode, want_to_decode+2),
- degraded,
- &decoded));
- // always decode all, regardless of want_to_decode
- EXPECT_EQ(4u, decoded.size());
- EXPECT_EQ(length, decoded[0].length());
- EXPECT_EQ(0, memcmp(decoded[0].c_str(), in.c_str(), length));
- EXPECT_EQ(0, memcmp(decoded[1].c_str(), in.c_str() + length,
- in.length() - length));
- }
- }
-}
-
-TYPED_TEST(ErasureCodeTest, minimum_to_decode)
-{
- TypeParam jerasure;
- ErasureCodeProfile profile;
- profile["k"] = "2";
- profile["m"] = "2";
- profile["w"] = "7";
- profile["packetsize"] = "8";
- jerasure.init(profile, &cerr);
-
- //
- // If trying to read nothing, the minimum is empty.
- //
- {
- set<int> want_to_read;
- set<int> available_chunks;
- set<int> minimum;
-
- EXPECT_EQ(0, jerasure.minimum_to_decode(want_to_read,
- available_chunks,
- &minimum));
- EXPECT_TRUE(minimum.empty());
- }
- //
- // There is no way to read a chunk if none are available.
- //
- {
- set<int> want_to_read;
- set<int> available_chunks;
- set<int> minimum;
-
- want_to_read.insert(0);
-
- EXPECT_EQ(-EIO, jerasure.minimum_to_decode(want_to_read,
- available_chunks,
- &minimum));
- }
- //
- // Reading a subset of the available chunks is always possible.
- //
- {
- set<int> want_to_read;
- set<int> available_chunks;
- set<int> minimum;
-
- want_to_read.insert(0);
- available_chunks.insert(0);
-
- EXPECT_EQ(0, jerasure.minimum_to_decode(want_to_read,
- available_chunks,
- &minimum));
- EXPECT_EQ(want_to_read, minimum);
- }
- //
- // There is no way to read a missing chunk if there is less than k
- // chunks available.
- //
- {
- set<int> want_to_read;
- set<int> available_chunks;
- set<int> minimum;
-
- want_to_read.insert(0);
- want_to_read.insert(1);
- available_chunks.insert(0);
-
- EXPECT_EQ(-EIO, jerasure.minimum_to_decode(want_to_read,
- available_chunks,
- &minimum));
- }
- //
- // When chunks are not available, the minimum can be made of any
- // chunks. For instance, to read 1 and 3 below the minimum could be
- // 2 and 3 which may seem better because it contains one of the
- // chunks to be read. But it won't be more efficient than retrieving
- // 0 and 2 instead because, in both cases, the decode function will
- // need to run the same recovery operation and use the same amount
- // of CPU and memory.
- //
- {
- set<int> want_to_read;
- set<int> available_chunks;
- set<int> minimum;
-
- want_to_read.insert(1);
- want_to_read.insert(3);
- available_chunks.insert(0);
- available_chunks.insert(2);
- available_chunks.insert(3);
-
- EXPECT_EQ(0, jerasure.minimum_to_decode(want_to_read,
- available_chunks,
- &minimum));
- EXPECT_EQ(2u, minimum.size());
- EXPECT_EQ(0u, minimum.count(3));
- }
-}
-
-TEST(ErasureCodeTest, encode)
-{
- ErasureCodeJerasureReedSolomonVandermonde jerasure;
- ErasureCodeProfile profile;
- profile["k"] = "2";
- profile["m"] = "2";
- profile["w"] = "8";
- jerasure.init(profile, &cerr);
-
- unsigned aligned_object_size = jerasure.get_alignment() * 2;
- {
- //
- // When the input bufferlist needs to be padded because
- // it is not properly aligned, it is padded with zeros.
- //
- bufferlist in;
- map<int,bufferlist> encoded;
- int want_to_encode[] = { 0, 1, 2, 3 };
- int trail_length = 1;
- in.append(string(aligned_object_size + trail_length, 'X'));
- EXPECT_EQ(0, jerasure.encode(set<int>(want_to_encode, want_to_encode+4),
- in,
- &encoded));
- EXPECT_EQ(4u, encoded.size());
- char *last_chunk = encoded[1].c_str();
- int length =encoded[1].length();
- EXPECT_EQ('X', last_chunk[0]);
- EXPECT_EQ('\0', last_chunk[length - trail_length]);
- }
-
- {
- //
- // When only the first chunk is required, the encoded map only
- // contains the first chunk. Although the jerasure encode
- // internally allocated a buffer because of padding requirements
- // and also computes the coding chunks, they are released before
- // the return of the method, as shown when running the tests thru
- // valgrind (there is no leak).
- //
- bufferlist in;
- map<int,bufferlist> encoded;
- set<int> want_to_encode;
- want_to_encode.insert(0);
- int trail_length = 1;
- in.append(string(aligned_object_size + trail_length, 'X'));
- EXPECT_EQ(0, jerasure.encode(want_to_encode, in, &encoded));
- EXPECT_EQ(1u, encoded.size());
- }
-}
-
-TEST(ErasureCodeTest, create_rule)
-{
- CrushWrapper *c = new CrushWrapper;
- c->create();
- int root_type = 2;
- c->set_type_name(root_type, "root");
- int host_type = 1;
- c->set_type_name(host_type, "host");
- int osd_type = 0;
- c->set_type_name(osd_type, "osd");
-
- int rootno;
- c->add_bucket(0, CRUSH_BUCKET_STRAW, CRUSH_HASH_RJENKINS1,
- root_type, 0, NULL, NULL, &rootno);
- c->set_item_name(rootno, "default");
-
- map<string,string> loc;
- loc["root"] = "default";
-
- int num_host = 4;
- int num_osd = 5;
- int osd = 0;
- for (int h=0; h<num_host; ++h) {
- loc["host"] = string("host-") + stringify(h);
- for (int o=0; o<num_osd; ++o, ++osd) {
- c->insert_item(g_ceph_context, osd, 1.0, string("osd.") + stringify(osd), loc);
- }
- }
-
- c->finalize();
-
- {
- stringstream ss;
- ErasureCodeJerasureReedSolomonVandermonde jerasure;
- ErasureCodeProfile profile;
- profile["k"] = "2";
- profile["m"] = "2";
- profile["w"] = "8";
- jerasure.init(profile, &cerr);
- int ruleset = jerasure.create_rule("myrule", *c, &ss);
- EXPECT_EQ(0, ruleset);
- EXPECT_EQ(-EEXIST, jerasure.create_rule("myrule", *c, &ss));
- //
- // the minimum that is expected from the created ruleset is to
- // successfully map get_chunk_count() devices from the crushmap,
- // at least once.
- //
- vector<__u32> weight(c->get_max_devices(), 0x10000);
- vector<int> out;
- int x = 0;
- c->do_rule(ruleset, x, out, jerasure.get_chunk_count(), weight, 0);
- ASSERT_EQ(out.size(), jerasure.get_chunk_count());
- for (unsigned i=0; i<out.size(); ++i)
- ASSERT_NE(CRUSH_ITEM_NONE, out[i]);
- }
- {
- stringstream ss;
- ErasureCodeJerasureReedSolomonVandermonde jerasure;
- ErasureCodeProfile profile;
- profile["k"] = "2";
- profile["m"] = "2";
- profile["w"] = "8";
- profile["crush-root"] = "BAD";
- jerasure.init(profile, &cerr);
- EXPECT_EQ(-ENOENT, jerasure.create_rule("otherrule", *c, &ss));
- EXPECT_EQ("root item BAD does not exist", ss.str());
- }
- {
- stringstream ss;
- ErasureCodeJerasureReedSolomonVandermonde jerasure;
- ErasureCodeProfile profile;
- profile["k"] = "2";
- profile["m"] = "2";
- profile["w"] = "8";
- profile["crush-failure-domain"] = "WORSE";
- jerasure.init(profile, &cerr);
- EXPECT_EQ(-EINVAL, jerasure.create_rule("otherrule", *c, &ss));
- EXPECT_EQ("unknown type WORSE", ss.str());
- }
-}
-
-/*
- * Local Variables:
- * compile-command: "cd ../.. ;
- * make -j4 unittest_erasure_code_jerasure &&
- * valgrind --tool=memcheck \
- * ./unittest_erasure_code_jerasure \
- * --gtest_filter=*.* --log-to-stderr=true --debug-osd=20"
- * End:
- */
Code Review / stor4nfv.git / blobdiff