Function TEST

src/test/erasure-code/TestErasureCode.cc:112–138

* If we have a buffer of 5 bytes (X below) and a chunk size of 3 * bytes, for k=3, m=1 an additional 7 bytes (P and C below) will * need to be allocated for padding (P) and the 3 coding bytes (C). * * X -+ +----------+ +-X * X | | data 0 | | X * X | +----------+ | X * X | +----------+ | X -> +-X * X -+ | data 1 | +-X -> | X * P -+ +----------+ | P * P | +--------

 *  underlying allocation function enforces it.
 */
TEST(ErasureCodeTest, encode_memory_align)
{
  int k = 3;
  int m = 1;
  unsigned chunk_size = ErasureCode::SIMD_ALIGN * 7;
  ErasureCodeTest erasure_code(k, m, chunk_size);

  shard_id_set  want_to_encode;
  want_to_encode.insert_range(shard_id_t(0), erasure_code.get_chunk_count());
  string data(chunk_size + chunk_size / 2, 'X'); // uses 1.5 chunks out of 3
  // make sure nothing is memory aligned
  bufferptr ptr(buffer::create_aligned(data.length() + 1, ErasureCode::SIMD_ALIGN));
  ptr.copy_in(1, data.length(), data.c_str());
  ptr.set_offset(1);
  ptr.set_length(data.length());
  bufferlist in;
  in.append(ptr);
  shard_id_map<bufferlist> encoded(k+m);

  ASSERT_FALSE(in.is_aligned(ErasureCode::SIMD_ALIGN));
  ASSERT_EQ(0, erasure_code.encode(want_to_encode, in, &encoded));
  for (shard_id_t i; i < erasure_code.get_chunk_count(); ++i)
    ASSERT_TRUE(encoded[i].is_aligned(ErasureCode::SIMD_ALIGN));
  for (unsigned i = 0; i < chunk_size / 2; i++)
    ASSERT_EQ(encoded[shard_id_t(1)][i], 'X');
  ASSERT_NE(encoded[shard_id_t(1)][chunk_size / 2], 'X');
}

TEST(ErasureCodeTest, encode_misaligned_non_contiguous)
{