Newer
Older
// -*- mode: c++; c-file-style: "k&r"; c-basic-offset: 4 -*-
/***********************************************************************
*
* store/common/backend/versionstore.cc:
* Copyright 2015 Irene Zhang <iyzhang@cs.washington.edu>
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use, copy,
* modify, merge, publish, distribute, sublicense, and/or sell copies
* of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
**********************************************************************/
#include "versionstore.h"
using namespace std;
VersionedKVStore::VersionedKVStore() { }
VersionedKVStore::~VersionedKVStore() { }
bool
VersionedKVStore::inStore(const string &key)
{
return store.find(key) != store.end() && store[key].size() > 0;
}
VersionedKVStore::getValue(const string &key, const Timestamp &t, set<VersionedKVStore::VersionedValue>::iterator &it)
{
VersionedValue v(t);
it = store[key].upper_bound(v);
// if there is no valid version at this timestamp
if (it == store[key].begin()) return false;
it--;
return true;
}
/* Returns the most recent value and timestamp for given key.
* Error if key does not exist. */
bool
VersionedKVStore::get(const string &key, pair<Timestamp, string> &value)
{
// check for existence of key in store
if (inStore(key)) {
VersionedValue v = *(store[key].rbegin());
value = make_pair(v.write, v.value);
return true;
}
return false;
}
/* Returns the value valid at given timestamp.
* Error if key did not exist at the timestamp. */
bool
VersionedKVStore::get(const string &key, const Timestamp &t, pair<Timestamp, string> &value)
{
set<VersionedValue>::iterator it;
if (getValue(key, t, it)) {
value = make_pair((*it).write, (*it).value);
return true;
}
return false;
}
bool
VersionedKVStore::getRange(const string &key, const Timestamp &t,
pair<Timestamp, Timestamp> &range)
{
set<VersionedValue>::iterator it;
if (getValue(key, t, it)) {
range.first = (*it).write;
it++;
}
return false;
}
void
VersionedKVStore::put(const string &key, const string &value, const Timestamp &t)
{
// Key does not exist. Create a list and an entry.
store[key].insert(VersionedValue(t, value));
}
/*
* Commit a read by updating the timestamp of the latest read txn for
* the version of the key that the txn read.
*/
void
VersionedKVStore::commitGet(const string &key, const Timestamp &readTime, const Timestamp &commit)
{
// Hmm ... could read a key we don't have if we are behind ... do we commit this or wait for the log update?
set<VersionedValue>::iterator it;
if (getValue(key, readTime, it)) {
// figure out if anyone has read this version before
if (lastReads.find(key) != lastReads.end() &&
lastReads[key].find((*it).write) != lastReads[key].end()) {
if (lastReads[key][(*it).write] < commit) {
lastReads[key][(*it).write] = commit;
}
}
} // otherwise, ignore the read
}
bool
VersionedKVStore::getLastRead(const string &key, Timestamp &lastRead)
{
if (inStore(key)) {
VersionedValue v = *(store[key].rbegin());
if (lastReads.find(key) != lastReads.end() &&
lastReads[key].find(v.write) != lastReads[key].end()) {
lastRead = lastReads[key][v.write];
return true;
}
}
return false;
}
/*
* Get the latest read for the write valid at timestamp t
*/
bool
VersionedKVStore::getLastRead(const string &key, const Timestamp &t, Timestamp &lastRead)
{
set<VersionedValue>::iterator it;
bool ret = getValue(key, t, it);
ASSERT(ret);
// figure out if anyone has read this version before
if (lastReads.find(key) != lastReads.end() &&
lastReads[key].find((*it).write) != lastReads[key].end()) {
lastRead = lastReads[key][(*it).write];
return true;