DynParaLoop.cxx

Go to the documentation of this file.

// Copyright (C) 2006-2025  CEA, EDF
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
//
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
 
#include "DynParaLoop.hxx"
#include "LinkInfo.hxx"
#include "OutPort.hxx"
#include "Container.hxx"
#include "ComponentInstance.hxx"
#include "ServiceNode.hxx"
#include "InlineNode.hxx"
#include "ElementaryNode.hxx"
#include "Visitor.hxx"
 
#include <list>
#include <vector>
 
//#define _DEVDEBUG_
#include "YacsTrace.hxx"
 
using namespace std;
using namespace YACS::ENGINE;
 
const char DynParaLoop::NAME_OF_SPLITTED_SEQ_OUT[] = "evalSamples";
const char DynParaLoop::OLD_NAME_OF_SPLITTED_SEQ_OUT[] = "SmplPrt"; // For backward compatibility with 5.1.4
 
DynParaLoop::DynParaLoop(const std::string& name, TypeCode *typeOfDataSplitted, std::unique_ptr<NbBranchesAbstract>&& branchManager)
  : ComposedNode(name),_node(0),_initNode(0),_finalizeNode(0),_nbOfEltConsumed(0),
    _nbOfBranches(std::move(branchManager)),
    _splittedPort(NAME_OF_SPLITTED_SEQ_OUT,this,typeOfDataSplitted),_initializingCounter(0),_unfinishedCounter(0),_failedCounter(0),_weight(), _loopWeight(0)
{
  _weight.setDefaultLoop();
}
 
DynParaLoop::~DynParaLoop()
{
  delete _node;
  delete _initNode;
  delete _finalizeNode;
}
 
DynParaLoop::DynParaLoop(const DynParaLoop& other, ComposedNode *father, bool editionOnly)
  : ComposedNode(other,father),_nbOfBranches(other._nbOfBranches->copy(this)),
    _splittedPort(other._splittedPort,this), _node(0), _initNode(0), _finalizeNode(0),
    _nbOfEltConsumed(0),_initializingCounter(0),_unfinishedCounter(0),_failedCounter(0),_weight(other._weight), _loopWeight(other._loopWeight)
{
  if(other._node)
    _node=other._node->clone(this,editionOnly);
  if(other._initNode)
    _initNode=other._initNode->clone(this,editionOnly);
  if(other._finalizeNode)
    _finalizeNode = other._finalizeNode->clone(this,editionOnly);
  const AnyOutputPort& startOfLinksToReproduce=other._splittedPort;
  set<InPort *> endsOfLinksToReproduce=startOfLinksToReproduce.edSetInPort();
  for(set<InPort *>::iterator iter=endsOfLinksToReproduce.begin();iter!=endsOfLinksToReproduce.end();iter++)
    edAddLink(&_splittedPort,getInPort(other.getPortName(*iter)));
}
 
Node *DynParaLoop::edSetNode(Node *node)
{
  return checkConsistencyAndSetNode(_node, node);
}
 
Node * DynParaLoop::checkConsistencyAndSetNode(Node* &nodeToReplace, Node* node)
{
  if (node == NULL || nodeToReplace == node)
    return 0;
  if (node->_father)
    throw Exception(string("Can't set node: node ") + node->getName() + " is not orphan.");
  if (_node && _node != nodeToReplace && _node->getName() == node->getName())
    throw Exception(string("Can't set node: node ") + node->getName() +
                    " has the same name than exec node already in " + _name + ".");
  if (_initNode && _initNode != nodeToReplace && _initNode->getName() == node->getName())
    throw Exception(string("Can't set node: node ") + node->getName() +
                    " has the same name than init node already in " + _name + ".");
  if (_finalizeNode && _finalizeNode != nodeToReplace && _finalizeNode->getName() == node->getName())
    throw Exception(string("Can't set node: node ") + node->getName() +
                    " has the same name than finalize node already in " + _name + ".");
  checkNoCrossHierachyWith(node);
  ComposedNode::edRemoveChild(nodeToReplace);
  Node * ret = nodeToReplace;
  nodeToReplace = node;
  nodeToReplace->_father = this;
  // set _modified flag so that edUpdateState can refresh state
  modified();
  return ret;
}
 
