/* * Copyright (C) 2014 Cloudius Systems, Ltd. */ #ifndef DATABASE_HH_ #define DATABASE_HH_ #include "dht/i_partitioner.hh" #include "config/ks_meta_data.hh" #include "locator/abstract_replication_strategy.hh" #include "core/sstring.hh" #include "core/shared_ptr.hh" #include "net/byteorder.hh" #include "utils/UUID.hh" #include "utils/hash.hh" #include "db_clock.hh" #include "gc_clock.hh" #include #include #include #include #include #include #include #include #include #include "types.hh" #include "compound.hh" #include "core/future.hh" #include "cql3/column_specification.hh" #include #include #include "schema.hh" #include "timestamp.hh" #include "tombstone.hh" #include "atomic_cell.hh" #include "query-request.hh" #include "query-result.hh" #include "keys.hh" #include "mutation.hh" namespace sstables { class sstable; } namespace db { template class serializer; class commitlog; class config; } struct column_family { column_family(schema_ptr schema); column_family(column_family&&) = default; ~column_family(); mutation_partition& find_or_create_partition(const dht::decorated_key& key); mutation_partition& find_or_create_partition_slow(const partition_key& key); mutation_partition* find_partition(const dht::decorated_key& key); mutation_partition* find_partition_slow(const partition_key& key); row& find_or_create_row_slow(const partition_key& partition_key, const clustering_key& clustering_key); row* find_row(const dht::decorated_key& partition_key, const clustering_key& clustering_key); schema_ptr _schema; std::map partitions; void apply(const mutation& m); // Returns at most "cmd.limit" rows future> query(const query::read_command& cmd); future<> populate(sstring datadir); private: // generation -> sstable. Ordered by key so we can easily get the most recent. std::map> _sstables; future<> probe_file(sstring sstdir, sstring fname); // Returns at most "limit" rows. The limit must be greater than 0. void get_partition_slice(mutation_partition& partition, const query::partition_slice& slice, uint32_t limit, query::result::partition_writer&); }; class user_types_metadata { std::unordered_map _user_types; public: user_type get_type(bytes name) const { return _user_types.at(name); } const std::unordered_map& get_all_types() const { return _user_types; } void add_type(user_type type) { auto i = _user_types.find(type->_name); assert(i == _user_types.end() || type->is_compatible_with(*i->second)); _user_types[type->_name] = std::move(type); } void remove_type(user_type type) { _user_types.erase(type->_name); } }; class keyspace { std::unique_ptr _replication_strategy; public: user_types_metadata _user_types; void create_replication_strategy(config::ks_meta_data& ksm); locator::abstract_replication_strategy& get_replication_strategy(); }; class no_such_keyspace : public std::runtime_error { public: using runtime_error::runtime_error; }; class no_such_column_family : public std::runtime_error { public: using runtime_error::runtime_error; }; // Policy for distributed: // broadcast metadata writes // local metadata reads // use shard_of() for data class database { std::unordered_map _keyspaces; std::unordered_map _column_families; std::unordered_map, utils::UUID, utils::tuple_hash> _ks_cf_to_uuid; std::unique_ptr _commitlog; std::unique_ptr _cfg; future<> init_commitlog(); future<> apply_in_memory(const mutation&); future<> populate(sstring datadir); public: database(); database(const db::config&); database(database&&) = default; ~database(); db::commitlog* commitlog() const { return _commitlog.get(); } future<> init_from_data_directory(); keyspace& add_keyspace(sstring name, keyspace k); /** Adds cf with auto-generated UUID. */ void add_column_family(column_family&&); void add_column_family(const utils::UUID&, column_family&&); /* throws std::out_of_range if missing */ const utils::UUID& find_uuid(const sstring& ks, const sstring& cf) const throw (std::out_of_range); const utils::UUID& find_uuid(const schema_ptr&) const throw (std::out_of_range); /* below, find* throws no_such_ on fail */ keyspace& find_or_create_keyspace(const sstring& name); keyspace& find_keyspace(const sstring& name) throw (no_such_keyspace); const keyspace& find_keyspace(const sstring& name) const throw (no_such_keyspace); bool has_keyspace(const sstring& name) const; void update_keyspace(const sstring& name); void drop_keyspace(const sstring& name); column_family& find_column_family(const sstring& ks, const sstring& name) throw (no_such_column_family); const column_family& find_column_family(const sstring& ks, const sstring& name) const throw (no_such_column_family); column_family& find_column_family(const utils::UUID&) throw (no_such_column_family); const column_family& find_column_family(const utils::UUID&) const throw (no_such_column_family); column_family& find_column_family(const schema_ptr&) throw (no_such_column_family); const column_family& find_column_family(const schema_ptr&) const throw (no_such_column_family); schema_ptr find_schema(const sstring& ks_name, const sstring& cf_name) const throw (no_such_column_family); schema_ptr find_schema(const utils::UUID&) const throw (no_such_column_family); future<> stop(); unsigned shard_of(const dht::token& t); unsigned shard_of(const mutation& m); future> query(const query::read_command& cmd); future<> apply(const mutation&); friend std::ostream& operator<<(std::ostream& out, const database& db); }; // FIXME: stub class secondary_index_manager {}; #endif /* DATABASE_HH_ */