2019-01-31 12:56:40 +01: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.
|
|
|
|
|
*
|
|
|
|
|
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
|
*
|
|
|
|
|
* The Original Code is Copyright (C) 2013 Blender Foundation.
|
|
|
|
|
* All rights reserved.
|
|
|
|
|
*/
|
|
|
|
|
|
2019-02-18 08:08:12 +11:00
|
|
|
/** \file
|
|
|
|
|
* \ingroup depsgraph
|
2019-01-31 12:56:40 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "intern/node/deg_node.h"
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
|
|
#include "BLI_utildefines.h"
|
|
|
|
|
|
|
|
|
|
#include "intern/depsgraph.h"
|
|
|
|
|
#include "intern/eval/deg_eval_copy_on_write.h"
|
|
|
|
|
#include "intern/node/deg_node_component.h"
|
|
|
|
|
#include "intern/node/deg_node_factory.h"
|
|
|
|
|
#include "intern/node/deg_node_id.h"
|
|
|
|
|
#include "intern/node/deg_node_operation.h"
|
|
|
|
|
#include "intern/node/deg_node_time.h"
|
|
|
|
|
|
|
|
|
|
namespace DEG {
|
|
|
|
|
|
|
|
|
|
const char *nodeClassAsString(NodeClass node_class)
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
switch (node_class) {
|
|
|
|
|
case NodeClass::GENERIC:
|
|
|
|
|
return "GENERIC";
|
|
|
|
|
case NodeClass::COMPONENT:
|
|
|
|
|
return "COMPONENT";
|
|
|
|
|
case NodeClass::OPERATION:
|
|
|
|
|
return "OPERATION";
|
|
|
|
|
}
|
|
|
|
|
BLI_assert(!"Unhandled node class, should never happen.");
|
|
|
|
|
return "UNKNOWN";
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const char *nodeTypeAsString(NodeType type)
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
switch (type) {
|
|
|
|
|
case NodeType::UNDEFINED:
|
|
|
|
|
return "UNDEFINED";
|
|
|
|
|
case NodeType::OPERATION:
|
|
|
|
|
return "OPERATION";
|
|
|
|
|
/* **** Generic Types **** */
|
|
|
|
|
case NodeType::TIMESOURCE:
|
|
|
|
|
return "TIMESOURCE";
|
|
|
|
|
case NodeType::ID_REF:
|
|
|
|
|
return "ID_REF";
|
|
|
|
|
/* **** Outer Types **** */
|
|
|
|
|
case NodeType::PARAMETERS:
|
|
|
|
|
return "PARAMETERS";
|
|
|
|
|
case NodeType::PROXY:
|
|
|
|
|
return "PROXY";
|
|
|
|
|
case NodeType::ANIMATION:
|
|
|
|
|
return "ANIMATION";
|
|
|
|
|
case NodeType::TRANSFORM:
|
|
|
|
|
return "TRANSFORM";
|
|
|
|
|
case NodeType::GEOMETRY:
|
|
|
|
|
return "GEOMETRY";
|
|
|
|
|
case NodeType::SEQUENCER:
|
|
|
|
|
return "SEQUENCER";
|
|
|
|
|
case NodeType::LAYER_COLLECTIONS:
|
|
|
|
|
return "LAYER_COLLECTIONS";
|
|
|
|
|
case NodeType::COPY_ON_WRITE:
|
|
|
|
|
return "COPY_ON_WRITE";
|
|
|
|
|
case NodeType::OBJECT_FROM_LAYER:
|
|
|
|
|
return "OBJECT_FROM_LAYER";
|
|
|
|
|
/* **** Evaluation-Related Outer Types (with Subdata) **** */
|
|
|
|
|
case NodeType::EVAL_POSE:
|
|
|
|
|
return "EVAL_POSE";
|
|
|
|
|
case NodeType::BONE:
|
|
|
|
|
return "BONE";
|
|
|
|
|
case NodeType::PARTICLE_SYSTEM:
|
|
|
|
|
return "PARTICLE_SYSTEM";
|
|
|
|
|
case NodeType::PARTICLE_SETTINGS:
|
|
|
|
|
return "PARTICLE_SETTINGS";
|
|
|
|
|
case NodeType::SHADING:
|
|
|
|
|
return "SHADING";
|
|
|
|
|
case NodeType::SHADING_PARAMETERS:
|
|
|
|
|
return "SHADING_PARAMETERS";
|
|
|
|
|
case NodeType::CACHE:
|
|
|
|
|
return "CACHE";
|
|
|
|
|
case NodeType::POINT_CACHE:
|
|
|
|
|
return "POINT_CACHE";
|
|
|
|
|
case NodeType::BATCH_CACHE:
|
|
|
|
|
return "BATCH_CACHE";
|
|
|
|
|
/* Duplication. */
|
|
|
|
|
case NodeType::DUPLI:
|
|
|
|
|
return "DUPLI";
|
|
|
|
|
/* Synchronization. */
|
|
|
|
|
case NodeType::SYNCHRONIZATION:
|
|
|
|
|
return "SYNCHRONIZATION";
|
|
|
|
|
/* Generic datablock. */
|
|
|
|
|
case NodeType::GENERIC_DATABLOCK:
|
|
|
|
|
return "GENERIC_DATABLOCK";
|
|
|
|
|
|
|
|
|
|
/* Total number of meaningful node types. */
|
|
|
|
|
case NodeType::NUM_TYPES:
|
|
|
|
|
return "SpecialCase";
|
|
|
|
|
}
|
|
|
|
|
BLI_assert(!"Unhandled node type, should never happen.");
|
|
|
|
|
return "UNKNOWN";
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*******************************************************************************
|
|
|
|
|
* Type information.
|
|
|
|
|
*/
|
|
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
Node::TypeInfo::TypeInfo(NodeType type, const char *type_name, int id_recalc_tag)
|
|
|
|
|
: type(type), type_name(type_name), id_recalc_tag(id_recalc_tag)
|
2019-01-31 12:56:40 +01:00
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*******************************************************************************
|
|
|
|
|
* Evaluation statistics.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
Node::Stats::Stats()
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
reset();
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Node::Stats::reset()
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
current_time = 0.0;
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void Node::Stats::reset_current()
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
current_time = 0.0;
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*******************************************************************************
|
|
|
|
|
* Node itself.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
Node::Node()
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
name = "";
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Node::~Node()
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
/* Free links. */
|
|
|
|
|
/* NOTE: We only free incoming links. This is to avoid double-free of links
|
|
|
|
|
* when we're trying to free same link from both it's sides. We don't have
|
|
|
|
|
* dangling links so this is not a problem from memory leaks point of view. */
|
|
|
|
|
for (Relation *rel : inlinks) {
|
|
|
|
|
OBJECT_GUARDED_DELETE(rel, Relation);
|
|
|
|
|
}
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Generic identifier for Depsgraph Nodes. */
|
|
|
|
|
string Node::identifier() const
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
return string(nodeTypeAsString(type)) + " : " + name;
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
NodeClass Node::get_class() const
|
|
|
|
|
{
|
|
|
|
|
if (type == NodeType::OPERATION) {
|
|
|
|
|
return NodeClass::OPERATION;
|
|
|
|
|
}
|
|
|
|
|
else if (type < NodeType::PARAMETERS) {
|
|
|
|
|
return NodeClass::GENERIC;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
return NodeClass::COMPONENT;
|
|
|
|
|
}
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*******************************************************************************
|
|
|
|
|
* Generic nodes definition.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
DEG_DEPSNODE_DEFINE(TimeSourceNode, NodeType::TIMESOURCE, "Time Source");
|
|
|
|
|
static DepsNodeFactoryImpl<TimeSourceNode> DNTI_TIMESOURCE;
|
|
|
|
|
|
|
|
|
|
DEG_DEPSNODE_DEFINE(IDNode, NodeType::ID_REF, "ID Node");
|
|
|
|
|
static DepsNodeFactoryImpl<IDNode> DNTI_ID_REF;
|
|
|
|
|
|
|
|
|
|
void deg_register_base_depsnodes()
|
|
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
register_node_typeinfo(&DNTI_TIMESOURCE);
|
|
|
|
|
register_node_typeinfo(&DNTI_ID_REF);
|
2019-01-31 12:56:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
} // namespace DEG
|