void DynParaLoop::init(bool start)
{
  ComposedNode::init(start);
  if(!_node)
    {
      string what("DynParaLoop::init : no node specified for ForEachLoop with name "); what +=_name;
      throw Exception(what);
    }
  _node->init(start);
  if (_initNode) _initNode->init(start);
  if (_finalizeNode) _finalizeNode->init(start);
  _nbOfBranches->exInit(start);
  _splittedPort.exInit();
  _nbOfEltConsumed=0;
  _failedCounter=0;
}
 
Node *DynParaLoop::edSetInitNode(Node *node)
{
  return checkConsistencyAndSetNode(_initNode, node);
}
 
Node * DynParaLoop::edSetFinalizeNode(Node * node)
{
  return checkConsistencyAndSetNode(_finalizeNode, node);
}
 
 
bool DynParaLoop::edAddDFLink(OutPort *start, InPort *end)
{
  return edAddLink(start,end);
}
 
int DynParaLoop::getNumberOfInputPorts() const
{
  return ComposedNode::getNumberOfInputPorts()+1;
}
 
int DynParaLoop::getNumberOfOutputPorts() const
{
  return ComposedNode::getNumberOfOutputPorts()+1;
}
 
int DynParaLoop::getBranchIDOfNode(Node *node) const
{
  if(_node)
    {
      for(std::vector<Node *>::const_iterator it=_execNodes.begin();it!=_execNodes.end();it++)
        if(node==*it)
          return std::distance(_execNodes.begin(),it);
    }
  if(_finalizeNode)
    {
      for(std::vector<Node *>::const_iterator it=_execFinalizeNodes.begin();it!=_execFinalizeNodes.end();it++)
        if(node==*it)
          return std::distance(_execFinalizeNodes.begin(),it);
    }
  if(_initNode)
    {
      for(std::vector<Node *>::const_iterator it=_execInitNodes.begin();it!=_execInitNodes.end();it++)
        if(node==*it)
          return std::distance(_execInitNodes.begin(),it);
    }
  return -1;
}
 
std::list<OutputPort *> DynParaLoop::getSetOfOutputPort() const
{
  list<OutputPort *> ret=ComposedNode::getSetOfOutputPort();
  ret.push_back((OutputPort *)&_splittedPort);
  return ret;
}
 
std::list<OutputPort *> DynParaLoop::getLocalOutputPorts() const
{
  list<OutputPort *> ret=ComposedNode::getLocalOutputPorts();
  ret.push_back((OutputPort *)&_splittedPort);
  return ret;
}
 
OutPort *DynParaLoop::getOutPort(const std::string& name) const
{
  if (name == NAME_OF_SPLITTED_SEQ_OUT || name == OLD_NAME_OF_SPLITTED_SEQ_OUT)
    return (OutPort *)&_splittedPort;
  return ComposedNode::getOutPort(name);
}
 
 
OutputPort *DynParaLoop::getOutputPort(const std::string& name) const
{
  if (name == NAME_OF_SPLITTED_SEQ_OUT || name == OLD_NAME_OF_SPLITTED_SEQ_OUT)
    return (OutputPort *)&_splittedPort;
  return ComposedNode::getOutputPort(name);
}
 
bool DynParaLoop::isPlacementPredictableB4Run() const
{
  return false;
}
 
Node *DynParaLoop::edRemoveNode()
{
  return removeNode(_node);
}
 
Node * DynParaLoop::removeNode(Node* &nodeToRemove)
{
  if (!nodeToRemove)
    return NULL;
  ComposedNode::edRemoveChild(nodeToRemove);
  Node * ret = nodeToRemove;
  nodeToRemove = NULL;
  modified();
  return ret;
}
 
Node *DynParaLoop::edRemoveInitNode()
{
  return removeNode(_initNode);
}
 
Node * DynParaLoop::edRemoveFinalizeNode()
{
  return removeNode(_finalizeNode);
}
 
void DynParaLoop::edRemoveChild(Node *node)
{
  ComposedNode::edRemoveChild(node);
  if(node==_node)
    _node=0;
  if(node==_initNode)
    _initNode=0;
  if(node==_finalizeNode)
    _finalizeNode=0;
  modified();
}
 
