CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
DTConfigPluginHandler.cc
Go to the documentation of this file.
1 /*
2  * See header file for a description of this class.
3  *
4  * $Date: 2011/07/19 15:56:43 $
5  * $Revision: 1.4 $
6  * \author Paolo Ronchese INFN Padova
7  *
8  */
9 
10 //-----------------------
11 // This Class' Header --
12 //-----------------------
14 
15 //-------------------------------
16 // Collaborating Class Headers --
17 //-------------------------------
27 
28 //---------------
29 // C++ Headers --
30 //---------------
31 //#include <iostream>
32 #include <cstdio>
33 
34 //-------------------
35 // Initializations --
36 //-------------------
40 //DTConfigPluginHandler::handler_map DTConfigPluginHandler::handlerMap;
41 
42 //----------------
43 // Constructors --
44 //----------------
46  cachedBrickNumber( 0 ),
47  cachedStringNumber( 0 ),
48  cachedByteNumber( 0 ) {
49 // std::cout << "===============================" << std::endl;
50 // std::cout << "= =" << std::endl;
51 // std::cout << "= new DTConfigPluginHandler =" << std::endl;
52 // std::cout << "= =" << std::endl;
53 // std::cout << "===============================" << std::endl;
54 // if ( instance == 0 ) instance = this;
55 }
56 
57 
58 //--------------
59 // Destructor --
60 //--------------
62  purge();
63 }
64 
65 
66 //--------------
67 // Operations --
68 //--------------
70  if ( instance == 0 ) instance = new DTConfigPluginHandler;
71 }
72 
73 
75  int cfgId, const DTKeyedConfig*& obj ) {
76  return get( context.get<DTKeyedConfigListRcd>(), cfgId, obj );
77 }
78 
79 
81  int cfgId, const DTKeyedConfig*& obj ) {
82 
83  bool cacheFound = false;
84  int cacheAge = 999999999;
85  std::map<int,counted_brick>::iterator cache_iter = brickMap.begin();
86  std::map<int,counted_brick>::iterator cache_icfg = brickMap.find( cfgId );
87  std::map<int,counted_brick>::iterator cache_iend = brickMap.end();
88  if ( cache_icfg != cache_iend ) {
89  std::pair<const int,counted_brick>& entry = *cache_icfg;
90  counted_brick& cBrick = entry.second;
91  cacheAge = cBrick.first;
92  obj = cBrick.second;
93  cacheFound = true;
94  }
95 
96  std::map<int,const DTKeyedConfig*> ageMap;
97  if ( cacheFound ) {
98  if ( !cacheAge ) return 0;
99  while ( cache_iter != cache_iend ) {
100  std::pair<const int,counted_brick>& entry = *cache_iter++;
101  counted_brick& cBrick = entry.second;
102  int& brickAge = cBrick.first;
103  if ( brickAge < cacheAge ) brickAge++;
104  if ( entry.first == cfgId ) brickAge = 0;
105  }
106  return 0;
107  }
108  else {
109  while ( cache_iter != cache_iend ) {
110  std::pair<const int,counted_brick>& entry = *cache_iter++;
111  counted_brick& cBrick = entry.second;
112  ageMap.insert( std::pair<int,const DTKeyedConfig*>(
113  ++cBrick.first, entry.second.second ) );
114  }
115  }
116 
117 // get dummy brick list
119  keyRecord.get( klh );
120  cond::KeyList const & kl= *klh.product();
121  cond::KeyList* keyList = const_cast<cond::KeyList*>( &kl );
122  if ( keyList == 0 ) return 999;
123 
124  std::vector<unsigned long long> checkedKeys;
125  const DTKeyedConfig* kBrick = 0;
126  checkedKeys.push_back( cfgId );
127  bool brickFound = false;
128  try {
129  keyList->load( checkedKeys );
130  kBrick = keyList->get<DTKeyedConfig>( 0 );
131  if ( kBrick != 0 ) brickFound = ( kBrick->getId() == cfgId );
132  }
133  catch ( std::exception const & e ) {
134  }
135  if ( brickFound ) {
136  counted_brick cBrick( 0, obj = new DTKeyedConfig( *kBrick ) );
137  brickMap.insert( std::pair<int,counted_brick>( cfgId, cBrick ) );
138  DTKeyedConfig::data_iterator d_iter = kBrick->dataBegin();
139  DTKeyedConfig::data_iterator d_iend = kBrick->dataEnd();
141  cachedStringNumber += ( d_iend - d_iter );
142  while ( d_iter != d_iend ) cachedByteNumber += ( *d_iter++ ).size();
143  }
144  std::map<int,const DTKeyedConfig*>::reverse_iterator iter = ageMap.rbegin();
145  while ( ( cachedBrickNumber > maxBrickNumber ) ||
148  const DTKeyedConfig* oldestBrick = iter->second;
149  int oldestId = oldestBrick->getId();
151  DTKeyedConfig::data_iterator d_iter = oldestBrick->dataBegin();
152  DTKeyedConfig::data_iterator d_iend = oldestBrick->dataEnd();
153  cachedStringNumber -= ( d_iend - d_iter );
154  while ( d_iter != d_iend ) cachedByteNumber -= ( *d_iter++ ).size();
155  brickMap.erase( oldestId );
156  delete iter->second;
157  iter++;
158  }
159 
160  return 999;
161 
162 }
163 
164 
165 void DTConfigPluginHandler::getData( const edm::EventSetup& context, int cfgId,
166  std::vector<std::string>& list ) {
167  getData( context.get<DTKeyedConfigListRcd>(), cfgId, list );
168  return;
169 }
170 
171 
173  int cfgId,
174  std::vector<std::string>& list ) {
175  const DTKeyedConfig* obj = 0;
176  get( keyRecord, cfgId, obj );
177  if ( obj == 0 ) return;
178  DTKeyedConfig::data_iterator d_iter = obj->dataBegin();
179  DTKeyedConfig::data_iterator d_iend = obj->dataEnd();
180  while ( d_iter != d_iend ) list.push_back( *d_iter++ );
181  DTKeyedConfig::link_iterator l_iter = obj->linkBegin();
182  DTKeyedConfig::link_iterator l_iend = obj->linkEnd();
183  while ( l_iter != l_iend ) getData( keyRecord, *l_iter++, list );
184  return;
185 }
186 
187 
189  std::cout << "DTConfigPluginHandler::purge "
190  << this << " "
191  << cachedBrickNumber << " "
192  << cachedStringNumber << " "
193  << cachedByteNumber << std::endl;
194  std::map<int,counted_brick>::const_iterator iter = brickMap.begin();
195  std::map<int,counted_brick>::const_iterator iend = brickMap.end();
196  while ( iter != iend ) {
197  delete iter->second.second;
198  iter++;
199  }
200  brickMap.clear();
201  cachedBrickNumber = 0;
202  cachedStringNumber = 0;
203  cachedByteNumber = 0;
204  return;
205 }
206 
std::map< int, counted_brick > brickMap
void load(std::vector< unsigned long long > const &keys)
Definition: KeyList.cc:10
std::pair< int, const DTKeyedConfig * > counted_brick
virtual int get(const edm::EventSetup &context, int cfgId, const DTKeyedConfig *&obj)
get content
data_iterator dataBegin() const
link_iterator linkBegin() const
link_iterator linkEnd() const
std::pair< std::string, MonitorElement * > entry
Definition: ME_MAP.h:8
static void build()
build static object
void get(HolderT &iHolder) const
T const * get(int n) const
Definition: KeyList.h:39
std::vector< int >::const_iterator link_iterator
Definition: DTKeyedConfig.h:57
void purge()
purge db copy
virtual void getData(const edm::EventSetup &context, int cfgId, std::vector< std::string > &list)
const T & get() const
Definition: EventSetup.h:55
T const * product() const
Definition: ESHandle.h:62
int getId() const
std::vector< std::string >::const_iterator data_iterator
Definition: DTKeyedConfig.h:56
tuple cout
Definition: gather_cfg.py:121
static DTConfigAbstractHandler * instance
tuple size
Write out results.
data_iterator dataEnd() const
How EventSelector::AcceptEvent() decides whether to accept an event for output otherwise it is excluding the probing of A single or multiple positive and the trigger will pass if any such matching triggers are PASS or EXCEPTION[A criterion thatmatches no triggers at all is detected and causes a throw.] A single negative with an expectation of appropriate bit checking in the decision and the trigger will pass if any such matching triggers are FAIL or EXCEPTION A wildcarded negative criterion that matches more than one trigger in the trigger list("!*","!HLTx*"if it matches 2 triggers or more) will accept the event if all the matching triggers are FAIL.It will reject the event if any of the triggers are PASS or EXCEPTION(this matches the behavior of"!*"before the partial wildcard feature was incorporated).Triggers which are in the READY state are completely ignored.(READY should never be returned since the trigger paths have been run