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 55 56 57 58 59 60 61 62 63 64 65 66 67 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 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 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 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
|
// Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/sync_file_system/drive_backend/leveldb_wrapper.h"
#include <map>
#include <set>
#include <string>
#include <utility>
#include "base/check.h"
#include "base/notreached.h"
#include "third_party/leveldatabase/src/include/leveldb/db.h"
#include "third_party/leveldatabase/src/include/leveldb/iterator.h"
#include "third_party/leveldatabase/src/include/leveldb/slice.h"
#include "third_party/leveldatabase/src/include/leveldb/status.h"
#include "third_party/leveldatabase/src/include/leveldb/write_batch.h"
namespace sync_file_system {
namespace drive_backend {
LevelDBWrapper::Iterator::Iterator(LevelDBWrapper* db)
: db_(db),
db_iterator_(db->db_->NewIterator(leveldb::ReadOptions())),
map_iterator_(db->pending_.end()) {}
LevelDBWrapper::Iterator::~Iterator() = default;
bool LevelDBWrapper::Iterator::Valid() {
return map_iterator_ != db_->pending_.end() ||
db_iterator_->Valid();
}
void LevelDBWrapper::Iterator::SeekToFirst() {
map_iterator_ = db_->pending_.begin();
db_iterator_->SeekToFirst();
AdvanceIterators();
}
void LevelDBWrapper::Iterator::SeekToLast() {
map_iterator_ = db_->pending_.end();
db_iterator_->SeekToLast();
}
void LevelDBWrapper::Iterator::Seek(const std::string& target) {
map_iterator_ = db_->pending_.lower_bound(target);
db_iterator_->Seek(target);
AdvanceIterators();
}
void LevelDBWrapper::Iterator::Next() {
if (map_iterator_ == db_->pending_.end()) {
if (db_iterator_->Valid())
db_iterator_->Next();
return;
}
if (db_iterator_->Valid()) {
int comp = db_iterator_->key().compare(map_iterator_->first);
if (comp <= 0)
db_iterator_->Next();
if (comp >= 0)
++map_iterator_;
} else {
++map_iterator_;
}
AdvanceIterators();
}
void LevelDBWrapper::Iterator::Delete() {
DCHECK(Valid());
const std::string key_str = key().ToString();
Transaction deletion(DELETE_OPERATION, std::string());
map_iterator_ = db_->pending_.insert(map_iterator_,
std::make_pair(key_str, deletion));
// In case that |db_->pending_| already had an entry for the key, we have to
// update the value.
map_iterator_->second = deletion;
++(db_->num_deletes_);
AdvanceIterators();
}
leveldb::Slice LevelDBWrapper::Iterator::key() {
DCHECK(Valid());
if (!db_iterator_->Valid())
return map_iterator_->first;
if (map_iterator_ == db_->pending_.end())
return db_iterator_->key();
const leveldb::Slice db_key = db_iterator_->key();
const leveldb::Slice map_key = map_iterator_->first;
return (db_key.compare(map_key) < 0) ? db_key : map_key;
}
leveldb::Slice LevelDBWrapper::Iterator::value() {
DCHECK(Valid());
if (!db_iterator_->Valid())
return map_iterator_->second.second;
if (map_iterator_ == db_->pending_.end())
return db_iterator_->value();
const leveldb::Slice db_key = db_iterator_->key();
const leveldb::Slice map_key = map_iterator_->first;
if (db_key.compare(map_key) < 0)
return db_iterator_->value();
DCHECK(map_iterator_->second.first == PUT_OPERATION);
return map_iterator_->second.second;
}
void LevelDBWrapper::Iterator::AdvanceIterators() {
// Iterator is valid iff any of below holds:
// - |db_itr.key| < |map_itr.key| OR |map_itr| == end()
// - (|db_itr.key| >= |map_itr.key| OR !|db_itr|->IsValid())
// AND |map_itr.operation| == PUT_OPERATION
if (map_iterator_ == db_->pending_.end())
return;
while (map_iterator_ != db_->pending_.end() && db_iterator_->Valid()) {
int cmp_key = db_iterator_->key().compare(map_iterator_->first);
if (cmp_key < 0 || map_iterator_->second.first == PUT_OPERATION)
return;
// |db_itr.key| >= |map_itr.key| && |map_itr.operation| != PUT_OPERATION
if (cmp_key == 0)
db_iterator_->Next();
++map_iterator_;
}
if (db_iterator_->Valid())
return;
while (map_iterator_ != db_->pending_.end() &&
map_iterator_->second.first == DELETE_OPERATION)
++map_iterator_;
}
// ---------------------------------------------------------------------------
// LevelDBWrapper class
// ---------------------------------------------------------------------------
LevelDBWrapper::LevelDBWrapper(std::unique_ptr<leveldb::DB> db)
: db_(std::move(db)), num_puts_(0), num_deletes_(0) {
DCHECK(db_);
}
LevelDBWrapper::~LevelDBWrapper() = default;
void LevelDBWrapper::Put(const std::string& key, const std::string& value) {
pending_[key] = Transaction(PUT_OPERATION, value);
++num_puts_;
}
void LevelDBWrapper::Delete(const std::string& key) {
pending_[key] = Transaction(DELETE_OPERATION, std::string());
++num_deletes_;
}
leveldb::Status LevelDBWrapper::Get(const std::string& key,
std::string* value) {
auto itr = pending_.find(key);
if (itr == pending_.end())
return db_->Get(leveldb::ReadOptions(), key, value);
const Transaction& transaction = itr->second;
switch (transaction.first) {
case PUT_OPERATION:
*value = transaction.second;
return leveldb::Status();
case DELETE_OPERATION:
return leveldb::Status::NotFound(leveldb::Slice());
}
NOTREACHED();
}
std::unique_ptr<LevelDBWrapper::Iterator> LevelDBWrapper::NewIterator() {
return std::make_unique<Iterator>(this);
}
leveldb::Status LevelDBWrapper::Commit() {
leveldb::WriteBatch batch;
for (auto itr = pending_.begin(); itr != pending_.end(); ++itr) {
const leveldb::Slice key(itr->first);
const Transaction& transaction = itr->second;
switch (transaction.first) {
case PUT_OPERATION:
batch.Put(key, transaction.second);
break;
case DELETE_OPERATION:
batch.Delete(key);
break;
}
}
leveldb::Status status = db_->Write(leveldb::WriteOptions(), &batch);
// TODO(peria): Decide what to do depending on |status|.
if (status.ok())
Clear();
return status;
}
void LevelDBWrapper::Clear() {
pending_.clear();
num_puts_ = 0;
num_deletes_ = 0;
}
leveldb::DB* LevelDBWrapper::GetLevelDB() {
return db_.get();
}
} // namespace drive_backend
} // namespace sync_file_system
|