lumiera_/src/proc/control/command-registry.hpp

267 lines
9.2 KiB
C++

/*
COMMAND-REGISTRY.hpp - proc-Command object registration and storage management
Copyright (C) Lumiera.org
2009, Hermann Vosseler <Ichthyostega@web.de>
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/** @file command-registry.hpp
** Managing command definitions and the storage of individual command objects.
** The CommandRegistry is an singleton object, accessible only at the implementation level
** of control::Command (note: CommandImpl isn't tied to the registry). For the other parts
** of the command system, it provides all "get me this command object"-services. Actually,
** these can be decomposed into two distinct parts:
** - allocation of CommandImpl frames and argument holders, which is delegated
** to the TypedAllocationManager
** - maintaining an index to find pre-built command definitions (prototypes)
**
** \par Services during command lifecycle
** Each command starts out as command definition, accessed by client code through CommandDef.
** While collecting the necessary parts of such a definition, there is just an empty (pending)
** Command (smart-ptr frontend), which is already registered with the intended command-ID.
** A lookup on this ID would still fail at this point, as the \link #queryIndex search function \endlink
** treats missing and incomplete command definitions similar. When the definition is complete,
** a CommandImpl frame is allocated, configured and used to activate the Command (smart-ptr frontend).
**
** Later on, client code is assumed to re-access the command by ID. It may bind arguments, which are
** stored in the already allocated ArgumentHolder. (-->Ticket #269). As the Command frontend is a
** smart-ptr, commands may be copied, stored away and passed on. When finally the ref-count of
** a given definition goes to zero, de-allocation happens automatically. This can't happen for
** a registered command definition though, as a Command instance is stored within the index
** table, keeping the linked data alive. Thus, any registered commands will remain in memory
** until de-registered explicitly, or until application shutdown.
**
** @see Command
** @see ProcDispatcher
**
*/
#ifndef CONTROL_COMMAND_REGISTRY_H
#define CONTROL_COMMAND_REGISTRY_H
//#include "pre.hpp"
#include "lib/error.hpp"
#include "lib/singleton.hpp"
#include "lib/sync.hpp"
#include "lib/format.hpp"
#include "include/logging.h"
#include "lib/util.hpp"
#include "proc/control/command.hpp"
#include "proc/control/command-signature.hpp"
#include "proc/control/command-argument-holder.hpp"
#include "lib/typed-allocation-manager.hpp"
#include <boost/functional/hash.hpp>
#include <boost/noncopyable.hpp>
#include <tr1/unordered_map>
#include <tr1/memory>
#include <string>
#include <map>
namespace control {
using boost::hash;
using boost::noncopyable;
using std::tr1::shared_ptr;
using std::tr1::unordered_map;
using lib::TypedAllocationManager;
using util::getValue_or_default;
using util::contains;
using std::string;
using std::map;
/**
* Helper for building a std::map with
* Command* as keys. Defines the order
* by the address of the Command's
* implementation object.
*/
struct order_by_impl
{
bool
operator() (const Command *pC1, const Command *pC2) const
{
return ( pC1 && pC2 && (*pC1 < *pC2));
}
};
/**
* Registry managing command implementation objects (Singleton).
* Relies on TypedAllocationManager for pooled custom allocation (TODO: not implemented as of 9/09)
* Registered command (definitions) are accessible by command ID;
* as this mapping is bidirectional, it is also possible to find
* out the ID for a given command.
*/
class CommandRegistry
: public lib::Sync<>
, noncopyable
{
// using a hashtable to implement the index
typedef unordered_map<Symbol, Command, hash<Symbol> > CmdIndex;
typedef map< const Command*, Symbol, order_by_impl> ReverseIndex;
TypedAllocationManager allocator_;
CmdIndex index_;
ReverseIndex ridx_;
public:
static lib::Singleton<CommandRegistry> instance;
~CommandRegistry()
{
INFO (command, "Shutting down Command system...");
//////////////////////TICKET #295 : possibly remotely trigger Command mass suicide here....
ridx_.clear();
index_.clear();
}
/** register a command (Frontend) under the given ID
* @return either the new command, or an already existing
* command registered under the given ID */
Command&
track (Symbol cmdID, Command const& commandHandle)
{
Lock sync(this);
Command& indexSlot (index_[cmdID]);
if (!indexSlot)
{
indexSlot = commandHandle;
ridx_[&indexSlot] = cmdID;
}
return indexSlot;
}
/** remove the given command registration.
* @return \c true if actually removed an entry
* @note existing command instances remain valid;
* storage will be freed at zero use-count */
bool
remove (Symbol cmdID)
{
Lock sync(this);
bool actually_remove = contains (index_,cmdID);
if (actually_remove)
{
ridx_.erase(& index_[cmdID]);
index_.erase(cmdID);
}
ENSURE (!contains (index_,cmdID));
return actually_remove;
}
/** query the command index by ID
* @return the registered command,
* or an "invalid" token */
Command
queryIndex (Symbol cmdID)
{
Lock sync(this);
return getValue_or_default (index_, cmdID, Command() );
} //if not found
/** search the command index for a definition
* @param cmdInstance using the definition to look up
* @return the ID used to register this definition
* or \c NULL in case of an "anonymous" command */
const char*
findDefinition (Command const& cmdInstance) const
{
Lock sync(this);
return getValue_or_default (ridx_, &cmdInstance, 0 );
} //used as Key
size_t
index_size() const
{
return index_.size();
}
size_t
instance_count() const
{
return allocator_.numSlots<CommandImpl>();
}
/** set up a new command implementation frame
* @return shared-ptr owning a newly created CommandImpl, allocated
* through the registry and wired internally to invoke
* TypedAllocationManager#destroyElement for cleanup.
*/
template< typename SIG_OPER ///< signature of the command operation
, typename SIG_CAPT ///< signature for capturing undo state
, typename SIG_UNDO ///< signature to undo the command
>
shared_ptr<CommandImpl>
newCommandImpl (function<SIG_OPER>& operFunctor
,function<SIG_CAPT>& captFunctor
,function<SIG_UNDO>& undoFunctor)
{
// derive the storage type necessary
// to hold the command arguments and UNDO memento
typedef typename UndoSignature<SIG_CAPT>::Memento Mem;
typedef ArgumentHolder<SIG_OPER,Mem> Arguments;
shared_ptr<Arguments> pArg (allocator_.create<Arguments>());
return allocator_.create<CommandImpl> (pArg, operFunctor,captFunctor,undoFunctor);
}
/** create an allocation for holding a clone of the given CommandImpl data.
* This is a tricky operation, as the CommandImpl after construction erases the
* specific type information pertaining the ArgumentHolder. But this specific
* type information is vital for determining the exact allocation size for
* the clone ArgumentHolder. The only solution is to delegate the cloning
* of the arguments down into the ArgumentHolder, passing a reference
* to the memory manager for allocating the clone.
*/
shared_ptr<CommandImpl>
createCloneImpl (CommandImpl const& refObject)
{
return allocator_.create<CommandImpl> (refObject, allocator_);
}
};
} // namespace control
#endif