CPPGPGPU Library - Reference (Doxygen)

---

Main Page | General Use | Reference | Examples Info | Get/Download CPPGPGPU | SF.net Page

---

Node.cpp

Go to the documentation of this file.

#include "Node.h"

#ifdef _WIN32
#include <windows.h>
#else
#include <pthread.h>
#endif

#undef PostMessage

Node::Node()
{
    This = NULL;
}

Node::Node( NodeObject * nToInit )
{
    This = NULL;
    Hook( nToInit );
}

Node::Node( const Node & nToCopy )
{
    This = NULL;
    Hook( nToCopy.This );
}

Node::~Node()
{
    Unhook( This );
}

Node & Node::operator = ( const Node & rhs )
{
    NodeObject * Tmp = This;
    Hook( rhs.This );
    Unhook( Tmp );
    return *this;
}

Node & Node::operator = ( NodeObject * rhs )
{
    NodeObject * Tmp = This;
    Hook( rhs );
    Unhook( Tmp );
    return *this;
}

void Node::Hook( NodeObject * n )
{
    if( n )
        n->Lock();
    This = n;
    if( This ) This->IncCount();
    if( This ) This->Unlock();
}

void Node::Unhook( NodeObject * n )
{
    if( !n )
        return;
    n->Lock();
    n->DecCount();
    if( n->GetCount() <= 0 )
    {
        n->Unlock();
        delete n;
    }
    else
        n->Unlock();
    return;
}

NodeObject::NodeObject( const string & sName )
{
#ifndef NOSYNCHRONIZATION
#if defined( _WIN32 )
    SECURITY_ATTRIBUTES p;
    p.nLength = sizeof( SECURITY_ATTRIBUTES );
    p.bInheritHandle = true;
    p.lpSecurityDescriptor = NULL;
    m_vMutex = CreateMutex( &p, true, sName.c_str() );
#else
    m_vMutex = malloc( sizeof( pthread_mutex_t ) );
    pthread_mutexattr_t attr;
    pthread_mutexattr_init( &attr );
    pthread_mutexattr_settype( &attr, PTHREAD_MUTEX_RECURSIVE );
    pthread_mutex_init( (pthread_mutex_t*)m_vMutex, &attr );
#endif
#endif
    m_sName = sName;
    m_iCount = 0;   //Careful: This must be incremented upon a node assignment.
    m_bDestroyOnUpdate = false;
    NODEMAN->Add( this );
}

NodeObject::~NodeObject()
{
    NODEMAN->Drop( this );
#ifndef NOSYNCHRONIZATION
#if defined( _WIN32 )
    CloseHandle( m_vMutex );
#else
    pthread_mutex_destroy( (pthread_mutex_t*)m_vMutex );
    free( m_vMutex );
#endif
#endif
}

void NodeObject::SetName( const string & sName )
{
    NODEMAN->Drop( this );
    m_sName = sName;
    NODEMAN->Add( this );
}

Node NodeObject::AttachChild( Node n )
{
    m_vnChildren.push_back( n );
    n->AttachParent( Node( this ) );
    return Node( this );
}

void NodeObject::DetachChild( Node n )
{
    for( unsigned i = 0; i < m_vnChildren.size(); ++i )
        if( m_vnChildren[i] == n )
        {
            m_vnChildren[i]->DetachParent( this );
            m_vnChildren.erase( m_vnChildren.begin() + i );
            --i;
        }
}

void NodeObject::AttachParent( NodeObject * n )
{
    m_vnParents.push_back( n );
}

void NodeObject::Init()
{
}

void NodeObject::Disestablish()
{
    
}

void NodeObject::Render()
{
    for( unsigned i = 0; i < m_vnChildren.size(); ++i )
        m_vnChildren[i]->Render();
}

void NodeObject::Update( const float fDtime )
{
    for( unsigned i = 0; i < m_vnChildren.size(); ++i )
        m_vnChildren[i]->Update( fDtime );
}

void NodeObject::Message( int iMessageID, const string & sMessageName, const string & sMessagePayload )
{
    printf( "Message Received: %d %s %s ME:\"%s\"\n", iMessageID, sMessageName.c_str(), sMessagePayload.c_str(), GetName().c_str() );
}

void NodeObject::DetachParent( NodeObject * n )
{
    for( unsigned i = 0; i < m_vnParents.size(); ++i )
        if( m_vnParents[i] == n )
        {
            m_vnParents.erase( m_vnParents.begin() + i );
            --i;
        }
}


#ifndef NOSYNCHRONIZATION
void NodeObject::Lock()
{
#if defined( _WIN32 )
    int r = WaitForSingleObject( m_vMutex, 100000 );  //100 seconds should be long enough.
#else
    pthread_mutex_lock( (pthread_mutex_t*)m_vMutex );
#endif
}

