ceph/src/test/common/Readahead.cc

   1 // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
   2 // vim: ts=8 sw=2 smarttab
   3 /*
   4  * Ceph - scalable distributed file system
   5  *
   6  * Copyright (C) 2014 Adam Crume <adamcrume@gmail.com>
   7  *
   8  * This is free software; you can redistribute it and/or
   9  * modify it under the terms of the GNU Lesser General Public
  10  * License version 2.1, as published by the Free Software
  11  * Foundation.  See file COPYING.
  12  *
  13  */
  14
  15 #include "common/Readahead.h"
  16 #include "gtest/gtest.h"
  17 #include <stdint.h>
  18 #include <boost/foreach.hpp>
  19 #include <cstdarg>
  20
  21
  22 #define ASSERT_RA(expected_offset, expected_length, ra) \
  23   do { \
  24     Readahead::extent_t e = ra; \
  25     ASSERT_EQ((uint64_t)expected_length, e.second);     \
  26     if (expected_length) { \
  27       ASSERT_EQ((uint64_t)expected_offset, e.first); \
  28     } \
  29   } while(0)
  30
  31 TEST(Readahead, random_access) {
  32   Readahead r;
  33   r.set_trigger_requests(2);
  34   ASSERT_RA(0, 0, r.update(1000, 10, Readahead::NO_LIMIT));
  35   ASSERT_RA(0, 0, r.update(1010, 10, Readahead::NO_LIMIT));
  36   ASSERT_RA(1030, 20, r.update(1020, 10, Readahead::NO_LIMIT));
  37   ASSERT_RA(0, 0, r.update(1040, 10, Readahead::NO_LIMIT));
  38   ASSERT_RA(0, 0, r.update(1060, 10, Readahead::NO_LIMIT));
  39   ASSERT_RA(0, 0, r.update(1080, 10, Readahead::NO_LIMIT));
  40   ASSERT_RA(0, 0, r.update(1100, 10, Readahead::NO_LIMIT));
  41   ASSERT_RA(0, 0, r.update(1200, 10, Readahead::NO_LIMIT));
  42 }
  43
  44 TEST(Readahead, min_size_limit) {
  45   Readahead r;
  46   r.set_trigger_requests(2);
  47   r.set_min_readahead_size(40);
  48   ASSERT_RA(0, 0, r.update(1000, 10, Readahead::NO_LIMIT));
  49   ASSERT_RA(0, 0, r.update(1010, 10, Readahead::NO_LIMIT));
  50   ASSERT_RA(1030, 40, r.update(1020, 10, Readahead::NO_LIMIT));
  51   ASSERT_RA(0, 0, r.update(1030, 10, Readahead::NO_LIMIT));
  52   ASSERT_RA(1070, 80, r.update(1040, 10, Readahead::NO_LIMIT));
  53   ASSERT_RA(0, 0, r.update(1050, 10, Readahead::NO_LIMIT));
  54   ASSERT_RA(0, 0, r.update(1060, 10, Readahead::NO_LIMIT));
  55   ASSERT_RA(0, 0, r.update(1070, 10, Readahead::NO_LIMIT));
  56 }
  57
  58 TEST(Readahead, max_size_limit) {
  59   Readahead r;
  60   r.set_trigger_requests(2);
  61   r.set_max_readahead_size(50);
  62   ASSERT_RA(0, 0, r.update(1000, 10, Readahead::NO_LIMIT));
  63   ASSERT_RA(0, 0, r.update(1010, 10, Readahead::NO_LIMIT));
  64   ASSERT_RA(1030, 20, r.update(1020, 10, Readahead::NO_LIMIT));
  65   ASSERT_RA(1050, 40, r.update(1030, 10, Readahead::NO_LIMIT));
  66   ASSERT_RA(0, 0, r.update(1040, 10, Readahead::NO_LIMIT));
  67   ASSERT_RA(0, 0, r.update(1050, 10, Readahead::NO_LIMIT));
  68   ASSERT_RA(1090, 50, r.update(1060, 10, Readahead::NO_LIMIT));
  69   ASSERT_RA(0, 0, r.update(1070, 10, Readahead::NO_LIMIT));
  70   ASSERT_RA(0, 0, r.update(1080, 10, Readahead::NO_LIMIT));
  71   ASSERT_RA(0, 0, r.update(1090, 10, Readahead::NO_LIMIT));
  72   ASSERT_RA(0, 0, r.update(1100, 10, Readahead::NO_LIMIT));
  73   ASSERT_RA(1140, 50, r.update(1110, 10, Readahead::NO_LIMIT));
  74 }
  75
  76 TEST(Readahead, limit) {
  77   Readahead r;
  78   r.set_trigger_requests(2);
  79   r.set_max_readahead_size(50);
  80   uint64_t limit = 1100;
  81   ASSERT_RA(0, 0, r.update(1000, 10, limit));
  82   ASSERT_RA(0, 0, r.update(1010, 10, limit));
  83   ASSERT_RA(1030, 20, r.update(1020, 10, limit));
  84   ASSERT_RA(1050, 40, r.update(1030, 10, limit));
  85   ASSERT_RA(0, 0, r.update(1040, 10, limit));
  86   ASSERT_RA(0, 0, r.update(1050, 10, limit));
  87   ASSERT_RA(1090, 10, r.update(1060, 10, limit));
  88   ASSERT_RA(0, 0, r.update(1070, 10, limit));
  89   ASSERT_RA(0, 0, r.update(1080, 10, limit));
  90   ASSERT_RA(0, 0, r.update(1090, 10, limit));
  91 }
  92
  93 TEST(Readahead, alignment) {
  94   Readahead r;
  95   r.set_trigger_requests(2);
  96   vector<uint64_t> alignment;
  97   alignment.push_back(100);
  98   r.set_alignments(alignment);
  99   ASSERT_RA(0, 0, r.update(1000, 10, Readahead::NO_LIMIT));
 100   ASSERT_RA(0, 0, r.update(1010, 10, Readahead::NO_LIMIT));
 101   ASSERT_RA(1030, 20, r.update(1020, 10, Readahead::NO_LIMIT));
 102   ASSERT_RA(1050, 50, r.update(1030, 10, Readahead::NO_LIMIT)); // internal readahead size 40
 103   ASSERT_RA(0, 0, r.update(1040, 10, Readahead::NO_LIMIT));
 104   ASSERT_RA(0, 0, r.update(1050, 10, Readahead::NO_LIMIT));
 105   ASSERT_RA(0, 0, r.update(1060, 10, Readahead::NO_LIMIT));
 106   ASSERT_RA(1100, 100, r.update(1070, 10, Readahead::NO_LIMIT)); // internal readahead size 80
 107   ASSERT_RA(0, 0, r.update(1080, 10, Readahead::NO_LIMIT));
 108   ASSERT_RA(0, 0, r.update(1090, 10, Readahead::NO_LIMIT));
 109   ASSERT_RA(0, 0, r.update(1100, 10, Readahead::NO_LIMIT));
 110   ASSERT_RA(0, 0, r.update(1110, 10, Readahead::NO_LIMIT));
 111   ASSERT_RA(0, 0, r.update(1120, 10, Readahead::NO_LIMIT));
 112   ASSERT_RA(0, 0, r.update(1130, 10, Readahead::NO_LIMIT));
 113   ASSERT_RA(1200, 200, r.update(1140, 10, Readahead::NO_LIMIT)); // internal readahead size 160
 114   ASSERT_RA(0, 0, r.update(1150, 10, Readahead::NO_LIMIT));
 115   ASSERT_RA(0, 0, r.update(1160, 10, Readahead::NO_LIMIT));
 116   ASSERT_RA(0, 0, r.update(1170, 10, Readahead::NO_LIMIT));
 117   ASSERT_RA(0, 0, r.update(1180, 10, Readahead::NO_LIMIT));
 118   ASSERT_RA(0, 0, r.update(1190, 10, Readahead::NO_LIMIT));
 119   ASSERT_RA(0, 0, r.update(1200, 10, Readahead::NO_LIMIT));
 120   ASSERT_RA(0, 0, r.update(1210, 10, Readahead::NO_LIMIT));
 121   ASSERT_RA(0, 0, r.update(1220, 10, Readahead::NO_LIMIT));
 122   ASSERT_RA(0, 0, r.update(1230, 10, Readahead::NO_LIMIT));
 123   ASSERT_RA(0, 0, r.update(1240, 10, Readahead::NO_LIMIT));
 124   ASSERT_RA(0, 0, r.update(1250, 10, Readahead::NO_LIMIT));
 125   ASSERT_RA(0, 0, r.update(1260, 10, Readahead::NO_LIMIT));
 126   ASSERT_RA(0, 0, r.update(1270, 10, Readahead::NO_LIMIT));
 127   ASSERT_RA(0, 0, r.update(1280, 10, Readahead::NO_LIMIT));
 128   ASSERT_RA(1400, 300, r.update(1290, 10, Readahead::NO_LIMIT)); // internal readahead size 320
 129   ASSERT_RA(0, 0, r.update(1300, 10, Readahead::NO_LIMIT));
 130 }