env_test.cc 6.5 KB
Newer Older
J
jorlow@chromium.org 已提交
1 2 3 4
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.

5
#include "leveldb/env.h"
J
jorlow@chromium.org 已提交
6

7
#include <unordered_set>
J
jorlow@chromium.org 已提交
8
#include "port/port.h"
9
#include "util/coding.h"
J
jorlow@chromium.org 已提交
10
#include "util/testharness.h"
11
#include "util/storage_options.h"
J
jorlow@chromium.org 已提交
12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

namespace leveldb {

static const int kDelayMicros = 100000;

class EnvPosixTest {
 private:
  port::Mutex mu_;
  std::string events_;

 public:
  Env* env_;
  EnvPosixTest() : env_(Env::Default()) { }
};

static void SetBool(void* ptr) {
28
  reinterpret_cast<port::AtomicPointer*>(ptr)->NoBarrier_Store(ptr);
J
jorlow@chromium.org 已提交
29 30 31
}

TEST(EnvPosixTest, RunImmediately) {
A
Abhishek Kona 已提交
32
  port::AtomicPointer called (nullptr);
J
jorlow@chromium.org 已提交
33 34
  env_->Schedule(&SetBool, &called);
  Env::Default()->SleepForMicroseconds(kDelayMicros);
A
Abhishek Kona 已提交
35
  ASSERT_TRUE(called.NoBarrier_Load() != nullptr);
J
jorlow@chromium.org 已提交
36 37 38
}

TEST(EnvPosixTest, RunMany) {
A
Abhishek Kona 已提交
39
  port::AtomicPointer last_id (nullptr);
J
jorlow@chromium.org 已提交
40 41

  struct CB {
42 43
    port::AtomicPointer* last_id_ptr;   // Pointer to shared slot
    uintptr_t id;             // Order# for the execution of this callback
J
jorlow@chromium.org 已提交
44

45
    CB(port::AtomicPointer* p, int i) : last_id_ptr(p), id(i) { }
J
jorlow@chromium.org 已提交
46 47 48

    static void Run(void* v) {
      CB* cb = reinterpret_cast<CB*>(v);
49 50 51
      void* cur = cb->last_id_ptr->NoBarrier_Load();
      ASSERT_EQ(cb->id-1, reinterpret_cast<uintptr_t>(cur));
      cb->last_id_ptr->Release_Store(reinterpret_cast<void*>(cb->id));
J
jorlow@chromium.org 已提交
52 53 54 55 56 57 58 59 60 61 62 63 64 65
    }
  };

  // Schedule in different order than start time
  CB cb1(&last_id, 1);
  CB cb2(&last_id, 2);
  CB cb3(&last_id, 3);
  CB cb4(&last_id, 4);
  env_->Schedule(&CB::Run, &cb1);
  env_->Schedule(&CB::Run, &cb2);
  env_->Schedule(&CB::Run, &cb3);
  env_->Schedule(&CB::Run, &cb4);

  Env::Default()->SleepForMicroseconds(kDelayMicros);
66
  void* cur = last_id.Acquire_Load();
67
  ASSERT_EQ(4U, reinterpret_cast<uintptr_t>(cur));
J
jorlow@chromium.org 已提交
68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102
}

struct State {
  port::Mutex mu;
  int val;
  int num_running;
};

static void ThreadBody(void* arg) {
  State* s = reinterpret_cast<State*>(arg);
  s->mu.Lock();
  s->val += 1;
  s->num_running -= 1;
  s->mu.Unlock();
}

TEST(EnvPosixTest, StartThread) {
  State state;
  state.val = 0;
  state.num_running = 3;
  for (int i = 0; i < 3; i++) {
    env_->StartThread(&ThreadBody, &state);
  }
  while (true) {
    state.mu.Lock();
    int num = state.num_running;
    state.mu.Unlock();
    if (num == 0) {
      break;
    }
    Env::Default()->SleepForMicroseconds(kDelayMicros);
  }
  ASSERT_EQ(state.val, 3);
}

103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122
bool IsSingleVarint(const std::string& s) {
  Slice slice(s);

  uint64_t v;
  if (!GetVarint64(&slice, &v)) {
    return false;
  }

  return slice.size() == 0;
}

bool IsUniqueIDValid(const std::string& s) {
  return !s.empty() && !IsSingleVarint(s);
}

const size_t MAX_ID_SIZE = 100;
char temp_id[MAX_ID_SIZE];

TEST(EnvPosixTest, RandomAccessUniqueID) {
  // Create file.
123
  const StorageOptions soptions;
124 125
  std::string fname = test::TmpDir() + "/" + "testfile";
  unique_ptr<WritableFile> wfile;
126
  ASSERT_OK(env_->NewWritableFile(fname, &wfile, soptions));
127 128 129 130

  unique_ptr<RandomAccessFile> file;

  // Get Unique ID
131
  ASSERT_OK(env_->NewRandomAccessFile(fname, &file, soptions));
132 133 134 135 136 137
  size_t id_size = file->GetUniqueId(temp_id, MAX_ID_SIZE);
  ASSERT_TRUE(id_size > 0);
  std::string unique_id1(temp_id, id_size);
  ASSERT_TRUE(IsUniqueIDValid(unique_id1));

  // Get Unique ID again
138
  ASSERT_OK(env_->NewRandomAccessFile(fname, &file, soptions));
139 140 141 142 143 144 145
  id_size = file->GetUniqueId(temp_id, MAX_ID_SIZE);
  ASSERT_TRUE(id_size > 0);
  std::string unique_id2(temp_id, id_size);
  ASSERT_TRUE(IsUniqueIDValid(unique_id2));

  // Get Unique ID again after waiting some time.
  env_->SleepForMicroseconds(1000000);
146
  ASSERT_OK(env_->NewRandomAccessFile(fname, &file, soptions));
147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176
  id_size = file->GetUniqueId(temp_id, MAX_ID_SIZE);
  ASSERT_TRUE(id_size > 0);
  std::string unique_id3(temp_id, id_size);
  ASSERT_TRUE(IsUniqueIDValid(unique_id3));

  // Check IDs are the same.
  ASSERT_EQ(unique_id1, unique_id2);
  ASSERT_EQ(unique_id2, unique_id3);

  // Delete the file
  env_->DeleteFile(fname);
}

// Returns true if any of the strings in ss are the prefix of another string.
bool HasPrefix(const std::unordered_set<std::string>& ss) {
  for (const std::string& s: ss) {
    if (s.empty()) {
      return true;
    }
    for (size_t i = 1; i < s.size(); ++i) {
      if (ss.count(s.substr(0, i)) != 0) {
        return true;
      }
    }
  }
  return false;
}

TEST(EnvPosixTest, RandomAccessUniqueIDConcurrent) {
  // Check whether a bunch of concurrently existing files have unique IDs.
177
  const StorageOptions soptions;
178 179 180 181 182 183 184 185

  // Create the files
  std::vector<std::string> fnames;
  for (int i = 0; i < 1000; ++i) {
    fnames.push_back(test::TmpDir() + "/" + "testfile" + std::to_string(i));

    // Create file.
    unique_ptr<WritableFile> wfile;
186
    ASSERT_OK(env_->NewWritableFile(fnames[i], &wfile, soptions));
187 188 189 190 191 192 193
  }

  // Collect and check whether the IDs are unique.
  std::unordered_set<std::string> ids;
  for (const std::string fname: fnames) {
    unique_ptr<RandomAccessFile> file;
    std::string unique_id;
194
    ASSERT_OK(env_->NewRandomAccessFile(fname, &file, soptions));
195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212
    size_t id_size = file->GetUniqueId(temp_id, MAX_ID_SIZE);
    ASSERT_TRUE(id_size > 0);
    unique_id = std::string(temp_id, id_size);
    ASSERT_TRUE(IsUniqueIDValid(unique_id));

    ASSERT_TRUE(ids.count(unique_id) == 0);
    ids.insert(unique_id);
  }

  // Delete the files
  for (const std::string fname: fnames) {
    ASSERT_OK(env_->DeleteFile(fname));
  }

  ASSERT_TRUE(!HasPrefix(ids));
}

TEST(EnvPosixTest, RandomAccessUniqueIDDeletes) {
213
  const StorageOptions soptions;
214 215 216 217 218 219 220 221
  std::string fname = test::TmpDir() + "/" + "testfile";

  // Check that after file is deleted we don't get same ID again in a new file.
  std::unordered_set<std::string> ids;
  for (int i = 0; i < 1000; ++i) {
    // Create file.
    {
      unique_ptr<WritableFile> wfile;
222
      ASSERT_OK(env_->NewWritableFile(fname, &wfile, soptions));
223 224 225 226 227 228
    }

    // Get Unique ID
    std::string unique_id;
    {
      unique_ptr<RandomAccessFile> file;
229
      ASSERT_OK(env_->NewRandomAccessFile(fname, &file, soptions));
230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245
      size_t id_size = file->GetUniqueId(temp_id, MAX_ID_SIZE);
      ASSERT_TRUE(id_size > 0);
      unique_id = std::string(temp_id, id_size);
    }

    ASSERT_TRUE(IsUniqueIDValid(unique_id));
    ASSERT_TRUE(ids.count(unique_id) == 0);
    ids.insert(unique_id);

    // Delete the file
    ASSERT_OK(env_->DeleteFile(fname));
  }

  ASSERT_TRUE(!HasPrefix(ids));
}

H
Hans Wennborg 已提交
246
}  // namespace leveldb
J
jorlow@chromium.org 已提交
247 248 249 250

int main(int argc, char** argv) {
  return leveldb::test::RunAllTests();
}