Add ValueNode "Greyed" for making ducks uneditable.
[synfig.git] / synfig-core / trunk / src / synfig / valuenode.cpp
1 /* === S Y N F I G ========================================================= */
2 /*!     \file valuenode.cpp
3 **      \brief Implementation of the "Placeholder" valuenode conversion.
4 **
5 **      $Id$
6 **
7 **      \legal
8 **      Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
9 **      Copyright (c) 2007, 2008 Chris Moore
10 **  Copyright (c) 2008 Carlos López
11 **
12 **      This package is free software; you can redistribute it and/or
13 **      modify it under the terms of the GNU General Public License as
14 **      published by the Free Software Foundation; either version 2 of
15 **      the License, or (at your option) any later version.
16 **
17 **      This package is distributed in the hope that it will be useful,
18 **      but WITHOUT ANY WARRANTY; without even the implied warranty of
19 **      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 **      General Public License for more details.
21 **      \endlegal
22 */
23 /* ========================================================================= */
24
25 /* === H E A D E R S ======================================================= */
26
27 #define SYNFIG_NO_ANGLE
28
29 //#define HAS_HASH_MAP 1
30
31 #ifdef USING_PCH
32 #       include "pch.h"
33 #else
34 #ifdef HAVE_CONFIG_H
35 #       include <config.h>
36 #endif
37
38 #include "valuenode.h"
39 #include "general.h"
40 #include "canvas.h"
41 #include "paramdesc.h"
42 #include "releases.h"
43
44 #include "valuenode_const.h"
45 #include "valuenode_linear.h"
46 #include "valuenode_composite.h"
47 #include "valuenode_reference.h"
48 #include "valuenode_greyed.h"
49 #include "valuenode_scale.h"
50 #include "valuenode_blinecalctangent.h"
51 #include "valuenode_blinecalcvertex.h"
52 #include "valuenode_blinecalcwidth.h"
53 #include "valuenode_blinereversetangent.h"
54 #include "valuenode_segcalctangent.h"
55 #include "valuenode_segcalcvertex.h"
56 #include "valuenode_repeat_gradient.h"
57 #include "valuenode_stripes.h"
58 #include "valuenode_range.h"
59 #include "valuenode_add.h"
60 #include "valuenode_subtract.h"
61 #include "valuenode_timedswap.h"
62 #include "valuenode_twotone.h"
63 #include "valuenode_bline.h"
64 #include "valuenode_dynamiclist.h"
65 #include "valuenode_radialcomposite.h"
66 #include "valuenode_gradientrotate.h"
67 #include "valuenode_sine.h"
68 #include "valuenode_cos.h"
69 #include "valuenode_atan2.h"
70 #include "valuenode_exp.h"
71 #include "valuenode_switch.h"
72 #include "valuenode_timeloop.h"
73 #include "valuenode_reciprocal.h"
74 #include "valuenode_duplicate.h"
75 #include "valuenode_integer.h"
76 #include "valuenode_step.h"
77 #include "valuenode_vectorangle.h"
78 #include "valuenode_vectorlength.h"
79 #include "valuenode_vectorx.h"
80 #include "valuenode_vectory.h"
81 #include "valuenode_gradientcolor.h"
82 #include "valuenode_dotproduct.h"
83 #include "valuenode_timestring.h"
84 #include "valuenode_realstring.h"
85 #include "valuenode_join.h"
86 #include "valuenode_anglestring.h"
87 #include "valuenode_intstring.h"
88 #include "valuenode_log.h"
89
90 #include "layer.h"
91
92 #endif
93
94 /* === U S I N G =========================================================== */
95
96 using namespace std;
97 using namespace etl;
98 using namespace synfig;
99
100 /* === M A C R O S ========================================================= */
101
102 /* === G L O B A L S ======================================================= */
103
104 static int value_node_count(0);
105
106 static LinkableValueNode::Book *book_;
107
108
109 ValueNode::LooseHandle
110 synfig::find_value_node(const GUID& guid)
111 {
112         return guid_cast<ValueNode>(guid);
113 }
114
115 /* === P R O C E D U R E S ================================================= */
116
117 /* === M E T H O D S ======================================================= */
118
119 bool
120 ValueNode::subsys_init()
121 {
122         book_=new LinkableValueNode::Book();
123
124 #define ADD_VALUENODE(class,name,local,version)                                                                                                 \
125         (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create);            \
126         (*book_)[name].check_type=&class::check_type;                                                                                           \
127         (*book_)[name].local_name=local;                                                                                                                        \
128         (*book_)[name].release_version=version
129
130 #define ADD_VALUENODE2(class,name,local,version)                                                                                                \
131         (*book_)[name].factory=reinterpret_cast<LinkableValueNode::Factory>(&class::create_from);       \
132         (*book_)[name].check_type=&class::check_type;                                                                                           \
133         (*book_)[name].local_name=local;                                                                                                                        \
134         (*book_)[name].release_version=version
135
136         ADD_VALUENODE(ValueNode_Linear,                   "linear",                       _("Linear"),                   RELEASE_VERSION_0_61_06);
137         ADD_VALUENODE(ValueNode_Composite,                "composite",            _("Composite"),                RELEASE_VERSION_0_61_06);
138         ADD_VALUENODE(ValueNode_RadialComposite,  "radial_composite", _("Radial Composite"), RELEASE_VERSION_0_61_06);
139         ADD_VALUENODE(ValueNode_Reference,                "reference",            _("Reference"),                RELEASE_VERSION_0_61_06);
140         ADD_VALUENODE(ValueNode_Scale,                    "scale",                        _("Scale"),                    RELEASE_VERSION_0_61_06);
141         ADD_VALUENODE(ValueNode_SegCalcTangent,   "segcalctangent",       _("Segment Tangent"),  RELEASE_VERSION_0_61_06);
142         ADD_VALUENODE(ValueNode_SegCalcVertex,    "segcalcvertex",        _("Segment Vertex"),   RELEASE_VERSION_0_61_06);
143         ADD_VALUENODE(ValueNode_Stripes,                  "stripes",              _("Stripes"),                  RELEASE_VERSION_0_61_06);
144         ADD_VALUENODE(ValueNode_Subtract,                 "subtract",             _("Subtract"),                 RELEASE_VERSION_0_61_06);
145         ADD_VALUENODE(ValueNode_TwoTone,                  "twotone",              _("Two-Tone"),                 RELEASE_VERSION_0_61_06);
146         ADD_VALUENODE(ValueNode_BLine,                    "bline",                        _("BLine"),                    RELEASE_VERSION_0_61_06);
147         ADD_VALUENODE2(ValueNode_DynamicList,     "dynamic_list",         _("Dynamic List"),     RELEASE_VERSION_0_61_06);
148         ADD_VALUENODE(ValueNode_GradientRotate,   "gradient_rotate",  _("Gradient Rotate"),      RELEASE_VERSION_0_61_06);
149         ADD_VALUENODE(ValueNode_Sine,                     "sine",                         _("Sine"),                     RELEASE_VERSION_0_61_06);
150
151         ADD_VALUENODE(ValueNode_TimedSwap,                "timed_swap",           _("Timed Swap"),               RELEASE_VERSION_0_61_07); // SVN r610
152         ADD_VALUENODE(ValueNode_Repeat_Gradient,  "repeat_gradient",  _("Repeat Gradient"),      RELEASE_VERSION_0_61_07); // SVN r666
153         ADD_VALUENODE(ValueNode_Exp,                      "exp",                          _("Exponential"),              RELEASE_VERSION_0_61_07); // SVN r739
154         ADD_VALUENODE(ValueNode_Add,                      "add",                          _("Add"),                              RELEASE_VERSION_0_61_07); // SVN r742
155         ADD_VALUENODE(ValueNode_BLineCalcTangent, "blinecalctangent", _("BLine Tangent"),        RELEASE_VERSION_0_61_07); // SVN r744
156         ADD_VALUENODE(ValueNode_BLineCalcVertex,  "blinecalcvertex",  _("BLine Vertex"),         RELEASE_VERSION_0_61_07); // SVN r744
157         ADD_VALUENODE(ValueNode_Range,                    "range",                        _("Range"),                    RELEASE_VERSION_0_61_07); // SVN r776
158
159         ADD_VALUENODE(ValueNode_Switch,                   "switch",                       _("Switch"),                   RELEASE_VERSION_0_61_08); // SVN r923
160         ADD_VALUENODE(ValueNode_Cos,                      "cos",                          _("Cos"),                              RELEASE_VERSION_0_61_08); // SVN r1111
161         ADD_VALUENODE(ValueNode_Atan2,                    "atan2",                        _("aTan2"),                    RELEASE_VERSION_0_61_08); // SVN r1132
162         ADD_VALUENODE(ValueNode_BLineRevTangent,  "blinerevtangent",  _("Reverse Tangent"),      RELEASE_VERSION_0_61_08); // SVN r1162
163         ADD_VALUENODE(ValueNode_TimeLoop,                 "timeloop",             _("Time Loop"),                RELEASE_VERSION_0_61_08); // SVN r1226
164         ADD_VALUENODE(ValueNode_Reciprocal,               "reciprocal",           _("Reciprocal"),               RELEASE_VERSION_0_61_08); // SVN r1238
165         ADD_VALUENODE(ValueNode_Duplicate,                "duplicate",            _("Duplicate"),                RELEASE_VERSION_0_61_08); // SVN r1267
166         ADD_VALUENODE(ValueNode_Integer,                  "fromint",              _("From Integer"),     RELEASE_VERSION_0_61_08); // SVN r1267
167         ADD_VALUENODE(ValueNode_Step,                     "step",                         _("Step"),                     RELEASE_VERSION_0_61_08); // SVN r1691
168         ADD_VALUENODE(ValueNode_BLineCalcWidth,   "blinecalcwidth",       _("BLine Width"),              RELEASE_VERSION_0_61_08); // SVN r1694
169
170         ADD_VALUENODE(ValueNode_VectorAngle,      "vectorangle",          _("Vector Angle"),     RELEASE_VERSION_0_61_09); // SVN r1880
171         ADD_VALUENODE(ValueNode_VectorLength,     "vectorlength",         _("Vector Length"),    RELEASE_VERSION_0_61_09); // SVN r1881
172         ADD_VALUENODE(ValueNode_VectorX,                  "vectorx",              _("Vector X"),                 RELEASE_VERSION_0_61_09); // SVN r1882
173         ADD_VALUENODE(ValueNode_VectorY,                  "vectory",              _("Vector Y"),                 RELEASE_VERSION_0_61_09); // SVN r1882
174         ADD_VALUENODE(ValueNode_GradientColor,    "gradientcolor",        _("Gradient Color"),   RELEASE_VERSION_0_61_09); // SVN r1885
175         ADD_VALUENODE(ValueNode_DotProduct,               "dotproduct",           _("Dot Product"),              RELEASE_VERSION_0_61_09); // SVN r1891
176         ADD_VALUENODE(ValueNode_TimeString,               "timestring",           _("Time String"),              RELEASE_VERSION_0_61_09); // SVN r2000
177         ADD_VALUENODE(ValueNode_RealString,               "realstring",           _("Real String"),              RELEASE_VERSION_0_61_09); // SVN r2003
178         ADD_VALUENODE(ValueNode_Join,                     "join",                         _("Joined List"),              RELEASE_VERSION_0_61_09); // SVN r2007
179         ADD_VALUENODE(ValueNode_AngleString,      "anglestring",          _("Angle String"),     RELEASE_VERSION_0_61_09); // SVN r2010
180         ADD_VALUENODE(ValueNode_IntString,                "intstring",            _("Int String"),               RELEASE_VERSION_0_61_09); // SVN r2010
181         ADD_VALUENODE(ValueNode_Logarithm,                "logarithm",            _("Logarithm"),                RELEASE_VERSION_0_61_09); // SVN r2034
182
183         ADD_VALUENODE(ValueNode_Greyed,                   "greyed",                       _("Greyed"),                   RELEASE_VERSION_0_61_10); // SVN r2305
184
185 #undef ADD_VALUENODE
186 #undef ADD_VALUENODE2
187
188         return true;
189 }
190
191 bool
192 ValueNode::subsys_stop()
193 {
194         delete book_;
195 /*      if(global_value_node_map.size() || value_node_count)
196         {
197                 if(value_node_count)
198                         synfig::error("%d ValueNodes haven't been destroyed yet!",value_node_count);
199
200                 if(global_value_node_map.size()!=value_node_count)
201                         synfig::error("value node count mismatch! map.size()!=value_node_count (%d!=%d)",global_value_node_map.size(),value_node_count);
202
203                 GlobalValueNodeMap::iterator iter;
204                 for(iter=global_value_node_map.begin();iter!=global_value_node_map.end();++iter)
205                 {
206                         if(!iter->second->is_exported())
207                                 synfig::info(_("%s: count:%d name:%s type:%s"),
208                                         iter->first.get_string().c_str(),
209                                         iter->second->count(),
210                                         iter->second->get_name().c_str(),
211                                         ValueBase::type_local_name(iter->second->get_type()).c_str()
212                                 );
213                         else
214                                 synfig::info(_("%s: id:%s count:%d name:%s type:%s"),
215                                         iter->first.get_string().c_str(),
216                                         iter->second->get_id().c_str(),
217                                         iter->second->count(),
218                                         iter->second->get_name().c_str(),
219                                         ValueBase::type_local_name(iter->second->get_type()).c_str()
220                                 );
221                 }
222         }
223 */
224         return true;
225 }
226
227 ValueNode::ValueNode(ValueBase::Type type):type(type)
228 {
229         value_node_count++;
230 }
231
232 LinkableValueNode::Book&
233 LinkableValueNode::book()
234 {
235         return *book_;
236 }
237
238 LinkableValueNode::Handle
239 LinkableValueNode::create(const String &name, const ValueBase& x)
240 {
241         if(!book().count(name))
242                 return 0;
243
244         if (!check_type(name, x.get_type()) &&
245                 // the Duplicate ValueNode is an exception - we don't want the
246                 // user creating it for themselves, so check_type() fails for
247                 // it even when it is valid
248                 !(name == "duplicate" && x.get_type() == ValueBase::TYPE_REAL))
249         {
250                 error(_("Bad type: ValueNode '%s' doesn't accept type '%s'"), book()[name].local_name.c_str(), ValueBase::type_local_name(x.get_type()).c_str());
251                 return 0;
252         }
253
254         return book()[name].factory(x);
255 }
256
257 bool
258 LinkableValueNode::check_type(const String &name, ValueBase::Type x)
259 {
260         if(!book().count(name) || !book()[name].check_type)
261                 return false;
262         return book()[name].check_type(x);
263 }
264
265 bool
266 LinkableValueNode::set_link(int i,ValueNode::Handle x)
267 {
268         ValueNode::Handle previous(get_link(i));
269
270         if(set_link_vfunc(i,x))
271         {
272                 if(previous)
273                         remove_child(previous.get());
274                 add_child(x.get());
275
276                 if(!x->is_exported() && get_parent_canvas())
277                 {
278                         x->set_parent_canvas(get_parent_canvas());
279                 }
280                 changed();
281                 return true;
282         }
283         return false;
284 }
285
286 ValueNode::LooseHandle
287 LinkableValueNode::get_link(int i)const
288 {
289         return get_link_vfunc(i);
290 }
291
292 void
293 LinkableValueNode::unlink_all()
294 {
295         for(int i=0;i<link_count();i++)
296         {
297                 ValueNode::LooseHandle value_node(get_link(i));
298                 if(value_node)
299                         value_node->parent_set.erase(this);
300         }
301 }
302
303 ValueNode::~ValueNode()
304 {
305         value_node_count--;
306
307         begin_delete();
308 }
309
310 void
311 ValueNode::on_changed()
312 {
313         etl::loose_handle<Canvas> parent_canvas = get_parent_canvas();
314         if(parent_canvas)
315                 do                                              // signal to all the ancestor canvases
316                         parent_canvas->signal_value_node_changed()(this);
317                 while (parent_canvas = parent_canvas->parent());
318         else if(get_root_canvas())
319                 get_root_canvas()->signal_value_node_changed()(this);
320
321         Node::on_changed();
322 }
323
324 int
325 ValueNode::replace(etl::handle<ValueNode> x)
326 {
327         if(x.get()==this)
328                 return 0;
329
330         while(parent_set.size())
331         {
332                 (*parent_set.begin())->add_child(x.get());
333                 (*parent_set.begin())->remove_child(this);
334                 //x->parent_set.insert(*parent_set.begin());
335                 //parent_set.erase(parent_set.begin());
336         }
337         int r(RHandle(this).replace(x));
338         x->changed();
339         return r;
340 }
341
342 void
343 ValueNode::set_id(const String &x)
344 {
345         if(name!=x)
346         {
347                 name=x;
348                 signal_id_changed_();
349         }
350 }
351
352 String
353 ValueNode::get_description(bool show_exported_name)const
354 {
355         String ret(_("ValueNode"));
356
357         if (dynamic_cast<const LinkableValueNode*>(this))
358                 return (dynamic_cast<const LinkableValueNode*>(this))->get_description(-1, show_exported_name);
359
360         if (show_exported_name && !is_exported())
361                 show_exported_name = false;
362
363         if (show_exported_name)
364                 ret += strprintf(" (%s)", get_id().c_str());
365
366         return ret;
367 }
368
369 ValueNodeList::ValueNodeList():
370         placeholder_count_(0)
371 {
372 }
373
374 bool
375 ValueNodeList::count(const String &id)const
376 {
377         const_iterator iter;
378
379         if(id.empty())
380                 return false;
381
382         for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
383                 ;
384
385         if(iter==end())
386                 return false;
387
388         return true;
389 }
390
391 ValueNode::Handle
392 ValueNodeList::find(const String &id)
393 {
394         iterator iter;
395
396         if(id.empty())
397                 throw Exception::IDNotFound("Empty ID");
398
399         for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
400                 ;
401
402         if(iter==end())
403                 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
404
405         return *iter;
406 }
407
408 ValueNode::ConstHandle
409 ValueNodeList::find(const String &id)const
410 {
411         const_iterator iter;
412
413         if(id.empty())
414                 throw Exception::IDNotFound("Empty ID");
415
416         for(iter=begin();iter!=end() && id!=(*iter)->get_id();++iter)
417                 ;
418
419         if(iter==end())
420                 throw Exception::IDNotFound("ValueNode in ValueNodeList: "+id);
421
422         return *iter;
423 }
424
425 ValueNode::Handle
426 ValueNodeList::surefind(const String &id)
427 {
428         if(id.empty())
429                 throw Exception::IDNotFound("Empty ID");
430
431         ValueNode::Handle value_node;
432
433         try
434         {
435                 value_node=find(id);
436         }
437         catch(Exception::IDNotFound)
438         {
439                 value_node=PlaceholderValueNode::create();
440                 value_node->set_id(id);
441                 push_back(value_node);
442                 placeholder_count_++;
443         }
444
445         return value_node;
446 }
447
448 bool
449 ValueNodeList::erase(ValueNode::Handle value_node)
450 {
451         assert(value_node);
452
453         iterator iter;
454
455         for(iter=begin();iter!=end();++iter)
456                 if(value_node.get()==iter->get())
457                 {
458                         std::list<ValueNode::RHandle>::erase(iter);
459                         if(PlaceholderValueNode::Handle::cast_dynamic(value_node))
460                                 placeholder_count_--;
461                         return true;
462                 }
463         return false;
464 }
465
466 bool
467 ValueNodeList::add(ValueNode::Handle value_node)
468 {
469         if(!value_node)
470                 return false;
471         if(value_node->get_id().empty())
472                 return false;
473
474         try
475         {
476                 ValueNode::RHandle other_value_node=find(value_node->get_id());
477                 if(PlaceholderValueNode::Handle::cast_dynamic(other_value_node))
478                 {
479                         other_value_node->replace(value_node);
480                         placeholder_count_--;
481                         return true;
482                 }
483
484                 return false;
485         }
486         catch(Exception::IDNotFound)
487         {
488                 push_back(value_node);
489                 return true;
490         }
491
492         return false;
493 }
494
495 void
496 ValueNodeList::audit()
497 {
498         iterator iter,next;
499
500         for(next=begin(),iter=next++;iter!=end();iter=next++)
501                 if(iter->count()==1)
502                         std::list<ValueNode::RHandle>::erase(iter);
503 }
504
505
506 String
507 PlaceholderValueNode::get_name()const
508 {
509         return "placeholder";
510 }
511
512 String
513 PlaceholderValueNode::get_local_name()const
514 {
515         return _("Placeholder");
516 }
517
518 ValueNode*
519 PlaceholderValueNode::clone(const GUID& deriv_guid)const
520 {
521         ValueNode* ret(new PlaceholderValueNode());
522         ret->set_guid(get_guid()^deriv_guid);
523         return ret;
524 }
525
526 PlaceholderValueNode::Handle
527 PlaceholderValueNode::create(ValueBase::Type type)
528 {
529         return new PlaceholderValueNode(type);
530 }
531
532 ValueBase
533 PlaceholderValueNode::operator()(Time /*t*/)const
534 {
535         assert(0);
536         return ValueBase();
537 }
538
539 PlaceholderValueNode::PlaceholderValueNode(ValueBase::Type type):
540         ValueNode(type)
541 {
542 }
543
544 ValueNode*
545 LinkableValueNode::clone(const GUID& deriv_guid)const
546 {
547         {
548                 ValueNode* x(find_value_node(get_guid()^deriv_guid).get());
549                 if(x)
550                         return x;
551         }
552
553         int i;
554         LinkableValueNode *ret=create_new();
555         ret->set_guid(get_guid()^deriv_guid);
556
557         for(i=0;i<link_count();i++)
558         {
559                 ValueNode::Handle link=get_link_vfunc(i);
560                 if(!link->is_exported())
561                 {
562                         ValueNode::LooseHandle value_node(find_value_node(link->get_guid()^deriv_guid));
563                         if(!value_node)
564                                 value_node=link->clone(deriv_guid);
565                         ret->set_link(i,value_node);
566                 }
567                 else
568                         ret->set_link(i,link);
569         }
570
571         return ret;
572 }
573
574 String
575 ValueNode::get_relative_id(etl::loose_handle<const Canvas> x)const
576 {
577         assert(is_exported());
578         assert(canvas_);
579
580         if(x.get()==canvas_.get())
581                 return get_id();
582
583         return canvas_->_get_relative_id(x)+':'+get_id();
584 }
585
586 void
587 ValueNode::set_parent_canvas(etl::loose_handle<Canvas> x)
588 {
589         canvas_=x; if(x) root_canvas_=x->get_root();
590 }
591
592 void
593 ValueNode::set_root_canvas(etl::loose_handle<Canvas> x)
594 {
595         root_canvas_=x->get_root();
596 }
597
598 void LinkableValueNode::get_times_vfunc(Node::time_set &set) const
599 {
600         ValueNode::LooseHandle  h;
601
602         int size = link_count();
603
604         //just add it to the set...
605         for(int i=0; i < size; ++i)
606         {
607                 h = get_link(i);
608
609                 if(h)
610                 {
611                         const Node::time_set &tset = h->get_times();
612                         set.insert(tset.begin(),tset.end());
613                 }
614         }
615 }
616
617 String
618 LinkableValueNode::get_description(int index, bool show_exported_name)const
619 {
620         String description;
621
622         if (index == -1)
623         {
624                 if (show_exported_name && is_exported())
625                         description += strprintf(" (%s)", get_id().c_str());
626         }
627         else
628         {
629                 description = String(":") + link_local_name(index);
630
631                 if (show_exported_name)
632                 {
633                         ValueNode::LooseHandle link(get_link(index));
634                         if (link->is_exported())
635                                 description += strprintf(" (%s)", link->get_id().c_str());
636                 }
637         }
638
639         const synfig::Node* node = this;
640         LinkableValueNode::ConstHandle parent_linkable_vn = 0;
641
642         // walk up through the valuenodes trying to find the layer at the top
643         while (!node->parent_set.empty() && !dynamic_cast<const Layer*>(node))
644         {
645                 LinkableValueNode::ConstHandle linkable_value_node(dynamic_cast<const LinkableValueNode*>(node));
646                 if (linkable_value_node)
647                 {
648                         String link;
649                         int cnt = linkable_value_node->link_count();
650                         for (int i = 0; i < cnt; i++)
651                                 if (linkable_value_node->get_link(i) == parent_linkable_vn)
652                                 {
653                                         link = String(":") + linkable_value_node->link_local_name(i);
654                                         break;
655                                 }
656
657                         description = linkable_value_node->get_local_name() + link + (parent_linkable_vn?">":"") + description;
658                 }
659                 node = *node->parent_set.begin();
660                 parent_linkable_vn = linkable_value_node;
661         }
662
663         Layer::ConstHandle parent_layer(dynamic_cast<const Layer*>(node));
664         if(parent_layer)
665         {
666                 String param;
667                 const Layer::DynamicParamList &dynamic_param_list(parent_layer->dynamic_param_list());
668                 // loop to find the parameter in the dynamic parameter list - this gives us its name
669                 for (Layer::DynamicParamList::const_iterator iter = dynamic_param_list.begin(); iter != dynamic_param_list.end(); iter++)
670                         if (iter->second == parent_linkable_vn)
671                                 param = String(":") + parent_layer->get_param_local_name(iter->first);
672                 description = strprintf("(%s)%s>%s",
673                                                                 parent_layer->get_non_empty_description().c_str(),
674                                                                 param.c_str(),
675                                                                 description.c_str());
676         }
677
678         return description;
679 }