| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | /**
 | 
					
						
							|  |  |  |  * $Id$ | 
					
						
							| 
									
										
										
										
											2008-04-16 22:40:48 +00:00
										 |  |  |  * ***** BEGIN GPL LICENSE BLOCK ***** | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  |  * | 
					
						
							|  |  |  |  * 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 | 
					
						
							| 
									
										
										
										
											2008-04-16 22:40:48 +00:00
										 |  |  |  * of the License, or (at your option) any later version. | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  |  * | 
					
						
							|  |  |  |  * 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., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA. | 
					
						
							|  |  |  |  * | 
					
						
							|  |  |  |  * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV. | 
					
						
							|  |  |  |  * All rights reserved. | 
					
						
							|  |  |  |  * | 
					
						
							|  |  |  |  * The Original Code is: all of this file. | 
					
						
							|  |  |  |  * | 
					
						
							|  |  |  |  * Contributor(s): none yet. | 
					
						
							|  |  |  |  * | 
					
						
							| 
									
										
										
										
											2008-04-16 22:40:48 +00:00
										 |  |  |  * ***** END GPL LICENSE BLOCK ***** | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  |  */ | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | #include "SG_Node.h"
 | 
					
						
							|  |  |  | #include "SG_ParentRelation.h"
 | 
					
						
							|  |  |  | #include <algorithm>
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2002-11-25 15:29:57 +00:00
										 |  |  | #ifdef HAVE_CONFIG_H
 | 
					
						
							|  |  |  | #include <config.h>
 | 
					
						
							|  |  |  | #endif
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | using namespace std; | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | SG_Node::SG_Node( | 
					
						
							|  |  |  | 	void* clientobj, | 
					
						
							|  |  |  | 	void* clientinfo, | 
					
						
							| 
									
										
										
										
											2009-05-03 22:29:00 +00:00
										 |  |  | 	SG_Callbacks& callbacks | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 
 | 
					
						
							|  |  |  | ) | 
					
						
							|  |  |  | 	: SG_Spatial(clientobj,clientinfo,callbacks), | 
					
						
							|  |  |  | 	m_SGparent(NULL) | 
					
						
							|  |  |  | { | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | SG_Node::SG_Node( | 
					
						
							|  |  |  | 	const SG_Node & other | 
					
						
							|  |  |  | ) : | 
					
						
							|  |  |  | 	SG_Spatial(other), | 
					
						
							| 
									
										
										
										
											2004-03-22 22:02:18 +00:00
										 |  |  | 	m_children(other.m_children), | 
					
						
							|  |  |  | 	m_SGparent(other.m_SGparent) | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | { | 
					
						
							|  |  |  | 	// nothing to do
 | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | SG_Node::~SG_Node() | 
					
						
							|  |  |  | { | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | SG_Node* SG_Node::GetSGReplica() | 
					
						
							|  |  |  | { | 
					
						
							|  |  |  | 	SG_Node* replica = new SG_Node(*this); | 
					
						
							|  |  |  | 	if (replica == NULL) return NULL; | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2008-07-18 19:56:56 +00:00
										 |  |  | 	ProcessSGReplica(&replica); | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 	 | 
					
						
							|  |  |  | 	return replica; | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	void  | 
					
						
							|  |  |  | SG_Node:: | 
					
						
							|  |  |  | ProcessSGReplica( | 
					
						
							| 
									
										
										
										
											2008-07-18 19:56:56 +00:00
										 |  |  | 	SG_Node** replica | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | ){ | 
					
						
							|  |  |  | 	// Apply the replication call back function.
 | 
					
						
							| 
									
										
										
										
											2008-07-18 19:56:56 +00:00
										 |  |  | 	if (!ActivateReplicationCallback(*replica))  | 
					
						
							|  |  |  | 	{ | 
					
						
							|  |  |  | 		delete (*replica); | 
					
						
							|  |  |  | 		*replica = NULL; | 
					
						
							|  |  |  | 		return; | 
					
						
							|  |  |  | 	} | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 
 | 
					
						
							|  |  |  | 	// clear the replica node of it's parent.
 | 
					
						
							| 
									
										
										
										
											2008-07-18 19:56:56 +00:00
										 |  |  | 	static_cast<SG_Node*>(*replica)->m_SGparent = NULL; | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 
 | 
					
						
							|  |  |  | 	if (m_children.begin() != m_children.end()) | 
					
						
							|  |  |  | 	{ | 
					
						
							|  |  |  | 		// if this node has children, the replica has too, so clear and clone children
 | 
					
						
							| 
									
										
										
										
											2008-07-18 19:56:56 +00:00
										 |  |  | 		(*replica)->ClearSGChildren(); | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 	 | 
					
						
							|  |  |  | 		NodeList::iterator childit; | 
					
						
							|  |  |  | 		for (childit = m_children.begin();childit!=m_children.end();++childit) | 
					
						
							|  |  |  | 		{ | 
					
						
							| 
									
										
										
										
											2008-07-18 19:56:56 +00:00
										 |  |  | 			SG_Node* childnode = (*childit)->GetSGReplica(); | 
					
						
							|  |  |  | 			if (childnode) | 
					
						
							|  |  |  | 				(*replica)->AddChild(childnode); | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 		} | 
					
						
							|  |  |  | 	} | 
					
						
							| 
									
										
										
										
											2008-07-18 19:56:56 +00:00
										 |  |  | 	// Nodes without children and without client object are
 | 
					
						
							|  |  |  | 	// not worth to keep, they will just take up CPU
 | 
					
						
							|  |  |  | 	// This can happen in partial replication of hierarchy
 | 
					
						
							|  |  |  | 	// during group duplication.
 | 
					
						
							|  |  |  | 	if ((*replica)->m_children.empty() &&  | 
					
						
							|  |  |  | 		(*replica)->GetSGClientObject() == NULL) | 
					
						
							|  |  |  | 	{ | 
					
						
							|  |  |  | 		delete (*replica); | 
					
						
							|  |  |  | 		*replica = NULL; | 
					
						
							|  |  |  | 	} | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	void  | 
					
						
							|  |  |  | SG_Node:: | 
					
						
							|  |  |  | Destruct() | 
					
						
							|  |  |  | { | 
					
						
							|  |  |  | 	// Not entirely sure what Destruct() expects to happen.
 | 
					
						
							|  |  |  | 	// I think it probably means just to call the DestructionCallback
 | 
					
						
							|  |  |  | 	// in the right order on all the children - rather than free any memory
 | 
					
						
							|  |  |  | 	 | 
					
						
							|  |  |  | 	// We'll delete m_parent_relation now anyway.
 | 
					
						
							|  |  |  | 	 | 
					
						
							|  |  |  | 	delete(m_parent_relation); | 
					
						
							|  |  |  | 	m_parent_relation = NULL;		 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |  	if (m_children.begin() != m_children.end()) | 
					
						
							|  |  |  | 	{ | 
					
						
							|  |  |  | 		NodeList::iterator childit; | 
					
						
							|  |  |  | 		for (childit = m_children.begin();childit!=m_children.end();++childit) | 
					
						
							|  |  |  | 		{ | 
					
						
							|  |  |  | 			// call the SG_Node destruct method on each of our children }-)
 | 
					
						
							|  |  |  | 			(*childit)->Destruct(); | 
					
						
							|  |  |  | 		} | 
					
						
							|  |  |  | 	} | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	ActivateDestructionCallback(); | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | const  | 
					
						
							|  |  |  | 	SG_Node*	 | 
					
						
							|  |  |  | SG_Node:: | 
					
						
							|  |  |  | GetRootSGParent( | 
					
						
							|  |  |  | ) const { | 
					
						
							|  |  |  | 	return (m_SGparent ? (const SG_Node*) m_SGparent->GetRootSGParent() : (const SG_Node*) this); | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	void  | 
					
						
							|  |  |  | SG_Node:: | 
					
						
							|  |  |  | DisconnectFromParent( | 
					
						
							|  |  |  | ){ | 
					
						
							|  |  |  | 	if (m_SGparent) | 
					
						
							|  |  |  | 	{ | 
					
						
							|  |  |  | 		m_SGparent->RemoveChild(this); | 
					
						
							|  |  |  | 		m_SGparent = NULL; | 
					
						
							|  |  |  | 	} | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | void SG_Node::AddChild(SG_Node* child) | 
					
						
							|  |  |  | { | 
					
						
							|  |  |  | 	m_children.push_back(child); | 
					
						
							|  |  |  | 	child->SetSGParent(this); // this way ?
 | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | void SG_Node::RemoveChild(SG_Node* child) | 
					
						
							|  |  |  | { | 
					
						
							|  |  |  | 	NodeList::iterator childfound = find(m_children.begin(),m_children.end(),child); | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	if (childfound != m_children.end()) | 
					
						
							|  |  |  | 	{ | 
					
						
							|  |  |  | 		m_children.erase(childfound); | 
					
						
							|  |  |  | 	} | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2009-04-07 22:14:06 +00:00
										 |  |  | void SG_Node::UpdateWorldData(double time, bool parentUpdated) | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | { | 
					
						
							| 
									
										
										
										
											2006-05-22 21:03:43 +00:00
										 |  |  | 	//if (!GetSGParent())
 | 
					
						
							|  |  |  | 	//	return;
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2009-04-07 22:14:06 +00:00
										 |  |  | 	if (UpdateSpatialData(GetSGParent(),time,parentUpdated)) | 
					
						
							|  |  |  | 		// to update the 
 | 
					
						
							| 
									
										
										
										
											2004-05-26 12:06:41 +00:00
										 |  |  | 		ActivateUpdateTransformCallback(); | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2009-05-03 22:29:00 +00:00
										 |  |  | 	// The node is updated, remove it from the update list
 | 
					
						
							|  |  |  | 	Delink(); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 	// update children's worlddata
 | 
					
						
							|  |  |  | 	for (NodeList::iterator it = m_children.begin();it!=m_children.end();++it) | 
					
						
							|  |  |  | 	{ | 
					
						
							| 
									
										
										
										
											2009-04-07 22:14:06 +00:00
										 |  |  | 		(*it)->UpdateWorldData(time, parentUpdated); | 
					
						
							| 
									
										
										
										
											2002-10-12 11:37:38 +00:00
										 |  |  | 	} | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | void SG_Node::SetSimulatedTime(double time,bool recurse) | 
					
						
							|  |  |  | { | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	// update the controllers of this node.
 | 
					
						
							|  |  |  | 	SetControllerTime(time); | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	// update children's simulate time.
 | 
					
						
							|  |  |  | 	if (recurse) | 
					
						
							|  |  |  | 	{ | 
					
						
							|  |  |  | 		for (NodeList::iterator it = m_children.begin();it!=m_children.end();++it) | 
					
						
							|  |  |  | 		{ | 
					
						
							|  |  |  | 			(*it)->SetSimulatedTime(time,recurse); | 
					
						
							|  |  |  | 		} | 
					
						
							|  |  |  | 	} | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2004-05-16 12:54:44 +00:00
										 |  |  | 
 | 
					
						
							|  |  |  | 
 |