X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=src%2Fengine%2FSwitch.cxx;h=2085096cbef0ef1685b433238bb3745828e2647b;hb=1894c52d0838df8676e770bef061fc23ca436452;hp=1c6b18ef0b77a0cfefa359425860bc37b2022f21;hpb=313a04631c63078d01c2f643a53500ec549d034e;p=modules%2Fyacs.git diff --git a/src/engine/Switch.cxx b/src/engine/Switch.cxx index 1c6b18ef0..2085096cb 100644 --- a/src/engine/Switch.cxx +++ b/src/engine/Switch.cxx @@ -1,3 +1,22 @@ +// Copyright (C) 2006-2024 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 "Switch.hxx" #include "Visitor.hxx" #include "LinkInfo.hxx" @@ -6,6 +25,9 @@ #include #include +//#define _DEVDEBUG_ +#include "YacsTrace.hxx" + using namespace YACS::ENGINE; using namespace std; @@ -38,7 +60,7 @@ std::string CollectorSwOutPort::getNameOfTypeOfCurrentInstance() const return _className; } -void CollectorSwOutPort::edRemoveAllLinksLinkedWithMe() throw(Exception) +void CollectorSwOutPort::edRemoveAllLinksLinkedWithMe() { map::iterator pt; if(_consumer) @@ -58,20 +80,21 @@ void CollectorSwOutPort::getAllRepresented(std::set& represented) con ((*pt).second)->getAllRepresented(represented); } -bool CollectorSwOutPort::addInPort(InPort *inPort) throw(Exception) +bool CollectorSwOutPort::addInPort(InPort *inPort) { + bool ret = false; if(_currentProducer) {//a specific link is beeing done - bool ret=_currentProducer->addInPort(inPort); + ret=_currentProducer->addInPort(inPort); _currentProducer=0; - return ret; } else//global links asked for(map::iterator iter=_potentialProducers.begin();iter!=_potentialProducers.end();iter++) - (*iter).second->addInPort(inPort); + ret |= (*iter).second->addInPort(inPort); + return ret; } -int CollectorSwOutPort::removeInPort(InPort *inPort, bool forward) throw(Exception) +int CollectorSwOutPort::removeInPort(InPort *inPort, bool forward) { if(_currentProducer) { @@ -91,7 +114,10 @@ CollectorSwOutPort::CollectorSwOutPort(Switch *master, InPort *port):OutPort("", Port(master), _consumer(port),_currentProducer(0) { - _name="Representant_of_"; _name+=master->getName(); _name+="_for_inport_"; _name+=master->getRootNode()->getInPortName(_consumer); + _name="Representant_of_"; + _name+=master->getName(); + _name+="_for_inport_"; + _name+=port->getName(); } CollectorSwOutPort::CollectorSwOutPort(const CollectorSwOutPort& other, Switch *master):OutPort("",master,other.edGetType()), @@ -158,7 +184,7 @@ bool CollectorSwOutPort::removePotentialProducerForMaster() return _potentialProducers.empty(); } -bool CollectorSwOutPort::checkManagementOfPort(OutPort *port) throw(Exception) +bool CollectorSwOutPort::checkManagementOfPort(OutPort *port) { for(map::iterator iter=_potentialProducers.begin();iter!=_potentialProducers.end();iter++) if((*iter).second==port) @@ -224,17 +250,11 @@ Node *FakeNodeForSwitch::simpleClone(ComposedNode *father, bool editionOnly) con void FakeNodeForSwitch::exForwardFailed() { _sw->exForwardFailed(); - FakeNodeForSwitch *normallyThis=_sw->_undispatchableNotificationNode; - _sw->_undispatchableNotificationNode=0; - delete normallyThis; } void FakeNodeForSwitch::exForwardFinished() { _sw->exForwardFinished(); - FakeNodeForSwitch *normallyThis=_sw->_undispatchableNotificationNode; - _sw->_undispatchableNotificationNode=0; - delete normallyThis; } void FakeNodeForSwitch::execute() @@ -256,6 +276,12 @@ void FakeNodeForSwitch::finished() _sw->setState(YACS::DONE); } +/*! \class YACS::ENGINE::Switch + * \brief Control node that emulates the C switch + * + * \ingroup Nodes + */ + Switch::Switch(const Switch& other, ComposedNode *father, bool editionOnly):StaticDefinedComposedNode(other,father),_condition(other._condition,this), _undispatchableNotificationNode(0) { @@ -275,6 +301,8 @@ Switch::Switch(const std::string& name):StaticDefinedComposedNode(name),_conditi Switch::~Switch() { + if(_undispatchableNotificationNode)delete _undispatchableNotificationNode; + for(map< int , Node * >::iterator iter=_mapOfNode.begin();iter!=_mapOfNode.end();iter++) delete (*iter).second; for(map::iterator iter2=_outPortsCollector.begin();iter2!=_outPortsCollector.end();iter2++) @@ -290,11 +318,12 @@ Node *Switch::simpleClone(ComposedNode *father, bool editionOnly) const void Switch::exUpdateState() { + DEBTRACE("Switch::exUpdateState " << _state); if(_state == YACS::DISABLED) return; if(_inGate.exIsReady()) { - setState(YACS::TOACTIVATE); + setState(YACS::ACTIVATED); if(_condition.isEmpty()) _undispatchableNotificationNode=new FakeNodeForSwitch(this,false,true); else @@ -320,6 +349,7 @@ void Switch::exUpdateState() void Switch::init(bool start) { + DEBTRACE("Switch::init " << start); StaticDefinedComposedNode::init(start); int i=0; for(map< int , Node * >::iterator iter=_mapOfNode.begin();iter!=_mapOfNode.end();iter++, i++) @@ -353,17 +383,13 @@ void Switch::getReadyTasks(std::vector& tasks) (*iter).second->getReadyTasks(tasks);//Default Node is returned else if(_undispatchableNotificationNode) - _undispatchableNotificationNode->getReadyTasks(tasks); + _undispatchableNotificationNode->getReadyTasks(tasks); else throw Exception("Switch::getReadyTasks : internal error"); } } } -void Switch::selectRunnableTasks(std::vector& tasks) -{ -} - list Switch::edGetDirectDescendants() const { list ret; @@ -378,7 +404,32 @@ int Switch::getNumberOfInputPorts() const return StaticDefinedComposedNode::getNumberOfInputPorts()+1; } -void Switch::edRemoveChild(Node *node) throw(Exception) +int Switch::getMaxLevelOfParallelism() const +{ + int ret(0); + for(std::map< int , Node * >::const_iterator it=_mapOfNode.begin();it!=_mapOfNode.end();it++) + ret=std::max(ret,((*it).second)->getMaxLevelOfParallelism()); + return ret; +} + +void Switch::getWeightRegardingDPL(ComplexWeight *weight) +{ + ComplexWeight localWeight; + for(std::map< int , Node * >::const_iterator it=_mapOfNode.begin();it!=_mapOfNode.end();it++) + { + ((*it).second)->getWeightRegardingDPL(&localWeight); + weight->max(localWeight); + localWeight.setToZero(); + } +} + +void Switch::partitionRegardingDPL(const PartDefinition *pd, std::map >& zeMap) +{ + for(std::map< int , Node * >::const_iterator it=_mapOfNode.begin();it!=_mapOfNode.end();it++) + (*it).second->partitionRegardingDPL(pd,zeMap); +} + +void Switch::edRemoveChild(Node *node) { map< int , Node * >::iterator iter=_mapOfNode.begin(); for(;iter!=_mapOfNode.end();iter++) @@ -405,7 +456,7 @@ std::list Switch::getLocalInputPorts() const ret.push_back((InputPort *)&_condition); return ret; } -OutPort *Switch::getOutPort(const std::string& name) const throw(Exception) +OutPort *Switch::getOutPort(const std::string& name) const { for(map::const_iterator iter=_outPortsCollector.begin();iter!=_outPortsCollector.end();iter++) if(name==(*iter).second->getName()) @@ -416,14 +467,14 @@ OutPort *Switch::getOutPort(const std::string& name) const throw(Exception) return StaticDefinedComposedNode::getOutPort(name); } -InputPort *Switch::getInputPort(const std::string& name) const throw(Exception) +InputPort *Switch::getInputPort(const std::string& name) const { if(name==SELECTOR_INPUTPORT_NAME) return (InputPort *)&_condition; return StaticDefinedComposedNode::getInputPort(name); } -Node *Switch::getChildByShortName(const std::string& name) const throw(Exception) +Node *Switch::getChildByShortName(const std::string& name) const { if(name==DEFAULT_NODE_NAME) { @@ -450,12 +501,12 @@ Node *Switch::edSetDefaultNode(Node *node) return edSetNode(ID_FOR_DEFAULT_NODE,node); } -Node *Switch::edReleaseDefaultNode() throw(Exception) +Node *Switch::edReleaseDefaultNode() { return edReleaseCase(ID_FOR_DEFAULT_NODE); } -Node *Switch::edReleaseCase(int caseId) throw(Exception) +Node *Switch::edReleaseCase(int caseId) { map< int , Node * >::iterator iter=_mapOfNode.find(caseId); if(iter==_mapOfNode.end()) @@ -468,10 +519,18 @@ Node *Switch::edReleaseCase(int caseId) throw(Exception) Node *ret=(*iter).second; StaticDefinedComposedNode::edRemoveChild(ret); _mapOfNode.erase(iter); + modified(); return ret; } } +Node *Switch::edGetNode(int caseId) +{ + if (!_mapOfNode.count(caseId)) return 0; + return _mapOfNode[caseId]; +} + + /*! * \param caseId : the case ID chosen to place 'node' * \param node : the node for the specified 'caseId' @@ -479,7 +538,7 @@ Node *Switch::edReleaseCase(int caseId) throw(Exception) * 0 is returned if caseId is a new ID. * \b WARNING : 'node' is held by 'this' after call, whereas returned node is no more held. */ -Node *Switch::edSetNode(int caseId, Node *node) throw(Exception) +Node *Switch::edSetNode(int caseId, Node *node) { if(!node) throw Exception("Switch::edSetNode : null node cannot be set as a case in switch node"); @@ -488,10 +547,10 @@ Node *Switch::edSetNode(int caseId, Node *node) throw(Exception) checkNoCrossHierachyWith(node); node->_father=this; map< int , Node * >::iterator iter=_mapOfNode.find(caseId); - modified(); if(iter==_mapOfNode.end()) { _mapOfNode[caseId]=node; + modified(); return 0; } else @@ -500,9 +559,84 @@ Node *Switch::edSetNode(int caseId, Node *node) throw(Exception) { Node *ret=(*iter).second; (*iter).second=node; + modified(); return ret; } } + return 0; +} + +//! Change the case of a node +/*! + * \param oldCase : the case value to change + * \param newCase : the new value to set + * raise an exception if the old case does not exist or if the new case already exists + */ +void Switch::edChangeCase(int oldCase, int newCase) +{ + std::map< int , Node * >::iterator iter=_mapOfNode.find(oldCase); + if(iter==_mapOfNode.end()) + { + //the case does not exists + throw Exception("Switch::edChangeCase : case does not exist"); + } + iter=_mapOfNode.find(newCase); + if(iter != _mapOfNode.end()) + { + //the new case exists + throw Exception("Switch::edChangeCase : new case exists"); + } + Node* node=_mapOfNode[oldCase]; + _mapOfNode.erase(oldCase); + _mapOfNode[newCase]=node; + modified(); +} + +int Switch::getMaxCase() +{ + int aCase = 0; + map::const_iterator it = _mapOfNode.begin(); + for(; it != _mapOfNode.end(); ++it) + if ((*it).first > aCase) + aCase = (*it).first; + return aCase; +} + +//! Get the progress weight of the graph +/*! + * Only elementary nodes have weight. If the switch node is not done, we add the weight of all his descendants, + * otherwise only the weight of the used case count. + */ +list Switch::getProgressWeight() const +{ + list ret; + list setOfNode=edGetDirectDescendants(); + if (getState() == YACS::DONE) + { + for(list::const_iterator iter=setOfNode.begin();iter!=setOfNode.end();iter++) + { + if (getEffectiveState(*iter) == YACS::DONE) + ret=(*iter)->getProgressWeight(); + } + } + else + { + for(list::const_iterator iter=setOfNode.begin();iter!=setOfNode.end();iter++) + { + list myCurrentSet=(*iter)->getProgressWeight(); + ret.insert(ret.end(),myCurrentSet.begin(),myCurrentSet.end()); + } + } + return ret; +} + +bool Switch::edAddChild(Node *node) +{ + int aCase = getMaxCase() + 1; + DEBTRACE(aCase); + bool ret = edSetNode(aCase, node); + DEBTRACE(ret); + return ret; } YACS::Event Switch::updateStateOnFinishedEventFrom(Node *node) @@ -553,13 +687,13 @@ void Switch::checkControlDependancy(OutPort *start, InPort *end, bool cross, throw Exception("Switch::checkControlDependancy : a link was dectected between 2 cases of a switch. Impossible !"); } -void Switch::checkNoCyclePassingThrough(Node *node) throw(Exception) +void Switch::checkNoCyclePassingThrough(Node *node) { throw Exception("Switch::checkNoCyclePassingThrough : uncorrect control flow link relative to switch"); } void Switch::checkLinkPossibility(OutPort *start, const std::list& pointsOfViewStart, - InPort *end, const std::list& pointsOfViewEnd) throw(Exception) + InPort *end, const std::list& pointsOfViewEnd) { throw Exception("Switch::checkLinkPossibility : A link between 2 different cases of a same Switch requested -> Impossible"); } @@ -581,7 +715,7 @@ void Switch::buildDelegateOf(std::pair& port, InPort *fina port.first=newCollector; } -void Switch::getDelegateOf(std::pair& port, InPort *finalTarget, const std::list& pointsOfView) throw(Exception) +void Switch::getDelegateOf(std::pair& port, InPort *finalTarget, const std::list& pointsOfView) { map::iterator iter=_outPortsCollector.find(finalTarget); if(iter==_outPortsCollector.end()) @@ -595,7 +729,7 @@ void Switch::getDelegateOf(std::pair& port, InPort *finalT port.first=(*iter).second; } -void Switch::releaseDelegateOf(OutPort *portDwn, OutPort *portUp, InPort *finalTarget, const std::list& pointsOfView) throw(Exception) +void Switch::releaseDelegateOf(OutPort *portDwn, OutPort *portUp, InPort *finalTarget, const std::list& pointsOfView) { set repr; portDwn->getAllRepresented(repr); @@ -650,11 +784,8 @@ YACS::StatesForNode Switch::getEffectiveState(const Node* node) const return YACS::READY; if(effectiveState==YACS::DISABLED) return YACS::DISABLED; - map< int , Node * >::const_iterator iter=_mapOfNode.find(_condition.getIntValue()); - if(iter!=_mapOfNode.end() && (*iter).second==node) - return node->getState(); - else - return YACS::READY; + + return node->getState(); } YACS::StatesForNode Switch::getEffectiveState() const { @@ -685,7 +816,7 @@ std::string Switch::getMyQualifiedName(const Node *directSon) const return id; } -std::string Switch::getCaseId(const Node *node) const throw(Exception) +std::string Switch::getCaseId(const Node *node) const { const char sep='_'; map::const_iterator iter;