1 // Copyright (C) 2006-2015 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
21 #include "LinkInfo.hxx"
22 #include "InputPort.hxx"
23 #include "InputDataStreamPort.hxx"
24 #include "OutputPort.hxx"
25 #include "OutputDataStreamPort.hxx"
26 #include "ElementaryNode.hxx"
27 #include "Visitor.hxx"
33 #include "YacsTrace.hxx"
35 using namespace YACS::ENGINE;
38 /*! \class YACS::ENGINE::Bloc
39 * \brief Composed node to group elementary and composed nodes
44 Bloc::Bloc(const Bloc& other, ComposedNode *father, bool editionOnly):StaticDefinedComposedNode(other,father),_fwLinks(0),_bwLinks(0)
46 for(list<Node *>::const_iterator iter=other._setOfNode.begin();iter!=other._setOfNode.end();iter++)
47 _setOfNode.push_back((*iter)->simpleClone(this,editionOnly));
50 vector< pair<OutGate *, InGate *> > cfLinksToReproduce=other.getSetOfInternalCFLinks();
51 vector< pair<OutGate *, InGate *> >::iterator iter1=cfLinksToReproduce.begin();
52 for(;iter1!=cfLinksToReproduce.end();iter1++)
53 edAddCFLink(getChildByName(other.getChildName((*iter1).first->getNode())),getChildByName(other.getChildName((*iter1).second->getNode())));
55 //Data + DataStream linking
56 vector< pair<OutPort *, InPort *> > linksToReproduce=other.getSetOfInternalLinks();
57 vector< pair<OutPort *, InPort *> >::iterator iter2=linksToReproduce.begin();
58 for(;iter2!=linksToReproduce.end();iter2++)
60 OutPort* pout = iter2->first;
61 InPort* pin = iter2->second;
62 if(&other == getLowestCommonAncestor(pout->getNode(), pin->getNode()))
64 edAddLink(getOutPort(other.getPortName(pout)),getInPort(other.getPortName(pin)));
69 //! Create a Bloc node with a given name
71 * \param name : the given name
73 Bloc::Bloc(const std::string& name):StaticDefinedComposedNode(name),_fwLinks(0),_bwLinks(0)
79 for(list<Node *>::iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
85 //! Initialize the bloc
87 * \param start : a boolean flag indicating the kind of initialization
88 * If start is true, it's a complete initialization with reinitialization of port values
89 * If start is false, there is no initialization of port values
91 void Bloc::init(bool start)
94 for(list<Node *>::iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
98 //! Indicate if the bloc execution is finished
100 * The execution bloc is finished if all its child nodes
101 * are finished with or without error or if it is disabled (not to execute)
103 bool Bloc::isFinished()
105 if(_state==YACS::DONE)return true;
106 if(_state==YACS::ERROR)return true;
107 if(_state==YACS::FAILED)return true;
108 if(_state==YACS::DISABLED)return true;
112 int Bloc::getNumberOfCFLinks() const
115 for(list<Node *>::const_iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
116 ret+=(*iter)->getOutGate()->getNbOfInGatesConnected();
120 Node *Bloc::simpleClone(ComposedNode *father, bool editionOnly) const
122 return new Bloc(*this,father,editionOnly);
125 //! Collect all nodes that are ready to execute
127 * \param tasks : vector of tasks to collect ready nodes
129 void Bloc::getReadyTasks(std::vector<Task *>& tasks)
132 * ComposedNode state goes to ACTIVATED when one of its child has been ACTIVATED
133 * To change this uncomment the following line
134 * Then the father node will go to ACTIVATED state before its child node
136 if(_state==YACS::TOACTIVATE ) setState(YACS::ACTIVATED);
137 if(_state==YACS::TOACTIVATE || _state==YACS::ACTIVATED)
138 for(list<Node *>::iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
139 (*iter)->getReadyTasks(tasks);
142 //! Update the bloc state
144 * Update the '_state' attribute.
145 * Typically called by 'this->_inGate' when 'this->_inGate' is ready.
146 * Contrary to Node::exUpdateState no check done on inputs
147 * because internal linked DF inputports are not valid yet.
149 void Bloc::exUpdateState()
151 if(_state == YACS::DISABLED)return;
152 if(_state == YACS::DONE)return;
153 if(_inGate.exIsReady())
155 setState(YACS::ACTIVATED);
156 for(list<Node *>::iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
157 if((*iter)->exIsControlReady())
158 (*iter)->exUpdateState();
162 //! Add a child node to the bloc
164 * \param node: the node to add to the bloc
165 * \return a boolean flag indicating if the node has been added
167 * If node is already a direct child of current bloc, do nothing.
168 * If node is a child of another bloc, throw exception.
169 * If node name already used in bloc, throw exception.
170 * Publish inputPorts in current bloc and ancestors.
172 bool Bloc::edAddChild(Node *node) throw(YACS::Exception)
174 if(isNodeAlreadyAggregated(node))
176 if(node->_father==this)
180 string what = "Bloc::edAddChild : node "; what += node->getName();
181 what += " is already grand children of node";
182 throw Exception(what);
188 string what = "Bloc::edAddChild: node is not orphan: "; what += node->getName();
189 throw Exception(what);
192 checkNoCrossHierachyWith(node);
194 if(isNameAlreadyUsed(node->getName()))
196 string what("Bloc::edAddChild : name "); what+=node->getName();
197 what+=" already exists in the scope of "; what+=_name;
198 throw Exception(what);
202 _setOfNode.push_back(node);
203 //should we also set _modified flag for node ??
204 ComposedNode *iter=node->_father;
205 //set the _modified flag so that latter on edUpdateState (eventually called by isValid) refresh state
206 //better call it at end
212 * Remove 'node' from the set of direct children.
213 * @exception If 'node' is NOT the son of 'this'.
216 void Bloc::edRemoveChild(Node *node) throw(YACS::Exception)
218 StaticDefinedComposedNode::edRemoveChild(node);
219 list<Node *>::iterator iter=find(_setOfNode.begin(),_setOfNode.end(),node);
220 if(iter!=_setOfNode.end())
222 _setOfNode.erase(iter);
227 Node *Bloc::getChildByShortName(const std::string& name) const throw(YACS::Exception)
229 for (list<Node *>::const_iterator iter = _setOfNode.begin(); iter != _setOfNode.end(); iter++)
230 if ((*iter)->getName() == name)
232 string what("node "); what+= name ; what+=" is not a child of Bloc "; what += getName();
233 throw Exception(what);
236 bool Bloc::areAllSubNodesDone() const
238 for(list<Node *>::const_iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
240 if((*iter)->_state == YACS::DONE)continue;
241 if((*iter)->_state == YACS::DISABLED)continue;
247 bool Bloc::areAllSubNodesFinished() const
249 for(list<Node *>::const_iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
251 if((*iter)->_state == YACS::DONE)continue;
252 if((*iter)->_state == YACS::FAILED)continue;
253 if((*iter)->_state == YACS::DISABLED)continue;
254 if((*iter)->_state == YACS::ERROR)continue;
255 if((*iter)->_state == YACS::INTERNALERR)continue;
261 bool Bloc::isNameAlreadyUsed(const std::string& name) const
263 for(list<Node *>::const_iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
264 if((*iter)->getName()==name)
269 bool insertNodeChildrenInSet(Node *node, std::set<Node *>& nodeSet)
272 set<Node *> outNodes=node->getOutNodes();
273 for (set<Node *>::iterator iter=outNodes.begin();iter!=outNodes.end(); iter++)
275 verdict=(nodeSet.insert(*iter)).second;
276 if (verdict) verdict = insertNodeChildrenInSet((*iter),nodeSet);
282 * \note Checks that in the forest from 'node' there are NO back-edges.
283 * \b WARNING : When using this method 'node' has to be checked in order to be part of direct children of 'this'.
286 void Bloc::checkNoCyclePassingThrough(Node *node) throw(YACS::Exception)
288 set<Node *> currentNodesToTest;
289 //don't insert node to test in set.
290 //If it is present after insertion of connected nodes we have a loop
291 //collect all connected nodes
292 insertNodeChildrenInSet(node,currentNodesToTest);
294 if(!(currentNodesToTest.insert(node)).second)
295 throw Exception("Cycle has been detected",1);
298 std::vector< std::pair<OutGate *, InGate *> > Bloc::getSetOfInternalCFLinks() const
300 vector< pair<OutGate *, InGate *> > ret;
301 for(list<Node *>::const_iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
303 set<InGate *> outCFLinksOfCurNode=(*iter)->_outGate.edSetInGate();
304 for(set<InGate *>::iterator iter2=outCFLinksOfCurNode.begin();iter2!=outCFLinksOfCurNode.end();iter2++)
305 ret.push_back(pair<OutGate *, InGate *>(&(*iter)->_outGate,*iter2));
312 * @note : Runtime called method. Indirectly called by StaticDefinedComposedNode::updateStateFrom which has dispatch to this method
313 * 'when event == FINISH'.
314 * WARNING Precondition : '_state == Running' and 'node->_father==this'(garanteed by StaticDefinedComposedNode::notifyFrom)
316 * Calls the node's outgate OutGate::exNotifyDone if all nodes are not finished
318 YACS::Event Bloc::updateStateOnFinishedEventFrom(Node *node)
320 DEBTRACE("Bloc::updateStateOnFinishedEventFrom: " << node->getName());
321 //ASSERT(node->_father==this)
322 if(areAllSubNodesFinished())
324 setState(YACS::DONE);
325 if(!areAllSubNodesDone())
327 setState(YACS::FAILED);
330 return YACS::FINISH;//notify to father node that 'this' has becomed finished.
332 //more job to do in 'this' bloc
333 //Conversion exceptions can be thrown so catch them to control errors
336 //notify the finished node to propagate to its following nodes
337 node->exForwardFinished();
339 catch(YACS::Exception& ex)
341 //The node has failed to propagate. It must be put in error
342 DEBTRACE("Bloc::updateStateOnFinishedEventFrom: " << ex.what());
343 // notify the node it has failed
344 node->exForwardFailed();
345 setState(YACS::FAILED);
348 return YACS::NOEVENT;//no notification to father needed because from father point of view nothing happened.
351 //! Notify this bloc that a node has failed
353 * \param node : node that has emitted the event
354 * \return the event to notify to bloc's father
356 YACS::Event Bloc::updateStateOnFailedEventFrom(Node *node, const Executor *execInst)
358 node->exForwardFailed();
359 if(areAllSubNodesFinished())
361 setState(YACS::DONE);
362 if(!areAllSubNodesDone()){
363 setState(YACS::FAILED);
366 return YACS::FINISH;//notify to father node that 'this' has becomed finished.
368 return YACS::NOEVENT;
371 void Bloc::writeDot(std::ostream &os) const
373 os << " subgraph cluster_" << getId() << " {\n" ;
374 list<Node *>nodes=getChildren();
375 for(list<Node *>::const_iterator iter=nodes.begin();iter!=nodes.end();iter++)
377 (*iter)->writeDot(os);
378 string p=(*iter)->getId();
380 if((*iter)->_inGate._backLinks.size() == 0) os << getId() << " -> " << p << ";\n";
381 set<Node *>outnodes = (*iter)->getOutNodes();
382 for(set<Node *>::const_iterator itout=outnodes.begin();itout!=outnodes.end();itout++)
384 os << p << " -> " << (*itout)->getId() << ";\n";
388 os << getId() << "[fillcolor=\"" ;
389 YACS::StatesForNode state=getEffectiveState();
390 os << getColorState(state);
391 os << "\" label=\"" << "Bloc:" ;
392 os << getQualifiedName() <<"\"];\n";
395 void Bloc::accept(Visitor* visitor)
397 visitor->visitBloc(this);
401 * Returns the max level of parallelism is this. The max of parallelism is equal to the sum of the max parallelism level
402 * for all concurrent branches in \a this.
404 int Bloc::getMaxLevelOfParallelism() const
406 std::set<Node *> s(_setOfNode.begin(),_setOfNode.end());
407 for(std::set<Node *>::const_iterator it=s.begin();it!=s.end();it++)
408 (*it)->_colour=White;
409 std::vector<int> levs;
412 Node *seed(*(s.begin()));
417 std::set<InGate *> ingates(seed->getOutGate()->edSetInGate());
418 int myCurLev2(seed->getMaxLevelOfParallelism());
419 for(std::set<InGate *>::const_iterator it=ingates.begin();it!=ingates.end();it++)
421 Node *curNode((*it)->getNode());
422 curNode->_colour=Grey;
423 myCurLev2=std::max(curNode->getMaxLevelOfParallelism(),myCurLev2);
425 myCurLev=std::max(myCurLev,myCurLev2);
427 for(std::set<Node *>::const_iterator it=s.begin();it!=s.end();it++)
428 if((*it)->_colour==Grey)
434 levs.push_back(myCurLev);
436 return std::accumulate(levs.begin(),levs.end(),0);
440 * Updates mutable structures _fwLinks and _bwLinks with the result of computation (CPU consuming method).
441 * _fwLinks is a map with a Node* as key and a set<Node*> as value. The set gives
442 * all nodes that are forwardly connected to the key node
443 * _bwLinks is a map for backward dependencies
444 * The method is : for all CF link (n1->n2)
445 * add n2 and _fwLinks[n2] in forward dependencies of n1 and _bwLinks[n1]
446 * add n1 and _bwLinks[n1] in backward dependencies of n2 and _fwLinks[n2]
448 * If a node is already in a forward dependency when adding and the direct link
449 * already exists so it's a useless link (see the code !)
451 void Bloc::performCFComputations(LinkInfo& info) const
453 StaticDefinedComposedNode::performCFComputations(info);
454 delete _fwLinks;//Normally useless
455 delete _bwLinks;//Normally useless
456 _fwLinks=new map<Node *,set<Node *> >;
457 _bwLinks=new map<Node *,set<Node *> >;
459 //a set to store all CF links : used to find fastly if two nodes are connected
460 std::set< std::pair< Node*, Node* > > links;
462 for(list<Node *>::const_iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
465 std::set<InGate *> ingates=n1->getOutGate()->edSetInGate();
466 for(std::set<InGate *>::const_iterator it2=ingates.begin();it2!=ingates.end();it2++)
468 //CF link : n1 -> (*it2)->getNode()
469 Node* n2=(*it2)->getNode();
470 links.insert(std::pair< Node*, Node* >(n1,n2));
471 std::set<Node *> bwn1=(*_bwLinks)[n1];
472 std::set<Node *> fwn1=(*_fwLinks)[n1];
473 std::set<Node *> fwn2=(*_fwLinks)[n2];
474 std::set<Node *> bwn2=(*_bwLinks)[n2];
475 std::pair<std::set<Node*>::iterator,bool> ret;
476 for(std::set<Node *>::const_iterator iter2=bwn1.begin();iter2!=bwn1.end();iter2++)
478 for(std::set<Node *>::const_iterator it3=fwn2.begin();it3!=fwn2.end();it3++)
480 ret=(*_fwLinks)[*iter2].insert(*it3);
481 if(ret.second==false)
483 //dependency already exists (*iter2) -> (*it3) : if a direct link exists it's a useless one
484 if(links.find(std::pair< Node*, Node* >(*iter2,*it3)) != links.end())
485 info.pushUselessCFLink(*iter2,*it3);
488 ret=(*_fwLinks)[*iter2].insert(n2);
489 if(ret.second==false)
491 //dependency already exists (*iter2) -> n2 : if a direct link exists it's a useless one
492 if(links.find(std::pair< Node*, Node* >(*iter2,n2)) != links.end())
493 info.pushUselessCFLink(*iter2,n2);
496 for(std::set<Node *>::const_iterator it3=fwn2.begin();it3!=fwn2.end();it3++)
498 ret=(*_fwLinks)[n1].insert(*it3);
499 if(ret.second==false)
501 //dependency already exists n1 -> *it3 : if a direct link exists it's a useless one
502 if(links.find(std::pair< Node*, Node* >(n1,*it3)) != links.end())
503 info.pushUselessCFLink(n1,*it3);
506 ret=(*_fwLinks)[n1].insert(n2);
507 if(ret.second==false)
509 //dependency already exists n1 -> n2 : it's a useless link
510 info.pushUselessCFLink(n1,n2);
513 for(std::set<Node *>::const_iterator iter2=fwn2.begin();iter2!=fwn2.end();iter2++)
515 (*_bwLinks)[*iter2].insert(bwn1.begin(),bwn1.end());
516 (*_bwLinks)[*iter2].insert(n1);
518 (*_bwLinks)[n2].insert(bwn1.begin(),bwn1.end());
519 (*_bwLinks)[n2].insert(n1);
524 void Bloc::destructCFComputations(LinkInfo& info) const
526 StaticDefinedComposedNode::destructCFComputations(info);
527 delete _fwLinks; _fwLinks=0;
528 delete _bwLinks; _bwLinks=0;
532 * \b WARNING \b Needs call of performCFComputations before beeing called.
533 * Perform updates of containers regarding attributes of link 'start' -> 'end' and check the correct linking.
534 * The output is in info struct.
536 * \param start : start port
537 * \param end : end port
539 * \param fw out parameter being append if start -> end link is a forward link \b without cross type DF/DS.
540 * \param fwCross out parameter being append if start -> end link is a forward link \b with cross type DF/DS.
541 * \param bw out parameter being append if start -> end link is a backward link.
542 * \param info out parameter being informed about eventual errors.
544 void Bloc::checkControlDependancy(OutPort *start, InPort *end, bool cross,
545 std::map < ComposedNode *, std::list < OutPort * >, SortHierarc >& fw,
546 std::vector<OutPort *>& fwCross,
547 std::map< ComposedNode *, std::list < OutPort *>, SortHierarc >& bw,
548 LinkInfo& info) const
552 Node *startN=isInMyDescendance(start->getNode());
553 Node *endN=isInMyDescendance(end->getNode());
555 bw[(ComposedNode *)this].push_back(start);
556 else if(areLinked(startN,endN,true))
557 fw[(ComposedNode *)this].push_back(start);
559 if(areLinked(startN,endN,false))
560 bw[(ComposedNode *)this].push_back(start);
562 info.pushErrLink(start,end,E_UNPREDICTABLE_FED);
565 if(arePossiblyRunnableAtSameTime(isInMyDescendance(start->getNode()),isInMyDescendance(end->getNode())))
566 fwCross.push_back(start);
568 info.pushErrLink(start,end,E_DS_LINK_UNESTABLISHABLE);
571 //! Check if two nodes are linked
573 * 'start' and 'end' \b must be direct son of 'this'.
574 * Typically used for data link.
575 * \param start : start node
576 * \param end : end node
577 * \param fw indicates if it is a forward link searched (true : default value) or a backward link serach.
578 * \return if true or false
580 bool Bloc::areLinked(Node *start, Node *end, bool fw) const
582 set<Node *>& nexts=fw ? (*_fwLinks)[start] : (*_bwLinks)[start];
583 return nexts.find(end)!=nexts.end();
586 //! Check if two nodes can run in parallel
588 * Typically used for stream link.
589 * 'start' and 'end' \b must be direct son of 'this'.
590 * \param start : start node
591 * \param end : end node
592 * \return true or false
594 bool Bloc::arePossiblyRunnableAtSameTime(Node *start, Node *end) const
596 set<Node *>& nexts=(*_fwLinks)[start];
597 set<Node *>& preds=(*_bwLinks)[start];
598 return nexts.find(end)==nexts.end() && preds.find(end)==preds.end();
601 //! Check control flow links
603 * \param starts If different of 0, must aggregate at leat \b 1 element.
604 * \param end : end port
605 * \param alreadyFed in/out parameter. Indicates if 'end' ports is already and surely set or fed by an another port.
606 * \param direction If true : forward direction else backward direction.
607 * \param info : collected information
609 void Bloc::checkCFLinks(const std::list<OutPort *>& starts, InputPort *end, unsigned char& alreadyFed, bool direction, LinkInfo& info) const
611 if(alreadyFed==FREE_ST || alreadyFed==FED_ST)
613 map<Node *,list <OutPort *> > classPerNodes;
614 for(list< OutPort *>::const_iterator iter1=starts.begin();iter1!=starts.end();iter1++)
615 classPerNodes[isInMyDescendance((*iter1)->getNode())].push_back(*iter1);
616 set<Node *> allNodes;
617 for(map<Node *,list <OutPort *> >::iterator iter2=classPerNodes.begin();iter2!=classPerNodes.end();iter2++)
618 allNodes.insert((*iter2).first);
619 vector<Node *> okAndUseless1,useless2;
620 seekOkAndUseless1(okAndUseless1,allNodes);
621 seekUseless2(useless2,allNodes);//after this point allNodes contains collapses
622 verdictForOkAndUseless1(classPerNodes,end,okAndUseless1,alreadyFed,direction,info);
623 verdictForCollapses(classPerNodes,end,allNodes,alreadyFed,direction,info);
624 verdictForOkAndUseless1(classPerNodes,end,useless2,alreadyFed,direction,info);
626 else if(alreadyFed==FED_DS_ST)
627 for(list< OutPort *>::const_iterator iter1=starts.begin();iter1!=starts.end();iter1++)
628 info.pushErrLink(*iter1,end,E_COLLAPSE_DFDS);
631 void Bloc::initComputation() const
633 for(list<Node *>::const_iterator iter=_setOfNode.begin();iter!=_setOfNode.end();iter++)
635 (*iter)->_colour=White;
636 (*iter)->getInGate()->exReset();
637 (*iter)->getOutGate()->exReset();
642 * Part of final step for CF graph anylizing. This is the part of non collapse nodes.
645 * \param candidates :
646 * \param alreadyFed in/out parameter. Indicates if 'end' ports is already and surely set or fed by an another port.
648 * \param info : collected information
650 void Bloc::verdictForOkAndUseless1(const std::map<Node *,std::list <OutPort *> >& pool, InputPort *end,
651 const std::vector<Node *>& candidates, unsigned char& alreadyFed,
652 bool direction, LinkInfo& info)
654 for(vector<Node *>::const_iterator iter=candidates.begin();iter!=candidates.end();iter++)
656 const list<OutPort *>& mySet=(*pool.find(*iter)).second;
659 if(alreadyFed==FREE_ST)
661 alreadyFed=FED_ST;//This the final choice. General case !
663 info.pushInfoLink(*(mySet.begin()),end,I_BACK);
665 else if(alreadyFed==FED_ST)
666 info.pushInfoLink(*(mySet.begin()),end,direction ? I_USELESS : I_BACK_USELESS);//Second or more turn in case of alreadyFed==FREE_ST before call of this method
670 if(dynamic_cast<ElementaryNode *>(*iter))
673 if(alreadyFed==FREE_ST)
674 reason=direction ? W_COLLAPSE_EL : W_BACK_COLLAPSE_EL;
675 else if(alreadyFed==FED_ST)
676 reason=direction ? W_COLLAPSE_EL_AND_USELESS : W_BACK_COLLAPSE_EL_AND_USELESS;
677 for(list<OutPort *>::const_iterator iter2=mySet.begin();iter2!=mySet.end();iter2++)
678 info.pushWarnLink(*iter2,end,reason);
681 ((ComposedNode *)(*iter))->checkCFLinks(mySet,end,alreadyFed,direction,info);//Thanks to recursive model!
687 * Part of final step for CF graph anylizing. This is the part of collapses nodes.
690 * \param candidates :
691 * \param alreadyFed in/out parameter. Indicates if 'end' ports is already and surely set or fed by an another port.
693 * \param info : collected information
695 void Bloc::verdictForCollapses(const std::map<Node *,std::list <OutPort *> >& pool, InputPort *end,
696 const std::set<Node *>& candidates, unsigned char& alreadyFed,
697 bool direction, LinkInfo& info)
699 info.startCollapseTransac();
700 for(set<Node *>::const_iterator iter=candidates.begin();iter!=candidates.end();iter++)
702 const list<OutPort *>& mySet=(*pool.find(*iter)).second;
705 if(alreadyFed==FREE_ST)
706 info.pushWarnLink(*(mySet.begin()),end,direction ? W_COLLAPSE : W_BACK_COLLAPSE);
707 else if(alreadyFed==FED_ST)
708 info.pushWarnLink(*(mySet.begin()),end,direction ? W_COLLAPSE_AND_USELESS : W_BACK_COLLAPSE_EL_AND_USELESS);
712 if(dynamic_cast<ElementaryNode *>(*iter))
715 if(alreadyFed==FREE_ST)
716 reason=direction ? W_COLLAPSE_EL : W_BACK_COLLAPSE_EL;
717 else if(alreadyFed==FED_ST)
718 reason=direction ? W_COLLAPSE_EL_AND_USELESS : W_BACK_COLLAPSE_EL_AND_USELESS;
719 for(list<OutPort *>::const_iterator iter2=mySet.begin();iter2!=mySet.end();iter2++)
720 info.pushWarnLink(*iter2,end,reason);
724 ((ComposedNode *)(*iter))->checkCFLinks(mySet,end,alreadyFed,direction,info);//Thanks to recursive model!
726 if(alreadyFed==FREE_ST)
727 reason=direction ? W_COLLAPSE : W_BACK_COLLAPSE;
728 else if(alreadyFed==FED_ST)
729 reason=direction ? W_COLLAPSE_AND_USELESS : W_BACK_COLLAPSE_AND_USELESS;
730 for(list<OutPort *>::const_iterator iter2=mySet.begin();iter2!=mySet.end();iter2++)
731 info.pushWarnLink(*iter2,end,reason);
735 if(!candidates.empty())
736 if(alreadyFed==FREE_ST)
738 info.endCollapseTransac();
742 * \b WARNING use this method only after having called Bloc::performCFComputations method.
743 * \param okAndUseless1 out param contains at the end, the nodes without any collapse.
744 * \param allNodes in/out param. At the end, all the nodes in 'okAndUseless1' are deleted from 'allNodes'.
746 void Bloc::seekOkAndUseless1(std::vector<Node *>& okAndUseless1, std::set<Node *>& allNodes) const
748 set<Node *>::iterator iter=allNodes.begin();
749 while(iter!=allNodes.end())
751 set<Node *>& whereToFind=(*_bwLinks)[*iter];
752 std::set<Node *>::iterator iter2;
753 for(iter2=allNodes.begin();iter2!=allNodes.end();iter2++)
754 if((*iter)!=(*iter2))
755 if(whereToFind.find(*iter2)==whereToFind.end())
757 if(iter2!=allNodes.end())
761 okAndUseless1.push_back((*iter));
762 allNodes.erase(iter);
763 iter=allNodes.begin();
769 * \b WARNING use this method only after having called Bloc::performCFComputations method.
770 * For params see Bloc::seekOkAndUseless1.
772 void Bloc::seekUseless2(std::vector<Node *>& useless2, std::set<Node *>& allNodes) const
774 set<Node *>::iterator iter=allNodes.begin();
775 while(iter!=allNodes.end())
777 set<Node *>& whereToFind=(*_fwLinks)[*iter];
778 std::set<Node *>::iterator iter2;
779 for(iter2=allNodes.begin();iter2!=allNodes.end();iter2++)
780 if((*iter)!=(*iter2))
781 if(whereToFind.find(*iter2)==whereToFind.end())
783 if(iter2!=allNodes.end())
789 useless2.push_back((*iter));
790 allNodes.erase(iter);
791 iter=allNodes.begin();
797 * Internal method : Given a succeful path : updates 'fastFinder'
799 void Bloc::updateWithNewFind(const std::vector<Node *>& path, std::map<Node *, std::set<Node *> >& fastFinder)
803 vector<Node *>::const_iterator iter=path.begin(); iter++;
804 vector<Node *>::const_iterator iter2=path.end(); iter2-=1;
805 for(;iter!=iter2;iter++)
806 fastFinder[*iter].insert(*(iter+1));
811 * Internal method : After all paths have been found, useless CF links are searched
813 void Bloc::findUselessLinksIn(const std::list< std::vector<Node *> >& res , LinkInfo& info)
816 list< vector<Node *> >::const_iterator whereToPeerAt;
817 for(list< vector<Node *> >::const_iterator iter=res.begin();iter!=res.end();iter++)
818 if((*iter).size()>maxSize)
820 maxSize=(*iter).size();
826 vector<Node *>::const_iterator iter2=(*whereToPeerAt).begin();
827 map<Node *,bool>::iterator iter4;
828 set<Node *> searcher(iter2+1,(*whereToPeerAt).end());//to boost research
829 for(;iter2!=((*whereToPeerAt).end()-2);iter2++)
831 map<InGate *,bool>::iterator iter4;
832 map<InGate *,bool>& nexts=(*iter2)->getOutGate()->edMapInGate();
833 for(iter4=nexts.begin();iter4!=nexts.end();iter4++)
834 if((*iter4).first->getNode()!=*(iter2+1))
835 if(searcher.find((*iter4).first->getNode())!=searcher.end())
836 info.pushUselessCFLink(*iter2,(*iter4).first->getNode());
837 searcher.erase(*iter2);