Devin J. Pohly
feb919f0bf
5f7001e: "Added a new branch"01456ed: "Fixed a lot of memory leaks"dac4493: "Fixed all remaining memory leaks that I could figure out"0792db7: "Removed the smnew macro and the call to _CrtSetDbgFlag()" Some of these caused destructor-time problems due to static initialization order fiasco and related issues. Notably, the program would no longer exit on OSX and had to be killed. There were probably legitimate fixes in here, but since these are monolithic commits it's too much work to extract them now. Let's reapply them individually and in the forward direction.
77 lines
2.7 KiB
C++
77 lines
2.7 KiB
C++
/* SubscriptionManager - Object that accepts subscriptions. */
|
|
|
|
#ifndef SubscriptionManager_H
|
|
#define SubscriptionManager_H
|
|
|
|
#include <set>
|
|
|
|
// Since this class has only POD types and no constructor, there's no
|
|
// initialize order problem.
|
|
template<class T>
|
|
class SubscriptionManager
|
|
{
|
|
public:
|
|
// TRICKY: If we make this a global instead of a global pointer,
|
|
// then we'd have to be careful that the static constructors of all
|
|
// subscribers are called before the collection constructor. It's
|
|
// impossible to enfore that in C++. Instead, we'll allocate the
|
|
// collection ourself on first use. SubscriptionHandler itself is
|
|
// a POD type, so a static SubscriptionHandler will always have
|
|
// m_pSubscribers == NULL (before any static constructors are called).
|
|
set<T*>* m_pSubscribers;
|
|
|
|
// Use this to access m_pSubscribers, so you don't have to worry about
|
|
// it being NULL.
|
|
set<T*> &Get()
|
|
{
|
|
if( m_pSubscribers == NULL )
|
|
m_pSubscribers = new set<T*>;
|
|
return *m_pSubscribers;
|
|
}
|
|
|
|
void Subscribe( T* p )
|
|
{
|
|
if( m_pSubscribers == NULL )
|
|
m_pSubscribers = new set<T*>;
|
|
#ifdef DEBUG
|
|
typename set<T*>::iterator iter = m_pSubscribers->find( p );
|
|
ASSERT_M( iter == m_pSubscribers->end(), "already subscribed" );
|
|
#endif
|
|
m_pSubscribers->insert( p );
|
|
}
|
|
|
|
void Unsubscribe( T* p )
|
|
{
|
|
typename set<T*>::iterator iter = m_pSubscribers->find( p );
|
|
ASSERT( iter != m_pSubscribers->end() );
|
|
m_pSubscribers->erase( iter );
|
|
}
|
|
};
|
|
|
|
#endif
|
|
|
|
/*
|
|
* (c) 2004-2005 Chris Danford
|
|
* All rights reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, and/or sell copies of the Software, and to permit persons to
|
|
* whom the Software is furnished to do so, provided that the above
|
|
* copyright notice(s) and this permission notice appear in all copies of
|
|
* the Software and that both the above copyright notice(s) and this
|
|
* permission notice appear in supporting documentation.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
|
|
* THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS
|
|
* INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT
|
|
* OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
|
|
* OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
|
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
* PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|