Click here to Skip to main content
15,891,184 members
Articles / Desktop Programming / Win32

Windows Live Messenger Plug-in Development Bible

Rate me:
Please Sign up or sign in to vote.
4.98/5 (56 votes)
3 Nov 2008GPL356 min read 192.6K   2.6K   178  
An article explaining several Win32 reverse engineering techniques applied to Live Messenger research and plug-in development.
/*
 * yasper - A non-intrusive reference counted pointer. 
 *	    Version: 1.04
 *			  
 *  Many ideas borrowed from Yonat Sharon and 
 *  Andrei Alexandrescu.
 *
 * (zlib license)
 * ----------------------------------------------------------------------------------	
 * Copyright (C) 2005-2007 Alex Rubinsteyn
 *
 * This software is provided 'as-is', without any express or implied
 * warranty.  In no event will the authors be held liable for any damages
 * arising from the use of this software.
 *
 * Permission is granted to anyone to use this software for any purpose,
 * including commercial applications, and to alter it and redistribute it
 * freely, subject to the following restrictions:
 *
 * 1. The origin of this software must not be misrepresented; you must not
 *    claim that you wrote the original software. If you use this software
 *    in a product, an acknowledgment in the product documentation would be
 *    appreciated but is not required.
 * 2. Altered source versions must be plainly marked as such, and must not be
 *    misrepresented as being the original software.
 * 3. This notice may not be removed or altered from any source distribution.
 *
 * -----------------------------------------------------------------------------------
 * 
 * Send all questions, comments and bug reports to:
 * Alex Rubinsteyn (alex.rubinsteyn {at-nospam} gmail {dot} com)
 */


#ifndef yasper_ptr_h
#define yasper_ptr_h

#include <exception>

namespace yasper
{

struct NullPointerException : public std::exception
{
    NullPointerException() throw() {}
    ~NullPointerException() throw() {}
	
    const char* what() const throw()
    {
        return "[Yasper Exception] Attempted to dereference null pointer";
    }
};

struct Counter 
{
	Counter(unsigned c = 1) : count(c) {}
	unsigned count; 
};

template <typename X> 
class ptr
{

public:
    typedef X element_type;

	/* 
		ptr needs to be its own friend so ptr< X > and ptr< Y > can access
		each other's private data members 
	*/ 
	template <class Y> friend class ptr; 
	/* 
		default constructor
			- don't create Counter
	*/
	ptr() : rawPtr(0), counter(0) { }
	
	/*
		Construct from a raw pointer 
	*/
	ptr(X* raw, Counter* c = 0) : rawPtr(0), counter(0)
	{
		if (raw)
		{
			rawPtr = raw; 
			if (c) acquire(c);
			else counter = new Counter;
		}
	}
	
	template <typename Y>
 	explicit ptr(Y* raw, Counter* c = 0) : rawPtr(0), counter(0)
	{
		if (raw)
		{
			rawPtr = static_cast<X*>( raw );
			if (c) acquire(c);
			else counter = new Counter; 
		}
	}
	
	
	/*
		Copy constructor 
	*/
	ptr(const ptr< X >& otherPtr)
	{
		acquire( otherPtr.counter );
		rawPtr = otherPtr.rawPtr;
	}
	
	template <typename Y>
	explicit ptr(const ptr< Y >& otherPtr) : rawPtr(0), counter(0)
	{
		acquire(otherPtr.counter);
		rawPtr = static_cast<X*>( otherPtr.GetRawPointer());
	}
	

	/* 
		Destructor 
	*/ 
	~ptr()
	{
		release();
	}
	
/*
	Assignment to another ptr 
*/

ptr& operator=(const ptr< X >& otherPtr)
{
	if (this != &otherPtr)
	{
		release();
		acquire(otherPtr.counter); 
		rawPtr = otherPtr.rawPtr; 
	}
	return *this; 
}

template <typename Y>
ptr& operator=(const ptr< Y >& otherPtr)
{
	if ( this != (ptr< X >*) &otherPtr )
	{
		release();
		acquire(otherPtr.counter);
		rawPtr = static_cast<X*> (otherPtr.GetRawPointer());
	}
	return *this;
}

/*
	Assignment to raw pointers is really dangerous business.
	If the raw pointer is also being used elsewhere,
	we might prematurely delete it, causing much pain.
	Use sparingly/with caution.
*/

ptr& operator=(X* raw)
{
	if (raw != rawPtr)
	{
		release();
	}
	if (raw)
	{
		counter = new Counter; 
		rawPtr = raw; 
	}
	return *this;
}

template <typename Y>
ptr& operator=(Y* raw)
{
	if (raw != rawPtr)
	{
		release();
	}
	if (raw)
	{
		counter = new Counter; 
		rawPtr = static_cast<X*>(raw);
	}
	return *this;
}

/**
NOTICE: Commented by Camus. Not necesary and dangerous feature...

// 
//	assignment to long to allow ptr< X > = NULL, 
//	also allows raw pointer assignment by conversion. 
//	Raw pointer assignment is really dangerous!
//	If the raw pointer is being used elsewhere, 
//	it will get deleted prematurely. 

	ptr& operator=(long num)
	{
		if (num == 0)  //pointer set to null
		{
			release(); 
		}

		else //assign raw pointer by conversion
		{
			release();
			counter = new Counter; 
			rawPtr = reinterpret_cast<X*>(num);
		}	

		return *this; 
	} 

**/

/*
	Member Access
*/
	X* operator->() const 
	{
		return GetRawPointer(); 
	}


/*
	Dereference the pointer
*/
	X& operator* () const 
	{
		return *GetRawPointer(); 
	}


/*
	Conversion/casting operators
*/


