1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/*
* 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) 2020 Blender Foundation.
* All rights reserved.
*/
/** \file
* \ingroup depsgraph
*/
#include "intern/depsgraph_relation.h" /* own include */
#include "BLI_utildefines.h"
#include "intern/depsgraph_type.h"
#include "intern/node/deg_node.h"
namespace DEG {
/* TODO(sergey): Find a better place for this. */
template<typename T> static void remove_from_vector(vector<T> *vector, const T &value)
{
vector->erase(std::remove(vector->begin(), vector->end(), value), vector->end());
}
Relation::Relation(Node *from, Node *to, const char *description)
: from(from), to(to), name(description), flag(0)
{
/* Hook it up to the nodes which use it.
*
* NOTE: We register relation in the nodes which this link connects to here
* in constructor but we don't un-register it in the destructor.
*
* Reasoning:
*
* - Destructor is currently used on global graph destruction, so there's no
* real need in avoiding dangling pointers, all the memory is to be freed
* anyway.
*
* - Un-registering relation is not a cheap operation, so better to have it
* as an explicit call if we need this. */
from->outlinks.push_back(this);
to->inlinks.push_back(this);
}
Relation::~Relation()
{
/* Sanity check. */
BLI_assert(from != nullptr && to != nullptr);
}
void Relation::unlink()
{
/* Sanity check. */
BLI_assert(from != nullptr && to != nullptr);
remove_from_vector(&from->outlinks, this);
remove_from_vector(&to->inlinks, this);
}
} // namespace DEG
|