db folder - object/index¶
This section shows each (db object/index information) process file in the db folder.
File directory: (../ibraries/db/include/graphene/db/xxxxx.hhp)
Table of Contents
index.cpp¶
base_primary_index
on_add¶
void base_primary_index::on_add( const object& obj )
{
_db.save_undo_add( obj );
for( auto ob : _observers ) ob->on_add( obj );
}
object_database.cpp¶
object_database::object_database()
:_undo_db(*this)
{
_index.resize(255);
_undo_db.enable();
}
object_database::~object_database(){}
void object_database::close()
{
}
object_database
find_object¶
const object* object_database::find_object( object_id_type id )const
{
return get_index(id.space(),id.type()).find( id );
}
get_object¶
const object& object_database::get_object( object_id_type id )const
{
return get_index(id.space(),id.type()).get( id );
}
get_index¶
const index& object_database::get_index(uint8_t space_id, uint8_t type_id)const
{
FC_ASSERT( _index.size() > space_id, "", ("space_id",space_id)("type_id",type_id)("index.size",_index.size()) );
FC_ASSERT( _index[space_id].size() > type_id, "", ("space_id",space_id)("type_id",type_id)("index[space_id].size",_index[space_id].size()) );
const auto& tmp = _index[space_id][type_id];
FC_ASSERT( tmp );
return *tmp;
}
get_mutable_index¶
index& object_database::get_mutable_index(uint8_t space_id, uint8_t type_id)
{
FC_ASSERT( _index.size() > space_id, "", ("space_id",space_id)("type_id",type_id)("index.size",_index.size()) );
FC_ASSERT( _index[space_id].size() > type_id , "", ("space_id",space_id)("type_id",type_id)("index[space_id].size",_index[space_id].size()) );
const auto& idx = _index[space_id][type_id];
FC_ASSERT( idx, "", ("space",space_id)("type",type_id) );
return *idx;
}
flush¶
void object_database::flush()
{
// ilog("Save object_database in ${d}", ("d", _data_dir));
fc::create_directories( _data_dir / "object_database.tmp" / "lock" );
for( uint32_t space = 0; space < _index.size(); ++space )
{
fc::create_directories( _data_dir / "object_database.tmp" / fc::to_string(space) );
const auto types = _index[space].size();
for( uint32_t type = 0; type < types; ++type )
if( _index[space][type] )
_index[space][type]->save( _data_dir / "object_database.tmp" / fc::to_string(space)/fc::to_string(type) );
}
fc::remove_all( _data_dir / "object_database.tmp" / "lock" );
if( fc::exists( _data_dir / "object_database" ) )
fc::rename( _data_dir / "object_database", _data_dir / "object_database.old" );
fc::rename( _data_dir / "object_database.tmp", _data_dir / "object_database" );
fc::remove_all( _data_dir / "object_database.old" );
}
wipe¶
void object_database::wipe(const fc::path& data_dir)
{
close();
ilog("Wiping object database...");
fc::remove_all(data_dir / "object_database");
ilog("Done wiping object databse.");
}
open¶
void object_database::open(const fc::path& data_dir)
{ try {
_data_dir = data_dir;
if( fc::exists( _data_dir / "object_database" / "lock" ) )
{
wlog("Ignoring locked object_database");
return;
}
ilog("Opening object database from ${d} ...", ("d", data_dir));
for( uint32_t space = 0; space < _index.size(); ++space )
for( uint32_t type = 0; type < _index[space].size(); ++type )
if( _index[space][type] )
_index[space][type]->open( _data_dir / "object_database" / fc::to_string(space)/fc::to_string(type) );
ilog( "Done opening object database." );
} FC_CAPTURE_AND_RETHROW( (data_dir) ) }
pop_undo¶
void object_database::pop_undo()
{ try {
_undo_db.pop_commit();
} FC_CAPTURE_AND_RETHROW() }
save_undo_add¶
void object_database::save_undo_add( const object& obj )
{
_undo_db.on_create( obj );
}
save_undo_remove¶
void object_database::save_undo_remove(const object& obj)
{
_undo_db.on_remove( obj );
}
undo_database.cpp¶
void undo_database::enable() { _disabled = false; }
void undo_database::disable() { _disabled = true; }
undo_database::session undo_database::start_undo_session( bool force_enable )
{
if( _disabled && !force_enable ) return session(*this);
bool disable_on_exit = _disabled && force_enable;
if( force_enable )
_disabled = false;
while( size() > max_size() )
_stack.pop_front();
_stack.emplace_back();
++_active_sessions;
return session(*this, disable_on_exit );
}
undo_database
on_create¶
void undo_database::on_create( const object& obj )
{
if( _disabled ) return;
if( _stack.empty() )
_stack.emplace_back();
auto& state = _stack.back();
auto index_id = object_id_type( obj.id.space(), obj.id.type(), 0 );
auto itr = state.old_index_next_ids.find( index_id );
if( itr == state.old_index_next_ids.end() )
state.old_index_next_ids[index_id] = obj.id;
state.new_ids.insert(obj.id);
}
on_modify¶
void undo_database::on_modify( const object& obj )
{
if( _disabled ) return;
if( _stack.empty() )
_stack.emplace_back();
auto& state = _stack.back();
if( state.new_ids.find(obj.id) != state.new_ids.end() )
return;
auto itr = state.old_values.find(obj.id);
if( itr != state.old_values.end() ) return;
state.old_values[obj.id] = obj.clone();
}
on_remove¶
void undo_database::on_remove( const object& obj )
{
if( _disabled ) return;
if( _stack.empty() )
_stack.emplace_back();
undo_state& state = _stack.back();
if( state.new_ids.count(obj.id) )
{
state.new_ids.erase(obj.id);
return;
}
if( state.old_values.count(obj.id) )
{
state.removed[obj.id] = std::move(state.old_values[obj.id]);
state.old_values.erase(obj.id);
return;
}
if( state.removed.count(obj.id) ) return;
state.removed[obj.id] = obj.clone();
}
undo¶
void undo_database::undo()
{ try {
FC_ASSERT( !_disabled );
FC_ASSERT( _active_sessions > 0 );
disable();
auto& state = _stack.back();
for( auto& item : state.old_values )
{
_db.modify( _db.get_object( item.second->id ), [&]( object& obj ){ obj.move_from( *item.second ); } );
}
for( auto ritr = state.new_ids.begin(); ritr != state.new_ids.end(); ++ritr )
{
_db.remove( _db.get_object(*ritr) );
}
for( auto& item : state.old_index_next_ids )
{
_db.get_mutable_index( item.first.space(), item.first.type() ).set_next_id( item.second );
}
for( auto& item : state.removed )
_db.insert( std::move(*item.second) );
_stack.pop_back();
enable();
--_active_sessions;
} FC_CAPTURE_AND_RETHROW() }
merge¶
void undo_database::merge()
{
FC_ASSERT( _active_sessions > 0 );
if( _active_sessions == 1 && _stack.size() == 1 )
{
_stack.pop_back();
--_active_sessions;
return;
}
FC_ASSERT( _stack.size() >=2 );
auto& state = _stack.back();
auto& prev_state = _stack[_stack.size()-2];
// An object's relationship to a state can be:
// in new_ids : new
// in old_values (was=X) : upd(was=X)
// in removed (was=X) : del(was=X)
// not in any of above : nop
//
// When merging A=prev_state and B=state we have a 4x4 matrix of all possibilities:
//
// |--------------------- B ----------------------|
//
// +------------+------------+------------+------------+
// | new | upd(was=Y) | del(was=Y) | nop |
// +------------+------------+------------+------------+------------+
// / | new | N/A | new A| nop C| new A|
// | +------------+------------+------------+------------+------------+
// | | upd(was=X) | N/A | upd(was=X)A| del(was=X)C| upd(was=X)A|
// A +------------+------------+------------+------------+------------+
// | | del(was=X) | N/A | N/A | N/A | del(was=X)A|
// | +------------+------------+------------+------------+------------+
// \ | nop | new B| upd(was=Y)B| del(was=Y)B| nop AB|
// +------------+------------+------------+------------+------------+
//
// Each entry was composed by labelling what should occur in the given case.
//
// Type A means the composition of states contains the same entry as the first of the two merged states for that object.
// Type B means the composition of states contains the same entry as the second of the two merged states for that object.
// Type C means the composition of states contains an entry different from either of the merged states for that object.
// Type N/A means the composition of states violates causal timing.
// Type AB means both type A and type B simultaneously.
//
// The merge() operation is defined as modifying prev_state in-place to be the state object which represents the composition of
// state A and B.
//
// Type A (and AB) can be implemented as a no-op; prev_state already contains the correct value for the merged state.
// Type B (and AB) can be implemented by copying from state to prev_state.
// Type C needs special case-by-case logic.
// Type N/A can be ignored or assert(false) as it can only occur if prev_state and state have illegal values
// (a serious logic error which should never happen).
//
// We can only be outside type A/AB (the nop path) if B is not nop, so it suffices to iterate through B's three containers.
// *+upd
for( auto& obj : state.old_values )
{
if( prev_state.new_ids.find(obj.second->id) != prev_state.new_ids.end() )
{
// new+upd -> new, type A
continue;
}
if( prev_state.old_values.find(obj.second->id) != prev_state.old_values.end() )
{
// upd(was=X) + upd(was=Y) -> upd(was=X), type A
continue;
}
// del+upd -> N/A
assert( prev_state.removed.find(obj.second->id) == prev_state.removed.end() );
// nop+upd(was=Y) -> upd(was=Y), type B
prev_state.old_values[obj.second->id] = std::move(obj.second);
}
// *+new, but we assume the N/A cases don't happen, leaving type B nop+new -> new
for( auto id : state.new_ids )
prev_state.new_ids.insert(id);
// old_index_next_ids can only be updated, iterate over *+upd cases
for( auto& item : state.old_index_next_ids )
{
if( prev_state.old_index_next_ids.find( item.first ) == prev_state.old_index_next_ids.end() )
{
// nop+upd(was=Y) -> upd(was=Y), type B
prev_state.old_index_next_ids[item.first] = item.second;
continue;
}
else
{
// upd(was=X)+upd(was=Y) -> upd(was=X), type A
// type A implementation is a no-op, as discussed above, so there is no code here
continue;
}
}
// *+del
for( auto& obj : state.removed )
{
if( prev_state.new_ids.find(obj.second->id) != prev_state.new_ids.end() )
{
// new + del -> nop (type C)
prev_state.new_ids.erase(obj.second->id);
continue;
}
auto it = prev_state.old_values.find(obj.second->id);
if( it != prev_state.old_values.end() )
{
// upd(was=X) + del(was=Y) -> del(was=X)
prev_state.removed[obj.second->id] = std::move(it->second);
prev_state.old_values.erase(obj.second->id);
continue;
}
// del + del -> N/A
assert( prev_state.removed.find( obj.second->id ) == prev_state.removed.end() );
// nop + del(was=Y) -> del(was=Y)
prev_state.removed[obj.second->id] = std::move(obj.second);
}
_stack.pop_back();
--_active_sessions;
}
pop_commit¶
void undo_database::pop_commit()
{
FC_ASSERT( _active_sessions == 0 );
FC_ASSERT( !_stack.empty() );
disable();
try {
auto& state = _stack.back();
for( auto& item : state.old_values )
{
_db.modify( _db.get_object( item.second->id ), [&]( object& obj ){ obj.move_from( *item.second ); } );
}
for( auto ritr = state.new_ids.begin(); ritr != state.new_ids.end(); ++ritr )
{
_db.remove( _db.get_object(*ritr) );
}
for( auto& item : state.old_index_next_ids )
{
_db.get_mutable_index( item.first.space(), item.first.type() ).set_next_id( item.second );
}
for( auto& item : state.removed )
_db.insert( std::move(*item.second) );
_stack.pop_back();
}
catch ( const fc::exception& e )
{
elog( "error popping commit ${e}", ("e", e.to_detail_string() ) );
enable();
throw;
}
enable();
}
index.hpp¶
class object_database;
using fc::path;
index_observer¶
used to get callbacks when objects change
class index_observer
{
public:
virtual ~index_observer(){}
/** called just after the object is added */
virtual void on_add( const object& obj ){}
/** called just before obj is removed */
virtual void on_remove( const object& obj ){}
/** called just after obj is modified with new value*/
virtual void on_modify( const object& obj ){}
};
index¶
abstract base class for accessing objects indexed in various ways.
All indexes assume that there exists an object ID space that will grow forever in a seqential manner. These IDs are used to identify the index, type, and instance of the object.
Items in an index can only be modified via a call to modify and all references to objects outside of that callback are const references.
Most implementations will probably be some form of boost::multi_index_container which means that they can covnert a reference to an object to an iterator. When at all possible save a pointer/reference to your objects rather than constantly looking them up by ID.
class index
{
public:
virtual ~index(){}
virtual uint8_t object_space_id()const = 0;
virtual uint8_t object_type_id()const = 0;
virtual object_id_type get_next_id()const = 0;
virtual void use_next_id() = 0;
virtual void set_next_id( object_id_type id ) = 0;
virtual const object& load( const std::vector<char>& data ) = 0;
/**
* Polymorphically insert by moving an object into the index.
* this should throw if the object is already in the database.
*/
virtual const object& insert( object&& obj ) = 0;
/**
* Builds a new object and assigns it the next available ID and then
* initializes it with constructor and lastly inserts it into the index.
*/
virtual const object& create( const std::function<void(object&)>& constructor ) = 0;
/**
* Opens the index loading objects from a file
*/
virtual void open( const fc::path& db ) = 0;
virtual void save( const fc::path& db ) = 0;
/** @return the object with id or nullptr if not found */
virtual const object* find( object_id_type id )const = 0;
/**
* This version will automatically check for nullptr and throw an exception if the
* object ID could not be found.
*/
const object& get( object_id_type id )const
{
auto maybe_found = find( id );
FC_ASSERT( maybe_found != nullptr, "Unable to find Object ${id}", ("id",id) );
return *maybe_found;
}
virtual void modify( const object& obj, const std::function<void(object&)>& ) = 0;
virtual void remove( const object& obj ) = 0;
/**
* When forming your lambda to modify obj, it is natural to have Object& be the signature, but
* that is not compatible with the type erasue required by the virtual method. This method
* provides a helper to wrap the lambda in a form compatible with the virtual modify call.
* @note Lambda should have the signature: void(Object&)
*/
template<typename Object, typename Lambda>
void modify( const Object& obj, const Lambda& l ) {
modify( static_cast<const object&>(obj), std::function<void(object&)>( [&]( object& o ){ l( static_cast<Object&>(o) ); } ) );
}
virtual void inspect_all_objects(std::function<void(const object&)> inspector)const = 0;
virtual fc::uint128 hash()const = 0;
virtual void add_observer( const shared_ptr<index_observer>& ) = 0;
virtual void object_from_variant( const fc::variant& var, object& obj, uint32_t max_depth )const = 0;
virtual void object_default( object& obj )const = 0;
};
secondary_index¶
class secondary_index
{
public:
virtual ~secondary_index(){};
virtual void object_inserted( const object& obj ){};
virtual void object_removed( const object& obj ){};
virtual void about_to_modify( const object& before ){};
virtual void object_modified( const object& after ){};
};
base_primary_index¶
Defines the common implementation
class base_primary_index
{
public:
base_primary_index( object_database& db ):_db(db){}
/** called just before obj is modified */
void save_undo( const object& obj );
/** called just after the object is added */
void on_add( const object& obj );
/** called just before obj is removed */
void on_remove( const object& obj );
/** called just after obj is modified */
void on_modify( const object& obj );
template<typename T, typename... Args>
T* add_secondary_index(Args... args)
{
_sindex.emplace_back( new T(args...) );
return static_cast<T*>(_sindex.back().get());
}
template<typename T>
const T& get_secondary_index()const
{
for( const auto& item : _sindex )
{
const T* result = dynamic_cast<const T*>(item.get());
if( result != nullptr ) return *result;
}
FC_THROW_EXCEPTION( fc::assert_exception, "invalid index type" );
}
protected:
vector< shared_ptr<index_observer> > _observers;
vector< unique_ptr<secondary_index> > _sindex;
private:
object_database& _db;
};
primary_index¶
Wraps a derived index to intercept calls to create, modify, and remove so that callbacks may be fired and undo state saved.
@see http://en.wikipedia.org/wiki/Curiously_recurring_template_pattern
template<typename DerivedIndex>
class primary_index : public DerivedIndex, public base_primary_index
{
public:
typedef typename DerivedIndex::object_type object_type;
primary_index( object_database& db )
:base_primary_index(db),_next_id(object_type::space_id,object_type::type_id,0) {}
virtual uint8_t object_space_id()const override
{ return object_type::space_id; }
virtual uint8_t object_type_id()const override
{ return object_type::type_id; }
virtual object_id_type get_next_id()const override { return _next_id; }
virtual void use_next_id()override { ++_next_id.number; }
virtual void set_next_id( object_id_type id )override { _next_id = id; }
fc::sha256 get_object_version()const
{
std::string desc = "1.0";//get_type_description<object_type>();
return fc::sha256::hash(desc);
}
virtual void open( const path& db )override
{
if( !fc::exists( db ) ) return;
fc::file_mapping fm( db.generic_string().c_str(), fc::read_only );
fc::mapped_region mr( fm, fc::read_only, 0, fc::file_size(db) );
fc::datastream<const char*> ds( (const char*)mr.get_address(), mr.get_size() );
fc::sha256 open_ver;
fc::raw::unpack(ds, _next_id);
fc::raw::unpack(ds, open_ver);
FC_ASSERT( open_ver == get_object_version(), "Incompatible Version, the serialization of objects in this index has changed" );
try {
vector<char> tmp;
while( true )
{
fc::raw::unpack( ds, tmp );
load( tmp );
}
} catch ( const fc::exception& ){}
}
virtual void save( const path& db ) override
{
std::ofstream out( db.generic_string(),
std::ofstream::binary | std::ofstream::out | std::ofstream::trunc );
FC_ASSERT( out );
auto ver = get_object_version();
fc::raw::pack( out, _next_id );
fc::raw::pack( out, ver );
this->inspect_all_objects( [&]( const object& o ) {
auto vec = fc::raw::pack( static_cast<const object_type&>(o) );
auto packed_vec = fc::raw::pack( vec );
out.write( packed_vec.data(), packed_vec.size() );
});
}
virtual const object& load( const std::vector<char>& data )override
{
const auto& result = DerivedIndex::insert( fc::raw::unpack<object_type>( data ) );
for( const auto& item : _sindex )
item->object_inserted( result );
return result;
}
virtual const object& create(const std::function<void(object&)>& constructor )override
{
const auto& result = DerivedIndex::create( constructor );
for( const auto& item : _sindex )
item->object_inserted( result );
on_add( result );
return result;
}
virtual const object& insert( object&& obj ) override
{
const auto& result = DerivedIndex::insert( std::move( obj ) );
for( const auto& item : _sindex )
item->object_inserted( result );
on_add( result );
return result;
}
virtual void remove( const object& obj ) override
{
for( const auto& item : _sindex )
item->object_removed( obj );
on_remove(obj);
DerivedIndex::remove(obj);
}
virtual void modify( const object& obj, const std::function<void(object&)>& m )override
{
save_undo( obj );
for( const auto& item : _sindex )
item->about_to_modify( obj );
DerivedIndex::modify( obj, m );
for( const auto& item : _sindex )
item->object_modified( obj );
on_modify( obj );
}
virtual void add_observer( const shared_ptr<index_observer>& o ) override
{
_observers.emplace_back( o );
}
virtual void object_from_variant( const fc::variant& var, object& obj, uint32_t max_depth )const override
{
object_id_type id = obj.id;
object_type* result = dynamic_cast<object_type*>( &obj );
FC_ASSERT( result != nullptr );
fc::from_variant( var, *result, max_depth );
obj.id = id;
}
virtual void object_default( object& obj )const override
{
object_id_type id = obj.id;
object_type* result = dynamic_cast<object_type*>( &obj );
FC_ASSERT( result != nullptr );
(*result) = object_type();
obj.id = id;
}
private:
object_id_type _next_id;
};
object.hpp¶
object¶
base for all database objects
The object is the fundamental building block of the database and is the level upon which undo/redo operations are performed. Objects are used to track data and their relationships and provide an efficient means to find and update information.
Objects are assigned a unique and sequential object ID by the database within the id_space defined in the object.
All objects must be serializable via FC_REFLECT() and their content must be faithfully restored. Additionally all objects must be copy-constructable and assignable in a relatively efficient manner. In general this means that objects should only refer to other objects by ID and avoid expensive operations when they are copied, especially if they are modified frequently.
Additionally all objects may be annotated by plugins which wish to maintain additional information to an object. There can be at most one annotation per id_space for each object. An example of an annotation would be tracking extra data not required by validation such as the name and description of a user asset. By carefully organizing how information is organized and tracked systems can minimize the workload to only that which is necessary to perform their function.
@note Do not use multiple inheritance with object because the code assumes a static_cast will work between object and derived types.
class object
{
public:
object(){}
virtual ~object(){}
static const uint8_t space_id = 0;
static const uint8_t type_id = 0;
// serialized
object_id_type id;
/// these methods are implemented for derived classes by inheriting abstract_object<DerivedClass>
virtual unique_ptr<object> clone()const = 0;
virtual void move_from( object& obj ) = 0;
virtual variant to_variant()const = 0;
virtual vector<char> pack()const = 0;
virtual fc::uint128 hash()const = 0;
};
abstract_object¶
Use the Curiously Recurring Template Pattern to automatically add the ability to clone, serialize, and move objects polymorphically.
http://en.wikipedia.org/wiki/Curiously_recurring_template_pattern
template<typename DerivedClass>
class abstract_object : public object
{
public:
virtual unique_ptr<object> clone()const
{
return unique_ptr<object>(new DerivedClass( *static_cast<const DerivedClass*>(this) ));
}
virtual void move_from( object& obj )
{
static_cast<DerivedClass&>(*this) = std::move( static_cast<DerivedClass&>(obj) );
}
virtual variant to_variant()const { return variant( static_cast<const DerivedClass&>(*this), MAX_NESTING ); }
virtual vector<char> pack()const { return fc::raw::pack( static_cast<const DerivedClass&>(*this) ); }
virtual fc::uint128 hash()const {
auto tmp = this->pack();
return fc::city_hash_crc_128( tmp.data(), tmp.size() );
}
};
typedef flat_map<uint8_t, object_id_type> annotation_map;
annotated_object¶
An object that is easily extended by providing pointers to other objects, one for each space.
template<typename DerivedClass>
class annotated_object : public abstract_object<DerivedClass>
{
public:
/** return object_id_type() if no anotation is found for id_space */
object_id_type get_annotation( uint8_t annotation_id_space )const
{
auto itr = annotations.find(annotation_id_space);
if( itr != annotations.end() ) return itr->second;
return object_id_type();
}
void set_annotation( object_id_type id )
{
annotations[id.space()] = id;
}
/**
* Annotations should be accessed via get_annotation and set_annotation so
* that they can be maintained in sorted order.
*/
annotation_map annotations;
};
object_database.hpp¶
object_database¶
maintains a set of indexed objects that can be modified with multi-level rollback support
class object_database
{
public:
object_database();
~object_database();
void reset_indexes() { _index.clear(); _index.resize(255); }
void open(const fc::path& data_dir );
/**
* Saves the complete state of the object_database to disk, this could take a while
*/
void flush();
void wipe(const fc::path& data_dir); // remove from disk
void close();
template<typename T, typename F>
const T& create( F&& constructor )
{
auto& idx = get_mutable_index<T>();
return static_cast<const T&>( idx.create( [&](object& o)
{
assert( dynamic_cast<T*>(&o) );
constructor( static_cast<T&>(o) );
} ));
}
///These methods are used to retrieve indexes on the object_database. All public index accessors are const-access only.
/// @{
template<typename IndexType>
const IndexType& get_index_type()const {
static_assert( std::is_base_of<index,IndexType>::value, "Type must be an index type" );
return static_cast<const IndexType&>( get_index( IndexType::object_type::space_id, IndexType::object_type::type_id ) );
}
template<typename T>
const index& get_index()const { return get_index(T::space_id,T::type_id); }
const index& get_index(uint8_t space_id, uint8_t type_id)const;
const index& get_index(object_id_type id)const { return get_index(id.space(),id.type()); }
/// @}
const object& get_object( object_id_type id )const;
const object* find_object( object_id_type id )const;
/// These methods are mutators of the object_database. You must use these methods to make changes to the object_database,
/// in order to maintain proper undo history.
///@{
const object& insert( object&& obj ) { return get_mutable_index(obj.id).insert( std::move(obj) ); }
void remove( const object& obj ) { get_mutable_index(obj.id).remove( obj ); }
template<typename T, typename Lambda>
void modify( const T& obj, const Lambda& m ) {
get_mutable_index(obj.id).modify(obj,m);
}
///@}
template<typename T>
static const T& cast( const object& obj )
{
assert( nullptr != dynamic_cast<const T*>(&obj) );
return static_cast<const T&>(obj);
}
template<typename T>
static T& cast( object& obj )
{
assert( nullptr != dynamic_cast<T*>(&obj) );
return static_cast<T&>(obj);
}
template<typename T>
const T& get( object_id_type id )const
{
const object& obj = get_object( id );
assert( nullptr != dynamic_cast<const T*>(&obj) );
return static_cast<const T&>(obj);
}
template<typename T>
const T* find( object_id_type id )const
{
const object* obj = find_object( id );
assert( !obj || nullptr != dynamic_cast<const T*>(obj) );
return static_cast<const T*>(obj);
}
template<uint8_t SpaceID, uint8_t TypeID, typename T>
const T* find( object_id<SpaceID,TypeID,T> id )const { return find<T>(id); }
template<uint8_t SpaceID, uint8_t TypeID, typename T>
const T& get( object_id<SpaceID,TypeID,T> id )const { return get<T>(id); }
template<typename IndexType>
IndexType* add_index()
{
typedef typename IndexType::object_type ObjectType;
if( _index[ObjectType::space_id].size() <= ObjectType::type_id )
_index[ObjectType::space_id].resize( 255 );
assert(!_index[ObjectType::space_id][ObjectType::type_id]);
unique_ptr<index> indexptr( new IndexType(*this) );
_index[ObjectType::space_id][ObjectType::type_id] = std::move(indexptr);
return static_cast<IndexType*>(_index[ObjectType::space_id][ObjectType::type_id].get());
}
template<typename IndexType, typename SecondaryIndexType, typename... Args>
SecondaryIndexType* add_secondary_index( Args... args )
{
return get_mutable_index_type<IndexType>().template add_secondary_index<SecondaryIndexType, Args...>(args...);
}
void pop_undo();
fc::path get_data_dir()const { return _data_dir; }
/** public for testing purposes only... should be private in practice. */
undo_database _undo_db;
protected:
template<typename IndexType>
IndexType& get_mutable_index_type() {
static_assert( std::is_base_of<index,IndexType>::value, "Type must be an index type" );
return static_cast<IndexType&>( get_mutable_index( IndexType::object_type::space_id, IndexType::object_type::type_id ) );
}
template<typename T>
index& get_mutable_index()
{ return get_mutable_index(T::space_id,T::type_id); }
index& get_mutable_index(object_id_type id)
{ return get_mutable_index(id.space(),id.type()); }
index& get_mutable_index(uint8_t space_id, uint8_t type_id);
private:
friend class base_primary_index;
friend class undo_database;
void save_undo( const object& obj );
void save_undo_add( const object& obj );
void save_undo_remove( const object& obj );
fc::path _data_dir;
vector< vector< unique_ptr<index> > > _index;
};
object_id.hpp¶
using std::shared_ptr;
using std::unique_ptr;
using std::vector;
using fc::flat_map;
using fc::variant;
using fc::unsigned_int;
using fc::signed_int;
object_id_type¶
struct object_id_type
{
object_id_type( uint8_t s, uint8_t t, uint64_t i )
{
FC_ASSERT( i >> 48 == 0, "instance overflow", ("instance",i) );
number = (uint64_t(s)<<56) | (uint64_t(t)<<48) | i;
}
object_id_type(){ number = 0; }
uint8_t space()const { return number >> 56; }
uint8_t type()const { return number >> 48 & 0x00ff; }
uint16_t space_type()const { return number >> 48; }
uint64_t instance()const { return number & GRAPHENE_DB_MAX_INSTANCE_ID; }
bool is_null()const { return number == 0; }
explicit operator uint64_t()const { return number; }
friend bool operator == ( const object_id_type& a, const object_id_type& b ) { return a.number == b.number; }
friend bool operator != ( const object_id_type& a, const object_id_type& b ) { return a.number != b.number; }
friend bool operator < ( const object_id_type& a, const object_id_type& b ) { return a.number < b.number; }
friend bool operator > ( const object_id_type& a, const object_id_type& b ) { return a.number > b.number; }
object_id_type& operator++(int) { ++number; return *this; }
object_id_type& operator++() { ++number; return *this; }
friend object_id_type operator+(const object_id_type& a, int delta ) {
return object_id_type( a.space(), a.type(), a.instance() + delta );
}
friend object_id_type operator+(const object_id_type& a, int64_t delta ) {
return object_id_type( a.space(), a.type(), a.instance() + delta );
}
friend size_t hash_value( object_id_type v ) { return std::hash<uint64_t>()(v.number); }
template< typename T >
bool is() const
{
return (number >> 48) == ((T::space_id << 8) | (T::type_id));
}
template< typename T >
T as() const
{
FC_ASSERT( is<T>() );
return T( *this );
}
explicit operator std::string() const
{
return fc::to_string(space()) + "." + fc::to_string(type()) + "." + fc::to_string(instance());
}
uint64_t number;
};
object_id¶
class object;
class object_database;
template<uint8_t SpaceID, uint8_t TypeID, typename T = object>
struct object_id
{
typedef T type;
static const uint8_t space_id = SpaceID;
static const uint8_t type_id = TypeID;
object_id(){}
object_id( unsigned_int i ):instance(i){}
explicit object_id( uint64_t i ):instance(i)
{
FC_ASSERT( (i >> 48) == 0 );
}
object_id( object_id_type id ):instance(id.instance())
{
}
friend object_id operator+(const object_id a, int64_t delta ) { return object_id( uint64_t(a.instance.value+delta) ); }
friend object_id operator+(const object_id a, int delta ) { return object_id( uint64_t(a.instance.value+delta) ); }
operator object_id_type()const { return object_id_type( SpaceID, TypeID, instance.value ); }
explicit operator uint64_t()const { return object_id_type( *this ).number; }
template<typename DB>
const T& operator()(const DB& db)const { return db.get(*this); }
friend bool operator == ( const object_id& a, const object_id& b ) { return a.instance == b.instance; }
friend bool operator != ( const object_id& a, const object_id& b ) { return a.instance != b.instance; }
friend bool operator == ( const object_id_type& a, const object_id& b ) { return a == object_id_type(b); }
friend bool operator != ( const object_id_type& a, const object_id& b ) { return a != object_id_type(b); }
friend bool operator == ( const object_id& b, const object_id_type& a ) { return a == object_id_type(b); }
friend bool operator != ( const object_id& b, const object_id_type& a ) { return a != object_id_type(b); }
friend bool operator < ( const object_id& a, const object_id& b ) { return a.instance.value < b.instance.value; }
friend bool operator > ( const object_id& a, const object_id& b ) { return a.instance.value > b.instance.value; }
friend size_t hash_value( object_id v ) { return std::hash<uint64_t>()(v.instance.value); }
unsigned_int instance;
};
simple_index.hpp¶
simple_index¶
A simple index uses a vector<unique_ptr<T>> to store data
This index is preferred in situations where the data will never be removed from main memory and when access by ID is the only kind of access that is necessary.
template<typename T>
class simple_index : public index
{
public:
typedef T object_type;
virtual const object& create( const std::function<void(object&)>& constructor ) override
{
auto id = get_next_id();
auto instance = id.instance();
if( instance >= _objects.size() ) _objects.resize( instance + 1 );
_objects[instance].reset(new T);
_objects[instance]->id = id;
constructor( *_objects[instance] );
_objects[instance]->id = id; // just in case it changed
use_next_id();
return *_objects[instance];
}
virtual void modify( const object& obj, const std::function<void(object&)>& modify_callback ) override
{
assert( obj.id.instance() < _objects.size() );
modify_callback( *_objects[obj.id.instance()] );
}
virtual const object& insert( object&& obj )override
{
auto instance = obj.id.instance();
assert( nullptr != dynamic_cast<T*>(&obj) );
if( _objects.size() <= instance ) _objects.resize( instance+1 );
assert( !_objects[instance] );
_objects[instance].reset( new T( std::move( static_cast<T&>(obj) ) ) );
return *_objects[instance];
}
virtual void remove( const object& obj ) override
{
assert( nullptr != dynamic_cast<const T*>(&obj) );
const auto instance = obj.id.instance();
_objects[instance].reset();
while( (_objects.size() > 0) && (_objects.back() == nullptr) )
_objects.pop_back();
}
virtual const object* find( object_id_type id )const override
{
assert( id.space() == T::space_id );
assert( id.type() == T::type_id );
const auto instance = id.instance();
if( instance >= _objects.size() ) return nullptr;
return _objects[instance].get();
}
virtual void inspect_all_objects(std::function<void (const object&)> inspector)const override
{
try {
for( const auto& ptr : _objects )
{
if( ptr.get() )
inspector(*ptr);
}
} FC_CAPTURE_AND_RETHROW()
}
virtual fc::uint128 hash()const override {
fc::uint128 result;
for( const auto& ptr : _objects )
result += ptr->hash();
return result;
}
class const_iterator
{
public:
const_iterator( const vector<unique_ptr<object>>& objects ):_objects(objects) {}
const_iterator(
const vector<unique_ptr<object>>& objects,
const vector<unique_ptr<object>>::const_iterator& a ):_itr(a),_objects(objects){}
friend bool operator==( const const_iterator& a, const const_iterator& b ) { return a._itr == b._itr; }
friend bool operator!=( const const_iterator& a, const const_iterator& b ) { return a._itr != b._itr; }
const T& operator*()const { return static_cast<const T&>(*_itr->get()); }
const_iterator operator++(int) // postfix
{
const_iterator result( *this );
++(*this);
return result;
}
const_iterator& operator++() // prefix
{
++_itr;
while( (_itr != _objects.end()) && ( (*_itr) == nullptr ) )
++_itr;
return *this;
}
typedef std::forward_iterator_tag iterator_category;
typedef vector<unique_ptr<object> >::value_type value_type;
typedef vector<unique_ptr<object> >::difference_type difference_type;
typedef vector<unique_ptr<object> >::pointer pointer;
typedef vector<unique_ptr<object> >::reference reference;
private:
vector<unique_ptr<object>>::const_iterator _itr;
const vector<unique_ptr<object>>& _objects;
};
const_iterator begin()const { return const_iterator(_objects, _objects.begin()); }
const_iterator end()const { return const_iterator(_objects, _objects.end()); }
size_t size()const { return _objects.size(); }
private:
vector< unique_ptr<object> > _objects;
};
undu_database.hpp¶
undo_state¶
using std::unordered_map;
using fc::flat_set;
class object_database;
struct undo_state
{
unordered_map<object_id_type, unique_ptr<object> > old_values;
unordered_map<object_id_type, object_id_type> old_index_next_ids;
std::unordered_set<object_id_type> new_ids;
unordered_map<object_id_type, unique_ptr<object> > removed;
};
undo_database¶
tracks changes to the state and allows changes to be undone
class undo_database
{
public:
undo_database( object_database& db ):_db(db){}
class session
{
public:
session( session&& mv )
:_db(mv._db),_apply_undo(mv._apply_undo)
{
mv._apply_undo = false;
}
~session() {
try {
if( _apply_undo ) _db.undo();
}
catch ( const fc::exception& e )
{
elog( "${e}", ("e",e.to_detail_string() ) );
throw; // maybe crash..
}
if( _disable_on_exit ) _db.disable();
}
void commit() { _apply_undo = false; _db.commit(); }
void undo() { if( _apply_undo ) _db.undo(); _apply_undo = false; }
void merge() { if( _apply_undo ) _db.merge(); _apply_undo = false; }
session& operator = ( session&& mv )
{ try {
if( this == &mv ) return *this;
if( _apply_undo ) _db.undo();
_apply_undo = mv._apply_undo;
mv._apply_undo = false;
return *this;
} FC_CAPTURE_AND_RETHROW() }
private:
friend class undo_database;
session(undo_database& db, bool disable_on_exit = false): _db(db),_disable_on_exit(disable_on_exit) {}
undo_database& _db;
bool _apply_undo = true;
bool _disable_on_exit = false;
};
void disable();
void enable();
bool enabled()const { return !_disabled; }
session start_undo_session( bool force_enable = false );
/**
* This should be called just after an object is created
*/
void on_create( const object& obj );
/**
* This should be called just before an object is modified
*
* If it's a new object as of this undo state, its pre-modification value is not stored, because prior to this
* undo state, it did not exist. Any modifications in this undo state are irrelevant, as the object will simply
* be removed if we undo.
*/
void on_modify( const object& obj );
/**
* This should be called just before an object is removed.
*
* If it's a new object as of this undo state, its pre-removal value is not stored, because prior to this undo
* state, it did not exist. Now that it's been removed, it doesn't exist again, so nothing has happened.
* Instead, remove it from the list of newly created objects (which must be deleted if we undo), as we don't
* want to re-delete it if this state is undone.
*/
void on_remove( const object& obj );
/**
* Removes the last committed session,
* note... this is dangerous if there are
* active sessions... thus active sessions should
* track
*/
void pop_commit();
std::size_t size()const { return _stack.size(); }
void set_max_size(size_t new_max_size) { _max_size = new_max_size; }
size_t max_size()const { return _max_size; }
const undo_state& head()const;
private:
void undo();
void merge();
void commit();
uint32_t _active_sessions = 0;
bool _disabled = true;
std::deque<undo_state> _stack;
object_database& _db;
size_t _max_size = 256;
};