blender/source/gameengine/SceneGraph/SG_Spatial.cpp

218 lines
4.5 KiB
C++
Raw Normal View History

/*
* ***** 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
* 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,
2010-02-12 13:34:04 +00:00
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
2002-10-12 11:37:38 +00:00
*
* 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 *****
2002-10-12 11:37:38 +00:00
*/
2011-02-25 13:39:04 +00:00
/** \file gameengine/SceneGraph/SG_Spatial.cpp
* \ingroup bgesg
*/
2002-10-12 11:37:38 +00:00
#include "SG_Node.h"
#include "SG_Spatial.h"
#include "SG_Controller.h"
#include "SG_ParentRelation.h"
SG_Spatial::
SG_Spatial(
void* clientobj,
void* clientinfo,
SG_Callbacks& callbacks
2002-10-12 11:37:38 +00:00
):
SG_IObject(clientobj,clientinfo,callbacks),
m_localPosition(0.0,0.0,0.0),
m_localRotation(1.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,1.0),
m_localScaling(1.f,1.f,1.f),
m_worldPosition(0.0,0.0,0.0),
m_worldRotation(1.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,1.0),
m_worldScaling(1.f,1.f,1.f),
2002-10-12 11:37:38 +00:00
m_parent_relation (NULL),
m_bbox(MT_Point3(-1.0, -1.0, -1.0), MT_Point3(1.0, 1.0, 1.0)),
m_radius(1.0),
BGE performance, 3rd round: culling and rasterizer. This commit extend the technique of dynamic linked list to the mesh slots so as to eliminate dumb scan or map lookup. It provides massive performance improvement in the culling and in the rasterizer when the majority of objects are static. Other improvements: - Compute the opengl matrix only for objects that are visible. - Simplify hash function for GEN_HasedPtr - Scan light list instead of general object list to render shadows - Remove redundant opengl calls to set specularity, shinyness and diffuse between each mesh slots. - Cache GPU material to avoid frequent call to GPU_material_from_blender - Only set once the fixed elements of mesh slot - Use more inline function The following table shows the performance increase between 2.48, 1st round and this round of improvement. The test was done with a scene containing 40000 objects, of which 1000 are in the view frustrum approximately. The object are simple textured cube to make sure the GPU is not the bottleneck. As some of the rasterizer processing time has moved under culling, I present the sum of scenegraph(includes culling)+rasterizer time Scenegraph+rasterizer(ms) 2.48 1st round 3rd round All objects static, 323.0 86.0 7.2 all visible, 1000 in the view frustrum All objects static, 219.0 49.7 N/A(*) all invisible. All objects moving, 323.0 105.6 34.7 all visible, 1000 in the view frustrum Scene destruction 40min 40min 4s (*) : this time is not representative because the frame rate was at 60fps. In that case, the GPU holds down the GE by frame sync. By design, the overhead of the rasterizer is 0 when the the objects are invisible. This table shows a global speed up between 9x and 45x compared to 2.48a for scenegraph, culling and rasterizer overhead. The speed up goes much higher when objects are invisible. An additional 2-4x speed up is possible in the scenegraph by upgrading the Moto library to use Eigen2 BLAS library instead of C++ classes but the scenegraph is already so fast that it is not a priority right now. Next speed up in logic: many things to do there...
2009-05-07 09:13:01 +00:00
m_modified(false),
m_ogldirty(false)
2002-10-12 11:37:38 +00:00
{
}
SG_Spatial::
SG_Spatial(
const SG_Spatial& other
) :
SG_IObject(other),
m_localPosition(other.m_localPosition),
m_localRotation(other.m_localRotation),
m_localScaling(other.m_localScaling),
2004-05-16 12:54:44 +00:00
2002-10-12 11:37:38 +00:00
m_worldPosition(other.m_worldPosition),
m_worldRotation(other.m_worldRotation),
2004-05-16 12:54:44 +00:00
m_worldScaling(other.m_worldScaling),
m_parent_relation(NULL),
m_bbox(other.m_bbox),
BGE performance, 3rd round: culling and rasterizer. This commit extend the technique of dynamic linked list to the mesh slots so as to eliminate dumb scan or map lookup. It provides massive performance improvement in the culling and in the rasterizer when the majority of objects are static. Other improvements: - Compute the opengl matrix only for objects that are visible. - Simplify hash function for GEN_HasedPtr - Scan light list instead of general object list to render shadows - Remove redundant opengl calls to set specularity, shinyness and diffuse between each mesh slots. - Cache GPU material to avoid frequent call to GPU_material_from_blender - Only set once the fixed elements of mesh slot - Use more inline function The following table shows the performance increase between 2.48, 1st round and this round of improvement. The test was done with a scene containing 40000 objects, of which 1000 are in the view frustrum approximately. The object are simple textured cube to make sure the GPU is not the bottleneck. As some of the rasterizer processing time has moved under culling, I present the sum of scenegraph(includes culling)+rasterizer time Scenegraph+rasterizer(ms) 2.48 1st round 3rd round All objects static, 323.0 86.0 7.2 all visible, 1000 in the view frustrum All objects static, 219.0 49.7 N/A(*) all invisible. All objects moving, 323.0 105.6 34.7 all visible, 1000 in the view frustrum Scene destruction 40min 40min 4s (*) : this time is not representative because the frame rate was at 60fps. In that case, the GPU holds down the GE by frame sync. By design, the overhead of the rasterizer is 0 when the the objects are invisible. This table shows a global speed up between 9x and 45x compared to 2.48a for scenegraph, culling and rasterizer overhead. The speed up goes much higher when objects are invisible. An additional 2-4x speed up is possible in the scenegraph by upgrading the Moto library to use Eigen2 BLAS library instead of C++ classes but the scenegraph is already so fast that it is not a priority right now. Next speed up in logic: many things to do there...
2009-05-07 09:13:01 +00:00
m_radius(other.m_radius),
m_modified(false),
m_ogldirty(false)
2002-10-12 11:37:38 +00:00
{
// duplicate the parent relation for this object
m_parent_relation = other.m_parent_relation->NewCopy();
}
SG_Spatial::
~SG_Spatial()
{
delete (m_parent_relation);
}
void
SG_Spatial::
SetParentRelation(
SG_ParentRelation *relation
2012-03-28 05:03:24 +00:00
) {
2002-10-12 11:37:38 +00:00
delete (m_parent_relation);
m_parent_relation = relation;
SetModified();
2002-10-12 11:37:38 +00:00
}
/**
* Update Spatial Data.
2012-10-20 20:36:51 +00:00
* Calculates WorldTransform., (either doing its self or using the linked SGControllers)
2002-10-12 11:37:38 +00:00
*/
2011-09-01 02:12:53 +00:00
bool
2002-10-12 11:37:38 +00:00
SG_Spatial::
UpdateSpatialData(
2011-09-01 02:12:53 +00:00
const SG_Spatial *parent,
double time,
bool& parentUpdated)
{
2011-09-01 02:12:53 +00:00
bool bComputesWorldTransform = false;
2002-10-12 11:37:38 +00:00
// update spatial controllers
2011-09-01 02:12:53 +00:00
2002-10-12 11:37:38 +00:00
SGControllerList::iterator cit = GetSGControllerList().begin();
SGControllerList::const_iterator c_end = GetSGControllerList().end();
for (;cit!=c_end;++cit)
{
if ((*cit)->Update(time))
bComputesWorldTransform = true;
2002-10-12 11:37:38 +00:00
}
// If none of the objects updated our values then we ask the
2011-09-01 02:12:53 +00:00
// parent_relation object owned by this class to update
2002-10-12 11:37:38 +00:00
// our world coordinates.
if (!bComputesWorldTransform)
bComputesWorldTransform = ComputeWorldTransforms(parent, parentUpdated);
return bComputesWorldTransform;
2002-10-12 11:37:38 +00:00
}
/**
* Position and translation methods
*/
void
SG_Spatial::
RelativeTranslate(
const MT_Vector3& trans,
const SG_Spatial *parent,
bool local
2012-03-28 05:03:24 +00:00
) {
2002-10-12 11:37:38 +00:00
if (local) {
m_localPosition += m_localRotation * trans;
2012-07-21 22:58:08 +00:00
}
else {
2002-10-12 11:37:38 +00:00
if (parent) {
m_localPosition += trans * parent->GetWorldOrientation();
2012-07-21 22:58:08 +00:00
}
else {
2002-10-12 11:37:38 +00:00
m_localPosition += trans;
}
}
SetModified();
2012-09-16 04:58:18 +00:00
}
2002-10-12 11:37:38 +00:00
/**
* Scaling methods.
*/
/**
* Orientation and rotation methods.
*/
void
SG_Spatial::
RelativeRotate(
const MT_Matrix3x3& rot,
bool local
2012-03-28 05:03:24 +00:00
) {
2002-10-12 11:37:38 +00:00
m_localRotation = m_localRotation * (
local ?
rot
:
(GetWorldOrientation().inverse() * rot * GetWorldOrientation()));
SetModified();
2002-10-12 11:37:38 +00:00
}
MT_Transform SG_Spatial::GetWorldTransform() const
{
return MT_Transform(m_worldPosition,
m_worldRotation.scaled(
m_worldScaling[0], m_worldScaling[1], m_worldScaling[2]));
}
2004-05-16 12:54:44 +00:00
bool SG_Spatial::inside(const MT_Point3 &point) const
{
MT_Scalar radius = m_worldScaling[m_worldScaling.closestAxis()]*m_radius;
return (m_worldPosition.distance2(point) <= radius*radius) ?
m_bbox.transform(GetWorldTransform()).inside(point) :
false;
2004-05-16 12:54:44 +00:00
}
void SG_Spatial::getBBox(MT_Point3 *box) const
{
m_bbox.get(box, GetWorldTransform());
2004-05-16 12:54:44 +00:00
}
void SG_Spatial::getAABBox(MT_Point3 *box) const
{
m_bbox.getaa(box, GetWorldTransform());
2004-05-16 12:54:44 +00:00
}