1 |
#include <PamLevel2.h> |
2 |
|
3 |
///////////////////////////////////////////////////////////////////////////// |
4 |
///////////////////////////////////////////////////////////////////////////// |
5 |
///////////////////////////////////////////////////////////////////////////// |
6 |
///////////////////////////////////////////////////////////////////////////// |
7 |
|
8 |
void GPamela::Clear() { |
9 |
Irun = 0; |
10 |
Ievnt = 0; |
11 |
Ipa = 0; |
12 |
X0 = 0.; |
13 |
Y0 = 0.; |
14 |
Z0 = 0.; |
15 |
Theta = 0.; |
16 |
Phi = 0.; |
17 |
P0 = 0.; |
18 |
Nthtof = 0; |
19 |
Nthcat = 0; |
20 |
Nthcas = 0; |
21 |
Nthspe = 0; |
22 |
Nstrpx = 0; |
23 |
Nstrpy = 0; |
24 |
Nthcali = 0; |
25 |
Nthcal = 0; |
26 |
Nthnd = 0; |
27 |
Nthcard = 0; |
28 |
} |
29 |
|
30 |
void GPamela::Delete() { |
31 |
|
32 |
Clear(); |
33 |
|
34 |
delete[] Ipltof; |
35 |
delete[] Ipaddle; |
36 |
delete[] Ipartof; |
37 |
delete[] Xintof; |
38 |
delete[] Yintof; |
39 |
delete[] Zintof; |
40 |
delete[] Xouttof; |
41 |
delete[] Youttof; |
42 |
delete[] Zouttof; |
43 |
delete[] Ereltof; |
44 |
delete[] Timetof; |
45 |
delete[] Pathtof; |
46 |
delete[] P0tof; |
47 |
delete[] Iparcat; |
48 |
delete[] Icat; |
49 |
delete[] Xincat; |
50 |
delete[] Yincat; |
51 |
delete[] Zincat; |
52 |
delete[] Xoutcat; |
53 |
delete[] Youtcat; |
54 |
delete[] Zoutcat; |
55 |
delete[] Erelcat; |
56 |
delete[] Timecat; |
57 |
delete[] Pathcat; |
58 |
delete[] P0cat; |
59 |
delete[] Iparcas; |
60 |
delete[] Icas; |
61 |
delete[] Xincas; |
62 |
delete[] Yincas; |
63 |
delete[] Zincas; |
64 |
delete[] Xoutcas; |
65 |
delete[] Youtcas; |
66 |
delete[] Zoutcas; |
67 |
delete[] Erelcas; |
68 |
delete[] Timecas; |
69 |
delete[] Pathcas; |
70 |
delete[] P0cas; |
71 |
delete[] Iparspe; |
72 |
delete[] Itrpb; |
73 |
delete[] Itrsl; |
74 |
delete[] Itspa; |
75 |
delete[] Xinspe; |
76 |
delete[] Yinspe; |
77 |
delete[] Zinspe; |
78 |
delete[] Xoutspe; |
79 |
delete[] Youtspe; |
80 |
delete[] Zoutspe; |
81 |
delete[] Xavspe; |
82 |
delete[] Yavspe; |
83 |
delete[] Zavspe; |
84 |
delete[] Erelspe; |
85 |
delete[] Pathspe; |
86 |
delete[] P0spe; |
87 |
delete[] Nxmult; |
88 |
delete[] Nymult; |
89 |
delete[] Npstripx; |
90 |
delete[] Ntstripx; |
91 |
delete[] Istripx; |
92 |
delete[] Qstripx; |
93 |
delete[] Xstripx; |
94 |
delete[] Npstripy; |
95 |
delete[] Ntstripy; |
96 |
delete[] Istripy; |
97 |
delete[] Qstripy; |
98 |
delete[] Ystripy; |
99 |
delete[] Icaplane; |
100 |
delete[] Icastrip; |
101 |
delete[] Icamod; |
102 |
delete[] Enestrip; |
103 |
delete[] Icapl; |
104 |
delete[] Icasi; |
105 |
delete[] Icast; |
106 |
delete[] Xincal; |
107 |
delete[] Yincal; |
108 |
delete[] Zincal; |
109 |
delete[] Erelcal; |
110 |
delete[] Itubend; |
111 |
delete[] Iparnd; |
112 |
delete[] Xinnd; |
113 |
delete[] Yinnd; |
114 |
delete[] Zinnd; |
115 |
delete[] Xoutnd; |
116 |
delete[] Youtnd; |
117 |
delete[] Zoutnd; |
118 |
delete[] Erelnd; |
119 |
delete[] Timend; |
120 |
delete[] Pathnd; |
121 |
delete[] P0nd; |
122 |
delete[] Iparcard; |
123 |
delete[] Icard; |
124 |
delete[] Xincard; |
125 |
delete[] Yincard; |
126 |
delete[] Zincard; |
127 |
delete[] Xoutcard; |
128 |
delete[] Youtcard; |
129 |
delete[] Zoutcard; |
130 |
delete[] Erelcard; |
131 |
delete[] Timecard; |
132 |
delete[] Pathcard; |
133 |
delete[] P0card; |
134 |
|
135 |
} |
136 |
; |
137 |
|
138 |
void GPamela::SetBranchAddress(TChain* fhBookTree) { |
139 |
|
140 |
// cout << "fhBookTree "<<fhBookTree << endl; |
141 |
// prepare tree |
142 |
fhBookTree->SetBranchAddress("Irun", &Irun); |
143 |
fhBookTree->SetBranchAddress("Ievnt", &Ievnt); |
144 |
fhBookTree->SetBranchAddress("Ipa", &Ipa); |
145 |
fhBookTree->SetBranchAddress("X0", &X0); |
146 |
fhBookTree->SetBranchAddress("Y0", &Y0); |
147 |
fhBookTree->SetBranchAddress("Z0", &Z0); |
148 |
fhBookTree->SetBranchAddress("Theta", &Theta); |
149 |
fhBookTree->SetBranchAddress("Phi", &Phi); |
150 |
fhBookTree->SetBranchAddress("P0", &P0); |
151 |
fhBookTree->SetBranchAddress("Nthtof", &Nthtof); |
152 |
fhBookTree->SetBranchAddress("Ipltof", Ipltof); |
153 |
fhBookTree->SetBranchAddress("Ipaddle", Ipaddle); |
154 |
fhBookTree->SetBranchAddress("Ipartof", Ipartof); |
155 |
fhBookTree->SetBranchAddress("Xintof", Xintof); |
156 |
fhBookTree->SetBranchAddress("Yintof", Yintof); |
157 |
fhBookTree->SetBranchAddress("Zintof", Zintof); |
158 |
fhBookTree->SetBranchAddress("Xouttof", Xouttof); |
159 |
fhBookTree->SetBranchAddress("Youttof", Youttof); |
160 |
fhBookTree->SetBranchAddress("Zouttof", Zouttof); |
161 |
fhBookTree->SetBranchAddress("Ereltof", Ereltof); |
162 |
fhBookTree->SetBranchAddress("Timetof", Timetof); |
163 |
fhBookTree->SetBranchAddress("Pathtof", Pathtof); |
164 |
fhBookTree->SetBranchAddress("P0tof", P0tof); |
165 |
fhBookTree->SetBranchAddress("Nthcat", &Nthcat); |
166 |
fhBookTree->SetBranchAddress("Iparcat", Iparcat); |
167 |
fhBookTree->SetBranchAddress("Icat", Icat); |
168 |
fhBookTree->SetBranchAddress("Xincat", Xincat); |
169 |
fhBookTree->SetBranchAddress("Yincat", Yincat); |
170 |
fhBookTree->SetBranchAddress("Zincat", Zincat); |
171 |
fhBookTree->SetBranchAddress("Xoutcat", Xoutcat); |
172 |
fhBookTree->SetBranchAddress("Youtcat", Youtcat); |
173 |
fhBookTree->SetBranchAddress("Zoutcat", Zoutcat); |
174 |
fhBookTree->SetBranchAddress("Erelcat", Erelcat); |
175 |
fhBookTree->SetBranchAddress("Timecat", Timecat); |
176 |
fhBookTree->SetBranchAddress("Pathcat", Pathcat); |
177 |
fhBookTree->SetBranchAddress("P0cat", P0cat); |
178 |
fhBookTree->SetBranchAddress("Nthcas", &Nthcas); |
179 |
fhBookTree->SetBranchAddress("Iparcas", Iparcas); |
180 |
fhBookTree->SetBranchAddress("Icas", Icas); |
181 |
fhBookTree->SetBranchAddress("Xincas", Xincas); |
182 |
fhBookTree->SetBranchAddress("Yincas", Yincas); |
183 |
fhBookTree->SetBranchAddress("Zincas", Zincas); |
184 |
fhBookTree->SetBranchAddress("Xoutcas", Xoutcas); |
185 |
fhBookTree->SetBranchAddress("Youtcas", Youtcas); |
186 |
fhBookTree->SetBranchAddress("Zoutcas", Zoutcas); |
187 |
fhBookTree->SetBranchAddress("Erelcas", Erelcas); |
188 |
fhBookTree->SetBranchAddress("Timecas", Timecas); |
189 |
fhBookTree->SetBranchAddress("Pathcas", Pathcas); |
190 |
fhBookTree->SetBranchAddress("P0cas", P0cas); |
191 |
fhBookTree->SetBranchAddress("Nthspe", &Nthspe); |
192 |
fhBookTree->SetBranchAddress("Iparspe", Iparspe); |
193 |
fhBookTree->SetBranchAddress("Itrpb", Itrpb); |
194 |
fhBookTree->SetBranchAddress("Itrsl", Itrsl); |
195 |
fhBookTree->SetBranchAddress("Itspa", Itspa); |
196 |
fhBookTree->SetBranchAddress("Xinspe", Xinspe); |
197 |
fhBookTree->SetBranchAddress("Yinspe", Yinspe); |
198 |
fhBookTree->SetBranchAddress("Zinspe", Zinspe); |
199 |
fhBookTree->SetBranchAddress("Xoutspe", Xoutspe); |
200 |
fhBookTree->SetBranchAddress("Youtspe", Youtspe); |
201 |
fhBookTree->SetBranchAddress("Zoutspe", Zoutspe); |
202 |
fhBookTree->SetBranchAddress("Xavspe", Xavspe); |
203 |
fhBookTree->SetBranchAddress("Yavspe", Yavspe); |
204 |
fhBookTree->SetBranchAddress("Zavspe", Zavspe); |
205 |
fhBookTree->SetBranchAddress("Erelspe", Erelspe); |
206 |
fhBookTree->SetBranchAddress("Pathspe", Pathspe); |
207 |
fhBookTree->SetBranchAddress("P0spe", P0spe); |
208 |
fhBookTree->SetBranchAddress("Nxmult", Nxmult); |
209 |
fhBookTree->SetBranchAddress("Nymult", Nymult); |
210 |
fhBookTree->SetBranchAddress("Nstrpx", &Nstrpx); |
211 |
fhBookTree->SetBranchAddress("Npstripx", Npstripx); |
212 |
fhBookTree->SetBranchAddress("Ntstripx", Ntstripx); |
213 |
fhBookTree->SetBranchAddress("Istripx", Istripx); |
214 |
fhBookTree->SetBranchAddress("Qstripx", Qstripx); |
215 |
fhBookTree->SetBranchAddress("Xstripx", Xstripx); |
216 |
fhBookTree->SetBranchAddress("Nstrpy", &Nstrpy); |
217 |
fhBookTree->SetBranchAddress("Npstripy", Npstripy); |
218 |
fhBookTree->SetBranchAddress("Ntstripy", Ntstripy); |
219 |
fhBookTree->SetBranchAddress("Istripy", Istripy); |
220 |
fhBookTree->SetBranchAddress("Qstripy", Qstripy); |
221 |
fhBookTree->SetBranchAddress("Ystripy", Ystripy); |
222 |
fhBookTree->SetBranchAddress("Nthcali", &Nthcali); |
223 |
fhBookTree->SetBranchAddress("Icaplane", Icaplane); |
224 |
fhBookTree->SetBranchAddress("Icastrip", Icastrip); |
225 |
fhBookTree->SetBranchAddress("Icamod", Icamod); |
226 |
fhBookTree->SetBranchAddress("Enestrip", Enestrip); |
227 |
fhBookTree->SetBranchAddress("Nthcal", &Nthcal); |
228 |
fhBookTree->SetBranchAddress("Icapl", Icapl); |
229 |
fhBookTree->SetBranchAddress("Icasi", Icasi); |
230 |
fhBookTree->SetBranchAddress("Icast", Icast); |
231 |
fhBookTree->SetBranchAddress("Xincal", Xincal); |
232 |
fhBookTree->SetBranchAddress("Yincal", Yincal); |
233 |
fhBookTree->SetBranchAddress("Zincal", Zincal); |
234 |
fhBookTree->SetBranchAddress("Erelcal", Erelcal); |
235 |
fhBookTree->SetBranchAddress("Nthnd", &Nthnd); |
236 |
fhBookTree->SetBranchAddress("Itubend", Itubend); |
237 |
fhBookTree->SetBranchAddress("Iparnd", Iparnd); |
238 |
fhBookTree->SetBranchAddress("Xinnd", Xinnd); |
239 |
fhBookTree->SetBranchAddress("Yinnd", Yinnd); |
240 |
fhBookTree->SetBranchAddress("Zinnd", Zinnd); |
241 |
fhBookTree->SetBranchAddress("Xoutnd", Xoutnd); |
242 |
fhBookTree->SetBranchAddress("Youtnd", Youtnd); |
243 |
fhBookTree->SetBranchAddress("Zoutnd", Zoutnd); |
244 |
fhBookTree->SetBranchAddress("Erelnd", Erelnd); |
245 |
fhBookTree->SetBranchAddress("Timend", Timend); |
246 |
fhBookTree->SetBranchAddress("Pathnd", Pathnd); |
247 |
fhBookTree->SetBranchAddress("P0nd", P0nd); |
248 |
fhBookTree->SetBranchAddress("Nthcard", &Nthcard); |
249 |
fhBookTree->SetBranchAddress("Iparcard", Iparcard); |
250 |
fhBookTree->SetBranchAddress("Icard", Icard); |
251 |
fhBookTree->SetBranchAddress("Xincard", Xincard); |
252 |
fhBookTree->SetBranchAddress("Yincard", Yincard); |
253 |
fhBookTree->SetBranchAddress("Zincard", Zincard); |
254 |
fhBookTree->SetBranchAddress("Xoutcard", Xoutcard); |
255 |
fhBookTree->SetBranchAddress("Youtcard", Youtcard); |
256 |
fhBookTree->SetBranchAddress("Zoutcard", Zoutcard); |
257 |
fhBookTree->SetBranchAddress("Erelcard", Erelcard); |
258 |
fhBookTree->SetBranchAddress("Timecard", Timecard); |
259 |
fhBookTree->SetBranchAddress("Pathcard", Pathcard); |
260 |
fhBookTree->SetBranchAddress("P0card", P0card); |
261 |
|
262 |
// fhBookTree->SetBranchStatus("*",0); |
263 |
|
264 |
} |
265 |
|
266 |
ClassImp( GPamela); |
267 |
|
268 |
///////////////////////////////////////////////////////////////////////////// |
269 |
///////////////////////////////////////////////////////////////////////////// |
270 |
///////////////////////////////////////////////////////////////////////////// |
271 |
///////////////////////////////////////////////////////////////////////////// |
272 |
//-------------------------------------- |
273 |
// |
274 |
// |
275 |
//-------------------------------------- |
276 |
/** |
277 |
* Default constructor |
278 |
*/ |
279 |
PamTrack::PamTrack() { |
280 |
trk_track = 0; |
281 |
calo_track = 0; |
282 |
tof_track = 0; |
283 |
orb_track = 0; |
284 |
candeleteobj = 0; |
285 |
pscore = 0; |
286 |
iscore = 0; |
287 |
} |
288 |
; |
289 |
//-------------------------------------- |
290 |
// |
291 |
// |
292 |
//-------------------------------------- |
293 |
/** |
294 |
* Constructor |
295 |
*/ |
296 |
PamTrack::PamTrack(TrkTrack* t, CaloTrkVar* c, ToFTrkVar* o, OrbitalInfoTrkVar *r) { |
297 |
|
298 |
trk_track = 0; |
299 |
calo_track = 0; |
300 |
tof_track = 0; |
301 |
orb_track = 0; |
302 |
// if(t)trk_track = new TrkTrack(*t); |
303 |
// if(c)calo_track = new CaloTrkVar(*c); |
304 |
// if(o)tof_track = new ToFTrkVar(*o); |
305 |
if (t) |
306 |
trk_track = t; |
307 |
if (c) |
308 |
calo_track = c; |
309 |
if (o) |
310 |
tof_track = o; |
311 |
if (r) |
312 |
orb_track = r; |
313 |
|
314 |
candeleteobj = 0; |
315 |
|
316 |
} |
317 |
; |
318 |
PamTrack::PamTrack(const PamTrack& track) { |
319 |
|
320 |
TrkTrack *t = track.trk_track; |
321 |
CaloTrkVar *c = track.calo_track; |
322 |
ToFTrkVar *o = track.tof_track; |
323 |
OrbitalInfoTrkVar *r = track.orb_track; |
324 |
|
325 |
trk_track = 0; |
326 |
calo_track = 0; |
327 |
tof_track = 0; |
328 |
orb_track = 0; |
329 |
if (t) |
330 |
trk_track = new TrkTrack(*t); |
331 |
if (c) |
332 |
calo_track = new CaloTrkVar(*c); |
333 |
if (o) |
334 |
tof_track = new ToFTrkVar(*o); |
335 |
if (r) |
336 |
orb_track = new OrbitalInfoTrkVar(*r); |
337 |
candeleteobj = 1; |
338 |
|
339 |
} |
340 |
void PamTrack::Clear() { |
341 |
|
342 |
// cout << "PamTrack::Clear() "<<candeleteobj<<endl; |
343 |
if (candeleteobj) { |
344 |
if (trk_track) |
345 |
trk_track->TrkTrack::Clear(); |
346 |
if (calo_track) |
347 |
calo_track->CaloTrkVar::Clear();//??? |
348 |
if (tof_track) |
349 |
tof_track->ToFTrkVar::Clear();//??? |
350 |
if (orb_track) |
351 |
orb_track->OrbitalInfoTrkVar::Clear();//??? |
352 |
} |
353 |
else { |
354 |
trk_track = 0; |
355 |
calo_track = 0; |
356 |
tof_track = 0; |
357 |
orb_track = 0; |
358 |
} |
359 |
pscore = 0; |
360 |
iscore = 0; |
361 |
|
362 |
} |
363 |
void PamTrack::Delete() { |
364 |
// cout << "PamTrack::Delete() "<<candeleteobj<<endl; |
365 |
if (candeleteobj) { |
366 |
if (trk_track) { |
367 |
trk_track->TrkTrack::Clear(); |
368 |
delete trk_track; |
369 |
} |
370 |
if (calo_track) { |
371 |
calo_track->CaloTrkVar::Clear();//??? |
372 |
delete calo_track; |
373 |
} |
374 |
if (tof_track) { |
375 |
tof_track->ToFTrkVar::Clear();//??? |
376 |
delete tof_track; |
377 |
} |
378 |
if (orb_track) { |
379 |
orb_track->OrbitalInfoTrkVar::Clear();//??? |
380 |
delete orb_track; |
381 |
} |
382 |
} |
383 |
else { |
384 |
Clear(); |
385 |
} |
386 |
} |
387 |
//-------------------------------------- |
388 |
// |
389 |
// |
390 |
//-------------------------------------- |
391 |
/** |
392 |
* Default Constructor |
393 |
*/ |
394 |
PamLevel2::PamLevel2() { |
395 |
Initialize(); |
396 |
} |
397 |
; |
398 |
|
399 |
/** |
400 |
* Constructor |
401 |
* @param ddir Name of directory where level2 files are stored. |
402 |
* @param list Name of an ascii file containing the list of file names |
403 |
* @param detlist Options to chose what to load. |
404 |
* Possible options are: |
405 |
* +AUTO --> load all trees/branches in the input files |
406 |
* +(-)ALL --> inlcude(exclude) all trees/branches |
407 |
* +(-)TRK1+(-)TRK2+(-)CAL1+(-)CAL2+(-)TOF+(-)TRG+(-)ND+(-)S4+(-)ORB+(-)AC --> inlcude(exclude) trees and branches |
408 |
* +(-)TRK0 --> include(exclude) tracker level0 tree |
409 |
* +(-)GP --> include exclude GPAMELA output tree |
410 |
* If no options are specified, the default is assumed. Default is: |
411 |
* +TRK2+CAL2+CAL1+TOF+TRG+ND+AC+S4+ORB |
412 |
*/ |
413 |
PamLevel2::PamLevel2(TString ddir, TString llist, TString detlist) { |
414 |
Initialize(); |
415 |
TList* listf = GetListOfLevel2Files(ddir, llist); |
416 |
if (listf) |
417 |
GetPamTree(listf, detlist); |
418 |
if (listf) |
419 |
GetRunTree(listf); |
420 |
} |
421 |
; |
422 |
|
423 |
PamLevel2::PamLevel2(TString ddir, TList *llist, TString detlist) { |
424 |
Initialize(); |
425 |
GetPamTree(llist, detlist); |
426 |
GetRunTree(llist); |
427 |
} |
428 |
; |
429 |
/** |
430 |
* Constructor |
431 |
* @param ddir Name of directory where level2 files are stored. |
432 |
* @param list Name of an ascii file containing the list of file names |
433 |
* Default trees/branches are loaded. Default is: |
434 |
* +TRK2+CAL2+CAL1+TOF+TRG+ND+AC+S4+ORB |
435 |
*/ |
436 |
PamLevel2::PamLevel2(TString ddir, TString llist) { |
437 |
Initialize(); |
438 |
TList* listf = GetListOfLevel2Files(ddir, llist); |
439 |
GetPamTree(listf, ""); |
440 |
GetRunTree(listf); |
441 |
} |
442 |
; |
443 |
|
444 |
void PamLevel2::Initialize() { |
445 |
|
446 |
h0_obj = 0; |
447 |
trk0_obj = 0; |
448 |
calo0_obj = 0; |
449 |
|
450 |
trk2_obj = 0; |
451 |
trk1_obj = 0; |
452 |
trkh_obj = 0; |
453 |
calo1_obj = 0; |
454 |
calo2_obj = 0; |
455 |
tof_obj = 0; |
456 |
trig_obj = 0; |
457 |
s4_obj = 0; |
458 |
nd_obj = 0; |
459 |
ac_obj = 0; |
460 |
orb_obj = 0; |
461 |
gp_obj = 0; |
462 |
|
463 |
run_obj = 0;//new GL_RUN(); |
464 |
soft_obj = 0;// Emiliano |
465 |
irun = -1LL; |
466 |
irunt = -1LL; |
467 |
runfirstentry = 0LL; |
468 |
runlastentry = 0LL; |
469 |
gltsync = 0; // Emiliano |
470 |
fUpdateRunInfo = true; // Emiliano |
471 |
|
472 |
l0_file = NULL; |
473 |
l0_tree = NULL; |
474 |
iroot = -1; |
475 |
dbc = 0; |
476 |
|
477 |
prevshift = 0; |
478 |
maxshift = 10; //EMILIANO |
479 |
|
480 |
run_tree = NULL; |
481 |
run_tree_clone = NULL; |
482 |
sel_tree = NULL; |
483 |
sel_tree_clone = NULL; |
484 |
|
485 |
irunentry = -1LL; |
486 |
pam_tree = NULL; |
487 |
for (Int_t i = 0; i < NCLONES; i++) |
488 |
pam_tree_clone[i] = NULL; |
489 |
|
490 |
totdltime[0] = 0LL; |
491 |
totdltime[1] = 0LL; |
492 |
totdltime[2] = 0LL; |
493 |
|
494 |
host = "mysql://localhost/pamelaprod"; |
495 |
user = "anonymous"; |
496 |
psw = ""; |
497 |
const char *pamdbhost = gSystem->Getenv("PAM_DBHOST"); |
498 |
const char *pamdbuser = gSystem->Getenv("PAM_DBUSER"); |
499 |
const char *pamdbpsw = gSystem->Getenv("PAM_DBPSW"); |
500 |
if (!pamdbhost) |
501 |
pamdbhost = ""; |
502 |
if (!pamdbuser) |
503 |
pamdbuser = ""; |
504 |
if (!pamdbpsw) |
505 |
pamdbpsw = ""; |
506 |
if (strcmp(pamdbhost, "")) |
507 |
host = pamdbhost; |
508 |
if (strcmp(pamdbuser, "")) |
509 |
user = pamdbuser; |
510 |
if (strcmp(pamdbpsw, "")) |
511 |
psw = pamdbpsw; |
512 |
|
513 |
// sorted_tracks = 0;//new TRefArray(); |
514 |
|
515 |
CAL0 = false; |
516 |
CAL1 = true; |
517 |
CAL2 = true; |
518 |
TRK2 = true; |
519 |
TRK1 = false; |
520 |
TRK0 = false; |
521 |
TRKh = false; |
522 |
TRG = true; |
523 |
TOF = true; |
524 |
TOF0 = false; |
525 |
S4 = true; |
526 |
ND = true; |
527 |
AC = true; |
528 |
ORB = true; |
529 |
GP = false; |
530 |
|
531 |
RUN = true; |
532 |
|
533 |
SELLI = -1; |
534 |
|
535 |
ISGP = false; |
536 |
|
537 |
DBG = false; |
538 |
|
539 |
tsorted = 0; |
540 |
timage = 0; |
541 |
|
542 |
howtosort = "+CAL+TOF"; |
543 |
//howtosort = "+TOF"; |
544 |
sortthr = 100.; |
545 |
|
546 |
issorted = false; |
547 |
lastsorted = -1; |
548 |
|
549 |
} |
550 |
; |
551 |
/** |
552 |
* Delete the event (act as Dtor) |
553 |
*/ |
554 |
void PamLevel2::Delete() { |
555 |
|
556 |
if (run_obj) |
557 |
delete run_obj; |
558 |
if (soft_obj) |
559 |
delete soft_obj; //Emiliano |
560 |
|
561 |
// cout << "void PamLevel2::Clear()"<<endl; |
562 |
if (h0_obj) |
563 |
delete h0_obj; |
564 |
if (trk0_obj) |
565 |
delete trk0_obj; |
566 |
if (calo0_obj) |
567 |
delete calo0_obj; |
568 |
if (trk1_obj) |
569 |
delete trk1_obj; |
570 |
if (trk2_obj) |
571 |
delete trk2_obj; |
572 |
if (trkh_obj) |
573 |
delete trkh_obj; |
574 |
if (calo1_obj) |
575 |
delete calo1_obj; |
576 |
if (calo2_obj) |
577 |
delete calo2_obj; |
578 |
if (tof_obj) |
579 |
delete tof_obj; |
580 |
if (trig_obj) |
581 |
delete trig_obj; |
582 |
if (s4_obj) |
583 |
delete s4_obj; |
584 |
if (nd_obj) |
585 |
delete nd_obj; |
586 |
if (ac_obj) |
587 |
delete ac_obj; |
588 |
if (orb_obj) |
589 |
delete orb_obj; |
590 |
if (gp_obj) |
591 |
delete gp_obj; |
592 |
|
593 |
if (tsorted) { |
594 |
tsorted->Delete(); |
595 |
delete tsorted; |
596 |
} |
597 |
if (timage) { |
598 |
timage->Delete(); |
599 |
delete timage; |
600 |
} |
601 |
|
602 |
if (dbc) { |
603 |
dbc->Close(); |
604 |
delete dbc; |
605 |
dbc=0; |
606 |
} |
607 |
|
608 |
if (gltsync) |
609 |
delete gltsync; |
610 |
|
611 |
if (l0_file) |
612 |
l0_file->Close(); |
613 |
// if(pam_tree)pam_tree->Delete();; |
614 |
|
615 |
if (pam_tree) { |
616 |
// |
617 |
// 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... |
618 |
// |
619 |
TList *temp = pam_tree->GetListOfFriends(); |
620 |
TList *contents = new TList; // create chain friend list |
621 |
contents->SetOwner(); |
622 |
TIter next(temp); |
623 |
TChain *questo = 0; |
624 |
while ((questo = (TChain*) next())) { |
625 |
TString name = questo->GetName(); |
626 |
contents->Add((TChain*) gROOT->FindObject(name.Data()));// add object to the list |
627 |
}; |
628 |
// |
629 |
// deleting the main chain |
630 |
// |
631 |
pam_tree->Delete(); |
632 |
// |
633 |
// deleting the friends... |
634 |
// |
635 |
TIter next2(contents); |
636 |
TChain *questa = 0; |
637 |
while ( (questa = (TChain*)next2()) ) { |
638 |
TString name = questa->GetName(); |
639 |
questa->Delete(); |
640 |
questa = NULL; |
641 |
}; |
642 |
// |
643 |
}; |
644 |
pam_tree = NULL; |
645 |
|
646 |
if (run_tree) |
647 |
run_tree->Delete();; |
648 |
if (sel_tree) |
649 |
sel_tree->Delete();; |
650 |
|
651 |
// The following lines are commented out since they may generate a double delete error |
652 |
// if the file containing the clone trees is closed. This is because the file owns the |
653 |
// clone trees which are written into it, so it will delete them when it is closed; if |
654 |
// also PamLevel2 will try to delete these trees, a double delete error will be generated |
655 |
// when exiting from analysis program. (Nicola 28/11/2011) |
656 |
|
657 |
/*for (Int_t i = 0; i < NCLONES; i++) |
658 |
if (pam_tree_clone[i]) |
659 |
pam_tree_clone[i]->Delete();; |
660 |
if (run_tree_clone) |
661 |
run_tree_clone->Delete();; |
662 |
if (sel_tree_clone) |
663 |
sel_tree_clone->Delete();;*/ |
664 |
|
665 |
if (irunoffset) |
666 |
delete[] irunoffset; |
667 |
|
668 |
} |
669 |
; |
670 |
|
671 |
/** |
672 |
* Clear the event (NB! does not deallocate objects) |
673 |
*/ |
674 |
void PamLevel2::Clear() { |
675 |
|
676 |
// cout << "void PamLevel2::Clear()"<<endl; |
677 |
|
678 |
// |
679 |
// This method is called once for every entry but RunInfo and SoftInfo do not change until the next run so we cannot clear them here unless we don't |
680 |
// want to load them for each event even if they are the same... |
681 |
// |
682 |
// if(run_obj)delete run_obj; |
683 |
// if(run_obj) run_obj->Clear(); // Emiliano: Do not deallocate run_obj here, it will give segmentation fault! call clear instead |
684 |
// if(soft_obj) soft_obj->Clear(); |
685 |
|
686 |
if (h0_obj) |
687 |
h0_obj->Clear(); |
688 |
// if(trk0_obj) trk0_obj->Clear(); |
689 |
if (trk1_obj) |
690 |
trk1_obj->Clear(); |
691 |
if (trk2_obj) |
692 |
trk2_obj->Clear(); |
693 |
if (trkh_obj) |
694 |
trkh_obj->Clear(); |
695 |
if (calo0_obj) |
696 |
calo0_obj->Clear(); |
697 |
if (calo1_obj) |
698 |
calo1_obj->Clear(); |
699 |
if (calo2_obj) |
700 |
calo2_obj->Clear(); |
701 |
if (tof_obj) |
702 |
tof_obj->Clear(); |
703 |
if (trig_obj) |
704 |
trig_obj->Clear(); |
705 |
if (s4_obj) |
706 |
s4_obj->Clear(); |
707 |
if (nd_obj) |
708 |
nd_obj->Clear(); |
709 |
if (ac_obj) |
710 |
ac_obj->Clear(); |
711 |
if (orb_obj) |
712 |
orb_obj->Clear(); |
713 |
if (gp_obj) |
714 |
gp_obj->Clear(); |
715 |
|
716 |
// if(sorted_tracks)sorted_tracks->Clear(); |
717 |
// sorted_tracks.Clear(); |
718 |
|
719 |
if (tsorted) { |
720 |
tsorted->Delete(); |
721 |
} |
722 |
if (timage) { |
723 |
timage->Delete(); |
724 |
} |
725 |
} |
726 |
; |
727 |
|
728 |
void PamLevel2::Reset() { |
729 |
// |
730 |
// First of all clear everything |
731 |
// |
732 |
Clear(); |
733 |
// |
734 |
// close and reset chains and pointers |
735 |
// |
736 |
if (pam_tree) { |
737 |
// |
738 |
// 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... |
739 |
// |
740 |
TList *temp = pam_tree->GetListOfFriends(); |
741 |
TList *contents = new TList; // create chain friend list |
742 |
contents->SetOwner(); |
743 |
TIter next(temp); |
744 |
TChain *questo = 0; |
745 |
while ((questo = (TChain*) next())) { |
746 |
TString name = questo->GetName(); |
747 |
contents->Add((TChain*) gROOT->FindObject(name.Data()));// add object to the list |
748 |
}; |
749 |
// |
750 |
// deleting the main chain |
751 |
// |
752 |
pam_tree->Delete(); |
753 |
// |
754 |
// deleting the friends... |
755 |
// |
756 |
TIter next2(contents); |
757 |
TChain *questa = 0; |
758 |
while ( (questa = (TChain*) next2()) ) { |
759 |
TString name = questa->GetName(); |
760 |
questa->Delete(); |
761 |
questa = NULL; |
762 |
}; |
763 |
// |
764 |
}; |
765 |
pam_tree = NULL; |
766 |
// |
767 |
if (run_tree) |
768 |
run_tree->Delete();; |
769 |
run_tree = NULL; |
770 |
if (sel_tree) |
771 |
sel_tree->Delete();; |
772 |
sel_tree = NULL; |
773 |
// |
774 |
// Close file |
775 |
// |
776 |
if (l0_file) |
777 |
l0_file->Close("R"); |
778 |
l0_file = NULL; |
779 |
// |
780 |
h0_obj = 0; |
781 |
trk0_obj = 0; |
782 |
calo0_obj = 0; |
783 |
// |
784 |
trk2_obj = 0; |
785 |
trk1_obj = 0; |
786 |
trkh_obj = 0; |
787 |
calo1_obj = 0; |
788 |
calo2_obj = 0; |
789 |
tof_obj = 0; |
790 |
trig_obj = 0; |
791 |
s4_obj = 0; |
792 |
nd_obj = 0; |
793 |
ac_obj = 0; |
794 |
orb_obj = 0; |
795 |
gp_obj = 0; |
796 |
// |
797 |
// Reset run pointers |
798 |
// |
799 |
run_obj = 0;//new GL_RUN(); |
800 |
soft_obj = 0;// Emiliano |
801 |
irun = -1; |
802 |
irunt = -1; |
803 |
runfirstentry = 0ULL; |
804 |
runlastentry = 0ULL; |
805 |
// |
806 |
totdltime[0] = 0LL; |
807 |
totdltime[1] = 0LL; |
808 |
totdltime[2] = 0LL; |
809 |
// |
810 |
} |
811 |
; |
812 |
|
813 |
Bool_t PamLevel2::IsGood(Bool_t strict) { |
814 |
Bool_t goodev = true; |
815 |
// |
816 |
if (calo2_obj && !calo2_obj->IsGood(strict)) |
817 |
goodev = false; |
818 |
// |
819 |
if (strict) { |
820 |
if (trk2_obj && trk2_obj->UnpackError() != 0) |
821 |
goodev = false; |
822 |
if (tof_obj && tof_obj->unpackError != 0) |
823 |
goodev = false; |
824 |
if (trig_obj && trig_obj->unpackError != 0) |
825 |
goodev = false; |
826 |
if (s4_obj && s4_obj->unpackError != 0) |
827 |
goodev = false; |
828 |
if (nd_obj && nd_obj->unpackError != 0) |
829 |
goodev = false; |
830 |
if (ac_obj && (ac_obj->unpackError != 0 || ((ac_obj->status[0] >> 2) & 1) || ((ac_obj->status[1] >> 2) & 1))) |
831 |
goodev = false; |
832 |
// if(orb_obj) |
833 |
} |
834 |
else { |
835 |
if (nd_obj && nd_obj->unpackError != 0) |
836 |
goodev = false; |
837 |
if (ac_obj && (ac_obj->unpackError != 0 || ((ac_obj->status[0] >> 2) & 1) || ((ac_obj->status[1] >> 2) & 1))) |
838 |
goodev = false; |
839 |
}; |
840 |
return (goodev); |
841 |
} |
842 |
; |
843 |
|
844 |
void PamLevel2::SkipRunInfoUpdate(){ |
845 |
printf("\n\n ******** WARNING ******** \n Skip DB connections, DO NOT USE PamLevel2::GetRunInfo() method! \n\n"); |
846 |
fUpdateRunInfo = false; |
847 |
this->SetSELLI(2); |
848 |
printf(" ===============> W A R N I N G <================ \n"); |
849 |
printf(" in case PamLevel2::CreateCloneTrees() will be called \n"); |
850 |
printf(" it will be reverted to PadmeAmidala level2 structure , i.e. NO SELECTIONLIST WILL BE CREATED IN THE NEW LEVEL2 FILE! \n\n"); |
851 |
if ( run_tree_clone ){ |
852 |
printf(" ===============> W A R N I N G <================ \n"); |
853 |
printf(" PamLevel2::SkipRunIndoUpdate or PamLevel2::NoDBconnections() has been called together with PamLevel2::CreateCloneTrees() \n"); |
854 |
printf(" TO AVOID CRASHES call PamLevel2::CreateCloneTrees() after PamLevel2::SkipRunIndoUpdate or PamLevel2::NoDBconnections() \n"); |
855 |
}; |
856 |
} |
857 |
|
858 |
//-------------------------------------- |
859 |
// |
860 |
// |
861 |
//-------------------------------------- |
862 |
void *PamLevel2::GetPointerTo(const char* c) { |
863 |
|
864 |
TString objname = c; |
865 |
|
866 |
if (!objname.CompareTo("TrkLevel1")) { |
867 |
if (!trk1_obj) { |
868 |
trk1_obj = new TrkLevel1(); |
869 |
trk1_obj->Set(); |
870 |
} |
871 |
return &trk1_obj; |
872 |
}; |
873 |
if (!objname.CompareTo("TrkLevel2")) { |
874 |
if (!trk2_obj) { |
875 |
trk2_obj = new TrkLevel2(); |
876 |
trk2_obj->Set(); |
877 |
} |
878 |
return &trk2_obj; |
879 |
}; |
880 |
if (!objname.CompareTo("TrkHough")) { |
881 |
if (!trkh_obj) { |
882 |
trkh_obj = new TrkHough(); |
883 |
trkh_obj->Set(); |
884 |
} |
885 |
return &trkh_obj; |
886 |
}; |
887 |
if (!objname.CompareTo("CaloLevel1")) { |
888 |
if (!calo1_obj) |
889 |
calo1_obj = new CaloLevel1(); |
890 |
return &calo1_obj; |
891 |
}; |
892 |
if (!objname.CompareTo("CaloLevel2")) { |
893 |
if (!calo2_obj) { |
894 |
calo2_obj = new CaloLevel2(); |
895 |
calo2_obj->Set(); |
896 |
}; |
897 |
return &calo2_obj; |
898 |
}; |
899 |
if (!objname.CompareTo("ToFLevel2")) { |
900 |
if (!tof_obj) { |
901 |
tof_obj = new ToFLevel2(); |
902 |
tof_obj->Set(); |
903 |
} |
904 |
return &tof_obj; |
905 |
}; |
906 |
if (!objname.CompareTo("TrigLevel2")) { |
907 |
if (!trig_obj) |
908 |
trig_obj = new TrigLevel2(); |
909 |
return &trig_obj; |
910 |
}; |
911 |
if (!objname.CompareTo("S4Level2")) { |
912 |
if (!s4_obj) |
913 |
s4_obj = new S4Level2(); |
914 |
return &s4_obj; |
915 |
}; |
916 |
if (!objname.CompareTo("NDLevel2")) { |
917 |
if (!nd_obj) |
918 |
nd_obj = new NDLevel2(); |
919 |
return &nd_obj; |
920 |
}; |
921 |
if (!objname.CompareTo("AcLevel2")) { |
922 |
if (!ac_obj) |
923 |
ac_obj = new AcLevel2(); |
924 |
return &ac_obj; |
925 |
}; |
926 |
if (!objname.CompareTo("OrbitalInfo")) { |
927 |
if (!orb_obj) { |
928 |
orb_obj = new OrbitalInfo(); |
929 |
orb_obj->Set(); |
930 |
} |
931 |
return &orb_obj; |
932 |
}; |
933 |
// if(!objname.CompareTo("OrbitalInfo")){ |
934 |
// if(!orb_obj) orb_obj = new OrbitalInfo(); |
935 |
// return &orb_obj; |
936 |
// }; |
937 |
if (!objname.CompareTo("GPamela")) { |
938 |
if (!gp_obj) |
939 |
gp_obj = new GPamela(); |
940 |
return &gp_obj; |
941 |
}; |
942 |
|
943 |
if (!objname.CompareTo("RunInfo")) |
944 |
return &run_obj; |
945 |
|
946 |
if (!objname.CompareTo("SoftInfo")) |
947 |
return &soft_obj; // Emiliano |
948 |
|
949 |
return NULL; |
950 |
} |
951 |
; |
952 |
//-------------------------------------- |
953 |
// |
954 |
// |
955 |
//-------------------------------------- |
956 |
/** |
957 |
* Retrieves the calorimeter track matching the seqno-th tracker stored track. |
958 |
* (If seqno = -1 retrieves the self-trigger calorimeter track) |
959 |
*/ |
960 |
CaloTrkVar *PamLevel2::GetCaloStoredTrack(int seqno) { |
961 |
|
962 |
if (!calo2_obj) |
963 |
return 0; |
964 |
|
965 |
if (calo2_obj->CaloLevel2::ntrk() == 0) { |
966 |
cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo " << seqno |
967 |
<< " but no Calorimeter tracks are stored" << endl; |
968 |
return NULL; |
969 |
}; |
970 |
|
971 |
CaloTrkVar *c = 0; |
972 |
Int_t it_calo = 0; |
973 |
|
974 |
do { |
975 |
c = calo2_obj->CaloLevel2::GetCaloTrkVar(it_calo); |
976 |
it_calo++; |
977 |
} while (c && seqno != c->trkseqno && it_calo < calo2_obj->CaloLevel2::ntrk()); |
978 |
|
979 |
if (!c || seqno != c->trkseqno) { |
980 |
c = 0; |
981 |
if (seqno != -1) |
982 |
cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo " << seqno |
983 |
<< " does not match Calorimeter stored tracks" << endl; |
984 |
}; |
985 |
return c; |
986 |
|
987 |
} |
988 |
; |
989 |
//-------------------------------------- |
990 |
// |
991 |
// |
992 |
//-------------------------------------- |
993 |
/** |
994 |
* Retrieves the ToF track matching the seqno-th tracker stored track. |
995 |
* (If seqno = -1 retrieves the tracker-independent tof track) |
996 |
*/ |
997 |
ToFTrkVar *PamLevel2::GetToFStoredTrack(int seqno) { |
998 |
|
999 |
if (!tof_obj) |
1000 |
return 0; |
1001 |
|
1002 |
if (tof_obj->ToFLevel2::ntrk() == 0) { |
1003 |
cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo " << seqno << " but no ToF tracks are stored" |
1004 |
<< endl; |
1005 |
return NULL; |
1006 |
}; |
1007 |
|
1008 |
ToFTrkVar *c = 0; |
1009 |
Int_t it_tof = 0; |
1010 |
|
1011 |
do { |
1012 |
c = tof_obj->ToFLevel2::GetToFTrkVar(it_tof); |
1013 |
it_tof++; |
1014 |
} while (c && seqno != c->trkseqno && it_tof < tof_obj->ToFLevel2::ntrk()); |
1015 |
|
1016 |
if (!c || seqno != c->trkseqno) { |
1017 |
c = 0; |
1018 |
if (seqno != -1) |
1019 |
cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo " << seqno |
1020 |
<< " does not match ToF stored tracks" << endl; |
1021 |
}; |
1022 |
return c; |
1023 |
|
1024 |
} |
1025 |
; |
1026 |
|
1027 |
//-------------------------------------- |
1028 |
// |
1029 |
// |
1030 |
//-------------------------------------- |
1031 |
/** |
1032 |
* Retrieves the OrbitalInfo track matching the seqno-th tracker stored track. |
1033 |
* (If seqno = -1 retrieves the tracker-independent tof related track) |
1034 |
*/ |
1035 |
OrbitalInfoTrkVar *PamLevel2::GetOrbitalInfoStoredTrack(int seqno) { |
1036 |
|
1037 |
if (!orb_obj) |
1038 |
return 0; |
1039 |
|
1040 |
if (orb_obj->OrbitalInfo::ntrk() == 0) { |
1041 |
// // TRICK BEGIN |
1042 |
// OrbitalInfoTrkVar *r = new OrbitalInfoTrkVar(); // TEMPORARY TRICK |
1043 |
// Int_t nn = 0; |
1044 |
// TClonesArray &tor = *orb_obj->OrbitalInfoTrk; |
1045 |
// for(Int_t nt=0; nt < tof_obj->ToFLevel2::ntrk(); nt++){ |
1046 |
// // |
1047 |
// ToFTrkVar *ptt = tof_obj->ToFLevel2::GetToFTrkVar(nt); |
1048 |
// if ( ptt->trkseqno != -1 ){ |
1049 |
// // |
1050 |
// r->trkseqno = ptt->trkseqno; |
1051 |
// // |
1052 |
// r->Eij = 0; |
1053 |
// // |
1054 |
// r->Sij = 0; |
1055 |
// // |
1056 |
// r->pitch = -1000.; |
1057 |
// // |
1058 |
// r->cutoff = -1000.; |
1059 |
// // |
1060 |
// new(tor[nn]) OrbitalInfoTrkVar(*r); |
1061 |
// nn++; |
1062 |
// // |
1063 |
// r->Clear(); |
1064 |
// // |
1065 |
// }; |
1066 |
// }; |
1067 |
// delete r; |
1068 |
// OrbitalInfoTrkVar *c = 0; |
1069 |
// c = orb_obj->OrbitalInfo::GetOrbitalInfoTrkVar(0); |
1070 |
// return c; |
1071 |
// //TRICK END |
1072 |
cout << "PamLevel2::GetOrbitalInfoStoredTrack(int) : requested tracker SeqNo " << seqno |
1073 |
<< " but no OrbitalInfo tracks are stored" << endl; |
1074 |
return NULL; |
1075 |
}; |
1076 |
|
1077 |
OrbitalInfoTrkVar *c = 0; |
1078 |
Int_t it_tof = 0; |
1079 |
|
1080 |
do { |
1081 |
c = orb_obj->OrbitalInfo::GetOrbitalInfoTrkVar(it_tof); |
1082 |
it_tof++; |
1083 |
} while (c && seqno != c->trkseqno && it_tof < orb_obj->OrbitalInfo::ntrk()); |
1084 |
|
1085 |
if (!c || seqno != c->trkseqno) { |
1086 |
c = 0; |
1087 |
if (seqno != -1) |
1088 |
cout << "PamLevel2::GetOrbitalInfoStoredTrack(int) : requested tracker SeqNo " << seqno |
1089 |
<< " does not match OrbitalInfo stored tracks" << endl; |
1090 |
}; |
1091 |
return c; |
1092 |
|
1093 |
} |
1094 |
; |
1095 |
|
1096 |
//-------------------------------------- |
1097 |
// |
1098 |
// |
1099 |
//-------------------------------------- |
1100 |
/** |
1101 |
* Give the pamela track associated to a tracker track, retrieving related calorimeter, orbitalinfo and tof track information. |
1102 |
*/ |
1103 |
PamTrack* PamLevel2::GetPamTrackAlong(TrkTrack* t) { |
1104 |
|
1105 |
cout << "PamLevel2::GetPamTrackAlong(TrkTrack* t) **obsolete** " << endl; |
1106 |
cout << "(if you use it, remember to delete the PamTrack object)" << endl; |
1107 |
|
1108 |
CaloTrkVar *c = 0; |
1109 |
ToFTrkVar *o = 0; |
1110 |
OrbitalInfoTrkVar *r = 0; |
1111 |
|
1112 |
if (CAL2) |
1113 |
c = GetCaloStoredTrack(t->GetSeqNo()); |
1114 |
if (TOF) |
1115 |
o = GetToFStoredTrack(t->GetSeqNo()); |
1116 |
if (ORB) |
1117 |
r = GetOrbitalInfoStoredTrack(t->GetSeqNo()); |
1118 |
|
1119 |
// if(t && c && o)track = new PamTrack(t,c,o); |
1120 |
PamTrack *track = new PamTrack(t, c, o, r); |
1121 |
|
1122 |
return track; |
1123 |
|
1124 |
} |
1125 |
; |
1126 |
//-------------------------------------- |
1127 |
// |
1128 |
// |
1129 |
//-------------------------------------- |
1130 |
/** |
1131 |
* Retrieves the it-th stored track. |
1132 |
* It override TrkLevel2::GetTrack(int it). |
1133 |
* @param itrk Track number, ranging from 0 to GetNTracks(). |
1134 |
*/ |
1135 |
|
1136 |
PamTrack* PamLevel2::GetStoredTrack(Int_t itrk) { |
1137 |
|
1138 |
cout << "PamLevel2::GetStoredTrack(Int_t itrk) **to-be-updated** " << endl; |
1139 |
cout |
1140 |
<< "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)" |
1141 |
<< endl; |
1142 |
cout << "(if you use it, remember to delete the PamTrack object)" << endl; |
1143 |
PamTrack *track = 0; |
1144 |
|
1145 |
if (itrk >= 0 && itrk < trk2_obj->TrkLevel2::ntrk()) { |
1146 |
|
1147 |
TrkTrack *t = trk2_obj->TrkLevel2::GetStoredTrack(itrk); |
1148 |
track = GetPamTrackAlong(t); |
1149 |
|
1150 |
} |
1151 |
else { |
1152 |
cout << "PamLevel2::GetStoredTrack(int) : tracker track SeqNo " << itrk << " does not exist (GetNTracks() = " |
1153 |
<< trk2_obj->TrkLevel2::GetNTracks() << ")" << endl; |
1154 |
}; |
1155 |
|
1156 |
return track; |
1157 |
|
1158 |
} |
1159 |
//-------------------------------------- |
1160 |
// |
1161 |
|
1162 |
/** |
1163 |
* Sort physical (tracker) tracks. Left here as backward compatibility method. |
1164 |
**/ |
1165 |
void PamLevel2::SortTracks(TString how) { |
1166 |
printf( |
1167 |
" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n", |
1168 |
how.Data()); |
1169 |
howtosort = how; |
1170 |
SortTracks(); |
1171 |
} |
1172 |
; |
1173 |
|
1174 |
// |
1175 |
//-------------------------------------- |
1176 |
/** |
1177 |
* Sort physical (tracker) tracks. |
1178 |
* @param how String to set the sorting cryterium (es: "CAL" or "TRK+CAL+TOF" ecc...). |
1179 |
* Sorting cryteria: |
1180 |
* TRK: lower chi**2 |
1181 |
* CAL: lower Y spatial residual on the first calorimeter plane |
1182 |
* TOF: bigger numebr of hit PMTs along the track, on S12 S21 S32 (where paddles are along the Y axis). |
1183 |
* S1: (ask Emiliano) |
1184 |
* S2: (ask Emiliano) |
1185 |
* S3: (ask Emiliano) |
1186 |
* GP: more GP hits |
1187 |
* The default sorting cryterium is "TOF+CAL". |
1188 |
* |
1189 |
* 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). |
1190 |
*/ |
1191 |
void PamLevel2::SortTracks() { |
1192 |
|
1193 |
//Check if the current event has already been sorted |
1194 |
if (issorted && lastsorted == GetReadEntry()) { |
1195 |
return; |
1196 |
} |
1197 |
//Reset the sort flags, just in case something will go wrong... |
1198 |
issorted = false; |
1199 |
lastsorted = -1; |
1200 |
|
1201 |
TString how = howtosort; |
1202 |
|
1203 |
// cout <<" PamLevel2::SortTracks(TString how) "<<endl; |
1204 |
if (!trk2_obj) { |
1205 |
cout << "void PamLevel2::SortTracks(): TrkLevel2 not loaded !!!"; |
1206 |
return; |
1207 |
}; |
1208 |
//Save current Object count |
1209 |
Int_t ObjectNumber = TProcessID::GetObjectCount(); |
1210 |
|
1211 |
// create TCloneArrays to store tracks and its images |
1212 |
if (!tsorted) |
1213 |
tsorted = new TClonesArray("PamTrack", trk2_obj->GetNTracks()); |
1214 |
tsorted->Delete(); |
1215 |
TClonesArray &ttsorted = *tsorted; |
1216 |
|
1217 |
if (!timage) |
1218 |
timage = new TClonesArray("PamTrack", trk2_obj->GetNTracks()); |
1219 |
timage->Delete(); |
1220 |
TClonesArray &ttimage = *timage; |
1221 |
|
1222 |
//-------------------------------------------------- |
1223 |
// retrieve sorting method |
1224 |
//-------------------------------------------------- |
1225 |
Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase); |
1226 |
Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase); |
1227 |
Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase); |
1228 |
Bool_t use_S1 = how.Contains("S1", TString::kIgnoreCase); |
1229 |
Bool_t use_S2 = how.Contains("S2", TString::kIgnoreCase); |
1230 |
Bool_t use_S3 = how.Contains("S3", TString::kIgnoreCase); |
1231 |
Bool_t use_GP = how.Contains("GP", TString::kIgnoreCase); |
1232 |
|
1233 |
if (use_TOF) { |
1234 |
use_S1 = true; |
1235 |
use_S2 = true; |
1236 |
use_S3 = true; |
1237 |
}; |
1238 |
if (!CAL2 && use_CAL) |
1239 |
use_CAL = false; |
1240 |
if (!TOF) { |
1241 |
use_TOF = false; |
1242 |
use_S1 = false; |
1243 |
use_S2 = false; |
1244 |
use_S3 = false; |
1245 |
} |
1246 |
if (!GP) { |
1247 |
use_GP = false; |
1248 |
} |
1249 |
|
1250 |
if (!TRK2) { |
1251 |
cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl; |
1252 |
return; |
1253 |
}; |
1254 |
|
1255 |
// cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl; |
1256 |
|
1257 |
|
1258 |
//-------------------------------------------------- |
1259 |
// loop over "physical" tracks sorted by the tracker |
1260 |
//-------------------------------------------------- |
1261 |
for (Int_t i = 0; i < trk2_obj->TrkLevel2::GetNTracks(); i++) { |
1262 |
|
1263 |
TrkTrack *ts = 0; |
1264 |
CaloTrkVar *cs = 0; |
1265 |
ToFTrkVar *os = 0; |
1266 |
OrbitalInfoTrkVar *rs = 0; |
1267 |
|
1268 |
// get tracker tracks |
1269 |
TrkTrack *tp = trk2_obj->TrkLevel2::GetTrack(i); //tracker |
1270 |
CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo()); |
1271 |
ToFTrkVar *op = GetToFStoredTrack(tp->GetSeqNo()); |
1272 |
OrbitalInfoTrkVar *rp = GetOrbitalInfoStoredTrack(tp->GetSeqNo()); |
1273 |
|
1274 |
TrkTrack *ti = 0; //tracker (image) |
1275 |
CaloTrkVar *ci = 0; |
1276 |
ToFTrkVar *oi = 0; |
1277 |
OrbitalInfoTrkVar *ri = 0; |
1278 |
// cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl; |
1279 |
// if track has an image, check image selection |
1280 |
|
1281 |
Int_t tp_score = 0; //main track sorted by the tracker |
1282 |
Int_t ti_score = 0; //image track |
1283 |
Int_t totp_score = 0; //main track sorted by the tracker |
1284 |
Int_t toti_score = 0; //image track |
1285 |
|
1286 |
if (tp->HasImage()) { |
1287 |
|
1288 |
ti = trk2_obj->TrkLevel2::GetTrackImage(i); //tracker (image) |
1289 |
ci = GetCaloStoredTrack(ti->GetSeqNo()); |
1290 |
oi = GetToFStoredTrack(ti->GetSeqNo()); |
1291 |
ri = GetOrbitalInfoStoredTrack(ti->GetSeqNo()); |
1292 |
|
1293 |
// cout << "its image "<<i << " "<<hex<< ti <<dec<< endl; |
1294 |
|
1295 |
//assign starting scores |
1296 |
tp_score = 0; //main track sorted by the tracker |
1297 |
ti_score = 0; //image track |
1298 |
|
1299 |
// ----------------------------------------------------------------------------------------- |
1300 |
// ***************************************************************************************** |
1301 |
// ----------------------------------------------------------------------------------------- |
1302 |
// calorimeter check |
1303 |
// ----------------------------------------------------------------------------------------- |
1304 |
if (use_CAL && !calo2_obj) { |
1305 |
cout << "void PamLevel2::SortTracks(): howtosort= " << how << " but CaloLevel2 not loaded !!!"; |
1306 |
return; |
1307 |
}; |
1308 |
if (use_CAL && !cp && ci) { |
1309 |
ti_score++; |
1310 |
toti_score++; |
1311 |
}; |
1312 |
if (use_CAL && cp && !ci) { |
1313 |
tp_score++; |
1314 |
totp_score++; |
1315 |
}; |
1316 |
if (use_CAL && cp && ci && true) { |
1317 |
|
1318 |
if (cp->npresh > ci->npresh && true) { |
1319 |
tp_score++; |
1320 |
totp_score++; |
1321 |
}; |
1322 |
if (cp->npresh < ci->npresh && true) { |
1323 |
ti_score++; |
1324 |
toti_score++; |
1325 |
}; |
1326 |
|
1327 |
// cout << "CALO "<<tp_score<<ti_score<<endl; |
1328 |
|
1329 |
}; |
1330 |
// ----------------------------------------------------------------------------------------- |
1331 |
// ***************************************************************************************** |
1332 |
// ----------------------------------------------------------------------------------------- |
1333 |
// TOF check |
1334 |
// ----------------------------------------------------------------------------------------- |
1335 |
// check the number of hit pmts along the track |
1336 |
// on S12 S21 and S32, where paddles are parallel to Y axis |
1337 |
if ((use_TOF || use_S1 || use_S2 || use_S3) && !tof_obj) { |
1338 |
cout << "void PamLevel2::SortTracks(): howtosort= " << how << " but ToFLevel2 not loaded !!!"; |
1339 |
return; |
1340 |
}; |
1341 |
// |
1342 |
if ((use_TOF || use_S1 || use_S2 || use_S3) && !op && oi) { |
1343 |
ti_score++; |
1344 |
toti_score++; |
1345 |
}; |
1346 |
if ((use_TOF || use_S1 || use_S2 || use_S3) && op && !oi) { |
1347 |
tp_score++; |
1348 |
totp_score++; |
1349 |
}; |
1350 |
if ((use_TOF || use_S1 || use_S2 || use_S3) && op && oi) { |
1351 |
// |
1352 |
Float_t sen = 0.; |
1353 |
for (Int_t ih = 0; ih < op->npmtadc; ih++) { |
1354 |
Int_t pl = tof_obj->GetPlaneIndex((op->pmtadc).At(ih)); |
1355 |
if (pl == 2 || pl == 3 || pl == 4 || pl == 5) |
1356 |
sen += (op->dedx).At(ih); |
1357 |
}; |
1358 |
for (Int_t ih = 0; ih < oi->npmtadc; ih++) { |
1359 |
Int_t pl = tof_obj->GetPlaneIndex((oi->pmtadc).At(ih)); |
1360 |
if (pl == 2 || pl == 3 || pl == 4 || pl == 5) |
1361 |
sen += (oi->dedx).At(ih); |
1362 |
}; |
1363 |
// |
1364 |
if (sen >= sortthr && false) { // temporary disabled NUCLEI special algorithm since the new one should work for every particle (to be checked!) |
1365 |
//printf(" IS A NUCLEUS! en = %f \n",sen); |
1366 |
// |
1367 |
// is a nucleus use a different algorithm |
1368 |
// |
1369 |
Int_t nz = 6; |
1370 |
Float_t zin[6]; // << define TOF z-coordinates |
1371 |
for (Int_t ip = 0; ip < nz; ip++) |
1372 |
zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip)); // << read ToF plane z-coordinates |
1373 |
Trajectory *tr = new Trajectory(nz, zin); |
1374 |
// |
1375 |
Int_t nphit_p = 0; |
1376 |
Int_t nphit_i = 0; |
1377 |
Float_t enhit_p = 0.; |
1378 |
Float_t enhit_i = 0.; |
1379 |
// |
1380 |
for (Int_t ih = 0; ih < op->npmtadc; ih++) { |
1381 |
Int_t pl = tof_obj->GetPlaneIndex((op->pmtadc).At(ih)); |
1382 |
if (pl == 1 || pl == 2 || pl == 5) { |
1383 |
nphit_p++; |
1384 |
enhit_p += (op->dedx).At(ih); |
1385 |
}; |
1386 |
}; |
1387 |
// |
1388 |
tp->DoTrack2(tr); |
1389 |
// |
1390 |
if (fabs(tr->y[0] - oi->ytofpos[0]) < 2.) { |
1391 |
for (Int_t ih = 0; ih < op->npmtadc; ih++) { |
1392 |
Int_t pl = tof_obj->GetPlaneIndex((op->pmtadc).At(ih)); |
1393 |
if (pl == 0) { |
1394 |
nphit_p++; |
1395 |
enhit_p += (op->dedx).At(ih); |
1396 |
}; |
1397 |
}; |
1398 |
}; |
1399 |
if (fabs(tr->y[3] - oi->ytofpos[1]) < 2.) { |
1400 |
for (Int_t ih = 0; ih < op->npmtadc; ih++) { |
1401 |
Int_t pl = tof_obj->GetPlaneIndex((op->pmtadc).At(ih)); |
1402 |
if (pl == 3) { |
1403 |
nphit_p++; |
1404 |
enhit_p += (op->dedx).At(ih); |
1405 |
}; |
1406 |
}; |
1407 |
}; |
1408 |
if (fabs(tr->y[4] - oi->ytofpos[2]) < 2.) { |
1409 |
for (Int_t ih = 0; ih < op->npmtadc; ih++) { |
1410 |
Int_t pl = tof_obj->GetPlaneIndex((op->pmtadc).At(ih)); |
1411 |
if (pl == 4) { |
1412 |
nphit_p++; |
1413 |
enhit_p += (op->dedx).At(ih); |
1414 |
}; |
1415 |
}; |
1416 |
}; |
1417 |
|
1418 |
for (Int_t ih = 0; ih < oi->npmtadc; ih++) { |
1419 |
Int_t pl = tof_obj->GetPlaneIndex((oi->pmtadc).At(ih)); |
1420 |
if (pl == 1 || pl == 2 || pl == 5) { |
1421 |
nphit_i++; |
1422 |
enhit_i += (op->dedx).At(ih); |
1423 |
}; |
1424 |
}; |
1425 |
// |
1426 |
ti->DoTrack2(tr); |
1427 |
// |
1428 |
if (fabs(tr->y[0] - oi->ytofpos[0]) < 2.) { |
1429 |
for (Int_t ih = 0; ih < oi->npmtadc; ih++) { |
1430 |
Int_t pl = tof_obj->GetPlaneIndex((oi->pmtadc).At(ih)); |
1431 |
if (pl == 0) { |
1432 |
nphit_i++; |
1433 |
enhit_i += (op->dedx).At(ih); |
1434 |
}; |
1435 |
}; |
1436 |
}; |
1437 |
if (fabs(tr->y[3] - oi->ytofpos[1]) < 2.) { |
1438 |
for (Int_t ih = 0; ih < oi->npmtadc; ih++) { |
1439 |
Int_t pl = tof_obj->GetPlaneIndex((oi->pmtadc).At(ih)); |
1440 |
if (pl == 3) { |
1441 |
nphit_i++; |
1442 |
enhit_i += (op->dedx).At(ih); |
1443 |
}; |
1444 |
}; |
1445 |
}; |
1446 |
if (fabs(tr->y[4] - oi->ytofpos[2]) < 2.) { |
1447 |
for (Int_t ih = 0; ih < oi->npmtadc; ih++) { |
1448 |
Int_t pl = tof_obj->GetPlaneIndex((oi->pmtadc).At(ih)); |
1449 |
if (pl == 4) { |
1450 |
nphit_i++; |
1451 |
enhit_i += (op->dedx).At(ih); |
1452 |
}; |
1453 |
}; |
1454 |
}; |
1455 |
|
1456 |
if ((use_TOF || use_S1 || use_S2 || use_S3) && (nphit_p + nphit_i) != 0 && true) { |
1457 |
|
1458 |
// 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); |
1459 |
// printf(" score p %i score i %i \n",tp_score,ti_score); |
1460 |
// if( enhit_p > enhit_i ) tp_score++; |
1461 |
// if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++; |
1462 |
if (nphit_p > nphit_i) |
1463 |
tp_score++; |
1464 |
if (nphit_p < nphit_i) |
1465 |
ti_score++; |
1466 |
if (nphit_p == nphit_i) { |
1467 |
if (enhit_p > enhit_i) |
1468 |
tp_score++; |
1469 |
else |
1470 |
ti_score++; |
1471 |
}; |
1472 |
// printf(" dopo score p %i score i %i \n",tp_score,ti_score); |
1473 |
}; |
1474 |
delete tr; |
1475 |
// |
1476 |
} |
1477 |
else { |
1478 |
// ------------- |
1479 |
// NOT a NUCLEUS |
1480 |
// ------------- |
1481 |
//printf(" NOT a NUCLEUS! en = %f \n",sen); |
1482 |
|
1483 |
Int_t nphit_p = 0; |
1484 |
Int_t nphit_i = 0; |
1485 |
|
1486 |
/* cout << "track: npmtadc "<< op->npmtadc << endl; |
1487 |
cout << "track: npmttdc "<< op->npmttdc << endl; |
1488 |
cout << "image: npmtadc "<< oi->npmtadc << endl; |
1489 |
cout << "image: npmttdc "<< oi->npmttdc << endl;*/ |
1490 |
|
1491 |
// for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1492 |
// Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1493 |
// if(pl == 1 || pl == 2 || pl == 5)nphit_p++; |
1494 |
// }; |
1495 |
|
1496 |
// for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1497 |
// Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1498 |
// if(pl == 1 || pl == 2 || pl == 5)nphit_i++; |
1499 |
// }; |
1500 |
// --- modified to count tdc signals (more efficient?) |
1501 |
// --- and to implement check on tdcflag |
1502 |
for (Int_t ih = 0; ih < op->npmttdc; ih++) { |
1503 |
Int_t pl = tof_obj->GetPlaneIndex((op->pmttdc).At(ih)); |
1504 |
// if( (op->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_p++; |
1505 |
if ((use_S1 && (pl == 0 || pl == 1)) || (use_S2 && (pl == 2 || pl == 3)) |
1506 |
|| (use_S3 && (pl == 4 || pl == 5))) { |
1507 |
if ((op->tdcflag).At(ih) == 0) |
1508 |
nphit_p++; |
1509 |
}; |
1510 |
}; |
1511 |
|
1512 |
for (Int_t ih = 0; ih < oi->npmttdc; ih++) { |
1513 |
Int_t pl = tof_obj->GetPlaneIndex((oi->pmttdc).At(ih)); |
1514 |
// if( (oi->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_i++; |
1515 |
if ((use_S1 && (pl == 0 || pl == 1)) || (use_S2 && (pl == 2 || pl == 3)) |
1516 |
|| (use_S3 && (pl == 4 || pl == 5))) { |
1517 |
if ((oi->tdcflag).At(ih) == 0) |
1518 |
nphit_i++; |
1519 |
}; |
1520 |
}; |
1521 |
|
1522 |
if ((nphit_p + nphit_i) != 0 && true) { |
1523 |
|
1524 |
if (nphit_p != nphit_i) { |
1525 |
totp_score += nphit_p; |
1526 |
toti_score += nphit_i; |
1527 |
tp_score += nphit_p; |
1528 |
ti_score += nphit_i; |
1529 |
}; |
1530 |
// if ( nphit_p > nphit_i) tp_score+=nphit_p; |
1531 |
// else if( nphit_p < nphit_i) ti_score+=nphit_i; |
1532 |
// else ;//niente |
1533 |
}; |
1534 |
}; |
1535 |
// cout << "TOF "<<tp_score<<ti_score<<endl; |
1536 |
}; |
1537 |
|
1538 |
// if(tp_score == ti_score) use_TRK = true; |
1539 |
|
1540 |
|
1541 |
// ----------------------------------------------------------------------------------------- |
1542 |
// ***************************************************************************************** |
1543 |
// ----------------------------------------------------------------------------------------- |
1544 |
// tracker check |
1545 |
// ----------------------------------------------------------------------------------------- |
1546 |
// chi**2 difference is not always large enough to distinguish among |
1547 |
// the real track and its image. |
1548 |
// Tracker check will be applied always when calorimeter and tof information is ambiguous. |
1549 |
// *** MODIFIED ON AUGUST 2007 *** |
1550 |
if (use_TRK) { |
1551 |
// if( tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ; |
1552 |
// else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ; |
1553 |
|
1554 |
// CHECK 1 : number of points along X |
1555 |
if (tp->GetNX() >= ti->GetNX()) { |
1556 |
tp_score++; |
1557 |
totp_score++; |
1558 |
}; |
1559 |
if (tp->GetNX() <= ti->GetNX()) { |
1560 |
ti_score++; |
1561 |
toti_score++; |
1562 |
}; |
1563 |
// CHECK 2 : number of points along Y |
1564 |
if (tp->GetNY() >= ti->GetNY()) { |
1565 |
tp_score++; |
1566 |
totp_score++; |
1567 |
}; |
1568 |
if (tp->GetNY() <= ti->GetNY()) { |
1569 |
ti_score++; |
1570 |
toti_score++; |
1571 |
}; |
1572 |
|
1573 |
// cout << "TRK "<<tp_score<<ti_score<<endl; |
1574 |
}; |
1575 |
|
1576 |
// ----------------------------------------------------------------------------------------- |
1577 |
// ***************************************************************************************** |
1578 |
// ----------------------------------------------------------------------------------------- |
1579 |
// GPamela check |
1580 |
// ----------------------------------------------------------------------------------------- |
1581 |
|
1582 |
//--------------------------------------------------- |
1583 |
// count the number of GP hits |
1584 |
//--------------------------------------------------- |
1585 |
if (use_GP) { |
1586 |
int ngphits_p = 0; |
1587 |
int ngphits_i = 0; |
1588 |
float toll = 0.02; //200 micron |
1589 |
for (int ih = 0; ih < GetGPamela()->Nthspe; ih++) { |
1590 |
int ip = (Int_t) GetGPamela()->Itrpb[ih] - 1; |
1591 |
if (tp && tp->YGood(ip) && fabs(tp->ym[ip] - GetGPamela()->Yavspe[ih]) < toll && true) |
1592 |
ngphits_p++; |
1593 |
if (ti && ti->YGood(ip) && fabs(ti->ym[ip] - GetGPamela()->Yavspe[ih]) < toll && true) |
1594 |
ngphits_i++; |
1595 |
} |
1596 |
if (ngphits_p > ngphits_i && true) { |
1597 |
tp_score++; |
1598 |
totp_score++; |
1599 |
} |
1600 |
if (ngphits_p < ngphits_i && true) { |
1601 |
ti_score++; |
1602 |
toti_score++; |
1603 |
} |
1604 |
} |
1605 |
|
1606 |
// *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* |
1607 |
// the winner is.... |
1608 |
// *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* |
1609 |
if (tp_score > ti_score) { |
1610 |
|
1611 |
} |
1612 |
else if (tp_score < ti_score) { |
1613 |
|
1614 |
ts = ti;//its image!! |
1615 |
cs = ci; |
1616 |
os = oi; |
1617 |
rs = ri; |
1618 |
Int_t totis = toti_score; |
1619 |
|
1620 |
ti = tp;//its image!! |
1621 |
ci = cp; |
1622 |
oi = op; |
1623 |
ri = rp; |
1624 |
|
1625 |
tp = ts;//its image!! |
1626 |
cp = cs; |
1627 |
op = os; |
1628 |
rp = rs; |
1629 |
|
1630 |
toti_score = totp_score; |
1631 |
totp_score = totis; |
1632 |
|
1633 |
} |
1634 |
else { |
1635 |
|
1636 |
// cout << "Warning - track image ambiguity not solved" << endl; |
1637 |
|
1638 |
}; |
1639 |
|
1640 |
} |
1641 |
else { |
1642 |
totp_score = 1; |
1643 |
toti_score = 0; |
1644 |
|
1645 |
// ts = tp; |
1646 |
// cs = cp; |
1647 |
// os = op; |
1648 |
}; |
1649 |
|
1650 |
// cout <<" SortTracks() "<<i<<" -- "<<ts<<endl; |
1651 |
// sorted_tracks->Add(ts);//save the track in the sorted array |
1652 |
// sorted_tracks.Add(ts);//save the track in the sorted array |
1653 |
// sorted_tracks.Add(tp);//save the track in the sorted array |
1654 |
// cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl; |
1655 |
// cout<<"o "<<tp<<endl; |
1656 |
// cout<<"o "<<cp<<endl; |
1657 |
// cout<<"o "<<op<<endl; |
1658 |
|
1659 |
new (ttsorted[i]) PamTrack(tp, cp, op, rp); |
1660 |
new (ttimage[i]) PamTrack(ti, ci, oi, ri); |
1661 |
|
1662 |
((PamTrack*) (ttsorted[i]))->SetPScore(totp_score); |
1663 |
((PamTrack*) (ttsorted[i]))->SetIScore(toti_score); |
1664 |
((PamTrack*) (ttimage[i]))->SetPScore(totp_score); |
1665 |
((PamTrack*) (ttimage[i]))->SetIScore(toti_score); |
1666 |
}; |
1667 |
|
1668 |
if (tsorted->GetEntries() != trk2_obj->GetNTracks()) { |
1669 |
cout << "void PamLevel2::SortTracks(): tsorted->GetEntries() " << tsorted->GetEntries() |
1670 |
<< " != trk2_obj->GetNTracks() = " << trk2_obj->GetNTracks() << endl; |
1671 |
tsorted->Delete(); |
1672 |
tsorted = 0; |
1673 |
timage->Delete(); |
1674 |
timage = 0; |
1675 |
} |
1676 |
|
1677 |
//Restore Object count |
1678 |
//To save space in the table keeping track of all referenced objects |
1679 |
//We reset the object count to what it was at the beginning of the event. |
1680 |
TProcessID::SetObjectCount(ObjectNumber); |
1681 |
|
1682 |
//Everything went fine so the current event can be tagged as sorted |
1683 |
issorted = true; |
1684 |
lastsorted = GetReadEntry(); |
1685 |
|
1686 |
} |
1687 |
; |
1688 |
//-------------------------------------- |
1689 |
// |
1690 |
// |
1691 |
//-------------------------------------- |
1692 |
/** |
1693 |
* This method overrides TrkLevel2::GetTracks(), where sorting is done by decreasing number of fit points and increasing chi^2. |
1694 |
* PamLevel2::GetTracks() keeps the same track order given by TrkLevel2::GetTracks(), but checks image selection by using calorimeter and ToF tracking information. |
1695 |
*/ |
1696 |
// TRefArray *PamLevel2::GetTracks(){ |
1697 |
|
1698 |
// // *-*-*-*-*-*-*-*-*-*-*-*-* |
1699 |
// SortTracks("+CAL+TOF"); |
1700 |
// // *-*-*-*-*-*-*-*-*-*-*-*-* |
1701 |
|
1702 |
// // return sorted_tracks; |
1703 |
// return &sorted_tracks; |
1704 |
|
1705 |
// }; |
1706 |
TClonesArray *PamLevel2::GetTracks() { |
1707 |
|
1708 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1709 |
SortTracks(); |
1710 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1711 |
|
1712 |
return tsorted; |
1713 |
|
1714 |
} |
1715 |
; |
1716 |
//-------------------------------------- |
1717 |
// |
1718 |
// |
1719 |
//-------------------------------------- |
1720 |
/** |
1721 |
* Retrieves the it-th Pamela "physical" track. |
1722 |
* It override TrkLevel2::GetTrack(int it). |
1723 |
* @param it Track number, ranging from 0 to GetNTracks(). |
1724 |
*/ |
1725 |
PamTrack *PamLevel2::GetTrack(int it) { |
1726 |
|
1727 |
// if(!trk2_obj) return 0; |
1728 |
|
1729 |
// // *-*-*-*+-*-*-*-*-*-*-*-*-* |
1730 |
// SortTracks("+CAL+TOF"); |
1731 |
// // *-*-*-*-*-*-*-*-*-*-*-*-* |
1732 |
// // if(!sorted_tracks)return 0; |
1733 |
// if(sorted_tracks.IsEmpty())return 0; |
1734 |
|
1735 |
// PamTrack *track = 0; |
1736 |
|
1737 |
// if( it >=0 && it < trk2_obj->TrkLevel2::GetNTracks() && it<sorted_tracks.GetEntriesFast() ){ |
1738 |
// TrkTrack *t = (TrkTrack*)sorted_tracks.At(it); |
1739 |
// track = GetPamTrackAlong(t); |
1740 |
// }else{ |
1741 |
// cout << "PamLevel2::GetTrack(int) : tracker track SeqNo "<< it <<" does not exist (GetNTracks() = "<<trk2_obj->TrkLevel2::GetNTracks()<<")"<<endl; |
1742 |
// }; |
1743 |
|
1744 |
// return track; |
1745 |
|
1746 |
// cout << "PamLevel2::GetTrack(int it) "<<endl; |
1747 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1748 |
SortTracks(); |
1749 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1750 |
if (!tsorted) |
1751 |
return 0; |
1752 |
if (!tsorted->GetEntries()) |
1753 |
return 0; |
1754 |
|
1755 |
PamTrack *track = 0; |
1756 |
|
1757 |
if (it >= 0 && it < trk2_obj->TrkLevel2::GetNTracks()) { |
1758 |
// TrkTrack *t = (TrkTrack*)sorted_tracks.At(it); |
1759 |
// track = GetPamTrackAlong(t); |
1760 |
//TClonesArray &t = *(tsorted); |
1761 |
//track = (PamTrack*)t[it]; |
1762 |
track = (PamTrack*)((*tsorted)[it]); |
1763 |
} |
1764 |
else { |
1765 |
cout << "PamLevel2::GetTrack(int) : tracker track SeqNo " << it << " does not exist (GetNTracks() = " |
1766 |
<< trk2_obj->TrkLevel2::GetNTracks() << ")" << endl; |
1767 |
}; |
1768 |
|
1769 |
return track; |
1770 |
|
1771 |
} |
1772 |
; |
1773 |
|
1774 |
//-------------------------------------- |
1775 |
// |
1776 |
// |
1777 |
//-------------------------------------- |
1778 |
/** |
1779 |
* Retrieves (if present) the image of the it-th Pamela "physical" track, sorted by the method PamLevel2::SortTracks(). |
1780 |
* @param it Track number, ranging from 0 to GetNTracks(). |
1781 |
*/ |
1782 |
PamTrack *PamLevel2::GetTrackImage(int it) { |
1783 |
|
1784 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1785 |
SortTracks(); |
1786 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1787 |
if (!timage) |
1788 |
return 0; |
1789 |
if (!timage->GetEntries()) |
1790 |
return 0; |
1791 |
|
1792 |
PamTrack *image = 0; |
1793 |
|
1794 |
if (it >= 0 && it < trk2_obj->TrkLevel2::GetNTracks()) { |
1795 |
TClonesArray &t = *(tsorted); |
1796 |
PamTrack *temp = (PamTrack*) t[it]; |
1797 |
if (temp->GetTrkTrack()->HasImage()) { |
1798 |
TClonesArray & t = *(timage); |
1799 |
image = (PamTrack*) t[it]; |
1800 |
} |
1801 |
else { |
1802 |
// cout <<"PamLevel2::GetTrackImage(int) : Track SeqNo "<<it<<" does not have image"<<endl; |
1803 |
}; |
1804 |
} |
1805 |
else { |
1806 |
cout << "PamLevel2::GetTrackImage(int) : Tracker track SeqNo " << it << " does not exist (GetNTracks() = " |
1807 |
<< trk2_obj->TrkLevel2::GetNTracks() << ")" << endl; |
1808 |
}; |
1809 |
|
1810 |
return image; |
1811 |
} |
1812 |
|
1813 |
//-------------------------------------- |
1814 |
// |
1815 |
// |
1816 |
//-------------------------------------- |
1817 |
/** |
1818 |
* Get the Pamela detector trees in a single file and make them friends. |
1819 |
* @param f TFile pointer |
1820 |
* @param detlist String to select trees to be included |
1821 |
* @return Pointer to a TTree |
1822 |
*/ |
1823 |
TTree *PamLevel2::GetPamTree(TFile *f, TString detlist) { |
1824 |
|
1825 |
if (detlist.Contains("+AUTO", TString::kIgnoreCase)) { |
1826 |
cout << "+AUTO" << endl; |
1827 |
GetWhichTrees(f); |
1828 |
}; |
1829 |
SetWhichTrees(detlist); |
1830 |
|
1831 |
if (pam_tree) { |
1832 |
printf("WARNING: TTree *PamLevel2::GetPamTree(TFile *fl, TString detlist) -- pam_tree already exists!\n "); |
1833 |
return pam_tree; |
1834 |
}; |
1835 |
// |
1836 |
|
1837 |
cout << "TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ) -- obsolte " << endl; |
1838 |
|
1839 |
// SetWhichTrees(detlist); |
1840 |
|
1841 |
TTree *Trout = 0; |
1842 |
|
1843 |
TString fname = f->GetName(); |
1844 |
if (!CheckLevel2File(fname)) |
1845 |
return NULL; |
1846 |
|
1847 |
// UInt_t *found=0; |
1848 |
|
1849 |
cout << "GetPamTree(TFile*,TString): detector list --> "; |
1850 |
if (TRK1) |
1851 |
cout << "TRK1 "; |
1852 |
if (TRK2) |
1853 |
cout << "TRK2 "; |
1854 |
if (TRKh) |
1855 |
cout << "TRKH "; |
1856 |
if (CAL1) |
1857 |
cout << "CAL1 "; |
1858 |
if (CAL2) |
1859 |
cout << "CAL2 "; |
1860 |
if (TOF) |
1861 |
cout << "TOF "; |
1862 |
if (TRG) |
1863 |
cout << "TRG "; |
1864 |
if (AC) |
1865 |
cout << "AC "; |
1866 |
if (ND) |
1867 |
cout << "ND "; |
1868 |
if (S4) |
1869 |
cout << "S4 "; |
1870 |
if (ORB) |
1871 |
cout << "ORB "; |
1872 |
if (GP) |
1873 |
cout << "GP "; |
1874 |
cout << endl; |
1875 |
if (SELLI && SELLI != 2) |
1876 |
cout << ">>> Found selection-list <<<" << endl; //EMILIANO |
1877 |
|
1878 |
f->cd(); |
1879 |
|
1880 |
// Tracker |
1881 |
TTree *T = (TTree*) f->Get("Tracker"); |
1882 |
if (T && (TRK2 || TRK1 || TRKh)) { |
1883 |
if (TRK2) |
1884 |
T->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
1885 |
// else T->SetBranchStatus("TrkLevel2",0,found); |
1886 |
if (TRK2) |
1887 |
cout << "Tracker : set branch address TrkLevel2" << endl; |
1888 |
if (TRK1) |
1889 |
T->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
1890 |
// else T->SetBranchStatus("TrkLevel1",0,found); |
1891 |
if (TRK1) |
1892 |
cout << "Tracker : set branch address TrkLevel1" << endl; |
1893 |
if (TRKh) |
1894 |
T->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
1895 |
// else T->SetBranchStatus("TrkHough",0,found); |
1896 |
if (TRKh) |
1897 |
cout << "Tracker : set branch address TrkHough" << endl; |
1898 |
if (!Trout) |
1899 |
Trout = T; |
1900 |
else |
1901 |
Trout->AddFriend(T); |
1902 |
} |
1903 |
else { |
1904 |
cout << "Tracker : missing tree" << endl; |
1905 |
}; |
1906 |
// Calorimeter |
1907 |
TTree *C = (TTree*) f->Get("Calorimeter"); |
1908 |
if (C && (CAL2 || CAL1)) { |
1909 |
if (CAL2) |
1910 |
C->SetBranchAddress("CaloLevel2", GetPointerTo("CaloLevel2")); |
1911 |
// else C->SetBranchStatus("CaloLevel2",0,found); |
1912 |
if (CAL2) |
1913 |
cout << "Calorimeter : set branch address CaloLevel2" << endl; |
1914 |
if (CAL1) |
1915 |
C->SetBranchAddress("CaloLevel1", GetPointerTo("CaloLevel1")); |
1916 |
// else C->SetBranchStatus("CaloLevel1",0,found); |
1917 |
if (CAL1) |
1918 |
cout << "Calorimeter : set branch address CaloLevel1" << endl; |
1919 |
if (!Trout) |
1920 |
Trout = C; |
1921 |
else |
1922 |
Trout->AddFriend(C); |
1923 |
} |
1924 |
else { |
1925 |
cout << "Calorimeter : missing tree" << endl; |
1926 |
}; |
1927 |
|
1928 |
// ToF |
1929 |
TTree *O = (TTree*) f->Get("ToF"); |
1930 |
if (O && TOF) { |
1931 |
O->SetBranchAddress("ToFLevel2", GetPointerTo("ToFLevel2")); |
1932 |
cout << "ToF : set branch address ToFLevel2" << endl; |
1933 |
if (!Trout) |
1934 |
Trout = O; |
1935 |
else |
1936 |
Trout->AddFriend(O); |
1937 |
} |
1938 |
else { |
1939 |
cout << "ToF : missing tree" << endl; |
1940 |
}; |
1941 |
// Trigger |
1942 |
TTree *R = (TTree*) f->Get("Trigger"); |
1943 |
if (R && TRG) { |
1944 |
R->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2")); |
1945 |
cout << "Trigger : set branch address TrigLevel2" << endl; |
1946 |
if (!Trout) |
1947 |
Trout = R; |
1948 |
else |
1949 |
Trout->AddFriend(R); |
1950 |
} |
1951 |
else { |
1952 |
cout << "Trigger : missing tree" << endl; |
1953 |
}; |
1954 |
// S4 |
1955 |
TTree *S = (TTree*) f->Get("S4"); |
1956 |
if (S && S4) { |
1957 |
S->SetBranchAddress("S4Level2", GetPointerTo("S4Level2")); |
1958 |
cout << "S4 : set branch address S4Level2" << endl; |
1959 |
if (!Trout) |
1960 |
Trout = S; |
1961 |
else |
1962 |
Trout->AddFriend(S); |
1963 |
} |
1964 |
else { |
1965 |
cout << "S4 : missing tree" << endl; |
1966 |
}; |
1967 |
// Neutron Detector |
1968 |
TTree *N = (TTree*) f->Get("NeutronD"); |
1969 |
if (N && ND) { |
1970 |
N->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2")); |
1971 |
cout << "NeutronD : set branch address NDLevel2" << endl; |
1972 |
if (!Trout) |
1973 |
Trout = N; |
1974 |
else |
1975 |
Trout->AddFriend(N); |
1976 |
} |
1977 |
else { |
1978 |
cout << "NeutronD : missing tree" << endl; |
1979 |
}; |
1980 |
// Anticounters |
1981 |
TTree *A = (TTree*) f->Get("Anticounter"); |
1982 |
if (A && AC) { |
1983 |
A->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2")); |
1984 |
cout << "Anticounter : set branch address AcLevel2" << endl; |
1985 |
if (!Trout) |
1986 |
Trout = A; |
1987 |
else |
1988 |
Trout->AddFriend(A); |
1989 |
} |
1990 |
else { |
1991 |
cout << "Anticounter : missing tree" << endl; |
1992 |
}; |
1993 |
// Orbital Info |
1994 |
TTree *B = (TTree*) f->Get("OrbitalInfo"); |
1995 |
if (B && ORB) { |
1996 |
B->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
1997 |
cout << "OrbitalInfo : set branch address OrbitalInfo" << endl; |
1998 |
if (!Trout) |
1999 |
Trout = B; |
2000 |
else |
2001 |
Trout->AddFriend(B); |
2002 |
} |
2003 |
else { |
2004 |
cout << "OrbitalInfo : missing tree" << endl; |
2005 |
}; |
2006 |
|
2007 |
// GPamela |
2008 |
TTree *G = (TTree*) f->Get("h20"); |
2009 |
if (G && GP) { |
2010 |
if (!gp_obj) |
2011 |
gp_obj = new GPamela(); |
2012 |
// ------------------------------------ |
2013 |
// ATTENZIONE!!! |
2014 |
// non so per quale arcano motivo, |
2015 |
// per l'albero di gpamela il branch address lo devo settare |
2016 |
// DOPO aver fatto friend |
2017 |
// FGRRRVZZZZUTSALKJMSLKJ!!! |
2018 |
// ------------------------------------ |
2019 |
// gp_obj->SetBranchAddress(G); //ho dovuto fare in maniera diversa dagli altri |
2020 |
// cout << "h20 : set branch address GPamela "<<endl; |
2021 |
if (!Trout) |
2022 |
Trout = G; |
2023 |
else |
2024 |
Trout->AddFriend(G); |
2025 |
} |
2026 |
else { |
2027 |
// cout << "h20 : missing tree"<<endl; |
2028 |
}; |
2029 |
|
2030 |
TTree *L = (TTree*) f->Get("SelectionList"); |
2031 |
if (L && SELLI == 1) { |
2032 |
cout << " TTree *PamLevel2::GetPamTree(TFile, TString) >>> SelectionList not implemented!!!!" << endl; |
2033 |
sel_tree = 0; |
2034 |
} |
2035 |
else { |
2036 |
cout << "SelectionList : missing tree" << endl; |
2037 |
}; |
2038 |
|
2039 |
cout << endl << " Number of entries: " << Trout->GetEntries() << endl << endl; |
2040 |
|
2041 |
// ------------------------------------ |
2042 |
// ATTENZIONE!!! |
2043 |
// non so per quale arcano motivo, |
2044 |
// per l'albero di gpamela il branch address lo devo settare |
2045 |
// DOPO aver fatto friend |
2046 |
// FGRRRVZZZZUTSALKJMSLKJ!!! |
2047 |
// ------------------------------------ |
2048 |
if (G && GP) { |
2049 |
gp_obj->SetBranchAddress(Trout); //ho dovuto fare in maniera diversa dagli altri |
2050 |
cout << "h20 : set branch address GPamela " << endl; |
2051 |
} |
2052 |
else { |
2053 |
cout << "h20 : missing tree" << endl; |
2054 |
}; |
2055 |
|
2056 |
pam_tree = (TChain*) Trout; |
2057 |
|
2058 |
return Trout; |
2059 |
|
2060 |
} |
2061 |
//-------------------------------------- |
2062 |
// |
2063 |
// |
2064 |
//-------------------------------------- |
2065 |
/** |
2066 |
* Get list of Level2 files. |
2067 |
* @param ddir Level2 data directory. |
2068 |
* @param flisttxt Name of txt file containing file list. |
2069 |
* @return Pointer to a TList of TSystemFiles |
2070 |
* If no input file list is given , all the Level2 files inside the directory are processed. |
2071 |
*/ |
2072 |
TList* PamLevel2::GetListOfLevel2Files(TString ddir, TString flisttxt = "") { |
2073 |
|
2074 |
TString wdir = gSystem->WorkingDirectory(); |
2075 |
|
2076 |
if (ddir != "") { |
2077 |
cout << "Level2 data directory : " << ddir << endl; |
2078 |
} |
2079 |
else { |
2080 |
cout << "Level2 data directory not given as input: trying to evaluate from list or taking working directory " |
2081 |
<< endl; |
2082 |
}; |
2083 |
TList *contents = new TList; // create output list |
2084 |
contents->SetOwner(); |
2085 |
|
2086 |
// -------------------------------------- |
2087 |
// case 1 : input file/file-list provided |
2088 |
// -------------------------------------- |
2089 |
if (flisttxt != "") { |
2090 |
|
2091 |
// -------------------------------------- |
2092 |
// a list of files given as input |
2093 |
// -------------------------------------- |
2094 |
if (!flisttxt.EndsWith(".root")) { |
2095 |
|
2096 |
TString dir = gSystem->DirName(flisttxt); |
2097 |
// cout << " List directory "<<dir<<endl; |
2098 |
if (dir == "." || dir == "") |
2099 |
flisttxt = gSystem->ConcatFileName(wdir.Data(), gSystem->BaseName(flisttxt)); |
2100 |
// flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
2101 |
|
2102 |
if (!gSystem->ChangeDirectory(ddir)) { |
2103 |
cout << "Cannot change directory : " << ddir << endl; |
2104 |
return 0; |
2105 |
} |
2106 |
|
2107 |
cout << "Input file list : " << flisttxt << endl; |
2108 |
ifstream in; |
2109 |
in.open(flisttxt, ios::in); //open input file list |
2110 |
if (!in.good()) { |
2111 |
cout << " TList* PamLevel2::GetListOfLevel2Files(TString, TString) --> ERROR opening the file " << endl; |
2112 |
gSystem->ChangeDirectory(wdir); // back to the working directory |
2113 |
return 0; |
2114 |
} |
2115 |
int line = 0; |
2116 |
// ........................... |
2117 |
// loop over file-list records |
2118 |
// ........................... |
2119 |
while (1) { |
2120 |
TString file; |
2121 |
in >> file; |
2122 |
if (!in.good()) |
2123 |
break; |
2124 |
line++; |
2125 |
cout << "(*) " << file << endl; |
2126 |
if (file.IsNull()) { |
2127 |
cout << "-- list interrupted at line " << line << endl; |
2128 |
break; |
2129 |
} |
2130 |
if (file.Contains("#")) |
2131 |
file = file(0, file.First("#")); |
2132 |
// |
2133 |
// take only root files |
2134 |
// |
2135 |
if (file.EndsWith(".root")) { |
2136 |
TString filedir; |
2137 |
cout << ddir << endl; |
2138 |
if ( ddir != "" ) { |
2139 |
filedir = ddir; // take the input dir |
2140 |
} |
2141 |
else { |
2142 |
gSystem->ChangeDirectory(wdir); // back to the working directory |
2143 |
filedir = gSystem->DirName(file); // this will take the path if exist in the list otherwise it will return automatically the working dir |
2144 |
}; |
2145 |
filedir.Append("/"); |
2146 |
// char *fullpath = gSystem->ConcatFileName(gSystem->DirName(filedir), gSystem->BaseName(file)); |
2147 |
char *fullpath = gSystem->ConcatFileName(filedir.Data(), gSystem->BaseName(file)); |
2148 |
contents->Add(new TSystemFile(fullpath, gSystem->DirName(fullpath)));// add file to the list |
2149 |
cout << fullpath << endl; |
2150 |
delete fullpath; |
2151 |
} |
2152 |
// }else{ |
2153 |
// if(file.Data()!="")cout << "File: "<<file<<" ---> missing "<< endl; |
2154 |
// }; |
2155 |
}; |
2156 |
in.close(); |
2157 |
// -------------------------------------- |
2158 |
// a single root file given as input |
2159 |
// -------------------------------------- |
2160 |
} |
2161 |
else { |
2162 |
if (flisttxt.Contains("#")) |
2163 |
flisttxt = flisttxt(0, flisttxt.First("#")); |
2164 |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt), gSystem->BaseName(flisttxt)); |
2165 |
contents->Add(new TSystemFile(fullpath, gSystem->DirName(fullpath)));// add file to the list |
2166 |
delete fullpath; |
2167 |
}; |
2168 |
// --------------------------------------------------------------------------------- |
2169 |
// case 2 : no input file/file-list provided --> read all files insede the directory |
2170 |
// --------------------------------------------------------------------------------- |
2171 |
} |
2172 |
else { |
2173 |
|
2174 |
cout << "No input file list given." << endl; |
2175 |
cout << "Check for existing root files." << endl; |
2176 |
// cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl; |
2177 |
if (ddir == "") { |
2178 |
ddir = wdir; |
2179 |
cout << "Level2 data directory : " << ddir << endl; |
2180 |
}; |
2181 |
|
2182 |
TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir), ddir); |
2183 |
TList *temp = datadir->GetListOfFiles(); |
2184 |
if (!temp) |
2185 |
return 0; |
2186 |
// temp->Print(); |
2187 |
// cout << "*************************************" << endl; |
2188 |
|
2189 |
TIter next(temp); |
2190 |
TSystemFile *questo = 0; |
2191 |
|
2192 |
while ((questo = (TSystemFile*) next())) { |
2193 |
TString name = questo-> GetName(); |
2194 |
if (name.EndsWith(".root")) { |
2195 |
// const char *fullpath = gSystem->FindFile(ddir,name); |
2196 |
// char *fullpath; |
2197 |
// gSystem->IsFileInIncludePath(name,&fullpath); |
2198 |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(ddir), gSystem->BaseName(name)); |
2199 |
contents->Add(new TSystemFile(fullpath, gSystem->DirName(fullpath))); |
2200 |
delete fullpath; |
2201 |
}; |
2202 |
} |
2203 |
delete temp; |
2204 |
delete datadir; |
2205 |
|
2206 |
}; |
2207 |
gSystem->ChangeDirectory(wdir); // back to the working directory |
2208 |
// cout << endl << "Selected files:" << endl; |
2209 |
// contents->Print(); |
2210 |
cout << contents->GetEntries() << " files \n"; |
2211 |
// cout << endl; |
2212 |
// cout << "Working directory: "<< gSystem->WorkingDirectory()<< endl; |
2213 |
return contents; |
2214 |
} |
2215 |
; |
2216 |
//-------------------------------------- |
2217 |
// |
2218 |
// |
2219 |
//-------------------------------------- |
2220 |
/** |
2221 |
* Get the Pamela detector chains from a list of files and make them friends. |
2222 |
* @param fl Pointer to a TList of TSystemFiles |
2223 |
* @param detlist String to select trees to be included |
2224 |
* @return Pointer to a TChain |
2225 |
*/ |
2226 |
TChain *PamLevel2::GetPamTree(TList *fl, TString detlist) { |
2227 |
// |
2228 |
// |
2229 |
// |
2230 |
if (pam_tree) { |
2231 |
printf("WARNING: TChain *PamLevel2::GetPamTree(TList *fl, TString detlist) -- pam_tree already exists!\n "); |
2232 |
return pam_tree; |
2233 |
}; |
2234 |
// |
2235 |
|
2236 |
TChain *Trout = 0; |
2237 |
|
2238 |
// ------------------------------------------- |
2239 |
// set flags to include/exclude trees/branches |
2240 |
// ------------------------------------------- |
2241 |
if (detlist.Contains("+AUTO", TString::kIgnoreCase)) { |
2242 |
if (fl->GetEntries() > 0) { |
2243 |
cout << "+AUTO" << endl; |
2244 |
TFile *fprimo = new TFile(fl->At(0)->GetName()); |
2245 |
GetWhichTrees(fprimo); |
2246 |
fprimo->Close();// AAAAARGGGGGHHHHH!!!!!!! non commentare questa riga, altrimenti si incasina il TChain |
2247 |
fprimo->Delete(); |
2248 |
} |
2249 |
}; |
2250 |
SetWhichTrees(detlist); |
2251 |
|
2252 |
// ------------------------------------------- |
2253 |
// build chains |
2254 |
// ------------------------------------------- |
2255 |
TChain *T = 0; |
2256 |
TChain *C = 0; |
2257 |
TChain *O = 0; |
2258 |
TChain *R = 0; |
2259 |
TChain *S = 0; |
2260 |
TChain *N = 0; |
2261 |
TChain *A = 0; |
2262 |
TChain *B = 0; |
2263 |
TChain *G = 0; |
2264 |
|
2265 |
TChain *L = 0; |
2266 |
|
2267 |
if (TRK2 || TRK1 || TRKh) |
2268 |
T = new TChain("Tracker"); |
2269 |
if (CAL2 || CAL1) |
2270 |
C = new TChain("Calorimeter"); |
2271 |
if (TOF) |
2272 |
O = new TChain("ToF"); |
2273 |
if (TRG) |
2274 |
R = new TChain("Trigger"); |
2275 |
if (S4) |
2276 |
S = new TChain("S4"); |
2277 |
if (ND) |
2278 |
N = new TChain("NeutronD"); |
2279 |
if (AC) |
2280 |
A = new TChain("Anticounter"); |
2281 |
if (ORB) |
2282 |
B = new TChain("OrbitalInfo"); |
2283 |
if (GP) |
2284 |
G = new TChain("h20"); |
2285 |
L = new TChain("SelectionList"); |
2286 |
|
2287 |
// loop over files and create chains |
2288 |
TIter next(fl); |
2289 |
TSystemFile *questo = 0; |
2290 |
while ((questo = (TSystemFile*) next())) { |
2291 |
TString name = questo->GetName(); |
2292 |
cout << "File: " << name << endl; |
2293 |
if (CheckLevel2File(name)) { |
2294 |
if (TRK2 || TRK1 || TRKh) |
2295 |
T->Add(name); |
2296 |
if (CAL1 || CAL2) |
2297 |
C->Add(name); |
2298 |
if (TOF) |
2299 |
O->Add(name); |
2300 |
if (TRG) |
2301 |
R->Add(name); |
2302 |
if (S4) |
2303 |
S->Add(name); |
2304 |
if (ND) |
2305 |
N->Add(name); |
2306 |
if (AC) |
2307 |
A->Add(name); |
2308 |
if (ORB) |
2309 |
B->Add(name); |
2310 |
if (GP) |
2311 |
G->Add(name); |
2312 |
if (SELLI == 1) |
2313 |
L->Add(name); |
2314 |
}; |
2315 |
}; |
2316 |
|
2317 |
cout << "done chains\n"; |
2318 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
2319 |
|
2320 |
// ------------------------------------------- |
2321 |
// make friends |
2322 |
// ------------------------------------------- |
2323 |
|
2324 |
// Tracker |
2325 |
cout << "Friends: " << endl; |
2326 |
if (T && (TRK2 || TRK1 || TRKh)) { |
2327 |
if (!Trout) |
2328 |
Trout = T; |
2329 |
else |
2330 |
Trout->AddFriend("Tracker"); |
2331 |
// cout << "+Tacker"<<endl; |
2332 |
}; |
2333 |
// Calorimeter |
2334 |
if (C && (CAL2 || CAL1)) { |
2335 |
if (!Trout) |
2336 |
Trout = C; |
2337 |
else |
2338 |
Trout->AddFriend("Calorimeter"); |
2339 |
// cout << "+Calorimeter"<<endl; |
2340 |
}; |
2341 |
// ToF |
2342 |
if (O && TOF) { |
2343 |
if (!Trout) |
2344 |
Trout = O; |
2345 |
else |
2346 |
Trout->AddFriend("ToF"); |
2347 |
// cout << "+ToF"<<endl; |
2348 |
}; |
2349 |
// Trigger |
2350 |
if (R && TRG) { |
2351 |
if (!Trout) |
2352 |
Trout = O; |
2353 |
else |
2354 |
Trout->AddFriend("Trigger"); |
2355 |
// cout << "+Trigger"<<endl; |
2356 |
}; |
2357 |
// S4 |
2358 |
if (S && S4) { |
2359 |
if (!Trout) |
2360 |
Trout = O; |
2361 |
else |
2362 |
Trout->AddFriend("S4"); |
2363 |
// cout << "+S4"<<endl; |
2364 |
}; |
2365 |
// Neutron Detector |
2366 |
if (N && ND) { |
2367 |
if (!Trout) |
2368 |
Trout = O; |
2369 |
else |
2370 |
Trout->AddFriend("NeutronD"); |
2371 |
// cout << "+NeutronD"<<endl; |
2372 |
}; |
2373 |
// Anticounters |
2374 |
if (A && AC) { |
2375 |
if (!Trout) |
2376 |
Trout = O; |
2377 |
else |
2378 |
Trout->AddFriend("Anticounter"); |
2379 |
// cout << "+Anticounter"<<endl; |
2380 |
}; |
2381 |
// Orbital Info |
2382 |
if (B && ORB) { |
2383 |
if (!Trout) |
2384 |
Trout = O; |
2385 |
else |
2386 |
Trout->AddFriend("OrbitalInfo"); |
2387 |
// cout << "+OrbitalInfo"<<endl; |
2388 |
}; |
2389 |
// GPamela |
2390 |
if (G && GP) { |
2391 |
if (!Trout) |
2392 |
Trout = G; |
2393 |
else |
2394 |
Trout->AddFriend("h20"); |
2395 |
// cout << "+h20"<<endl; |
2396 |
}; |
2397 |
|
2398 |
// ===================================== |
2399 |
// SET BRANCH-ADDRESS AFTER CHAIN+FRIEND |
2400 |
// ===================================== |
2401 |
SetBranchAddress(Trout); |
2402 |
|
2403 |
// ------------------------------------ |
2404 |
// finally handle selection trees... |
2405 |
// (it is not friend of pamela tree) |
2406 |
// ------------------------------------ |
2407 |
|
2408 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
2409 |
|
2410 |
// Selection List |
2411 |
if (L && SELLI == 1) { |
2412 |
cout << ">>> Found selection-list <<<" << endl; |
2413 |
// L->SetBranchAddress("RunEntry",&irun); |
2414 |
L->SetBranchAddress("RunEntry", &irunt);//NEWNEW |
2415 |
cout << "SelectionList: set branch address RunEntry" << endl; |
2416 |
L->SetBranchAddress("EventEntry", &irunentry); |
2417 |
cout << "SelectionList: set branch address EventEntry" << endl; |
2418 |
sel_tree = L; |
2419 |
// if(!Trout)Trout=O; |
2420 |
// else Trout->AddFriend("SelectionList"); |
2421 |
cout << "+SelectionList" << endl; |
2422 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
2423 |
} |
2424 |
else { |
2425 |
// cout << "SelectionList : missing tree"<<endl; |
2426 |
if (L) |
2427 |
L->Delete(); |
2428 |
}; |
2429 |
|
2430 |
// -------------------------------------------- |
2431 |
// return the pamela chain with all the friends |
2432 |
// -------------------------------------------- |
2433 |
|
2434 |
pam_tree = Trout; |
2435 |
|
2436 |
return Trout; |
2437 |
} |
2438 |
|
2439 |
//-------------------------------------- |
2440 |
// |
2441 |
// |
2442 |
//-------------------------------------- |
2443 |
/** |
2444 |
* Set branch addresses for Pamela friend trees |
2445 |
*/ |
2446 |
void PamLevel2::SetBranchAddress(TTree *t) { |
2447 |
|
2448 |
TRK2 = TRK2 & t->GetBranchStatus("TrkLevel2"); |
2449 |
TRK1 = TRK1 & t->GetBranchStatus("TrkLevel1"); |
2450 |
TRKh = TRKh & t->GetBranchStatus("TrkHough"); |
2451 |
CAL2 = CAL2 & t->GetBranchStatus("CaloLevel2"); |
2452 |
CAL1 = CAL1 & t->GetBranchStatus("CaloLevel1"); |
2453 |
TOF = TOF & t->GetBranchStatus("ToFLevel2"); |
2454 |
TRG = TRG & t->GetBranchStatus("TrigLevel2"); |
2455 |
S4 = S4 & t->GetBranchStatus("S4Level2"); |
2456 |
ND = ND & t->GetBranchStatus("NDLevel2"); |
2457 |
AC = AC & t->GetBranchStatus("AcLevel2"); |
2458 |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
2459 |
GP = GP & t->GetBranchStatus("h20"); |
2460 |
|
2461 |
// Tracker |
2462 |
if (TRK1) { |
2463 |
t->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel2")); |
2464 |
cout << "Tracker : set branch address TrkLevel1" << endl; |
2465 |
}; |
2466 |
if (TRK2) { |
2467 |
t->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel1")); |
2468 |
cout << "Tracker : set branch address TrkLevel2" << endl; |
2469 |
}; |
2470 |
if (TRKh) { |
2471 |
t->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
2472 |
cout << "Tracker : set branch address TrkHough" << endl; |
2473 |
}; |
2474 |
|
2475 |
// Calorimeter |
2476 |
if (CAL1) { |
2477 |
t->SetBranchAddress("CaloLevel1", GetPointerTo("CaloLevel1")); |
2478 |
cout << "Calorimeter : set branch address CaloLevel1" << endl; |
2479 |
}; |
2480 |
if (CAL2) { |
2481 |
t->SetBranchAddress("CaloLevel2", GetPointerTo("CaloLevel2")); |
2482 |
cout << "Calorimeter : set branch address CaloLevel2" << endl; |
2483 |
}; |
2484 |
|
2485 |
// ToF |
2486 |
if (TOF) { |
2487 |
t->SetBranchAddress("ToFLevel2", GetPointerTo("ToFLevel2")); |
2488 |
cout << "ToF : set branch address ToFLevel2" << endl; |
2489 |
}; |
2490 |
// Trigger |
2491 |
if (TRG) { |
2492 |
t->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2")); |
2493 |
cout << "Trigger : set branch address TrigLevel2" << endl; |
2494 |
}; |
2495 |
// S4 |
2496 |
if (S4) { |
2497 |
t->SetBranchAddress("S4Level2", GetPointerTo("S4Level2")); |
2498 |
cout << "S4 : set branch address S4Level2" << endl; |
2499 |
}; |
2500 |
// Neutron Detector |
2501 |
if (ND) { |
2502 |
t->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2")); |
2503 |
cout << "NeutronD : set branch address NDLevel2" << endl; |
2504 |
}; |
2505 |
// Anticounters |
2506 |
if (AC) { |
2507 |
t->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2")); |
2508 |
cout << "Anticounter : set branch address AcLevel2" << endl; |
2509 |
}; |
2510 |
// OrbitalInfo |
2511 |
if (ORB) { |
2512 |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
2513 |
cout << "OrbitalInfo : set branch address OrbitalInfo" << endl; |
2514 |
}; |
2515 |
// GPamela |
2516 |
if (GP) { |
2517 |
// GetPointerTo("GPamela"); |
2518 |
if (!gp_obj) |
2519 |
gp_obj = new GPamela(); |
2520 |
// gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2521 |
// // t->SetBranchAddress("GPamela", GetPointerTo("GPamela")); |
2522 |
if (SELLI) |
2523 |
t->SetBranchAddress("GPamela", GetPointerTo("GPamela")); |
2524 |
else |
2525 |
gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2526 |
|
2527 |
cout << "h20 : set branch address GPamela " << endl; |
2528 |
}; |
2529 |
|
2530 |
} |
2531 |
/** |
2532 |
* Set branch addresses for Pamela friend trees |
2533 |
*/ |
2534 |
void PamLevel2::SetBranchAddress(TChain *t) { |
2535 |
|
2536 |
// TRK2 = TRK2 & t->GetBranchStatus("TrkLevel2"); |
2537 |
// TRK1 = TRK1 & t->GetBranchStatus("TrkLevel1"); |
2538 |
// TRKh = TRKh & t->GetBranchStatus("TrkHough"); |
2539 |
// CAL1 = CAL1 & t->GetBranchStatus("CaloLevel1"); |
2540 |
// CAL2 = CAL2 & t->GetBranchStatus("CaloLevel2"); |
2541 |
// TOF = TOF & t->GetBranchStatus("ToFLevel2"); |
2542 |
// TRG = TRG & t->GetBranchStatus("TrigLevel2"); |
2543 |
// S4 = S4 & t->GetBranchStatus("S4Level2"); |
2544 |
// ND = ND & t->GetBranchStatus("NDLevel2"); |
2545 |
// AC = AC & t->GetBranchStatus("AcLevel2"); |
2546 |
// ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
2547 |
// GP = GP & t->GetBranchStatus("h20"); |
2548 |
|
2549 |
// Tracker |
2550 |
if (TRK2) { |
2551 |
t->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
2552 |
cout << "Tracker : set branch address TrkLevel2" << endl; |
2553 |
}; |
2554 |
if (TRK1) { |
2555 |
t->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
2556 |
cout << "Tracker : set branch address TrkLevel1" << endl; |
2557 |
}; |
2558 |
if (TRKh) { |
2559 |
t->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
2560 |
cout << "Tracker : set branch address TrkHough" << endl; |
2561 |
}; |
2562 |
|
2563 |
// Calorimeter |
2564 |
if (CAL2) { |
2565 |
t->SetBranchAddress("CaloLevel2", GetPointerTo("CaloLevel2")); |
2566 |
cout << "Calorimeter : set branch address CaloLevel2" << endl; |
2567 |
}; |
2568 |
if (CAL1) { |
2569 |
t->SetBranchAddress("CaloLevel1", GetPointerTo("CaloLevel1")); |
2570 |
cout << "Calorimeter : set branch address CaloLevel1" << endl; |
2571 |
}; |
2572 |
|
2573 |
// ToF |
2574 |
if (TOF) { |
2575 |
t->SetBranchAddress("ToFLevel2", GetPointerTo("ToFLevel2")); |
2576 |
cout << "ToF : set branch address ToFLevel2" << endl; |
2577 |
}; |
2578 |
// Trigger |
2579 |
if (TRG) { |
2580 |
t->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2")); |
2581 |
cout << "Trigger : set branch address TrigLevel2" << endl; |
2582 |
}; |
2583 |
// S4 |
2584 |
if (S4) { |
2585 |
t->SetBranchAddress("S4Level2", GetPointerTo("S4Level2")); |
2586 |
cout << "S4 : set branch address S4Level2" << endl; |
2587 |
}; |
2588 |
// Neutron Detector |
2589 |
if (ND) { |
2590 |
t->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2")); |
2591 |
cout << "NeutronD : set branch address NDLevel2" << endl; |
2592 |
}; |
2593 |
// Anticounters |
2594 |
if (AC) { |
2595 |
t->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2")); |
2596 |
cout << "Anticounter : set branch address AcLevel2" << endl; |
2597 |
}; |
2598 |
// OrbitalInfo |
2599 |
if (ORB) { |
2600 |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
2601 |
cout << "OrbitalInfo : set branch address OrbitalInfo" << endl; |
2602 |
}; |
2603 |
// GPamela |
2604 |
// cout <<"GP "<<GP<<endl; |
2605 |
if (GP) { |
2606 |
// GetPointerTo("GPamela"); |
2607 |
if (!gp_obj) |
2608 |
gp_obj = new GPamela(); |
2609 |
if (SELLI) |
2610 |
t->SetBranchAddress("GPamela", GetPointerTo("GPamela")); |
2611 |
else |
2612 |
gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2613 |
// gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2614 |
cout << "h20 : set branch address GPamela " << endl; |
2615 |
}; |
2616 |
// SelectionList |
2617 |
// if(SELLI==1){ |
2618 |
// t->SetBranchAddress("RunEntry",&irunt);//NEWNEW |
2619 |
// cout << "SelectionList: set branch address RunEntry"<<endl; |
2620 |
// t->SetBranchAddress("EventEntry",&irunentry); |
2621 |
// cout << "SelectionList: set branch address EventEntry"<<endl; |
2622 |
|
2623 |
// } |
2624 |
|
2625 |
} |
2626 |
|
2627 |
//-------------------------------------- |
2628 |
// |
2629 |
// |
2630 |
//-------------------------------------- |
2631 |
/** |
2632 |
* Get the Run tree chain from a list of files. |
2633 |
* @param fl Pointer to a TList of TSystemFiles |
2634 |
* @return Pointer to a TChain |
2635 |
*/ |
2636 |
TChain *PamLevel2::GetRunTree(TList *fl) { |
2637 |
// |
2638 |
// |
2639 |
// |
2640 |
if (run_tree) { |
2641 |
printf("WARNING: TChain *PamLevel2::GetRunTree(TList *fl) -- run_tree already exists!\n "); |
2642 |
return run_tree; |
2643 |
}; |
2644 |
// |
2645 |
|
2646 |
|
2647 |
TChain *R = new TChain("Run"); |
2648 |
|
2649 |
// loop over files and create chains |
2650 |
TIter next(fl); |
2651 |
TSystemFile *questo = 0; |
2652 |
while ((questo = (TSystemFile*) next())) { |
2653 |
TString name = questo->GetName(); |
2654 |
// cout << "File: "<< name << endl; |
2655 |
if (CheckLevel2File(name)) { |
2656 |
R->Add(name); |
2657 |
}; |
2658 |
} |
2659 |
|
2660 |
if (RUN && R->GetNtrees()) { |
2661 |
|
2662 |
R->SetBranchAddress("RunInfo", GetPointerTo("RunInfo")); |
2663 |
cout << "Run : set branch address RunInfo" << endl; |
2664 |
R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
2665 |
cout << "Software : set branch address SoftInfo" << endl; // Emiliano |
2666 |
|
2667 |
irunoffset = new int[R->GetNtrees()]; |
2668 |
if (DBG) { |
2669 |
cout << "----------------------------------------------------" << endl; |
2670 |
cout << "irun\t | "; |
2671 |
cout << "tree\t |"; |
2672 |
// cout << "offset\t |"; |
2673 |
cout << "RUN\t"; |
2674 |
cout << "FRAG\t"; |
2675 |
cout << "NEVENTS\t"; |
2676 |
cout << "absolute time\t\t\t"; |
2677 |
cout << "on-board time"; |
2678 |
cout << endl; |
2679 |
} |
2680 |
for (Int_t ii = 0; ii < R->GetEntries(); ii++) { |
2681 |
R->GetEntry(ii); |
2682 |
if (DBG) { |
2683 |
cout << ii << "\t | "; |
2684 |
cout << R->GetTreeNumber() << "\t |"; |
2685 |
// cout << R->GetChainOffset()<< "\t |"; |
2686 |
cout << GetRunInfo()->ID << "\t"; |
2687 |
cout << GetRunInfo()->ID_RUN_FRAG << "\t"; |
2688 |
cout << GetRunInfo()->NEVENTS << "\t"; |
2689 |
cout << GetRunInfo()->RUNHEADER_TIME << " <---> " << GetRunInfo()->RUNTRAILER_TIME << "\t"; |
2690 |
cout << GetRunInfo()->RUNHEADER_OBT << " <---> " << GetRunInfo()->RUNTRAILER_OBT << "\t"; |
2691 |
cout << endl; |
2692 |
} |
2693 |
irunoffset[R->GetTreeNumber()] = R->GetChainOffset(); |
2694 |
} |
2695 |
cout << "N.run = " << R->GetEntries() << endl; |
2696 |
cout << "----------------------------------------------------" << endl; |
2697 |
|
2698 |
} |
2699 |
else { |
2700 |
delete R; |
2701 |
R = 0; |
2702 |
} |
2703 |
|
2704 |
run_tree = R; |
2705 |
|
2706 |
return R; |
2707 |
|
2708 |
} |
2709 |
//-------------------------------------- |
2710 |
// |
2711 |
// |
2712 |
//-------------------------------------- |
2713 |
/** |
2714 |
* Get the Run tree from a file. |
2715 |
* @param f Pointer to a TFile |
2716 |
* @return Pointer to a TTree |
2717 |
*/ |
2718 |
TTree *PamLevel2::GetRunTree(TFile *f) { |
2719 |
if (run_tree) { |
2720 |
printf("WARNING: TTree *PamLevel2::GetRunTree(TFile *f) -- run_tree already exists!\n "); |
2721 |
return run_tree; |
2722 |
}; |
2723 |
|
2724 |
cout << "TTree *PamLevel2::GetRunTree(TFile *f) -- obsolte " << endl; |
2725 |
|
2726 |
TTree *T = (TTree*) f->Get("Run"); |
2727 |
|
2728 |
if (T) { |
2729 |
T->SetBranchAddress("RunInfo", GetPointerTo("RunInfo")); |
2730 |
cout << "Run : set branch address RunInfo" << endl; |
2731 |
T->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
2732 |
cout << "Software : set branch address SoftInfo" << endl; // Emiliano |
2733 |
|
2734 |
} |
2735 |
|
2736 |
run_tree = (TChain*) T; |
2737 |
|
2738 |
return T; |
2739 |
|
2740 |
} |
2741 |
/** |
2742 |
* Update the runinfo informations (to be used to have Run infos event by event basis) |
2743 |
* @param run Pointer to the chain/tree which contains run infos |
2744 |
* @return true if a new run has been read, false if it is still the same run |
2745 |
*/ |
2746 |
Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) { |
2747 |
// |
2748 |
// check if we have already called once GetEntry, if not call it |
2749 |
// |
2750 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- ATTENZIONE --- NON E` MANTENUTA!!!!!!!.... " |
2751 |
<< endl; |
2752 |
if (!run) { |
2753 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree " << endl; |
2754 |
return (false); |
2755 |
} |
2756 |
if (run->GetEntries() <= 0) |
2757 |
return (false); |
2758 |
// |
2759 |
|
2760 |
// Int_t oldrun = irun; |
2761 |
Long64_t oldrun = irun; |
2762 |
|
2763 |
// -------------------------------------- |
2764 |
// if it is a full file (not preselected) |
2765 |
// -------------------------------------- |
2766 |
if (SELLI == 0) { |
2767 |
|
2768 |
// |
2769 |
// the absolute time is necessary to relate the event with the run |
2770 |
// |
2771 |
if (!GetOrbitalInfo() && !ISGP) { |
2772 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing OrbitalInfo " << endl; |
2773 |
return (false); |
2774 |
} |
2775 |
|
2776 |
ULong64_t abstime = 0; |
2777 |
if (GetOrbitalInfo()) |
2778 |
abstime = GetOrbitalInfo()->absTime; |
2779 |
|
2780 |
// |
2781 |
// the first time the routine is called, set run search from the beginning |
2782 |
// |
2783 |
if (irun < 0LL) { |
2784 |
irun = 0LL; |
2785 |
run->GetEntry(irun); |
2786 |
runfirstentry = 0LL; |
2787 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2788 |
if ((Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL) |
2789 |
runlastentry -= 1LL; |
2790 |
|
2791 |
if (ISGP && run->GetEntries() != 1) { |
2792 |
cout << "** WARNING ** simulated files are assumed to have 1 single run, not " << run->GetEntries() << endl; |
2793 |
cout << "** WARNING ** run will not be updated" << endl; |
2794 |
} |
2795 |
|
2796 |
}; |
2797 |
// |
2798 |
if (ISGP) |
2799 |
abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO |
2800 |
// |
2801 |
if (irun == run->GetEntries() - 1LL && !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime |
2802 |
<= GetRunInfo()->RUNTRAILER_TIME)) { |
2803 |
irun = -1LL; |
2804 |
irunt = -1LL; |
2805 |
runfirstentry = 0LL; |
2806 |
runlastentry = -1LL; |
2807 |
}; |
2808 |
// modificato il controllo sull'aggiornamento del run, per evitare problemi |
2809 |
// dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!) |
2810 |
// |
2811 |
bool fromfirst = true; |
2812 |
// |
2813 |
while (!(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME) && irun |
2814 |
< run->GetEntries() - 1LL) { |
2815 |
// while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
2816 |
irun++; |
2817 |
run->GetEntry(irun); |
2818 |
runfirstentry = runlastentry; |
2819 |
if ((Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL) |
2820 |
runfirstentry += 1LL; |
2821 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2822 |
// cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2823 |
// cout << "runfirstentry "<<runfirstentry<<endl; |
2824 |
// printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS))); |
2825 |
// printf(" abstime %u trailertime %u \n",abstime,GetRunInfo()->RUNTRAILER_TIME); |
2826 |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
2827 |
// |
2828 |
// prevshift = 0; |
2829 |
// |
2830 |
if (irun == (Long64_t)(run->GetEntries() - 1LL) && fromfirst && !(abstime >= GetRunInfo()->RUNHEADER_TIME |
2831 |
&& abstime <= GetRunInfo()->RUNTRAILER_TIME)) { |
2832 |
printf(" resetting irun (it should NOT happen!!!)\n"); |
2833 |
fromfirst = false; |
2834 |
irun = 0; |
2835 |
run->GetEntry(irun); |
2836 |
runfirstentry = 0ULL; |
2837 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2838 |
if ((Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL) |
2839 |
runlastentry -= 1LL; |
2840 |
}; |
2841 |
// |
2842 |
}; |
2843 |
// |
2844 |
if (!(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME)) { |
2845 |
printf(" Something very wrong here: cannot find RUN containing absolute time %llu \n", abstime); |
2846 |
return false; |
2847 |
} |
2848 |
// |
2849 |
if (irun == oldrun || irun >= run->GetEntries()) |
2850 |
return (false); |
2851 |
// |
2852 |
// printf(" iev %llu irun %i nevents %u 1st %llu last %llu \n",iev,irun,this->GetRunInfo()->NEVENTS,(ULong64_t)runfirstentry,(ULong64_t)runlastentry); |
2853 |
// |
2854 |
prevshift = 0; |
2855 |
cout << " ))))) UPDATE RUN INFO ((((( @iev " << iev << " run " << GetRunInfo()->ID << " irun " << irun << endl; |
2856 |
// cout << "runfirstentry "<<runfirstentry<<endl; |
2857 |
return (true); |
2858 |
}; |
2859 |
// ---------------------------------------------------- |
2860 |
// if it is a preselected file (there is SelectionList) |
2861 |
// NBNB - the event tree MUST be read first |
2862 |
// ---------------------------------------------------- |
2863 |
if (SELLI == 1) { |
2864 |
sel_tree->GetEntry(iev); |
2865 |
// cout << irun << " "<< irunentry << endl; |
2866 |
if (irun != oldrun) { |
2867 |
run->GetEntry(irun); |
2868 |
cout << " ))))) UPDATE RUN INFO ((((( @iev " << iev << " run " << GetRunInfo()->ID << " irun " << irun << endl; |
2869 |
prevshift = 0; |
2870 |
return true; |
2871 |
} |
2872 |
return false; |
2873 |
} |
2874 |
|
2875 |
return false; |
2876 |
// |
2877 |
} |
2878 |
; |
2879 |
|
2880 |
Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) { |
2881 |
|
2882 |
if (!run_tree) { |
2883 |
cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree not loaded" << endl; |
2884 |
return false; |
2885 |
} |
2886 |
if (run_tree->GetEntries() <= 0) { |
2887 |
cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree is empty" << endl; |
2888 |
return (false); |
2889 |
} |
2890 |
|
2891 |
Int_t oldrun = irun; // store current run index |
2892 |
|
2893 |
// ----------------------------------------------------------------------- |
2894 |
// the first time the routine is called, set run search from the beginning |
2895 |
// ----------------------------------------------------------------------- |
2896 |
|
2897 |
if (irun < 0) { |
2898 |
irun = 0LL; |
2899 |
irunt = 0LL; |
2900 |
irunentry = 0; |
2901 |
prevshift = 0; |
2902 |
run_tree->GetEntry(irun); |
2903 |
if (!GetOrbitalInfo()) |
2904 |
cout << "** WARNING ** missing OrbitalInfo ---> run info might be not correctly updated " << endl; |
2905 |
if (gltsync) |
2906 |
delete gltsync; //Emiliano |
2907 |
if (!dbc || (dbc && !dbc->IsConnected())) |
2908 |
SetDBConnection(); //Emiliano |
2909 |
gltsync = new GL_TIMESYNC(GetRunInfo()->ID_ROOT_L0, "ID", dbc, false); //Emiliano // the "false" means not to use level0 file (not necessary here) |
2910 |
if (dbc){ |
2911 |
dbc->Close();// Emiliano |
2912 |
delete dbc; |
2913 |
dbc=0; |
2914 |
}; |
2915 |
}; |
2916 |
// --------------------------------------------------------------- |
2917 |
// retrieve OBT and absolute time of the event |
2918 |
// --------------------------------------------------------------- |
2919 |
ULong64_t abstime = 0LL; |
2920 |
// ULong64_t obt = 0LL; // Emiliano |
2921 |
Long64_t obt = 0LL; // Emiliano, Long64_t GL_TIMESYNC::DBobt(UInt_t obt) since depending on the situation OBT is lowered or boosted |
2922 |
if (GetOrbitalInfo()) { |
2923 |
abstime = GetOrbitalInfo()->absTime; |
2924 |
obt = gltsync->DBobt(GetOrbitalInfo()->OBT); // Emiliano |
2925 |
} |
2926 |
else { |
2927 |
abstime = GetRunInfo()->RUNHEADER_TIME; |
2928 |
obt = gltsync->DBobt(GetRunInfo()->RUNHEADER_OBT); // Emiliano |
2929 |
} |
2930 |
|
2931 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2932 |
// if it is a full file (not preselected) |
2933 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2934 |
if (SELLI == 0 || SELLI == 2) { // Emiliano |
2935 |
|
2936 |
// --------------------------------------------------------------- |
2937 |
// increment dead and live-time counters |
2938 |
// (only when reading a file not preselected) |
2939 |
// --------------------------------------------------------------- |
2940 |
if (SELLI == 0) { |
2941 |
if (GetTrigLevel2()) { |
2942 |
totdltime[0] += GetTrigLevel2()->dltime[0]; |
2943 |
totdltime[1] += GetTrigLevel2()->dltime[1]; |
2944 |
} |
2945 |
totdltime[2]++; |
2946 |
} |
2947 |
|
2948 |
// |
2949 |
bool fromfirst = true; // first loop over runs |
2950 |
|
2951 |
|
2952 |
// ------------------------------------------------------ |
2953 |
// loop over runs to find the one that contains the event |
2954 |
// ------------------------------------------------------ |
2955 |
while (( |
2956 |
// ( |
2957 |
// !(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
2958 |
// abstime <= GetRunInfo()->RUNTRAILER_TIME) && |
2959 |
// !(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
2960 |
// obt <= GetRunInfo()->RUNTRAILER_OBT) |
2961 |
// ) |
2962 |
|
2963 |
!(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
2964 |
abstime <= GetRunInfo()->RUNTRAILER_TIME) || !(obt >= gltsync->DBobt(GetRunInfo()->RUNHEADER_OBT) && // additional check on OBT (ms) // Emiliano |
2965 |
obt <= gltsync->DBobt(GetRunInfo()->RUNTRAILER_OBT)) // Emiliano |
2966 |
|| GetRunInfo()->NEVENTS == 0 |
2967 |
// || !(irunentry < GetRunInfo()->NEVENTS-1-prevshift) // ERRORE!!! fa saltare i run con 1 evento |
2968 |
|| !(irunentry <= GetRunInfo()->NEVENTS - 1 - prevshift)) && irun < run_tree->GetEntries()) { |
2969 |
|
2970 |
// if( !(abstime >= GetRunInfo()->RUNHEADER_TIME &&abstime <= GetRunInfo()->RUNTRAILER_TIME) )cout << "ABS TIME "<<abstime << " " <<GetRunInfo()->RUNTRAILER_TIME <<endl; |
2971 |
// if( !(obt >= GetRunInfo()->RUNHEADER_OBT && obt <= GetRunInfo()->RUNTRAILER_OBT) )cout << "OBT TIME "<< obt <<" "<< GetRunInfo()->RUNTRAILER_OBT << endl; |
2972 |
// if( GetRunInfo()->NEVENTS==0 )cout <<"GetRunInfo()->NEVENTS==0 "<<endl; |
2973 |
// if( !(irunentry <= GetRunInfo()->NEVENTS-1-prevshift) ) cout << "irunentry > "<<GetRunInfo()->NEVENTS-1-prevshift << endl; |
2974 |
// - - - - - - - - - - - - - |
2975 |
// irunentry = position of current entry, relative to the run |
2976 |
// prevshift = shift needed to synchronize l0 and l2 data (nested events) |
2977 |
// - - - - - - - - - - - - - |
2978 |
|
2979 |
// ----------------------------------------- |
2980 |
// store dead and live-time of previous run |
2981 |
// ----------------------------------------- |
2982 |
// if(SELLI==0){ |
2983 |
if (SELLI != 2) { |
2984 |
if (fromfirst) { |
2985 |
if (oldrun == irun) { |
2986 |
/// decrement counters |
2987 |
if (GetTrigLevel2()) { |
2988 |
totdltime[0] -= GetTrigLevel2()->dltime[0];//live-time |
2989 |
totdltime[1] -= GetTrigLevel2()->dltime[1];//dead-time |
2990 |
} |
2991 |
totdltime[2]--; //event counter |
2992 |
if (DBG) { |
2993 |
cout << endl; |
2994 |
cout << "n.events : " << totdltime[2] << endl; |
2995 |
cout << "RUN LIVE-TIME: " << totdltime[0] * 0.16 << " ms" << endl; |
2996 |
cout << "RUN DEAD-TIME: " << totdltime[1] * 0.01 << " ms" << endl; |
2997 |
} |
2998 |
} |
2999 |
else { |
3000 |
totdltime[0] = 0;//live-time |
3001 |
totdltime[1] = 0;//dead-time |
3002 |
totdltime[2] = 0; //event counter |
3003 |
if (DBG) |
3004 |
cout << " *** JUMP RUN *** irun " << irun << endl; |
3005 |
} |
3006 |
/// add an entry |
3007 |
if (run_tree_clone) |
3008 |
if (run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries()) |
3009 |
run_tree_clone->GetBranch("DeadLiveTime")->Fill(); |
3010 |
/// reset counters |
3011 |
if (GetTrigLevel2()) { |
3012 |
totdltime[0] = GetTrigLevel2()->dltime[0];//live-time |
3013 |
totdltime[1] = 0; //dead-time |
3014 |
} |
3015 |
totdltime[2] = 1; //event counter |
3016 |
} |
3017 |
} |
3018 |
// } |
3019 |
|
3020 |
irun++; |
3021 |
// ------------------------------------ |
3022 |
// if the end of run tree is reached... |
3023 |
// ------------------------------------ |
3024 |
if (irun == run_tree->GetEntries()) { |
3025 |
if (!fromfirst) { |
3026 |
// ----------------------------------------------------- |
3027 |
// if it happened already once and the run was not found |
3028 |
// ---> exit with error |
3029 |
// ----------------------------------------------------- |
3030 |
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- event entry #" << iev |
3031 |
<< " does not belong to any run (should not happen)" << endl; |
3032 |
return false; |
3033 |
} |
3034 |
// ----------------------------------------- |
3035 |
// ...otherwise repeat search from beginning |
3036 |
// ----------------------------------------- |
3037 |
cout |
3038 |
<< "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- reached end of run tree. searchin again from beginning " |
3039 |
<< endl; |
3040 |
fromfirst = false; |
3041 |
irun = 0LL; |
3042 |
runfirstentry = 0LL; |
3043 |
} |
3044 |
// ------------------------------------------------------------------- |
3045 |
// save the index of the first entry of the run, relative to pam_tree, |
3046 |
// and read a new run |
3047 |
// ------------------------------------------------------------------- |
3048 |
if (irun > 0) |
3049 |
runfirstentry += (GetRunInfo()->NEVENTS) - prevshift; |
3050 |
irunentry = 0; |
3051 |
prevshift = 0; |
3052 |
run_tree->GetEntry(irun);//update runinfo |
3053 |
irunt = irun - irunoffset[run_tree->GetTreeNumber()]; |
3054 |
if (gltsync) |
3055 |
delete gltsync; // Emiliano |
3056 |
if (!dbc || (dbc && !dbc->IsConnected())) |
3057 |
SetDBConnection(); //Emiliano |
3058 |
gltsync = new GL_TIMESYNC(GetRunInfo()->ID_ROOT_L0, "ID", dbc, false); // Emiliano |
3059 |
if (dbc){ |
3060 |
dbc->Close(); // Emiliano |
3061 |
delete dbc; |
3062 |
dbc=0; |
3063 |
}; |
3064 |
if (gltsync->DBobt(GetRunInfo()->RUNHEADER_OBT) > gltsync->DBobt(GetRunInfo()->RUNTRAILER_OBT)) { // Emiliano |
3065 |
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun " << irun |
3066 |
<< " has RUNHEADER_OBT>=RUNTRAILER_OBT " << endl; |
3067 |
cout |
3068 |
<< " (NB!! in this case some events are assigned to a wrong run)" |
3069 |
<< endl; |
3070 |
} |
3071 |
// if(hasfrag && fragid != GetRunInfo()->ID){ |
3072 |
// cout << "... where is the next fragment ??"<<endl; |
3073 |
// } |
3074 |
}; |
3075 |
|
3076 |
// -------------------------------------- |
3077 |
// if there was no need to update the run |
3078 |
// ---> exit with FALSE |
3079 |
// -------------------------------------- |
3080 |
if (irun == oldrun) |
3081 |
return (false); |
3082 |
|
3083 |
// -------------------------------------- |
3084 |
// ... otherwise |
3085 |
// -------------------------------------- |
3086 |
|
3087 |
|
3088 |
// -------------------------------------- |
3089 |
// ---> exit with TRUE |
3090 |
// -------------------------------------- |
3091 |
if (DBG) |
3092 |
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev " << iev << " run " << GetRunInfo()->ID << " irun " << irun |
3093 |
<< endl; |
3094 |
// ---------------------------------------------------- |
3095 |
// update the tracker parameters |
3096 |
// (non ho trovato nessun altro modo sicuro di farlo...) |
3097 |
// ---------------------------------------------------- |
3098 |
if (!dbc || (dbc && !dbc->IsConnected())) |
3099 |
SetDBConnection(); |
3100 |
TrkParams::Set(GetRunInfo(), dbc); |
3101 |
if (dbc){ |
3102 |
dbc->Close(); |
3103 |
delete dbc; |
3104 |
dbc=0; |
3105 |
}; |
3106 |
|
3107 |
// ---------------------------------------------------- |
3108 |
// then check if the run has a fragment |
3109 |
// in this case we have to switch to the next fragment |
3110 |
// when the end of the first fragment is reached |
3111 |
// ---------------------------------------------------- |
3112 |
if (GetRunInfo()->ID_RUN_FRAG != 0 && |
3113 |
// GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID && |
3114 |
DBG && true) { |
3115 |
cout << "* fragment *" << endl; |
3116 |
} |
3117 |
|
3118 |
return (true); |
3119 |
}; |
3120 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
3121 |
// if it is a preselected file (there is SelectionList) |
3122 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
3123 |
// irun = run entry relative to the chain |
3124 |
// irunt = run entry relative to the tree |
3125 |
if (SELLI == 1) { |
3126 |
sel_tree->GetEntry(iev);// read irunt from SelectionList |
3127 |
irun = irunt + irunoffset[sel_tree->GetTreeNumber()];//NEWNEW |
3128 |
if (irun != oldrun) { |
3129 |
if (irun < run_tree->GetEntries()) |
3130 |
run_tree->GetEntry(irun); |
3131 |
// check if the time is ok (with merged files it is not...) |
3132 |
// if not loop over run and look for the proper entry |
3133 |
bool SECONDO_GIRO = false; |
3134 |
// Long64_t irun_start = irun; |
3135 |
int offset_start = irunoffset[sel_tree->GetTreeNumber()]; |
3136 |
while (((!(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
3137 |
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
3138 |
// || |
3139 |
// !(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
3140 |
// obt <= GetRunInfo()->RUNTRAILER_OBT) |
3141 |
) || GetRunInfo()->NEVENTS == 0) |
3142 |
// && irun < run_tree->GetEntries() |
3143 |
) { |
3144 |
|
3145 |
if (DBG) { |
3146 |
cout << " (test) "; |
3147 |
cout << " tree " << sel_tree->GetTreeNumber(); |
3148 |
cout << " irunt " << irunt; |
3149 |
cout << " offset " << irunoffset[sel_tree->GetTreeNumber()]; |
3150 |
cout << " abs " << abstime; |
3151 |
cout << " >> " << GetRunInfo()->RUNHEADER_TIME << " " << GetRunInfo()->RUNTRAILER_TIME; |
3152 |
cout << " obt " << obt; |
3153 |
cout << " >> " << GetRunInfo()->RUNHEADER_OBT << " " << GetRunInfo()->RUNTRAILER_OBT; |
3154 |
cout << " *** JUMP RUN *** irun " << irun; |
3155 |
cout << endl; |
3156 |
} |
3157 |
// irun++; |
3158 |
irunoffset[sel_tree->GetTreeNumber()]++; |
3159 |
irun = irunt + irunoffset[sel_tree->GetTreeNumber()];//NEWNEW |
3160 |
if (irun == run_tree->GetEntries() && SECONDO_GIRO) { |
3161 |
// if(irun == irun_start ){ |
3162 |
cout << " ...grrrvzzkhhhajsdkj!!!! " << endl; |
3163 |
irunoffset[sel_tree->GetTreeNumber()] = offset_start; |
3164 |
return false; |
3165 |
} |
3166 |
if (irun >= run_tree->GetEntries() || irun < 0) { |
3167 |
cout << "irun = " << irun << " >> search from the beginning... <<" << endl; |
3168 |
SECONDO_GIRO = true; |
3169 |
irun = 0; |
3170 |
irunoffset[sel_tree->GetTreeNumber()] = -irunt; |
3171 |
} |
3172 |
run_tree->GetEntry(irun); |
3173 |
} |
3174 |
|
3175 |
if (DBG) { |
3176 |
cout << " (test) "; |
3177 |
cout << " tree " << sel_tree->GetTreeNumber(); |
3178 |
cout << " irunt " << irunt; |
3179 |
cout << " offset " << irunoffset[sel_tree->GetTreeNumber()]; |
3180 |
cout << " abs " << abstime; |
3181 |
cout << " >> " << GetRunInfo()->RUNHEADER_TIME << " " << GetRunInfo()->RUNTRAILER_TIME; |
3182 |
cout << " obt " << obt; |
3183 |
cout << " >> " << GetRunInfo()->RUNHEADER_OBT << " " << GetRunInfo()->RUNTRAILER_OBT; |
3184 |
} |
3185 |
if (DBG) |
3186 |
cout << endl; |
3187 |
if (DBG) |
3188 |
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev " << iev << " run " << GetRunInfo()->ID << " (run-entry " |
3189 |
<< irun << ")" << endl; |
3190 |
// ---------------------------------------------------- |
3191 |
// update the tracker parameters |
3192 |
// (non ho trovato nessun altro modo sicuro di farlo...) |
3193 |
// ---------------------------------------------------- |
3194 |
if (!dbc || (dbc && !dbc->IsConnected())) |
3195 |
SetDBConnection(); |
3196 |
TrkParams::Set(GetRunInfo(), dbc); |
3197 |
if (dbc){ |
3198 |
dbc->Close(); |
3199 |
delete dbc; |
3200 |
dbc=0; |
3201 |
}; |
3202 |
// cout << endl; |
3203 |
prevshift = 0; |
3204 |
return true; |
3205 |
} |
3206 |
return false; |
3207 |
} |
3208 |
|
3209 |
return false; |
3210 |
// |
3211 |
} |
3212 |
; |
3213 |
/** |
3214 |
* Update the runinfo informations (to be used to have Run infos event by event basis) |
3215 |
* @param run Pointer to the chain/tree which contains run infos |
3216 |
* @return true if a new run has been read, false if it is still the same run |
3217 |
*/ |
3218 |
Bool_t PamLevel2::UpdateRunInfo(TTree *run, Long64_t iev) { |
3219 |
return (UpdateRunInfo((TChain*) run, iev)); |
3220 |
} |
3221 |
; |
3222 |
|
3223 |
//-------------------------------------- |
3224 |
// |
3225 |
// |
3226 |
//-------------------------------------- |
3227 |
/** |
3228 |
* Set which trees shoul be analysed |
3229 |
* @param detlist TString containing the sequence of trees required |
3230 |
*/ |
3231 |
void PamLevel2::SetWhichTrees(TString detlist) { |
3232 |
|
3233 |
// if(detlist.IsNull() || detlist.Contains("+ALL", TString::kIgnoreCase)){ |
3234 |
if (detlist.Contains("+ALL", TString::kIgnoreCase)) { |
3235 |
|
3236 |
cout << " ======================================================== " << endl; |
3237 |
cout << " (( WARNING )) " << endl; |
3238 |
cout << " The meaning of the option +ALL has changed!! " << endl; |
3239 |
cout << " Now it includes really all (level0+level1+level2+gpamela)" << endl; |
3240 |
cout << " and the file is discarded if it does not contain " << endl; |
3241 |
cout << " all trees or if level0 files are not available!! " << endl; |
3242 |
cout << " ======================================================== " << endl; |
3243 |
|
3244 |
CAL0 = true; |
3245 |
CAL1 = true; |
3246 |
CAL2 = true; |
3247 |
TRK2 = true; |
3248 |
TRK1 = true; |
3249 |
TRKh = true; |
3250 |
TRK0 = true; |
3251 |
TRG = true; |
3252 |
TOF = true; |
3253 |
TOF0 = true; |
3254 |
S4 = true; |
3255 |
ND = true; |
3256 |
AC = true; |
3257 |
ORB = true; |
3258 |
GP = true; |
3259 |
} |
3260 |
else if (detlist.Contains("-ALL", TString::kIgnoreCase)) { |
3261 |
CAL0 = false; |
3262 |
CAL1 = false; |
3263 |
CAL2 = false; |
3264 |
TRK2 = false; |
3265 |
TRK1 = false; |
3266 |
TRKh = false; |
3267 |
TRK0 = false; |
3268 |
TRG = false; |
3269 |
TOF = false; |
3270 |
TOF0 = false; |
3271 |
S4 = false; |
3272 |
ND = false; |
3273 |
AC = false; |
3274 |
ORB = false; |
3275 |
GP = false; |
3276 |
}; |
3277 |
|
3278 |
// ------------------------------------------------------------------------- |
3279 |
if (detlist.Contains("CAL1", TString::kIgnoreCase)) { |
3280 |
if (detlist.Contains("-CAL1", TString::kIgnoreCase)) |
3281 |
CAL1 = false; |
3282 |
if (detlist.Contains("+CAL1", TString::kIgnoreCase)) |
3283 |
CAL1 = true; |
3284 |
}; |
3285 |
|
3286 |
if (detlist.Contains("CAL0", TString::kIgnoreCase)) { |
3287 |
if (detlist.Contains("-CAL0", TString::kIgnoreCase)) |
3288 |
CAL0 = false; |
3289 |
if (detlist.Contains("+CAL0", TString::kIgnoreCase)) |
3290 |
CAL0 = true; |
3291 |
}; |
3292 |
|
3293 |
if (detlist.Contains("CAL2", TString::kIgnoreCase)) { |
3294 |
if (detlist.Contains("-CAL2", TString::kIgnoreCase)) |
3295 |
CAL2 = false; |
3296 |
if (detlist.Contains("+CAL2", TString::kIgnoreCase)) |
3297 |
CAL2 = true; |
3298 |
}; |
3299 |
|
3300 |
if (detlist.Contains("+CAL", TString::kIgnoreCase) && !CAL1 && !CAL2) |
3301 |
CAL2 = true; |
3302 |
if (detlist.Contains("-CAL", TString::kIgnoreCase) && CAL1 && CAL2) { |
3303 |
CAL2 = false; |
3304 |
CAL1 = false; |
3305 |
} |
3306 |
// ------------------------------------------------------------------------- |
3307 |
if (detlist.Contains("TRK0", TString::kIgnoreCase)) { |
3308 |
if (detlist.Contains("-TRK0", TString::kIgnoreCase)) |
3309 |
TRK0 = false; |
3310 |
if (detlist.Contains("+TRK0", TString::kIgnoreCase)) |
3311 |
TRK0 = true; |
3312 |
}; |
3313 |
|
3314 |
if (detlist.Contains("TRK1", TString::kIgnoreCase)) { |
3315 |
if (detlist.Contains("-TRK1", TString::kIgnoreCase)) |
3316 |
TRK1 = false; |
3317 |
if (detlist.Contains("+TRK1", TString::kIgnoreCase)) |
3318 |
TRK1 = true; |
3319 |
}; |
3320 |
|
3321 |
if (detlist.Contains("TRK2", TString::kIgnoreCase)) { |
3322 |
if (detlist.Contains("-TRK2", TString::kIgnoreCase)) |
3323 |
TRK2 = false; |
3324 |
if (detlist.Contains("+TRK2", TString::kIgnoreCase)) |
3325 |
TRK2 = true; |
3326 |
}; |
3327 |
|
3328 |
if (detlist.Contains("TRKh", TString::kIgnoreCase)) { |
3329 |
if (detlist.Contains("-TRKh", TString::kIgnoreCase)) |
3330 |
TRKh = false; |
3331 |
if (detlist.Contains("+TRKh", TString::kIgnoreCase)) |
3332 |
TRKh = true; |
3333 |
}; |
3334 |
|
3335 |
if (detlist.Contains("+TRK", TString::kIgnoreCase) && !TRK1 && !TRK2 && !TRKh) |
3336 |
TRK2 = true; |
3337 |
if (detlist.Contains("-TRK", TString::kIgnoreCase) && TRK1 && TRK2 && TRKh) { |
3338 |
TRK2 = false; |
3339 |
TRK1 = false; |
3340 |
TRKh = false; |
3341 |
} |
3342 |
// ------------------------------------------------------------------------- |
3343 |
|
3344 |
if (detlist.Contains("-TRG", TString::kIgnoreCase)) |
3345 |
TRG = false; |
3346 |
else if (detlist.Contains("+TRG", TString::kIgnoreCase)) |
3347 |
TRG = true; |
3348 |
|
3349 |
if (detlist.Contains("-TOF", TString::kIgnoreCase)) |
3350 |
TOF = false; |
3351 |
else if (detlist.Contains("+TOF", TString::kIgnoreCase)) |
3352 |
TOF = true; |
3353 |
|
3354 |
if (detlist.Contains("-TOF0", TString::kIgnoreCase)) |
3355 |
TOF0 = false; |
3356 |
else if (detlist.Contains("+TOF0", TString::kIgnoreCase)) |
3357 |
TOF0 = true; |
3358 |
|
3359 |
if (detlist.Contains("-S4", TString::kIgnoreCase)) |
3360 |
S4 = false; |
3361 |
else if (detlist.Contains("+S4", TString::kIgnoreCase)) |
3362 |
S4 = true; |
3363 |
|
3364 |
if (detlist.Contains("-ND", TString::kIgnoreCase)) |
3365 |
ND = false; |
3366 |
else if (detlist.Contains("+ND", TString::kIgnoreCase)) |
3367 |
ND = true; |
3368 |
|
3369 |
if (detlist.Contains("-AC", TString::kIgnoreCase)) |
3370 |
AC = false; |
3371 |
else if (detlist.Contains("+AC", TString::kIgnoreCase)) |
3372 |
AC = true; |
3373 |
|
3374 |
if (detlist.Contains("-ORB", TString::kIgnoreCase)) |
3375 |
ORB = false; |
3376 |
else if (detlist.Contains("+ORB", TString::kIgnoreCase)) |
3377 |
ORB = true; |
3378 |
|
3379 |
if (detlist.Contains("-GP", TString::kIgnoreCase)) |
3380 |
GP = false; |
3381 |
else if (detlist.Contains("+GP", TString::kIgnoreCase)) |
3382 |
GP = true; |
3383 |
|
3384 |
cout << "tree/branch list from input --> "; |
3385 |
if (TRK0) |
3386 |
cout << "TRK0 "; |
3387 |
if (TRK1) |
3388 |
cout << "TRK1 "; |
3389 |
if (TRK2) |
3390 |
cout << "TRK2 "; |
3391 |
if (TRKh) |
3392 |
cout << "TRKH "; |
3393 |
if (CAL0) |
3394 |
cout << "CAL0 "; |
3395 |
if (CAL1) |
3396 |
cout << "CAL1 "; |
3397 |
if (CAL2) |
3398 |
cout << "CAL2 "; |
3399 |
if (TOF) |
3400 |
cout << "TOF "; |
3401 |
if (TRG) |
3402 |
cout << "TRG "; |
3403 |
if (AC) |
3404 |
cout << "AC "; |
3405 |
if (ND) |
3406 |
cout << "ND "; |
3407 |
if (S4) |
3408 |
cout << "S4 "; |
3409 |
if (ORB) |
3410 |
cout << "ORB "; |
3411 |
if (GP) |
3412 |
cout << "GP "; |
3413 |
cout << endl; |
3414 |
// cout<< "Set detector list --> "; |
3415 |
// if(TRK1)cout<<"TRK1 "; |
3416 |
// if(TRK2)cout<<"TRK2 "; |
3417 |
// if(TRKh)cout<<"TRKH "; |
3418 |
// if(CAL1)cout<<"CAL1 "; |
3419 |
// if(CAL2)cout<<"CAL2 "; |
3420 |
// if(TOF0)cout<<"TOF0 "; |
3421 |
// if(TOF)cout<<"TOF "; |
3422 |
// if(TRG)cout<<"TRG "; |
3423 |
// if(AC)cout<<"AC "; |
3424 |
// if(ND)cout<<"ND "; |
3425 |
// if(S4)cout<<"S4 "; |
3426 |
// if(ORB)cout<<"ORB "; |
3427 |
// cout << endl; |
3428 |
|
3429 |
} |
3430 |
; |
3431 |
|
3432 |
/** |
3433 |
* Set tree/branch detector flags from the content of a tree |
3434 |
*/ |
3435 |
void PamLevel2::GetWhichTrees(TFile* f) { |
3436 |
|
3437 |
// cout << "void PamLevel2::GetWhichTrees(TFile* f) --- WARNING!! --- ...potrebbe non funzionare "<<endl; |
3438 |
// ----------- |
3439 |
// reset flags |
3440 |
// ----------- |
3441 |
CAL1 = false; |
3442 |
CAL2 = false; |
3443 |
TRK2 = false; |
3444 |
TRK1 = false; |
3445 |
TRKh = false; |
3446 |
TRG = false; |
3447 |
TOF = false; |
3448 |
S4 = false; |
3449 |
ND = false; |
3450 |
AC = false; |
3451 |
ORB = false; |
3452 |
GP = false; |
3453 |
|
3454 |
RUN = false; |
3455 |
|
3456 |
// cout << "Checking file: "<<f->GetName()<<endl; |
3457 |
if (!f || f->IsZombie()) { |
3458 |
cout << "File: " << f->GetName() << " Non valid root file" << endl; |
3459 |
return; |
3460 |
} |
3461 |
|
3462 |
TList *lk = f->GetListOfKeys(); |
3463 |
if (!lk) |
3464 |
return; |
3465 |
TIter next(lk); |
3466 |
TKey *key = 0; |
3467 |
|
3468 |
Int_t nev = 0; |
3469 |
|
3470 |
while ((key = (TKey*) next())) { |
3471 |
|
3472 |
if (!strcmp(key->GetName(), "Run")) |
3473 |
RUN = true; |
3474 |
|
3475 |
//========================================================= |
3476 |
if (!strcmp(key->GetName(), "Trigger")) { |
3477 |
TRG = true; |
3478 |
Int_t nevt = ((TTree*) f->Get("Trigger"))->GetEntries(); |
3479 |
if (nev && nevt != nev) { |
3480 |
cout << "File: " << f->GetName() << " Trigger tree has " << nevt << " events instead of " << nev << endl; |
3481 |
TRG = false; |
3482 |
} |
3483 |
else |
3484 |
nev = nevt; |
3485 |
} |
3486 |
//========================================================= |
3487 |
if (!strcmp(key->GetName(), "ToF")) { |
3488 |
TOF = true; |
3489 |
Int_t nevt = ((TTree*) f->Get("ToF"))->GetEntries(); |
3490 |
if (nev && nevt != nev) { |
3491 |
cout << "File: " << f->GetName() << " ToF tree has " << nevt << " events instead of " << nev << endl; |
3492 |
TOF = false; |
3493 |
} |
3494 |
else |
3495 |
nev = nevt; |
3496 |
} |
3497 |
//========================================================= |
3498 |
if (!strcmp(key->GetName(), "S4")) { |
3499 |
S4 = true; |
3500 |
Int_t nevt = ((TTree*) f->Get("S4"))->GetEntries(); |
3501 |
if (nev && nevt != nev) { |
3502 |
cout << "File: " << f->GetName() << " S4 tree has " << nevt << " events instead of " << nev << endl; |
3503 |
S4 = false; |
3504 |
} |
3505 |
else |
3506 |
nev = nevt; |
3507 |
} |
3508 |
//========================================================= |
3509 |
|
3510 |
if (!strcmp(key->GetName(), "NeutronD")) { |
3511 |
ND = true; |
3512 |
Int_t nevt = ((TTree*) f->Get("NeutronD"))->GetEntries(); |
3513 |
if (nev && nevt != nev) { |
3514 |
cout << "File: " << f->GetName() << "NeutronD tree has " << nevt << " events instead of " << nev << endl; |
3515 |
ND = false; |
3516 |
} |
3517 |
else |
3518 |
nev = nevt; |
3519 |
} |
3520 |
//========================================================= |
3521 |
if (!strcmp(key->GetName(), "Anticounter")) { |
3522 |
AC = true; |
3523 |
Int_t nevt = ((TTree*) f->Get("Anticounter"))->GetEntries(); |
3524 |
if (nev && nevt != nev) { |
3525 |
cout << "File: " << f->GetName() << " Anticounter tree has " << nevt << " events instead of " << nev << endl; |
3526 |
AC = false; |
3527 |
} |
3528 |
else |
3529 |
nev = nevt; |
3530 |
} |
3531 |
//========================================================= |
3532 |
if (!strcmp(key->GetName(), "OrbitalInfo")) { |
3533 |
ORB = true; |
3534 |
Int_t nevt = ((TTree*) f->Get("OrbitalInfo"))->GetEntries(); |
3535 |
if (nev && nevt != nev) { |
3536 |
cout << "File: " << f->GetName() << " OrbitalInfo tree has " << nevt << " events instead of " << nev << endl; |
3537 |
ORB = false; |
3538 |
} |
3539 |
else |
3540 |
nev = nevt; |
3541 |
} |
3542 |
//========================================================= |
3543 |
if (!strcmp(key->GetName(), "Tracker")) { |
3544 |
TTree *T = (TTree*) f->Get("Tracker"); |
3545 |
for (Int_t i = 0; i < T->GetListOfBranches()->GetEntries(); i++) { |
3546 |
TString name = T->GetListOfBranches()->At(i)->GetName(); |
3547 |
if (!name.CompareTo("TrkLevel1")) |
3548 |
TRK1 = true; |
3549 |
if (!name.CompareTo("TrkLevel2")) |
3550 |
TRK2 = true; |
3551 |
if (!name.CompareTo("TrkHough")) |
3552 |
TRKh = true; |
3553 |
}; |
3554 |
Int_t nevt = T->GetEntries(); |
3555 |
if (nev && nevt != nev) { |
3556 |
cout << "File: " << f->GetName() << " Tracker tree has " << nevt << " events instead of " << nev << endl; |
3557 |
TRK1 = false; |
3558 |
TRK2 = false; |
3559 |
TRKh = false; |
3560 |
} |
3561 |
else |
3562 |
nev = nevt; |
3563 |
// T->Delete(); |
3564 |
}; |
3565 |
//========================================================= |
3566 |
if (!strcmp(key->GetName(), "Calorimeter")) { |
3567 |
TTree *T = (TTree*) f->Get("Calorimeter"); |
3568 |
for (Int_t i = 0; i < T->GetListOfBranches()->GetEntries(); i++) { |
3569 |
TString name = T->GetListOfBranches()->At(i)->GetName(); |
3570 |
if (!name.CompareTo("CaloLevel1")) |
3571 |
CAL1 = true; |
3572 |
if (!name.CompareTo("CaloLevel2")) |
3573 |
CAL2 = true; |
3574 |
}; |
3575 |
Int_t nevt = T->GetEntries(); |
3576 |
if (nev && nevt != nev) { |
3577 |
cout << "File: " << f->GetName() << " Calorimeter tree has " << nevt << " events instead of " << nev << endl; |
3578 |
CAL1 = false; |
3579 |
CAL2 = false; |
3580 |
} |
3581 |
else |
3582 |
nev = nevt; |
3583 |
// T->Delete(); |
3584 |
}; |
3585 |
//========================================================= |
3586 |
if (!strcmp(key->GetName(), "h20")) { |
3587 |
GP = true; |
3588 |
Int_t nevt = ((TTree*) f->Get("h20"))->GetEntries(); |
3589 |
if (nev && nevt != nev) { |
3590 |
cout << "File: " << f->GetName() << " h20 tree has " << nevt << " events instead of " << nev << endl; |
3591 |
GP = false; |
3592 |
} |
3593 |
else |
3594 |
nev = nevt; |
3595 |
} |
3596 |
|
3597 |
}; |
3598 |
|
3599 |
// delete lk; |
3600 |
|
3601 |
cout << "tree/branch list from file --> "; |
3602 |
if (TRK1) |
3603 |
cout << "TRK1 "; |
3604 |
if (TRK2) |
3605 |
cout << "TRK2 "; |
3606 |
if (TRKh) |
3607 |
cout << "TRKH "; |
3608 |
if (CAL1) |
3609 |
cout << "CAL1 "; |
3610 |
if (CAL2) |
3611 |
cout << "CAL2 "; |
3612 |
if (TOF) |
3613 |
cout << "TOF "; |
3614 |
if (TRG) |
3615 |
cout << "TRG "; |
3616 |
if (AC) |
3617 |
cout << "AC "; |
3618 |
if (ND) |
3619 |
cout << "ND "; |
3620 |
if (S4) |
3621 |
cout << "S4 "; |
3622 |
if (ORB) |
3623 |
cout << "ORB "; |
3624 |
if (GP) |
3625 |
cout << "GP "; |
3626 |
cout << endl; |
3627 |
|
3628 |
return; |
3629 |
|
3630 |
} |
3631 |
; |
3632 |
|
3633 |
//-------------------------------------- |
3634 |
// |
3635 |
// |
3636 |
//-------------------------------------- |
3637 |
/** |
3638 |
* Check if a file contains selected Pamela Level2 trees. |
3639 |
* @param name File name |
3640 |
* @return true if the file is ok. |
3641 |
*/ |
3642 |
Bool_t PamLevel2::CheckLevel2File(TString name) { |
3643 |
|
3644 |
Bool_t CAL1__ok = false; |
3645 |
Bool_t CAL2__ok = false; |
3646 |
Bool_t TRK2__ok = false; |
3647 |
Bool_t TRK1__ok = false; |
3648 |
Bool_t TRKh__ok = false; |
3649 |
Bool_t TRG__ok = false; |
3650 |
Bool_t TOF__ok = false; |
3651 |
Bool_t S4__ok = false; |
3652 |
Bool_t ND__ok = false; |
3653 |
Bool_t AC__ok = false; |
3654 |
Bool_t ORB__ok = false; |
3655 |
Bool_t GP__ok = false; |
3656 |
|
3657 |
Bool_t RUN__ok = false; |
3658 |
|
3659 |
Bool_t SELLI__ok = false; |
3660 |
|
3661 |
// cout << "Checking file: "<<name<<endl; |
3662 |
TFile *f = new TFile(name.Data()); |
3663 |
if (!f || f->IsZombie()) { |
3664 |
cout << "File: " << f->GetName() << " discarded ---- Non valid root file" << endl; |
3665 |
return false; |
3666 |
} |
3667 |
// cout << "Get list of keys: "<<f<<endl; |
3668 |
TList *lk = f->GetListOfKeys(); |
3669 |
// lk->Print(); |
3670 |
TIter next(lk); |
3671 |
TKey *key = 0; |
3672 |
|
3673 |
Int_t nev = 0; |
3674 |
|
3675 |
while ((key = (TKey*) next())) { |
3676 |
|
3677 |
// cout << key->GetName() << endl; |
3678 |
// cout << key->GetName() << ""<<key->GetClassName()<<endl; |
3679 |
// cout << " Get tree: " << f->Get(key->GetName())<<endl; |
3680 |
// nev_previous = nev; |
3681 |
// cout << " n.entries "<< nev <<endl; |
3682 |
// if( key->GetClassName()=="TTree" && nev_previous && nev != nev_previous ){ |
3683 |
// nev = ((TTree*)f->Get(key->GetName()))->GetEntries(); |
3684 |
// cout << "File: "<< f->GetName() <<" discarded ---- "<< key->GetName() << " tree: n.entries does not match "<<nev<<" "<<nev_previous<< endl; |
3685 |
// return false; |
3686 |
// }; |
3687 |
|
3688 |
//========================================================= |
3689 |
// check if the file |
3690 |
|
3691 |
|
3692 |
if (!strcmp(key->GetName(), "Run")) |
3693 |
RUN__ok = true; |
3694 |
|
3695 |
//========================================================= |
3696 |
if (!strcmp(key->GetName(), "SelectionList")) { |
3697 |
SELLI__ok = true; |
3698 |
if (SELLI == 1) { |
3699 |
Int_t nevt = ((TTree*) f->Get("SelectionList"))->GetEntries(); |
3700 |
if (nev && nevt != nev) { |
3701 |
cout << "File: " << f->GetName() << " discarded ---- SelectionList tree has " << nevt |
3702 |
<< " events instead of " << nev << endl; |
3703 |
return false; |
3704 |
} |
3705 |
nev = nevt; |
3706 |
} |
3707 |
} |
3708 |
|
3709 |
//========================================================= |
3710 |
if (!strcmp(key->GetName(), "Trigger")) { |
3711 |
TRG__ok = true; |
3712 |
if (TRG) { |
3713 |
Int_t nevt = ((TTree*) f->Get("Trigger"))->GetEntries(); |
3714 |
if (nev && nevt != nev) { |
3715 |
cout << "File: " << f->GetName() << " discarded ---- Trigger tree has " << nevt << " events instead of " |
3716 |
<< nev << endl; |
3717 |
return false; |
3718 |
} |
3719 |
nev = nevt; |
3720 |
} |
3721 |
} |
3722 |
//========================================================= |
3723 |
if (!strcmp(key->GetName(), "ToF")) { |
3724 |
TOF__ok = true; |
3725 |
if (TOF) { |
3726 |
Int_t nevt = ((TTree*) f->Get("ToF"))->GetEntries(); |
3727 |
if (nev && nevt != nev) { |
3728 |
cout << "File: " << f->GetName() << " discarded ---- ToF tree has " << nevt << " events instead of " << nev |
3729 |
<< endl; |
3730 |
return false; |
3731 |
} |
3732 |
nev = nevt; |
3733 |
} |
3734 |
} |
3735 |
//========================================================= |
3736 |
if (!strcmp(key->GetName(), "S4")) { |
3737 |
S4__ok = true; |
3738 |
if (S4) { |
3739 |
Int_t nevt = ((TTree*) f->Get("S4"))->GetEntries(); |
3740 |
if (nev && nevt != nev) { |
3741 |
cout << "File: " << f->GetName() << " discarded ---- S4 tree has " << nevt << " events instead of " << nev |
3742 |
<< endl; |
3743 |
return false; |
3744 |
} |
3745 |
nev = nevt; |
3746 |
} |
3747 |
} |
3748 |
//========================================================= |
3749 |
|
3750 |
if (!strcmp(key->GetName(), "NeutronD")) { |
3751 |
ND__ok = true; |
3752 |
if (ND) { |
3753 |
Int_t nevt = ((TTree*) f->Get("NeutronD"))->GetEntries(); |
3754 |
if (nev && nevt != nev) { |
3755 |
cout << "File: " << f->GetName() << " discarded ---- NeutronD tree has " << nevt << " events instead of " |
3756 |
<< nev << endl; |
3757 |
return false; |
3758 |
} |
3759 |
nev = nevt; |
3760 |
} |
3761 |
} |
3762 |
//========================================================= |
3763 |
if (!strcmp(key->GetName(), "Anticounter")) { |
3764 |
AC__ok = true; |
3765 |
if (AC) { |
3766 |
Int_t nevt = ((TTree*) f->Get("Anticounter"))->GetEntries(); |
3767 |
if (nev && nevt != nev) { |
3768 |
cout << "File: " << f->GetName() << " discarded ---- Anticounter tree has " << nevt << " events instead of " |
3769 |
<< nev << endl; |
3770 |
return false; |
3771 |
} |
3772 |
nev = nevt; |
3773 |
} |
3774 |
} |
3775 |
//========================================================= |
3776 |
if (!strcmp(key->GetName(), "OrbitalInfo")) { |
3777 |
ORB__ok = true; |
3778 |
if (ORB) { |
3779 |
Int_t nevt = ((TTree*) f->Get("OrbitalInfo"))->GetEntries(); |
3780 |
if (nev && nevt != nev) { |
3781 |
cout << "File: " << f->GetName() << " discarded ---- OrbitalInfo tree has " << nevt << " events instead of " |
3782 |
<< nev << endl; |
3783 |
return false; |
3784 |
} |
3785 |
nev = nevt; |
3786 |
} |
3787 |
} |
3788 |
//========================================================= |
3789 |
if (!strcmp(key->GetName(), "Tracker")) { |
3790 |
TTree *T = (TTree*) f->Get("Tracker"); |
3791 |
if (TRK1 || TRK2 || TRKh) { |
3792 |
Int_t nevt = T->GetEntries(); |
3793 |
if (nev && nevt != nev) { |
3794 |
cout << "File: " << f->GetName() << " discarded ---- Tracker tree has " << nevt << " events instead of " |
3795 |
<< nev << endl; |
3796 |
return false; |
3797 |
} |
3798 |
nev = nevt; |
3799 |
} |
3800 |
for (Int_t i = 0; i < T->GetListOfBranches()->GetEntries(); i++) { |
3801 |
TString name = T->GetListOfBranches()->At(i)->GetName(); |
3802 |
if (!name.CompareTo("TrkLevel1")) |
3803 |
TRK1__ok = true; |
3804 |
if (!name.CompareTo("TrkLevel2")) |
3805 |
TRK2__ok = true; |
3806 |
if (!name.CompareTo("TrkHough")) |
3807 |
TRKh__ok = true; |
3808 |
}; |
3809 |
T->Delete(); |
3810 |
}; |
3811 |
//========================================================= |
3812 |
if (!strcmp(key->GetName(), "Calorimeter")) { |
3813 |
TTree *T = (TTree*) f->Get("Calorimeter"); |
3814 |
if (CAL1 || CAL2) { |
3815 |
Int_t nevt = T->GetEntries(); |
3816 |
if (nev && nevt != nev) { |
3817 |
cout << "File: " << f->GetName() << " discarded ---- Calorimeter tree has " << nevt << " events instead of " |
3818 |
<< nev << endl; |
3819 |
return false; |
3820 |
} |
3821 |
nev = nevt; |
3822 |
} |
3823 |
for (Int_t i = 0; i < T->GetListOfBranches()->GetEntries(); i++) { |
3824 |
TString name = T->GetListOfBranches()->At(i)->GetName(); |
3825 |
if (!name.CompareTo("CaloLevel1")) |
3826 |
CAL1__ok = true; |
3827 |
if (!name.CompareTo("CaloLevel2")) |
3828 |
CAL2__ok = true; |
3829 |
}; |
3830 |
T->Delete(); |
3831 |
}; |
3832 |
//========================================================= |
3833 |
if (!strcmp(key->GetName(), "h20")) { |
3834 |
ISGP = true; |
3835 |
GP__ok = true; |
3836 |
if (GP) { |
3837 |
Int_t nevt = ((TTree*) f->Get("h20"))->GetEntries(); |
3838 |
if (nev && nevt != nev) { |
3839 |
cout << "File: " << f->GetName() << " discarded ---- h20 tree has " << nevt << " events instead of " << nev |
3840 |
<< endl; |
3841 |
return false; |
3842 |
} |
3843 |
nev = nevt; |
3844 |
} |
3845 |
} |
3846 |
|
3847 |
}; |
3848 |
|
3849 |
if (SELLI == -1) |
3850 |
SELLI = (Int_t) SELLI__ok; |
3851 |
if (SELLI == 0 && SELLI__ok) { |
3852 |
cout << "File: " << f->GetName() << " discarded ---- found SelectionList (it is not a full-event file)" << endl; |
3853 |
return false; |
3854 |
} |
3855 |
if (SELLI == 1 && !SELLI__ok) { |
3856 |
cout << "File: " << f->GetName() << " discarded ---- SelectionList missing" << endl; |
3857 |
return false; |
3858 |
} |
3859 |
|
3860 |
// cout << "SELLI "<<SELLI<<endl; |
3861 |
|
3862 |
// cout<< "CheckLevel2File(TString): detector list --> "; |
3863 |
// if(TRK1__ok)cout<<"TRK1 "; |
3864 |
// if(TRK2__ok)cout<<"TRK2 "; |
3865 |
// if(TRKh__ok)cout<<"TRKH "; |
3866 |
// if(CAL1__ok)cout<<"CAL1 "; |
3867 |
// if(CAL2__ok)cout<<"CAL2 "; |
3868 |
// if(TOF__ok)cout<<"TOF "; |
3869 |
// if(TRG__ok)cout<<"TRG "; |
3870 |
// if(AC__ok)cout<<"AC "; |
3871 |
// if(ND__ok)cout<<"ND "; |
3872 |
// if(S4__ok)cout<<"S4 "; |
3873 |
// if(ORB__ok)cout<<"ORB "; |
3874 |
// cout << endl; |
3875 |
|
3876 |
|
3877 |
if (TRK2 && TRK1__ok) |
3878 |
TRK1 = 1; |
3879 |
// ---------------------------------------------------------------------------- |
3880 |
// NOTA |
3881 |
// se c'e` il level1, lo devo necessarimente leggere. |
3882 |
// infatti (non ho capito perche`) i cluster vengono letti e allocati in memoria |
3883 |
// comunque, ma non vengono disallocati da PamLevel2::Clear() |
3884 |
// ---------------------------------------------------------------------------- |
3885 |
|
3886 |
|
3887 |
if (!RUN__ok) { |
3888 |
cout << "File: " << f->GetName() << " *WARNING* ---- Missing RunInfo tree (NB: RUN infos will not be updated)" |
3889 |
<< endl; |
3890 |
RUN = false; |
3891 |
}; |
3892 |
|
3893 |
if (CAL1 && !CAL1__ok) { |
3894 |
cout << "File: " << f->GetName() << " discarded ---- Missing CaloLevel1 branch" << endl; |
3895 |
return false; |
3896 |
}; |
3897 |
if (CAL2 && !CAL2__ok) { |
3898 |
cout << "File: " << f->GetName() << " discarded ---- Missing CaloLevel2 branch" << endl; |
3899 |
return false; |
3900 |
}; |
3901 |
if (TRK2 && !TRK2__ok) { |
3902 |
cout << "File: " << f->GetName() << " discarded ---- Missing TrkLevel2 branch" << endl; |
3903 |
return false; |
3904 |
}; |
3905 |
if (TRK1 && !TRK1__ok) { |
3906 |
cout << "File: " << f->GetName() << " discarded ---- Missing TrkLevel1 branch" << endl; |
3907 |
return false; |
3908 |
}; |
3909 |
if (TRKh && !TRKh__ok) { |
3910 |
cout << "File: " << f->GetName() << " discarded ---- Missing TrkHough branch" << endl; |
3911 |
return false; |
3912 |
}; |
3913 |
if (ORB && !ORB__ok) { |
3914 |
cout << "File: " << f->GetName() << " discarded ---- Missing ORB tree" << endl; |
3915 |
return false; |
3916 |
}; |
3917 |
if (AC && !AC__ok) { |
3918 |
cout << "File: " << f->GetName() << " discarded ---- Missing AC tree" << endl; |
3919 |
return false; |
3920 |
}; |
3921 |
if (S4 && !S4__ok) { |
3922 |
cout << "File: " << f->GetName() << " discarded ---- Missing S4 tree" << endl; |
3923 |
return false; |
3924 |
}; |
3925 |
if (TOF && !TOF__ok) { |
3926 |
cout << "File: " << f->GetName() << " discarded ---- Missing ToF tree" << endl; |
3927 |
return false; |
3928 |
}; |
3929 |
|
3930 |
if (ND && !ND__ok) { |
3931 |
cout << "File: " << f->GetName() << " discarded ---- Missing ND tree" << endl; |
3932 |
return false; |
3933 |
}; |
3934 |
if (TRG && !TRG__ok) { |
3935 |
cout << "File: " << f->GetName() << " discarded ---- Missing Trigger tree" << endl; |
3936 |
return false; |
3937 |
}; |
3938 |
if (GP && !GP__ok) { |
3939 |
cout << "File: " << f->GetName() << " discarded ---- Missing h20 tree" << endl; |
3940 |
return false; |
3941 |
}; |
3942 |
|
3943 |
// lk->Delete(); |
3944 |
// delete lk; |
3945 |
f->Close(); |
3946 |
|
3947 |
// cout<< "CheckLevel2File(TString): detector list --> "; |
3948 |
// if(TRK1)cout<<"TRK1 "; |
3949 |
// if(TRK2)cout<<"TRK2 "; |
3950 |
// if(TRKh)cout<<"TRKH "; |
3951 |
// if(CAL1)cout<<"CAL1 "; |
3952 |
// if(CAL2)cout<<"CAL2 "; |
3953 |
// if(TOF)cout<<"TOF "; |
3954 |
// if(TRG)cout<<"TRG "; |
3955 |
// if(AC)cout<<"AC "; |
3956 |
// if(ND)cout<<"ND "; |
3957 |
// if(S4)cout<<"S4 "; |
3958 |
// if(ORB)cout<<"ORB "; |
3959 |
// if(GP)cout<<"GP "; |
3960 |
// cout << endl; |
3961 |
|
3962 |
return true; |
3963 |
|
3964 |
} |
3965 |
; |
3966 |
|
3967 |
/** |
3968 |
* Create clone-trees |
3969 |
*/ |
3970 |
void PamLevel2::CreateCloneTrees0(TChain *fChain, TFile *ofile) { |
3971 |
|
3972 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
3973 |
cout << "Create clones of PAMELA trees " << endl; |
3974 |
|
3975 |
Int_t i = 0; |
3976 |
pam_tree_clone[i] = fChain->GetTree()->CloneTree(0); |
3977 |
TString name = pam_tree_clone[i]->GetName(); |
3978 |
name.Append("_clone"); |
3979 |
// pam_tree_clone[i]->SetName(name.Data()); |
3980 |
cout << pam_tree_clone[i]->GetName() << endl; |
3981 |
i++; |
3982 |
|
3983 |
TList *li = fChain->GetListOfFriends(); |
3984 |
TIter next(li); |
3985 |
TFriendElement* T_friend = 0; |
3986 |
ofile->cd(); |
3987 |
while ((T_friend = (TFriendElement*) next())) { |
3988 |
// cout<<T_friend->IsA()->GetName()<<" "<<T_friend->GetName()<<hex << T_friend->GetTree() << dec<<endl; |
3989 |
// cout<<T_friend->GetTree()->GetName()<< endl; |
3990 |
pam_tree_clone[i] = T_friend->GetTree()->CloneTree(0); |
3991 |
pam_tree_clone[i]->SetAutoSave(1000000); |
3992 |
name = pam_tree_clone[i]->GetName(); |
3993 |
name.Append("_clone"); |
3994 |
// pam_tree_clone[i]->SetName(name.Data()); |
3995 |
cout << pam_tree_clone[i]->GetName() << endl; |
3996 |
i++; |
3997 |
} |
3998 |
|
3999 |
delete li; |
4000 |
|
4001 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
4002 |
|
4003 |
} |
4004 |
|
4005 |
/** |
4006 |
* Create clone-trees |
4007 |
*/ |
4008 |
void PamLevel2::CreateCloneTrees(TFile *ofile) { |
4009 |
|
4010 |
// if the pointer is null, create a default file |
4011 |
if (!run_tree) |
4012 |
return; |
4013 |
|
4014 |
if (!ofile) { |
4015 |
cout << "void PamLevel2::CreateCloneTrees(TFile*) -- WARNING -- Creating file: clone-tree.root " << endl; |
4016 |
ofile = new TFile("clone-tree.root", "recreate"); |
4017 |
} |
4018 |
|
4019 |
ofile->cd(); |
4020 |
|
4021 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
4022 |
cout << "Create new PAMELA trees " << endl; |
4023 |
|
4024 |
run_tree_clone = new TTree("Run", "PAMELA Level2 data from the GL_RUN table "); |
4025 |
run_tree_clone->Branch("RunInfo", "GL_RUN", GetPointerTo("RunInfo")); |
4026 |
cout << "Run : branch RunInfo" << endl; |
4027 |
run_tree_clone->Branch("SoftInfo", "SoftInfo", GetPointerTo("SoftInfo")); |
4028 |
cout << "Run : branch SoftInfo" << endl; |
4029 |
// ------------------ |
4030 |
// replicate run tree |
4031 |
// ------------------ |
4032 |
// cout << "----------------------------------------------------"<<endl; |
4033 |
// cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl; |
4034 |
for (Int_t i = 0; i < run_tree->GetEntries(); i++) { |
4035 |
run_tree->GetEntry(i); |
4036 |
// cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl; |
4037 |
run_tree_clone->Fill(); |
4038 |
} |
4039 |
cout << "----------------------------------------------------" << endl; |
4040 |
|
4041 |
// ------------------------------------ |
4042 |
// add branch with dead and live times |
4043 |
// ------------------------------------ |
4044 |
if (SELLI != 2) { // EMILIANO |
4045 |
run_tree_clone->Branch("DeadLiveTime", totdltime, "dltime[3]/l"); |
4046 |
cout << "Run : branch DeadLiveTime" << endl; |
4047 |
|
4048 |
sel_tree_clone = new TTree("SelectionList", "List of selected events "); |
4049 |
// sel_tree_clone->Branch("RunEntry",&irun,"runentry/L"); |
4050 |
sel_tree_clone->Branch("RunEntry", &irunt, "runentry/L");//NEWNEW |
4051 |
sel_tree_clone->Branch("EventEntry", &irunentry, "eventry/L"); |
4052 |
}; |
4053 |
|
4054 |
Int_t i = 0; |
4055 |
if (TRK1 || TRK2 || TRKh) { |
4056 |
pam_tree_clone[i] = new TTree("Tracker", "PAMELA tracker level2 data "); |
4057 |
if (TRK1) { |
4058 |
pam_tree_clone[i]->Branch("TrkLevel1", "TrkLevel1", GetPointerTo("TrkLevel1")); |
4059 |
pam_tree_clone[i]->BranchRef(); |
4060 |
cout << "Tracker : branch TrkLevel1" << endl; |
4061 |
// cout << "CreateCloneTrees " << GetTrkLevel1()<<endl; |
4062 |
}; |
4063 |
if (TRK2) { |
4064 |
pam_tree_clone[i]->Branch("TrkLevel2", "TrkLevel2", GetPointerTo("TrkLevel2")); |
4065 |
cout << "Tracker : branch TrkLevel2" << endl; |
4066 |
}; |
4067 |
if (TRKh) { |
4068 |
pam_tree_clone[i]->Branch("TrkHough", "TrkHough", GetPointerTo("TrkHough")); |
4069 |
cout << "Tracker : branch TrkHough" << endl; |
4070 |
}; |
4071 |
i++; |
4072 |
} |
4073 |
|
4074 |
// Calorimeter |
4075 |
if (CAL1 || CAL2) { |
4076 |
pam_tree_clone[i] = new TTree("Calorimeter", "PAMELA calorimeter level2 data "); |
4077 |
if (CAL1) { |
4078 |
pam_tree_clone[i]->Branch("CaloLevel1", "CaloLevel1", GetPointerTo("CaloLevel1")); |
4079 |
cout << "Calorimeter : branch CaloLevel1" << endl; |
4080 |
}; |
4081 |
if (CAL2) { |
4082 |
pam_tree_clone[i]->Branch("CaloLevel2", "CaloLevel2", GetPointerTo("CaloLevel2")); |
4083 |
cout << "Calorimeter : branch CaloLevel2" << endl; |
4084 |
}; |
4085 |
i++; |
4086 |
} |
4087 |
|
4088 |
// ToF |
4089 |
if (TOF) { |
4090 |
pam_tree_clone[i] = new TTree("ToF", "PAMELA ToF level2 data "); |
4091 |
pam_tree_clone[i]->Branch("ToFLevel2", "ToFLevel2", GetPointerTo("ToFLevel2")); |
4092 |
cout << "ToF : branch ToFLevel2" << endl; |
4093 |
i++; |
4094 |
}; |
4095 |
// Trigger |
4096 |
if (TRG) { |
4097 |
pam_tree_clone[i] = new TTree("Trigger", "PAMELA trigger level2 data "); |
4098 |
pam_tree_clone[i]->Branch("TrigLevel2", "TrigLevel2", GetPointerTo("TrigLevel2")); |
4099 |
cout << "Trigger : branch TrigLevel2" << endl; |
4100 |
i++; |
4101 |
}; |
4102 |
// S4 |
4103 |
if (S4) { |
4104 |
pam_tree_clone[i] = new TTree("S4", "PAMELA S4 level2 data "); |
4105 |
pam_tree_clone[i]->Branch("S4Level2", "S4Level2", GetPointerTo("S4Level2")); |
4106 |
cout << "S4 : branch S4Level2" << endl; |
4107 |
i++; |
4108 |
}; |
4109 |
// Neutron Detector |
4110 |
if (ND) { |
4111 |
pam_tree_clone[i] = new TTree("NeutronD", "PAMELA neutron detector level2 data "); |
4112 |
pam_tree_clone[i]->Branch("NDLevel2", "NDLevel2", GetPointerTo("NDLevel2")); |
4113 |
cout << "NeutronD : branch NDLevel2" << endl; |
4114 |
i++; |
4115 |
}; |
4116 |
// Anticounters |
4117 |
if (AC) { |
4118 |
pam_tree_clone[i] = new TTree("Anticounter", "PAMELA anticounter detector level2 data "); |
4119 |
pam_tree_clone[i]->Branch("AcLevel2", "AcLevel2", GetPointerTo("AcLevel2")); |
4120 |
cout << "Anticounter : branch AcLevel2" << endl; |
4121 |
i++; |
4122 |
}; |
4123 |
// OrbitalInfo |
4124 |
if (ORB) { |
4125 |
pam_tree_clone[i] = new TTree("OrbitalInfo", "PAMELA orbital info "); |
4126 |
pam_tree_clone[i]->Branch("OrbitalInfo", "OrbitalInfo", GetPointerTo("OrbitalInfo")); |
4127 |
cout << "OrbitalInfo : branch OrbitalInfo" << endl; |
4128 |
i++; |
4129 |
}; |
4130 |
// GPamela |
4131 |
if (GP) { |
4132 |
pam_tree_clone[i] = new TTree("h20", "GPAMELA info "); |
4133 |
pam_tree_clone[i]->Branch("GPamela", "GPamela", GetPointerTo("GPamela"), 32000, 1);//split |
4134 |
cout << "GPamela : branch GPamela" << endl; |
4135 |
i++; |
4136 |
}; |
4137 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
4138 |
|
4139 |
} |
4140 |
|
4141 |
/** |
4142 |
* Fill tree (created with CreateCloneTrees) |
4143 |
* |
4144 |
*/ |
4145 |
//void PamLevel2::FillNewPamTree(TTree *T){ |
4146 |
void PamLevel2::FillCloneTrees() { |
4147 |
|
4148 |
// cout << "PamLevel2::FillCloneTrees()" << irunentry << endl; |
4149 |
|
4150 |
for (Int_t i = 0; i < NCLONES; i++) { |
4151 |
if (pam_tree_clone[i]) |
4152 |
pam_tree_clone[i]->Fill(); |
4153 |
} |
4154 |
if (sel_tree_clone) |
4155 |
sel_tree_clone->Fill(); |
4156 |
|
4157 |
} |
4158 |
|
4159 |
TTree* PamLevel2::GetCloneTree(TString name) { |
4160 |
|
4161 |
for (Int_t i = 0; i < NCLONES; i++) { |
4162 |
if (pam_tree_clone[i]) { |
4163 |
TString na = pam_tree_clone[i]->GetName(); |
4164 |
if (!name.CompareTo(na)) |
4165 |
return pam_tree_clone[i]; |
4166 |
}; |
4167 |
} |
4168 |
if (run_tree_clone) { |
4169 |
TString na = run_tree_clone->GetName(); |
4170 |
if (!name.CompareTo(na)) |
4171 |
return run_tree_clone; |
4172 |
} |
4173 |
if (sel_tree_clone) { |
4174 |
TString na = sel_tree_clone->GetName(); |
4175 |
if (!name.CompareTo(na)) |
4176 |
return sel_tree_clone; |
4177 |
} |
4178 |
return NULL; |
4179 |
|
4180 |
} |
4181 |
void PamLevel2::WriteCloneTrees() { |
4182 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
4183 |
cout << "Write clones of PAMELA trees " << endl; |
4184 |
cout << run_tree_clone->GetName() << endl; |
4185 |
if (SELLI != 2) {// Emiliano |
4186 |
if (run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries()) |
4187 |
run_tree_clone->GetBranch("DeadLiveTime")->Fill(); |
4188 |
}; |
4189 |
run_tree_clone->Write(); |
4190 |
if (SELLI != 2) { //Emiliano |
4191 |
cout << sel_tree_clone->GetName() << endl; |
4192 |
sel_tree_clone->Write(); |
4193 |
}; |
4194 |
for (Int_t i = 0; i < NCLONES; i++) { |
4195 |
if (pam_tree_clone[i]) { |
4196 |
cout << pam_tree_clone[i]->GetName() << endl; |
4197 |
pam_tree_clone[i]->Write(); |
4198 |
}; |
4199 |
} |
4200 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" << endl; |
4201 |
|
4202 |
} |
4203 |
|
4204 |
/** |
4205 |
* Method to get level2-trees entry, the corresponding run entry and (if required) the level0 entry. |
4206 |
*/ |
4207 |
//Int_t PamLevel2::GetEntry(Int_t iee){ |
4208 |
Int_t PamLevel2::GetEntry(Long64_t iee) { |
4209 |
|
4210 |
// cout << "-------------------------------------"<<endl; |
4211 |
// cout << "Int_t PamLevel2::GetEntry("<<iee<<")"<<endl; |
4212 |
|
4213 |
if (!pam_tree) { |
4214 |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- level2 trees not loaded" << endl; |
4215 |
return 0; |
4216 |
} |
4217 |
|
4218 |
// |
4219 |
// This is a sort of bug: if you don't have the run tree you don't want to exit here you want to have loaded the event anyway... |
4220 |
// |
4221 |
// if(!run_tree ){ |
4222 |
// cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loeaded"<<endl; |
4223 |
// return 0; |
4224 |
// } |
4225 |
|
4226 |
Long64_t ii = 0; |
4227 |
//------------------------------- |
4228 |
ii = iee; |
4229 |
if (!pam_tree->GetEntry(ii)) { |
4230 |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading pam tree" << endl; |
4231 |
return 0; |
4232 |
} |
4233 |
// |
4234 |
// ... 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. |
4235 |
// 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 |
4236 |
// a problem if you don't check the return code of getentry. |
4237 |
// |
4238 |
if (!RUN || !run_tree) { |
4239 |
if (TRK0 || CAL0 || TOF0 || RUN) { //forse cosi` va bene per tornare 1? |
4240 |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded" << endl; |
4241 |
return 0; |
4242 |
} |
4243 |
else { |
4244 |
return 1; //cosi` se non c'e` run esce qua... |
4245 |
} |
4246 |
} |
4247 |
|
4248 |
//------------------------------- |
4249 |
ii = iee; |
4250 |
// Bool_t UPDATED = UpdateRunInfo(run_tree,ii); |
4251 |
// Bool_t UPDATED = UpdateRunInfo(ii); |
4252 |
if ( fUpdateRunInfo ) UpdateRunInfo(ii); // Emiliano |
4253 |
if (SELLI == 0 || SELLI == 2) |
4254 |
irunentry = iee - runfirstentry; |
4255 |
// if(UPDATED && run_tree_clone)run_tree_clone->Fill(); |
4256 |
|
4257 |
// cout << "PamLevel2::GetEntry("<<iee<<") "<<irun<<" "<<runfirstentry<<" "<<irunentry<<endl; |
4258 |
|
4259 |
// cout << "irunentry "<<irunentry << endl; |
4260 |
// cout << "runfirstentry "<<runfirstentry << endl; |
4261 |
// cout << "nevents "<<GetRunInfo()->NEVENTS<< endl; |
4262 |
|
4263 |
// if( TRK0 || CAL0 || TOF0 ){ |
4264 |
// if( !GetYodaEntry( ) ){ |
4265 |
// cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading level0 tree"<<endl; |
4266 |
// return 0; |
4267 |
// } |
4268 |
// } |
4269 |
|
4270 |
|
4271 |
return 1; |
4272 |
|
4273 |
} |
4274 |
|
4275 |
TrkLevel0 *PamLevel2::GetTrkLevel0() { |
4276 |
if (!TRK0) |
4277 |
return NULL; |
4278 |
if (!GetYodaEntry()) { |
4279 |
cout << " Int_t PamLevel2::GetTrkLevel0() -- ERROR -- error reading level0 tree" << endl; |
4280 |
return 0; |
4281 |
} |
4282 |
return trk0_obj; |
4283 |
} |
4284 |
; |
4285 |
CaloLevel0 *PamLevel2::GetCaloLevel0() { |
4286 |
if (!CAL0) |
4287 |
return NULL; |
4288 |
if (!GetYodaEntry()) { |
4289 |
cout << " Int_t PamLevel2::GetCaloLevel0() -- ERROR -- error reading level0 tree" << endl; |
4290 |
return 0; |
4291 |
} |
4292 |
return calo0_obj; |
4293 |
} |
4294 |
; |
4295 |
|
4296 |
/** |
4297 |
* Method to retrieve the level0 tree (YODA tree) that contains the current event. |
4298 |
* Given the run ID (...), if needed it query the DB and load the proper file. |
4299 |
* @return Pointer to the tree |
4300 |
*/ |
4301 |
|
4302 |
TTree* PamLevel2::GetYodaTree() { |
4303 |
|
4304 |
// cout << "TTree* PamLevel2::GetYodaTree( )"<<endl; |
4305 |
//=================================== |
4306 |
// check if iroot has changed |
4307 |
//=================================== |
4308 |
if (irun < 0) { |
4309 |
cout << "PamLevel2::GetYodaTree() -- ERROR -- irun = " << irun << endl; |
4310 |
// cout << "In order to use this method you have to first load the RunInfo tree "<<endl; |
4311 |
return NULL; |
4312 |
} |
4313 |
Int_t irootnew = run_obj->ID_ROOT_L0; |
4314 |
// cout << "iroot "<<iroot<<endl; |
4315 |
// cout << "irootnew "<<irootnew<<endl; |
4316 |
|
4317 |
//=================================== |
4318 |
// load the level0 file |
4319 |
// (if not already loaded) |
4320 |
//=================================== |
4321 |
if (iroot != irootnew || !l0_tree) { |
4322 |
iroot = irootnew; |
4323 |
//=================================== |
4324 |
// open the DB connection |
4325 |
// (if not already opened) |
4326 |
//=================================== |
4327 |
if (!dbc || (dbc && !dbc->IsConnected())) |
4328 |
SetDBConnection(); |
4329 |
GL_ROOT glroot = GL_ROOT(); |
4330 |
if (glroot.Query_GL_ROOT(iroot, dbc)) { |
4331 |
cout << "TTree* PamLevel2::GetYodaTree( ) -- ERROR -- level0 file iroot = " << iroot << " does not exists" |
4332 |
<< endl; |
4333 |
return NULL; |
4334 |
}; |
4335 |
TString filename = glroot.PATH + glroot.NAME; |
4336 |
if (l0_file) { |
4337 |
l0_file->Close(); |
4338 |
l0_file->Delete(); |
4339 |
} |
4340 |
cout << "Opening LEVEL0 file: " << filename << endl; |
4341 |
FileStat_t t; |
4342 |
if (gSystem->GetPathInfo(filename.Data(), t)) { |
4343 |
cout << " PamLevel2::GetYodaTree() -- ERROR opening file " << endl; |
4344 |
return NULL; |
4345 |
} |
4346 |
l0_file = new TFile(filename); |
4347 |
if (!l0_file) |
4348 |
return NULL; |
4349 |
l0_tree = (TTree*) l0_file->Get("Physics"); |
4350 |
if (!h0_obj) |
4351 |
h0_obj = new EventHeader(); |
4352 |
l0_tree->SetBranchAddress("Header", &h0_obj); |
4353 |
prevshift = 0; |
4354 |
//--------------------------------------------------- |
4355 |
// TRACKER: |
4356 |
if (TRK0) { |
4357 |
if (!trk0_obj) { |
4358 |
trk0_obj = new TrkLevel0(); |
4359 |
trk0_obj->Set(); |
4360 |
}; |
4361 |
l0_tree->SetBranchAddress("Tracker", trk0_obj->GetPointerToTrackerEvent()); |
4362 |
} |
4363 |
//-------------------------------------------------- |
4364 |
// CALORIMETER: |
4365 |
if (CAL0) { |
4366 |
if (!calo0_obj) { |
4367 |
calo0_obj = new CaloLevel0(); |
4368 |
calo0_obj->Set(); |
4369 |
}; |
4370 |
l0_tree->SetBranchAddress("Calorimeter", calo0_obj->GetPointerToCalorimeterEvent()); |
4371 |
// cout << "PamLevel2::GetYodaTree() --- level0 calorimeter not implemented "<<endl; |
4372 |
} |
4373 |
//--------------------------------------------------- |
4374 |
// TOF: |
4375 |
if (TOF0) { |
4376 |
cout << "PamLevel2::GetYodaTree() --- level0 TOF not implemented " << endl; |
4377 |
} |
4378 |
|
4379 |
dbc->Close(); // EMILIANO, do not leave open connections, open only when needed |
4380 |
delete dbc; |
4381 |
dbc=0; |
4382 |
|
4383 |
}; |
4384 |
|
4385 |
// if(!dbc || (dbc && !dbc->IsConnected())){ |
4386 |
// cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
4387 |
// } |
4388 |
|
4389 |
if (TRK0) { |
4390 |
// TrkParams::Load(6); |
4391 |
// if( !TrkParams::IsLoaded(6) ){ |
4392 |
// cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- VK-mask not loaded"<<endl; |
4393 |
// }; |
4394 |
if(!dbc || (dbc && !dbc->IsConnected()))SetDBConnection(); // PERCHE` ERA COMMENTATA QUESTA RIGA? |
4395 |
TrkParams::SetCalib(run_obj, dbc); |
4396 |
TrkParams::LoadCalib(); |
4397 |
if (!TrkParams::CalibIsLoaded()) { |
4398 |
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- Calibration not loaded" << endl; |
4399 |
}; |
4400 |
if(dbc){ |
4401 |
dbc->Close(); // EMILIANO, do not leave open connections, open only when needed |
4402 |
delete dbc; |
4403 |
dbc=0; |
4404 |
}; |
4405 |
} |
4406 |
|
4407 |
// cout << l0_tree << endl; |
4408 |
return l0_tree; |
4409 |
|
4410 |
} |
4411 |
|
4412 |
/** |
4413 |
* Method to retrieve the level0 tree (YODA tree) that contains the current event. |
4414 |
*/ |
4415 |
Int_t PamLevel2::GetYodaEntry() { |
4416 |
|
4417 |
// cout << "Int_t PamLevel2::GetYodaEntry()"<<endl; |
4418 |
if (!GetYodaTree()) |
4419 |
return 0; |
4420 |
|
4421 |
// patch |
4422 |
if (irunentry < 0) { |
4423 |
// cout << "Int_t PamLevel2::GetYodaEntry() -- ATTENZIONE -- irunentry negativo?!?! "<<(Int_t)irunentry<<endl; |
4424 |
irunentry = 0LL; |
4425 |
} |
4426 |
// --------------------------------- |
4427 |
// if file is NOT a preselected file |
4428 |
// --------------------------------- |
4429 |
Long64_t quellagiusta = irunentry + (Long64_t)(run_obj->EV_FROM); |
4430 |
// cout << " irunentry "<<irunentry<<endl; |
4431 |
// cout << " EV_FROM "<<run_obj->EV_FROM<<endl; |
4432 |
// cout << " quellagiusta = irunentry + EV_FROM "<< quellagiusta << endl; |
4433 |
|
4434 |
// cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl; |
4435 |
// cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl; |
4436 |
// cout << " time "<< abstime << endl; |
4437 |
// cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl; |
4438 |
|
4439 |
ULong64_t obt = 0; |
4440 |
ULong64_t pktn = 0; |
4441 |
if (GetOrbitalInfo()) { |
4442 |
obt = GetOrbitalInfo()->OBT; |
4443 |
pktn = GetOrbitalInfo()->pkt_num; |
4444 |
} |
4445 |
|
4446 |
if (!GetOrbitalInfo() && !ISGP) { |
4447 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo " << endl; |
4448 |
return 0; |
4449 |
} |
4450 |
if (obt == 0 && pktn == 0 && !ISGP) { |
4451 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? " << endl; |
4452 |
return 0; |
4453 |
} |
4454 |
|
4455 |
// --------------------------------------------------------------------- |
4456 |
// ATTENTION!!! |
4457 |
// If data are not pre-processed with cleaner, the level0 tree may contain |
4458 |
// spurious nested physics packets. |
4459 |
// The GL_RUN variables EV_FROM, EV_TO and NEVENTS counts also these entries |
4460 |
// while level2 tree DOES NOT!! |
4461 |
// This means that "quellagiusta" in these cases is not correct. |
4462 |
// In order to retrieve the correct level0 event, I implemented a check |
4463 |
// of the OBT and pkt-number. In case of mismatch, the level0 entry number |
4464 |
// is shift forward until when the packets match. |
4465 |
// --------------------------------------------------------------------- |
4466 |
Int_t answer = 0; |
4467 |
Int_t shift = 0; |
4468 |
// printf(" siamo qui %i %i \n",shift,prevshift); |
4469 |
// Int_t maxshift = 50; // EMILIANO |
4470 |
do { |
4471 |
if (shift > 0) { |
4472 |
cout << " PKTNUM L2 --- " << pktn << " --- L0 --- " << GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
4473 |
if (DBG) |
4474 |
cout << " RUN: ID " << GetRunInfo()->ID << " ID_ROOT_L0 " << run_obj->ID_ROOT_L0 << " ID_RUN_FRAG " |
4475 |
<< GetRunInfo()->ID_RUN_FRAG << " EV_FROM " << GetRunInfo()->EV_FROM << endl; |
4476 |
if (DBG) |
4477 |
cout << " L2 <--> L0 mismatch ( irun " << irun << " irunentry " << irunentry << " shift " << shift |
4478 |
<< " prevshift " << prevshift << " )" << endl; |
4479 |
} |
4480 |
answer = l0_tree->GetEntry(quellagiusta + (Long64_t) shift + (Long64_t) prevshift); |
4481 |
shift++; |
4482 |
if (!GetEventHeader()) { |
4483 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader " << endl; |
4484 |
return 0; |
4485 |
} |
4486 |
|
4487 |
if (ISGP) { |
4488 |
obt = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()); //BARBATRUCCO |
4489 |
pktn = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter()); //BARBATRUCCO |
4490 |
} |
4491 |
|
4492 |
// cout << "PKTNUM "<<shift<<" == L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
4493 |
// cout << " L2 --- "<< obt << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl; |
4494 |
// if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl; |
4495 |
// cout << " obt "<< obt << endl; |
4496 |
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
4497 |
// cout << " pktn "<< pktn << endl; |
4498 |
// cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
4499 |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
4500 |
// |
4501 |
if (prevshift != 0 && (quellagiusta + (Long64_t) shift) == GetYodaTree()->GetEntries()) { |
4502 |
prevshift = 0; |
4503 |
shift = -1; |
4504 |
}; |
4505 |
|
4506 |
} while ((obt != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || pktn != (UInt_t)( |
4507 |
GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta + (Long64_t) shift) |
4508 |
< GetYodaTree()->GetEntries() && shift < maxshift); |
4509 |
|
4510 |
if ((quellagiusta + (Long64_t) shift + (Long64_t) prevshift) > GetYodaTree()->GetEntries() || shift == maxshift) { |
4511 |
cout << " Big trouble here, no such event in Level0 data! (NB maxshift set to " << maxshift << " )" << endl; |
4512 |
return 0; |
4513 |
} |
4514 |
// cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl; |
4515 |
// return GetYodaTree()->GetEntry(quellagiusta); |
4516 |
if (shift > 1) |
4517 |
prevshift += (shift - 1); |
4518 |
|
4519 |
return answer; |
4520 |
|
4521 |
} |
4522 |
/** |
4523 |
* \Brief Set DB connection |
4524 |
*/ |
4525 |
Bool_t PamLevel2::SetDBConnection() { |
4526 |
|
4527 |
// cout << "PamLevel2::SetDBConnection()" << endl; |
4528 |
if (DBG) { |
4529 |
cout << "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~" << endl; |
4530 |
cout << "Connecting to DB" << endl; |
4531 |
cout << "HOST " << host << endl; |
4532 |
cout << "USER " << user << endl; |
4533 |
cout << "PSW " << psw << endl; |
4534 |
} |
4535 |
Bool_t notconn = true; |
4536 |
Int_t trials = 0; |
4537 |
while ( notconn && trials < 10 ){ |
4538 |
// gSystem->Sleep(500); |
4539 |
dbc = TSQLServer::Connect(host.Data(), user.Data(), psw.Data()); |
4540 |
//dbc->Connect(host.Data(), user.Data(), psw.Data()); |
4541 |
if ( dbc ) notconn = false; |
4542 |
if (DBG) printf("<%i> test connection...\n ",trials); |
4543 |
if (!dbc){ |
4544 |
if (DBG) printf(" :( failed, no pointer \n"); |
4545 |
notconn = true; |
4546 |
// return false; |
4547 |
}; |
4548 |
if (dbc && !dbc->IsConnected()){ |
4549 |
if (DBG) printf(" :( failed, no connection \n"); |
4550 |
notconn = true; |
4551 |
// return false; |
4552 |
}; |
4553 |
trials++; |
4554 |
}; |
4555 |
if ( notconn ) return false; |
4556 |
// |
4557 |
if (DBG) printf("=connected!\n"); |
4558 |
stringstream myquery; // EMILIANO |
4559 |
myquery.str(""); // EMILIANO |
4560 |
myquery << "SET time_zone='+0:00'"; // EMILIANO |
4561 |
dbc->Query(myquery.str().c_str()); // EMILIANO |
4562 |
if ( DBG ) printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n"); |
4563 |
return true; |
4564 |
|
4565 |
} |
4566 |
|
4567 |
/** |
4568 |
* \Brief Add a friend to the pamela chain. |
4569 |
* @param cname name of the chain to be added |
4570 |
*/ |
4571 |
|
4572 |
TChain* PamLevel2::AddFriend(TString cname) { |
4573 |
|
4574 |
if (!GetPamTree()) { |
4575 |
cout << " TChain* PamLevel2::AddFriend(TString cname) --- a pamela tree must be created first" << endl; |
4576 |
return NULL; |
4577 |
} |
4578 |
|
4579 |
TChain *c = new TChain(cname.Data()); |
4580 |
|
4581 |
TIter next(GetPamTree()->GetListOfFiles()); |
4582 |
Int_t nf = 0; |
4583 |
TChainElement* element = 0; |
4584 |
while ((element = (TChainElement*) next())) { |
4585 |
c->Add(element->GetTitle()); |
4586 |
nf++; |
4587 |
} |
4588 |
|
4589 |
GetPamTree()->AddFriend(cname.Data()); |
4590 |
|
4591 |
cout << "external chain created and added to pamela friends :" << cname << endl; |
4592 |
cout << "n.files " << nf << endl; |
4593 |
|
4594 |
return c; |
4595 |
|
4596 |
} |
4597 |
|
4598 |
/** |
4599 |
* Returns the current read entry. This method simply returns the result of the call to |
4600 |
* pam_tree->GetReadEntry(), so it is entirely handled by ROOT. |
4601 |
*/ |
4602 |
Long64_t PamLevel2::GetReadEntry() { |
4603 |
return pam_tree->GetReadEntry(); |
4604 |
} |
4605 |
|
4606 |
/** |
4607 |
* Sets the sorting method. If the new method is different from the previous, the issorted |
4608 |
* flag is set to false, forcing a new sort the next time GetTrack is called. |
4609 |
* @see GetTrack |
4610 |
*/ |
4611 |
void PamLevel2::SetSortingMethod(TString how) { |
4612 |
if (howtosort != how) { |
4613 |
issorted = false; |
4614 |
} |
4615 |
howtosort = how; |
4616 |
} |