folly/experimental/test/EliasFanoCodingTest.cpp

   1 /*
   2  * Copyright 2017 Facebook, Inc.
   3  *
   4  * Licensed under the Apache License, Version 2.0 (the "License");
   5  * you may not use this file except in compliance with the License.
   6  * You may obtain a copy of the License at
   7  *
   8  *   http://www.apache.org/licenses/LICENSE-2.0
   9  *
  10  * Unless required by applicable law or agreed to in writing, software
  11  * distributed under the License is distributed on an "AS IS" BASIS,
  12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13  * See the License for the specific language governing permissions and
  14  * limitations under the License.
  15  */
  16
  17 #include <algorithm>
  18 #include <limits>
  19 #include <numeric>
  20 #include <random>
  21 #include <vector>
  22
  23 #include <folly/Benchmark.h>
  24 #include <folly/experimental/EliasFanoCoding.h>
  25 #include <folly/experimental/Select64.h>
  26 #include <folly/experimental/test/CodingTestUtils.h>
  27
  28 using namespace folly::compression;
  29
  30 #ifndef EF_TEST_ARCH
  31 #define EF_TEST_ARCH Default
  32 #endif  // EF_TEST_ARCH
  33
  34 namespace {
  35
  36 uint8_t slowDefaultNumLowerBits(size_t upperBound, size_t size) {
  37   if (size == 0 || upperBound < size) {
  38     return 0;
  39   }
  40   // floor(log(upperBound / size));
  41   return uint8_t(folly::findLastSet(upperBound / size) - 1);
  42 }
  43
  44 }  // namespace
  45
  46 TEST(EliasFanoCoding, defaultNumLowerBits) {
  47   // Verify that slowDefaultNumLowerBits and optimized
  48   // Encoder::defaultNumLowerBits agree.
  49   static constexpr size_t kNumIterations = 2500;
  50   auto compare = [](size_t upperBound, size_t size) {
  51     using Encoder = EliasFanoEncoderV2<size_t>;
  52     EXPECT_EQ(int(slowDefaultNumLowerBits(upperBound, size)),
  53               int(Encoder::defaultNumLowerBits(upperBound, size)))
  54         << upperBound << " " << size;
  55   };
  56   auto batch = [&compare](size_t initialUpperBound) {
  57     for (size_t upperBound = initialUpperBound, i = 0;
  58          i < kNumIterations;
  59          ++i, --upperBound) {
  60       // Test "size" values close to "upperBound".
  61       for (size_t size = upperBound, j = 0; j < kNumIterations; ++j, --size) {
  62         compare(upperBound, size);
  63       }
  64       // Sample "size" values between [0, upperBound].
  65       for (size_t size = upperBound;
  66            size > 1 + upperBound / kNumIterations;
  67            size -= 1 + upperBound / kNumIterations) {
  68         compare(upperBound, size);
  69       }
  70       // Test "size" values close to 0.
  71       for (size_t size = 0; size < kNumIterations; ++size) {
  72         compare(upperBound, size);
  73       }
  74     }
  75   };
  76   batch(std::numeric_limits<size_t>::max());
  77   batch(kNumIterations + 1312213123);
  78   batch(kNumIterations);
  79
  80   std::mt19937 gen;
  81   std::uniform_int_distribution<size_t> distribution;
  82   for (size_t i = 0; i < kNumIterations; ++i) {
  83     const auto a = distribution(gen);
  84     const auto b = distribution(gen);
  85     compare(std::max(a, b), std::min(a, b));
  86   }
  87 }
  88
  89 class EliasFanoCodingTest : public ::testing::Test {
  90  public:
  91   void doTestEmpty() {
  92     typedef EliasFanoEncoderV2<uint32_t, size_t> Encoder;
  93     typedef EliasFanoReader<Encoder> Reader;
  94     testEmpty<Reader, Encoder>();
  95   }
  96
  97   template <size_t kSkipQuantum, size_t kForwardQuantum>
  98   void doTestAll() {
  99     typedef EliasFanoEncoderV2<
 100       uint32_t, uint32_t, kSkipQuantum, kForwardQuantum> Encoder;
 101     typedef EliasFanoReader<Encoder, instructions::EF_TEST_ARCH> Reader;
 102     testAll<Reader, Encoder>({0});
 103     testAll<Reader, Encoder>(generateRandomList(100 * 1000, 10 * 1000 * 1000));
 104     testAll<Reader, Encoder>(generateSeqList(1, 100000, 100));
 105   }
 106 };
 107
 108 TEST_F(EliasFanoCodingTest, Empty) {
 109   doTestEmpty();
 110 }
 111
 112 TEST_F(EliasFanoCodingTest, Simple) {
 113   doTestAll<0, 0>();
 114 }
 115
 116 TEST_F(EliasFanoCodingTest, SkipPointers) {
 117   doTestAll<128, 0>();
 118 }
 119
 120 TEST_F(EliasFanoCodingTest, ForwardPointers) {
 121   doTestAll<0, 128>();
 122 }
 123
 124 TEST_F(EliasFanoCodingTest, SkipForwardPointers) {
 125   doTestAll<128, 128>();
 126 }
 127
 128 TEST_F(EliasFanoCodingTest, Select64) {
 129   typedef instructions::EF_TEST_ARCH instr;
 130   constexpr uint64_t kPrime = uint64_t(-59);
 131   for (uint64_t x = kPrime, i = 0; i < (1 << 20); x *= kPrime, i += 1) {
 132     size_t w = instr::popcount(x);
 133     for (size_t k = 0; k < w; ++k) {
 134       auto pos = folly::select64<instr>(x, k);
 135       CHECK_EQ((x >> pos) & 1, 1);
 136       CHECK_EQ(instr::popcount(x & ((uint64_t(1) << pos) - 1)), k);
 137     }
 138   }
 139 }
 140
 141 TEST_F(EliasFanoCodingTest, BugLargeGapInUpperBits) { // t16274876
 142   typedef EliasFanoEncoderV2<uint32_t, uint32_t, 2, 2> Encoder;
 143   typedef EliasFanoReader<Encoder, instructions::EF_TEST_ARCH> Reader;
 144   constexpr uint32_t kLargeValue = 127;
 145
 146   // Build a list where the upper bits have a large gap after the
 147   // first element, so that we need to reposition in the upper bits
 148   // using skips to position the iterator on the second element.
 149   std::vector<uint32_t> data = {0, kLargeValue};
 150   for (uint32_t i = 0; i < kLargeValue; ++i) {
 151     data.push_back(data.back() + 1);
 152   }
 153   auto list = Encoder::encode(data.begin(), data.end());
 154
 155   {
 156     Reader reader(list);
 157     ASSERT_TRUE(reader.skipTo(kLargeValue - 1));
 158     ASSERT_EQ(kLargeValue, reader.value());
 159     ASSERT_EQ(0, reader.previousValue());
 160   }
 161
 162   list.free();
 163 }
 164
 165 namespace bm {
 166
 167 typedef EliasFanoEncoderV2<uint32_t, uint32_t, 128, 128> Encoder;
 168 typedef EliasFanoReader<Encoder> Reader;
 169
 170 std::vector<uint32_t> data;
 171 std::vector<size_t> order;
 172
 173 std::vector<uint32_t> encodeSmallData;
 174 std::vector<uint32_t> encodeLargeData;
 175
 176 std::vector<std::pair<size_t, size_t>> numLowerBitsInput;
 177
 178 typename Encoder::MutableCompressedList list;
 179
 180 void init() {
 181   std::mt19937 gen;
 182
 183   data = generateRandomList(100 * 1000, 10 * 1000 * 1000, gen);
 184   list = Encoder::encode(data.begin(), data.end());
 185
 186   order.resize(data.size());
 187   std::iota(order.begin(), order.end(), size_t());
 188   std::shuffle(order.begin(), order.end(), gen);
 189
 190   encodeSmallData = generateRandomList(10, 100 * 1000, gen);
 191   encodeLargeData = generateRandomList(1000 * 1000, 100 * 1000 * 1000, gen);
 192
 193   std::uniform_int_distribution<size_t> distribution;
 194   for (size_t i = 0; i < 10000; ++i) {
 195     const auto a = distribution(gen);
 196     const auto b = distribution(gen);
 197     numLowerBitsInput.emplace_back(std::max(a, b), std::min(a, b));
 198   }
 199 }
 200
 201 void free() {
 202   list.free();
 203 }
 204
 205 }  // namespace bm
 206
 207 BENCHMARK(Next, iters) {
 208   bmNext<bm::Reader>(bm::list, bm::data, iters);
 209 }
 210
 211 size_t Skip_ForwardQ128(size_t iters, size_t logAvgSkip) {
 212   bmSkip<bm::Reader>(bm::list, bm::data, logAvgSkip, iters);
 213   return iters;
 214 }
 215
 216 BENCHMARK_NAMED_PARAM_MULTI(Skip_ForwardQ128, 1, 0)
 217 BENCHMARK_NAMED_PARAM_MULTI(Skip_ForwardQ128, 2, 1)
 218 BENCHMARK_NAMED_PARAM_MULTI(Skip_ForwardQ128, 4_pm_1, 2)
 219 BENCHMARK_NAMED_PARAM_MULTI(Skip_ForwardQ128, 16_pm_4, 4)
 220 BENCHMARK_NAMED_PARAM_MULTI(Skip_ForwardQ128, 64_pm_16, 6)
 221 BENCHMARK_NAMED_PARAM_MULTI(Skip_ForwardQ128, 256_pm_64, 8)
 222 BENCHMARK_NAMED_PARAM_MULTI(Skip_ForwardQ128, 1024_pm_256, 10)
 223
 224 BENCHMARK(Jump_ForwardQ128, iters) {
 225   bmJump<bm::Reader>(bm::list, bm::data, bm::order, iters);
 226 }
 227
 228 BENCHMARK_DRAW_LINE();
 229
 230 size_t SkipTo_SkipQ128(size_t iters, size_t logAvgSkip) {
 231   bmSkipTo<bm::Reader>(bm::list, bm::data, logAvgSkip, iters);
 232   return iters;
 233 }
 234
 235 BENCHMARK_NAMED_PARAM_MULTI(SkipTo_SkipQ128, 1, 0)
 236 BENCHMARK_NAMED_PARAM_MULTI(SkipTo_SkipQ128, 2, 1)
 237 BENCHMARK_NAMED_PARAM_MULTI(SkipTo_SkipQ128, 4_pm_1, 2)
 238 BENCHMARK_NAMED_PARAM_MULTI(SkipTo_SkipQ128, 16_pm_4, 4)
 239 BENCHMARK_NAMED_PARAM_MULTI(SkipTo_SkipQ128, 64_pm_16, 6)
 240 BENCHMARK_NAMED_PARAM_MULTI(SkipTo_SkipQ128, 256_pm_64, 8)
 241 BENCHMARK_NAMED_PARAM_MULTI(SkipTo_SkipQ128, 1024_pm_256, 10)
 242
 243 BENCHMARK(JumpTo_SkipQ128, iters) {
 244   bmJumpTo<bm::Reader>(bm::list, bm::data, bm::order, iters);
 245 }
 246
 247 BENCHMARK_DRAW_LINE();
 248
 249 BENCHMARK(Encode_10) {
 250   auto list = bm::Encoder::encode(bm::encodeSmallData.begin(),
 251                                   bm::encodeSmallData.end());
 252   list.free();
 253 }
 254
 255 BENCHMARK(Encode) {
 256   auto list = bm::Encoder::encode(bm::encodeLargeData.begin(),
 257                                   bm::encodeLargeData.end());
 258   list.free();
 259 }
 260
 261 BENCHMARK_DRAW_LINE();
 262
 263 BENCHMARK(defaultNumLowerBits, iters) {
 264   using Encoder = EliasFanoEncoderV2<size_t>;
 265
 266   size_t i = 0;
 267   while (iters--) {
 268     const auto& p = bm::numLowerBitsInput[i];
 269     folly::doNotOptimizeAway(Encoder::defaultNumLowerBits(p.first, p.second));
 270     if (++i == bm::numLowerBitsInput.size()) {
 271       i = 0;
 272     }
 273   }
 274 }
 275
 276 BENCHMARK(slowDefaultNumLowerBits, iters) {
 277   size_t i = 0;
 278   while (iters--) {
 279     const auto& p = bm::numLowerBitsInput[i];
 280     folly::doNotOptimizeAway(slowDefaultNumLowerBits(p.first, p.second));
 281     if (++i == bm::numLowerBitsInput.size()) {
 282       i = 0;
 283     }
 284   }
 285 }
 286
 287 #if 0
 288 Intel(R) Xeon(R) CPU E5-2678 v3 @ 2.50GHz (turbo on),
 289 using -DEF_TEST_ARCH Haswell and GCC 4.9 with --bm_min_usec 100000.
 290 ============================================================================
 291 folly/experimental/test/EliasFanoCodingTest.cpp relative  time/iter  iters/s
 292 ============================================================================
 293 Next                                                         2.31ns  433.77M
 294 Skip_ForwardQ128(1)                                          3.73ns  267.93M
 295 Skip_ForwardQ128(2)                                          4.89ns  204.34M
 296 Skip_ForwardQ128(4_pm_1)                                     6.86ns  145.79M
 297 Skip_ForwardQ128(16_pm_4)                                   18.92ns   52.85M
 298 Skip_ForwardQ128(64_pm_16)                                  26.56ns   37.66M
 299 Skip_ForwardQ128(256_pm_64)                                 30.12ns   33.20M
 300 Skip_ForwardQ128(1024_pm_256)                               30.74ns   32.53M
 301 Jump_ForwardQ128                                            30.49ns   32.80M
 302 ----------------------------------------------------------------------------
 303 SkipTo_SkipQ128(1)                                           3.86ns  258.96M
 304 SkipTo_SkipQ128(2)                                           7.73ns  129.36M
 305 SkipTo_SkipQ128(4_pm_1)                                     10.29ns   97.18M
 306 SkipTo_SkipQ128(16_pm_4)                                    28.69ns   34.86M
 307 SkipTo_SkipQ128(64_pm_16)                                   39.73ns   25.17M
 308 SkipTo_SkipQ128(256_pm_64)                                  43.45ns   23.01M
 309 SkipTo_SkipQ128(1024_pm_256)                                44.66ns   22.39M
 310 JumpTo_SkipQ128                                             47.98ns   20.84M
 311 ----------------------------------------------------------------------------
 312 Encode_10                                                   77.92ns   12.83M
 313 Encode                                                       4.73ms   211.41
 314 ----------------------------------------------------------------------------
 315 defaultNumLowerBits                                          2.20ns  455.01M
 316 slowDefaultNumLowerBits                                      7.90ns  126.59M
 317 ============================================================================
 318 #endif
 319
 320 int main(int argc, char** argv) {
 321   testing::InitGoogleTest(&argc, argv);
 322   gflags::ParseCommandLineFlags(&argc, &argv, true);
 323
 324   auto ret = RUN_ALL_TESTS();
 325   if (ret == 0 && FLAGS_benchmark) {
 326     bm::init();
 327     folly::runBenchmarks();
 328     bm::free();
 329   }
 330
 331   return ret;
 332 }