Files
scylladb/database.cc
Avi Kivity efc868d1e6 db: extend data_type to be able to support dynamic types
Dynamic types come and go, so they need to be reference counted.

Switch data_type to using a shared_ptr<> for its implementation.

Since thread_ptr is not thread safe, the global primitive types must be
thread_local.
2015-01-05 13:26:56 +02:00

141 lines
5.1 KiB
C++

/*
* Copyright (C) 2014 Cloudius Systems, Ltd.
*/
#include "database.hh"
#include "net/byteorder.hh"
bool
less_unsigned(const bytes& v1, const bytes& v2) {
return std::lexicographical_compare(v1.begin(), v1.end(), v2.begin(), v2.end(),
[](int8_t v1, int8_t v2) { return uint8_t(v1) < uint8_t(v2); });
}
template <typename T>
struct simple_type_impl : data_type::impl {
simple_type_impl(sstring name) : impl(std::move(name)) {}
virtual bool less(const bytes& v1, const bytes& v2) override {
auto& x1 = boost::any_cast<const T&>(deserialize(v1));
auto& x2 = boost::any_cast<const T&>(deserialize(v2));
return x1 < x2;
}
};
struct int_type_impl : simple_type_impl<int32_t> {
int_type_impl() : simple_type_impl("int") {}
virtual void serialize(const boost::any& value, std::ostream& out) override {
auto v = boost::any_cast<const int32_t&>(value);
auto u = net::hton(uint32_t(v));
out.write(reinterpret_cast<const char*>(&u), sizeof(u));
}
virtual boost::any deserialize(std::istream& in) {
uint32_t u;
in.read(reinterpret_cast<char*>(&u), sizeof(u));
auto v = int32_t(net::ntoh(u));
return boost::any(v);
}
};
struct bigint_type_impl : simple_type_impl<int64_t> {
bigint_type_impl() : simple_type_impl("bigint") {}
virtual void serialize(const boost::any& value, std::ostream& out) override {
auto v = boost::any_cast<const int64_t&>(value);
auto u = net::hton(uint64_t(v));
out.write(reinterpret_cast<const char*>(&u), sizeof(u));
}
virtual boost::any deserialize(std::istream& in) {
uint64_t u;
in.read(reinterpret_cast<char*>(&u), sizeof(u));
auto v = int64_t(net::ntoh(u));
return boost::any(v);
}
};
struct string_type_impl : public data_type::impl {
string_type_impl(sstring name) : impl(name) {}
virtual void serialize(const boost::any& value, std::ostream& out) override {
auto& v = boost::any_cast<const sstring&>(value);
out.write(v.c_str(), v.size());
}
virtual boost::any deserialize(std::istream& in) {
std::vector<char> tmp(std::istreambuf_iterator<char>(in.rdbuf()),
std::istreambuf_iterator<char>());
// FIXME: validation?
return boost::any(sstring(tmp.data(), tmp.size()));
}
virtual bool less(const bytes& v1, const bytes& v2) override {
return less_unsigned(v1, v2);
}
};
struct blob_type_impl : public data_type::impl {
blob_type_impl() : impl("blob") {}
virtual void serialize(const boost::any& value, std::ostream& out) override {
auto& v = boost::any_cast<const bytes&>(value);
out.write(v.c_str(), v.size());
}
virtual boost::any deserialize(std::istream& in) {
std::vector<char> tmp(std::istreambuf_iterator<char>(in.rdbuf()),
std::istreambuf_iterator<char>());
return boost::any(bytes(reinterpret_cast<const char*>(tmp.data()), tmp.size()));
}
virtual bool less(const bytes& v1, const bytes& v2) override {
return less_unsigned(v1, v2);
}
};
thread_local data_type int_type(make_shared<int_type_impl>());
thread_local data_type bigint_type(make_shared<bigint_type_impl>());
thread_local data_type ascii_type(make_shared<string_type_impl>("ascii"));
thread_local data_type blob_type(make_shared<blob_type_impl>());
thread_local data_type varchar_type(make_shared<string_type_impl>("varchar"));
thread_local data_type text_type(make_shared<string_type_impl>("text"));
partition::partition(column_family& cf)
: rows(key_compare(cf.clustering_key_type)) {
}
column_family::column_family(data_type partition_key_type,
data_type clustering_key_type)
: partition_key_type(std::move(partition_key_type))
, clustering_key_type(std::move(clustering_key_type))
, partitions(key_compare(partition_key_type)) {
}
partition*
column_family::find_partition(const bytes& key) {
auto i = partitions.find(key);
return i == partitions.end() ? nullptr : &i->second;
}
row*
column_family::find_row(const bytes& partition_key, const bytes& clustering_key) {
partition* p = find_partition(partition_key);
if (!p) {
return nullptr;
}
auto i = p->rows.find(clustering_key);
return i == p->rows.end() ? nullptr : &i->second;
}
partition&
column_family::find_or_create_partition(const bytes& key) {
// call lower_bound so we have a hint for the insert, just in case.
auto i = partitions.lower_bound(key);
if (i == partitions.end() || key != i->first) {
i = partitions.emplace_hint(i, std::make_pair(std::move(key), partition(*this)));
}
return i->second;
}
row&
column_family::find_or_create_row(const bytes& partition_key, const bytes& clustering_key) {
partition& p = find_or_create_partition(partition_key);
// call lower_bound so we have a hint for the insert, just in case.
auto i = p.rows.lower_bound(clustering_key);
if (i == p.rows.end() || clustering_key != i->first) {
i = p.rows.emplace_hint(i, std::make_pair(std::move(clustering_key), row()));
}
return i->second;
}