1 // Copyright (C) 2007-2023 CEA, EDF
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
19 // Author : Anthony Geay (CEA/DEN)
21 #include "MEDCouplingRefCountObject.hxx"
22 #include "MEDCoupling_version.h"
25 #include "InterpKernelException.hxx"
30 using namespace MEDCoupling;
32 GlobalDict *GlobalDict::UNIQUE_INSTANCE=0;
34 const char *MEDCoupling::MEDCouplingVersionStr()
36 return MEDCOUPLING_VERSION_STR;
39 int MEDCoupling::MEDCouplingVersion()
41 return MEDCOUPLING_VERSION;
44 void MEDCoupling::MEDCouplingVersionMajMinRel(int& maj, int& minor, int& releas)
46 int ver=MEDCOUPLING_VERSION;
47 maj=(ver & 0xFF0000) >> 16;
48 minor=(ver & 0xFF00) >> 8;
52 int MEDCoupling::MEDCouplingSizeOfVoidStar()
54 return 8*sizeof(std::size_t);
57 std::size_t MEDCoupling::MEDCouplingSizeOfIDs()
59 return 8*sizeof(mcIdType);
63 * If true is returned it is a LittleEndian machine.
64 * If false it is a BigEndian machine.
65 * \return the coding mode of integers of the machine.
67 bool MEDCoupling::MEDCouplingByteOrder()
70 unsigned char *xc(reinterpret_cast<unsigned char *>(&x));
74 const char *MEDCoupling::MEDCouplingByteOrderStr()
76 static const char LITTLEENDIAN_STR[]="LittleEndian";
77 static const char BIGENDIAN_STR[]="BigEndian";
78 if(MEDCouplingByteOrder())
79 return LITTLEENDIAN_STR;
84 bool MEDCoupling::IsCXX11Compiled()
91 std::string BigMemoryObject::debugHeapMemorySize() const
93 std::size_t ret(getHeapMemorySizeWithoutChildren()),sum(ret);
94 std::ostringstream oss;
95 std::vector<const BigMemoryObject *> s2(getDirectChildren());
96 std::set<const BigMemoryObject *> s1;
97 oss << "this (" << this->getClassName() << ") -> " << ret << std::endl;
100 std::vector<const BigMemoryObject *> s3;
103 if(s1.find(it)==s1.end())
105 ret = it->getHeapMemorySizeWithoutChildren(); sum+=ret;
106 oss << it->getClassName() << " -> " << ret << std::endl;
108 std::vector<const BigMemoryObject *> v2(it->getDirectChildren());
110 if(s1.find(it2)==s1.end())
116 oss << "sum = " << sum << std::endl;
120 std::size_t BigMemoryObject::getHeapMemorySize() const
122 std::size_t ret(getHeapMemorySizeWithoutChildren());
123 std::vector<const BigMemoryObject *> v(getDirectChildren());
124 std::set<const BigMemoryObject *> s1,s2(v.begin(),v.end());
125 return ret+GetHeapMemoryOfSet(s1,s2);
129 * This method returns all the progeny of \a this (this is \b not included in returned vector).
130 * All the progeny means all the subobjects (children), subsubobjects (little children), ... of \a this.
131 * The elements in returned array are reported only once even if they appear several times in the progeny of \a this.
133 std::vector<const BigMemoryObject *> BigMemoryObject::getAllTheProgeny() const
135 std::vector<const BigMemoryObject *> s1(getDirectChildren());
136 std::vector<const BigMemoryObject *> ret;
139 ret.insert(ret.end(),s1.begin(),s1.end());
140 std::vector<const BigMemoryObject *> s3;
141 for(std::vector<const BigMemoryObject *>::const_iterator it0=s1.begin();it0!=s1.end();it0++)
143 std::vector<const BigMemoryObject *> s2;
145 s2=(*it0)->getDirectChildren();
146 for(std::vector<const BigMemoryObject *>::const_iterator it1=s2.begin();it1!=s2.end();it1++)
149 if(std::find(ret.begin(),ret.end(),*it1)==ret.end())
159 * This method scan all the progeny of \a this (\a this excluded) to see if \a obj is part of it.
160 * If obj is NULL false is returned.
161 * \sa BigMemoryObject::getAllTheProgeny
163 bool BigMemoryObject::isObjectInTheProgeny(const BigMemoryObject *obj) const
167 std::vector<const BigMemoryObject *> objs(getAllTheProgeny());
168 return std::find(objs.begin(),objs.end(),obj)!=objs.end();
171 std::size_t BigMemoryObject::GetHeapMemorySizeOfObjs(const std::vector<const BigMemoryObject *>& objs)
174 std::set<const BigMemoryObject *> s1,s2;
175 for(std::vector<const BigMemoryObject *>::const_iterator it0=objs.begin();it0!=objs.end();it0++)
178 if(s1.find(*it0)==s1.end())
180 std::vector<const BigMemoryObject *> vTmp((*it0)->getDirectChildren());
181 s2.insert(vTmp.begin(),vTmp.end());
182 ret+=(*it0)->getHeapMemorySizeWithoutChildren();
186 return ret+GetHeapMemoryOfSet(s1,s2);
189 std::size_t BigMemoryObject::GetHeapMemoryOfSet(std::set<const BigMemoryObject *>& s1, std::set<const BigMemoryObject *>& s2)
194 std::set<const BigMemoryObject *> s3;
195 for(std::set<const BigMemoryObject *>::const_iterator it=s2.begin();it!=s2.end();it++)
197 if(s1.find(*it)==s1.end())
199 ret+=(*it)->getHeapMemorySizeWithoutChildren();
201 std::vector<const BigMemoryObject *> v2((*it)->getDirectChildren());
202 for(std::vector<const BigMemoryObject *>::const_iterator it2=v2.begin();it2!=v2.end();it2++)
203 if(s1.find(*it2)==s1.end())
212 std::string BigMemoryObject::getHeapMemorySizeStr() const
214 static const char *UNITS[4]={"B","kB","MB","GB"};
215 std::size_t m(getHeapMemorySize());
216 std::ostringstream oss; oss.precision(3);
217 std::size_t remain(0);
226 std::ostringstream oss2; oss2 << std::fixed << ((double)remain)/1024.;
227 std::string s(oss2.str());
229 std::size_t pos(s.find_last_not_of('0'));
233 oss << s.substr(0,pos+1);
235 oss << " " << UNITS[i];
248 oss << m << " " << UNITS[3];
252 std::vector<const BigMemoryObject *> BigMemoryObject::getDirectChildren() const
254 std::vector<const BigMemoryObject *> ret;
255 std::vector<const BigMemoryObject *> retWithNull(getDirectChildrenWithNull());
256 for(std::vector<const BigMemoryObject *>::const_iterator it=retWithNull.begin();it!=retWithNull.end();it++)
262 BigMemoryObject::~BigMemoryObject()
268 RefCountObjectOnly::RefCountObjectOnly():_cnt(1)
272 RefCountObjectOnly::RefCountObjectOnly(const RefCountObjectOnly& other):_cnt(1)
276 bool RefCountObjectOnly::decrRef() const
278 bool ret=((--_cnt)==0);
284 void RefCountObjectOnly::incrRef() const
289 int RefCountObjectOnly::getRCValue() const
294 RefCountObjectOnly::~RefCountObjectOnly()
299 * Do nothing here ! It is not a bug ( I hope :) ) because all subclasses that
300 * copies using operator= should not copy the ref counter of \a other !
302 RefCountObjectOnly& RefCountObjectOnly::operator=(const RefCountObjectOnly& other)
309 RefCountObject::RefCountObject()
313 RefCountObject::RefCountObject(const RefCountObject& other):RefCountObjectOnly(other)
317 RefCountObject::~RefCountObject()
323 GlobalDict *GlobalDict::GetInstance()
326 UNIQUE_INSTANCE=new GlobalDict;
327 return UNIQUE_INSTANCE;
330 bool GlobalDict::hasKey(const std::string& key) const
332 std::map<std::string, std::string>::const_iterator it(_my_map.find(key));
333 return it!=_my_map.end();
336 std::string GlobalDict::value(const std::string& key) const
338 std::map<std::string, std::string>::const_iterator it(_my_map.find(key));
339 if(it==_my_map.end())
341 std::ostringstream oss;
342 oss << "GlobalDict::value : key \"" << key << "\" is not in map !";
343 throw INTERP_KERNEL::Exception(oss.str().c_str());
348 std::vector<std::string> GlobalDict::keys() const
350 std::vector<std::string> ret;
351 for(std::map<std::string, std::string>::const_iterator it=_my_map.begin();it!=_my_map.end();it++)
352 ret.push_back((*it).first);
356 void GlobalDict::erase(const std::string& key)
358 std::map<std::string, std::string>::iterator it(_my_map.find(key));
359 if(it==_my_map.end())
361 std::ostringstream oss;
362 oss << "GlobalDict::erase : key \"" << key << "\" is not in map !";
363 throw INTERP_KERNEL::Exception(oss.str().c_str());
368 void GlobalDict::clear()
373 void GlobalDict::setKeyValue(const std::string& key, const std::string& val)
375 std::map<std::string, std::string>::const_iterator it(_my_map.find(key));
376 if(it!=_my_map.end())
378 std::ostringstream oss;
379 oss << "GlobalDict::setKeyValue : key \"" << key << "\" already exists !";
380 throw INTERP_KERNEL::Exception(oss.str().c_str());
385 void GlobalDict::setKeyValueForce(const std::string& key, const std::string& val)
390 std::string GlobalDict::printSelf() const
392 std::ostringstream oss;
393 for(std::map<std::string, std::string>::const_iterator it=_my_map.begin();it!=_my_map.end();it++)
395 oss << "(" << (*it).first << "," << (*it).second << ")" << std::endl;