bool DynParaLoop::edAddChild(Node *DISOWNnode)
{
  return edSetNode(DISOWNnode);
}
 
std::list<Node *> DynParaLoop::edGetDirectDescendants() const
{
  list<Node *> ret;
  if(_node)
    ret.push_back(_node);
  if(_initNode)
    ret.push_back(_initNode);
  if(_finalizeNode)
    ret.push_back(_finalizeNode);
  return ret;
}
 
std::list<InputPort *> DynParaLoop::getSetOfInputPort() const
{
  list<InputPort *> ret=ComposedNode::getSetOfInputPort();
  InputPort *port(_nbOfBranches->getPort());
  if(port)
    ret.push_back(port);
  return ret;
}
 
InputPort *DynParaLoop::getInputPort(const std::string& name) const
{
  if(_nbOfBranches->isMyName(name))
    return _nbOfBranches->getPort();
  return ComposedNode::getInputPort(name);
}
 
std::list<InputPort *> DynParaLoop::getLocalInputPorts() const
{
  list<InputPort *> ret=ComposedNode::getLocalInputPorts();
  InputPort *port(_nbOfBranches->getPort());
  if(port)
    ret.push_back(port);
  return ret;
}
 
unsigned DynParaLoop::getNumberOfBranchesCreatedDyn() const
{
  if(_execNodes.empty())
    throw Exception("ForEachLoop::getNumberOfBranches : No branches created dynamically ! - ForEachLoop needs to run or to be runned to call getNumberOfBranches");
  else
    return _execNodes.size();
}
 
Node *DynParaLoop::getChildByShortName(const std::string& name) const
{
  if (_node && name == _node->getName())
    return _node;
  if (_initNode && name == _initNode->getName())
    return  _initNode;
  if (_finalizeNode && name == _finalizeNode->getName())
    return  _finalizeNode;
  std::string what("node "); what+= name ; what+=" is not a child of DynParaLoop node "; what += getName();
  throw Exception(what);
}
 
Node *DynParaLoop::getChildByNameExec(const std::string& name, unsigned id) const
{
  if(id>=getNumberOfBranchesCreatedDyn())
    throw Exception("ForEachLoop::getChildByNameExec : invalid id - too large compared with dynamically created branches.");
  if (_node && name == _node->getName())
    return _execNodes[id];
  if (_initNode && name == _initNode->getName())
    return _execInitNodes[id];
  if (_finalizeNode && name == _finalizeNode->getName())
    return _execFinalizeNodes[id];
  std::string what("node "); what+= name ; what+=" is not a child of DynParaLoop node "; what += getName();
  throw Exception(what);
}
 
void DynParaLoop::cleanDynGraph()
{
  vector<Node *>::iterator iter;
  for(iter=_execNodes.begin() ; iter!=_execNodes.end() ; iter++)
    delete *iter;
  _execNodes.clear();
  for(iter=_execInitNodes.begin() ; iter!=_execInitNodes.end() ; iter++)
    delete *iter;
  _execInitNodes.clear();
  for(iter=_execFinalizeNodes.begin() ; iter!=_execFinalizeNodes.end() ; iter++)
    delete *iter;
  _execFinalizeNodes.clear();
}
 
void DynParaLoop::prepareInputsFromOutOfScope(int branchNb)
{
  set< InPort * > portsToSetVals=getAllInPortsComingFromOutsideOfCurrentScope();
 
  // This tweak is to fix problems with nested dynamic loops where links are not cloned properly
  list<InPort *> temp = getSetOfInPort();
  for(list<InPort *>::iterator iter2=temp.begin();iter2!=temp.end();iter2++)
    {
      if ((*iter2)->edSetOutPort().size() == 1 && *(*iter2)->edSetOutPort().begin() == NULL)
        {
          portsToSetVals.insert(*iter2);
        }
    }
 
  // local input ports are not candidates for dynamically duplicated inport.
  list<InputPort *> localPorts = getLocalInputPorts();
  for(list<InputPort *>::iterator iter = localPorts.begin() ; iter != localPorts.end() ; iter++)
    portsToSetVals.erase(*iter);
  for(set< InPort * >::iterator iter=portsToSetVals.begin();iter!=portsToSetVals.end();iter++)
    {
      InputPort *curPortCasted=(InputPort *) *iter;//Cast granted by ForEachLoop::buildDelegateOf(InPort)
      void *val=curPortCasted->get();
      InputPort *portToSet=getDynInputPortByAbsName(branchNb,getInPortName(*iter),true);
      if(portToSet)//portToSet==0 in case of portToSet==_splitterNode._dataPortToDispatch of ForEach
        {
          portToSet->put((const void *)val);
          portToSet->edNotifyReferencedBy(nullptr,false);//This is to indicate that somewhere somebody deals with this inputport
          //even if no direct physical link exists. This exclusively for _execNodes[branchNb]::init on the next turn of loop.
          //false is put as 2nd parameter to tell to portToSet, do not touch to the data in case of squeezeMemory.
        }
    }
}
 
