forked from bartvdbraak/blender
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.
145 lines
3.2 KiB
C++
145 lines
3.2 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_QLIST
|
|
#define __SG_QLIST
|
|
|
|
#include "SG_DList.h"
|
|
|
|
/**
|
|
* Double-Double circular linked list
|
|
* For storing an object is two lists simultaneously
|
|
*/
|
|
class SG_QList : public SG_DList
|
|
{
|
|
protected :
|
|
SG_QList* m_fqlink;
|
|
SG_QList* m_bqlink;
|
|
|
|
public:
|
|
template<typename T> class iterator
|
|
{
|
|
private:
|
|
SG_QList& m_head;
|
|
T* m_current;
|
|
public:
|
|
typedef iterator<T> _myT;
|
|
iterator(SG_QList& head) : m_head(head), m_current(NULL) {}
|
|
~iterator() {}
|
|
|
|
void begin()
|
|
{
|
|
m_current = (T*)m_head.QPeek();
|
|
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->QPeek();
|
|
if (m_current == (T*)m_head.Self())
|
|
{
|
|
m_current = NULL;
|
|
}
|
|
return *this;
|
|
}
|
|
};
|
|
|
|
SG_QList() : SG_DList()
|
|
{
|
|
m_fqlink = m_bqlink = this;
|
|
}
|
|
virtual ~SG_QList()
|
|
{
|
|
QDelink();
|
|
}
|
|
|
|
inline bool QEmpty() // Check for empty queue
|
|
{
|
|
return ( m_fqlink == this );
|
|
}
|
|
bool QAddBack( SG_QList *item ) // Add to the back
|
|
{
|
|
if (!item->QEmpty())
|
|
return false;
|
|
item->m_bqlink = m_bqlink;
|
|
item->m_fqlink = this;
|
|
m_bqlink->m_fqlink = item;
|
|
m_bqlink = item;
|
|
return true;
|
|
}
|
|
bool QAddFront( SG_QList *item ) // Add to the back
|
|
{
|
|
if (!item->Empty())
|
|
return false;
|
|
item->m_fqlink = m_fqlink;
|
|
item->m_bqlink = this;
|
|
m_fqlink->m_bqlink = item;
|
|
m_fqlink = item;
|
|
return true;
|
|
}
|
|
SG_QList *QRemove() // Remove from the front
|
|
{
|
|
if (QEmpty())
|
|
{
|
|
return NULL;
|
|
}
|
|
SG_QList* item = m_fqlink;
|
|
m_fqlink = item->m_fqlink;
|
|
m_fqlink->m_bqlink = this;
|
|
item->m_fqlink = item->m_bqlink = item;
|
|
return item;
|
|
}
|
|
void QDelink() // Remove from the middle
|
|
{
|
|
if (!QEmpty())
|
|
{
|
|
m_bqlink->m_fqlink = m_fqlink;
|
|
m_fqlink->m_bqlink = m_bqlink;
|
|
m_fqlink = m_bqlink = this;
|
|
}
|
|
}
|
|
inline SG_QList *QPeek() // Look at front without removing
|
|
{
|
|
return m_fqlink;
|
|
}
|
|
};
|
|
|
|
#endif //__SG_QLIST
|
|
|