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
74
|
/*
* 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) 2018 Blender Foundation.
* All rights reserved.
*/
/** \file
* \ingroup depsgraph
*/
#include "intern/builder/deg_builder_map.h"
#include "DNA_ID.h"
namespace DEG {
BuilderMap::BuilderMap()
{
}
BuilderMap::~BuilderMap()
{
}
bool BuilderMap::checkIsBuilt(ID *id, int tag) const
{
return (getIDTag(id) & tag) == tag;
}
void BuilderMap::tagBuild(ID *id, int tag)
{
IDTagMap::iterator it = id_tags_.find(id);
if (it == id_tags_.end()) {
id_tags_.insert(make_pair(id, tag));
return;
}
it->second |= tag;
}
bool BuilderMap::checkIsBuiltAndTag(ID *id, int tag)
{
IDTagMap::iterator it = id_tags_.find(id);
if (it == id_tags_.end()) {
id_tags_.insert(make_pair(id, tag));
return false;
}
const bool result = (it->second & tag) == tag;
it->second |= tag;
return result;
}
int BuilderMap::getIDTag(ID *id) const
{
IDTagMap::const_iterator it = id_tags_.find(id);
if (it == id_tags_.end()) {
return 0;
}
return it->second;
}
} // namespace DEG
|