void DynParaLoop::putValueOnBranch(Any *val, unsigned branchId, bool first)
{
  bool isDispatched = false;
  set<InPort *> inPrtLkdWthSplttdPrt=_splittedPort.edSetInPort();
  for(set<InPort *>::iterator iter=inPrtLkdWthSplttdPrt.begin();iter!=inPrtLkdWthSplttdPrt.end();iter++)
    {
      std::string portNameOnCurPrt=getPortName(*iter);
      InputPort *portOnGivenBranch=getDynInputPortByAbsName(branchId,portNameOnCurPrt,first);//Cast granted because impossible to have cross protocol with _splittedPort
      //see OptimizerLoop::buildDelegateOf
      if(portOnGivenBranch)
        {
          if(first)
            portOnGivenBranch->edNotifyReferencedBy(0);
          InputPort *traducer=getRuntime()->adapt(portOnGivenBranch,
                                                  Runtime::RUNTIME_ENGINE_INTERACTION_IMPL_NAME,_splittedPort.edGetType());
          traducer->put((const void *)val);
          isDispatched = true;
          if(traducer!=portOnGivenBranch)
            delete traducer;
        }
    }
  if ( isDispatched )
    {
      Any *tmp=val->clone();
      _splittedPort.setValue(tmp);
      tmp->decrRef();
    }
}
 
DynParaLoop::TypeOfNode DynParaLoop::getIdentityOfNotifyerNode(const Node *node, unsigned& id)
{
  vector<Node *>::iterator iter;
  id=0;
  for (iter=_execNodes.begin() ; iter!=_execNodes.end() ; iter++,id++)
    if (*iter==node)
      return WORK_NODE;
  id=0;
  for (iter=_execInitNodes.begin() ; iter!=_execInitNodes.end() ; iter++,id++)
    if (*iter==node)
      return INIT_NODE;
  id=0;
  for (iter=_execFinalizeNodes.begin() ; iter!=_execFinalizeNodes.end() ; iter++,id++)
    if (*iter==node)
      return FINALIZE_NODE;
  throw Exception("DynParaLoop::getIdentityOfNotifyerNode: unrecognized node !");
}
 
void DynParaLoop::setWeight(double loopWeight)
{
  if(loopWeight<=0.)
    throw Exception("DynParaLoop::setWeight : invalid input value !");
  _loopWeight=loopWeight;
}
 
ComplexWeight* DynParaLoop::getWeight()
{
  if (_loopWeight>0.)
    _weight.setLoopWeight(_loopWeight, _node->getMaxLevelOfParallelism()); // not done in setWeight because _node can be null at that time
  return &_weight;      
}
 
bool DynParaLoop::isMultiplicitySpecified(unsigned& value) const
{
  return _nbOfBranches->isMultiplicitySpecified(value);
}
 
void DynParaLoop::forceMultiplicity(unsigned value)
{
  _nbOfBranches->forceMultiplicity(value);
}
 
void DynParaLoop::buildDelegateOf(InPort * & port, OutPort *initialStart, const std::list<ComposedNode *>& pointsOfView)
{
  string typeOfPortInstance=port->getNameOfTypeOfCurrentInstance();
  if(typeOfPortInstance!=InputPort::NAME)
    throw Exception("DynParaLoop::buildDelegateOf : A link with datastream end inside DynParaLoop is not possible");
}
 
