386122ada6
This commit extends the technique of dynamic linked list to the logic system to eliminate as much as possible temporaries, map lookup or full scan. The logic engine is now free of memory allocation, which is an important stability factor. The overhead of the logic system is reduced by a factor between 3 and 6 depending on the logic setup. This is the speed-up you can expect on a logic setup using simple bricks. Heavy bricks like python controllers and ray sensors will still take about the same time to execute so the speed up will be less important. The core of the logic engine has been much reworked but the functionality is still the same except for one thing: the priority system on the execution of controllers. The exact same remark applies to actuators but I'll explain for controllers only: Previously, it was possible, with the "executePriority" attribute to set a controller to run before any other controllers in the game. Other than that, the sequential execution of controllers, as defined in Blender was guaranteed by default. With the new system, the sequential execution of controllers is still guaranteed but only within the controllers of one object. the user can no longer set a controller to run before any other controllers in the game. The "executePriority" attribute controls the execution of controllers within one object. The priority is a small number starting from 0 for the first controller and incrementing for each controller. If this missing feature is a must, a special method can be implemented to set a controller to run before all other controllers. Other improvements: - Systematic use of reference in parameter passing to avoid unnecessary data copy - Use pre increment in iterator instead of post increment to avoid temporary allocation - Use const char* instead of STR_String whenever possible to avoid temporary allocation - Fix reference counting bugs (memory leak) - Fix a crash in certain cases of state switching and object deletion - Minor speed up in property sensor - Removal of objects during the game is a lot faster
146 lines
2.5 KiB
C++
146 lines
2.5 KiB
C++
// IfExpr.cpp: implementation of the CIfExpr class.
|
|
/*
|
|
* Copyright (c) 1996-2000 Erwin Coumans <coockie@acm.org>
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation for any purpose is hereby granted without fee,
|
|
* provided that the above copyright notice appear in all copies and
|
|
* that both that copyright notice and this permission notice appear
|
|
* in supporting documentation. Erwin Coumans makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*
|
|
*/
|
|
|
|
#include "IfExpr.h"
|
|
#include "EmptyValue.h"
|
|
#include "ErrorValue.h"
|
|
#include "BoolValue.h"
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include <config.h>
|
|
#endif
|
|
|
|
//////////////////////////////////////////////////////////////////////
|
|
// Construction/Destruction
|
|
//////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
CIfExpr::CIfExpr()
|
|
{
|
|
}
|
|
|
|
|
|
|
|
CIfExpr::CIfExpr(CExpression *guard, CExpression *e1, CExpression *e2)
|
|
/*
|
|
pre:
|
|
effect: constructs an CifExpr-object corresponding to IF(guard, e1, e2)
|
|
*/
|
|
{
|
|
m_guard = guard;
|
|
m_e1 = e1;
|
|
m_e2 = e2;
|
|
}
|
|
|
|
|
|
|
|
CIfExpr::~CIfExpr()
|
|
/*
|
|
pre:
|
|
effect: dereferences the object
|
|
*/
|
|
{
|
|
if (m_guard)
|
|
m_guard->Release();
|
|
|
|
if (m_e1)
|
|
m_e1->Release();
|
|
|
|
if (m_e2)
|
|
m_e2->Release();
|
|
}
|
|
|
|
|
|
|
|
CValue* CIfExpr::Calculate()
|
|
/*
|
|
pre:
|
|
ret: a new object containing the value of m_e1 if m_guard is a boolean TRUE
|
|
a new object containing the value of m_e2 if m_guard is a boolean FALSE
|
|
an new errorvalue if m_guard is not a boolean
|
|
*/
|
|
{
|
|
CValue *guardval;
|
|
guardval = m_guard->Calculate();
|
|
const STR_String& text = guardval->GetText();
|
|
guardval->Release();
|
|
|
|
if (&text == &CBoolValue::sTrueString)
|
|
{
|
|
return m_e1->Calculate();
|
|
}
|
|
else if (&text == &CBoolValue::sFalseString)
|
|
{
|
|
return m_e2->Calculate();
|
|
}
|
|
else
|
|
{
|
|
return new CErrorValue("Guard should be of boolean type");
|
|
}
|
|
}
|
|
|
|
|
|
|
|
bool CIfExpr::MergeExpression(CExpression *otherexpr)
|
|
{
|
|
assertd(false);
|
|
return false;
|
|
}
|
|
|
|
|
|
|
|
bool CIfExpr::IsInside(float x,float y,float z,bool bBorderInclude)
|
|
{
|
|
assertd(false);
|
|
return false;
|
|
}
|
|
|
|
|
|
|
|
bool CIfExpr::NeedsRecalculated()
|
|
{
|
|
return (m_guard->NeedsRecalculated() ||
|
|
m_e1->NeedsRecalculated() ||
|
|
m_e2->NeedsRecalculated());
|
|
}
|
|
|
|
|
|
|
|
CExpression* CIfExpr::CheckLink(std::vector<CBrokenLinkInfo*>& brokenlinks)
|
|
{
|
|
assertd(false);
|
|
return NULL;
|
|
}
|
|
|
|
|
|
|
|
void CIfExpr::ClearModified()
|
|
{
|
|
assertd(false);
|
|
}
|
|
|
|
|
|
|
|
void CIfExpr::BroadcastOperators(VALUE_OPERATOR op)
|
|
{
|
|
assertd(false);
|
|
}
|
|
|
|
|
|
|
|
unsigned char CIfExpr::GetExpressionID()
|
|
{
|
|
return CIFEXPRESSIONID;
|
|
}
|