	operator bool() const
	{
		return IsValid();
	}

	
	/*
	   implicit casts to base types of the
	   the pointer we're storing 
	*/
	
	template <typename Y>
	operator Y*() const
	{
		return static_cast<Y*>(rawPtr);  
	}

	template <typename Y>
	operator const Y*() const
	{
		return static_cast<const Y*>(rawPtr);
	}

	template <typename Y>
	operator ptr<Y>()
	{
		//new ptr must also take our counter or else the reference counts 
		//will go out of sync
		return ptr<Y>(rawPtr, counter);
	}


/*
	Provide access to the raw pointer 
*/

	X* GetRawPointer() const         
	{
		if (rawPtr == 0) throw new NullPointerException;
		return rawPtr;
	}

/* 
	Is there only one reference on the counter?
*/
	bool IsUnique() const
	{
		if (counter && counter->count == 1) return true; 
		return false; 
	}
	
	bool IsValid() const
	{
		if (counter && rawPtr) return true;
		return false; 
	}

	unsigned GetCount() const
	{
		if (counter) return counter->count;
		return 0;
	}

private:
	X* rawPtr;

	Counter* counter;

	// increment the count
	void acquire(Counter* c) 
	{ 
 		counter = c;
		if (c)
		{
			(c->count)++;
		}
	}

	// decrement the count, delete if it is 0
	void release()
	{ 
        if (counter) 
		{			
			(counter->count)--; 	

			if (counter->count == 0) 
			{
				delete counter;			
				delete rawPtr;
			}
		}
		counter = 0;
		rawPtr = 0; 

	}
};


template <typename X, typename Y>
bool operator==(const ptr< X >& lptr, const ptr< Y >& rptr) 
{
	return lptr.GetRawPointer() == rptr.GetRawPointer(); 
}

template <typename X, typename Y>
bool operator==(const ptr< X >& lptr, Y* raw) 
{
	return lptr.GetRawPointer() == raw ; 
}

/**
NOTICE: Commented by Camus. Not necesary and ambiguous feature...

template <typename X>
bool operator==(const ptr< X >& lptr, long num)
{
	if (num == 0 && !lptr.IsValid())  //both pointer and address are null
	{
		return true; 
	}

	else //convert num to a pointer, compare addresses
	{
		return lptr == reinterpret_cast<X*>(num);
	}
	 
}
**/

template <typename X, typename Y>
bool operator!=(const ptr< X >& lptr, const ptr< Y >& rptr) 
{
	return ( !operator==(lptr, rptr) );
}

template <typename X, typename Y>
bool operator!=(const ptr< X >& lptr, Y* raw) 
{
	return ( !operator==(lptr, raw) );
}

/**
NOTICE: Commented by Camus. Not necesary and ambiguous feature...

template <typename X>
bool operator!=(const ptr< X >& lptr, long num)
{
	return (!operator==(lptr, num) ); 
}
**/

template <typename X, typename Y>
bool operator&&(const ptr< X >& lptr, const ptr< Y >& rptr)
{
	return lptr.IsValid() &&  rptr.IsValid();
}

template <typename X>
bool operator&&(const ptr< X >& lptr, bool rval)
{
	return lptr.IsValid() && rval;
}

template <typename X>
bool operator&&(bool lval, const ptr< X >& rptr)
{
	return lval &&  rptr.IsValid();
}

template <typename X, typename Y>
bool operator||(const ptr< X >& lptr, const ptr< Y >& rptr)
{
	return lptr.IsValid() || rptr.IsValid();
}

template <typename X>
bool operator||(const ptr< X >& lptr, bool rval)
{
	return lptr.IsValid() || rval;
}

template <typename X>
bool operator||(bool lval, const ptr< X >& rptr)
{
	return lval || rptr.IsValid(); 
}

template <typename X>
bool operator!(const ptr< X >& p)
{
	return (!p.IsValid());
}


/* less than comparisons for storage in containers */
template <typename X, typename Y>
bool operator< (const ptr< X >& lptr, const ptr < Y >& rptr)
{
	return lptr.GetRawPointer() < rptr.GetRawPointer();
}

template <typename X, typename Y>
bool operator< (const ptr< X >& lptr, Y* raw)
{
	return lptr.GetRawPointer() < raw;
}

template <typename X, typename Y>
bool operator< (X* raw, const ptr< Y >& rptr)
{
	return raw < rptr.GetRawPointer();
}

} //close yasper namespace
#endif

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The GNU General Public License (GPLv3)


Written By
Software Developer
Argentina Argentina
C/C++ developer interested on operating systems, reverse engineering, general system programming, CPU architecture, etc.
Now I'm working creating plugins Outlook Plugin Development.

Comments and Discussions