void DynParaLoop::buildDelegateOf(std::pair<OutPort *, OutPort *>& port, InPort *finalTarget, const std::list<ComposedNode *>& pointsOfView)
{
  std::string linkName("(");
  linkName += port.first->getName()+" to "+finalTarget->getName()+")";
  if(_initNode)
    if(isInMyDescendance(port.first->getNode())==_initNode)
      throw Exception(std::string("Illegal link within a parallel loop: \
a link starting from the init node can't leave the scope of the loop.")
                    + linkName);
 
  if(_finalizeNode)
    if(isInMyDescendance(port.first->getNode())==_finalizeNode)
      throw Exception(std::string("Illegal link within a parallel loop: \
an output port of the finalize node can't be linked.")
                    + linkName);
 
  if(port.first==&_splittedPort)
    throw Exception(std::string("Illegal link within a parallel loop: \
the 'evalSamples' port must be linked within the scope of the loop.")
                    + linkName);
}
 
void DynParaLoop::checkCFLinks(const std::list<OutPort *>& starts, InputPort *end, unsigned char& alreadyFed, bool direction, LinkInfo& info) const
{
  const char what[]="DynParaLoop::checkCFLinks : internal error.";
  //First dealing checkCFLinks forwarding...
  if(isInMyDescendance(end->getNode())==0)//no chance that _splittedPort is in starts due to buildDelegate.
    solveObviousOrDelegateCFLinks(starts,end,alreadyFed,direction,info);
  else
    {//no forwarding here.
      if(starts.size()!=1)
        throw Exception(what);
      //ASSERT(direction) : see DynParaLoop::checkControlDependancy only 'fw' filled.
      if(alreadyFed==FREE_ST)
        alreadyFed=FED_ST;
      else if(alreadyFed==FED_ST)
        {//Shame ! splittedPort fills a port already fed...
          info.pushInfoLink(*(starts.begin()),end,I_USELESS);
        }
    }
}
 
void DynParaLoop::checkControlDependancy(OutPort *start, InPort *end, bool cross,
                                         std::map < ComposedNode *,  std::list < OutPort * >, SortHierarc >& fw,
                                         std::vector<OutPort *>& fwCross,
                                         std::map< ComposedNode *, std::list < OutPort *>, SortHierarc >& bw,
                                         LinkInfo& info) const
{
    fw[(ComposedNode *)this].push_back(start);
}
 
void DynParaLoop::checkLinkPossibility(OutPort *start, const std::list<ComposedNode *>& pointsOfViewStart,
                                InPort *end, const std::list<ComposedNode *>& pointsOfViewEnd)
{
  ComposedNode::checkLinkPossibility(start, pointsOfViewStart, end, pointsOfViewEnd);
  Node * startNode = isInMyDescendance(start->getNode());
  Node * endNode = isInMyDescendance(end->getNode());
  std::string linkName("(");
  linkName += start->getName()+" to "+end->getName()+")";
  
  if(start == &_splittedPort && endNode != _node)
    throw Exception(std::string("Illegal link within a parallel loop: \
the 'evalSamples' port can only be connected to the working node of the loop.")
                    + linkName);
  
  if(_finalizeNode && _finalizeNode == startNode)
    throw Exception(std::string("Illegal link within a parallel loop: \
the finalize node can't be the origin of a link.")
                    + linkName);
  
  if(_initNode && _node == startNode && _initNode == endNode)
    throw Exception(std::string("Illegal link within a parallel loop: \
can't make a link from the working node to the init node.")
                    + linkName);
  
  if(_finalizeNode && _node == startNode && _finalizeNode == endNode)
    throw Exception(std::string("Illegal link within a parallel loop: \
can't make a link from the working node to the finalize node.")
                    + linkName);
}
 
