summaryrefslogtreecommitdiffstats
path: root/src/test/erasure-code/ceph_erasure_code_benchmark.h
blob: c65f716b1e17826aa7036a7c3d6aa1506cd1b1d2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
// -*- 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.
 *
 */

#ifndef CEPH_ERASURE_CODE_BENCHMARK_H
#define CEPH_ERASURE_CODE_BENCHMARK_H

#include <string>

using namespace std;

class ErasureCodeBench {
  int in_size;
  int max_iterations;
  int erasures;
  int k;
  int m;

  string plugin;

  bool exhaustive_erasures;
  vector<int> erased;
  string workload;

  ErasureCodeProfile profile;

  bool verbose;
  boost::intrusive_ptr<CephContext> cct;
public:
  int setup(int argc, char** argv);
  int run();
  int decode_erasures(const map<int,bufferlist> &all_chunks,
		      const map<int,bufferlist> &chunks,
		      unsigned i,
		      unsigned want_erasures,
		      ErasureCodeInterfaceRef erasure_code);
  int decode();
  int encode();
};

#endif