2011-04-27 11:58:34 +00:00
|
|
|
/*
|
2013-08-18 14:16:15 +00:00
|
|
|
* Copyright 2011-2013 Blender Foundation
|
2011-04-27 11:58:34 +00:00
|
|
|
*
|
2013-08-18 14:16:15 +00:00
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at
|
2011-04-27 11:58:34 +00:00
|
|
|
*
|
2013-08-18 14:16:15 +00:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
2011-04-27 11:58:34 +00:00
|
|
|
*
|
2013-08-18 14:16:15 +00:00
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License
|
2011-04-27 11:58:34 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "attribute.h"
|
|
|
|
#include "graph.h"
|
|
|
|
#include "nodes.h"
|
2013-12-31 16:33:55 +00:00
|
|
|
#include "shader.h"
|
2011-04-27 11:58:34 +00:00
|
|
|
|
|
|
|
#include "util_algorithm.h"
|
|
|
|
#include "util_debug.h"
|
|
|
|
#include "util_foreach.h"
|
|
|
|
|
|
|
|
CCL_NAMESPACE_BEGIN
|
|
|
|
|
|
|
|
/* Input and Output */
|
|
|
|
|
|
|
|
ShaderInput::ShaderInput(ShaderNode *parent_, const char *name_, ShaderSocketType type_)
|
|
|
|
{
|
|
|
|
parent = parent_;
|
|
|
|
name = name_;
|
|
|
|
type = type_;
|
|
|
|
link = NULL;
|
|
|
|
value = make_float3(0, 0, 0);
|
|
|
|
stack_offset = SVM_STACK_INVALID;
|
|
|
|
default_value = NONE;
|
2012-11-26 21:59:41 +00:00
|
|
|
usage = USE_ALL;
|
2011-04-27 11:58:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ShaderOutput::ShaderOutput(ShaderNode *parent_, const char *name_, ShaderSocketType type_)
|
|
|
|
{
|
|
|
|
parent = parent_;
|
|
|
|
name = name_;
|
|
|
|
type = type_;
|
|
|
|
stack_offset = SVM_STACK_INVALID;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Node */
|
|
|
|
|
|
|
|
ShaderNode::ShaderNode(const char *name_)
|
|
|
|
{
|
|
|
|
name = name_;
|
|
|
|
id = -1;
|
|
|
|
bump = SHADER_BUMP_NONE;
|
2012-09-03 11:38:15 +00:00
|
|
|
special_type = SHADER_SPECIAL_TYPE_NONE;
|
2011-04-27 11:58:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ShaderNode::~ShaderNode()
|
|
|
|
{
|
|
|
|
foreach(ShaderInput *socket, inputs)
|
|
|
|
delete socket;
|
|
|
|
|
|
|
|
foreach(ShaderOutput *socket, outputs)
|
|
|
|
delete socket;
|
|
|
|
}
|
|
|
|
|
|
|
|
ShaderInput *ShaderNode::input(const char *name)
|
|
|
|
{
|
|
|
|
foreach(ShaderInput *socket, inputs)
|
|
|
|
if(strcmp(socket->name, name) == 0)
|
|
|
|
return socket;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
ShaderOutput *ShaderNode::output(const char *name)
|
|
|
|
{
|
|
|
|
foreach(ShaderOutput *socket, outputs)
|
|
|
|
if(strcmp(socket->name, name) == 0)
|
|
|
|
return socket;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-11-26 21:59:41 +00:00
|
|
|
ShaderInput *ShaderNode::add_input(const char *name, ShaderSocketType type, float value, int usage)
|
2011-04-27 11:58:34 +00:00
|
|
|
{
|
|
|
|
ShaderInput *input = new ShaderInput(this, name, type);
|
|
|
|
input->value.x = value;
|
2012-11-26 21:59:41 +00:00
|
|
|
input->usage = usage;
|
2011-04-27 11:58:34 +00:00
|
|
|
inputs.push_back(input);
|
|
|
|
return input;
|
|
|
|
}
|
|
|
|
|
2012-11-26 21:59:41 +00:00
|
|
|
ShaderInput *ShaderNode::add_input(const char *name, ShaderSocketType type, float3 value, int usage)
|
2011-04-27 11:58:34 +00:00
|
|
|
{
|
|
|
|
ShaderInput *input = new ShaderInput(this, name, type);
|
|
|
|
input->value = value;
|
2012-11-26 21:59:41 +00:00
|
|
|
input->usage = usage;
|
2011-04-27 11:58:34 +00:00
|
|
|
inputs.push_back(input);
|
|
|
|
return input;
|
|
|
|
}
|
|
|
|
|
2012-11-26 21:59:41 +00:00
|
|
|
ShaderInput *ShaderNode::add_input(const char *name, ShaderSocketType type, ShaderInput::DefaultValue value, int usage)
|
2011-04-27 11:58:34 +00:00
|
|
|
{
|
|
|
|
ShaderInput *input = add_input(name, type);
|
|
|
|
input->default_value = value;
|
2012-11-26 21:59:41 +00:00
|
|
|
input->usage = usage;
|
2011-04-27 11:58:34 +00:00
|
|
|
return input;
|
|
|
|
}
|
|
|
|
|
|
|
|
ShaderOutput *ShaderNode::add_output(const char *name, ShaderSocketType type)
|
|
|
|
{
|
|
|
|
ShaderOutput *output = new ShaderOutput(this, name, type);
|
|
|
|
outputs.push_back(output);
|
|
|
|
return output;
|
|
|
|
}
|
|
|
|
|
2013-12-31 16:30:34 +00:00
|
|
|
void ShaderNode::attributes(Shader *shader, AttributeRequestSet *attributes)
|
2011-04-27 11:58:34 +00:00
|
|
|
{
|
2011-10-12 16:01:37 +00:00
|
|
|
foreach(ShaderInput *input, inputs) {
|
|
|
|
if(!input->link) {
|
2013-12-31 16:33:55 +00:00
|
|
|
if(input->default_value == ShaderInput::TEXTURE_GENERATED) {
|
2013-12-31 16:33:55 +00:00
|
|
|
if(shader->has_surface)
|
|
|
|
attributes->add(ATTR_STD_GENERATED);
|
|
|
|
if(shader->has_volume)
|
|
|
|
attributes->add(ATTR_STD_GENERATED_TRANSFORM);
|
|
|
|
}
|
|
|
|
else if(input->default_value == ShaderInput::TEXTURE_UV) {
|
|
|
|
if(shader->has_surface)
|
|
|
|
attributes->add(ATTR_STD_UV);
|
2013-12-31 16:33:55 +00:00
|
|
|
}
|
2011-10-12 16:01:37 +00:00
|
|
|
}
|
|
|
|
}
|
2011-04-27 11:58:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Graph */
|
|
|
|
|
|
|
|
ShaderGraph::ShaderGraph()
|
|
|
|
{
|
|
|
|
finalized = false;
|
2013-05-10 15:10:54 +00:00
|
|
|
num_node_ids = 0;
|
2011-04-27 11:58:34 +00:00
|
|
|
add(new OutputNode());
|
|
|
|
}
|
|
|
|
|
|
|
|
ShaderGraph::~ShaderGraph()
|
|
|
|
{
|
|
|
|
foreach(ShaderNode *node, nodes)
|
|
|
|
delete node;
|
|
|
|
}
|
|
|
|
|
|
|
|
ShaderNode *ShaderGraph::add(ShaderNode *node)
|
|
|
|
{
|
|
|
|
assert(!finalized);
|
2013-05-10 15:10:54 +00:00
|
|
|
node->id = num_node_ids++;
|
2011-04-27 11:58:34 +00:00
|
|
|
nodes.push_back(node);
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
2013-12-31 16:30:34 +00:00
|
|
|
OutputNode *ShaderGraph::output()
|
2011-04-27 11:58:34 +00:00
|
|
|
{
|
2013-12-31 16:30:34 +00:00
|
|
|
return (OutputNode*)nodes.front();
|
2011-04-27 11:58:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ShaderGraph *ShaderGraph::copy()
|
|
|
|
{
|
|
|
|
ShaderGraph *newgraph = new ShaderGraph();
|
|
|
|
|
|
|
|
/* copy nodes */
|
|
|
|
set<ShaderNode*> nodes_all;
|
|
|
|
foreach(ShaderNode *node, nodes)
|
|
|
|
nodes_all.insert(node);
|
|
|
|
|
|
|
|
map<ShaderNode*, ShaderNode*> nodes_copy;
|
|
|
|
copy_nodes(nodes_all, nodes_copy);
|
|
|
|
|
|
|
|
/* add nodes (in same order, so output is still first) */
|
|
|
|
newgraph->nodes.clear();
|
|
|
|
foreach(ShaderNode *node, nodes)
|
|
|
|
newgraph->add(nodes_copy[node]);
|
|
|
|
|
|
|
|
return newgraph;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ShaderGraph::connect(ShaderOutput *from, ShaderInput *to)
|
|
|
|
{
|
|
|
|
assert(!finalized);
|
|
|
|
assert(from && to);
|
|
|
|
|
|
|
|
if(to->link) {
|
2012-10-04 20:12:16 +00:00
|
|
|
fprintf(stderr, "Cycles shader graph connect: input already connected.\n");
|
2011-04-27 11:58:34 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(from->type != to->type) {
|
|
|
|
/* for closures we can't do automatic conversion */
|
|
|
|
if(from->type == SHADER_SOCKET_CLOSURE || to->type == SHADER_SOCKET_CLOSURE) {
|
2012-10-04 20:12:16 +00:00
|
|
|
fprintf(stderr, "Cycles shader graph connect: can only connect closure to closure "
|
2013-06-05 15:54:39 +00:00
|
|
|
"(%s.%s to %s.%s).\n",
|
|
|
|
from->parent->name.c_str(), from->name,
|
|
|
|
to->parent->name.c_str(), to->name);
|
2011-04-27 11:58:34 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* add automatic conversion node in case of type mismatch */
|
2013-06-23 19:24:32 +00:00
|
|
|
ShaderNode *convert = add(new ConvertNode(from->type, to->type, true));
|
2011-04-27 11:58:34 +00:00
|
|
|
|
|
|
|
connect(from, convert->inputs[0]);
|
|
|
|
connect(convert->outputs[0], to);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* types match, just connect */
|
|
|
|
to->link = from;
|
|
|
|
from->links.push_back(to);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ShaderGraph::disconnect(ShaderInput *to)
|
|
|
|
{
|
|
|
|
assert(!finalized);
|
|
|
|
assert(to->link);
|
|
|
|
|
|
|
|
ShaderOutput *from = to->link;
|
|
|
|
|
|
|
|
to->link = NULL;
|
|
|
|
from->links.erase(remove(from->links.begin(), from->links.end(), to), from->links.end());
|
|
|
|
}
|
|
|
|
|
2014-04-21 13:53:20 +00:00
|
|
|
void ShaderGraph::finalize(bool do_bump, bool do_osl)
|
2011-04-27 11:58:34 +00:00
|
|
|
{
|
|
|
|
/* before compiling, the shader graph may undergo a number of modifications.
|
|
|
|
* currently we set default geometry shader inputs, and create automatic bump
|
|
|
|
* from displacement. a graph can be finalized only once, and should not be
|
|
|
|
* modified afterwards. */
|
|
|
|
|
|
|
|
if(!finalized) {
|
|
|
|
clean();
|
|
|
|
default_inputs(do_osl);
|
2012-10-10 15:56:43 +00:00
|
|
|
refine_bump_nodes();
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
if(do_bump)
|
|
|
|
bump_from_displacement();
|
|
|
|
|
2014-04-21 13:53:20 +00:00
|
|
|
ShaderInput *surface_in = output()->input("Surface");
|
|
|
|
ShaderInput *volume_in = output()->input("Volume");
|
2012-11-26 21:59:41 +00:00
|
|
|
|
2014-04-21 13:53:20 +00:00
|
|
|
/* todo: make this work when surface and volume closures are tangled up */
|
2012-11-26 21:59:41 +00:00
|
|
|
|
2014-04-21 13:53:20 +00:00
|
|
|
if(surface_in->link)
|
|
|
|
transform_multi_closure(surface_in->link->parent, NULL, false);
|
|
|
|
if(volume_in->link)
|
|
|
|
transform_multi_closure(volume_in->link->parent, NULL, true);
|
2012-11-26 21:59:41 +00:00
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
finalized = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ShaderGraph::find_dependencies(set<ShaderNode*>& dependencies, ShaderInput *input)
|
|
|
|
{
|
2013-08-13 08:43:31 +00:00
|
|
|
/* find all nodes that this input depends on directly and indirectly */
|
2011-04-27 11:58:34 +00:00
|
|
|
ShaderNode *node = (input->link)? input->link->parent: NULL;
|
|
|
|
|
|
|
|
if(node) {
|
|
|
|
foreach(ShaderInput *in, node->inputs)
|
|
|
|
find_dependencies(dependencies, in);
|
|
|
|
|
|
|
|
dependencies.insert(node);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ShaderGraph::copy_nodes(set<ShaderNode*>& nodes, map<ShaderNode*, ShaderNode*>& nnodemap)
|
|
|
|
{
|
|
|
|
/* copy a set of nodes, and the links between them. the assumption is
|
|
|
|
* made that all nodes that inputs are linked to are in the set too. */
|
|
|
|
|
|
|
|
/* copy nodes */
|
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
ShaderNode *nnode = node->clone();
|
|
|
|
nnodemap[node] = nnode;
|
|
|
|
|
|
|
|
nnode->inputs.clear();
|
|
|
|
nnode->outputs.clear();
|
|
|
|
|
|
|
|
foreach(ShaderInput *input, node->inputs) {
|
|
|
|
ShaderInput *ninput = new ShaderInput(*input);
|
|
|
|
nnode->inputs.push_back(ninput);
|
|
|
|
|
|
|
|
ninput->parent = nnode;
|
|
|
|
ninput->link = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
foreach(ShaderOutput *output, node->outputs) {
|
|
|
|
ShaderOutput *noutput = new ShaderOutput(*output);
|
|
|
|
nnode->outputs.push_back(noutput);
|
|
|
|
|
|
|
|
noutput->parent = nnode;
|
|
|
|
noutput->links.clear();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* recreate links */
|
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
foreach(ShaderInput *input, node->inputs) {
|
|
|
|
if(input->link) {
|
|
|
|
/* find new input and output */
|
|
|
|
ShaderNode *nfrom = nnodemap[input->link->parent];
|
|
|
|
ShaderNode *nto = nnodemap[input->parent];
|
|
|
|
ShaderOutput *noutput = nfrom->output(input->link->name);
|
|
|
|
ShaderInput *ninput = nto->input(input->name);
|
|
|
|
|
|
|
|
/* connect */
|
|
|
|
connect(noutput, ninput);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-10 11:31:57 +00:00
|
|
|
void ShaderGraph::remove_unneeded_nodes()
|
2011-12-18 15:34:06 +00:00
|
|
|
{
|
2013-05-10 15:10:54 +00:00
|
|
|
vector<bool> removed(num_node_ids, false);
|
2013-05-10 11:31:57 +00:00
|
|
|
bool any_node_removed = false;
|
2014-09-24 10:52:19 +00:00
|
|
|
|
2013-05-10 11:31:57 +00:00
|
|
|
/* find and unlink proxy nodes */
|
2011-12-18 15:34:06 +00:00
|
|
|
foreach(ShaderNode *node, nodes) {
|
2013-05-10 11:31:57 +00:00
|
|
|
if(node->special_type == SHADER_SPECIAL_TYPE_PROXY) {
|
2012-09-03 11:38:15 +00:00
|
|
|
ProxyNode *proxy = static_cast<ProxyNode*>(node);
|
2011-12-18 15:34:06 +00:00
|
|
|
ShaderInput *input = proxy->inputs[0];
|
|
|
|
ShaderOutput *output = proxy->outputs[0];
|
2014-09-24 10:52:19 +00:00
|
|
|
|
2011-12-18 15:34:06 +00:00
|
|
|
/* temp. copy of the output links list.
|
|
|
|
* output->links is modified when we disconnect!
|
|
|
|
*/
|
|
|
|
vector<ShaderInput*> links(output->links);
|
|
|
|
ShaderOutput *from = input->link;
|
2014-09-24 10:52:19 +00:00
|
|
|
|
2011-12-18 15:34:06 +00:00
|
|
|
/* bypass the proxy node */
|
2013-05-10 11:31:57 +00:00
|
|
|
if(from) {
|
2011-12-18 15:34:06 +00:00
|
|
|
disconnect(input);
|
|
|
|
foreach(ShaderInput *to, links) {
|
|
|
|
disconnect(to);
|
|
|
|
connect(from, to);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
foreach(ShaderInput *to, links) {
|
2013-06-23 19:24:32 +00:00
|
|
|
/* remove any autoconvert nodes too if they lead to
|
|
|
|
* sockets with an automatically set default value */
|
|
|
|
ShaderNode *tonode = to->parent;
|
|
|
|
|
|
|
|
if(tonode->special_type == SHADER_SPECIAL_TYPE_AUTOCONVERT) {
|
|
|
|
bool all_links_removed = true;
|
2013-07-10 10:50:19 +00:00
|
|
|
vector<ShaderInput*> links = tonode->outputs[0]->links;
|
2013-06-23 19:24:32 +00:00
|
|
|
|
2013-07-10 10:50:19 +00:00
|
|
|
foreach(ShaderInput *autoin, links) {
|
2013-06-23 19:24:32 +00:00
|
|
|
if(autoin->default_value == ShaderInput::NONE)
|
|
|
|
all_links_removed = false;
|
|
|
|
else
|
|
|
|
disconnect(autoin);
|
|
|
|
}
|
|
|
|
|
|
|
|
if(all_links_removed)
|
|
|
|
removed[tonode->id] = true;
|
|
|
|
}
|
|
|
|
|
2011-12-18 15:34:06 +00:00
|
|
|
disconnect(to);
|
|
|
|
|
|
|
|
/* transfer the default input value to the target socket */
|
|
|
|
to->set(input->value);
|
2012-11-06 21:36:44 +00:00
|
|
|
to->set(input->value_string);
|
2011-12-18 15:34:06 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
removed[proxy->id] = true;
|
2013-05-10 11:31:57 +00:00
|
|
|
any_node_removed = true;
|
2011-12-18 15:34:06 +00:00
|
|
|
}
|
2013-06-23 19:24:32 +00:00
|
|
|
else if(node->special_type == SHADER_SPECIAL_TYPE_MIX_CLOSURE) {
|
2012-09-03 11:38:15 +00:00
|
|
|
MixClosureNode *mix = static_cast<MixClosureNode*>(node);
|
2013-06-23 19:24:32 +00:00
|
|
|
|
|
|
|
/* remove useless mix closures nodes */
|
2012-05-23 17:55:34 +00:00
|
|
|
if(mix->outputs[0]->links.size() && mix->inputs[1]->link == mix->inputs[2]->link) {
|
|
|
|
ShaderOutput *output = mix->inputs[1]->link;
|
|
|
|
vector<ShaderInput*> inputs = mix->outputs[0]->links;
|
|
|
|
|
|
|
|
foreach(ShaderInput *sock, mix->inputs)
|
|
|
|
if(sock->link)
|
|
|
|
disconnect(sock);
|
|
|
|
|
|
|
|
foreach(ShaderInput *input, inputs) {
|
|
|
|
disconnect(input);
|
2013-05-10 11:31:57 +00:00
|
|
|
if(output)
|
2012-05-30 15:47:12 +00:00
|
|
|
connect(output, input);
|
2012-05-23 17:55:34 +00:00
|
|
|
}
|
2014-09-19 11:21:25 +00:00
|
|
|
removed[mix->id] = true;
|
|
|
|
any_node_removed = true;
|
2012-05-23 17:55:34 +00:00
|
|
|
}
|
2013-03-31 01:18:10 +00:00
|
|
|
|
2013-06-23 19:24:32 +00:00
|
|
|
/* remove unused mix closure input when factor is 0.0 or 1.0 */
|
|
|
|
/* check for closure links and make sure factor link is disconnected */
|
2013-03-31 01:18:10 +00:00
|
|
|
if(mix->outputs[0]->links.size() && mix->inputs[1]->link && mix->inputs[2]->link && !mix->inputs[0]->link) {
|
2013-06-23 19:24:32 +00:00
|
|
|
/* factor 0.0 */
|
2013-03-31 01:18:10 +00:00
|
|
|
if(mix->inputs[0]->value.x == 0.0f) {
|
|
|
|
ShaderOutput *output = mix->inputs[1]->link;
|
|
|
|
vector<ShaderInput*> inputs = mix->outputs[0]->links;
|
2014-09-24 10:52:19 +00:00
|
|
|
|
2013-03-31 01:18:10 +00:00
|
|
|
foreach(ShaderInput *sock, mix->inputs)
|
2013-05-10 11:31:57 +00:00
|
|
|
if(sock->link)
|
|
|
|
disconnect(sock);
|
2013-03-31 01:18:10 +00:00
|
|
|
|
|
|
|
foreach(ShaderInput *input, inputs) {
|
|
|
|
disconnect(input);
|
2013-05-10 11:31:57 +00:00
|
|
|
if(output)
|
|
|
|
connect(output, input);
|
2013-03-31 01:18:10 +00:00
|
|
|
}
|
2014-09-19 11:21:25 +00:00
|
|
|
removed[mix->id] = true;
|
|
|
|
any_node_removed = true;
|
2013-03-31 01:18:10 +00:00
|
|
|
}
|
2013-06-23 19:24:32 +00:00
|
|
|
/* factor 1.0 */
|
2013-05-10 11:31:57 +00:00
|
|
|
else if(mix->inputs[0]->value.x == 1.0f) {
|
2013-03-31 01:18:10 +00:00
|
|
|
ShaderOutput *output = mix->inputs[2]->link;
|
|
|
|
vector<ShaderInput*> inputs = mix->outputs[0]->links;
|
|
|
|
|
2014-09-24 10:52:19 +00:00
|
|
|
foreach(ShaderInput *sock, mix->inputs)
|
|
|
|
if(sock->link)
|
|
|
|
disconnect(sock);
|
|
|
|
|
|
|
|
foreach(ShaderInput *input, inputs) {
|
|
|
|
disconnect(input);
|
|
|
|
if(output)
|
|
|
|
connect(output, input);
|
|
|
|
}
|
|
|
|
removed[mix->id] = true;
|
|
|
|
any_node_removed = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(node->special_type == SHADER_SPECIAL_TYPE_MIX_RGB) {
|
|
|
|
MixNode *mix = static_cast<MixNode*>(node);
|
|
|
|
|
|
|
|
/* remove unused Mix RGB inputs when factor is 0.0 or 1.0 */
|
|
|
|
/* check for color links and make sure factor link is disconnected */
|
|
|
|
if(mix->outputs[0]->links.size() && mix->inputs[1]->link && mix->inputs[2]->link && !mix->inputs[0]->link) {
|
|
|
|
/* factor 0.0 */
|
|
|
|
if(mix->inputs[0]->value.x == 0.0f) {
|
|
|
|
ShaderOutput *output = mix->inputs[1]->link;
|
|
|
|
vector<ShaderInput*> inputs = mix->outputs[0]->links;
|
|
|
|
|
|
|
|
foreach(ShaderInput *sock, mix->inputs)
|
|
|
|
if(sock->link)
|
|
|
|
disconnect(sock);
|
|
|
|
|
|
|
|
foreach(ShaderInput *input, inputs) {
|
|
|
|
disconnect(input);
|
|
|
|
if(output)
|
|
|
|
connect(output, input);
|
|
|
|
}
|
|
|
|
removed[mix->id] = true;
|
|
|
|
any_node_removed = true;
|
|
|
|
}
|
|
|
|
/* factor 1.0 */
|
|
|
|
else if(mix->inputs[0]->value.x == 1.0f) {
|
|
|
|
ShaderOutput *output = mix->inputs[2]->link;
|
|
|
|
vector<ShaderInput*> inputs = mix->outputs[0]->links;
|
|
|
|
|
2013-03-31 01:18:10 +00:00
|
|
|
foreach(ShaderInput *sock, mix->inputs)
|
2013-05-10 11:31:57 +00:00
|
|
|
if(sock->link)
|
|
|
|
disconnect(sock);
|
2013-03-31 01:18:10 +00:00
|
|
|
|
|
|
|
foreach(ShaderInput *input, inputs) {
|
|
|
|
disconnect(input);
|
2013-05-10 11:31:57 +00:00
|
|
|
if(output)
|
2013-03-31 01:18:10 +00:00
|
|
|
connect(output, input);
|
|
|
|
}
|
2014-09-19 11:21:25 +00:00
|
|
|
removed[mix->id] = true;
|
|
|
|
any_node_removed = true;
|
2013-03-31 01:18:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-12-18 15:34:06 +00:00
|
|
|
}
|
2013-05-10 11:31:57 +00:00
|
|
|
|
|
|
|
/* remove nodes */
|
2014-09-19 11:21:25 +00:00
|
|
|
if(any_node_removed) {
|
2013-05-10 11:31:57 +00:00
|
|
|
list<ShaderNode*> newnodes;
|
|
|
|
|
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
if(!removed[node->id])
|
|
|
|
newnodes.push_back(node);
|
|
|
|
else
|
|
|
|
delete node;
|
|
|
|
}
|
|
|
|
|
|
|
|
nodes = newnodes;
|
|
|
|
}
|
2011-12-18 15:34:06 +00:00
|
|
|
}
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
void ShaderGraph::break_cycles(ShaderNode *node, vector<bool>& visited, vector<bool>& on_stack)
|
|
|
|
{
|
|
|
|
visited[node->id] = true;
|
|
|
|
on_stack[node->id] = true;
|
|
|
|
|
|
|
|
foreach(ShaderInput *input, node->inputs) {
|
|
|
|
if(input->link) {
|
|
|
|
ShaderNode *depnode = input->link->parent;
|
|
|
|
|
|
|
|
if(on_stack[depnode->id]) {
|
|
|
|
/* break cycle */
|
|
|
|
disconnect(input);
|
2012-10-04 20:12:16 +00:00
|
|
|
fprintf(stderr, "Cycles shader graph: detected cycle in graph, connection removed.\n");
|
2011-04-27 11:58:34 +00:00
|
|
|
}
|
|
|
|
else if(!visited[depnode->id]) {
|
|
|
|
/* visit dependencies */
|
|
|
|
break_cycles(depnode, visited, on_stack);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
on_stack[node->id] = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ShaderGraph::clean()
|
|
|
|
{
|
2013-05-10 11:31:57 +00:00
|
|
|
/* remove proxy and unnecessary mix nodes */
|
|
|
|
remove_unneeded_nodes();
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
/* we do two things here: find cycles and break them, and remove unused
|
2012-06-09 17:22:52 +00:00
|
|
|
* nodes that don't feed into the output. how cycles are broken is
|
|
|
|
* undefined, they are invalid input, the important thing is to not crash */
|
2011-04-27 11:58:34 +00:00
|
|
|
|
2013-05-10 15:10:54 +00:00
|
|
|
vector<bool> visited(num_node_ids, false);
|
|
|
|
vector<bool> on_stack(num_node_ids, false);
|
2011-12-18 15:34:06 +00:00
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
/* break cycles */
|
|
|
|
break_cycles(output(), visited, on_stack);
|
|
|
|
|
2012-09-04 13:29:07 +00:00
|
|
|
/* disconnect unused nodes */
|
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
if(!visited[node->id]) {
|
|
|
|
foreach(ShaderInput *to, node->inputs) {
|
|
|
|
ShaderOutput *from = to->link;
|
|
|
|
|
2013-05-10 11:31:57 +00:00
|
|
|
if(from) {
|
2012-09-04 13:29:07 +00:00
|
|
|
to->link = NULL;
|
|
|
|
from->links.erase(remove(from->links.begin(), from->links.end(), to), from->links.end());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
/* remove unused nodes */
|
2013-05-10 15:10:54 +00:00
|
|
|
list<ShaderNode*> newnodes;
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
if(visited[node->id])
|
|
|
|
newnodes.push_back(node);
|
|
|
|
else
|
|
|
|
delete node;
|
|
|
|
}
|
|
|
|
|
|
|
|
nodes = newnodes;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ShaderGraph::default_inputs(bool do_osl)
|
|
|
|
{
|
|
|
|
/* nodes can specify default texture coordinates, for now we give
|
|
|
|
* everything the position by default, except for the sky texture */
|
|
|
|
|
|
|
|
ShaderNode *geom = NULL;
|
|
|
|
ShaderNode *texco = NULL;
|
|
|
|
|
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
foreach(ShaderInput *input, node->inputs) {
|
2012-11-26 21:59:41 +00:00
|
|
|
if(!input->link && ((input->usage & ShaderInput::USE_SVM) || do_osl)) {
|
2011-10-12 16:01:37 +00:00
|
|
|
if(input->default_value == ShaderInput::TEXTURE_GENERATED) {
|
2011-04-27 11:58:34 +00:00
|
|
|
if(!texco)
|
|
|
|
texco = new TextureCoordinateNode();
|
|
|
|
|
|
|
|
connect(texco->output("Generated"), input);
|
|
|
|
}
|
2011-10-12 16:01:37 +00:00
|
|
|
else if(input->default_value == ShaderInput::TEXTURE_UV) {
|
|
|
|
if(!texco)
|
|
|
|
texco = new TextureCoordinateNode();
|
|
|
|
|
|
|
|
connect(texco->output("UV"), input);
|
|
|
|
}
|
2011-04-27 11:58:34 +00:00
|
|
|
else if(input->default_value == ShaderInput::INCOMING) {
|
|
|
|
if(!geom)
|
|
|
|
geom = new GeometryNode();
|
|
|
|
|
|
|
|
connect(geom->output("Incoming"), input);
|
|
|
|
}
|
|
|
|
else if(input->default_value == ShaderInput::NORMAL) {
|
|
|
|
if(!geom)
|
|
|
|
geom = new GeometryNode();
|
|
|
|
|
|
|
|
connect(geom->output("Normal"), input);
|
|
|
|
}
|
|
|
|
else if(input->default_value == ShaderInput::POSITION) {
|
|
|
|
if(!geom)
|
|
|
|
geom = new GeometryNode();
|
|
|
|
|
|
|
|
connect(geom->output("Position"), input);
|
|
|
|
}
|
2012-10-10 13:02:20 +00:00
|
|
|
else if(input->default_value == ShaderInput::TANGENT) {
|
|
|
|
if(!geom)
|
|
|
|
geom = new GeometryNode();
|
|
|
|
|
|
|
|
connect(geom->output("Tangent"), input);
|
|
|
|
}
|
2011-04-27 11:58:34 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(geom)
|
|
|
|
add(geom);
|
|
|
|
if(texco)
|
|
|
|
add(texco);
|
|
|
|
}
|
|
|
|
|
2012-10-10 15:56:43 +00:00
|
|
|
void ShaderGraph::refine_bump_nodes()
|
|
|
|
{
|
|
|
|
/* we transverse the node graph looking for bump nodes, when we find them,
|
|
|
|
* like in bump_from_displacement(), we copy the sub-graph defined from "bump"
|
|
|
|
* input to the inputs "center","dx" and "dy" What is in "bump" input is moved
|
|
|
|
* to "center" input. */
|
|
|
|
|
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
if(node->name == ustring("bump") && node->input("Height")->link) {
|
|
|
|
ShaderInput *bump_input = node->input("Height");
|
|
|
|
set<ShaderNode*> nodes_bump;
|
|
|
|
|
|
|
|
/* make 2 extra copies of the subgraph defined in Bump input */
|
|
|
|
map<ShaderNode*, ShaderNode*> nodes_dx;
|
|
|
|
map<ShaderNode*, ShaderNode*> nodes_dy;
|
|
|
|
|
|
|
|
/* find dependencies for the given input */
|
|
|
|
find_dependencies(nodes_bump, bump_input );
|
|
|
|
|
|
|
|
copy_nodes(nodes_bump, nodes_dx);
|
|
|
|
copy_nodes(nodes_bump, nodes_dy);
|
|
|
|
|
|
|
|
/* mark nodes to indicate they are use for bump computation, so
|
|
|
|
that any texture coordinates are shifted by dx/dy when sampling */
|
|
|
|
foreach(ShaderNode *node, nodes_bump)
|
|
|
|
node->bump = SHADER_BUMP_CENTER;
|
|
|
|
foreach(NodePair& pair, nodes_dx)
|
|
|
|
pair.second->bump = SHADER_BUMP_DX;
|
|
|
|
foreach(NodePair& pair, nodes_dy)
|
|
|
|
pair.second->bump = SHADER_BUMP_DY;
|
|
|
|
|
|
|
|
ShaderOutput *out = bump_input->link;
|
|
|
|
ShaderOutput *out_dx = nodes_dx[out->parent]->output(out->name);
|
|
|
|
ShaderOutput *out_dy = nodes_dy[out->parent]->output(out->name);
|
|
|
|
|
|
|
|
connect(out_dx, node->input("SampleX"));
|
|
|
|
connect(out_dy, node->input("SampleY"));
|
|
|
|
|
|
|
|
/* add generated nodes */
|
|
|
|
foreach(NodePair& pair, nodes_dx)
|
|
|
|
add(pair.second);
|
|
|
|
foreach(NodePair& pair, nodes_dy)
|
|
|
|
add(pair.second);
|
|
|
|
|
2014-01-17 06:35:03 +00:00
|
|
|
/* connect what is connected is bump to samplecenter input*/
|
2012-10-10 15:56:43 +00:00
|
|
|
connect(out , node->input("SampleCenter"));
|
|
|
|
|
|
|
|
/* bump input is just for connectivity purpose for the graph input,
|
2014-01-17 06:35:03 +00:00
|
|
|
* we re-connected this input to samplecenter, so lets disconnect it
|
2012-10-10 15:56:43 +00:00
|
|
|
* from bump input */
|
|
|
|
disconnect(bump_input);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
void ShaderGraph::bump_from_displacement()
|
|
|
|
{
|
|
|
|
/* generate bump mapping automatically from displacement. bump mapping is
|
|
|
|
* done using a 3-tap filter, computing the displacement at the center,
|
|
|
|
* and two other positions shifted by ray differentials.
|
|
|
|
*
|
|
|
|
* since the input to displacement is a node graph, we need to ensure that
|
|
|
|
* all texture coordinates use are shift by the ray differentials. for this
|
|
|
|
* reason we make 3 copies of the node subgraph defining the displacement,
|
|
|
|
* with each different geometry and texture coordinate nodes that generate
|
|
|
|
* different shifted coordinates.
|
|
|
|
*
|
|
|
|
* these 3 displacement values are then fed into the bump node, which will
|
2012-10-10 15:56:43 +00:00
|
|
|
* output the the perturbed normal. */
|
2011-04-27 11:58:34 +00:00
|
|
|
|
|
|
|
ShaderInput *displacement_in = output()->input("Displacement");
|
|
|
|
|
|
|
|
if(!displacement_in->link)
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* find dependencies for the given input */
|
|
|
|
set<ShaderNode*> nodes_displace;
|
|
|
|
find_dependencies(nodes_displace, displacement_in);
|
|
|
|
|
|
|
|
/* copy nodes for 3 bump samples */
|
|
|
|
map<ShaderNode*, ShaderNode*> nodes_center;
|
|
|
|
map<ShaderNode*, ShaderNode*> nodes_dx;
|
|
|
|
map<ShaderNode*, ShaderNode*> nodes_dy;
|
|
|
|
|
|
|
|
copy_nodes(nodes_displace, nodes_center);
|
|
|
|
copy_nodes(nodes_displace, nodes_dx);
|
|
|
|
copy_nodes(nodes_displace, nodes_dy);
|
|
|
|
|
|
|
|
/* mark nodes to indicate they are use for bump computation, so
|
2012-06-09 17:22:52 +00:00
|
|
|
* that any texture coordinates are shifted by dx/dy when sampling */
|
2011-04-27 11:58:34 +00:00
|
|
|
foreach(NodePair& pair, nodes_center)
|
|
|
|
pair.second->bump = SHADER_BUMP_CENTER;
|
|
|
|
foreach(NodePair& pair, nodes_dx)
|
|
|
|
pair.second->bump = SHADER_BUMP_DX;
|
|
|
|
foreach(NodePair& pair, nodes_dy)
|
|
|
|
pair.second->bump = SHADER_BUMP_DY;
|
|
|
|
|
2012-10-10 15:56:43 +00:00
|
|
|
/* add set normal node and connect the bump normal ouput to the set normal
|
|
|
|
* output, so it can finally set the shader normal, note we are only doing
|
|
|
|
* this for bump from displacement, this will be the only bump allowed to
|
|
|
|
* overwrite the shader normal */
|
|
|
|
ShaderNode *set_normal = add(new SetNormalNode());
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
/* add bump node and connect copied graphs to it */
|
|
|
|
ShaderNode *bump = add(new BumpNode());
|
|
|
|
|
|
|
|
ShaderOutput *out = displacement_in->link;
|
|
|
|
ShaderOutput *out_center = nodes_center[out->parent]->output(out->name);
|
|
|
|
ShaderOutput *out_dx = nodes_dx[out->parent]->output(out->name);
|
|
|
|
ShaderOutput *out_dy = nodes_dy[out->parent]->output(out->name);
|
|
|
|
|
|
|
|
connect(out_center, bump->input("SampleCenter"));
|
|
|
|
connect(out_dx, bump->input("SampleX"));
|
|
|
|
connect(out_dy, bump->input("SampleY"));
|
2012-10-10 15:56:43 +00:00
|
|
|
|
|
|
|
/* connect the bump out to the set normal in: */
|
|
|
|
connect(bump->output("Normal"), set_normal->input("Direction"));
|
2011-04-27 11:58:34 +00:00
|
|
|
|
|
|
|
/* connect bump output to normal input nodes that aren't set yet. actually
|
2012-06-09 17:22:52 +00:00
|
|
|
* this will only set the normal input to the geometry node that we created
|
|
|
|
* and connected to all other normal inputs already. */
|
2011-04-27 11:58:34 +00:00
|
|
|
foreach(ShaderNode *node, nodes)
|
|
|
|
foreach(ShaderInput *input, node->inputs)
|
|
|
|
if(!input->link && input->default_value == ShaderInput::NORMAL)
|
2012-10-10 15:56:43 +00:00
|
|
|
connect(set_normal->output("Normal"), input);
|
|
|
|
|
|
|
|
/* for displacement bump, clear the normal input in case the above loop
|
|
|
|
* connected the setnormal out to the bump normalin */
|
2013-05-08 13:23:13 +00:00
|
|
|
ShaderInput *bump_normal_in = bump->input("Normal");
|
2012-10-10 15:56:43 +00:00
|
|
|
if(bump_normal_in)
|
|
|
|
bump_normal_in->link = NULL;
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
/* finally, add the copied nodes to the graph. we can't do this earlier
|
2012-06-09 17:22:52 +00:00
|
|
|
* because we would create dependency cycles in the above loop */
|
2011-04-27 11:58:34 +00:00
|
|
|
foreach(NodePair& pair, nodes_center)
|
|
|
|
add(pair.second);
|
|
|
|
foreach(NodePair& pair, nodes_dx)
|
|
|
|
add(pair.second);
|
|
|
|
foreach(NodePair& pair, nodes_dy)
|
|
|
|
add(pair.second);
|
|
|
|
}
|
|
|
|
|
2012-11-26 21:59:41 +00:00
|
|
|
void ShaderGraph::transform_multi_closure(ShaderNode *node, ShaderOutput *weight_out, bool volume)
|
|
|
|
{
|
|
|
|
/* for SVM in multi closure mode, this transforms the shader mix/add part of
|
|
|
|
* the graph into nodes that feed weights into closure nodes. this is too
|
|
|
|
* avoid building a closure tree and then flattening it, and instead write it
|
|
|
|
* directly to an array */
|
|
|
|
|
|
|
|
if(node->name == ustring("mix_closure") || node->name == ustring("add_closure")) {
|
|
|
|
ShaderInput *fin = node->input("Fac");
|
|
|
|
ShaderInput *cl1in = node->input("Closure1");
|
|
|
|
ShaderInput *cl2in = node->input("Closure2");
|
|
|
|
ShaderOutput *weight1_out, *weight2_out;
|
|
|
|
|
|
|
|
if(fin) {
|
|
|
|
/* mix closure: add node to mix closure weights */
|
|
|
|
ShaderNode *mix_node = add(new MixClosureWeightNode());
|
|
|
|
ShaderInput *fac_in = mix_node->input("Fac");
|
|
|
|
ShaderInput *weight_in = mix_node->input("Weight");
|
|
|
|
|
|
|
|
if(fin->link)
|
|
|
|
connect(fin->link, fac_in);
|
|
|
|
else
|
|
|
|
fac_in->value = fin->value;
|
|
|
|
|
|
|
|
if(weight_out)
|
|
|
|
connect(weight_out, weight_in);
|
|
|
|
|
|
|
|
weight1_out = mix_node->output("Weight1");
|
|
|
|
weight2_out = mix_node->output("Weight2");
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* add closure: just pass on any weights */
|
|
|
|
weight1_out = weight_out;
|
|
|
|
weight2_out = weight_out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(cl1in->link)
|
|
|
|
transform_multi_closure(cl1in->link->parent, weight1_out, volume);
|
|
|
|
if(cl2in->link)
|
|
|
|
transform_multi_closure(cl2in->link->parent, weight2_out, volume);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
ShaderInput *weight_in = node->input((volume)? "VolumeMixWeight": "SurfaceMixWeight");
|
|
|
|
|
|
|
|
/* not a closure node? */
|
|
|
|
if(!weight_in)
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* already has a weight connected to it? add weights */
|
|
|
|
if(weight_in->link || weight_in->value.x != 0.0f) {
|
|
|
|
ShaderNode *math_node = add(new MathNode());
|
|
|
|
ShaderInput *value1_in = math_node->input("Value1");
|
|
|
|
ShaderInput *value2_in = math_node->input("Value2");
|
|
|
|
|
|
|
|
if(weight_in->link)
|
|
|
|
connect(weight_in->link, value1_in);
|
|
|
|
else
|
|
|
|
value1_in->value = weight_in->value;
|
|
|
|
|
|
|
|
if(weight_out)
|
|
|
|
connect(weight_out, value2_in);
|
|
|
|
else
|
|
|
|
value2_in->value.x = 1.0f;
|
|
|
|
|
|
|
|
weight_out = math_node->output("Value");
|
2013-01-23 13:13:20 +00:00
|
|
|
if(weight_in->link)
|
|
|
|
disconnect(weight_in);
|
2012-11-26 21:59:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* connected to closure mix weight */
|
|
|
|
if(weight_out)
|
|
|
|
connect(weight_out, weight_in);
|
|
|
|
else
|
|
|
|
weight_in->value.x += 1.0f;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-09-19 09:21:32 +00:00
|
|
|
void ShaderGraph::dump_graph(const char *filename)
|
|
|
|
{
|
|
|
|
FILE *fd = fopen(filename, "w");
|
|
|
|
|
|
|
|
if(fd == NULL) {
|
|
|
|
printf("Error opening file for dumping the graph: %s\n", filename);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(fd, "digraph dependencygraph {\n");
|
|
|
|
fprintf(fd, "ranksep=1.5\n");
|
|
|
|
fprintf(fd, "splines=false\n");
|
|
|
|
|
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
fprintf(fd, "// NODE: %p\n", node);
|
|
|
|
fprintf(fd,
|
|
|
|
"\"%p\" [shape=record,label=\"%s\"]\n",
|
|
|
|
node,
|
|
|
|
node->name.c_str());
|
|
|
|
}
|
|
|
|
|
|
|
|
foreach(ShaderNode *node, nodes) {
|
|
|
|
foreach(ShaderOutput *output, node->outputs) {
|
|
|
|
foreach(ShaderInput *input, output->links) {
|
|
|
|
fprintf(fd,
|
|
|
|
"// CONNECTION: %p->%p (%s:%s)\n",
|
|
|
|
output,
|
|
|
|
input,
|
|
|
|
output->name, input->name);
|
|
|
|
fprintf(fd,
|
|
|
|
"\"%p\":s -> \"%p\":n [label=\"%s:%s\"]\n",
|
|
|
|
output->parent,
|
|
|
|
input->parent,
|
|
|
|
output->name, input->name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(fd, "}\n");
|
|
|
|
fclose(fd);
|
|
|
|
}
|
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
CCL_NAMESPACE_END
|
|
|
|
|