Version: 9.16.0
SalomeHPContainerTools.cxx
Go to the documentation of this file.
1// Copyright (C) 2006-2026 CEA, EDF
2//
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.
7//
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.
12//
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
16//
17// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
18//
19
21#include "SalomeHPContainer.hxx"
22#include "AutoLocker.hxx"
23#include "Exception.hxx"
24
25#include <algorithm>
26
27using namespace YACS::ENGINE;
28
29void SalomeHPContainerVectOfHelper::resize(std::size_t sz)
30{
31 std::size_t oldSize(_launchModeType.size());
32 if(sz==oldSize)
33 return;
35 _whichOccupied.resize(sz); std::fill(_whichOccupied.begin(),_whichOccupied.end(),false);
36 _launchModeType.resize(sz);
37 for(std::size_t i=oldSize;i<sz;i++)
39 _currentlyWorking.clear();
40}
41
43{
44 return std::count(_whichOccupied.begin(),_whichOccupied.end(),false);
45}
46
47void SalomeHPContainerVectOfHelper::allocateFor(const std::vector<const Task *>& nodes)
48{
49 for(std::vector<const Task *>::const_iterator it=nodes.begin();it!=nodes.end();it++)
50 {
51 if(!(*it))
52 continue;
53 if(_currentlyWorking.find(*it)!=_currentlyWorking.end())
54 throw Exception("Searching to allocate for a ServiceNode instance already declared as allocated !");
55 std::vector<bool>::iterator it2(std::find(_whichOccupied.begin(),_whichOccupied.end(),false));
56 if(it2==_whichOccupied.end())
57 throw Exception("All ressources are already occupied ! You are expected to wait for released resources !");
58 std::size_t pos(std::distance(_whichOccupied.begin(),it2));
59 _currentlyWorking[*it]=pos; _whichOccupied[pos]=true;
60 }
61}
62
63void SalomeHPContainerVectOfHelper::allocateForCrude(const std::vector<std::pair<const Task *,std::size_t>>& nodes)
64{
65 for(auto it : nodes)
66 {
67 std::size_t workerId(it.second);
68 if(workerId>=size())
69 throw Exception("SalomeHPContainerVectOfHelper::allocateForCrude : Internal error ! WorkerId is greater or equal to size of HPCont !");
70 if(_whichOccupied[workerId])
71 throw Exception("SalomeHPContainerVectOfHelper::allocateForCrude : Mismatch between Playground info and HPContainer info !");
72 }
73 for(auto it : nodes)
74 {
75 const Task *task(it.first);
76 std::size_t workerId(it.second);
77 _currentlyWorking[task]=workerId;
78 _whichOccupied[workerId]=true;
79 }
80}
81
83{
84 if(!node)
85 return std::numeric_limits<std::size_t>::max();
86 std::map< const Task *,std::size_t >::iterator it(_currentlyWorking.find(node));
87 if(it==_currentlyWorking.end())
88 throw Exception("Request to release a resource not declared as working !");
89 _whichOccupied[(*it).second]=false;
90 _currentlyWorking.erase(it);
91 return (*it).second;
92}
93
94std::size_t SalomeHPContainerVectOfHelper::locateTask(const Task *node) const
95{
96 std::map< const Task *,std::size_t >::const_iterator it(_currentlyWorking.find(node));
97 if(it==_currentlyWorking.end())
98 throw Exception("current Node to be located is not marked as launched !");
99 std::size_t ret((*it).second);
100 checkPosInVec(ret);
101 return ret;
102}
103
105{
107 return _launchModeType[locateTask(node)];
108}
109
111{
112 return _launchModeType[locateTask(node)];
113}
114
116{
118 return _launchModeType[locateTask(node)];
119}
120
122{
123 return _launchModeType[locateTask(node)];
124}
125
127{
128 std::vector<std::string> ret;
129 {
131 std::size_t sz(_launchModeType.size());
132 ret.resize(sz);
133 for(std::size_t i=0;i<sz;i++)
134 {
135 ret[i]=_launchModeType[i]->getKernelContainerName();
136 }
137 }
138 return ret;
139}
140
142{
143 for(std::map<const Task *,std::size_t >::const_iterator it=_currentlyWorking.begin();it!=_currentlyWorking.end();it++)
144 if((*it).first)
145 throw Exception("Something wrong a node is still declared to be using the ressource !");
146 for(std::vector< YACS::BASES::AutoRefCnt<SalomeContainerMonoHelper> >::const_iterator it=_launchModeType.begin();it!=_launchModeType.end();it++)
147 if((*it)->isAlreadyStarted(0))
148 throw Exception("Some of the containers have be started ! Please shutdown them before !");
149}
150
152{
153 if(pos<0 || pos>=_launchModeType.size())
154 throw Exception("The task has been found, but its id is not in the correct range ! resize of of container size during run ?");
155}
void allocateFor(const std::vector< const Task * > &nodes)
std::size_t locateTask(const Task *node) const
const SalomeContainerMonoHelper * getHelperOfTaskThreadSafe(const SalomeHPContainer *cont, const Task *node) const
std::vector< std::string > getKernelContainerNames(const SalomeHPContainer *cont) const
void allocateForCrude(const std::vector< std::pair< const Task *, std::size_t > > &nodes)
const SalomeContainerMonoHelper * getHelperOfTask(const Task *node) const
std::vector< BASES::AutoRefCnt< YACS::ENGINE::SalomeContainerMonoHelper > > _launchModeType
std::map< const Task *, std::size_t > _currentlyWorking
def distance(node, new_node)
Definition: graph.py:275