3abb8e8e68
Use dynamic linked list to handle scenegraph rather than dumb scan of the whole tree. The performance improvement depends on the fraction of moving objects. If most objects are static, the speed up is considerable. The following table compares the time spent on scenegraph before and after this commit on a scene with 10000 objects in various configuratons: Scenegraph time (ms) Before After (includes culling) All objects static, 8.8 1.7 all visible but small fraction in the view frustrum All objects static, 7,5 0.01 all invisible. All objects moving, 14.1 8.4 all visible but small fraction in the view frustrum This tables shows that static and invisible objects take no CPU at all for scenegraph and culling. In the general case, this commit will speed up the scenegraph between 2x and 5x. Compared to 2.48a, it should be between 4x and 10x faster. Further speed up is possible by making the scenegraph cache-friendly. Next round of performance improvement will be on the rasterizer: use the same dynamic linked list technique for the mesh slots.
148 lines
3.1 KiB
C++
148 lines
3.1 KiB
C++
/**
|
|
* $Id$
|
|
*
|
|
* ***** BEGIN GPL LICENSE BLOCK *****
|
|
*
|
|
* 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
|
|
* of the License, or (at your option) any later version.
|
|
*
|
|
* 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.
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
#ifndef __SG_DLIST
|
|
#define __SG_DLIST
|
|
|
|
#include <stdlib.h>
|
|
|
|
/**
|
|
* Double circular linked list
|
|
*/
|
|
class SG_DList
|
|
{
|
|
protected :
|
|
SG_DList* m_flink;
|
|
SG_DList* m_blink;
|
|
|
|
public:
|
|
template<typename T> class iterator
|
|
{
|
|
private:
|
|
SG_DList& m_head;
|
|
T* m_current;
|
|
public:
|
|
typedef iterator<T> _myT;
|
|
iterator(SG_DList& head) : m_head(head), m_current(NULL) {}
|
|
~iterator() {}
|
|
|
|
void begin()
|
|
{
|
|
m_current = (T*)m_head.Peek();
|
|
if (m_current == (T*)m_head.Self())
|
|
{
|
|
m_current = NULL;
|
|
}
|
|
}
|
|
bool end()
|
|
{
|
|
return (NULL == m_current);
|
|
}
|
|
T* operator*()
|
|
{
|
|
return m_current;
|
|
}
|
|
_myT& operator++()
|
|
{
|
|
assert(m_current);
|
|
m_current = (T*)m_current->Peek();
|
|
if (m_current == (T*)m_head.Self())
|
|
{
|
|
m_current = NULL;
|
|
}
|
|
return *this;
|
|
}
|
|
};
|
|
|
|
SG_DList()
|
|
{
|
|
m_flink = m_blink = this;
|
|
}
|
|
virtual ~SG_DList()
|
|
{
|
|
Delink();
|
|
}
|
|
|
|
inline bool Empty() // Check for empty queue
|
|
{
|
|
return ( m_flink == this );
|
|
}
|
|
bool AddBack( SG_DList *item ) // Add to the back
|
|
{
|
|
if (!item->Empty())
|
|
return false;
|
|
item->m_blink = m_blink;
|
|
item->m_flink = this;
|
|
m_blink->m_flink = item;
|
|
m_blink = item;
|
|
return true;
|
|
}
|
|
bool AddFront( SG_DList *item ) // Add to the back
|
|
{
|
|
if (!item->Empty())
|
|
return false;
|
|
item->m_flink = m_flink;
|
|
item->m_blink = this;
|
|
m_flink->m_blink = item;
|
|
m_flink = item;
|
|
return true;
|
|
}
|
|
SG_DList *Remove() // Remove from the front
|
|
{
|
|
if (Empty())
|
|
{
|
|
return NULL;
|
|
}
|
|
SG_DList* item = m_flink;
|
|
m_flink = item->m_flink;
|
|
m_flink->m_blink = this;
|
|
item->m_flink = item->m_blink = item;
|
|
return item;
|
|
}
|
|
void Delink() // Remove from the middle
|
|
{
|
|
if (!Empty())
|
|
{
|
|
m_blink->m_flink = m_flink;
|
|
m_flink->m_blink = m_blink;
|
|
m_flink = m_blink = this;
|
|
}
|
|
}
|
|
inline SG_DList *Peek() // Look at front without removing
|
|
{
|
|
return m_flink;
|
|
}
|
|
inline SG_DList *Self()
|
|
{
|
|
return this;
|
|
}
|
|
};
|
|
|
|
#endif //__SG_DLIST
|
|
|