void NodeObject::Unlock()
{
#if defined( _WIN32 )
    ReleaseMutex( m_vMutex );
#else
    pthread_mutex_unlock( (pthread_mutex_t*)m_vMutex );
#endif
}

#else
void NodeObject::Lock() { }
void NodeObject::Unlock() { }
#endif

REGISTER_CLASS( NodeObject );

NodeManager * NODEMAN = NULL;

NodeManager * NodeManager::Instance()
{
    if( !NODEMAN )
    {
        NODEMAN = new NodeManager;
        NODEMAN->m_fCurrentTime = 0.0f;
    }
    return NODEMAN;
}

void NodeManager::RegisterType( const string & sClass, ProducerFunct t )
{
    m_mToMake[sClass] = t;
}

Node NodeManager::Spawn( const string & sClass, const string & sName )
{
    NodeObject * n = GetInstanceExp( sName );
    if( n )
        return Node( n );
    else
        return SpawnExplicit( sClass, sName );
}

Node NodeManager::SpawnExplicit( const string & sClass, const string & sName )
{
    map< string, ProducerFunct >::iterator i( m_mToMake.find( sClass ) );
    if( i != m_mToMake.end() )
        return (i->second)( sName );
    else
        return Node( NULL );
}

void NodeManager::Add( NodeObject * nObject )
{
    if( nObject )
        m_mInstances[nObject->GetName()] = nObject;
}

void NodeManager::Drop( NodeObject * nObject )
{
    if( nObject )
    {
        map< string, NodeObject * >::iterator i = m_mInstances.find( nObject->GetName() );
        if( i != m_mInstances.end() )
            m_mInstances.erase( i );
    }
}

void NodeManager::RegisterForMessage( const string & sMessage, int iMessageID, Node nToRegister )
{
    m_mMessageMatches[sMessage][nToRegister] = iMessageID;
}

void NodeManager::UnregisterForMessage( const string & sMessage, int iMessageID, Node nToRegister )
{
    map< Node, int > & j = m_mMessageMatches[sMessage];
    map< Node, int >::iterator i = j.find( nToRegister );
    if( i == j.end() )
        return;
    else
        j.erase( i );
}

void NodeManager::BroadcastMessage( const string & sMessage, const string & sPayload, Node nTarget )
{
    if( nTarget )
        nTarget->Message( -1, sMessage, sPayload );
    else
    {
        map< string, map< Node, int > >::iterator i = m_mMessageMatches.find( sMessage );
        if( i == m_mMessageMatches.end() )
            return;

        map< Node, int >::iterator j = (i->second).begin();
        for( ; j != (i->second).end() ; ++j )
            ((NodeObject*)(j->first).Get())->Message( j->second, sMessage, sPayload );
    }
}

void NodeManager::PostMessage( const string & sMessage, const string & sPayload, Node nTarget, const float fTimeInFuture )
{
    if( fTimeInFuture < 0.00001 ) //For dispatchment immediately
    {
        m_dImmediateMessages.push_back( StringPair(sMessage, sPayload, nTarget) );
    } else
    {
        int i;
        for( i = m_vFutureMessages.size() - 1; i >= 0; --i )
            if( m_vFutureMessages[i].fFuture - m_fCurrentTime > fTimeInFuture )
            {
                m_vFutureMessages.insert( m_vFutureMessages.begin() + i + 1, StringPairFloat( sMessage, sPayload, nTarget, fTimeInFuture + m_fCurrentTime ) );
                break;
            }
        //Looks like we're the biggest element in the pond.
        if( i < 0 )
            m_vFutureMessages.insert( m_vFutureMessages.begin(), StringPairFloat( sMessage, sPayload, nTarget, fTimeInFuture + m_fCurrentTime ) );
    }
}

void NodeManager::Update( const float fDtime )
{
    m_fCurrentTime += fDtime;
    for( unsigned i = 0; i < m_dImmediateMessages.size(); i++ )
    {
        StringPair * f = &m_dImmediateMessages[i];
        BroadcastMessage( f->sP1, f->sP2, f->nTarget );
    }
    m_dImmediateMessages.clear();

    for( int i = m_vFutureMessages.size() - 1; i >= 0; --i )
    {
        if( m_vFutureMessages[i].fFuture > m_fCurrentTime )
            break;
        StringPairFloat * f = &m_vFutureMessages[i];
        BroadcastMessage( f->sP1, f->sP2, f->nTarget );
        m_vFutureMessages.resize( m_vFutureMessages.size() - 1 );
    }
}

/*
Copyright (c) 2007 Charles Lohr

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, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.

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. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/

---

© 2005-2007 Charles Lohr, Joshua Allen, David Chapman, Andrew Lohr. All material including documentation under the MIT/X11 license.