InputPort *DynParaLoop::getDynInputPortByAbsName(int branchNb, const std::string& name, bool initNodeAdmitted)
{
  string portName, nodeName;
  splitNamesBySep(name,Node::SEP_CHAR_IN_PORT,nodeName,portName,true);
  Node *staticChild = getChildByName(nodeName);
  Node *desc=isInMyDescendance(staticChild);
  if(desc==_node)
    {
      splitNamesBySep(name,Node::SEP_CHAR_IN_PORT,nodeName,portName,false);
      return _execNodes[branchNb]->getInputPort(portName);
    }
  else if(desc==_initNode)
    if(initNodeAdmitted)
      {
        splitNamesBySep(name,Node::SEP_CHAR_IN_PORT,nodeName,portName,false);
        return _execInitNodes[branchNb]->getInputPort(portName);
      }
  return 0;
}
 
void DynParaLoop::checkBasicConsistency() const
{
  DEBTRACE("DynParaLoop::checkBasicConsistency");
  ComposedNode::checkBasicConsistency();
  if(!_node)
    throw Exception("For a dynamic loop, internal node is mandatory");
}
 
std::string DynParaLoop::getErrorReport()
{
  DEBTRACE("DynParaLoop::getErrorReport: " << getName() << " " << _state);
  YACS::StatesForNode effectiveState=getEffectiveState();
 
  if(effectiveState != YACS::INVALID &&  effectiveState != YACS::ERROR && effectiveState != YACS::FAILED)
    return "";
 
  std::string report="<error node= " + getName();
  switch(effectiveState)
    {
    case YACS::INVALID:
      report=report+" state= INVALID";
      break;
    case YACS::ERROR:
      report=report+" state= ERROR";
      break;
    case YACS::FAILED:
      report=report+" state= FAILED";
      break;
    default:
      break;
    }
  report=report + ">\n" ;
  if(_errorDetails != "")
    report=report+_errorDetails+"\n";
 
  if(_execNodes.empty())
    {
      // edition node
      list<Node *> constituents=edGetDirectDescendants();
      for(list<Node *>::iterator iter=constituents.begin(); iter!=constituents.end(); iter++)
        {
          std::string rep=(*iter)->getErrorReport();
          if(rep != "")
            {
              report=report+rep+"\n";
            }
        }
    }
  else
    {
      // execution nodes
      for(vector<Node *>::iterator iter=_execInitNodes.begin();iter!=_execInitNodes.end();iter++)
        {
          std::string rep=(*iter)->getErrorReport();
          if(rep != "")
            {
              report=report+rep+"\n";
            }
        }
      for(vector<Node *>::iterator iter=_execNodes.begin();iter!=_execNodes.end();iter++)
        {
          if(*iter)
            {
              std::string rep=(*iter)->getErrorReport();
              if(rep != "")
                {
                  report=report+rep+"\n";
                }
            }
        }
      for(vector<Node *>::iterator iter=_execFinalizeNodes.begin();iter!=_execFinalizeNodes.end();iter++)
        {
          std::string rep=(*iter)->getErrorReport();
          if(rep != "")
            {
              report=report+rep+"\n";
            }
        }
    }
 
  report=report+"</error>";
  return report;
}
 
