Files
statechart/test/DeferralTest.cpp

132 lines
3.9 KiB
C++

//////////////////////////////////////////////////////////////////////////////
// (c) Copyright Andreas Huber Doenni 2004-2005
// Distributed under the Boost Software License, Version 1.0. (See accompany-
// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//////////////////////////////////////////////////////////////////////////////
#include <boost/statechart/state_machine.hpp>
#include <boost/statechart/event.hpp>
#include <boost/statechart/simple_state.hpp>
#include <boost/statechart/transition.hpp>
#include <boost/statechart/deferral.hpp>
#include <boost/statechart/custom_reaction.hpp>
#include <boost/mpl/list.hpp>
#include <boost/intrusive_ptr.hpp>
#include <boost/test/test_tools.hpp>
namespace sc = boost::statechart;
namespace mpl = boost::mpl;
template< class T >
boost::intrusive_ptr< T > MakeIntrusive( T * pT )
{
return boost::intrusive_ptr< T >( pT );
}
struct EvLeafDeferred : sc::event< EvLeafDeferred > {};
struct EvNodeDeferred : sc::event< EvNodeDeferred > {};
struct EvSwitch : sc::event< EvSwitch > {};
struct EvDestroy : sc::event< EvDestroy > {};
struct Active;
struct DeferralTest : sc::state_machine< DeferralTest, Active >
{
//////////////////////////////////////////////////////////////////////////
DeferralTest() : processedCount_( 0 ) {}
void IncrementProcessedCount()
{
++processedCount_;
}
unsigned int ProcessedCount() const
{
return processedCount_;
}
private:
//////////////////////////////////////////////////////////////////////////
unsigned int processedCount_;
};
struct Dead : sc::simple_state< Dead, DeferralTest >
{
typedef sc::custom_reaction< EvNodeDeferred > reactions;
sc::result react( const EvNodeDeferred & )
{
outermost_context().IncrementProcessedCount();
return discard_event();
}
};
struct Idle;
struct Active : sc::simple_state< Active, DeferralTest, Idle >
{
typedef mpl::list<
sc::custom_reaction< EvLeafDeferred >,
sc::deferral< EvNodeDeferred >,
sc::transition< EvDestroy, Dead >
> reactions;
sc::result react( const EvLeafDeferred & )
{
outermost_context().IncrementProcessedCount();
return discard_event();
}
};
struct Running : sc::simple_state< Running, Active >
{
typedef sc::transition< EvSwitch, Idle > reactions;
};
struct Idle : sc::simple_state< Idle, Active >
{
typedef mpl::list<
sc::transition< EvSwitch, Running >,
sc::deferral< EvLeafDeferred >
> reactions;
};
int test_main( int, char* [] )
{
DeferralTest machine;
machine.initiate();
machine.process_event( *MakeIntrusive( new EvSwitch() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 0 );
machine.process_event( *MakeIntrusive( new EvSwitch() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 0 );
machine.process_event( *MakeIntrusive( new EvLeafDeferred() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 0 );
machine.process_event( *MakeIntrusive( new EvSwitch() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 1 );
machine.process_event( *MakeIntrusive( new EvSwitch() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 1 );
machine.process_event( *MakeIntrusive( new EvLeafDeferred() ) );
machine.process_event( *MakeIntrusive( new EvLeafDeferred() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 1 );
machine.process_event( *MakeIntrusive( new EvSwitch() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 3 );
machine.process_event( *MakeIntrusive( new EvSwitch() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 3 );
machine.process_event( *MakeIntrusive( new EvNodeDeferred() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 3 );
machine.process_event( *MakeIntrusive( new EvSwitch() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 3 );
machine.process_event( *MakeIntrusive( new EvNodeDeferred() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 3 );
machine.process_event( *MakeIntrusive( new EvDestroy() ) );
BOOST_REQUIRE( machine.ProcessedCount() == 5 );
return 0;
}