1 |
#include <PamLevel2.h> |
#include <PamLevel2.h> |
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
///////////////////////////////////////////////////////////////////////////// |
6 |
|
///////////////////////////////////////////////////////////////////////////// |
7 |
|
///////////////////////////////////////////////////////////////////////////// |
8 |
|
///////////////////////////////////////////////////////////////////////////// |
9 |
|
|
10 |
|
void GPamela::Clear(){ |
11 |
|
Irun = 0; |
12 |
|
Ievnt = 0; |
13 |
|
Ipa = 0; |
14 |
|
X0 = 0.; |
15 |
|
Y0 = 0.; |
16 |
|
Z0 = 0.; |
17 |
|
Theta = 0.; |
18 |
|
Phi = 0.; |
19 |
|
P0 = 0.; |
20 |
|
Nthtof = 0; |
21 |
|
Nthcat = 0; |
22 |
|
Nthcas = 0; |
23 |
|
Nthspe = 0; |
24 |
|
Nstrpx = 0; |
25 |
|
Nstrpy = 0; |
26 |
|
Nthcali = 0; |
27 |
|
Nthcal = 0; |
28 |
|
Nthnd = 0; |
29 |
|
Nthcard = 0; |
30 |
|
} |
31 |
|
|
32 |
|
void GPamela::Delete(){ |
33 |
|
|
34 |
|
Clear(); |
35 |
|
|
36 |
|
delete [] Ipltof; |
37 |
|
delete [] Ipaddle; |
38 |
|
delete [] Ipartof; |
39 |
|
delete [] Xintof; |
40 |
|
delete [] Yintof; |
41 |
|
delete [] Zintof; |
42 |
|
delete [] Xouttof; |
43 |
|
delete [] Youttof; |
44 |
|
delete [] Zouttof; |
45 |
|
delete [] Ereltof; |
46 |
|
delete [] Timetof; |
47 |
|
delete [] Pathtof; |
48 |
|
delete [] P0tof; |
49 |
|
delete [] Iparcat; |
50 |
|
delete [] Icat; |
51 |
|
delete [] Xincat; |
52 |
|
delete [] Yincat; |
53 |
|
delete [] Zincat; |
54 |
|
delete [] Xoutcat; |
55 |
|
delete [] Youtcat; |
56 |
|
delete [] Zoutcat; |
57 |
|
delete [] Erelcat; |
58 |
|
delete [] Timecat; |
59 |
|
delete [] Pathcat; |
60 |
|
delete [] P0cat; |
61 |
|
delete [] Iparcas; |
62 |
|
delete [] Icas; |
63 |
|
delete [] Xincas; |
64 |
|
delete [] Yincas; |
65 |
|
delete [] Zincas; |
66 |
|
delete [] Xoutcas; |
67 |
|
delete [] Youtcas; |
68 |
|
delete [] Zoutcas; |
69 |
|
delete [] Erelcas; |
70 |
|
delete [] Timecas; |
71 |
|
delete [] Pathcas; |
72 |
|
delete [] P0cas; |
73 |
|
delete [] Iparspe; |
74 |
|
delete [] Itrpb; |
75 |
|
delete [] Itrsl; |
76 |
|
delete [] Itspa; |
77 |
|
delete [] Xinspe; |
78 |
|
delete [] Yinspe; |
79 |
|
delete [] Zinspe; |
80 |
|
delete [] Xoutspe; |
81 |
|
delete [] Youtspe; |
82 |
|
delete [] Zoutspe; |
83 |
|
delete [] Xavspe; |
84 |
|
delete [] Yavspe; |
85 |
|
delete [] Zavspe; |
86 |
|
delete [] Erelspe; |
87 |
|
delete [] Pathspe; |
88 |
|
delete [] P0spe; |
89 |
|
delete [] Nxmult; |
90 |
|
delete [] Nymult; |
91 |
|
delete [] Npstripx; |
92 |
|
delete [] Ntstripx; |
93 |
|
delete [] Istripx; |
94 |
|
delete [] Qstripx; |
95 |
|
delete [] Xstripx; |
96 |
|
delete [] Npstripy; |
97 |
|
delete [] Ntstripy; |
98 |
|
delete [] Istripy; |
99 |
|
delete [] Qstripy; |
100 |
|
delete [] Ystripy; |
101 |
|
delete [] Icaplane; |
102 |
|
delete [] Icastrip; |
103 |
|
delete [] Icamod; |
104 |
|
delete [] Enestrip; |
105 |
|
delete [] Icapl; |
106 |
|
delete [] Icasi; |
107 |
|
delete [] Icast; |
108 |
|
delete [] Xincal; |
109 |
|
delete [] Yincal; |
110 |
|
delete [] Zincal; |
111 |
|
delete [] Erelcal; |
112 |
|
delete [] Itubend; |
113 |
|
delete [] Iparnd; |
114 |
|
delete [] Xinnd; |
115 |
|
delete [] Yinnd; |
116 |
|
delete [] Zinnd; |
117 |
|
delete [] Xoutnd; |
118 |
|
delete [] Youtnd; |
119 |
|
delete [] Zoutnd; |
120 |
|
delete [] Erelnd; |
121 |
|
delete [] Timend; |
122 |
|
delete [] Pathnd; |
123 |
|
delete [] P0nd; |
124 |
|
delete [] Iparcard; |
125 |
|
delete [] Icard; |
126 |
|
delete [] Xincard; |
127 |
|
delete [] Yincard; |
128 |
|
delete [] Zincard; |
129 |
|
delete [] Xoutcard; |
130 |
|
delete [] Youtcard; |
131 |
|
delete [] Zoutcard; |
132 |
|
delete [] Erelcard; |
133 |
|
delete [] Timecard; |
134 |
|
delete [] Pathcard; |
135 |
|
delete [] P0card; |
136 |
|
|
137 |
|
|
138 |
|
}; |
139 |
|
|
140 |
|
|
141 |
|
|
142 |
|
void GPamela::SetBranchAddress( TChain* fhBookTree ){ |
143 |
|
|
144 |
|
// cout << "fhBookTree "<<fhBookTree << endl; |
145 |
|
// prepare tree |
146 |
|
fhBookTree->SetBranchAddress("Irun",&Irun); |
147 |
|
fhBookTree->SetBranchAddress("Ievnt",&Ievnt); |
148 |
|
fhBookTree->SetBranchAddress("Ipa",&Ipa); |
149 |
|
fhBookTree->SetBranchAddress("X0",&X0); |
150 |
|
fhBookTree->SetBranchAddress("Y0",&Y0); |
151 |
|
fhBookTree->SetBranchAddress("Z0",&Z0); |
152 |
|
fhBookTree->SetBranchAddress("Theta",&Theta); |
153 |
|
fhBookTree->SetBranchAddress("Phi",&Phi); |
154 |
|
fhBookTree->SetBranchAddress("P0",&P0); |
155 |
|
fhBookTree->SetBranchAddress("Nthtof",&Nthtof); |
156 |
|
fhBookTree->SetBranchAddress("Ipltof",Ipltof); |
157 |
|
fhBookTree->SetBranchAddress("Ipaddle",Ipaddle); |
158 |
|
fhBookTree->SetBranchAddress("Ipartof",Ipartof); |
159 |
|
fhBookTree->SetBranchAddress("Xintof",Xintof); |
160 |
|
fhBookTree->SetBranchAddress("Yintof",Yintof); |
161 |
|
fhBookTree->SetBranchAddress("Zintof",Zintof); |
162 |
|
fhBookTree->SetBranchAddress("Xouttof",Xouttof); |
163 |
|
fhBookTree->SetBranchAddress("Youttof",Youttof); |
164 |
|
fhBookTree->SetBranchAddress("Zouttof",Zouttof); |
165 |
|
fhBookTree->SetBranchAddress("Ereltof",Ereltof); |
166 |
|
fhBookTree->SetBranchAddress("Timetof",Timetof); |
167 |
|
fhBookTree->SetBranchAddress("Pathtof",Pathtof); |
168 |
|
fhBookTree->SetBranchAddress("P0tof",P0tof); |
169 |
|
fhBookTree->SetBranchAddress("Nthcat",&Nthcat); |
170 |
|
fhBookTree->SetBranchAddress("Iparcat",Iparcat); |
171 |
|
fhBookTree->SetBranchAddress("Icat",Icat); |
172 |
|
fhBookTree->SetBranchAddress("Xincat",Xincat); |
173 |
|
fhBookTree->SetBranchAddress("Yincat",Yincat); |
174 |
|
fhBookTree->SetBranchAddress("Zincat",Zincat); |
175 |
|
fhBookTree->SetBranchAddress("Xoutcat",Xoutcat); |
176 |
|
fhBookTree->SetBranchAddress("Youtcat",Youtcat); |
177 |
|
fhBookTree->SetBranchAddress("Zoutcat",Zoutcat); |
178 |
|
fhBookTree->SetBranchAddress("Erelcat",Erelcat); |
179 |
|
fhBookTree->SetBranchAddress("Timecat",Timecat); |
180 |
|
fhBookTree->SetBranchAddress("Pathcat",Pathcat); |
181 |
|
fhBookTree->SetBranchAddress("P0cat",P0cat); |
182 |
|
fhBookTree->SetBranchAddress("Nthcas",&Nthcas); |
183 |
|
fhBookTree->SetBranchAddress("Iparcas",Iparcas); |
184 |
|
fhBookTree->SetBranchAddress("Icas",Icas); |
185 |
|
fhBookTree->SetBranchAddress("Xincas",Xincas); |
186 |
|
fhBookTree->SetBranchAddress("Yincas",Yincas); |
187 |
|
fhBookTree->SetBranchAddress("Zincas",Zincas); |
188 |
|
fhBookTree->SetBranchAddress("Xoutcas",Xoutcas); |
189 |
|
fhBookTree->SetBranchAddress("Youtcas",Youtcas); |
190 |
|
fhBookTree->SetBranchAddress("Zoutcas",Zoutcas); |
191 |
|
fhBookTree->SetBranchAddress("Erelcas",Erelcas); |
192 |
|
fhBookTree->SetBranchAddress("Timecas",Timecas); |
193 |
|
fhBookTree->SetBranchAddress("Pathcas",Pathcas); |
194 |
|
fhBookTree->SetBranchAddress("P0cas",P0cas); |
195 |
|
fhBookTree->SetBranchAddress("Nthspe",&Nthspe); |
196 |
|
fhBookTree->SetBranchAddress("Iparspe",Iparspe); |
197 |
|
fhBookTree->SetBranchAddress("Itrpb",Itrpb); |
198 |
|
fhBookTree->SetBranchAddress("Itrsl",Itrsl); |
199 |
|
fhBookTree->SetBranchAddress("Itspa",Itspa); |
200 |
|
fhBookTree->SetBranchAddress("Xinspe",Xinspe); |
201 |
|
fhBookTree->SetBranchAddress("Yinspe",Yinspe); |
202 |
|
fhBookTree->SetBranchAddress("Zinspe",Zinspe); |
203 |
|
fhBookTree->SetBranchAddress("Xoutspe",Xoutspe); |
204 |
|
fhBookTree->SetBranchAddress("Youtspe",Youtspe); |
205 |
|
fhBookTree->SetBranchAddress("Zoutspe",Zoutspe); |
206 |
|
fhBookTree->SetBranchAddress("Xavspe",Xavspe); |
207 |
|
fhBookTree->SetBranchAddress("Yavspe",Yavspe); |
208 |
|
fhBookTree->SetBranchAddress("Zavspe",Zavspe); |
209 |
|
fhBookTree->SetBranchAddress("Erelspe",Erelspe); |
210 |
|
fhBookTree->SetBranchAddress("Pathspe",Pathspe); |
211 |
|
fhBookTree->SetBranchAddress("P0spe",P0spe); |
212 |
|
fhBookTree->SetBranchAddress("Nxmult",Nxmult); |
213 |
|
fhBookTree->SetBranchAddress("Nymult",Nymult); |
214 |
|
fhBookTree->SetBranchAddress("Nstrpx",&Nstrpx); |
215 |
|
fhBookTree->SetBranchAddress("Npstripx",Npstripx); |
216 |
|
fhBookTree->SetBranchAddress("Ntstripx",Ntstripx); |
217 |
|
fhBookTree->SetBranchAddress("Istripx",Istripx); |
218 |
|
fhBookTree->SetBranchAddress("Qstripx",Qstripx); |
219 |
|
fhBookTree->SetBranchAddress("Xstripx",Xstripx); |
220 |
|
fhBookTree->SetBranchAddress("Nstrpy",&Nstrpy); |
221 |
|
fhBookTree->SetBranchAddress("Npstripy",Npstripy); |
222 |
|
fhBookTree->SetBranchAddress("Ntstripy",Ntstripy); |
223 |
|
fhBookTree->SetBranchAddress("Istripy",Istripy); |
224 |
|
fhBookTree->SetBranchAddress("Qstripy",Qstripy); |
225 |
|
fhBookTree->SetBranchAddress("Ystripy",Ystripy); |
226 |
|
fhBookTree->SetBranchAddress("Nthcali",&Nthcali); |
227 |
|
fhBookTree->SetBranchAddress("Icaplane",Icaplane); |
228 |
|
fhBookTree->SetBranchAddress("Icastrip",Icastrip); |
229 |
|
fhBookTree->SetBranchAddress("Icamod",Icamod); |
230 |
|
fhBookTree->SetBranchAddress("Enestrip",Enestrip); |
231 |
|
fhBookTree->SetBranchAddress("Nthcal",&Nthcal); |
232 |
|
fhBookTree->SetBranchAddress("Icapl",Icapl); |
233 |
|
fhBookTree->SetBranchAddress("Icasi",Icasi); |
234 |
|
fhBookTree->SetBranchAddress("Icast",Icast); |
235 |
|
fhBookTree->SetBranchAddress("Xincal",Xincal); |
236 |
|
fhBookTree->SetBranchAddress("Yincal",Yincal); |
237 |
|
fhBookTree->SetBranchAddress("Zincal",Zincal); |
238 |
|
fhBookTree->SetBranchAddress("Erelcal",Erelcal); |
239 |
|
fhBookTree->SetBranchAddress("Nthnd",&Nthnd); |
240 |
|
fhBookTree->SetBranchAddress("Itubend",Itubend); |
241 |
|
fhBookTree->SetBranchAddress("Iparnd",Iparnd); |
242 |
|
fhBookTree->SetBranchAddress("Xinnd",Xinnd); |
243 |
|
fhBookTree->SetBranchAddress("Yinnd",Yinnd); |
244 |
|
fhBookTree->SetBranchAddress("Zinnd",Zinnd); |
245 |
|
fhBookTree->SetBranchAddress("Xoutnd",Xoutnd); |
246 |
|
fhBookTree->SetBranchAddress("Youtnd",Youtnd); |
247 |
|
fhBookTree->SetBranchAddress("Zoutnd",Zoutnd); |
248 |
|
fhBookTree->SetBranchAddress("Erelnd",Erelnd); |
249 |
|
fhBookTree->SetBranchAddress("Timend",Timend); |
250 |
|
fhBookTree->SetBranchAddress("Pathnd",Pathnd); |
251 |
|
fhBookTree->SetBranchAddress("P0nd",P0nd); |
252 |
|
fhBookTree->SetBranchAddress("Nthcard",&Nthcard); |
253 |
|
fhBookTree->SetBranchAddress("Iparcard",Iparcard); |
254 |
|
fhBookTree->SetBranchAddress("Icard",Icard); |
255 |
|
fhBookTree->SetBranchAddress("Xincard",Xincard); |
256 |
|
fhBookTree->SetBranchAddress("Yincard",Yincard); |
257 |
|
fhBookTree->SetBranchAddress("Zincard",Zincard); |
258 |
|
fhBookTree->SetBranchAddress("Xoutcard",Xoutcard); |
259 |
|
fhBookTree->SetBranchAddress("Youtcard",Youtcard); |
260 |
|
fhBookTree->SetBranchAddress("Zoutcard",Zoutcard); |
261 |
|
fhBookTree->SetBranchAddress("Erelcard",Erelcard); |
262 |
|
fhBookTree->SetBranchAddress("Timecard",Timecard); |
263 |
|
fhBookTree->SetBranchAddress("Pathcard",Pathcard); |
264 |
|
fhBookTree->SetBranchAddress("P0card",P0card); |
265 |
|
|
266 |
|
// fhBookTree->SetBranchStatus("*",0); |
267 |
|
|
268 |
|
} |
269 |
|
|
270 |
|
ClassImp(GPamela); |
271 |
|
|
272 |
|
///////////////////////////////////////////////////////////////////////////// |
273 |
|
///////////////////////////////////////////////////////////////////////////// |
274 |
|
///////////////////////////////////////////////////////////////////////////// |
275 |
|
///////////////////////////////////////////////////////////////////////////// |
276 |
//-------------------------------------- |
//-------------------------------------- |
277 |
// |
// |
278 |
// |
// |
284 |
trk_track = 0; |
trk_track = 0; |
285 |
calo_track = 0; |
calo_track = 0; |
286 |
tof_track = 0; |
tof_track = 0; |
287 |
|
orb_track = 0; |
288 |
candeleteobj = 0; |
candeleteobj = 0; |
289 |
|
pscore = 0; |
290 |
|
iscore = 0; |
291 |
}; |
}; |
292 |
//-------------------------------------- |
//-------------------------------------- |
293 |
// |
// |
296 |
/** |
/** |
297 |
* Constructor |
* Constructor |
298 |
*/ |
*/ |
299 |
PamTrack::PamTrack(TrkTrack* t, CaloTrkVar* c, ToFTrkVar* o){ |
PamTrack::PamTrack(TrkTrack* t, CaloTrkVar* c, ToFTrkVar* o, OrbitalInfoTrkVar *r){ |
300 |
|
|
301 |
trk_track = 0; |
trk_track = 0; |
302 |
calo_track = 0; |
calo_track = 0; |
303 |
tof_track = 0; |
tof_track = 0; |
304 |
|
orb_track = 0; |
305 |
// if(t)trk_track = new TrkTrack(*t); |
// if(t)trk_track = new TrkTrack(*t); |
306 |
// if(c)calo_track = new CaloTrkVar(*c); |
// if(c)calo_track = new CaloTrkVar(*c); |
307 |
// if(o)tof_track = new ToFTrkVar(*o); |
// if(o)tof_track = new ToFTrkVar(*o); |
308 |
if(t)trk_track = t; |
if(t)trk_track = t; |
309 |
if(c)calo_track = c; |
if(c)calo_track = c; |
310 |
if(o)tof_track = o; |
if(o)tof_track = o; |
311 |
|
if(r)orb_track = r; |
312 |
candeleteobj = 0; |
candeleteobj = 0; |
313 |
|
|
314 |
}; |
}; |
317 |
TrkTrack *t = track.trk_track; |
TrkTrack *t = track.trk_track; |
318 |
CaloTrkVar *c = track.calo_track; |
CaloTrkVar *c = track.calo_track; |
319 |
ToFTrkVar *o = track.tof_track; |
ToFTrkVar *o = track.tof_track; |
320 |
|
OrbitalInfoTrkVar *r = track.orb_track; |
321 |
|
|
322 |
trk_track = 0; |
trk_track = 0; |
323 |
calo_track = 0; |
calo_track = 0; |
324 |
tof_track = 0; |
tof_track = 0; |
325 |
|
orb_track = 0; |
326 |
if(t)trk_track = new TrkTrack(*t); |
if(t)trk_track = new TrkTrack(*t); |
327 |
if(c)calo_track = new CaloTrkVar(*c); |
if(c)calo_track = new CaloTrkVar(*c); |
328 |
if(o)tof_track = new ToFTrkVar(*o); |
if(o)tof_track = new ToFTrkVar(*o); |
329 |
|
if(r)orb_track = new OrbitalInfoTrkVar(*r); |
330 |
candeleteobj = 1; |
candeleteobj = 1; |
331 |
|
|
332 |
} |
} |
337 |
if(trk_track) trk_track->TrkTrack::Clear(); |
if(trk_track) trk_track->TrkTrack::Clear(); |
338 |
if(calo_track) calo_track->CaloTrkVar::Clear();//??? |
if(calo_track) calo_track->CaloTrkVar::Clear();//??? |
339 |
if(tof_track) tof_track->ToFTrkVar::Clear();//??? |
if(tof_track) tof_track->ToFTrkVar::Clear();//??? |
340 |
|
if(orb_track) orb_track->OrbitalInfoTrkVar::Clear();//??? |
341 |
}else{ |
}else{ |
342 |
trk_track = 0; |
trk_track = 0; |
343 |
calo_track = 0; |
calo_track = 0; |
344 |
tof_track = 0; |
tof_track = 0; |
345 |
|
orb_track = 0; |
346 |
} |
} |
347 |
|
pscore = 0; |
348 |
|
iscore = 0; |
349 |
|
|
350 |
} |
} |
351 |
void PamTrack::Delete(){ |
void PamTrack::Delete(){ |
352 |
// cout << "PamTrack::Delete() "<<candeleteobj<<endl; |
// cout << "PamTrack::Delete() "<<candeleteobj<<endl; |
363 |
tof_track->ToFTrkVar::Clear();//??? |
tof_track->ToFTrkVar::Clear();//??? |
364 |
delete tof_track; |
delete tof_track; |
365 |
} |
} |
366 |
|
if(orb_track){ |
367 |
|
orb_track->OrbitalInfoTrkVar::Clear();//??? |
368 |
|
delete orb_track; |
369 |
|
} |
370 |
}else{ |
}else{ |
371 |
Clear(); |
Clear(); |
372 |
} |
} |
379 |
* Default Constructor |
* Default Constructor |
380 |
*/ |
*/ |
381 |
PamLevel2::PamLevel2(){ |
PamLevel2::PamLevel2(){ |
382 |
Initialize(); |
Initialize(); |
383 |
}; |
}; |
384 |
|
|
385 |
/** |
/** |
386 |
* Constructor with given dir, list and detectors |
* Constructor |
387 |
|
* @param ddir Name of directory where level2 files are stored. |
388 |
|
* @param list Name of an ascii file containing the list of file names |
389 |
|
* @param detlist Options to chose what to load. |
390 |
|
* Possible options are: |
391 |
|
* +AUTO --> load all trees/branches in the input files |
392 |
|
* +(-)ALL --> inlcude(exclude) all trees/branches |
393 |
|
* +(-)TRK1+(-)TRK2+(-)CAL1+(-)CAL2+(-)TOF+(-)TRG+(-)ND+(-)S4+(-)ORB+(-)AC --> inlcude(exclude) trees and branches |
394 |
|
* +(-)TRK0 --> include(exclude) tracker level0 tree |
395 |
|
* +(-)GP --> include exclude GPAMELA output tree |
396 |
|
* If no options are specified, the default is assumed. Default is: |
397 |
|
* +TRK2+CAL2+CAL1+TOF+TRG+ND+AC+S4+ORB |
398 |
*/ |
*/ |
399 |
PamLevel2::PamLevel2(TString ddir,TString list,TString detlist){ |
PamLevel2::PamLevel2(TString ddir,TString list,TString detlist){ |
400 |
Initialize(); |
Initialize(); |
401 |
GetPamTree(GetListOfLevel2Files(ddir,list),detlist); |
TList* listf = GetListOfLevel2Files(ddir,list); |
402 |
GetRunTree(GetListOfLevel2Files(ddir,list)); |
GetPamTree(listf,detlist); |
403 |
|
GetRunTree(listf); |
404 |
}; |
}; |
405 |
|
|
406 |
/** |
/** |
407 |
* Constructor with given dir and list |
* Constructor |
408 |
|
* @param ddir Name of directory where level2 files are stored. |
409 |
|
* @param list Name of an ascii file containing the list of file names |
410 |
|
* Default trees/branches are loaded. Default is: |
411 |
|
* +TRK2+CAL2+CAL1+TOF+TRG+ND+AC+S4+ORB |
412 |
*/ |
*/ |
413 |
PamLevel2::PamLevel2(TString ddir,TString list){ |
PamLevel2::PamLevel2(TString ddir,TString list){ |
414 |
Initialize(); |
Initialize(); |
415 |
GetPamTree(GetListOfLevel2Files(ddir,list),""); |
TList* listf = GetListOfLevel2Files(ddir,list); |
416 |
GetRunTree(GetListOfLevel2Files(ddir,list)); |
GetPamTree(listf,""); |
417 |
|
GetRunTree(listf); |
418 |
}; |
}; |
419 |
|
|
420 |
|
|
421 |
void PamLevel2::Initialize(){ |
void PamLevel2::Initialize(){ |
422 |
|
|
|
// trk2_obj = TrkLevel2::GetTrkLevel2(); |
|
|
// trk1_obj = TrkLevel1::GetTrkLevel1(); |
|
|
// trkh_obj = TrkHough::GetTrkHough(); |
|
|
// calo1_obj = CaloLevel1::GetCaloLevel1(); |
|
|
// calo2_obj = CaloLevel2::GetCaloLevel2(); |
|
|
// tof_obj = ToFLevel2::GetToFLevel2(); |
|
|
// trig_obj = TrigLevel2::GetTrigLevel2(); |
|
|
// s4_obj = S4Level2::GetS4Level2(); |
|
|
// nd_obj = NDLevel2::GetNDLevel2(); |
|
|
// ac_obj = AcLevel2::GetAcLevel2(); |
|
|
// orb_obj = OrbitalInfo::GetOrbitalInfo(); |
|
|
|
|
423 |
h0_obj = 0; |
h0_obj = 0; |
424 |
trk0_obj = 0; |
trk0_obj = 0; |
425 |
calo0_obj = 0; |
calo0_obj = 0; |
435 |
nd_obj = 0; |
nd_obj = 0; |
436 |
ac_obj = 0; |
ac_obj = 0; |
437 |
orb_obj = 0; |
orb_obj = 0; |
438 |
|
gp_obj = 0; |
439 |
|
|
440 |
run_obj = 0;//new GL_RUN(); |
run_obj = 0;//new GL_RUN(); |
441 |
soft_obj = 0;// Emiliano |
soft_obj = 0;// Emiliano |
442 |
irun = -1LL; |
irun = -1LL; |
443 |
|
irunt = -1LL; |
444 |
runfirstentry = 0LL; |
runfirstentry = 0LL; |
445 |
runlastentry = 0LL; |
runlastentry = 0LL; |
446 |
|
|
450 |
dbc = 0; |
dbc = 0; |
451 |
|
|
452 |
prevshift = 0; |
prevshift = 0; |
453 |
|
maxshift = 10; //EMILIANO |
454 |
|
|
455 |
run_tree = NULL; |
run_tree = NULL; |
456 |
run_tree_clone = NULL; |
run_tree_clone = NULL; |
461 |
pam_tree = NULL; |
pam_tree = NULL; |
462 |
for(Int_t i=0; i<NCLONES; i++ )pam_tree_clone[i]=NULL; |
for(Int_t i=0; i<NCLONES; i++ )pam_tree_clone[i]=NULL; |
463 |
|
|
464 |
|
totdltime[0] = 0LL; |
465 |
|
totdltime[1] = 0LL; |
466 |
|
totdltime[2] = 0LL; |
467 |
|
|
468 |
host = "mysql://localhost/pamelaprod"; |
host = "mysql://localhost/pamelaprod"; |
469 |
user = "anonymous"; |
user = "anonymous"; |
470 |
psw = ""; |
psw = ""; |
487 |
CAL2 = true; |
CAL2 = true; |
488 |
TRK2 = true; |
TRK2 = true; |
489 |
TRK1 = false; |
TRK1 = false; |
490 |
TRKh = false; |
TRK0 = false; |
491 |
TRKh = false; |
TRKh = false; |
492 |
TRG = true; |
TRG = true; |
493 |
TOF = true; |
TOF = true; |
495 |
S4 = true; |
S4 = true; |
496 |
ND = true; |
ND = true; |
497 |
AC = true; |
AC = true; |
498 |
ORB = true; |
ORB = true; |
499 |
|
GP = false; |
500 |
|
|
501 |
RUN = true; |
RUN = true; |
502 |
|
|
503 |
SELLI = -1; |
SELLI = -1; |
504 |
|
|
505 |
|
ISGP = false; |
506 |
|
|
507 |
|
DBG = false; |
508 |
|
|
509 |
tsorted=0; |
tsorted=0; |
510 |
timage=0; |
timage=0; |
511 |
|
|
537 |
if(nd_obj) delete nd_obj; |
if(nd_obj) delete nd_obj; |
538 |
if(ac_obj) delete ac_obj; |
if(ac_obj) delete ac_obj; |
539 |
if(orb_obj) delete orb_obj; |
if(orb_obj) delete orb_obj; |
540 |
|
if(gp_obj) delete gp_obj; |
541 |
|
|
542 |
if(tsorted){ |
if(tsorted){ |
543 |
tsorted->Delete(); |
tsorted->Delete(); |
556 |
if(l0_file)l0_file->Close(); |
if(l0_file)l0_file->Close(); |
557 |
// if(pam_tree)pam_tree->Delete();; |
// if(pam_tree)pam_tree->Delete();; |
558 |
|
|
559 |
if ( pam_tree ){ |
if ( pam_tree ){ |
560 |
// |
// |
561 |
// we have first to find which chains we have to delete, then delete the main chain and only after delete the friend chains. Any other order causes a segfault... |
// we have first to find which chains we have to delete, then delete the main chain and only after delete the friend chains. Any other order causes a segfault... |
562 |
// |
// |
563 |
TList *temp = pam_tree->GetListOfFriends(); |
TList *temp = pam_tree->GetListOfFriends(); |
564 |
TList *contents = new TList; // create chain friend list |
TList *contents = new TList; // create chain friend list |
565 |
contents->SetOwner(); |
contents->SetOwner(); |
566 |
TIter next(temp); |
TIter next(temp); |
567 |
TChain *questo = 0; |
TChain *questo = 0; |
568 |
while ( (questo = (TChain*) next()) ){ |
while ( (questo = (TChain*) next()) ){ |
569 |
TString name = questo->GetName(); |
TString name = questo->GetName(); |
570 |
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
571 |
}; |
}; |
572 |
// |
// |
573 |
// deleting the main chain |
// deleting the main chain |
574 |
// |
// |
575 |
pam_tree->Delete(); |
pam_tree->Delete(); |
576 |
// |
// |
577 |
// deleting the friends... |
// deleting the friends... |
578 |
// |
// |
579 |
TIter next2(contents); |
TIter next2(contents); |
580 |
TChain *questa = 0; |
TChain *questa = 0; |
581 |
while ( questa = (TChain*)next2() ){ |
while ( questa = (TChain*)next2() ){ |
582 |
TString name = questa->GetName(); |
TString name = questa->GetName(); |
583 |
questa->Delete(); |
questa->Delete(); |
584 |
questa=NULL; |
questa=NULL; |
585 |
|
}; |
586 |
|
// |
587 |
}; |
}; |
588 |
// |
pam_tree = NULL; |
|
}; |
|
|
pam_tree = NULL; |
|
589 |
|
|
590 |
if(run_tree)run_tree->Delete();; |
if(run_tree)run_tree->Delete();; |
591 |
if(sel_tree)sel_tree->Delete();; |
if(sel_tree)sel_tree->Delete();; |
593 |
if(run_tree_clone)run_tree_clone->Delete();; |
if(run_tree_clone)run_tree_clone->Delete();; |
594 |
if(sel_tree_clone)sel_tree_clone->Delete();; |
if(sel_tree_clone)sel_tree_clone->Delete();; |
595 |
|
|
596 |
|
if(irunoffset) delete [] irunoffset; |
597 |
|
|
598 |
}; |
}; |
599 |
|
|
626 |
if(nd_obj) nd_obj->Clear(); |
if(nd_obj) nd_obj->Clear(); |
627 |
if(ac_obj) ac_obj->Clear(); |
if(ac_obj) ac_obj->Clear(); |
628 |
if(orb_obj) orb_obj->Clear(); |
if(orb_obj) orb_obj->Clear(); |
629 |
|
if(gp_obj) gp_obj->Clear(); |
630 |
|
|
631 |
// if(sorted_tracks)sorted_tracks->Clear(); |
// if(sorted_tracks)sorted_tracks->Clear(); |
632 |
// sorted_tracks.Clear(); |
// sorted_tracks.Clear(); |
640 |
}; |
}; |
641 |
|
|
642 |
void PamLevel2::Reset(){ |
void PamLevel2::Reset(){ |
|
// |
|
|
// First of all clear everything |
|
|
// |
|
|
Clear(); |
|
|
// |
|
|
// close and reset chains and pointers |
|
|
// |
|
|
if ( pam_tree ){ |
|
643 |
// |
// |
644 |
// we have first to find which chains we have to delete, then delete the main chain and only after delete the friend chains. Any other order causes a segfault... |
// First of all clear everything |
645 |
// |
// |
646 |
TList *temp = pam_tree->GetListOfFriends(); |
Clear(); |
647 |
TList *contents = new TList; // create chain friend list |
// |
648 |
contents->SetOwner(); |
// close and reset chains and pointers |
649 |
TIter next(temp); |
// |
650 |
TChain *questo = 0; |
if ( pam_tree ){ |
651 |
while ( (questo = (TChain*) next()) ){ |
// |
652 |
TString name = questo->GetName(); |
// we have first to find which chains we have to delete, then delete the main chain and only after delete the friend chains. Any other order causes a segfault... |
653 |
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
// |
654 |
|
TList *temp = pam_tree->GetListOfFriends(); |
655 |
|
TList *contents = new TList; // create chain friend list |
656 |
|
contents->SetOwner(); |
657 |
|
TIter next(temp); |
658 |
|
TChain *questo = 0; |
659 |
|
while ( (questo = (TChain*) next()) ){ |
660 |
|
TString name = questo->GetName(); |
661 |
|
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
662 |
|
}; |
663 |
|
// |
664 |
|
// deleting the main chain |
665 |
|
// |
666 |
|
pam_tree->Delete(); |
667 |
|
// |
668 |
|
// deleting the friends... |
669 |
|
// |
670 |
|
TIter next2(contents); |
671 |
|
TChain *questa = 0; |
672 |
|
while ( questa = (TChain*)next2() ){ |
673 |
|
TString name = questa->GetName(); |
674 |
|
questa->Delete(); |
675 |
|
questa=NULL; |
676 |
|
}; |
677 |
|
// |
678 |
}; |
}; |
679 |
|
pam_tree = NULL; |
680 |
// |
// |
681 |
// deleting the main chain |
if(run_tree)run_tree->Delete();; |
682 |
|
run_tree = NULL; |
683 |
|
if(sel_tree)sel_tree->Delete();; |
684 |
|
sel_tree = NULL; |
685 |
// |
// |
686 |
pam_tree->Delete(); |
// Close file |
687 |
// |
// |
688 |
// deleting the friends... |
if(l0_file)l0_file->Close("R"); |
689 |
|
l0_file = NULL; |
690 |
// |
// |
691 |
TIter next2(contents); |
h0_obj = 0; |
692 |
TChain *questa = 0; |
trk0_obj = 0; |
693 |
while ( questa = (TChain*)next2() ){ |
calo0_obj = 0; |
694 |
TString name = questa->GetName(); |
// |
695 |
questa->Delete(); |
trk2_obj = 0; |
696 |
questa=NULL; |
trk1_obj = 0; |
697 |
}; |
trkh_obj = 0; |
698 |
|
calo1_obj = 0; |
699 |
|
calo2_obj = 0; |
700 |
|
tof_obj = 0; |
701 |
|
trig_obj = 0; |
702 |
|
s4_obj = 0; |
703 |
|
nd_obj = 0; |
704 |
|
ac_obj = 0; |
705 |
|
orb_obj = 0; |
706 |
|
gp_obj = 0; |
707 |
|
// |
708 |
|
// Reset run pointers |
709 |
|
// |
710 |
|
run_obj = 0;//new GL_RUN(); |
711 |
|
soft_obj = 0;// Emiliano |
712 |
|
irun = -1; |
713 |
|
irunt = -1; |
714 |
|
runfirstentry = 0ULL; |
715 |
|
runlastentry = 0ULL; |
716 |
|
// |
717 |
|
totdltime[0] = 0LL; |
718 |
|
totdltime[1] = 0LL; |
719 |
|
totdltime[2] = 0LL; |
720 |
// |
// |
|
}; |
|
|
pam_tree = NULL; |
|
|
// |
|
|
if(run_tree)run_tree->Delete();; |
|
|
run_tree = NULL; |
|
|
if(sel_tree)sel_tree->Delete();; |
|
|
sel_tree = NULL; |
|
|
// |
|
|
// Close file |
|
|
// |
|
|
if(l0_file)l0_file->Close("R"); |
|
|
l0_file = NULL; |
|
|
// |
|
|
h0_obj = 0; |
|
|
trk0_obj = 0; |
|
|
calo0_obj = 0; |
|
|
// |
|
|
trk2_obj = 0; |
|
|
trk1_obj = 0; |
|
|
trkh_obj = 0; |
|
|
calo1_obj = 0; |
|
|
calo2_obj = 0; |
|
|
tof_obj = 0; |
|
|
trig_obj = 0; |
|
|
s4_obj = 0; |
|
|
nd_obj = 0; |
|
|
ac_obj = 0; |
|
|
orb_obj = 0; |
|
|
// |
|
|
// Reset run pointers |
|
|
// |
|
|
run_obj = 0;//new GL_RUN(); |
|
|
soft_obj = 0;// Emiliano |
|
|
irun = -1; |
|
|
runfirstentry = 0ULL; |
|
|
runlastentry = 0ULL; |
|
|
// |
|
721 |
}; |
}; |
722 |
|
|
723 |
Bool_t PamLevel2::IsGood(){ |
Bool_t PamLevel2::IsGood(Bool_t strict){ |
724 |
Bool_t goodev=true; |
Bool_t goodev=true; |
725 |
// if(trk2_obj && trk2_obj->UnpackError() != 0 ) goodev = false; |
// |
726 |
if(calo2_obj && calo2_obj->good != 1) goodev = false; |
if(calo2_obj && !calo2_obj->IsGood(strict) ) goodev = false; |
727 |
if(tof_obj && tof_obj->unpackError != 0) goodev = false; |
// |
728 |
if(trig_obj && trig_obj->unpackError != 0) goodev = false; |
if ( strict ){ |
729 |
if(s4_obj && s4_obj->unpackError != 0) goodev = false; |
if(trk2_obj && trk2_obj->UnpackError() != 0 ) goodev = false; |
730 |
if(nd_obj && nd_obj->unpackError != 0) goodev = false; |
if(tof_obj && tof_obj->unpackError != 0) goodev = false; |
731 |
if(ac_obj && ac_obj->unpackError != 255) goodev = false; |
if(trig_obj && trig_obj->unpackError != 0) goodev = false; |
732 |
|
if(s4_obj && s4_obj->unpackError != 0) goodev = false; |
733 |
|
if(nd_obj && nd_obj->unpackError != 0) goodev = false; |
734 |
|
if(ac_obj && (ac_obj->unpackError != 0 || ((ac_obj->status[0]>>3)&1) || ((ac_obj->status[0]>>3)&1)) ) goodev = false; |
735 |
// if(orb_obj) |
// if(orb_obj) |
736 |
return goodev; |
} else { |
737 |
|
if(nd_obj && nd_obj->unpackError != 0) goodev = false; |
738 |
|
if(ac_obj && (ac_obj->unpackError != 0 || ((ac_obj->status[0]>>3)&1) || ((ac_obj->status[0]>>3)&1)) ) goodev = false; |
739 |
|
}; |
740 |
|
return(goodev); |
741 |
}; |
}; |
742 |
|
|
743 |
//-------------------------------------- |
//-------------------------------------- |
763 |
return &trk2_obj; |
return &trk2_obj; |
764 |
}; |
}; |
765 |
if(!objname.CompareTo("TrkHough")) { |
if(!objname.CompareTo("TrkHough")) { |
766 |
if(!trkh_obj) trkh_obj = new TrkHough(); |
if(!trkh_obj) { |
767 |
|
trkh_obj = new TrkHough(); |
768 |
|
trkh_obj->Set(); |
769 |
|
} |
770 |
return &trkh_obj; |
return &trkh_obj; |
771 |
}; |
}; |
772 |
if(!objname.CompareTo("CaloLevel1")) { |
if(!objname.CompareTo("CaloLevel1")) { |
807 |
if(!orb_obj) orb_obj = new OrbitalInfo(); |
if(!orb_obj) orb_obj = new OrbitalInfo(); |
808 |
return &orb_obj; |
return &orb_obj; |
809 |
}; |
}; |
810 |
|
if(!objname.CompareTo("GPamela")){ |
811 |
|
if(!gp_obj) gp_obj = new GPamela(); |
812 |
|
return &gp_obj; |
813 |
|
}; |
814 |
|
|
815 |
if(!objname.CompareTo("RunInfo"))return &run_obj; |
if(!objname.CompareTo("RunInfo"))return &run_obj; |
816 |
|
|
826 |
* Retrieves the calorimeter track matching the seqno-th tracker stored track. |
* Retrieves the calorimeter track matching the seqno-th tracker stored track. |
827 |
* (If seqno = -1 retrieves the self-trigger calorimeter track) |
* (If seqno = -1 retrieves the self-trigger calorimeter track) |
828 |
*/ |
*/ |
829 |
CaloTrkVar *PamLevel2::GetCaloStoredTrack(int seqno){ |
CaloTrkVar *PamLevel2::GetCaloStoredTrack(int seqno){ |
830 |
|
|
831 |
if( !calo2_obj )return 0; |
if( !calo2_obj )return 0; |
832 |
|
|
833 |
if( calo2_obj->CaloLevel2::ntrk()==0 ){ |
if( calo2_obj->CaloLevel2::ntrk()==0 ){ |
834 |
cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no Calorimeter tracks are stored"<<endl; |
cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no Calorimeter tracks are stored"<<endl; |
835 |
return NULL; |
return NULL; |
836 |
}; |
}; |
837 |
|
|
838 |
CaloTrkVar *c = 0; |
CaloTrkVar *c = 0; |
839 |
Int_t it_calo=0; |
Int_t it_calo=0; |
840 |
|
|
841 |
do{ |
do{ |
842 |
c = calo2_obj->CaloLevel2::GetCaloTrkVar(it_calo); |
c = calo2_obj->CaloLevel2::GetCaloTrkVar(it_calo); |
843 |
it_calo++; |
it_calo++; |
844 |
} while( c && seqno != c->trkseqno && it_calo < calo2_obj->CaloLevel2::ntrk()); |
} while( c && seqno != c->trkseqno && it_calo < calo2_obj->CaloLevel2::ntrk()); |
845 |
|
|
846 |
if(!c || seqno != c->trkseqno){ |
if(!c || seqno != c->trkseqno){ |
847 |
c = 0; |
c = 0; |
848 |
if(seqno!=-1)cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match Calorimeter stored tracks"<<endl; |
if(seqno!=-1)cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match Calorimeter stored tracks"<<endl; |
849 |
}; |
}; |
850 |
return c; |
return c; |
851 |
|
|
852 |
}; |
}; |
853 |
//-------------------------------------- |
//-------------------------------------- |
854 |
// |
// |
855 |
// |
// |
856 |
//-------------------------------------- |
//-------------------------------------- |
857 |
/** |
/** |
858 |
* Retrieves the ToF track matching the seqno-th tracker stored track. |
* Retrieves the ToF track matching the seqno-th tracker stored track. |
859 |
* (If seqno = -1 retrieves the tracker-independent tof track) |
* (If seqno = -1 retrieves the tracker-independent tof track) |
860 |
*/ |
*/ |
861 |
ToFTrkVar *PamLevel2::GetToFStoredTrack(int seqno){ |
ToFTrkVar *PamLevel2::GetToFStoredTrack(int seqno){ |
862 |
|
|
863 |
if( !tof_obj )return 0; |
if( !tof_obj )return 0; |
864 |
|
|
865 |
if( tof_obj->ToFLevel2::ntrk()==0 ){ |
if( tof_obj->ToFLevel2::ntrk()==0 ){ |
866 |
cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no ToF tracks are stored"<<endl; |
cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no ToF tracks are stored"<<endl; |
867 |
return NULL; |
return NULL; |
868 |
}; |
}; |
869 |
|
|
870 |
ToFTrkVar *c = 0; |
ToFTrkVar *c = 0; |
871 |
Int_t it_tof=0; |
Int_t it_tof=0; |
872 |
|
|
873 |
do{ |
do{ |
874 |
c = tof_obj->ToFLevel2::GetToFTrkVar(it_tof); |
c = tof_obj->ToFLevel2::GetToFTrkVar(it_tof); |
875 |
it_tof++; |
it_tof++; |
876 |
} while( c && seqno != c->trkseqno && it_tof < tof_obj->ToFLevel2::ntrk()); |
} while( c && seqno != c->trkseqno && it_tof < tof_obj->ToFLevel2::ntrk()); |
877 |
|
|
878 |
if(!c || seqno != c->trkseqno){ |
if(!c || seqno != c->trkseqno){ |
879 |
c = 0; |
c = 0; |
880 |
if(seqno!=-1)cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match ToF stored tracks"<<endl; |
if(seqno!=-1)cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match ToF stored tracks"<<endl; |
881 |
}; |
}; |
882 |
return c; |
return c; |
883 |
|
|
884 |
}; |
}; |
885 |
|
|
886 |
//-------------------------------------- |
//-------------------------------------- |
887 |
// |
// |
888 |
// |
// |
889 |
//-------------------------------------- |
//-------------------------------------- |
890 |
/** |
/** |
891 |
* Give the pamela track associated to a tracker track, retrieving related calorimeter and tof track information. |
* Retrieves the OrbitalInfo track matching the seqno-th tracker stored track. |
892 |
|
* (If seqno = -1 retrieves the tracker-independent tof related track) |
893 |
*/ |
*/ |
894 |
PamTrack* PamLevel2::GetPamTrackAlong(TrkTrack* t){ |
OrbitalInfoTrkVar *PamLevel2::GetOrbitalInfoStoredTrack(int seqno){ |
895 |
|
|
896 |
|
if( !orb_obj )return 0; |
897 |
|
|
898 |
|
if( orb_obj->OrbitalInfo::ntrk()==0 ){ |
899 |
|
cout << "PamLevel2::GetOrbitalInfoStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no OrbitalInfo tracks are stored"<<endl; |
900 |
|
return NULL; |
901 |
|
}; |
902 |
|
|
903 |
cout <<"PamLevel2::GetPamTrackAlong(TrkTrack* t) **obsolete** "<<endl; |
OrbitalInfoTrkVar *c = 0; |
904 |
cout <<"(if you use it, remember to delete the PamTrack object)"<<endl; |
Int_t it_tof=0; |
905 |
|
|
906 |
|
do{ |
907 |
|
c = orb_obj->OrbitalInfo::GetOrbitalInfoTrkVar(it_tof); |
908 |
|
it_tof++; |
909 |
|
} while( c && seqno != c->trkseqno && it_tof < orb_obj->OrbitalInfo::ntrk()); |
910 |
|
|
911 |
|
if(!c || seqno != c->trkseqno){ |
912 |
|
c = 0; |
913 |
|
if(seqno!=-1)cout << "PamLevel2::GetOrbitalInfoStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match OrbitalInfo stored tracks"<<endl; |
914 |
|
}; |
915 |
|
return c; |
916 |
|
|
917 |
|
}; |
918 |
|
|
919 |
|
//-------------------------------------- |
920 |
|
// |
921 |
|
// |
922 |
|
//-------------------------------------- |
923 |
|
/** |
924 |
|
* Give the pamela track associated to a tracker track, retrieving related calorimeter, orbitalinfo and tof track information. |
925 |
|
*/ |
926 |
|
PamTrack* PamLevel2::GetPamTrackAlong(TrkTrack* t){ |
927 |
|
|
928 |
|
cout <<"PamLevel2::GetPamTrackAlong(TrkTrack* t) **obsolete** "<<endl; |
929 |
|
cout <<"(if you use it, remember to delete the PamTrack object)"<<endl; |
930 |
|
|
931 |
CaloTrkVar *c = 0; |
CaloTrkVar *c = 0; |
932 |
ToFTrkVar *o = 0; |
ToFTrkVar *o = 0; |
933 |
|
OrbitalInfoTrkVar *r = 0; |
934 |
|
|
935 |
if(CAL2) c = GetCaloStoredTrack(t->GetSeqNo()); |
if(CAL2) c = GetCaloStoredTrack(t->GetSeqNo()); |
936 |
if(TOF) o = GetToFStoredTrack(t->GetSeqNo()); |
if(TOF) o = GetToFStoredTrack(t->GetSeqNo()); |
937 |
|
if(ORB) r = GetOrbitalInfoStoredTrack(t->GetSeqNo()); |
938 |
|
|
939 |
// if(t && c && o)track = new PamTrack(t,c,o); |
// if(t && c && o)track = new PamTrack(t,c,o); |
940 |
PamTrack *track = new PamTrack(t,c,o); |
PamTrack *track = new PamTrack(t,c,o,r); |
941 |
|
|
942 |
return track; |
return track; |
943 |
|
|
944 |
}; |
}; |
945 |
//-------------------------------------- |
//-------------------------------------- |
946 |
// |
// |
947 |
// |
// |
955 |
PamTrack* PamLevel2::GetStoredTrack(Int_t itrk){ |
PamTrack* PamLevel2::GetStoredTrack(Int_t itrk){ |
956 |
|
|
957 |
cout <<"PamLevel2::GetStoredTrack(Int_t itrk) **to-be-updated** "<<endl; |
cout <<"PamLevel2::GetStoredTrack(Int_t itrk) **to-be-updated** "<<endl; |
958 |
cout <<"for the moment, better use separately the methods: TrkLevel2::GetStoredTrack(seqno) CaloLevel2::GetCaloTrkVar(Int_t notrack) ToFLevel2::GetToFTrkVar(Int_t notrack)"<<endl; |
cout <<"for the moment, better use separately the methods: TrkLevel2::GetStoredTrack(seqno) CaloLevel2::GetCaloTrkVar(Int_t notrack) ToFLevel2::GetToFTrkVar(Int_t notrack) OrbitalInfo::GetOrbitalInfoTrkVar(Int_t notrack)"<<endl; |
959 |
cout <<"(if you use it, remember to delete the PamTrack object)"<<endl; |
cout <<"(if you use it, remember to delete the PamTrack object)"<<endl; |
960 |
PamTrack *track = 0; |
PamTrack *track = 0; |
961 |
|
|
977 |
// |
// |
978 |
|
|
979 |
/** |
/** |
980 |
* Sort physical (tracker) tracks and stores them in the TRefArray (of TrkTrack objects) which pointer is PamLevel2::sorted_tracks. Left here as backward compatibility method. |
* Sort physical (tracker) tracks. Left here as backward compatibility method. |
981 |
**/ |
**/ |
982 |
void PamLevel2::SortTracks(TString how){ |
void PamLevel2::SortTracks(TString how){ |
983 |
printf(" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n",how.Data()); |
printf(" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n",how.Data()); |
984 |
howtosort = how; |
howtosort = how; |
985 |
SortTracks(); |
SortTracks(); |
986 |
}; |
}; |
987 |
|
|
988 |
// |
// |
989 |
//-------------------------------------- |
//-------------------------------------- |
990 |
/** |
/** |
991 |
* Sort physical (tracker) tracks and stores them in the TRefArray (of TrkTrack objects) which pointer is PamLevel2::sorted_tracks. |
* Sort physical (tracker) tracks. |
992 |
* @param how String to set the sorting cryterium (es: "CAL" or "TRK+CAL+TOF" ecc...). |
* @param how String to set the sorting cryterium (es: "CAL" or "TRK+CAL+TOF" ecc...). |
993 |
* Sorting cryteria: |
* Sorting cryteria: |
994 |
* TRK: lower chi**2 |
* TRK: lower chi**2 |
995 |
* CAL: lower Y spatial residual on the first calorimeter plane |
* CAL: lower Y spatial residual on the first calorimeter plane |
996 |
* TOF: bigger numebr of hit PMTs along the track, on S12 S21 S32 (where paddles are along the Y axis). |
* TOF: bigger numebr of hit PMTs along the track, on S12 S21 S32 (where paddles are along the Y axis). |
997 |
|
* S1: (ask Emiliano) |
998 |
|
* S2: (ask Emiliano) |
999 |
|
* S3: (ask Emiliano) |
1000 |
|
* GP: more GP hits |
1001 |
* The default sorting cryterium is "TOF+CAL". |
* The default sorting cryterium is "TOF+CAL". |
1002 |
* |
* |
1003 |
* The total number of physical tracks is always given by GetNTracks() and the it-th physical track can be retrieved by means of the methods GetTrack(int it) and GetTrack(int it, TString how). |
* The total number of physical tracks is always given by GetNTracks() and the it-th physical track can be retrieved by means of the methods GetTrack(int it) and GetTrack(int it, TString how). |
1004 |
*/ |
*/ |
1005 |
void PamLevel2::SortTracks(){ |
void PamLevel2::SortTracks(){ |
1006 |
TString how = howtosort; |
TString how = howtosort; |
1007 |
|
|
1008 |
// cout <<" PamLevel2::SortTracks(TString how) "<<endl; |
// cout <<" PamLevel2::SortTracks(TString how) "<<endl; |
1009 |
if( !trk2_obj ){ |
if( !trk2_obj ){ |
1010 |
cout << "void PamLevel2::SortTracks(): TrkLevel2 not loaded !!!"; |
cout << "void PamLevel2::SortTracks(): TrkLevel2 not loaded !!!"; |
1011 |
return; |
return; |
1012 |
}; |
}; |
1013 |
// cout << "call SortTracs() "<<endl; |
//Save current Object count |
1014 |
//Save current Object count |
Int_t ObjectNumber = TProcessID::GetObjectCount(); |
|
Int_t ObjectNumber = TProcessID::GetObjectCount(); |
|
|
|
|
|
// cout << "ObjectNumber "<<ObjectNumber <<endl; |
|
|
|
|
|
// if(!sorted_tracks)sorted_tracks = new TRefArray(); |
|
|
// sorted_tracks->Clear(); |
|
|
// sorted_tracks.Clear(); |
|
|
|
|
|
if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
|
|
tsorted->Delete(); |
|
|
TClonesArray &ttsorted = *tsorted; |
|
|
if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
|
|
timage->Delete(); |
|
|
TClonesArray &ttimage = *timage; |
|
|
|
|
|
|
|
|
// loop over the tracks sorted by the tracker |
|
|
Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase); |
|
|
Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase); |
|
|
Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase); |
|
|
|
|
|
if( !CAL2 && use_CAL) use_CAL = false; |
|
|
if( !TOF && use_TOF) use_TOF = false; |
|
|
|
|
|
if( !TRK2 ){ |
|
|
// cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl; |
|
|
return; |
|
|
}; |
|
1015 |
|
|
1016 |
// cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl; |
// create TCloneArrays to store tracks and its images |
1017 |
|
if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
1018 |
for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){ |
tsorted->Delete(); |
1019 |
|
TClonesArray &ttsorted = *tsorted; |
1020 |
TrkTrack *ts = 0; |
|
1021 |
CaloTrkVar *cs = 0; |
if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
1022 |
ToFTrkVar *os = 0; |
timage->Delete(); |
1023 |
|
TClonesArray &ttimage = *timage; |
|
// get tracker tracks |
|
|
TrkTrack *tp = trk2_obj->TrkLevel2::GetTrack(i); //tracker |
|
|
CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo()); |
|
|
ToFTrkVar *op = GetToFStoredTrack(tp->GetSeqNo()); |
|
|
|
|
|
TrkTrack *ti = 0; //tracker (image) |
|
|
CaloTrkVar *ci = 0; |
|
|
ToFTrkVar *oi = 0; |
|
|
// cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl; |
|
|
// if track has an image, check image selection |
|
|
if(tp->HasImage()){ |
|
|
|
|
|
ti = trk2_obj->TrkLevel2::GetTrackImage(i); //tracker (image) |
|
|
ci = GetCaloStoredTrack(ti->GetSeqNo()); |
|
|
oi = GetToFStoredTrack(ti->GetSeqNo()); |
|
|
|
|
|
// cout << "its image "<<i << " "<<hex<< ti <<dec<< endl; |
|
1024 |
|
|
1025 |
//assign starting scores |
|
1026 |
Int_t tp_score = 0; //main track sorted by the tracker |
|
1027 |
Int_t ti_score = 0; //image track |
//-------------------------------------------------- |
1028 |
|
// retrieve sorting method |
1029 |
// ------------------------ |
//-------------------------------------------------- |
1030 |
// calorimeter check |
Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase); |
1031 |
// ------------------------ |
Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase); |
1032 |
// check the Y spatial residual on the first calorimeter plane |
Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase); |
1033 |
// (cut on calorimeter variables from Emiliano) |
Bool_t use_S1 = how.Contains("S1", TString::kIgnoreCase); |
1034 |
if( use_CAL && !calo2_obj ){ |
Bool_t use_S2 = how.Contains("S2", TString::kIgnoreCase); |
1035 |
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but CaloLevel2 not loaded !!!"; |
Bool_t use_S3 = how.Contains("S3", TString::kIgnoreCase); |
1036 |
|
Bool_t use_GP = how.Contains("GP", TString::kIgnoreCase); |
1037 |
|
|
1038 |
|
if ( use_TOF ){ |
1039 |
|
use_S1 = true; |
1040 |
|
use_S2 = true; |
1041 |
|
use_S3 = true; |
1042 |
|
}; |
1043 |
|
if( !CAL2 && use_CAL) use_CAL = false; |
1044 |
|
if( !TOF ){ |
1045 |
|
use_TOF = false; |
1046 |
|
use_S1 = false; |
1047 |
|
use_S2 = false; |
1048 |
|
use_S3 = false; |
1049 |
|
} |
1050 |
|
if( !GP ){ |
1051 |
|
use_GP = false; |
1052 |
|
} |
1053 |
|
|
1054 |
|
if( !TRK2 ){ |
1055 |
|
cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl; |
1056 |
return; |
return; |
1057 |
}; |
}; |
|
if( |
|
|
use_CAL && |
|
|
calo2_obj->npcfit[1] > 5 && //no. of fit planes on Y view |
|
|
calo2_obj->varcfit[1] < 1000. && //fit variance on Y view |
|
|
cp && ci && |
|
|
true){ |
|
1058 |
|
|
1059 |
|
// cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl; |
1060 |
Float_t resy_p = cp->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_p < 0)resy_p= - resy_p; |
|
1061 |
Float_t resy_i = ci->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_i < 0)resy_i= - resy_i; |
|
1062 |
|
//-------------------------------------------------- |
1063 |
if(resy_p <= resy_i) tp_score++; |
// loop over "physical" tracks sorted by the tracker |
1064 |
else ti_score++; |
//-------------------------------------------------- |
1065 |
|
for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){ |
1066 |
|
|
1067 |
|
TrkTrack *ts = 0; |
1068 |
|
CaloTrkVar *cs = 0; |
1069 |
|
ToFTrkVar *os = 0; |
1070 |
|
OrbitalInfoTrkVar *rs = 0; |
1071 |
|
|
1072 |
// cout << "CALO "<<tp_score<<ti_score<<endl; |
// get tracker tracks |
1073 |
|
TrkTrack *tp = trk2_obj->TrkLevel2::GetTrack(i); //tracker |
1074 |
|
CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo()); |
1075 |
|
ToFTrkVar *op = GetToFStoredTrack(tp->GetSeqNo()); |
1076 |
|
OrbitalInfoTrkVar *rp = GetOrbitalInfoStoredTrack(tp->GetSeqNo()); |
1077 |
|
|
1078 |
|
TrkTrack *ti = 0; //tracker (image) |
1079 |
|
CaloTrkVar *ci = 0; |
1080 |
|
ToFTrkVar *oi = 0; |
1081 |
|
OrbitalInfoTrkVar *ri = 0; |
1082 |
|
// cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl; |
1083 |
|
// if track has an image, check image selection |
1084 |
|
|
1085 |
|
Int_t tp_score = 0; //main track sorted by the tracker |
1086 |
|
Int_t ti_score = 0; //image track |
1087 |
|
Int_t totp_score = 0; //main track sorted by the tracker |
1088 |
|
Int_t toti_score = 0; //image track |
1089 |
|
|
1090 |
}; |
if(tp->HasImage()){ |
1091 |
// ------------------------ |
|
1092 |
// TOF check |
ti = trk2_obj->TrkLevel2::GetTrackImage(i); //tracker (image) |
1093 |
// ------------------------ |
ci = GetCaloStoredTrack(ti->GetSeqNo()); |
1094 |
// check the number of hit pmts along the track |
oi = GetToFStoredTrack(ti->GetSeqNo()); |
1095 |
// on S12 S21 and S32, where paddles are parallel to Y axis |
ri = GetOrbitalInfoStoredTrack(ti->GetSeqNo()); |
1096 |
if( use_TOF && !tof_obj ){ |
|
1097 |
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but ToFLevel2 not loaded !!!"; |
// cout << "its image "<<i << " "<<hex<< ti <<dec<< endl; |
1098 |
return; |
|
1099 |
}; |
//assign starting scores |
1100 |
if( use_TOF && op && oi ){ |
tp_score = 0; //main track sorted by the tracker |
1101 |
|
ti_score = 0; //image track |
1102 |
// |
|
1103 |
Float_t sen = 0.; |
// ----------------------------------------------------------------------------------------- |
1104 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
// ***************************************************************************************** |
1105 |
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
// ----------------------------------------------------------------------------------------- |
1106 |
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (op->dedx).At(ih); |
// calorimeter check |
1107 |
}; |
// ----------------------------------------------------------------------------------------- |
1108 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
if( use_CAL && !calo2_obj ){ |
1109 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but CaloLevel2 not loaded !!!"; |
1110 |
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (oi->dedx).At(ih); |
return; |
|
}; |
|
|
// |
|
|
if ( sen >= sortthr ){ |
|
|
//printf(" IS A NUCLEUS! en = %f \n",sen); |
|
|
// |
|
|
// is a nucleus use a different algorithm |
|
|
// |
|
|
Int_t nz = 6; Float_t zin[6]; // << define TOF z-coordinates |
|
|
for(Int_t ip=0; ip<nz; ip++) |
|
|
zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip)); // << read ToF plane z-coordinates |
|
|
Trajectory *tr = new Trajectory(nz,zin); |
|
|
// |
|
|
Int_t nphit_p =0; |
|
|
Int_t nphit_i =0; |
|
|
Float_t enhit_p = 0.; |
|
|
Float_t enhit_i = 0.; |
|
|
// |
|
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
|
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
|
|
if(pl == 1 || pl == 2 || pl == 5){ |
|
|
nphit_p++; |
|
|
enhit_p += (op->dedx).At(ih); |
|
|
}; |
|
|
}; |
|
|
// |
|
|
tp->DoTrack2(tr); |
|
|
// |
|
|
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
|
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
|
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
|
|
if(pl == 0){ |
|
|
nphit_p++; |
|
|
enhit_p += (op->dedx).At(ih); |
|
|
}; |
|
1111 |
}; |
}; |
1112 |
}; |
if( use_CAL && !cp && ci ){ |
1113 |
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
ti_score++; |
1114 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
toti_score++; |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
|
|
if(pl == 3){ |
|
|
nphit_p++; |
|
|
enhit_p += (op->dedx).At(ih); |
|
|
}; |
|
1115 |
}; |
}; |
1116 |
}; |
if( use_CAL && cp && !ci ){ |
1117 |
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
tp_score++; |
1118 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
totp_score++; |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
|
|
if(pl == 4){ |
|
|
nphit_p++; |
|
|
enhit_p += (op->dedx).At(ih); |
|
|
}; |
|
1119 |
}; |
}; |
1120 |
}; |
if( |
1121 |
|
use_CAL && |
1122 |
|
cp && ci && |
1123 |
|
true){ |
1124 |
|
|
1125 |
|
|
1126 |
|
if( |
1127 |
|
cp->npresh > ci->npresh && |
1128 |
|
true){ |
1129 |
|
tp_score++; |
1130 |
|
totp_score++; |
1131 |
|
}; |
1132 |
|
if( |
1133 |
|
cp->npresh < ci->npresh && |
1134 |
|
true){ |
1135 |
|
ti_score++; |
1136 |
|
toti_score++; |
1137 |
|
}; |
1138 |
|
|
1139 |
|
// cout << "CALO "<<tp_score<<ti_score<<endl; |
1140 |
|
|
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
|
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
|
|
if(pl == 1 || pl == 2 || pl == 5){ |
|
|
nphit_i++; |
|
|
enhit_i += (op->dedx).At(ih); |
|
1141 |
}; |
}; |
1142 |
}; |
// ----------------------------------------------------------------------------------------- |
1143 |
// |
// ***************************************************************************************** |
1144 |
ti->DoTrack2(tr); |
// ----------------------------------------------------------------------------------------- |
1145 |
// |
// TOF check |
1146 |
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
// ----------------------------------------------------------------------------------------- |
1147 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
// check the number of hit pmts along the track |
1148 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
// on S12 S21 and S32, where paddles are parallel to Y axis |
1149 |
if(pl == 0){ |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && !tof_obj ){ |
1150 |
nphit_i++; |
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but ToFLevel2 not loaded !!!"; |
1151 |
enhit_i += (op->dedx).At(ih); |
return; |
|
}; |
|
1152 |
}; |
}; |
1153 |
}; |
// |
1154 |
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && !op && oi ){ |
1155 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
ti_score++; |
1156 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
toti_score++; |
|
if(pl == 3){ |
|
|
nphit_i++; |
|
|
enhit_i += (op->dedx).At(ih); |
|
|
}; |
|
1157 |
}; |
}; |
1158 |
}; |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && op && !oi ){ |
1159 |
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
tp_score++; |
1160 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
totp_score++; |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
|
|
if(pl == 4){ |
|
|
nphit_i++; |
|
|
enhit_i += (op->dedx).At(ih); |
|
|
}; |
|
1161 |
}; |
}; |
1162 |
}; |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && op && oi ){ |
1163 |
|
// |
1164 |
|
Float_t sen = 0.; |
1165 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1166 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1167 |
|
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (op->dedx).At(ih); |
1168 |
|
}; |
1169 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1170 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1171 |
|
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (oi->dedx).At(ih); |
1172 |
|
}; |
1173 |
|
// |
1174 |
|
if ( sen >= sortthr && false){ // temporary disabled NUCLEI special algorithm since the new one should work for every particle (to be checked!) |
1175 |
|
//printf(" IS A NUCLEUS! en = %f \n",sen); |
1176 |
|
// |
1177 |
|
// is a nucleus use a different algorithm |
1178 |
|
// |
1179 |
|
Int_t nz = 6; Float_t zin[6]; // << define TOF z-coordinates |
1180 |
|
for(Int_t ip=0; ip<nz; ip++) |
1181 |
|
zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip)); // << read ToF plane z-coordinates |
1182 |
|
Trajectory *tr = new Trajectory(nz,zin); |
1183 |
|
// |
1184 |
|
Int_t nphit_p =0; |
1185 |
|
Int_t nphit_i =0; |
1186 |
|
Float_t enhit_p = 0.; |
1187 |
|
Float_t enhit_i = 0.; |
1188 |
|
// |
1189 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1190 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1191 |
|
if(pl == 1 || pl == 2 || pl == 5){ |
1192 |
|
nphit_p++; |
1193 |
|
enhit_p += (op->dedx).At(ih); |
1194 |
|
}; |
1195 |
|
}; |
1196 |
|
// |
1197 |
|
tp->DoTrack2(tr); |
1198 |
|
// |
1199 |
|
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
1200 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1201 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1202 |
|
if(pl == 0){ |
1203 |
|
nphit_p++; |
1204 |
|
enhit_p += (op->dedx).At(ih); |
1205 |
|
}; |
1206 |
|
}; |
1207 |
|
}; |
1208 |
|
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
1209 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1210 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1211 |
|
if(pl == 3){ |
1212 |
|
nphit_p++; |
1213 |
|
enhit_p += (op->dedx).At(ih); |
1214 |
|
}; |
1215 |
|
}; |
1216 |
|
}; |
1217 |
|
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
1218 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1219 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1220 |
|
if(pl == 4){ |
1221 |
|
nphit_p++; |
1222 |
|
enhit_p += (op->dedx).At(ih); |
1223 |
|
}; |
1224 |
|
}; |
1225 |
|
}; |
1226 |
|
|
1227 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1228 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1229 |
|
if(pl == 1 || pl == 2 || pl == 5){ |
1230 |
|
nphit_i++; |
1231 |
|
enhit_i += (op->dedx).At(ih); |
1232 |
|
}; |
1233 |
|
}; |
1234 |
|
// |
1235 |
|
ti->DoTrack2(tr); |
1236 |
|
// |
1237 |
|
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
1238 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1239 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1240 |
|
if(pl == 0){ |
1241 |
|
nphit_i++; |
1242 |
|
enhit_i += (op->dedx).At(ih); |
1243 |
|
}; |
1244 |
|
}; |
1245 |
|
}; |
1246 |
|
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
1247 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1248 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1249 |
|
if(pl == 3){ |
1250 |
|
nphit_i++; |
1251 |
|
enhit_i += (op->dedx).At(ih); |
1252 |
|
}; |
1253 |
|
}; |
1254 |
|
}; |
1255 |
|
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
1256 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1257 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1258 |
|
if(pl == 4){ |
1259 |
|
nphit_i++; |
1260 |
|
enhit_i += (op->dedx).At(ih); |
1261 |
|
}; |
1262 |
|
}; |
1263 |
|
}; |
1264 |
|
|
1265 |
|
|
1266 |
if( |
if( |
1267 |
use_TOF && |
(use_TOF || use_S1 || use_S2 || use_S3) && |
1268 |
(nphit_p+nphit_i) !=0 && |
(nphit_p+nphit_i) !=0 && |
1269 |
true){ |
true){ |
1270 |
|
|
1271 |
// printf(" seqno %i nphit_p %i nphit_i %i enhit_p %f enhit_i %f \n",trk2_obj->TrkLevel2::GetSeqNo(i),nphit_p,nphit_i,enhit_p,enhit_i); |
// printf(" seqno %i nphit_p %i nphit_i %i enhit_p %f enhit_i %f \n",trk2_obj->TrkLevel2::GetSeqNo(i),nphit_p,nphit_i,enhit_p,enhit_i); |
1272 |
// printf(" score p %i score i %i \n",tp_score,ti_score); |
// printf(" score p %i score i %i \n",tp_score,ti_score); |
1273 |
// if( enhit_p > enhit_i ) tp_score++; |
// if( enhit_p > enhit_i ) tp_score++; |
1274 |
// if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++; |
// if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++; |
1275 |
if ( nphit_p > nphit_i ) tp_score++; |
if ( nphit_p > nphit_i ) tp_score++; |
1276 |
if ( nphit_p < nphit_i ) ti_score++; |
if ( nphit_p < nphit_i ) ti_score++; |
1277 |
if ( nphit_p == nphit_i ){ |
if ( nphit_p == nphit_i ){ |
1278 |
if ( enhit_p > enhit_i ) tp_score++; |
if ( enhit_p > enhit_i ) tp_score++; |
1279 |
else ti_score++; |
else ti_score++; |
1280 |
}; |
}; |
1281 |
// printf(" dopo score p %i score i %i \n",tp_score,ti_score); |
// printf(" dopo score p %i score i %i \n",tp_score,ti_score); |
1282 |
}; |
}; |
1283 |
delete tr; |
delete tr; |
1284 |
// |
// |
1285 |
} else { |
} else { |
1286 |
// |
// ------------- |
1287 |
// NOT a NUCLEUS |
// NOT a NUCLEUS |
1288 |
// |
// ------------- |
1289 |
//printf(" NOT a NUCLEUS! en = %f \n",sen); |
//printf(" NOT a NUCLEUS! en = %f \n",sen); |
1290 |
|
|
1291 |
Int_t nphit_p =0; |
Int_t nphit_p =0; |
1292 |
Int_t nphit_i =0; |
Int_t nphit_i =0; |
1293 |
|
|
1294 |
|
|
1295 |
/* cout << "track: npmtadc "<< op->npmtadc << endl; |
/* cout << "track: npmtadc "<< op->npmtadc << endl; |
1296 |
cout << "track: npmttdc "<< op->npmttdc << endl; |
cout << "track: npmttdc "<< op->npmttdc << endl; |
1297 |
cout << "image: npmtadc "<< oi->npmtadc << endl; |
cout << "image: npmtadc "<< oi->npmtadc << endl; |
1298 |
cout << "image: npmttdc "<< oi->npmttdc << endl;*/ |
cout << "image: npmttdc "<< oi->npmttdc << endl;*/ |
1299 |
|
|
1300 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
// for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1301 |
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
// Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1302 |
if(pl == 1 || pl == 2 || pl == 5)nphit_p++; |
// if(pl == 1 || pl == 2 || pl == 5)nphit_p++; |
1303 |
}; |
// }; |
1304 |
|
|
1305 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
// for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1306 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
// Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1307 |
if(pl == 1 || pl == 2 || pl == 5)nphit_i++; |
// if(pl == 1 || pl == 2 || pl == 5)nphit_i++; |
1308 |
}; |
// }; |
1309 |
|
// --- modified to count tdc signals (more efficient?) |
1310 |
|
// --- and to implement check on tdcflag |
1311 |
|
for (Int_t ih=0; ih < op->npmttdc; ih++){ |
1312 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmttdc).At(ih) ); |
1313 |
|
// if( (op->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_p++; |
1314 |
|
if ( (use_S1 && ( pl == 0 || pl == 1 )) || (use_S2 && ( pl == 2 || pl == 3 )) || (use_S3 && ( pl == 4 || pl == 5 )) ){ |
1315 |
|
if( (op->tdcflag).At(ih)==0 )nphit_p++; |
1316 |
|
}; |
1317 |
|
}; |
1318 |
|
|
1319 |
if( |
for (Int_t ih=0; ih < oi->npmttdc; ih++){ |
1320 |
use_TOF && |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmttdc).At(ih) ); |
1321 |
(nphit_p+nphit_i) !=0 && |
// if( (oi->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_i++; |
1322 |
true){ |
if ( (use_S1 && ( pl == 0 || pl == 1 )) || (use_S2 && ( pl == 2 || pl == 3 )) || (use_S3 && ( pl == 4 || pl == 5 )) ){ |
1323 |
|
if( (oi->tdcflag).At(ih)==0 )nphit_i++; |
1324 |
|
}; |
1325 |
|
}; |
1326 |
|
|
1327 |
|
if( |
1328 |
|
(nphit_p+nphit_i) !=0 && |
1329 |
|
true){ |
1330 |
|
|
1331 |
if( nphit_p >= nphit_i) tp_score++; |
if ( nphit_p != nphit_i ){ |
1332 |
else ti_score++; |
totp_score += nphit_p; |
1333 |
}; |
toti_score += nphit_i; |
1334 |
}; |
tp_score+=nphit_p; |
1335 |
// cout << "TOF "<<tp_score<<ti_score<<endl; |
ti_score+=nphit_i; |
1336 |
}; |
}; |
1337 |
if(tp_score == ti_score) use_TRK = true; |
// if ( nphit_p > nphit_i) tp_score+=nphit_p; |
1338 |
// ------------------------ |
// else if( nphit_p < nphit_i) ti_score+=nphit_i; |
1339 |
// tracker check |
// else ;//niente |
1340 |
// ------------------------ |
}; |
1341 |
// chi**2 difference is not always large enough to distinguish among |
}; |
1342 |
// the real track and its image. |
// cout << "TOF "<<tp_score<<ti_score<<endl; |
1343 |
// Tracker check will be applied always when calorimeter and tof information is ambiguous. |
}; |
1344 |
if(use_TRK){ |
|
1345 |
if( tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ; |
|
1346 |
else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ; |
// if(tp_score == ti_score) use_TRK = true; |
1347 |
// cout << "TRK "<<tp_score<<ti_score<<endl; |
|
1348 |
}; |
|
1349 |
|
// ----------------------------------------------------------------------------------------- |
1350 |
|
// ***************************************************************************************** |
1351 |
|
// ----------------------------------------------------------------------------------------- |
1352 |
|
// tracker check |
1353 |
|
// ----------------------------------------------------------------------------------------- |
1354 |
|
// chi**2 difference is not always large enough to distinguish among |
1355 |
|
// the real track and its image. |
1356 |
|
// Tracker check will be applied always when calorimeter and tof information is ambiguous. |
1357 |
|
// *** MODIFIED ON AUGUST 2007 *** |
1358 |
|
if(use_TRK){ |
1359 |
|
// if( tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ; |
1360 |
|
// else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ; |
1361 |
|
|
1362 |
|
// CHECK 1 : number of points along X |
1363 |
|
if ( tp->GetNX() >= ti->GetNX() ){ |
1364 |
|
tp_score++ ; |
1365 |
|
totp_score++ ; |
1366 |
|
}; |
1367 |
|
if ( tp->GetNX() <= ti->GetNX() ){ |
1368 |
|
ti_score++ ; |
1369 |
|
toti_score++ ; |
1370 |
|
}; |
1371 |
|
// CHECK 2 : number of points along Y |
1372 |
|
if ( tp->GetNY() >= ti->GetNY() ){ |
1373 |
|
tp_score++ ; |
1374 |
|
totp_score++ ; |
1375 |
|
}; |
1376 |
|
if ( tp->GetNY() <= ti->GetNY() ){ |
1377 |
|
ti_score++ ; |
1378 |
|
toti_score++ ; |
1379 |
|
}; |
1380 |
|
|
1381 |
|
// cout << "TRK "<<tp_score<<ti_score<<endl; |
1382 |
|
}; |
1383 |
|
|
1384 |
// ------------------------ |
|
1385 |
// the winner is.... |
// ----------------------------------------------------------------------------------------- |
1386 |
// ------------------------ |
// ***************************************************************************************** |
1387 |
if (tp_score > ti_score) { |
// ----------------------------------------------------------------------------------------- |
1388 |
// ts = tp;//the track sorted by the tracker!! |
// GPamela check |
1389 |
// cs = cp; |
// ----------------------------------------------------------------------------------------- |
1390 |
// os = op; |
|
1391 |
// cout << "It's primary!" << endl; |
//--------------------------------------------------- |
1392 |
|
// count the number of GP hits |
1393 |
}else if (tp_score < ti_score) { |
//--------------------------------------------------- |
1394 |
|
if(use_GP){ |
1395 |
// cout << "It's image!" << endl; |
int ngphits_p=0; |
1396 |
|
int ngphits_i=0; |
1397 |
ts = ti;//its image!! |
float toll = 0.02; //200 micron |
1398 |
cs = ci; |
for(int ih=0; ih<GetGPamela()->Nthspe; ih++){ |
1399 |
os = oi; |
int ip = (Int_t) GetGPamela()->Itrpb[ih] - 1; |
1400 |
|
if( |
1401 |
ti = tp;//its image!! |
tp && |
1402 |
ci = cp; |
tp->YGood(ip) && |
1403 |
oi = op; |
fabs(tp->ym[ip]- GetGPamela()->Yavspe[ih])<toll && |
1404 |
|
true) ngphits_p++; |
1405 |
tp = ts;//its image!! |
if( ti && |
1406 |
cp = cs; |
ti->YGood(ip) && |
1407 |
op = os; |
fabs(ti->ym[ip]- GetGPamela()->Yavspe[ih])<toll && |
1408 |
|
true) ngphits_i++; |
1409 |
|
} |
1410 |
|
if( |
1411 |
|
ngphits_p > ngphits_i && |
1412 |
|
true){ |
1413 |
|
tp_score++ ; |
1414 |
|
totp_score++ ; |
1415 |
|
} |
1416 |
|
if( |
1417 |
|
ngphits_p < ngphits_i && |
1418 |
|
true){ |
1419 |
|
ti_score++ ; |
1420 |
|
toti_score++ ; |
1421 |
|
} |
1422 |
|
} |
1423 |
|
|
1424 |
|
|
1425 |
|
// *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* |
1426 |
|
// the winner is.... |
1427 |
|
// *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* |
1428 |
|
if (tp_score > ti_score) { |
1429 |
|
|
1430 |
|
|
1431 |
|
}else if (tp_score < ti_score) { |
1432 |
|
|
1433 |
|
|
1434 |
|
ts = ti;//its image!! |
1435 |
|
cs = ci; |
1436 |
|
os = oi; |
1437 |
|
rs = ri; |
1438 |
|
Int_t totis = toti_score; |
1439 |
|
|
1440 |
|
ti = tp;//its image!! |
1441 |
|
ci = cp; |
1442 |
|
oi = op; |
1443 |
|
ri = rp; |
1444 |
|
|
1445 |
|
tp = ts;//its image!! |
1446 |
|
cp = cs; |
1447 |
|
op = os; |
1448 |
|
rp = rs; |
1449 |
|
|
1450 |
|
toti_score = totp_score; |
1451 |
|
totp_score = totis; |
1452 |
|
|
1453 |
|
|
1454 |
}else { |
}else { |
1455 |
// ts = tp; |
|
|
// cs = cp; |
|
|
// os = op; |
|
1456 |
// cout << "Warning - track image ambiguity not solved" << endl; |
// cout << "Warning - track image ambiguity not solved" << endl; |
1457 |
// cout << ts->GetNtot() << " "<< ts->chi2 << " " << npcfit[1] << " "<< nphit_p << endl; |
|
1458 |
}; |
}; |
1459 |
|
|
1460 |
}else{ |
}else{ |
1461 |
// ts = tp; |
totp_score = 1; |
1462 |
// cs = cp; |
toti_score = 0; |
1463 |
// os = op; |
|
1464 |
}; |
// ts = tp; |
1465 |
|
// cs = cp; |
1466 |
|
// os = op; |
1467 |
|
}; |
1468 |
|
|
1469 |
// cout <<" SortTracks() "<<i<<" -- "<<ts<<endl; |
// cout <<" SortTracks() "<<i<<" -- "<<ts<<endl; |
1470 |
// sorted_tracks->Add(ts);//save the track in the sorted array |
// sorted_tracks->Add(ts);//save the track in the sorted array |
1471 |
// sorted_tracks.Add(ts);//save the track in the sorted array |
// sorted_tracks.Add(ts);//save the track in the sorted array |
1472 |
// sorted_tracks.Add(tp);//save the track in the sorted array |
// sorted_tracks.Add(tp);//save the track in the sorted array |
1473 |
// cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl; |
// cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl; |
1474 |
// cout<<"o "<<tp<<endl; |
// cout<<"o "<<tp<<endl; |
1475 |
// cout<<"o "<<cp<<endl; |
// cout<<"o "<<cp<<endl; |
1476 |
// cout<<"o "<<op<<endl; |
// cout<<"o "<<op<<endl; |
1477 |
new(ttsorted[i]) PamTrack(tp,cp,op); |
|
1478 |
new(ttimage[i]) PamTrack(ti,ci,oi); |
new(ttsorted[i]) PamTrack(tp,cp,op,rp); |
1479 |
}; |
new(ttimage[i]) PamTrack(ti,ci,oi,ri); |
1480 |
|
|
1481 |
|
((PamTrack*)(ttsorted[i]))->SetPScore(totp_score); |
1482 |
|
((PamTrack*)(ttsorted[i]))->SetIScore(toti_score); |
1483 |
|
((PamTrack*)(ttimage[i]))->SetPScore(totp_score); |
1484 |
|
((PamTrack*)(ttimage[i]))->SetIScore(toti_score); |
1485 |
|
}; |
1486 |
|
|
1487 |
|
if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){ |
1488 |
|
cout << "void PamLevel2::SortTracks(): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl; |
1489 |
|
tsorted->Delete(); tsorted=0; |
1490 |
|
timage->Delete(); timage=0; |
1491 |
|
} |
1492 |
|
|
1493 |
if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){ |
//Restore Object count |
1494 |
cout << "void PamLevel2::SortTracks(): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl; |
//To save space in the table keeping track of all referenced objects |
1495 |
tsorted->Delete(); tsorted=0; |
//We reset the object count to what it was at the beginning of the event. |
1496 |
timage->Delete(); timage=0; |
TProcessID::SetObjectCount(ObjectNumber); |
|
} |
|
|
|
|
|
//Restore Object count |
|
|
//To save space in the table keeping track of all referenced objects |
|
|
//We reset the object count to what it was at the beginning of the event. |
|
|
TProcessID::SetObjectCount(ObjectNumber); |
|
1497 |
|
|
1498 |
}; |
}; |
1499 |
//-------------------------------------- |
//-------------------------------------- |
1522 |
|
|
1523 |
return tsorted; |
return tsorted; |
1524 |
|
|
1525 |
}; |
}; |
1526 |
//-------------------------------------- |
//-------------------------------------- |
1527 |
// |
// |
1528 |
// |
// |
1529 |
//-------------------------------------- |
//-------------------------------------- |
1530 |
/** |
/** |
1531 |
* Retrieves the it-th Pamela "physical" track. |
* Retrieves the it-th Pamela "physical" track. |
1586 |
*/ |
*/ |
1587 |
PamTrack *PamLevel2::GetTrackImage(int it){ |
PamTrack *PamLevel2::GetTrackImage(int it){ |
1588 |
|
|
|
// if(!trk2_obj) return 0; |
|
|
|
|
|
// // *-*-*-*-*-*-*-*-*-*-*-*-* |
|
|
// SortTracks("+CAL+TOF"); |
|
|
// // *-*-*-*-*-*-*-*-*-*-*-*-* |
|
|
// // if(!sorted_tracks)return 0; |
|
|
// if(sorted_tracks.IsEmpty())return 0; |
|
|
|
|
|
// PamTrack *image = 0; |
|
|
|
|
|
// if( it >=0 && it < trk2_obj->TrkLevel2::GetNTracks() ){ |
|
|
// TrkTrack *temp = (TrkTrack*)sorted_tracks.At(it); |
|
|
// if( temp->HasImage() ){ |
|
|
// TrkTrack *t = trk2_obj->TrkLevel2::GetStoredTrack(temp->GetImageSeqNo()); |
|
|
// image = GetPamTrackAlong(t); |
|
|
// }else{ |
|
|
// cout <<"PamLevel2::GetTrackImage(int) : Track SeqNo "<<it<<" does not have image"<<endl; |
|
|
// }; |
|
|
// }else{ |
|
|
// cout << "PamLevel2::GetTrackImage(int) : Tracker track SeqNo "<< it <<" does not exist (GetNTracks() = "<<trk2_obj->TrkLevel2::GetNTracks()<<")"<<endl; |
|
|
// }; |
|
|
|
|
|
// return image; |
|
|
|
|
|
|
|
1589 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1590 |
SortTracks(); |
SortTracks(); |
1591 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1622 |
*/ |
*/ |
1623 |
TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ){ |
TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ){ |
1624 |
|
|
1625 |
// if( !detlist.IsNull() ) SetWhichTrees(detlist); |
if( detlist.Contains("+AUTO", TString::kIgnoreCase) ) { |
1626 |
// else GetWhichTrees(f); |
cout << "+AUTO"<<endl; |
1627 |
if ( pam_tree ){ |
GetWhichTrees(f); |
1628 |
printf("WARNING: TTree *PamLevel2::GetPamTree(TFile *fl, TString detlist) -- pam_tree already exists!\n "); |
}; |
1629 |
return pam_tree; |
SetWhichTrees(detlist); |
1630 |
}; |
|
1631 |
// |
if ( pam_tree ){ |
1632 |
|
printf("WARNING: TTree *PamLevel2::GetPamTree(TFile *fl, TString detlist) -- pam_tree already exists!\n "); |
1633 |
|
return pam_tree; |
1634 |
|
}; |
1635 |
|
// |
1636 |
|
|
1637 |
cout << "TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ) -- obsolte "<<endl; |
cout << "TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ) -- obsolte "<<endl; |
1638 |
|
|
1639 |
SetWhichTrees(detlist); |
// SetWhichTrees(detlist); |
1640 |
|
|
1641 |
TTree *Trout =0; |
TTree *Trout =0; |
1642 |
|
|
1657 |
if(ND)cout<<"ND "; |
if(ND)cout<<"ND "; |
1658 |
if(S4)cout<<"S4 "; |
if(S4)cout<<"S4 "; |
1659 |
if(ORB)cout<<"ORB "; |
if(ORB)cout<<"ORB "; |
1660 |
|
if(GP)cout<<"GP "; |
1661 |
cout << endl; |
cout << endl; |
1662 |
if(SELLI)cout<<">>> Found selection-list <<<"<<endl; |
if(SELLI)cout<<">>> Found selection-list <<<"<<endl; |
1663 |
|
|
1756 |
cout << "OrbitalInfo : missing tree"<<endl; |
cout << "OrbitalInfo : missing tree"<<endl; |
1757 |
}; |
}; |
1758 |
|
|
1759 |
|
// GPamela |
1760 |
|
TTree *G = (TTree*)f->Get("h20"); |
1761 |
|
if(G && GP) { |
1762 |
|
if(!gp_obj)gp_obj=new GPamela(); |
1763 |
|
// ------------------------------------ |
1764 |
|
// ATTENZIONE!!! |
1765 |
|
// non so per quale arcano motivo, |
1766 |
|
// per l'albero di gpamela il branch address lo devo settare |
1767 |
|
// DOPO aver fatto friend |
1768 |
|
// FGRRRVZZZZUTSALKJMSLKJ!!! |
1769 |
|
// ------------------------------------ |
1770 |
|
// gp_obj->SetBranchAddress(G); //ho dovuto fare in maniera diversa dagli altri |
1771 |
|
// cout << "h20 : set branch address GPamela "<<endl; |
1772 |
|
if(!Trout)Trout=G; |
1773 |
|
else Trout->AddFriend(G); |
1774 |
|
}else{ |
1775 |
|
// cout << "h20 : missing tree"<<endl; |
1776 |
|
}; |
1777 |
|
|
1778 |
|
|
1779 |
TTree *L = (TTree*)f->Get("SelectionList"); |
TTree *L = (TTree*)f->Get("SelectionList"); |
1780 |
if(L && SELLI==1) { |
if(L && SELLI==1) { |
1781 |
// L->SetBranchAddress("RunEntry",&irun); |
cout << " TTree *PamLevel2::GetPamTree(TFile, TString) >>> SelectionList not implemented!!!!"<<endl; |
|
// cout << "SelectionList: set branch address RunEntry"<<endl; |
|
|
// L->SetBranchAddress("EventEntry",&irunentry); |
|
|
// cout << "SelectionList: set branch address EventEntry"<<endl; |
|
|
// if(!Trout)Trout=O; |
|
|
// else Trout->AddFriend("SelectionList"); |
|
|
cout << " TTree *PamLevel2::GetPamTree(TFile, TString) >>> SelectionList not implemente!!!!"<<endl; |
|
1782 |
sel_tree = 0; |
sel_tree = 0; |
1783 |
}else{ |
}else{ |
1784 |
cout << "SelectionList : missing tree"<<endl; |
cout << "SelectionList : missing tree"<<endl; |
1786 |
|
|
1787 |
cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
1788 |
|
|
1789 |
|
// ------------------------------------ |
1790 |
|
// ATTENZIONE!!! |
1791 |
|
// non so per quale arcano motivo, |
1792 |
|
// per l'albero di gpamela il branch address lo devo settare |
1793 |
|
// DOPO aver fatto friend |
1794 |
|
// FGRRRVZZZZUTSALKJMSLKJ!!! |
1795 |
|
// ------------------------------------ |
1796 |
|
if(G && GP) { |
1797 |
|
gp_obj->SetBranchAddress(Trout); //ho dovuto fare in maniera diversa dagli altri |
1798 |
|
cout << "h20 : set branch address GPamela "<<endl; |
1799 |
|
}else{ |
1800 |
|
cout << "h20 : missing tree"<<endl; |
1801 |
|
}; |
1802 |
|
|
1803 |
pam_tree = (TChain*)Trout; |
pam_tree = (TChain*)Trout; |
1804 |
|
|
1805 |
return Trout; |
return Trout; |
1823 |
// if(ddir=="")ddir = wdir; |
// if(ddir=="")ddir = wdir; |
1824 |
// TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
// TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
1825 |
if ( ddir != ""){ |
if ( ddir != ""){ |
1826 |
cout << "Level2 data directory : "<< ddir << endl; |
cout << "Level2 data directory : "<< ddir << endl; |
1827 |
} else { |
} else { |
1828 |
cout << "Level2 data directory not given as input: trying to evaluate from list or taking working directory " << endl; |
cout << "Level2 data directory not given as input: trying to evaluate from list or taking working directory " << endl; |
1829 |
}; |
}; |
1830 |
TList *contents = new TList; // create output list |
TList *contents = new TList; // create output list |
1831 |
contents->SetOwner(); |
contents->SetOwner(); |
1842 |
// return 0; |
// return 0; |
1843 |
// } |
// } |
1844 |
// flisttxt = fullpath; |
// flisttxt = fullpath; |
1845 |
if ( !flisttxt.EndsWith(".root") ){ |
if ( !flisttxt.EndsWith(".root") ){ |
1846 |
|
|
1847 |
flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
1848 |
|
|
1849 |
if( !gSystem->ChangeDirectory(ddir) ){ |
if( !gSystem->ChangeDirectory(ddir) ){ |
1850 |
cout << "Cannot change directory : "<<ddir<<endl; |
cout << "Cannot change directory : "<<ddir<<endl; |
1851 |
return 0; |
return 0; |
|
} |
|
|
|
|
|
cout <<"Input file list : " << flisttxt <<endl; |
|
|
ifstream in; |
|
|
in.open(flisttxt, ios::in); //open input file list |
|
|
if(!in.good()){ |
|
|
cout <<" ERROR opening the file "<<endl; |
|
|
gSystem->ChangeDirectory(wdir); // back to the working directory |
|
|
return 0; |
|
|
} |
|
|
int line=0; |
|
|
while (1) { |
|
|
TString file; |
|
|
in >> file; |
|
|
if (!in.good()) break; |
|
|
line++; |
|
|
// cout <<"(1) " << file << endl; |
|
|
if(file.IsNull()){ |
|
|
cout << "-- list interrupted at line "<<line <<endl; |
|
|
break; |
|
1852 |
} |
} |
1853 |
if(file.Contains("#"))file = file(0,file.First("#")); |
|
1854 |
|
cout <<"Input file list : " << flisttxt <<endl; |
1855 |
|
ifstream in; |
1856 |
|
in.open(flisttxt, ios::in); //open input file list |
1857 |
|
if(!in.good()){ |
1858 |
|
cout <<" ERROR opening the file "<<endl; |
1859 |
|
gSystem->ChangeDirectory(wdir); // back to the working directory |
1860 |
|
return 0; |
1861 |
|
} |
1862 |
|
int line=0; |
1863 |
|
while (1) { |
1864 |
|
TString file; |
1865 |
|
in >> file; |
1866 |
|
if (!in.good()) break; |
1867 |
|
line++; |
1868 |
|
// cout <<"(1) " << file << endl; |
1869 |
|
if(file.IsNull()){ |
1870 |
|
cout << "-- list interrupted at line "<<line <<endl; |
1871 |
|
break; |
1872 |
|
} |
1873 |
|
if(file.Contains("#"))file = file(0,file.First("#")); |
1874 |
// cout <<"(2) " << file << endl; |
// cout <<"(2) " << file << endl; |
1875 |
// if( gSystem->IsFileInIncludePath(file,&fullpath) ){ |
// if( gSystem->IsFileInIncludePath(file,&fullpath) ){ |
1876 |
// if( (fullpath = gSystem->FindFile(ddir,file)) ){ |
// if( (fullpath = gSystem->FindFile(ddir,file)) ){ |
1877 |
if( file.EndsWith(".root") ){ |
if( file.EndsWith(".root") ){ |
1878 |
TString filedir; |
TString filedir; |
1879 |
if (ddir != ""){ |
if (ddir != ""){ |
1880 |
filedir = ddir; // take the input dir |
filedir = ddir; // take the input dir |
1881 |
} else { |
} else { |
1882 |
gSystem->ChangeDirectory(wdir); // back to the working directory |
gSystem->ChangeDirectory(wdir); // back to the working directory |
1883 |
filedir = gSystem->DirName(file); // this will take the path if exist in the list otherwise it will return automatically the working dir |
filedir = gSystem->DirName(file); // this will take the path if exist in the list otherwise it will return automatically the working dir |
1884 |
}; |
}; |
1885 |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(filedir),gSystem->BaseName(file)); |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(filedir),gSystem->BaseName(file)); |
1886 |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
1887 |
delete fullpath; |
delete fullpath; |
1888 |
} |
} |
1889 |
// }else{ |
// }else{ |
1890 |
// if(file.Data()!="")cout << "File: "<<file<<" ---> missing "<< endl; |
// if(file.Data()!="")cout << "File: "<<file<<" ---> missing "<< endl; |
1891 |
// }; |
// }; |
1892 |
}; |
}; |
1893 |
in.close(); |
in.close(); |
1894 |
} else { |
} else { |
1895 |
if(flisttxt.Contains("#"))flisttxt = flisttxt(0,flisttxt.First("#")); |
if(flisttxt.Contains("#"))flisttxt = flisttxt(0,flisttxt.First("#")); |
1896 |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
1897 |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
1898 |
delete fullpath; |
delete fullpath; |
1899 |
}; |
}; |
1900 |
}else{ |
}else{ |
1901 |
|
|
1902 |
cout << "No input file list given."<<endl; |
cout << "No input file list given."<<endl; |
1903 |
cout << "Check for existing root files."<<endl; |
cout << "Check for existing root files."<<endl; |
1904 |
// cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl; |
// cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl; |
1905 |
if ( ddir == "" ){ |
if ( ddir == "" ){ |
1906 |
ddir = wdir; |
ddir = wdir; |
1907 |
cout << "Level2 data directory : "<< ddir << endl; |
cout << "Level2 data directory : "<< ddir << endl; |
1908 |
}; |
}; |
1909 |
|
|
1910 |
TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
1950 |
* @return Pointer to a TChain |
* @return Pointer to a TChain |
1951 |
*/ |
*/ |
1952 |
TChain *PamLevel2::GetPamTree(TList *fl, TString detlist ){ |
TChain *PamLevel2::GetPamTree(TList *fl, TString detlist ){ |
1953 |
// |
// |
1954 |
// |
// |
1955 |
// |
// |
1956 |
if ( pam_tree ){ |
if ( pam_tree ){ |
1957 |
printf("WARNING: TChain *PamLevel2::GetPamTree(TList *fl, TString detlist) -- pam_tree already exists!\n "); |
printf("WARNING: TChain *PamLevel2::GetPamTree(TList *fl, TString detlist) -- pam_tree already exists!\n "); |
1958 |
return pam_tree; |
return pam_tree; |
1959 |
}; |
}; |
1960 |
// |
// |
1961 |
|
|
1962 |
TChain *Trout =0; |
TChain *Trout =0; |
1963 |
|
|
1964 |
// if( !detlist.IsNull() )SetWhichTrees(detlist); |
// ------------------------------------------- |
1965 |
SetWhichTrees(detlist); |
// set flags to include/exclude trees/branches |
1966 |
|
// ------------------------------------------- |
1967 |
cout<< "GetPamTree(TList*,TString): input detector list --> "; |
if( detlist.Contains("+AUTO", TString::kIgnoreCase) ) { |
1968 |
if(TRK1)cout<<"TRK1 "; |
if( fl->GetEntries()>0 ){ |
1969 |
if(TRK2)cout<<"TRK2 "; |
cout << "+AUTO"<<endl; |
1970 |
if(TRKh)cout<<"TRKH "; |
TFile *fprimo = new TFile( fl->At(0)->GetName() ); |
1971 |
if(CAL1)cout<<"CAL1 "; |
GetWhichTrees(fprimo); |
1972 |
if(CAL2)cout<<"CAL2 "; |
fprimo->Close();// AAAAARGGGGGHHHHH!!!!!!! non commentare questa riga, altrimenti si incasina il TChain |
1973 |
if(TOF)cout<<"TOF "; |
fprimo->Delete(); |
1974 |
if(TRG)cout<<"TRG "; |
} |
1975 |
if(AC)cout<<"AC "; |
}; |
1976 |
if(ND)cout<<"ND "; |
SetWhichTrees(detlist); |
1977 |
if(S4)cout<<"S4 "; |
|
|
if(ORB)cout<<"ORB "; |
|
|
cout << endl; |
|
1978 |
|
|
1979 |
TChain *T = 0; |
// ------------------------------------------- |
1980 |
TChain *C = 0; |
// build chains |
1981 |
TChain *O = 0; |
// ------------------------------------------- |
1982 |
TChain *R = 0; |
TChain *T = 0; |
1983 |
TChain *S = 0; |
TChain *C = 0; |
1984 |
TChain *N = 0; |
TChain *O = 0; |
1985 |
TChain *A = 0; |
TChain *R = 0; |
1986 |
TChain *B = 0; |
TChain *S = 0; |
1987 |
|
TChain *N = 0; |
1988 |
|
TChain *A = 0; |
1989 |
|
TChain *B = 0; |
1990 |
|
TChain *G = 0; |
1991 |
|
|
1992 |
TChain *L = 0; |
TChain *L = 0; |
1993 |
|
|
1994 |
if(TRK2||TRK1||TRKh) T = new TChain("Tracker"); |
if(TRK2||TRK1||TRKh) T = new TChain("Tracker"); |
1995 |
if(CAL2||CAL1) C = new TChain("Calorimeter"); |
if(CAL2||CAL1) C = new TChain("Calorimeter"); |
1999 |
if(ND) N = new TChain("NeutronD"); |
if(ND) N = new TChain("NeutronD"); |
2000 |
if(AC) A = new TChain("Anticounter"); |
if(AC) A = new TChain("Anticounter"); |
2001 |
if(ORB) B = new TChain("OrbitalInfo"); |
if(ORB) B = new TChain("OrbitalInfo"); |
2002 |
L = new TChain("SelectionList"); |
if(GP) G = new TChain("h20"); |
2003 |
|
L = new TChain("SelectionList"); |
2004 |
|
|
2005 |
// loop over files and create chains |
// loop over files and create chains |
2006 |
TIter next(fl); |
TIter next(fl); |
2017 |
if(ND) N->Add(name); |
if(ND) N->Add(name); |
2018 |
if(AC) A->Add(name); |
if(AC) A->Add(name); |
2019 |
if(ORB) B->Add(name); |
if(ORB) B->Add(name); |
2020 |
|
if(GP) G->Add(name); |
2021 |
if(SELLI==1) L->Add(name); |
if(SELLI==1) L->Add(name); |
2022 |
}; |
}; |
2023 |
}; |
}; |
2024 |
|
|
2025 |
cout << "done chain \n"; |
cout << "done chains\n"; |
2026 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
2027 |
|
|
2028 |
// UInt_t *found=0; |
|
2029 |
|
// ------------------------------------------- |
2030 |
|
// make friends |
2031 |
|
// ------------------------------------------- |
2032 |
|
|
2033 |
// Tracker |
// Tracker |
2034 |
|
cout << "Friends: "<<endl; |
2035 |
if(T && (TRK2||TRK1||TRKh)) { |
if(T && (TRK2||TRK1||TRKh)) { |
|
if(TRK2)T->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
|
|
// else T->SetBranchStatus("TrkLevel2",0,found); |
|
|
if(TRK2)cout << "Tracker : set branch address TrkLevel2"<<endl; |
|
|
if(TRK1)T->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
|
|
// else T->SetBranchStatus("TrkLevel1",0,found); |
|
|
if(TRK1)cout << "Tracker : set branch address TrkLevel1"<<endl; |
|
|
if(TRKh)T->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
|
|
// else T->SetBranchStatus("TrkHough",0,found); |
|
|
if(TRKh)cout << "Tracker : set branch address TrkHough"<<endl; |
|
2036 |
if(!Trout)Trout=T; |
if(!Trout)Trout=T; |
2037 |
else Trout->AddFriend("Tracker"); |
else Trout->AddFriend("Tracker"); |
2038 |
}else{ |
// cout << "+Tacker"<<endl; |
|
cout << "Tracker : missing tree"<<endl; |
|
2039 |
}; |
}; |
2040 |
// Calorimeter |
// Calorimeter |
2041 |
if(C && (CAL2||CAL1)) { |
if(C && (CAL2||CAL1)) { |
|
if(CAL2)C->SetBranchAddress("CaloLevel2", GetPointerTo("CaloLevel2")); |
|
|
// else C->SetBranchStatus("CaloLevel2",0,found); |
|
|
if(CAL2)cout << "Calorimeter : set branch address CaloLevel2"<<endl; |
|
|
if(CAL1)C->SetBranchAddress("CaloLevel1", GetPointerTo("CaloLevel1")); |
|
|
// else C->SetBranchStatus("CaloLevel1",0,found); |
|
|
if(CAL1)cout << "Calorimeter : set branch address CaloLevel1"<<endl; |
|
2042 |
if(!Trout)Trout=C; |
if(!Trout)Trout=C; |
2043 |
else Trout->AddFriend("Calorimeter"); |
else Trout->AddFriend("Calorimeter"); |
2044 |
}else{ |
// cout << "+Calorimeter"<<endl; |
|
cout << "Calorimeter : missing tree"<<endl; |
|
2045 |
}; |
}; |
2046 |
// ToF |
// ToF |
2047 |
if(O && TOF) { |
if(O && TOF) { |
|
O->SetBranchAddress("ToFLevel2", GetPointerTo("ToFLevel2")); |
|
|
cout << "ToF : set branch address ToFLevel2"<<endl; |
|
2048 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2049 |
else Trout->AddFriend("ToF"); |
else Trout->AddFriend("ToF"); |
2050 |
}else{ |
// cout << "+ToF"<<endl; |
|
cout << "ToF : missing tree"<<endl; |
|
2051 |
}; |
}; |
2052 |
// Trigger |
// Trigger |
2053 |
if(R && TRG) { |
if(R && TRG) { |
|
R->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2")); |
|
|
cout << "Trigger : set branch address TrigLevel2"<<endl; |
|
2054 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2055 |
else Trout->AddFriend("Trigger"); |
else Trout->AddFriend("Trigger"); |
2056 |
}else{ |
// cout << "+Trigger"<<endl; |
|
cout << "Trigger : missing tree"<<endl; |
|
2057 |
}; |
}; |
2058 |
// S4 |
// S4 |
2059 |
if(S && S4) { |
if(S && S4) { |
|
S->SetBranchAddress("S4Level2", GetPointerTo("S4Level2")); |
|
|
cout << "S4 : set branch address S4Level2"<<endl; |
|
2060 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2061 |
else Trout->AddFriend("S4"); |
else Trout->AddFriend("S4"); |
2062 |
}else{ |
// cout << "+S4"<<endl; |
|
cout << "S4 : missing tree"<<endl; |
|
2063 |
}; |
}; |
2064 |
// Neutron Detector |
// Neutron Detector |
2065 |
if(N && ND) { |
if(N && ND) { |
|
N->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2")); |
|
|
cout << "NeutronD : set branch address NDLevel2"<<endl; |
|
2066 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2067 |
else Trout->AddFriend("NeutronD"); |
else Trout->AddFriend("NeutronD"); |
2068 |
}else{ |
// cout << "+NeutronD"<<endl; |
|
cout << "NeutronD : missing tree"<<endl; |
|
2069 |
}; |
}; |
2070 |
// Anticounters |
// Anticounters |
2071 |
if(A && AC) { |
if(A && AC) { |
|
A->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2")); |
|
|
cout << "Anticounter : set branch address AcLevel2"<<endl; |
|
2072 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2073 |
else Trout->AddFriend("Anticounter"); |
else Trout->AddFriend("Anticounter"); |
2074 |
}else{ |
// cout << "+Anticounter"<<endl; |
|
cout << "Anticounter : missing tree"<<endl; |
|
2075 |
}; |
}; |
2076 |
// Orbital Info |
// Orbital Info |
2077 |
if(B && ORB) { |
if(B && ORB) { |
|
B->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
|
|
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
|
2078 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2079 |
else Trout->AddFriend("OrbitalInfo"); |
else Trout->AddFriend("OrbitalInfo"); |
2080 |
}else{ |
// cout << "+OrbitalInfo"<<endl; |
2081 |
cout << "OrbitalInfo : missing tree"<<endl; |
}; |
2082 |
|
// GPamela |
2083 |
|
if(G && GP) { |
2084 |
|
if(!Trout)Trout=G; |
2085 |
|
else Trout->AddFriend("h20"); |
2086 |
|
// cout << "+h20"<<endl; |
2087 |
}; |
}; |
2088 |
|
|
2089 |
|
// ===================================== |
2090 |
|
// SET BRANCH-ADDRESS AFTER CHAIN+FRIEND |
2091 |
|
// ===================================== |
2092 |
|
SetBranchAddress(Trout); |
2093 |
|
|
2094 |
|
|
2095 |
|
// ------------------------------------ |
2096 |
|
// finally handle selection trees... |
2097 |
|
// (it is not friend of pamela tree) |
2098 |
|
// ------------------------------------ |
2099 |
|
|
2100 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
2101 |
|
|
2102 |
// Selection List |
// Selection List |
2103 |
if(L && SELLI==1) { |
if(L && SELLI==1) { |
2104 |
cout<<">>> Found selection-list <<<"<<endl; |
cout<<">>> Found selection-list <<<"<<endl; |
2105 |
L->SetBranchAddress("RunEntry",&irun); |
// L->SetBranchAddress("RunEntry",&irun); |
2106 |
|
L->SetBranchAddress("RunEntry",&irunt);//NEWNEW |
2107 |
cout << "SelectionList: set branch address RunEntry"<<endl; |
cout << "SelectionList: set branch address RunEntry"<<endl; |
2108 |
L->SetBranchAddress("EventEntry",&irunentry); |
L->SetBranchAddress("EventEntry",&irunentry); |
2109 |
cout << "SelectionList: set branch address EventEntry"<<endl; |
cout << "SelectionList: set branch address EventEntry"<<endl; |
2110 |
sel_tree = L; |
sel_tree = L; |
2111 |
// if(!Trout)Trout=O; |
// if(!Trout)Trout=O; |
2112 |
// else Trout->AddFriend("SelectionList"); |
// else Trout->AddFriend("SelectionList"); |
2113 |
cout << "----------------------------------------------------" <<endl; |
cout << "+SelectionList"<<endl; |
2114 |
|
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
2115 |
}else{ |
}else{ |
2116 |
// cout << "SelectionList : missing tree"<<endl; |
// cout << "SelectionList : missing tree"<<endl; |
2117 |
if(L)L->Delete(); |
if(L)L->Delete(); |
2118 |
}; |
}; |
|
|
|
|
// cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
|
2119 |
|
|
2120 |
pam_tree = Trout; |
// -------------------------------------------- |
2121 |
|
// return the pamela chain with all the friends |
2122 |
|
// -------------------------------------------- |
2123 |
|
|
2124 |
|
pam_tree = Trout; |
2125 |
|
|
2126 |
return Trout; |
return Trout; |
2127 |
} |
} |
2128 |
|
|
2148 |
ND = ND & t->GetBranchStatus("NDLevel2"); |
ND = ND & t->GetBranchStatus("NDLevel2"); |
2149 |
AC = AC & t->GetBranchStatus("AcLevel2"); |
AC = AC & t->GetBranchStatus("AcLevel2"); |
2150 |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
2151 |
|
GP = GP & t->GetBranchStatus("h20"); |
2152 |
|
|
2153 |
|
|
2154 |
// Tracker |
// Tracker |
2205 |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
2206 |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
2207 |
}; |
}; |
2208 |
// SelectionList |
// GPamela |
2209 |
if(SELLI==1) { |
if(GP) { |
2210 |
t->SetBranchAddress("RunEntry", &irun); |
// GetPointerTo("GPamela"); |
2211 |
cout << "SelectionList: set branch address RunEntry"<<endl; |
if(!gp_obj)gp_obj = new GPamela(); |
2212 |
t->SetBranchAddress("EventEntry", &irunentry); |
// gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2213 |
cout << "SelectionList: set branch address EventEntry"<<endl; |
// // t->SetBranchAddress("GPamela", GetPointerTo("GPamela")); |
2214 |
|
if(SELLI) t->SetBranchAddress("GPamela", GetPointerTo("GPamela")); |
2215 |
|
else gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2216 |
|
|
2217 |
|
cout << "h20 : set branch address GPamela "<<endl; |
2218 |
}; |
}; |
2219 |
|
|
2220 |
} |
} |
2223 |
*/ |
*/ |
2224 |
void PamLevel2::SetBranchAddress(TChain *t){ |
void PamLevel2::SetBranchAddress(TChain *t){ |
2225 |
|
|
2226 |
TRK2 = TRK2 & t->GetBranchStatus("TrkLevel2"); |
// TRK2 = TRK2 & t->GetBranchStatus("TrkLevel2"); |
2227 |
TRK1 = TRK1 & t->GetBranchStatus("TrkLevel1"); |
// TRK1 = TRK1 & t->GetBranchStatus("TrkLevel1"); |
2228 |
TRKh = TRKh & t->GetBranchStatus("TrkHough"); |
// TRKh = TRKh & t->GetBranchStatus("TrkHough"); |
2229 |
CAL1 = CAL1 & t->GetBranchStatus("CaloLevel1"); |
// CAL1 = CAL1 & t->GetBranchStatus("CaloLevel1"); |
2230 |
CAL2 = CAL2 & t->GetBranchStatus("CaloLevel2"); |
// CAL2 = CAL2 & t->GetBranchStatus("CaloLevel2"); |
2231 |
TOF = TOF & t->GetBranchStatus("ToFLevel2"); |
// TOF = TOF & t->GetBranchStatus("ToFLevel2"); |
2232 |
TRG = TRG & t->GetBranchStatus("TrigLevel2"); |
// TRG = TRG & t->GetBranchStatus("TrigLevel2"); |
2233 |
S4 = S4 & t->GetBranchStatus("S4Level2"); |
// S4 = S4 & t->GetBranchStatus("S4Level2"); |
2234 |
ND = ND & t->GetBranchStatus("NDLevel2"); |
// ND = ND & t->GetBranchStatus("NDLevel2"); |
2235 |
AC = AC & t->GetBranchStatus("AcLevel2"); |
// AC = AC & t->GetBranchStatus("AcLevel2"); |
2236 |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
// ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
2237 |
|
// GP = GP & t->GetBranchStatus("h20"); |
2238 |
|
|
2239 |
// Tracker |
// Tracker |
2240 |
if(TRK2) { |
if(TRK2) { |
2241 |
t->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
t->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
2242 |
cout << "Tracker : set branch address TrkLevel2"<<endl; |
cout << "Tracker : set branch address TrkLevel2"<<endl; |
2243 |
}; |
}; |
2245 |
t->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
t->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
2246 |
cout << "Tracker : set branch address TrkLevel1"<<endl; |
cout << "Tracker : set branch address TrkLevel1"<<endl; |
2247 |
}; |
}; |
2248 |
if(TRKh) { |
if(TRKh) { |
2249 |
t->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
t->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
2250 |
cout << "Tracker : set branch address TrkHough"<<endl; |
cout << "Tracker : set branch address TrkHough"<<endl; |
2251 |
}; |
}; |
2252 |
|
|
2253 |
// Calorimeter |
// Calorimeter |
2254 |
if(CAL2) { |
if(CAL2) { |
2290 |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
2291 |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
2292 |
}; |
}; |
2293 |
// SelectionList |
// GPamela |
2294 |
if(SELLI==1) { |
// cout <<"GP "<<GP<<endl; |
2295 |
t->SetBranchAddress("RunEntry", &irun); |
if(GP) { |
2296 |
cout << "SelectionList: set branch address RunEntry"<<endl; |
// GetPointerTo("GPamela"); |
2297 |
t->SetBranchAddress("EventEntry", &irunentry); |
if(!gp_obj)gp_obj = new GPamela(); |
2298 |
cout << "SelectionList: set branch address EventEntry"<<endl; |
if(SELLI) t->SetBranchAddress("GPamela", GetPointerTo("GPamela")); |
2299 |
|
else gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2300 |
|
// gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2301 |
|
cout << "h20 : set branch address GPamela "<<endl; |
2302 |
}; |
}; |
2303 |
|
// SelectionList |
2304 |
|
// if(SELLI==1){ |
2305 |
|
// t->SetBranchAddress("RunEntry",&irunt);//NEWNEW |
2306 |
|
// cout << "SelectionList: set branch address RunEntry"<<endl; |
2307 |
|
// t->SetBranchAddress("EventEntry",&irunentry); |
2308 |
|
// cout << "SelectionList: set branch address EventEntry"<<endl; |
2309 |
|
|
2310 |
|
// } |
2311 |
|
|
2312 |
} |
} |
2313 |
|
|
2314 |
|
|
2322 |
* @return Pointer to a TChain |
* @return Pointer to a TChain |
2323 |
*/ |
*/ |
2324 |
TChain *PamLevel2::GetRunTree(TList *fl){ |
TChain *PamLevel2::GetRunTree(TList *fl){ |
2325 |
// |
// |
2326 |
// |
// |
2327 |
// |
// |
2328 |
if ( run_tree ){ |
if ( run_tree ){ |
2329 |
printf("WARNING: TChain *PamLevel2::GetRunTree(TList *fl) -- run_tree already exists!\n "); |
printf("WARNING: TChain *PamLevel2::GetRunTree(TList *fl) -- run_tree already exists!\n "); |
2330 |
return run_tree; |
return run_tree; |
2331 |
}; |
}; |
2332 |
// |
// |
2333 |
TChain *R = new TChain("Run"); |
|
2334 |
|
|
2335 |
|
TChain *R = new TChain("Run"); |
2336 |
|
|
2337 |
// loop over files and create chains |
// loop over files and create chains |
2338 |
TIter next(fl); |
TIter next(fl); |
2344 |
R->Add(name); |
R->Add(name); |
2345 |
}; |
}; |
2346 |
} |
} |
2347 |
|
|
2348 |
|
|
2349 |
if(R->GetNtrees()){ |
if(RUN && R->GetNtrees()){ |
2350 |
|
|
2351 |
R->SetBranchAddress("RunInfo", GetPointerTo("RunInfo")); |
R->SetBranchAddress("RunInfo", GetPointerTo("RunInfo")); |
2352 |
cout << "Run : set branch address RunInfo"<<endl; |
cout << "Run : set branch address RunInfo"<<endl; |
2353 |
R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
2354 |
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
2355 |
|
|
2356 |
|
irunoffset = new int[R->GetNtrees()]; |
2357 |
|
if(DBG){ |
2358 |
|
cout << "----------------------------------------------------"<<endl; |
2359 |
|
cout << "irun\t | "; |
2360 |
|
cout << "tree\t |"; |
2361 |
|
// cout << "offset\t |"; |
2362 |
|
cout << "RUN\t"; |
2363 |
|
cout << "FRAG\t"; |
2364 |
|
cout << "NEVENTS\t"; |
2365 |
|
cout << "absolute time\t\t\t"; |
2366 |
|
cout << "on-board time"; |
2367 |
|
cout<<endl; |
2368 |
|
} |
2369 |
|
for (Int_t ii=0; ii<R->GetEntries(); ii++){ |
2370 |
|
R->GetEntry(ii); |
2371 |
|
if(DBG){ |
2372 |
|
cout << ii<< "\t | "; |
2373 |
|
cout << R->GetTreeNumber()<< "\t |"; |
2374 |
|
// cout << R->GetChainOffset()<< "\t |"; |
2375 |
|
cout <<GetRunInfo()->ID<<"\t"; |
2376 |
|
cout <<GetRunInfo()->ID_RUN_FRAG<<"\t"; |
2377 |
|
cout <<GetRunInfo()->NEVENTS<< "\t"; |
2378 |
|
cout <<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME <<"\t"; |
2379 |
|
cout <<GetRunInfo()->RUNHEADER_OBT<<" <---> "<<GetRunInfo()->RUNTRAILER_OBT<<"\t"; |
2380 |
|
cout <<endl; |
2381 |
|
} |
2382 |
|
irunoffset[R->GetTreeNumber()]=R->GetChainOffset(); |
2383 |
|
} |
2384 |
|
cout << "N.run = "<<R->GetEntries()<<endl; |
2385 |
|
cout << "----------------------------------------------------"<<endl; |
2386 |
|
|
2387 |
|
|
2388 |
}else{ |
}else{ |
2389 |
delete R; |
delete R; |
2390 |
R=0; |
R=0; |
2391 |
} |
} |
2392 |
|
|
2393 |
|
|
2394 |
run_tree = R; |
run_tree = R; |
2395 |
|
|
2406 |
* @return Pointer to a TTree |
* @return Pointer to a TTree |
2407 |
*/ |
*/ |
2408 |
TTree *PamLevel2::GetRunTree(TFile *f){ |
TTree *PamLevel2::GetRunTree(TFile *f){ |
2409 |
if ( run_tree ){ |
if ( run_tree ){ |
2410 |
printf("WARNING: TTree *PamLevel2::GetRunTree(TFile *f) -- run_tree already exists!\n "); |
printf("WARNING: TTree *PamLevel2::GetRunTree(TFile *f) -- run_tree already exists!\n "); |
2411 |
return run_tree; |
return run_tree; |
2412 |
}; |
}; |
2413 |
|
|
2414 |
|
|
2415 |
cout << "TTree *PamLevel2::GetRunTree(TFile *f) -- obsolte "<<endl; |
cout << "TTree *PamLevel2::GetRunTree(TFile *f) -- obsolte "<<endl; |
2421 |
cout << "Run : set branch address RunInfo"<<endl; |
cout << "Run : set branch address RunInfo"<<endl; |
2422 |
T->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
T->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
2423 |
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
2424 |
|
|
2425 |
} |
} |
2426 |
|
|
2427 |
run_tree = (TChain*)T; |
run_tree = (TChain*)T; |
2435 |
* @return true if a new run has been read, false if it is still the same run |
* @return true if a new run has been read, false if it is still the same run |
2436 |
*/ |
*/ |
2437 |
Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev){ |
Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev){ |
2438 |
// |
// |
2439 |
// check if we have already called once GetEntry, if not call it |
// check if we have already called once GetEntry, if not call it |
2440 |
// |
// |
2441 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- NON FUNZIONA BENISSIMO.... "<<endl; |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- ATTENZIONE --- NON E` MANTENUTA!!!!!!!.... "<<endl; |
2442 |
if(!run){ |
if(!run){ |
2443 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree "<<endl; |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree "<<endl; |
2444 |
return(false); |
return(false); |
2445 |
} |
} |
2446 |
if ( run->GetEntries() <= 0 ) return(false); |
if ( run->GetEntries() <= 0 ) return(false); |
2447 |
// |
// |
2448 |
|
|
2449 |
// Int_t oldrun = irun; |
// Int_t oldrun = irun; |
2450 |
Long64_t oldrun = irun; |
Long64_t oldrun = irun; |
2451 |
|
|
2452 |
|
// -------------------------------------- |
2453 |
|
// if it is a full file (not preselected) |
2454 |
|
// -------------------------------------- |
2455 |
|
if(SELLI==0){ |
2456 |
|
|
2457 |
// -------------------------------------- |
// |
2458 |
// if it is a full file (not preselected) |
// the absolute time is necessary to relate the event with the run |
2459 |
// -------------------------------------- |
// |
2460 |
if(SELLI==0){ |
if( !GetOrbitalInfo() && !ISGP){ |
2461 |
|
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
2462 |
// |
return(false); |
2463 |
// the absolute time is necessary to relate the event with the run |
} |
2464 |
// |
|
2465 |
if( !GetOrbitalInfo() ){ |
ULong64_t abstime = 0; |
2466 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
if( GetOrbitalInfo() )abstime=GetOrbitalInfo()->absTime; |
2467 |
return(false); |
|
2468 |
} |
|
2469 |
|
// |
2470 |
// |
// the first time the routine is called, set run search from the beginning |
2471 |
// the first time the routine is called, set run search from the beginning |
// |
2472 |
// |
if ( irun < 0LL ){ |
2473 |
if ( irun < 0LL ){ |
irun = 0LL; |
2474 |
irun = 0LL; |
run->GetEntry(irun); |
2475 |
run->GetEntry(irun); |
runfirstentry = 0LL; |
2476 |
runfirstentry = 0LL; |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2477 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
2478 |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
|
2479 |
}; |
if( ISGP && run->GetEntries()!=1 ){ |
2480 |
// |
cout << "** WARNING ** simulated files are assumed to have 1 single run, not "<< run->GetEntries() << endl; |
2481 |
if ( irun == run->GetEntries()-1LL && |
cout << "** WARNING ** run will not be updated"<<endl; |
2482 |
!(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && |
} |
2483 |
GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) |
|
2484 |
|
}; |
2485 |
|
// |
2486 |
|
if(ISGP)abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO |
2487 |
|
// |
2488 |
|
if ( irun == run->GetEntries()-1LL && |
2489 |
|
!(abstime >= GetRunInfo()->RUNHEADER_TIME && |
2490 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
2491 |
){ |
){ |
2492 |
irun = -1LL; |
irun = -1LL; |
2493 |
runfirstentry = 0LL; |
irunt = -1LL; |
2494 |
runlastentry = -1LL; |
runfirstentry = 0LL; |
2495 |
}; |
runlastentry = -1LL; |
2496 |
// modificato il controllo sull'aggiornamento del run, per evitare problemi |
}; |
2497 |
// dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!) |
// modificato il controllo sull'aggiornamento del run, per evitare problemi |
2498 |
// |
// dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!) |
2499 |
bool fromfirst = true; |
// |
2500 |
// |
bool fromfirst = true; |
2501 |
while ( !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries()-1LL ){ |
// |
2502 |
|
while ( !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries()-1LL ){ |
2503 |
// while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
// while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
2504 |
irun++; |
irun++; |
2505 |
run->GetEntry(irun); |
run->GetEntry(irun); |
2506 |
runfirstentry = runlastentry; |
runfirstentry = runlastentry; |
2507 |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runfirstentry += 1LL; |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runfirstentry += 1LL; |
2508 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2509 |
// cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
// cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2510 |
// cout << "runfirstentry "<<runfirstentry<<endl; |
// cout << "runfirstentry "<<runfirstentry<<endl; |
2511 |
// printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS))); |
// printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS))); |
2512 |
// printf(" abstime %u trailertime %u \n",GetOrbitalInfo()->absTime,GetRunInfo()->RUNTRAILER_TIME); |
// printf(" abstime %u trailertime %u \n",abstime,GetRunInfo()->RUNTRAILER_TIME); |
2513 |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
2514 |
// |
// |
2515 |
// prevshift = 0; |
// prevshift = 0; |
2516 |
// |
// |
2517 |
if ( irun == (Long64_t)(run->GetEntries()-1LL) && fromfirst && !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME)){ |
if ( irun == (Long64_t)(run->GetEntries()-1LL) && fromfirst && !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME)){ |
2518 |
printf(" resetting irun (it should NOT happen!!!)\n"); |
printf(" resetting irun (it should NOT happen!!!)\n"); |
2519 |
fromfirst = false; |
fromfirst = false; |
2520 |
irun = 0; |
irun = 0; |
2521 |
run->GetEntry(irun); |
run->GetEntry(irun); |
2522 |
runfirstentry = 0ULL; |
runfirstentry = 0ULL; |
2523 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2524 |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
2525 |
}; |
}; |
2526 |
// |
// |
2527 |
}; |
}; |
2528 |
// |
// |
2529 |
if ( |
if ( |
2530 |
!(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && |
!(abstime >= GetRunInfo()->RUNHEADER_TIME && |
2531 |
GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) |
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
2532 |
) { |
) { |
2533 |
printf(" Something very wrong here: cannot find RUN containing absolute time %u \n",GetOrbitalInfo()->absTime); |
printf(" Something very wrong here: cannot find RUN containing absolute time %llu \n",abstime); |
2534 |
return false; |
return false; |
2535 |
} |
} |
2536 |
// |
// |
2537 |
if ( irun == oldrun || irun >= run->GetEntries() ) return(false); |
if ( irun == oldrun || irun >= run->GetEntries() ) return(false); |
2538 |
// |
// |
2539 |
// printf(" iev %llu irun %i nevents %u 1st %llu last %llu \n",iev,irun,this->GetRunInfo()->NEVENTS,(ULong64_t)runfirstentry,(ULong64_t)runlastentry); |
// printf(" iev %llu irun %i nevents %u 1st %llu last %llu \n",iev,irun,this->GetRunInfo()->NEVENTS,(ULong64_t)runfirstentry,(ULong64_t)runlastentry); |
2540 |
// |
// |
2541 |
prevshift = 0; |
prevshift = 0; |
2542 |
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2543 |
// cout << "runfirstentry "<<runfirstentry<<endl; |
// cout << "runfirstentry "<<runfirstentry<<endl; |
2544 |
return(true); |
return(true); |
2545 |
}; |
}; |
2546 |
// ---------------------------------------------------- |
// ---------------------------------------------------- |
2547 |
// if it is a preselected file (there is SelectionList) |
// if it is a preselected file (there is SelectionList) |
2548 |
// NBNB - the event tree MUST be read first |
// NBNB - the event tree MUST be read first |
2549 |
// ---------------------------------------------------- |
// ---------------------------------------------------- |
2550 |
if(SELLI==1){ |
if(SELLI==1){ |
2551 |
sel_tree->GetEntry(iev); |
sel_tree->GetEntry(iev); |
2552 |
// cout << irun << " "<< irunentry << endl; |
// cout << irun << " "<< irunentry << endl; |
2553 |
if(irun != oldrun){ |
if(irun != oldrun){ |
2554 |
run->GetEntry(irun); |
run->GetEntry(irun); |
2555 |
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2556 |
prevshift = 0; |
prevshift = 0; |
2557 |
return true; |
return true; |
2558 |
} |
} |
2559 |
return false; |
return false; |
2560 |
} |
} |
2561 |
|
|
2562 |
return false; |
return false; |
2563 |
// |
// |
2564 |
}; |
}; |
2565 |
|
|
2566 |
Bool_t PamLevel2::UpdateRunInfo(Long64_t iev){ |
Bool_t PamLevel2::UpdateRunInfo(Long64_t iev){ |
2576 |
|
|
2577 |
Int_t oldrun = irun; // store current run index |
Int_t oldrun = irun; // store current run index |
2578 |
|
|
2579 |
|
// ----------------------------------------------------------------------- |
2580 |
|
// the first time the routine is called, set run search from the beginning |
2581 |
|
// ----------------------------------------------------------------------- |
2582 |
|
|
2583 |
|
if ( irun < 0 ){ |
2584 |
|
irun = 0LL; |
2585 |
|
irunt = 0LL; |
2586 |
|
irunentry = 0; |
2587 |
|
prevshift = 0; |
2588 |
|
run_tree->GetEntry(irun); |
2589 |
|
if( !GetOrbitalInfo() )cout << "** WARNING ** missing OrbitalInfo ---> run info might be not correctly updated "<<endl; |
2590 |
|
}; |
2591 |
|
// --------------------------------------------------------------- |
2592 |
|
// retrieve OBT and absolute time of the event |
2593 |
|
// --------------------------------------------------------------- |
2594 |
|
ULong64_t abstime = 0LL; |
2595 |
|
ULong64_t obt = 0LL; |
2596 |
|
if( GetOrbitalInfo() ){ |
2597 |
|
abstime = GetOrbitalInfo()->absTime; |
2598 |
|
obt = GetOrbitalInfo()->OBT; |
2599 |
|
}else{ |
2600 |
|
abstime = GetRunInfo()->RUNHEADER_TIME; |
2601 |
|
obt = GetRunInfo()->RUNHEADER_OBT; |
2602 |
|
} |
2603 |
|
|
2604 |
|
|
2605 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2606 |
// if it is a full file (not preselected) |
// if it is a full file (not preselected) |
2607 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2608 |
if(SELLI==0){ |
if(SELLI==0){ |
2609 |
|
|
2610 |
// --------------------------------------------------------------- |
// --------------------------------------------------------------- |
2611 |
// the absolute time is necessary to relate the event with the run |
// increment dead and live-time counters |
2612 |
|
// (only when reading a file not preselected) |
2613 |
// --------------------------------------------------------------- |
// --------------------------------------------------------------- |
2614 |
if( !GetOrbitalInfo() ){ |
if(SELLI==0){ |
2615 |
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
if( GetTrigLevel2() ){ |
2616 |
return(false); |
totdltime[0]+=GetTrigLevel2()->dltime[0]; |
2617 |
|
totdltime[1]+=GetTrigLevel2()->dltime[1]; |
2618 |
|
} |
2619 |
|
totdltime[2]++; |
2620 |
} |
} |
2621 |
|
|
|
// ----------------------------------------------------------------------- |
|
|
// the first time the routine is called, set run search from the beginning |
|
|
// ----------------------------------------------------------------------- |
|
|
if ( irun < 0 ){ |
|
|
irun = 0LL; |
|
|
irunentry = 0; |
|
|
prevshift = 0; |
|
|
run_tree->GetEntry(irun); |
|
|
}; |
|
2622 |
// |
// |
2623 |
bool fromfirst = true; // first loop over runs |
bool fromfirst = true; // first loop over runs |
2624 |
|
|
|
// Bool_t hasfrag = false; |
|
|
// if( GetRunInfo()->ID_RUN_FRAG!=0 && GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID)hasfrag=true; |
|
|
// ULong64_t fragid = GetRunInfo()->ID_RUN_FRAG; |
|
2625 |
|
|
2626 |
// ------------------------------------------------------ |
// ------------------------------------------------------ |
2627 |
// loop over runs to find the one that contains the event |
// loop over runs to find the one that contains the event |
2628 |
// ------------------------------------------------------ |
// ------------------------------------------------------ |
2629 |
while ( |
while ( |
2630 |
( |
( |
2631 |
( |
// ( |
2632 |
!(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
// !(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
2633 |
GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) && |
// abstime <= GetRunInfo()->RUNTRAILER_TIME) && |
2634 |
!(GetOrbitalInfo()->OBT >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
// !(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
2635 |
GetOrbitalInfo()->OBT <= GetRunInfo()->RUNTRAILER_OBT) |
// obt <= GetRunInfo()->RUNTRAILER_OBT) |
2636 |
) |
// ) |
2637 |
|| GetRunInfo()->NEVENTS==0 |
|
2638 |
|| !(irunentry < GetRunInfo()->NEVENTS-1-prevshift) |
!(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
2639 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
2640 |
|
|| |
2641 |
|
!(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
2642 |
|
obt <= GetRunInfo()->RUNTRAILER_OBT) |
2643 |
|
|| |
2644 |
|
GetRunInfo()->NEVENTS==0 |
2645 |
|
// || !(irunentry < GetRunInfo()->NEVENTS-1-prevshift) // ERRORE!!! fa saltare i run con 1 evento |
2646 |
|
|| |
2647 |
|
!(irunentry <= GetRunInfo()->NEVENTS-1-prevshift) |
2648 |
) |
) |
2649 |
&& irun < run_tree->GetEntries() ){ |
&& irun < run_tree->GetEntries() ){ |
2650 |
|
|
2651 |
irun++; |
|
2652 |
|
// if( !(abstime >= GetRunInfo()->RUNHEADER_TIME &&abstime <= GetRunInfo()->RUNTRAILER_TIME) )cout << "ABS TIME "<<abstime << " " <<GetRunInfo()->RUNTRAILER_TIME <<endl; |
2653 |
|
// if( !(obt >= GetRunInfo()->RUNHEADER_OBT && obt <= GetRunInfo()->RUNTRAILER_OBT) )cout << "OBT TIME "<< obt <<" "<< GetRunInfo()->RUNTRAILER_OBT << endl; |
2654 |
|
// if( GetRunInfo()->NEVENTS==0 )cout <<"GetRunInfo()->NEVENTS==0 "<<endl; |
2655 |
|
// if( !(irunentry <= GetRunInfo()->NEVENTS-1-prevshift) ) cout << "irunentry > "<<GetRunInfo()->NEVENTS-1-prevshift << endl; |
2656 |
|
// - - - - - - - - - - - - - |
2657 |
|
// irunentry = position of current entry, relative to the run |
2658 |
|
// prevshift = shift needed to synchronize l0 and l2 data (nested events) |
2659 |
|
// - - - - - - - - - - - - - |
2660 |
|
|
2661 |
|
// ----------------------------------------- |
2662 |
|
// store dead and live-time of previous run |
2663 |
|
// ----------------------------------------- |
2664 |
|
// if(SELLI==0){ |
2665 |
|
if(fromfirst){ |
2666 |
|
if(oldrun==irun){ |
2667 |
|
/// decrement counters |
2668 |
|
if( GetTrigLevel2()){ |
2669 |
|
totdltime[0]-=GetTrigLevel2()->dltime[0];//live-time |
2670 |
|
totdltime[1]-=GetTrigLevel2()->dltime[1];//dead-time |
2671 |
|
} |
2672 |
|
totdltime[2]--; //event counter |
2673 |
|
cout << endl; |
2674 |
|
cout << "n.events : "<<totdltime[2]<<endl; |
2675 |
|
cout << "RUN LIVE-TIME: "<<totdltime[0]*0.16<<" ms"<<endl; |
2676 |
|
cout << "RUN DEAD-TIME: "<<totdltime[1]*0.01<<" ms"<<endl; |
2677 |
|
}else{ |
2678 |
|
totdltime[0]=0;//live-time |
2679 |
|
totdltime[1]=0;//dead-time |
2680 |
|
totdltime[2]=0; //event counter |
2681 |
|
cout << " *** JUMP RUN *** irun "<<irun<<endl; |
2682 |
|
} |
2683 |
|
/// add an entry |
2684 |
|
if(run_tree_clone) |
2685 |
|
if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries()) |
2686 |
|
run_tree_clone->GetBranch("DeadLiveTime")->Fill(); |
2687 |
|
/// reset counters |
2688 |
|
if( GetTrigLevel2() ){ |
2689 |
|
totdltime[0]=GetTrigLevel2()->dltime[0];//live-time |
2690 |
|
totdltime[1]=0; //dead-time |
2691 |
|
} |
2692 |
|
totdltime[2]=1; //event counter |
2693 |
|
} |
2694 |
|
// } |
2695 |
|
|
2696 |
|
irun++; |
2697 |
// ------------------------------------ |
// ------------------------------------ |
2698 |
// if the end of run tree is reached... |
// if the end of run tree is reached... |
2699 |
// ------------------------------------ |
// ------------------------------------ |
2720 |
// ------------------------------------------------------------------- |
// ------------------------------------------------------------------- |
2721 |
if(irun>0)runfirstentry += (GetRunInfo()->NEVENTS)-prevshift; |
if(irun>0)runfirstentry += (GetRunInfo()->NEVENTS)-prevshift; |
2722 |
irunentry = 0; |
irunentry = 0; |
2723 |
prevshift = 0; |
prevshift = 0; |
2724 |
run_tree->GetEntry(irun); |
run_tree->GetEntry(irun);//update runinfo |
2725 |
|
irunt = irun - irunoffset[run_tree->GetTreeNumber()]; |
2726 |
if(GetRunInfo()->RUNHEADER_OBT>GetRunInfo()->RUNTRAILER_OBT ){ |
if(GetRunInfo()->RUNHEADER_OBT>GetRunInfo()->RUNTRAILER_OBT ){ |
2727 |
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun "<<irun<<" has RUNHEADER_OBT>=RUNTRAILER_OBT " <<endl; |
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun "<<irun<<" has RUNHEADER_OBT>=RUNTRAILER_OBT " <<endl; |
2728 |
cout << " (NB!! in this case some events are assigned to a wrong run)"<<endl; |
cout << " (NB!! in this case some events are assigned to a wrong run)"<<endl; |
2741 |
|
|
2742 |
// -------------------------------------- |
// -------------------------------------- |
2743 |
// ... otherwise |
// ... otherwise |
2744 |
|
// -------------------------------------- |
2745 |
|
|
2746 |
|
|
2747 |
|
// -------------------------------------- |
2748 |
// ---> exit with TRUE |
// ---> exit with TRUE |
2749 |
// -------------------------------------- |
// -------------------------------------- |
2750 |
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
if(DBG)cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2751 |
|
// ---------------------------------------------------- |
2752 |
|
// update the tracker parameters |
2753 |
|
// (non ho trovato nessun altro modo sicuro di farlo...) |
2754 |
|
// ---------------------------------------------------- |
2755 |
|
if(!dbc || (dbc && !dbc->IsConnected()) )SetDBConnection(); |
2756 |
|
TrkParams::Set(GetRunInfo() ,dbc); |
2757 |
|
if(dbc)dbc->Close(); |
2758 |
|
|
2759 |
// ---------------------------------------------------- |
// ---------------------------------------------------- |
2760 |
// then check if the run has a fragment |
// then check if the run has a fragment |
2761 |
// in this case we have to switch to the next fragment |
// in this case we have to switch to the next fragment |
2764 |
if( |
if( |
2765 |
GetRunInfo()->ID_RUN_FRAG != 0 && |
GetRunInfo()->ID_RUN_FRAG != 0 && |
2766 |
// GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID && |
// GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID && |
2767 |
|
DBG && |
2768 |
true ){ |
true ){ |
2769 |
cout << "* fragment *"<<endl; |
cout << "* fragment *"<<endl; |
2770 |
} |
} |
2771 |
|
|
2772 |
return(true); |
return(true); |
2773 |
}; |
}; |
2774 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2775 |
// if it is a preselected file (there is SelectionList) |
// if it is a preselected file (there is SelectionList) |
2776 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2777 |
|
// irun = run entry relative to the chain |
2778 |
|
// irunt = run entry relative to the tree |
2779 |
if(SELLI==1){ |
if(SELLI==1){ |
2780 |
sel_tree->GetEntry(iev); |
sel_tree->GetEntry(iev);// read irunt from SelectionList |
2781 |
if(irun != oldrun){ |
irun = irunt + irunoffset[sel_tree->GetTreeNumber()];//NEWNEW |
2782 |
run_tree->GetEntry(irun); |
if(irun != oldrun ){ |
2783 |
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
if( irun < run_tree->GetEntries() )run_tree->GetEntry(irun); |
2784 |
|
// check if the time is ok (with merged files it is not...) |
2785 |
|
// if not loop over run and look for the proper entry |
2786 |
|
bool SECONDO_GIRO=false; |
2787 |
|
// Long64_t irun_start = irun; |
2788 |
|
int offset_start = irunoffset[sel_tree->GetTreeNumber()]; |
2789 |
|
while ( |
2790 |
|
( |
2791 |
|
( |
2792 |
|
!(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
2793 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
2794 |
|
// || |
2795 |
|
// !(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
2796 |
|
// obt <= GetRunInfo()->RUNTRAILER_OBT) |
2797 |
|
) |
2798 |
|
|| GetRunInfo()->NEVENTS==0 |
2799 |
|
) |
2800 |
|
// && irun < run_tree->GetEntries() |
2801 |
|
){ |
2802 |
|
|
2803 |
|
if(DBG){ |
2804 |
|
cout << " (test) "; |
2805 |
|
cout << " tree "<<sel_tree->GetTreeNumber(); |
2806 |
|
cout << " irunt "<<irunt; |
2807 |
|
cout << " offset "<<irunoffset[sel_tree->GetTreeNumber()]; |
2808 |
|
cout << " abs "<<abstime; |
2809 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_TIME<<" "<<GetRunInfo()->RUNTRAILER_TIME; |
2810 |
|
cout << " obt "<<obt; |
2811 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_OBT<<" "<<GetRunInfo()->RUNTRAILER_OBT; |
2812 |
|
cout << " *** JUMP RUN *** irun "<<irun; |
2813 |
|
cout << endl; |
2814 |
|
} |
2815 |
|
// irun++; |
2816 |
|
irunoffset[sel_tree->GetTreeNumber()]++; |
2817 |
|
irun = irunt + irunoffset[sel_tree->GetTreeNumber()];//NEWNEW |
2818 |
|
if(irun == run_tree->GetEntries() && SECONDO_GIRO){ |
2819 |
|
// if(irun == irun_start ){ |
2820 |
|
cout << " ...grrrvzzkhhhajsdkj!!!! "<<endl; |
2821 |
|
irunoffset[sel_tree->GetTreeNumber()] = offset_start; |
2822 |
|
return false; |
2823 |
|
} |
2824 |
|
if( irun >= run_tree->GetEntries() || irun < 0){ |
2825 |
|
cout << "irun = "<<irun<<" >> search from the beginning... <<"<<endl; |
2826 |
|
SECONDO_GIRO=true; |
2827 |
|
irun=0; |
2828 |
|
irunoffset[sel_tree->GetTreeNumber()]=-irunt; |
2829 |
|
} |
2830 |
|
run_tree->GetEntry(irun); |
2831 |
|
} |
2832 |
|
|
2833 |
|
|
2834 |
|
if(DBG){ |
2835 |
|
cout << " (test) "; |
2836 |
|
cout << " tree "<<sel_tree->GetTreeNumber(); |
2837 |
|
cout << " irunt "<<irunt; |
2838 |
|
cout << " offset "<<irunoffset[sel_tree->GetTreeNumber()]; |
2839 |
|
cout << " abs "<<abstime; |
2840 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_TIME<<" "<<GetRunInfo()->RUNTRAILER_TIME; |
2841 |
|
cout << " obt "<<obt; |
2842 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_OBT<<" "<<GetRunInfo()->RUNTRAILER_OBT; |
2843 |
|
} |
2844 |
|
if(DBG)cout << endl; |
2845 |
|
if(DBG)cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" (run-entry "<<irun<<")"<<endl; |
2846 |
|
// ---------------------------------------------------- |
2847 |
|
// update the tracker parameters |
2848 |
|
// (non ho trovato nessun altro modo sicuro di farlo...) |
2849 |
|
// ---------------------------------------------------- |
2850 |
|
if(!dbc || (dbc && !dbc->IsConnected()) )SetDBConnection(); |
2851 |
|
TrkParams::Set(GetRunInfo() ,dbc); |
2852 |
|
if(dbc)dbc->Close(); |
2853 |
|
// cout << endl; |
2854 |
prevshift = 0; |
prevshift = 0; |
2855 |
return true; |
return true; |
2856 |
} |
} |
2866 |
* @return true if a new run has been read, false if it is still the same run |
* @return true if a new run has been read, false if it is still the same run |
2867 |
*/ |
*/ |
2868 |
Bool_t PamLevel2::UpdateRunInfo(TTree *run, Long64_t iev){ |
Bool_t PamLevel2::UpdateRunInfo(TTree *run, Long64_t iev){ |
2869 |
return(UpdateRunInfo((TChain*)run,iev)); |
return(UpdateRunInfo((TChain*)run,iev)); |
2870 |
}; |
}; |
2871 |
|
|
2872 |
//-------------------------------------- |
//-------------------------------------- |
2876 |
/** |
/** |
2877 |
* Set which trees shoul be analysed |
* Set which trees shoul be analysed |
2878 |
* @param detlist TString containing the sequence of trees required |
* @param detlist TString containing the sequence of trees required |
2879 |
*/ |
*/ |
2880 |
void PamLevel2::SetWhichTrees(TString detlist){ |
void PamLevel2::SetWhichTrees(TString detlist){ |
2881 |
|
|
2882 |
if(detlist.IsNull() || detlist.Contains("+ALL", TString::kIgnoreCase)){ |
// if(detlist.IsNull() || detlist.Contains("+ALL", TString::kIgnoreCase)){ |
2883 |
CAL0 = false; |
if( detlist.Contains("+ALL", TString::kIgnoreCase)){ |
2884 |
|
|
2885 |
|
cout << " ======================================================== "<<endl; |
2886 |
|
cout << " (( WARNING )) "<<endl; |
2887 |
|
cout << " The meaning of the option +ALL has changed!! "<<endl; |
2888 |
|
cout << " Now it includes really all (level0+level1+level2+gpamela)"<<endl; |
2889 |
|
cout << " and the file is discarded if it does not contain "<<endl; |
2890 |
|
cout << " all trees or if level0 files are not available!! "<<endl; |
2891 |
|
cout << " ======================================================== "<<endl; |
2892 |
|
|
2893 |
|
CAL0 = true; |
2894 |
CAL1 = true; |
CAL1 = true; |
2895 |
CAL2 = true; |
CAL2 = true; |
2896 |
TRK2 = true; |
TRK2 = true; |
2897 |
TRK1 = false; |
TRK1 = true; |
2898 |
TRKh = false; |
TRKh = true; |
2899 |
TRK0 = false; |
TRK0 = true; |
2900 |
TRG = true; |
TRG = true; |
2901 |
TOF = true; |
TOF = true; |
2902 |
TOF0 = false; |
TOF0 = true; |
2903 |
S4 = true; |
S4 = true; |
2904 |
ND = true; |
ND = true; |
2905 |
AC = true; |
AC = true; |
2906 |
ORB = true; |
ORB = true; |
2907 |
|
GP = true; |
2908 |
}else if( detlist.Contains("-ALL", TString::kIgnoreCase) ){ |
}else if( detlist.Contains("-ALL", TString::kIgnoreCase) ){ |
2909 |
CAL0 = false; |
CAL0 = false; |
2910 |
CAL1 = false; |
CAL1 = false; |
2920 |
ND = false; |
ND = false; |
2921 |
AC = false; |
AC = false; |
2922 |
ORB = false; |
ORB = false; |
2923 |
|
GP = false; |
2924 |
}; |
}; |
2925 |
|
|
2926 |
// ------------------------------------------------------------------------- |
// ------------------------------------------------------------------------- |
2994 |
if( detlist.Contains("-ORB", TString::kIgnoreCase) )ORB = false; |
if( detlist.Contains("-ORB", TString::kIgnoreCase) )ORB = false; |
2995 |
else if( detlist.Contains("+ORB", TString::kIgnoreCase) )ORB = true; |
else if( detlist.Contains("+ORB", TString::kIgnoreCase) )ORB = true; |
2996 |
|
|
2997 |
|
if( detlist.Contains("-GP", TString::kIgnoreCase) )GP = false; |
2998 |
|
else if( detlist.Contains("+GP", TString::kIgnoreCase) )GP = true; |
2999 |
|
|
3000 |
|
cout<< "tree/branch list from input --> "; |
3001 |
|
if(TRK0)cout<<"TRK0 "; |
3002 |
|
if(TRK1)cout<<"TRK1 "; |
3003 |
|
if(TRK2)cout<<"TRK2 "; |
3004 |
|
if(TRKh)cout<<"TRKH "; |
3005 |
|
if(CAL0)cout<<"CAL0 "; |
3006 |
|
if(CAL1)cout<<"CAL1 "; |
3007 |
|
if(CAL2)cout<<"CAL2 "; |
3008 |
|
if(TOF)cout<<"TOF "; |
3009 |
|
if(TRG)cout<<"TRG "; |
3010 |
|
if(AC)cout<<"AC "; |
3011 |
|
if(ND)cout<<"ND "; |
3012 |
|
if(S4)cout<<"S4 "; |
3013 |
|
if(ORB)cout<<"ORB "; |
3014 |
|
if(GP)cout<<"GP "; |
3015 |
|
cout << endl; |
3016 |
// cout<< "Set detector list --> "; |
// cout<< "Set detector list --> "; |
3017 |
// if(TRK1)cout<<"TRK1 "; |
// if(TRK1)cout<<"TRK1 "; |
3018 |
// if(TRK2)cout<<"TRK2 "; |
// if(TRK2)cout<<"TRK2 "; |
3019 |
// if(TRKh)cout<<"TRKH "; |
// if(TRKh)cout<<"TRKH "; |
3020 |
// if(CAL1)cout<<"CAL1 "; |
// if(CAL1)cout<<"CAL1 "; |
3021 |
// if(CAL2)cout<<"CAL2 "; |
// if(CAL2)cout<<"CAL2 "; |
3022 |
|
// if(TOF0)cout<<"TOF0 "; |
3023 |
// if(TOF)cout<<"TOF "; |
// if(TOF)cout<<"TOF "; |
3024 |
// if(TRG)cout<<"TRG "; |
// if(TRG)cout<<"TRG "; |
3025 |
// if(AC)cout<<"AC "; |
// if(AC)cout<<"AC "; |
3038 |
|
|
3039 |
|
|
3040 |
|
|
3041 |
cout << "void PamLevel2::GetWhichTrees(TFile* f) --- WARNING!! --- ...potrebbe non funzionare "<<endl; |
// cout << "void PamLevel2::GetWhichTrees(TFile* f) --- WARNING!! --- ...potrebbe non funzionare "<<endl; |
3042 |
// ----------- |
// ----------- |
3043 |
// reset flags |
// reset flags |
3044 |
// ----------- |
// ----------- |
3053 |
ND = false; |
ND = false; |
3054 |
AC = false; |
AC = false; |
3055 |
ORB = false; |
ORB = false; |
3056 |
|
GP = false; |
3057 |
|
|
3058 |
RUN = false; |
RUN = false; |
3059 |
|
|
3060 |
cout << "Checking file: "<<f->GetName()<<endl; |
// cout << "Checking file: "<<f->GetName()<<endl; |
3061 |
if( !f || f->IsZombie() ){ |
if( !f || f->IsZombie() ){ |
3062 |
cout << "File: "<< f->GetName() <<" Non valid root file"<< endl; |
cout << "File: "<< f->GetName() <<" Non valid root file"<< endl; |
3063 |
return; |
return; |
3144 |
TRK2 = false; |
TRK2 = false; |
3145 |
TRKh = false; |
TRKh = false; |
3146 |
}else nev=nevt; |
}else nev=nevt; |
3147 |
T->Delete(); |
// T->Delete(); |
3148 |
}; |
}; |
3149 |
//========================================================= |
//========================================================= |
3150 |
if( !strcmp(key->GetName(),"Calorimeter" ) ){ |
if( !strcmp(key->GetName(),"Calorimeter" ) ){ |
3160 |
CAL1 = false; |
CAL1 = false; |
3161 |
CAL2 = false; |
CAL2 = false; |
3162 |
}else nev=nevt; |
}else nev=nevt; |
3163 |
T->Delete(); |
// T->Delete(); |
3164 |
}; |
}; |
3165 |
|
//========================================================= |
3166 |
|
if( !strcmp(key->GetName(),"h20") ){ |
3167 |
|
GP = true; |
3168 |
|
Int_t nevt = ((TTree*)f->Get("h20"))->GetEntries(); |
3169 |
|
if( nev && nevt!=nev){ |
3170 |
|
cout << "File: "<< f->GetName() <<" h20 tree has "<<nevt<<" events instead of "<<nev<< endl; |
3171 |
|
GP = false; |
3172 |
|
}else nev=nevt; |
3173 |
|
} |
3174 |
|
|
3175 |
}; |
}; |
3176 |
|
|
3177 |
delete lk; |
// delete lk; |
3178 |
|
|
3179 |
// cout<< "Get detector list from input file --> "; |
cout<< "tree/branch list from file --> "; |
3180 |
// if(TRK1)cout<<"TRK1 "; |
if(TRK1)cout<<"TRK1 "; |
3181 |
// if(TRK2)cout<<"TRK2 "; |
if(TRK2)cout<<"TRK2 "; |
3182 |
// if(TRKh)cout<<"TRKH "; |
if(TRKh)cout<<"TRKH "; |
3183 |
// if(CAL1)cout<<"CAL1 "; |
if(CAL1)cout<<"CAL1 "; |
3184 |
// if(CAL2)cout<<"CAL2 "; |
if(CAL2)cout<<"CAL2 "; |
3185 |
// if(TOF)cout<<"TOF "; |
if(TOF)cout<<"TOF "; |
3186 |
// if(TRG)cout<<"TRG "; |
if(TRG)cout<<"TRG "; |
3187 |
// if(AC)cout<<"AC "; |
if(AC)cout<<"AC "; |
3188 |
// if(ND)cout<<"ND "; |
if(ND)cout<<"ND "; |
3189 |
// if(S4)cout<<"S4 "; |
if(S4)cout<<"S4 "; |
3190 |
// if(ORB)cout<<"ORB "; |
if(ORB)cout<<"ORB "; |
3191 |
// cout << endl; |
if(GP)cout<<"GP "; |
3192 |
|
cout << endl; |
3193 |
|
|
3194 |
return ; |
return ; |
3195 |
|
|
3218 |
Bool_t ND__ok = false; |
Bool_t ND__ok = false; |
3219 |
Bool_t AC__ok = false; |
Bool_t AC__ok = false; |
3220 |
Bool_t ORB__ok = false; |
Bool_t ORB__ok = false; |
3221 |
|
Bool_t GP__ok = false; |
3222 |
|
|
3223 |
Bool_t RUN__ok = false; |
Bool_t RUN__ok = false; |
3224 |
|
|
3225 |
Bool_t SELLI__ok = false; |
Bool_t SELLI__ok = false; |
3226 |
|
|
3227 |
cout << "Checking file: "<<name<<endl; |
// cout << "Checking file: "<<name<<endl; |
3228 |
TFile *f = new TFile(name.Data()); |
TFile *f = new TFile(name.Data()); |
3229 |
if( !f || f->IsZombie() ){ |
if( !f || f->IsZombie() ){ |
3230 |
cout << "File: "<< f->GetName() <<" discarded ---- Non valid root file"<< endl; return false; |
cout << "File: "<< f->GetName() <<" discarded ---- Non valid root file"<< endl; return false; |
3250 |
// return false; |
// return false; |
3251 |
// }; |
// }; |
3252 |
|
|
3253 |
|
//========================================================= |
3254 |
|
// check if the file |
3255 |
|
|
3256 |
|
|
3257 |
if( !strcmp(key->GetName(),"Run" ) )RUN__ok = true; |
if( !strcmp(key->GetName(),"Run" ) )RUN__ok = true; |
3258 |
|
|
3379 |
}; |
}; |
3380 |
T->Delete(); |
T->Delete(); |
3381 |
}; |
}; |
3382 |
|
//========================================================= |
3383 |
|
if( !strcmp(key->GetName(),"h20") ){ |
3384 |
|
ISGP = true; |
3385 |
|
GP__ok = true; |
3386 |
|
if(GP){ |
3387 |
|
Int_t nevt = ((TTree*)f->Get("h20"))->GetEntries(); |
3388 |
|
if( nev && nevt!=nev){ |
3389 |
|
cout << "File: "<< f->GetName() <<" discarded ---- OrbitalInfo tree has "<<nevt<<" events instead of "<<nev<< endl; |
3390 |
|
return false; |
3391 |
|
} |
3392 |
|
nev=nevt; |
3393 |
|
} |
3394 |
|
} |
3395 |
|
|
3396 |
}; |
}; |
3397 |
|
|
3432 |
|
|
3433 |
|
|
3434 |
if(!RUN__ok) { |
if(!RUN__ok) { |
3435 |
cout << "File: "<< f->GetName() <<" *WARNING* ---- Missing RunInfo tree"<< endl; |
cout << "File: "<< f->GetName() <<" *WARNING* ---- Missing RunInfo tree (NB: RUN infos will not be updated)"<< endl; |
3436 |
// return false; |
RUN = false; |
3437 |
}; |
}; |
3438 |
|
|
3439 |
if(CAL1 && !CAL1__ok){ |
if(CAL1 && !CAL1__ok){ |
3481 |
cout << "File: "<< f->GetName() <<" discarded ---- Missing Trigger tree"<< endl; |
cout << "File: "<< f->GetName() <<" discarded ---- Missing Trigger tree"<< endl; |
3482 |
return false; |
return false; |
3483 |
}; |
}; |
3484 |
|
if(GP && !GP__ok){ |
3485 |
|
cout << "File: "<< f->GetName() <<" discarded ---- Missing h20 tree"<< endl; |
3486 |
|
return false; |
3487 |
|
}; |
3488 |
|
|
3489 |
|
|
3490 |
// lk->Delete(); |
// lk->Delete(); |
3503 |
// if(ND)cout<<"ND "; |
// if(ND)cout<<"ND "; |
3504 |
// if(S4)cout<<"S4 "; |
// if(S4)cout<<"S4 "; |
3505 |
// if(ORB)cout<<"ORB "; |
// if(ORB)cout<<"ORB "; |
3506 |
|
// if(GP)cout<<"GP "; |
3507 |
// cout << endl; |
// cout << endl; |
3508 |
|
|
3509 |
return true; |
return true; |
3556 |
|
|
3557 |
|
|
3558 |
// if the pointer is null, create a default file |
// if the pointer is null, create a default file |
3559 |
|
if(!run_tree)return; |
3560 |
|
|
3561 |
if(!ofile){ |
if(!ofile){ |
3562 |
cout << "void PamLevel2::CreateCloneTrees(TFile*) -- WARNING -- Creating file: clone-tree.root "<<endl; |
cout << "void PamLevel2::CreateCloneTrees(TFile*) -- WARNING -- Creating file: clone-tree.root "<<endl; |
3577 |
// ------------------ |
// ------------------ |
3578 |
// replicate run tree |
// replicate run tree |
3579 |
// ------------------ |
// ------------------ |
3580 |
cout << "----------------------------------------------------"<<endl; |
// cout << "----------------------------------------------------"<<endl; |
3581 |
cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl; |
// cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl; |
3582 |
for (Int_t i=0; i<run_tree->GetEntries(); i++){ |
for (Int_t i=0; i<run_tree->GetEntries(); i++){ |
3583 |
run_tree->GetEntry(i); |
run_tree->GetEntry(i); |
3584 |
cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl; |
// cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl; |
3585 |
run_tree_clone->Fill(); |
run_tree_clone->Fill(); |
3586 |
} |
} |
3587 |
cout << "----------------------------------------------------"<<endl; |
cout << "----------------------------------------------------"<<endl; |
3588 |
|
|
3589 |
|
// ------------------------------------ |
3590 |
|
// add branch with dead and live times |
3591 |
|
// ------------------------------------ |
3592 |
|
run_tree_clone->Branch("DeadLiveTime",totdltime,"dltime[3]/l"); |
3593 |
|
cout << "Run : branch DeadLiveTime"<<endl; |
3594 |
|
|
3595 |
|
|
3596 |
sel_tree_clone = new TTree("SelectionList","List of selected events "); |
sel_tree_clone = new TTree("SelectionList","List of selected events "); |
3597 |
sel_tree_clone->Branch("RunEntry",&irun,"runentry/L"); |
// sel_tree_clone->Branch("RunEntry",&irun,"runentry/L"); |
3598 |
|
sel_tree_clone->Branch("RunEntry",&irunt,"runentry/L");//NEWNEW |
3599 |
sel_tree_clone->Branch("EventEntry",&irunentry,"eventry/L"); |
sel_tree_clone->Branch("EventEntry",&irunentry,"eventry/L"); |
3600 |
|
|
3601 |
|
|
3675 |
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
3676 |
i++; |
i++; |
3677 |
}; |
}; |
3678 |
|
// GPamela |
3679 |
|
if(GP) { |
3680 |
|
pam_tree_clone[i] = new TTree("h20","PAMELA oribital info "); |
3681 |
|
pam_tree_clone[i]->Branch("GPamela","GPamela", GetPointerTo("GPamela"),32000,1);//split |
3682 |
|
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
3683 |
|
i++; |
3684 |
|
}; |
3685 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
3686 |
|
|
3687 |
} |
} |
3726 |
void PamLevel2::WriteCloneTrees(){ |
void PamLevel2::WriteCloneTrees(){ |
3727 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
3728 |
cout << "Write clones of PAMELA trees "<<endl; |
cout << "Write clones of PAMELA trees "<<endl; |
3729 |
cout << run_tree_clone->GetName()<<endl; |
cout << run_tree_clone->GetName()<<endl; |
3730 |
|
if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries()) |
3731 |
|
run_tree_clone->GetBranch("DeadLiveTime")->Fill(); |
3732 |
run_tree_clone->Write(); |
run_tree_clone->Write(); |
3733 |
cout << sel_tree_clone->GetName()<<endl; |
cout << sel_tree_clone->GetName()<<endl; |
3734 |
sel_tree_clone->Write(); |
sel_tree_clone->Write(); |
3772 |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading pam tree"<<endl; |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading pam tree"<<endl; |
3773 |
return 0; |
return 0; |
3774 |
} |
} |
3775 |
|
|
3776 |
// |
// |
3777 |
// ... that's way I put it here. Notice that nothing change in the code (is backward compatible) since in any case you return with 0. |
// ... that's way I put it here. Notice that nothing change in the code (is backward compatible) since in any case you return with 0. |
3778 |
// in theory one would like to return 1 if run is not loaded but now I don't have the will to add that 2 lines of code and it is not |
// in theory one would like to return 1 if run is not loaded but now I don't have the will to add that 2 lines of code and it is not |
3779 |
// a problem if you don't check the return code of getentry. |
// a problem if you don't check the return code of getentry. |
3780 |
// |
// |
3781 |
if(!run_tree ){ |
if(!RUN || !run_tree ){ |
3782 |
if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1? |
if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1? |
3783 |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl; |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl; |
3784 |
return 0; |
return 0; |
3863 |
// open the DB connection |
// open the DB connection |
3864 |
// (if not already opened) |
// (if not already opened) |
3865 |
//=================================== |
//=================================== |
3866 |
if(!dbc || (dbc && !dbc->IsConnected())){ |
if(!dbc || (dbc && !dbc->IsConnected()))SetDBConnection(); |
|
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
|
|
cout<<"Connecting to DB"<<endl; |
|
|
cout<<"HOST "<<host<<endl; |
|
|
cout<<"USER "<<user<<endl; |
|
|
cout<<"PSW "<<psw<<endl; |
|
|
dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data()); |
|
|
if( !dbc )return NULL; |
|
|
if( !dbc->IsConnected() )return NULL; |
|
|
// cout<<"...done"<<endl; |
|
|
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
|
|
}else{ |
|
|
// cout<<"DB already connected"<<endl; |
|
|
} |
|
3867 |
GL_ROOT glroot = GL_ROOT(); |
GL_ROOT glroot = GL_ROOT(); |
3868 |
if( glroot.Query_GL_ROOT(iroot,dbc) ){ |
if( glroot.Query_GL_ROOT(iroot,dbc) ){ |
3869 |
cout << "TTree* PamLevel2::GetYodaTree( ) -- ERROR -- level0 file iroot = "<<iroot<< " does not exists"<<endl; |
cout << "TTree* PamLevel2::GetYodaTree( ) -- ERROR -- level0 file iroot = "<<iroot<< " does not exists"<<endl; |
3911 |
cout << "PamLevel2::GetYodaTree() --- level0 TOF not implemented "<<endl; |
cout << "PamLevel2::GetYodaTree() --- level0 TOF not implemented "<<endl; |
3912 |
} |
} |
3913 |
|
|
3914 |
|
dbc->Close(); // EMILIANO, do not leave open connections, open only when needed |
3915 |
|
|
3916 |
|
|
3917 |
}; |
}; |
3918 |
|
|
3919 |
if(!dbc || (dbc && !dbc->IsConnected())){ |
// if(!dbc || (dbc && !dbc->IsConnected())){ |
3920 |
cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
// cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
3921 |
} |
// } |
3922 |
|
|
3923 |
if ( TRK0 ){ |
if ( TRK0 ){ |
3924 |
TrkParams::Load(6); |
// TrkParams::Load(6); |
3925 |
if( !TrkParams::IsLoaded(6) ){ |
// if( !TrkParams::IsLoaded(6) ){ |
3926 |
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- VK-mask not loaded"<<endl; |
// cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- VK-mask not loaded"<<endl; |
3927 |
}; |
// }; |
3928 |
|
// if(!dbc || (dbc && !dbc->IsConnected()))SetDBConnection(); |
3929 |
TrkParams::SetCalib(run_obj,dbc); |
TrkParams::SetCalib(run_obj,dbc); |
3930 |
TrkParams::LoadCalib( ); |
TrkParams::LoadCalib( ); |
3931 |
if( !TrkParams::CalibIsLoaded() ){ |
if( !TrkParams::CalibIsLoaded() ){ |
3932 |
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- Calibration not loaded"<<endl; |
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- Calibration not loaded"<<endl; |
3933 |
}; |
}; |
3934 |
|
// if(dbc)dbc->Close(); // EMILIANO, do not leave open connections, open only when needed |
3935 |
} |
} |
3936 |
|
|
3937 |
|
|
3938 |
// cout << l0_tree << endl; |
// cout << l0_tree << endl; |
|
|
|
3939 |
return l0_tree; |
return l0_tree; |
3940 |
|
|
3941 |
} |
} |
3963 |
|
|
3964 |
// cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl; |
// cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl; |
3965 |
// cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl; |
// cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl; |
3966 |
// cout << " time "<< GetOrbitalInfo()->absTime << endl; |
// cout << " time "<< abstime << endl; |
3967 |
// cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl; |
// cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl; |
3968 |
|
|
3969 |
if( !GetOrbitalInfo() ){ |
ULong64_t obt = 0; |
3970 |
|
ULong64_t pktn = 0; |
3971 |
|
if( GetOrbitalInfo() ){ |
3972 |
|
obt = GetOrbitalInfo()->OBT; |
3973 |
|
pktn = GetOrbitalInfo()->pkt_num; |
3974 |
|
} |
3975 |
|
|
3976 |
|
if( !GetOrbitalInfo() && !ISGP){ |
3977 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl; |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl; |
3978 |
return 0; |
return 0; |
3979 |
} |
} |
3980 |
if( GetOrbitalInfo()->OBT==0 && GetOrbitalInfo()->pkt_num==0 ){ |
if( obt==0 && pktn==0 && !ISGP ){ |
3981 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? "<<endl; |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? "<<endl; |
3982 |
return 0; |
return 0; |
3983 |
} |
} |
3996 |
Int_t answer = 0; |
Int_t answer = 0; |
3997 |
Int_t shift =0; |
Int_t shift =0; |
3998 |
// printf(" siamo qui %i %i \n",shift,prevshift); |
// printf(" siamo qui %i %i \n",shift,prevshift); |
3999 |
Int_t maxshift = 10; |
// Int_t maxshift = 50; // EMILIANO |
4000 |
do{ |
do{ |
4001 |
if(shift>0){ |
if(shift>0){ |
4002 |
cout << " PKTNUM L2 --- "<< GetOrbitalInfo()->pkt_num << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
cout << " PKTNUM L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
4003 |
cout << " RUN: ID "<< GetRunInfo()->ID << " ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<" ID_RUN_FRAG "<<GetRunInfo()->ID_RUN_FRAG << " EV_FROM "<<GetRunInfo()->EV_FROM <<endl; |
if(DBG)cout << " RUN: ID "<< GetRunInfo()->ID << " ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<" ID_RUN_FRAG "<<GetRunInfo()->ID_RUN_FRAG << " EV_FROM "<<GetRunInfo()->EV_FROM <<endl; |
4004 |
cout << " L2 <--> L0 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl; |
if(DBG)cout << " L2 <--> L0 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl; |
4005 |
} |
} |
4006 |
answer = l0_tree->GetEntry(quellagiusta+(Long64_t)shift+(Long64_t)prevshift); |
answer = l0_tree->GetEntry(quellagiusta+(Long64_t)shift+(Long64_t)prevshift); |
4007 |
shift++; |
shift++; |
4009 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl; |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl; |
4010 |
return 0; |
return 0; |
4011 |
} |
} |
4012 |
// cout << "PKTNUM "<<shift<<" == L2 --- "<< GetOrbitalInfo()->pkt_num << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
|
4013 |
// cout << " L2 --- "<< GetOrbitalInfo()->OBT << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl; |
if(ISGP){ |
4014 |
|
obt = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()); //BARBATRUCCO |
4015 |
|
pktn = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter()); //BARBATRUCCO |
4016 |
|
} |
4017 |
|
|
4018 |
|
// cout << "PKTNUM "<<shift<<" == L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
4019 |
|
// cout << " L2 --- "<< obt << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl; |
4020 |
// if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl; |
// if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl; |
4021 |
// cout << " GetOrbitalInfo()->OBT "<< GetOrbitalInfo()->OBT << endl; |
// cout << " obt "<< obt << endl; |
4022 |
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
4023 |
// cout << " GetOrbitalInfo()->pkt_num "<< GetOrbitalInfo()->pkt_num << endl; |
// cout << " pktn "<< pktn << endl; |
4024 |
// cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
// cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
4025 |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
4026 |
// |
// |
4027 |
if ( prevshift != 0 && (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() ){ |
if ( prevshift != 0 && (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() ){ |
4028 |
prevshift = 0; |
prevshift = 0; |
4029 |
shift = -1; |
shift = -1; |
4030 |
}; |
}; |
4031 |
|
|
4032 |
}while( ( GetOrbitalInfo()->OBT != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || GetOrbitalInfo()->pkt_num != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() && shift < maxshift); |
}while( ( obt != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || |
4033 |
|
pktn != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter()) ) |
4034 |
|
&& (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() && shift < maxshift); |
4035 |
|
|
4036 |
if ( (quellagiusta+(Long64_t)shift+(Long64_t)prevshift) > GetYodaTree()->GetEntries() || shift == maxshift ) { |
if ( (quellagiusta+(Long64_t)shift+(Long64_t)prevshift) > GetYodaTree()->GetEntries() || shift == maxshift ) { |
4037 |
cout << " Big trouble here, no such event in Level0 data! " <<endl; |
cout << " Big trouble here, no such event in Level0 data! (NB maxshift set to "<<maxshift<<" )" <<endl; |
4038 |
return 0; |
return 0; |
4039 |
} |
} |
4040 |
// cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl; |
// cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl; |
4049 |
*/ |
*/ |
4050 |
Bool_t PamLevel2::SetDBConnection(){ |
Bool_t PamLevel2::SetDBConnection(){ |
4051 |
|
|
4052 |
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
// cout << "PamLevel2::SetDBConnection()" << endl; |
4053 |
cout<<"Connecting to DB"<<endl; |
if(DBG){ |
4054 |
cout<<"HOST "<<host<<endl; |
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
4055 |
cout<<"USER "<<user<<endl; |
cout<<"Connecting to DB"<<endl; |
4056 |
cout<<"PSW "<<psw<<endl; |
cout<<"HOST "<<host<<endl; |
4057 |
|
cout<<"USER "<<user<<endl; |
4058 |
|
cout<<"PSW "<<psw<<endl; |
4059 |
|
} |
4060 |
dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data()); |
dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data()); |
4061 |
if( !dbc )return false; |
if( !dbc )return false; |
4062 |
if( !dbc->IsConnected() )return false; |
if( !dbc->IsConnected() )return false; |
4063 |
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
stringstream myquery; // EMILIANO |
4064 |
|
myquery.str(""); // EMILIANO |
4065 |
|
myquery << "SET time_zone='+0:00'"; // EMILIANO |
4066 |
|
dbc->Query(myquery.str().c_str()); // EMILIANO |
4067 |
|
if(DBG)cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
4068 |
return true; |
return true; |
4069 |
|
|
4070 |
} |
} |
4071 |
|
|
4072 |
|
/** |
4073 |
|
* \Brief Add a friend to the pamela chain. |
4074 |
|
* @param cname name of the chain to be added |
4075 |
|
*/ |
4076 |
|
|
4077 |
|
TChain* PamLevel2::AddFriend(TString cname){ |
4078 |
|
|
4079 |
|
if(!GetPamTree()){ |
4080 |
|
cout << " TChain* PamLevel2::AddFriend(TString cname) --- a pamela tree must be created first"<<endl; |
4081 |
|
return NULL; |
4082 |
|
} |
4083 |
|
|
4084 |
|
|
4085 |
|
TChain *c = new TChain( cname.Data() ); |
4086 |
|
|
4087 |
|
TIter next( GetPamTree()->GetListOfFiles() ); |
4088 |
|
Int_t nf = 0; |
4089 |
|
TChainElement* element = 0; |
4090 |
|
while ((element = (TChainElement*) next())) { |
4091 |
|
c->Add(element->GetTitle()); |
4092 |
|
nf++; |
4093 |
|
} |
4094 |
|
|
4095 |
|
GetPamTree()->AddFriend(cname.Data()); |
4096 |
|
|
4097 |
|
cout << "external chain created and added to pamela friends :"<<cname<<endl; |
4098 |
|
cout << "n.files "<<nf<<endl; |
4099 |
|
|
4100 |
|
|
4101 |
|
return c; |
4102 |
|
|
4103 |
|
} |
4104 |
|
|
4105 |
|
|