void DynParaLoop::forwardExecStateToOriginalBody(Node *execNode)
{
  unsigned int id;
  Node * origNode = NULL;
  switch (getIdentityOfNotifyerNode(execNode,id))
    {
    case INIT_NODE:
    {
      origNode = _initNode;
      break;
    }
    case WORK_NODE:
    {
      origNode = _node;
      break;
    }
    case FINALIZE_NODE:
    {
      origNode = _finalizeNode;
      break;
    }
    default:
      YASSERT(false)
    }
 
  YASSERT(origNode != NULL)
  origNode->setState(execNode->getState());
  origNode->setErrorDetails(execNode->getErrorDetails());
 
  ComposedNode* compNode = dynamic_cast<ComposedNode*>(origNode);
  ComposedNode* compNodeExe = dynamic_cast<ComposedNode*>(execNode);
  if (compNode && compNodeExe)
    {
      list<Node *> aChldn = compNodeExe->getAllRecursiveConstituents();
      list<Node *>::iterator iter=aChldn.begin();
      for(;iter!=aChldn.end();iter++)
        {
          Node* node=compNode->getChildByName(compNodeExe->getChildName(*iter));
          node->setState((*iter)->getState());
          node->setErrorDetails((*iter)->getErrorDetails());
        }
    }
}
 
 
YACS::Event DynParaLoop::updateStateOnFailedEventFrom(Node *node, const Executor *execInst)
{
  DEBTRACE("DynParaLoop::updateStateOnFailedEventFrom " << node->getName());
  setState(YACS::FAILED);
  forwardExecStateToOriginalBody(node);
  unsigned int id;
  switch (getIdentityOfNotifyerNode(node,id))
    {
    case INIT_NODE:
    {
      _node->setState(YACS::FAILED);
      if (_finalizeNode != NULL) _finalizeNode->setState(YACS::FAILED);
      break;
    }
    case WORK_NODE:
    {
      if (_finalizeNode != NULL) _finalizeNode->setState(YACS::FAILED);
      break;
    }
    }
  return YACS::ABORT;
}
 
 
vector<Node *> DynParaLoop::cloneAndPlaceNodesCoherently(const vector<Node *> & origNodes)
{
  DEBTRACE("Begin cloneAndPlaceNodesCoherently")
  vector<Node *> clones;
  DeploymentTree treeToDup;
  vector<list<ElementaryNode *> > origElemNodeList;
  for (int i=0 ; i<origNodes.size() ; i++)
    {
      DEBTRACE("Cloning node " << i)
      if (origNodes[i] == NULL)
        {
          DEBTRACE("Cloning node " << i << ", NULL" )
          clones.push_back(NULL);
          origElemNodeList.push_back(list<ElementaryNode *>());
        }
      else
        {
          DEBTRACE("Cloning node " << i << "," << origNodes[i]->getName())
          clones.push_back(origNodes[i]->simpleClone(this, false));
          list<ElementaryNode *> tasks = origNodes[i]->getRecursiveConstituents();
          origElemNodeList.push_back(tasks);
          for (list< ElementaryNode *>::iterator iter=tasks.begin() ; iter!=tasks.end() ; iter++)
            treeToDup.appendTask(*iter, (*iter)->getDynClonerIfExists(this));
        }
    }
  
  // Build the links between clones.
  // Only the links starting from initNode are possible.
  if(_initNode)
  {
    std::vector< std::pair<OutPort *, InPort *> > outLinks = _initNode->getSetOfLinksLeavingCurrentScope();
    std::vector< std::pair<OutPort *, InPort *> >::const_iterator it;
    for(it=outLinks.begin(); it!=outLinks.end(); it++)
    {
      OutPort *startPort = it->first;
      InPort *endPort = it->second;
      Node* destNode = isInMyDescendance(endPort->getNode());
      if(destNode == _node)
        edAddLink(clones[0]->getOutPort(startPort->getName()),
                  clones[1]->getInPort(endPort->getName()));
      if(destNode == _finalizeNode)
        edAddLink(clones[0]->getOutPort(startPort->getName()),
                  clones[2]->getInPort(endPort->getName()));
    }
  }
 
  DEBTRACE("Placing nodes...")
  vector<Container *> conts=treeToDup.getAllContainers();
 
  //iterate on all containers
  for(vector<Container *>::iterator iterCt=conts.begin();iterCt!=conts.end();iterCt++)
    {
      DEBTRACE("Container " << ((*iterCt)?(*iterCt)->getName():"NULL"))
      vector<ComponentInstance *> comps=treeToDup.getComponentsLinkedToContainer(*iterCt);
      Container *contCloned=0;
      if((*iterCt))
        contCloned=(*iterCt)->clone();
 
      //iterate on all component instances linked to the container
      for(vector<ComponentInstance *>::iterator iterCp=comps.begin();iterCp!=comps.end();iterCp++)
        {
          DEBTRACE("Component " << (*iterCp)->getCompoName())
          vector<Task *> tasks=treeToDup.getTasksLinkedToComponent(*iterCp);
          ComponentInstance *curCloned=(*iterCp)->clone();
          DEBTRACE("Assign container " << (*iterCp)->getCompoName())
          curCloned->setContainer(contCloned);
          for(vector<Task *>::iterator iterT=tasks.begin();iterT!=tasks.end();iterT++)
            {
              DEBTRACE("Task " << ((ElementaryNode *)(*iterT))->getName())
              int i = 0;
              ElementaryNode * origElemNode = NULL;
              for (i=0 ; i<origNodes.size() ; i++)
                if (origNodes[i] != NULL)
                  {
                    DEBTRACE("Looking in original node " << i)
                    list<ElementaryNode *>::iterator res=find(origElemNodeList[i].begin(),
                                                              origElemNodeList[i].end(),
                                                              (ElementaryNode *)(*iterT));
                    if (res != origElemNodeList[i].end()) {
                      origElemNode = *res;
                      break;
                    }
                  }
 
              YASSERT(origElemNode != NULL)
              DEBTRACE("Found task in node " << i)
              ServiceNode * nodeC = NULL;
              if (origNodes[i] == origElemNode)
                nodeC = (ServiceNode *)clones[i];
              else
                {
                  string childName = ((ComposedNode *)origNodes[i])->getChildName(origElemNode);
                  nodeC = (ServiceNode *)clones[i]->getChildByName(childName);
                }
              DEBTRACE("Assign component: " << (*iterCp)->getCompoName() << "," << nodeC->getName())
              nodeC->setComponent(curCloned);
            }
          curCloned->decrRef();
        }
 
      // iterate on all tasks linked to the container
      vector<Task *> tasks=treeToDup.getTasksLinkedToContainer(*iterCt);
      for(vector<Task *>::iterator iterT=tasks.begin();iterT!=tasks.end();iterT++)
        {
          DEBTRACE("Task " << ((ElementaryNode *)(*iterT))->getName())
          int i = 0;
          ElementaryNode * origElemNode = NULL;
          for (i=0 ; i<origNodes.size() ; i++)
            if (origNodes[i] != NULL)
              {
                DEBTRACE("Looking in original node " << i)
                list<ElementaryNode *>::iterator res=find(origElemNodeList[i].begin(),
                                                          origElemNodeList[i].end(),
                                                          (ElementaryNode *)(*iterT));
                if (res != origElemNodeList[i].end()) 
                  {
                    origElemNode = *res;
                    break;
                  }
              }
          YASSERT(origElemNode != NULL)
          DEBTRACE("Found task in node " << i)
          InlineFuncNode * nodeC = NULL;
          if (origNodes[i] == origElemNode)
            {
              nodeC = (InlineFuncNode *)clones[i];
            }
          else
            {
              string childName = ((ComposedNode *)origNodes[i])->getChildName(origElemNode);
              nodeC = (InlineFuncNode *)clones[i]->getChildByName(childName);
            }
          DEBTRACE("Assign container " << nodeC->getName() << "," << contCloned->getName())
          nodeC->setContainer(contCloned);
        }
 
      // ended with current container
      if(contCloned)
        contCloned->decrRef();
    }
 
  DEBTRACE("End cloneAndPlaceNodesCoherently")
  return clones;
}
 
void DynParaLoop::accept(Visitor *visitor)
{
  visitor->visitDynParaLoop(this);
}
 
Node * DynParaLoop::getInitNode()
{
  return _initNode;
}
 
Node * DynParaLoop::getExecNode()
{
  return _node;
}
 
Node * DynParaLoop::getFinalizeNode()
{
  return _finalizeNode;
}
 
int DynParaLoop::getMaxLevelOfParallelism() const
{
  return _nbOfBranches->getIntValue() * _node->getMaxLevelOfParallelism();
}
 
void DynParaLoop::partitionRegardingDPL(const PartDefinition *pd, std::map<ComposedNode *, YACS::BASES::AutoRefCnt<PartDefinition> >& zeMap)
{
  YACS::BASES::AutoRefCnt<PartDefinition> pd2(pd->copy());
  zeMap[this]=pd2;
  if(_node)
    _node->partitionRegardingDPL(pd,zeMap);
}
 
void DynParaLoop::shutdown(int level)
{
  if(level==0)return;
  if(!_node) return;
 
  std::vector<Node *>::iterator iter;
  for (iter=_execNodes.begin() ; iter!=_execNodes.end() ; iter++)
    (*iter)->shutdown(level);
  for (iter=_execInitNodes.begin() ; iter!=_execInitNodes.end() ; iter++)
    (*iter)->shutdown(level);
  for (iter=_execFinalizeNodes.begin() ; iter!=_execFinalizeNodes.end() ; iter++)
    (*iter)->shutdown(level);
}