1 |
#include <PamLevel2.h> |
#include <PamLevel2.h> |
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
///////////////////////////////////////////////////////////////////////////// |
6 |
|
///////////////////////////////////////////////////////////////////////////// |
7 |
|
///////////////////////////////////////////////////////////////////////////// |
8 |
|
///////////////////////////////////////////////////////////////////////////// |
9 |
|
|
10 |
|
void GPamela::Clear(){ |
11 |
|
Irun = 0; |
12 |
|
Ievnt = 0; |
13 |
|
Ipa = 0; |
14 |
|
X0 = 0.; |
15 |
|
Y0 = 0.; |
16 |
|
Z0 = 0.; |
17 |
|
Theta = 0.; |
18 |
|
Phi = 0.; |
19 |
|
P0 = 0.; |
20 |
|
Nthtof = 0; |
21 |
|
Nthcat = 0; |
22 |
|
Nthcas = 0; |
23 |
|
Nthspe = 0; |
24 |
|
Nstrpx = 0; |
25 |
|
Nstrpy = 0; |
26 |
|
Nthcali = 0; |
27 |
|
Nthcal = 0; |
28 |
|
Nthnd = 0; |
29 |
|
Nthcard = 0; |
30 |
|
} |
31 |
|
|
32 |
|
void GPamela::Delete(){ |
33 |
|
|
34 |
|
Clear(); |
35 |
|
|
36 |
|
delete [] Ipltof; |
37 |
|
delete [] Ipaddle; |
38 |
|
delete [] Ipartof; |
39 |
|
delete [] Xintof; |
40 |
|
delete [] Yintof; |
41 |
|
delete [] Zintof; |
42 |
|
delete [] Xouttof; |
43 |
|
delete [] Youttof; |
44 |
|
delete [] Zouttof; |
45 |
|
delete [] Ereltof; |
46 |
|
delete [] Timetof; |
47 |
|
delete [] Pathtof; |
48 |
|
delete [] P0tof; |
49 |
|
delete [] Iparcat; |
50 |
|
delete [] Icat; |
51 |
|
delete [] Xincat; |
52 |
|
delete [] Yincat; |
53 |
|
delete [] Zincat; |
54 |
|
delete [] Xoutcat; |
55 |
|
delete [] Youtcat; |
56 |
|
delete [] Zoutcat; |
57 |
|
delete [] Erelcat; |
58 |
|
delete [] Timecat; |
59 |
|
delete [] Pathcat; |
60 |
|
delete [] P0cat; |
61 |
|
delete [] Iparcas; |
62 |
|
delete [] Icas; |
63 |
|
delete [] Xincas; |
64 |
|
delete [] Yincas; |
65 |
|
delete [] Zincas; |
66 |
|
delete [] Xoutcas; |
67 |
|
delete [] Youtcas; |
68 |
|
delete [] Zoutcas; |
69 |
|
delete [] Erelcas; |
70 |
|
delete [] Timecas; |
71 |
|
delete [] Pathcas; |
72 |
|
delete [] P0cas; |
73 |
|
delete [] Iparspe; |
74 |
|
delete [] Itrpb; |
75 |
|
delete [] Itrsl; |
76 |
|
delete [] Itspa; |
77 |
|
delete [] Xinspe; |
78 |
|
delete [] Yinspe; |
79 |
|
delete [] Zinspe; |
80 |
|
delete [] Xoutspe; |
81 |
|
delete [] Youtspe; |
82 |
|
delete [] Zoutspe; |
83 |
|
delete [] Xavspe; |
84 |
|
delete [] Yavspe; |
85 |
|
delete [] Zavspe; |
86 |
|
delete [] Erelspe; |
87 |
|
delete [] Pathspe; |
88 |
|
delete [] P0spe; |
89 |
|
delete [] Nxmult; |
90 |
|
delete [] Nymult; |
91 |
|
delete [] Npstripx; |
92 |
|
delete [] Ntstripx; |
93 |
|
delete [] Istripx; |
94 |
|
delete [] Qstripx; |
95 |
|
delete [] Xstripx; |
96 |
|
delete [] Npstripy; |
97 |
|
delete [] Ntstripy; |
98 |
|
delete [] Istripy; |
99 |
|
delete [] Qstripy; |
100 |
|
delete [] Ystripy; |
101 |
|
delete [] Icaplane; |
102 |
|
delete [] Icastrip; |
103 |
|
delete [] Icamod; |
104 |
|
delete [] Enestrip; |
105 |
|
delete [] Icapl; |
106 |
|
delete [] Icasi; |
107 |
|
delete [] Icast; |
108 |
|
delete [] Xincal; |
109 |
|
delete [] Yincal; |
110 |
|
delete [] Zincal; |
111 |
|
delete [] Erelcal; |
112 |
|
delete [] Itubend; |
113 |
|
delete [] Iparnd; |
114 |
|
delete [] Xinnd; |
115 |
|
delete [] Yinnd; |
116 |
|
delete [] Zinnd; |
117 |
|
delete [] Xoutnd; |
118 |
|
delete [] Youtnd; |
119 |
|
delete [] Zoutnd; |
120 |
|
delete [] Erelnd; |
121 |
|
delete [] Timend; |
122 |
|
delete [] Pathnd; |
123 |
|
delete [] P0nd; |
124 |
|
delete [] Iparcard; |
125 |
|
delete [] Icard; |
126 |
|
delete [] Xincard; |
127 |
|
delete [] Yincard; |
128 |
|
delete [] Zincard; |
129 |
|
delete [] Xoutcard; |
130 |
|
delete [] Youtcard; |
131 |
|
delete [] Zoutcard; |
132 |
|
delete [] Erelcard; |
133 |
|
delete [] Timecard; |
134 |
|
delete [] Pathcard; |
135 |
|
delete [] P0card; |
136 |
|
|
137 |
|
|
138 |
|
}; |
139 |
|
|
140 |
|
|
141 |
|
|
142 |
|
void GPamela::SetBranchAddress( TChain* fhBookTree ){ |
143 |
|
|
144 |
|
// cout << "fhBookTree "<<fhBookTree << endl; |
145 |
|
// prepare tree |
146 |
|
fhBookTree->SetBranchAddress("Irun",&Irun); |
147 |
|
fhBookTree->SetBranchAddress("Ievnt",&Ievnt); |
148 |
|
fhBookTree->SetBranchAddress("Ipa",&Ipa); |
149 |
|
fhBookTree->SetBranchAddress("X0",&X0); |
150 |
|
fhBookTree->SetBranchAddress("Y0",&Y0); |
151 |
|
fhBookTree->SetBranchAddress("Z0",&Z0); |
152 |
|
fhBookTree->SetBranchAddress("Theta",&Theta); |
153 |
|
fhBookTree->SetBranchAddress("Phi",&Phi); |
154 |
|
fhBookTree->SetBranchAddress("P0",&P0); |
155 |
|
fhBookTree->SetBranchAddress("Nthtof",&Nthtof); |
156 |
|
fhBookTree->SetBranchAddress("Ipltof",Ipltof); |
157 |
|
fhBookTree->SetBranchAddress("Ipaddle",Ipaddle); |
158 |
|
fhBookTree->SetBranchAddress("Ipartof",Ipartof); |
159 |
|
fhBookTree->SetBranchAddress("Xintof",Xintof); |
160 |
|
fhBookTree->SetBranchAddress("Yintof",Yintof); |
161 |
|
fhBookTree->SetBranchAddress("Zintof",Zintof); |
162 |
|
fhBookTree->SetBranchAddress("Xouttof",Xouttof); |
163 |
|
fhBookTree->SetBranchAddress("Youttof",Youttof); |
164 |
|
fhBookTree->SetBranchAddress("Zouttof",Zouttof); |
165 |
|
fhBookTree->SetBranchAddress("Ereltof",Ereltof); |
166 |
|
fhBookTree->SetBranchAddress("Timetof",Timetof); |
167 |
|
fhBookTree->SetBranchAddress("Pathtof",Pathtof); |
168 |
|
fhBookTree->SetBranchAddress("P0tof",P0tof); |
169 |
|
fhBookTree->SetBranchAddress("Nthcat",&Nthcat); |
170 |
|
fhBookTree->SetBranchAddress("Iparcat",Iparcat); |
171 |
|
fhBookTree->SetBranchAddress("Icat",Icat); |
172 |
|
fhBookTree->SetBranchAddress("Xincat",Xincat); |
173 |
|
fhBookTree->SetBranchAddress("Yincat",Yincat); |
174 |
|
fhBookTree->SetBranchAddress("Zincat",Zincat); |
175 |
|
fhBookTree->SetBranchAddress("Xoutcat",Xoutcat); |
176 |
|
fhBookTree->SetBranchAddress("Youtcat",Youtcat); |
177 |
|
fhBookTree->SetBranchAddress("Zoutcat",Zoutcat); |
178 |
|
fhBookTree->SetBranchAddress("Erelcat",Erelcat); |
179 |
|
fhBookTree->SetBranchAddress("Timecat",Timecat); |
180 |
|
fhBookTree->SetBranchAddress("Pathcat",Pathcat); |
181 |
|
fhBookTree->SetBranchAddress("P0cat",P0cat); |
182 |
|
fhBookTree->SetBranchAddress("Nthcas",&Nthcas); |
183 |
|
fhBookTree->SetBranchAddress("Iparcas",Iparcas); |
184 |
|
fhBookTree->SetBranchAddress("Icas",Icas); |
185 |
|
fhBookTree->SetBranchAddress("Xincas",Xincas); |
186 |
|
fhBookTree->SetBranchAddress("Yincas",Yincas); |
187 |
|
fhBookTree->SetBranchAddress("Zincas",Zincas); |
188 |
|
fhBookTree->SetBranchAddress("Xoutcas",Xoutcas); |
189 |
|
fhBookTree->SetBranchAddress("Youtcas",Youtcas); |
190 |
|
fhBookTree->SetBranchAddress("Zoutcas",Zoutcas); |
191 |
|
fhBookTree->SetBranchAddress("Erelcas",Erelcas); |
192 |
|
fhBookTree->SetBranchAddress("Timecas",Timecas); |
193 |
|
fhBookTree->SetBranchAddress("Pathcas",Pathcas); |
194 |
|
fhBookTree->SetBranchAddress("P0cas",P0cas); |
195 |
|
fhBookTree->SetBranchAddress("Nthspe",&Nthspe); |
196 |
|
fhBookTree->SetBranchAddress("Iparspe",Iparspe); |
197 |
|
fhBookTree->SetBranchAddress("Itrpb",Itrpb); |
198 |
|
fhBookTree->SetBranchAddress("Itrsl",Itrsl); |
199 |
|
fhBookTree->SetBranchAddress("Itspa",Itspa); |
200 |
|
fhBookTree->SetBranchAddress("Xinspe",Xinspe); |
201 |
|
fhBookTree->SetBranchAddress("Yinspe",Yinspe); |
202 |
|
fhBookTree->SetBranchAddress("Zinspe",Zinspe); |
203 |
|
fhBookTree->SetBranchAddress("Xoutspe",Xoutspe); |
204 |
|
fhBookTree->SetBranchAddress("Youtspe",Youtspe); |
205 |
|
fhBookTree->SetBranchAddress("Zoutspe",Zoutspe); |
206 |
|
fhBookTree->SetBranchAddress("Xavspe",Xavspe); |
207 |
|
fhBookTree->SetBranchAddress("Yavspe",Yavspe); |
208 |
|
fhBookTree->SetBranchAddress("Zavspe",Zavspe); |
209 |
|
fhBookTree->SetBranchAddress("Erelspe",Erelspe); |
210 |
|
fhBookTree->SetBranchAddress("Pathspe",Pathspe); |
211 |
|
fhBookTree->SetBranchAddress("P0spe",P0spe); |
212 |
|
fhBookTree->SetBranchAddress("Nxmult",Nxmult); |
213 |
|
fhBookTree->SetBranchAddress("Nymult",Nymult); |
214 |
|
fhBookTree->SetBranchAddress("Nstrpx",&Nstrpx); |
215 |
|
fhBookTree->SetBranchAddress("Npstripx",Npstripx); |
216 |
|
fhBookTree->SetBranchAddress("Ntstripx",Ntstripx); |
217 |
|
fhBookTree->SetBranchAddress("Istripx",Istripx); |
218 |
|
fhBookTree->SetBranchAddress("Qstripx",Qstripx); |
219 |
|
fhBookTree->SetBranchAddress("Xstripx",Xstripx); |
220 |
|
fhBookTree->SetBranchAddress("Nstrpy",&Nstrpy); |
221 |
|
fhBookTree->SetBranchAddress("Npstripy",Npstripy); |
222 |
|
fhBookTree->SetBranchAddress("Ntstripy",Ntstripy); |
223 |
|
fhBookTree->SetBranchAddress("Istripy",Istripy); |
224 |
|
fhBookTree->SetBranchAddress("Qstripy",Qstripy); |
225 |
|
fhBookTree->SetBranchAddress("Ystripy",Ystripy); |
226 |
|
fhBookTree->SetBranchAddress("Nthcali",&Nthcali); |
227 |
|
fhBookTree->SetBranchAddress("Icaplane",Icaplane); |
228 |
|
fhBookTree->SetBranchAddress("Icastrip",Icastrip); |
229 |
|
fhBookTree->SetBranchAddress("Icamod",Icamod); |
230 |
|
fhBookTree->SetBranchAddress("Enestrip",Enestrip); |
231 |
|
fhBookTree->SetBranchAddress("Nthcal",&Nthcal); |
232 |
|
fhBookTree->SetBranchAddress("Icapl",Icapl); |
233 |
|
fhBookTree->SetBranchAddress("Icasi",Icasi); |
234 |
|
fhBookTree->SetBranchAddress("Icast",Icast); |
235 |
|
fhBookTree->SetBranchAddress("Xincal",Xincal); |
236 |
|
fhBookTree->SetBranchAddress("Yincal",Yincal); |
237 |
|
fhBookTree->SetBranchAddress("Zincal",Zincal); |
238 |
|
fhBookTree->SetBranchAddress("Erelcal",Erelcal); |
239 |
|
fhBookTree->SetBranchAddress("Nthnd",&Nthnd); |
240 |
|
fhBookTree->SetBranchAddress("Itubend",Itubend); |
241 |
|
fhBookTree->SetBranchAddress("Iparnd",Iparnd); |
242 |
|
fhBookTree->SetBranchAddress("Xinnd",Xinnd); |
243 |
|
fhBookTree->SetBranchAddress("Yinnd",Yinnd); |
244 |
|
fhBookTree->SetBranchAddress("Zinnd",Zinnd); |
245 |
|
fhBookTree->SetBranchAddress("Xoutnd",Xoutnd); |
246 |
|
fhBookTree->SetBranchAddress("Youtnd",Youtnd); |
247 |
|
fhBookTree->SetBranchAddress("Zoutnd",Zoutnd); |
248 |
|
fhBookTree->SetBranchAddress("Erelnd",Erelnd); |
249 |
|
fhBookTree->SetBranchAddress("Timend",Timend); |
250 |
|
fhBookTree->SetBranchAddress("Pathnd",Pathnd); |
251 |
|
fhBookTree->SetBranchAddress("P0nd",P0nd); |
252 |
|
fhBookTree->SetBranchAddress("Nthcard",&Nthcard); |
253 |
|
fhBookTree->SetBranchAddress("Iparcard",Iparcard); |
254 |
|
fhBookTree->SetBranchAddress("Icard",Icard); |
255 |
|
fhBookTree->SetBranchAddress("Xincard",Xincard); |
256 |
|
fhBookTree->SetBranchAddress("Yincard",Yincard); |
257 |
|
fhBookTree->SetBranchAddress("Zincard",Zincard); |
258 |
|
fhBookTree->SetBranchAddress("Xoutcard",Xoutcard); |
259 |
|
fhBookTree->SetBranchAddress("Youtcard",Youtcard); |
260 |
|
fhBookTree->SetBranchAddress("Zoutcard",Zoutcard); |
261 |
|
fhBookTree->SetBranchAddress("Erelcard",Erelcard); |
262 |
|
fhBookTree->SetBranchAddress("Timecard",Timecard); |
263 |
|
fhBookTree->SetBranchAddress("Pathcard",Pathcard); |
264 |
|
fhBookTree->SetBranchAddress("P0card",P0card); |
265 |
|
|
266 |
|
// fhBookTree->SetBranchStatus("*",0); |
267 |
|
|
268 |
|
} |
269 |
|
|
270 |
|
ClassImp(GPamela); |
271 |
|
|
272 |
|
///////////////////////////////////////////////////////////////////////////// |
273 |
|
///////////////////////////////////////////////////////////////////////////// |
274 |
|
///////////////////////////////////////////////////////////////////////////// |
275 |
|
///////////////////////////////////////////////////////////////////////////// |
276 |
//-------------------------------------- |
//-------------------------------------- |
277 |
// |
// |
278 |
// |
// |
285 |
calo_track = 0; |
calo_track = 0; |
286 |
tof_track = 0; |
tof_track = 0; |
287 |
candeleteobj = 0; |
candeleteobj = 0; |
288 |
|
pscore = 0; |
289 |
|
iscore = 0; |
290 |
}; |
}; |
291 |
//-------------------------------------- |
//-------------------------------------- |
292 |
// |
// |
336 |
calo_track = 0; |
calo_track = 0; |
337 |
tof_track = 0; |
tof_track = 0; |
338 |
} |
} |
339 |
|
pscore = 0; |
340 |
|
iscore = 0; |
341 |
|
|
342 |
} |
} |
343 |
void PamTrack::Delete(){ |
void PamTrack::Delete(){ |
344 |
// cout << "PamTrack::Delete() "<<candeleteobj<<endl; |
// cout << "PamTrack::Delete() "<<candeleteobj<<endl; |
364 |
// |
// |
365 |
//-------------------------------------- |
//-------------------------------------- |
366 |
/** |
/** |
367 |
* Constructor |
* Default Constructor |
368 |
*/ |
*/ |
369 |
PamLevel2::PamLevel2(){ |
PamLevel2::PamLevel2(){ |
370 |
|
Initialize(); |
371 |
|
}; |
372 |
|
|
373 |
|
/** |
374 |
|
* Constructor |
375 |
|
* @param ddir Name of directory where level2 files are stored. |
376 |
|
* @param list Name of an ascii file containing the list of file names |
377 |
|
* @param detlist Options to chose what to load. |
378 |
|
* Possible options are: |
379 |
|
* +AUTO --> load all trees/branches in the input files |
380 |
|
* +(-)ALL --> inlcude(exclude) all trees/branches |
381 |
|
* +(-)TRK1+(-)TRK2+(-)CAL1+(-)CAL2+(-)TOF+(-)TRG+(-)ND+(-)S4+(-)ORB+(-)AC --> inlcude(exclude) trees and branches |
382 |
|
* +(-)TRK0 --> include(exclude) tracker level0 tree |
383 |
|
* +(-)GP --> include exclude GPAMELA output tree |
384 |
|
* If no options are specified, the default is assumed. Default is: |
385 |
|
* +TRK2+CAL2+CAL1+TOF+TRG+ND+AC+S4+ORB |
386 |
|
*/ |
387 |
|
PamLevel2::PamLevel2(TString ddir,TString list,TString detlist){ |
388 |
|
Initialize(); |
389 |
|
TList* listf = GetListOfLevel2Files(ddir,list); |
390 |
|
GetPamTree(listf,detlist); |
391 |
|
GetRunTree(listf); |
392 |
|
}; |
393 |
|
|
394 |
|
/** |
395 |
|
* Constructor |
396 |
|
* @param ddir Name of directory where level2 files are stored. |
397 |
|
* @param list Name of an ascii file containing the list of file names |
398 |
|
* Default trees/branches are loaded. Default is: |
399 |
|
* +TRK2+CAL2+CAL1+TOF+TRG+ND+AC+S4+ORB |
400 |
|
*/ |
401 |
|
PamLevel2::PamLevel2(TString ddir,TString list){ |
402 |
|
Initialize(); |
403 |
|
TList* listf = GetListOfLevel2Files(ddir,list); |
404 |
|
GetPamTree(listf,""); |
405 |
|
GetRunTree(listf); |
406 |
|
}; |
407 |
|
|
408 |
|
|
409 |
|
void PamLevel2::Initialize(){ |
410 |
|
|
411 |
// trk2_obj = TrkLevel2::GetTrkLevel2(); |
h0_obj = 0; |
412 |
// trk1_obj = TrkLevel1::GetTrkLevel1(); |
trk0_obj = 0; |
413 |
// trkh_obj = TrkHough::GetTrkHough(); |
calo0_obj = 0; |
414 |
// calo1_obj = CaloLevel1::GetCaloLevel1(); |
|
|
// calo2_obj = CaloLevel2::GetCaloLevel2(); |
|
|
// tof_obj = ToFLevel2::GetToFLevel2(); |
|
|
// trig_obj = TrigLevel2::GetTrigLevel2(); |
|
|
// s4_obj = S4Level2::GetS4Level2(); |
|
|
// nd_obj = NDLevel2::GetNDLevel2(); |
|
|
// ac_obj = AcLevel2::GetAcLevel2(); |
|
|
// orb_obj = OrbitalInfo::GetOrbitalInfo(); |
|
415 |
trk2_obj = 0; |
trk2_obj = 0; |
416 |
trk1_obj = 0; |
trk1_obj = 0; |
417 |
trkh_obj = 0; |
trkh_obj = 0; |
423 |
nd_obj = 0; |
nd_obj = 0; |
424 |
ac_obj = 0; |
ac_obj = 0; |
425 |
orb_obj = 0; |
orb_obj = 0; |
426 |
|
gp_obj = 0; |
427 |
|
|
428 |
run_obj = 0;//new GL_RUN(); |
run_obj = 0;//new GL_RUN(); |
429 |
soft_obj = 0;// Emiliano |
soft_obj = 0;// Emiliano |
430 |
irun = -1; |
irun = -1LL; |
431 |
runfirstentry = 0ULL; |
irunt = -1LL; |
432 |
runlastentry = 0ULL; |
runfirstentry = 0LL; |
433 |
|
runlastentry = 0LL; |
434 |
|
|
435 |
|
l0_file = NULL; |
436 |
|
l0_tree = NULL; |
437 |
|
iroot = -1; |
438 |
|
dbc = 0; |
439 |
|
|
440 |
|
prevshift = 0; |
441 |
|
maxshift = 10; //EMILIANO |
442 |
|
|
443 |
|
run_tree = NULL; |
444 |
|
run_tree_clone = NULL; |
445 |
|
sel_tree = NULL; |
446 |
|
sel_tree_clone = NULL; |
447 |
|
|
448 |
|
irunentry = -1LL; |
449 |
|
pam_tree = NULL; |
450 |
|
for(Int_t i=0; i<NCLONES; i++ )pam_tree_clone[i]=NULL; |
451 |
|
|
452 |
|
totdltime[0] = 0LL; |
453 |
|
totdltime[1] = 0LL; |
454 |
|
totdltime[2] = 0LL; |
455 |
|
|
456 |
|
host = "mysql://localhost/pamelaprod"; |
457 |
|
user = "anonymous"; |
458 |
|
psw = ""; |
459 |
|
const char *pamdbhost=gSystem->Getenv("PAM_DBHOST"); |
460 |
|
const char *pamdbuser=gSystem->Getenv("PAM_DBUSER"); |
461 |
|
const char *pamdbpsw=gSystem->Getenv("PAM_DBPSW"); |
462 |
|
if ( !pamdbhost ) pamdbhost = ""; |
463 |
|
if ( !pamdbuser ) pamdbuser = ""; |
464 |
|
if ( !pamdbpsw ) pamdbpsw = ""; |
465 |
|
if ( strcmp(pamdbhost,"") ) host = pamdbhost; |
466 |
|
if ( strcmp(pamdbuser,"") ) user = pamdbuser; |
467 |
|
if ( strcmp(pamdbpsw,"") ) psw = pamdbpsw; |
468 |
|
|
469 |
for(Int_t i=0; i<8; i++ )tree_clone[i]=NULL; |
|
470 |
|
|
471 |
// sorted_tracks = 0;//new TRefArray(); |
// sorted_tracks = 0;//new TRefArray(); |
472 |
|
|
473 |
|
CAL0 = false; |
474 |
CAL1 = true; |
CAL1 = true; |
475 |
CAL2 = true; |
CAL2 = true; |
476 |
TRK2 = true; |
TRK2 = true; |
477 |
TRK1 = false; |
TRK1 = false; |
478 |
|
TRK0 = false; |
479 |
TRKh = false; |
TRKh = false; |
480 |
TRG = true; |
TRG = true; |
481 |
TOF = true; |
TOF = true; |
482 |
S4 = true; |
TOF0 = false; |
483 |
ND = true; |
S4 = true; |
484 |
AC = true; |
ND = true; |
485 |
ORB = true; |
AC = true; |
486 |
|
ORB = true; |
487 |
RUN = true; |
GP = false; |
488 |
|
|
489 |
|
RUN = true; |
490 |
|
|
491 |
|
SELLI = -1; |
492 |
|
|
493 |
|
ISGP = false; |
494 |
|
|
495 |
|
DBG = false; |
496 |
|
|
497 |
tsorted=0; |
tsorted=0; |
498 |
timage=0; |
timage=0; |
499 |
|
|
500 |
|
howtosort = "+CAL+TOF"; |
501 |
|
//howtosort = "+TOF"; |
502 |
|
sortthr = 100.; |
503 |
|
|
504 |
}; |
}; |
505 |
/** |
/** |
511 |
if(soft_obj)delete soft_obj; //Emiliano |
if(soft_obj)delete soft_obj; //Emiliano |
512 |
|
|
513 |
// cout << "void PamLevel2::Clear()"<<endl; |
// cout << "void PamLevel2::Clear()"<<endl; |
514 |
|
if(h0_obj) delete h0_obj; |
515 |
|
if(trk0_obj) delete trk0_obj; |
516 |
|
if(calo0_obj) delete calo0_obj; |
517 |
if(trk1_obj) delete trk1_obj; |
if(trk1_obj) delete trk1_obj; |
518 |
if(trk2_obj) delete trk2_obj; |
if(trk2_obj) delete trk2_obj; |
519 |
if(trkh_obj) delete trkh_obj; |
if(trkh_obj) delete trkh_obj; |
525 |
if(nd_obj) delete nd_obj; |
if(nd_obj) delete nd_obj; |
526 |
if(ac_obj) delete ac_obj; |
if(ac_obj) delete ac_obj; |
527 |
if(orb_obj) delete orb_obj; |
if(orb_obj) delete orb_obj; |
528 |
|
if(gp_obj) delete gp_obj; |
529 |
|
|
530 |
if(tsorted){ |
if(tsorted){ |
531 |
tsorted->Delete(); |
tsorted->Delete(); |
535 |
timage->Delete(); |
timage->Delete(); |
536 |
delete timage; |
delete timage; |
537 |
} |
} |
538 |
|
|
539 |
|
if(dbc){ |
540 |
|
dbc->Close(); |
541 |
|
delete dbc; |
542 |
|
} |
543 |
|
|
544 |
|
if(l0_file)l0_file->Close(); |
545 |
|
// if(pam_tree)pam_tree->Delete();; |
546 |
|
|
547 |
|
if ( pam_tree ){ |
548 |
|
// |
549 |
|
// 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... |
550 |
|
// |
551 |
|
TList *temp = pam_tree->GetListOfFriends(); |
552 |
|
TList *contents = new TList; // create chain friend list |
553 |
|
contents->SetOwner(); |
554 |
|
TIter next(temp); |
555 |
|
TChain *questo = 0; |
556 |
|
while ( (questo = (TChain*) next()) ){ |
557 |
|
TString name = questo->GetName(); |
558 |
|
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
559 |
|
}; |
560 |
|
// |
561 |
|
// deleting the main chain |
562 |
|
// |
563 |
|
pam_tree->Delete(); |
564 |
|
// |
565 |
|
// deleting the friends... |
566 |
|
// |
567 |
|
TIter next2(contents); |
568 |
|
TChain *questa = 0; |
569 |
|
while ( questa = (TChain*)next2() ){ |
570 |
|
TString name = questa->GetName(); |
571 |
|
questa->Delete(); |
572 |
|
questa=NULL; |
573 |
|
}; |
574 |
|
// |
575 |
|
}; |
576 |
|
pam_tree = NULL; |
577 |
|
|
578 |
|
if(run_tree)run_tree->Delete();; |
579 |
|
if(sel_tree)sel_tree->Delete();; |
580 |
|
for(Int_t i=0; i<NCLONES; i++ )if(pam_tree_clone[i])pam_tree_clone[i]->Delete();; |
581 |
|
if(run_tree_clone)run_tree_clone->Delete();; |
582 |
|
if(sel_tree_clone)sel_tree_clone->Delete();; |
583 |
|
|
584 |
|
if(irunoffset) delete [] irunoffset; |
585 |
|
|
586 |
}; |
}; |
587 |
|
|
588 |
/** |
/** |
600 |
// if(run_obj) run_obj->Clear(); // Emiliano: Do not deallocate run_obj here, it will give segmentation fault! call clear instead |
// if(run_obj) run_obj->Clear(); // Emiliano: Do not deallocate run_obj here, it will give segmentation fault! call clear instead |
601 |
// if(soft_obj) soft_obj->Clear(); |
// if(soft_obj) soft_obj->Clear(); |
602 |
|
|
603 |
|
if(h0_obj) h0_obj->Clear(); |
604 |
|
// if(trk0_obj) trk0_obj->Clear(); |
605 |
if(trk1_obj) trk1_obj->Clear(); |
if(trk1_obj) trk1_obj->Clear(); |
606 |
if(trk2_obj) trk2_obj->Clear(); |
if(trk2_obj) trk2_obj->Clear(); |
607 |
if(trkh_obj) trkh_obj->Clear(); |
if(trkh_obj) trkh_obj->Clear(); |
608 |
|
if(calo0_obj) calo0_obj->Clear(); |
609 |
if(calo1_obj)calo1_obj->Clear(); |
if(calo1_obj)calo1_obj->Clear(); |
610 |
if(calo2_obj)calo2_obj->Clear(); |
if(calo2_obj)calo2_obj->Clear(); |
611 |
if(tof_obj) tof_obj->Clear(); |
if(tof_obj) tof_obj->Clear(); |
614 |
if(nd_obj) nd_obj->Clear(); |
if(nd_obj) nd_obj->Clear(); |
615 |
if(ac_obj) ac_obj->Clear(); |
if(ac_obj) ac_obj->Clear(); |
616 |
if(orb_obj) orb_obj->Clear(); |
if(orb_obj) orb_obj->Clear(); |
617 |
|
if(gp_obj) gp_obj->Clear(); |
618 |
|
|
619 |
// if(sorted_tracks)sorted_tracks->Clear(); |
// if(sorted_tracks)sorted_tracks->Clear(); |
620 |
// sorted_tracks.Clear(); |
// sorted_tracks.Clear(); |
625 |
if(timage){ |
if(timage){ |
626 |
timage->Delete(); |
timage->Delete(); |
627 |
} |
} |
|
|
|
628 |
}; |
}; |
629 |
|
|
630 |
|
void PamLevel2::Reset(){ |
631 |
|
// |
632 |
|
// First of all clear everything |
633 |
|
// |
634 |
|
Clear(); |
635 |
|
// |
636 |
|
// close and reset chains and pointers |
637 |
|
// |
638 |
|
if ( pam_tree ){ |
639 |
|
// |
640 |
|
// 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... |
641 |
|
// |
642 |
|
TList *temp = pam_tree->GetListOfFriends(); |
643 |
|
TList *contents = new TList; // create chain friend list |
644 |
|
contents->SetOwner(); |
645 |
|
TIter next(temp); |
646 |
|
TChain *questo = 0; |
647 |
|
while ( (questo = (TChain*) next()) ){ |
648 |
|
TString name = questo->GetName(); |
649 |
|
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
650 |
|
}; |
651 |
|
// |
652 |
|
// deleting the main chain |
653 |
|
// |
654 |
|
pam_tree->Delete(); |
655 |
|
// |
656 |
|
// deleting the friends... |
657 |
|
// |
658 |
|
TIter next2(contents); |
659 |
|
TChain *questa = 0; |
660 |
|
while ( questa = (TChain*)next2() ){ |
661 |
|
TString name = questa->GetName(); |
662 |
|
questa->Delete(); |
663 |
|
questa=NULL; |
664 |
|
}; |
665 |
|
// |
666 |
|
}; |
667 |
|
pam_tree = NULL; |
668 |
|
// |
669 |
|
if(run_tree)run_tree->Delete();; |
670 |
|
run_tree = NULL; |
671 |
|
if(sel_tree)sel_tree->Delete();; |
672 |
|
sel_tree = NULL; |
673 |
|
// |
674 |
|
// Close file |
675 |
|
// |
676 |
|
if(l0_file)l0_file->Close("R"); |
677 |
|
l0_file = NULL; |
678 |
|
// |
679 |
|
h0_obj = 0; |
680 |
|
trk0_obj = 0; |
681 |
|
calo0_obj = 0; |
682 |
|
// |
683 |
|
trk2_obj = 0; |
684 |
|
trk1_obj = 0; |
685 |
|
trkh_obj = 0; |
686 |
|
calo1_obj = 0; |
687 |
|
calo2_obj = 0; |
688 |
|
tof_obj = 0; |
689 |
|
trig_obj = 0; |
690 |
|
s4_obj = 0; |
691 |
|
nd_obj = 0; |
692 |
|
ac_obj = 0; |
693 |
|
orb_obj = 0; |
694 |
|
gp_obj = 0; |
695 |
|
// |
696 |
|
// Reset run pointers |
697 |
|
// |
698 |
|
run_obj = 0;//new GL_RUN(); |
699 |
|
soft_obj = 0;// Emiliano |
700 |
|
irun = -1; |
701 |
|
irunt = -1; |
702 |
|
runfirstentry = 0ULL; |
703 |
|
runlastentry = 0ULL; |
704 |
|
// |
705 |
|
totdltime[0] = 0LL; |
706 |
|
totdltime[1] = 0LL; |
707 |
|
totdltime[2] = 0LL; |
708 |
|
// |
709 |
|
}; |
710 |
|
|
711 |
|
Bool_t PamLevel2::IsGood(){ |
712 |
|
Bool_t goodev=true; |
713 |
|
// if(trk2_obj && trk2_obj->UnpackError() != 0 ) goodev = false; |
714 |
|
if(calo2_obj && calo2_obj->good != 1) goodev = false; |
715 |
|
if(tof_obj && tof_obj->unpackError != 0) goodev = false; |
716 |
|
if(trig_obj && trig_obj->unpackError != 0) goodev = false; |
717 |
|
if(s4_obj && s4_obj->unpackError != 0) goodev = false; |
718 |
|
if(nd_obj && nd_obj->unpackError != 0) goodev = false; |
719 |
|
if(ac_obj && ac_obj->unpackError != 255) goodev = false; |
720 |
|
// if(orb_obj) |
721 |
|
return goodev; |
722 |
|
}; |
723 |
|
|
724 |
//-------------------------------------- |
//-------------------------------------- |
725 |
// |
// |
785 |
if(!orb_obj) orb_obj = new OrbitalInfo(); |
if(!orb_obj) orb_obj = new OrbitalInfo(); |
786 |
return &orb_obj; |
return &orb_obj; |
787 |
}; |
}; |
788 |
|
if(!objname.CompareTo("GPamela")){ |
789 |
|
if(!gp_obj) gp_obj = new GPamela(); |
790 |
|
return &gp_obj; |
791 |
|
}; |
792 |
|
|
793 |
if(!objname.CompareTo("RunInfo"))return &run_obj; |
if(!objname.CompareTo("RunInfo"))return &run_obj; |
794 |
|
|
804 |
* Retrieves the calorimeter track matching the seqno-th tracker stored track. |
* Retrieves the calorimeter track matching the seqno-th tracker stored track. |
805 |
* (If seqno = -1 retrieves the self-trigger calorimeter track) |
* (If seqno = -1 retrieves the self-trigger calorimeter track) |
806 |
*/ |
*/ |
807 |
CaloTrkVar *PamLevel2::GetCaloStoredTrack(int seqno){ |
CaloTrkVar *PamLevel2::GetCaloStoredTrack(int seqno){ |
808 |
|
|
809 |
if( !calo2_obj )return 0; |
if( !calo2_obj )return 0; |
810 |
|
|
811 |
if( calo2_obj->CaloLevel2::ntrk()==0 ){ |
if( calo2_obj->CaloLevel2::ntrk()==0 ){ |
812 |
cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no Calorimeter tracks are stored"<<endl; |
cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no Calorimeter tracks are stored"<<endl; |
813 |
return NULL; |
return NULL; |
814 |
}; |
}; |
815 |
|
|
816 |
CaloTrkVar *c = 0; |
CaloTrkVar *c = 0; |
817 |
Int_t it_calo=0; |
Int_t it_calo=0; |
818 |
|
|
819 |
do{ |
do{ |
820 |
c = calo2_obj->CaloLevel2::GetCaloTrkVar(it_calo); |
c = calo2_obj->CaloLevel2::GetCaloTrkVar(it_calo); |
821 |
it_calo++; |
it_calo++; |
822 |
} while( c && seqno != c->trkseqno && it_calo < calo2_obj->CaloLevel2::ntrk()); |
} while( c && seqno != c->trkseqno && it_calo < calo2_obj->CaloLevel2::ntrk()); |
823 |
|
|
824 |
if(!c || seqno != c->trkseqno){ |
if(!c || seqno != c->trkseqno){ |
825 |
c = 0; |
c = 0; |
826 |
if(seqno!=-1)cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match Calorimeter stored tracks"<<endl; |
if(seqno!=-1)cout << "PamLevel2::GetCaloStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match Calorimeter stored tracks"<<endl; |
827 |
}; |
}; |
828 |
return c; |
return c; |
829 |
|
|
830 |
}; |
}; |
831 |
//-------------------------------------- |
//-------------------------------------- |
832 |
// |
// |
833 |
// |
// |
834 |
//-------------------------------------- |
//-------------------------------------- |
835 |
/** |
/** |
836 |
* Retrieves the ToF track matching the seqno-th tracker stored track. |
* Retrieves the ToF track matching the seqno-th tracker stored track. |
837 |
* (If seqno = -1 retrieves the tracker-independent tof track) |
* (If seqno = -1 retrieves the tracker-independent tof track) |
838 |
*/ |
*/ |
839 |
ToFTrkVar *PamLevel2::GetToFStoredTrack(int seqno){ |
ToFTrkVar *PamLevel2::GetToFStoredTrack(int seqno){ |
840 |
|
|
841 |
if( !tof_obj )return 0; |
if( !tof_obj )return 0; |
842 |
|
|
843 |
if( tof_obj->ToFLevel2::ntrk()==0 ){ |
if( tof_obj->ToFLevel2::ntrk()==0 ){ |
844 |
cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no ToF tracks are stored"<<endl; |
cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo "<< seqno <<" but no ToF tracks are stored"<<endl; |
845 |
return NULL; |
return NULL; |
846 |
}; |
}; |
847 |
|
|
848 |
ToFTrkVar *c = 0; |
ToFTrkVar *c = 0; |
849 |
Int_t it_tof=0; |
Int_t it_tof=0; |
850 |
|
|
851 |
do{ |
do{ |
852 |
c = tof_obj->ToFLevel2::GetToFTrkVar(it_tof); |
c = tof_obj->ToFLevel2::GetToFTrkVar(it_tof); |
853 |
it_tof++; |
it_tof++; |
854 |
} while( c && seqno != c->trkseqno && it_tof < tof_obj->ToFLevel2::ntrk()); |
} while( c && seqno != c->trkseqno && it_tof < tof_obj->ToFLevel2::ntrk()); |
855 |
|
|
856 |
if(!c || seqno != c->trkseqno){ |
if(!c || seqno != c->trkseqno){ |
857 |
c = 0; |
c = 0; |
858 |
if(seqno!=-1)cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match ToF stored tracks"<<endl; |
if(seqno!=-1)cout << "PamLevel2::GetToFStoredTrack(int) : requested tracker SeqNo "<< seqno <<" does not match ToF stored tracks"<<endl; |
859 |
}; |
}; |
860 |
return c; |
return c; |
861 |
|
|
862 |
}; |
}; |
863 |
|
|
864 |
//-------------------------------------- |
//-------------------------------------- |
865 |
// |
// |
866 |
// |
// |
867 |
//-------------------------------------- |
//-------------------------------------- |
868 |
/** |
/** |
869 |
* Give the pamela track associated to a tracker track, retrieving related calorimeter and tof track information. |
* Give the pamela track associated to a tracker track, retrieving related calorimeter and tof track information. |
870 |
*/ |
*/ |
871 |
PamTrack* PamLevel2::GetPamTrackAlong(TrkTrack* t){ |
PamTrack* PamLevel2::GetPamTrackAlong(TrkTrack* t){ |
872 |
|
|
873 |
cout <<"PamLevel2::GetPamTrackAlong(TrkTrack* t) **obsolete** "<<endl; |
cout <<"PamLevel2::GetPamTrackAlong(TrkTrack* t) **obsolete** "<<endl; |
874 |
cout <<"(if you use it, remember to delete the PamTrack object)"<<endl; |
cout <<"(if you use it, remember to delete the PamTrack object)"<<endl; |
875 |
|
|
876 |
CaloTrkVar *c = 0; |
CaloTrkVar *c = 0; |
877 |
ToFTrkVar *o = 0; |
ToFTrkVar *o = 0; |
878 |
|
|
879 |
if(CAL2) c = GetCaloStoredTrack(t->GetSeqNo()); |
if(CAL2) c = GetCaloStoredTrack(t->GetSeqNo()); |
880 |
if(TOF) o = GetToFStoredTrack(t->GetSeqNo()); |
if(TOF) o = GetToFStoredTrack(t->GetSeqNo()); |
881 |
|
|
882 |
// if(t && c && o)track = new PamTrack(t,c,o); |
// if(t && c && o)track = new PamTrack(t,c,o); |
883 |
PamTrack *track = new PamTrack(t,c,o); |
PamTrack *track = new PamTrack(t,c,o); |
884 |
|
|
885 |
return track; |
return track; |
886 |
|
|
887 |
}; |
}; |
888 |
//-------------------------------------- |
//-------------------------------------- |
889 |
// |
// |
890 |
// |
// |
918 |
} |
} |
919 |
//-------------------------------------- |
//-------------------------------------- |
920 |
// |
// |
921 |
|
|
922 |
|
/** |
923 |
|
* Sort physical (tracker) tracks. Left here as backward compatibility method. |
924 |
|
**/ |
925 |
|
void PamLevel2::SortTracks(TString how){ |
926 |
|
printf(" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n",how.Data()); |
927 |
|
howtosort = how; |
928 |
|
SortTracks(); |
929 |
|
}; |
930 |
|
|
931 |
// |
// |
932 |
//-------------------------------------- |
//-------------------------------------- |
933 |
/** |
/** |
934 |
* Sort physical (tracker) tracks and stores them in the TRefArray (of TrkTrack objects) which pointer is PamLevel2::sorted_tracks. |
* Sort physical (tracker) tracks. |
935 |
* @param how String to set the sorting cryterium (es: "CAL" or "TRK+CAL+TOF" ecc...). |
* @param how String to set the sorting cryterium (es: "CAL" or "TRK+CAL+TOF" ecc...). |
936 |
* Sorting cryteria: |
* Sorting cryteria: |
937 |
* TRK: lower chi**2 |
* TRK: lower chi**2 |
938 |
* CAL: lower Y spatial residual on the first calorimeter plane |
* CAL: lower Y spatial residual on the first calorimeter plane |
939 |
* TOF: bigger numebr of hit PMTs along the track, on S12 S21 S32 (where paddles are along the Y axis). |
* TOF: bigger numebr of hit PMTs along the track, on S12 S21 S32 (where paddles are along the Y axis). |
940 |
|
* S1: (ask Emiliano) |
941 |
|
* S2: (ask Emiliano) |
942 |
|
* S3: (ask Emiliano) |
943 |
|
* GP: more GP hits |
944 |
* The default sorting cryterium is "TOF+CAL". |
* The default sorting cryterium is "TOF+CAL". |
945 |
* |
* |
946 |
* The total number of physical tracks is always given by GetNTracks() and the it-th physical track can be retrieved by means of the methods GetTrack(int it) and GetTrack(int it, TString how). |
* The total number of physical tracks is always given by GetNTracks() and the it-th physical track can be retrieved by means of the methods GetTrack(int it) and GetTrack(int it, TString how). |
947 |
*/ |
*/ |
948 |
void PamLevel2::SortTracks(TString how){ |
void PamLevel2::SortTracks(){ |
949 |
|
TString how = howtosort; |
950 |
|
|
951 |
// cout <<" PamLevel2::SortTracks(TString how) "<<endl; |
// cout <<" PamLevel2::SortTracks(TString how) "<<endl; |
952 |
if( !trk2_obj ){ |
if( !trk2_obj ){ |
953 |
cout << "void PamLevel2::SortTracks(TString how): TrkLevel2 not loaded !!!"; |
cout << "void PamLevel2::SortTracks(): TrkLevel2 not loaded !!!"; |
954 |
return; |
return; |
955 |
}; |
}; |
956 |
// cout << "call SortTracs() "<<endl; |
//Save current Object count |
|
//Save current Object count |
|
957 |
Int_t ObjectNumber = TProcessID::GetObjectCount(); |
Int_t ObjectNumber = TProcessID::GetObjectCount(); |
958 |
|
|
959 |
// cout << "ObjectNumber "<<ObjectNumber <<endl; |
// create TCloneArrays to store tracks and its images |
|
|
|
|
// if(!sorted_tracks)sorted_tracks = new TRefArray(); |
|
|
// sorted_tracks->Clear(); |
|
|
// sorted_tracks.Clear(); |
|
|
|
|
960 |
if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
961 |
tsorted->Delete(); |
tsorted->Delete(); |
962 |
TClonesArray &ttsorted = *tsorted; |
TClonesArray &ttsorted = *tsorted; |
963 |
|
|
964 |
if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
965 |
timage->Delete(); |
timage->Delete(); |
966 |
TClonesArray &ttimage = *timage; |
TClonesArray &ttimage = *timage; |
967 |
|
|
968 |
|
|
969 |
// loop over the tracks sorted by the tracker |
|
970 |
|
//-------------------------------------------------- |
971 |
|
// retrieve sorting method |
972 |
|
//-------------------------------------------------- |
973 |
Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase); |
Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase); |
974 |
Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase); |
Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase); |
975 |
Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase); |
Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase); |
976 |
|
Bool_t use_S1 = how.Contains("S1", TString::kIgnoreCase); |
977 |
|
Bool_t use_S2 = how.Contains("S2", TString::kIgnoreCase); |
978 |
|
Bool_t use_S3 = how.Contains("S3", TString::kIgnoreCase); |
979 |
|
Bool_t use_GP = how.Contains("GP", TString::kIgnoreCase); |
980 |
|
|
981 |
|
if ( use_TOF ){ |
982 |
|
use_S1 = true; |
983 |
|
use_S2 = true; |
984 |
|
use_S3 = true; |
985 |
|
}; |
986 |
if( !CAL2 && use_CAL) use_CAL = false; |
if( !CAL2 && use_CAL) use_CAL = false; |
987 |
if( !TOF && use_TOF) use_TOF = false; |
if( !TOF ){ |
988 |
|
use_TOF = false; |
989 |
|
use_S1 = false; |
990 |
|
use_S2 = false; |
991 |
|
use_S3 = false; |
992 |
|
} |
993 |
|
if( !GP ){ |
994 |
|
use_GP = false; |
995 |
|
} |
996 |
|
|
997 |
if( !TRK2 ){ |
if( !TRK2 ){ |
998 |
// cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl; |
cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl; |
999 |
return; |
return; |
1000 |
}; |
}; |
1001 |
|
|
1002 |
// cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl; |
// cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl; |
1003 |
|
|
1004 |
|
|
1005 |
|
//-------------------------------------------------- |
1006 |
|
// loop over "physical" tracks sorted by the tracker |
1007 |
|
//-------------------------------------------------- |
1008 |
for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){ |
for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){ |
1009 |
|
|
1010 |
TrkTrack *ts = 0; |
TrkTrack *ts = 0; |
1012 |
ToFTrkVar *os = 0; |
ToFTrkVar *os = 0; |
1013 |
|
|
1014 |
// get tracker tracks |
// get tracker tracks |
1015 |
TrkTrack *tp = trk2_obj->TrkLevel2::GetTrack(i); //tracker |
TrkTrack *tp = trk2_obj->TrkLevel2::GetTrack(i); //tracker |
1016 |
CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo()); |
CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo()); |
1017 |
ToFTrkVar *op = GetToFStoredTrack(tp->GetSeqNo()); |
ToFTrkVar *op = GetToFStoredTrack(tp->GetSeqNo()); |
1018 |
|
|
1019 |
TrkTrack *ti = 0; //tracker (image) |
TrkTrack *ti = 0; //tracker (image) |
1020 |
CaloTrkVar *ci = 0; |
CaloTrkVar *ci = 0; |
1021 |
ToFTrkVar *oi = 0; |
ToFTrkVar *oi = 0; |
1022 |
// cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl; |
// cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl; |
1023 |
// if track has an image, check image selection |
// if track has an image, check image selection |
1024 |
|
|
1025 |
|
Int_t tp_score = 0; //main track sorted by the tracker |
1026 |
|
Int_t ti_score = 0; //image track |
1027 |
|
Int_t totp_score = 0; //main track sorted by the tracker |
1028 |
|
Int_t toti_score = 0; //image track |
1029 |
|
|
1030 |
if(tp->HasImage()){ |
if(tp->HasImage()){ |
1031 |
|
|
1032 |
ti = trk2_obj->TrkLevel2::GetTrackImage(i); //tracker (image) |
ti = trk2_obj->TrkLevel2::GetTrackImage(i); //tracker (image) |
1033 |
ci = GetCaloStoredTrack(ti->GetSeqNo()); |
ci = GetCaloStoredTrack(ti->GetSeqNo()); |
1034 |
oi = GetToFStoredTrack(ti->GetSeqNo()); |
oi = GetToFStoredTrack(ti->GetSeqNo()); |
1035 |
|
|
1036 |
// cout << "its image "<<i << " "<<hex<< ti <<dec<< endl; |
// cout << "its image "<<i << " "<<hex<< ti <<dec<< endl; |
1037 |
|
|
1038 |
//assign starting scores |
//assign starting scores |
1039 |
Int_t tp_score = 0; //main track sorted by the tracker |
tp_score = 0; //main track sorted by the tracker |
1040 |
Int_t ti_score = 0; //image track |
ti_score = 0; //image track |
1041 |
|
|
1042 |
// ------------------------ |
// ----------------------------------------------------------------------------------------- |
1043 |
|
// ***************************************************************************************** |
1044 |
|
// ----------------------------------------------------------------------------------------- |
1045 |
// calorimeter check |
// calorimeter check |
1046 |
// ------------------------ |
// ----------------------------------------------------------------------------------------- |
|
// check the Y spatial residual on the first calorimeter plane |
|
|
// (cut on calorimeter variables from Emiliano) |
|
1047 |
if( use_CAL && !calo2_obj ){ |
if( use_CAL && !calo2_obj ){ |
1048 |
cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but CaloLevel2 not loaded !!!"; |
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but CaloLevel2 not loaded !!!"; |
1049 |
return; |
return; |
1050 |
}; |
}; |
1051 |
|
if( use_CAL && !cp && ci ){ |
1052 |
|
ti_score++; |
1053 |
|
toti_score++; |
1054 |
|
}; |
1055 |
|
if( use_CAL && cp && !ci ){ |
1056 |
|
tp_score++; |
1057 |
|
totp_score++; |
1058 |
|
}; |
1059 |
if( |
if( |
1060 |
use_CAL && |
use_CAL && |
1061 |
calo2_obj->npcfit[1] > 15 && //no. of fit planes on Y view |
cp && ci && |
|
calo2_obj->varcfit[1] < 1000. && //fit variance on Y view |
|
1062 |
true){ |
true){ |
1063 |
|
|
1064 |
|
|
1065 |
Float_t resy_p = cp->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_p < 0)resy_p= - resy_p; |
if( |
1066 |
Float_t resy_i = ci->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_i < 0)resy_i= - resy_i; |
cp->npresh > ci->npresh && |
1067 |
|
true){ |
1068 |
if(resy_p <= resy_i) tp_score++; |
tp_score++; |
1069 |
else ti_score++; |
totp_score++; |
1070 |
|
}; |
1071 |
|
if( |
1072 |
|
cp->npresh < ci->npresh && |
1073 |
|
true){ |
1074 |
|
ti_score++; |
1075 |
|
toti_score++; |
1076 |
|
}; |
1077 |
|
|
1078 |
// cout << "CALO "<<tp_score<<ti_score<<endl; |
// cout << "CALO "<<tp_score<<ti_score<<endl; |
1079 |
|
|
1080 |
}; |
}; |
1081 |
// ------------------------ |
// ----------------------------------------------------------------------------------------- |
1082 |
|
// ***************************************************************************************** |
1083 |
|
// ----------------------------------------------------------------------------------------- |
1084 |
// TOF check |
// TOF check |
1085 |
// ------------------------ |
// ----------------------------------------------------------------------------------------- |
1086 |
// check the number of hit pmts along the track |
// check the number of hit pmts along the track |
1087 |
// on S12 S21 and S32, where paddles are parallel to Y axis |
// on S12 S21 and S32, where paddles are parallel to Y axis |
1088 |
if( use_TOF && !tof_obj ){ |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && !tof_obj ){ |
1089 |
cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but ToFLevel2 not loaded !!!"; |
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but ToFLevel2 not loaded !!!"; |
1090 |
return; |
return; |
1091 |
}; |
}; |
1092 |
if( use_TOF ){ |
// |
1093 |
|
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && !op && oi ){ |
1094 |
Int_t nphit_p =0; |
ti_score++; |
1095 |
Int_t nphit_i =0; |
toti_score++; |
1096 |
|
}; |
1097 |
|
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && op && !oi ){ |
1098 |
/* cout << "track: npmtadc "<< op->npmtadc << endl; |
tp_score++; |
1099 |
cout << "track: npmttdc "<< op->npmttdc << endl; |
totp_score++; |
1100 |
cout << "image: npmtadc "<< oi->npmtadc << endl; |
}; |
1101 |
cout << "image: npmttdc "<< oi->npmttdc << endl;*/ |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && op && oi ){ |
1102 |
|
// |
1103 |
|
Float_t sen = 0.; |
1104 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1105 |
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1106 |
if(pl == 1 || pl == 2 || pl == 5)nphit_p++; |
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (op->dedx).At(ih); |
1107 |
}; |
}; |
|
|
|
1108 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1109 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1110 |
if(pl == 1 || pl == 2 || pl == 5)nphit_i++; |
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (oi->dedx).At(ih); |
1111 |
}; |
}; |
1112 |
|
// |
1113 |
|
if ( sen >= sortthr && false){ // temporary disabled NUCLEI special algorithm since the new one should work for every particle (to be checked!) |
1114 |
|
//printf(" IS A NUCLEUS! en = %f \n",sen); |
1115 |
|
// |
1116 |
|
// is a nucleus use a different algorithm |
1117 |
|
// |
1118 |
|
Int_t nz = 6; Float_t zin[6]; // << define TOF z-coordinates |
1119 |
|
for(Int_t ip=0; ip<nz; ip++) |
1120 |
|
zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip)); // << read ToF plane z-coordinates |
1121 |
|
Trajectory *tr = new Trajectory(nz,zin); |
1122 |
|
// |
1123 |
|
Int_t nphit_p =0; |
1124 |
|
Int_t nphit_i =0; |
1125 |
|
Float_t enhit_p = 0.; |
1126 |
|
Float_t enhit_i = 0.; |
1127 |
|
// |
1128 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1129 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1130 |
|
if(pl == 1 || pl == 2 || pl == 5){ |
1131 |
|
nphit_p++; |
1132 |
|
enhit_p += (op->dedx).At(ih); |
1133 |
|
}; |
1134 |
|
}; |
1135 |
|
// |
1136 |
|
tp->DoTrack2(tr); |
1137 |
|
// |
1138 |
|
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
1139 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1140 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1141 |
|
if(pl == 0){ |
1142 |
|
nphit_p++; |
1143 |
|
enhit_p += (op->dedx).At(ih); |
1144 |
|
}; |
1145 |
|
}; |
1146 |
|
}; |
1147 |
|
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
1148 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1149 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1150 |
|
if(pl == 3){ |
1151 |
|
nphit_p++; |
1152 |
|
enhit_p += (op->dedx).At(ih); |
1153 |
|
}; |
1154 |
|
}; |
1155 |
|
}; |
1156 |
|
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
1157 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1158 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1159 |
|
if(pl == 4){ |
1160 |
|
nphit_p++; |
1161 |
|
enhit_p += (op->dedx).At(ih); |
1162 |
|
}; |
1163 |
|
}; |
1164 |
|
}; |
1165 |
|
|
1166 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1167 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1168 |
|
if(pl == 1 || pl == 2 || pl == 5){ |
1169 |
|
nphit_i++; |
1170 |
|
enhit_i += (op->dedx).At(ih); |
1171 |
|
}; |
1172 |
|
}; |
1173 |
|
// |
1174 |
|
ti->DoTrack2(tr); |
1175 |
|
// |
1176 |
|
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
1177 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1178 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1179 |
|
if(pl == 0){ |
1180 |
|
nphit_i++; |
1181 |
|
enhit_i += (op->dedx).At(ih); |
1182 |
|
}; |
1183 |
|
}; |
1184 |
|
}; |
1185 |
|
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
1186 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1187 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1188 |
|
if(pl == 3){ |
1189 |
|
nphit_i++; |
1190 |
|
enhit_i += (op->dedx).At(ih); |
1191 |
|
}; |
1192 |
|
}; |
1193 |
|
}; |
1194 |
|
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
1195 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1196 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1197 |
|
if(pl == 4){ |
1198 |
|
nphit_i++; |
1199 |
|
enhit_i += (op->dedx).At(ih); |
1200 |
|
}; |
1201 |
|
}; |
1202 |
|
}; |
1203 |
|
|
1204 |
|
|
1205 |
if( |
if( |
1206 |
use_TOF && |
(use_TOF || use_S1 || use_S2 || use_S3) && |
1207 |
(nphit_p+nphit_i) !=0 && |
(nphit_p+nphit_i) !=0 && |
1208 |
true){ |
true){ |
1209 |
|
|
1210 |
|
// 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); |
1211 |
|
// printf(" score p %i score i %i \n",tp_score,ti_score); |
1212 |
|
// if( enhit_p > enhit_i ) tp_score++; |
1213 |
|
// if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++; |
1214 |
|
if ( nphit_p > nphit_i ) tp_score++; |
1215 |
|
if ( nphit_p < nphit_i ) ti_score++; |
1216 |
|
if ( nphit_p == nphit_i ){ |
1217 |
|
if ( enhit_p > enhit_i ) tp_score++; |
1218 |
|
else ti_score++; |
1219 |
|
}; |
1220 |
|
// printf(" dopo score p %i score i %i \n",tp_score,ti_score); |
1221 |
|
}; |
1222 |
|
delete tr; |
1223 |
|
// |
1224 |
|
} else { |
1225 |
|
// ------------- |
1226 |
|
// NOT a NUCLEUS |
1227 |
|
// ------------- |
1228 |
|
//printf(" NOT a NUCLEUS! en = %f \n",sen); |
1229 |
|
|
1230 |
|
Int_t nphit_p =0; |
1231 |
|
Int_t nphit_i =0; |
1232 |
|
|
1233 |
|
|
1234 |
|
/* cout << "track: npmtadc "<< op->npmtadc << endl; |
1235 |
|
cout << "track: npmttdc "<< op->npmttdc << endl; |
1236 |
|
cout << "image: npmtadc "<< oi->npmtadc << endl; |
1237 |
|
cout << "image: npmttdc "<< oi->npmttdc << endl;*/ |
1238 |
|
|
1239 |
|
// for (Int_t ih=0; ih < op->npmtadc; ih++){ |
1240 |
|
// Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
1241 |
|
// if(pl == 1 || pl == 2 || pl == 5)nphit_p++; |
1242 |
|
// }; |
1243 |
|
|
1244 |
|
// for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
1245 |
|
// Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
1246 |
|
// if(pl == 1 || pl == 2 || pl == 5)nphit_i++; |
1247 |
|
// }; |
1248 |
|
// --- modified to count tdc signals (more efficient?) |
1249 |
|
// --- and to implement check on tdcflag |
1250 |
|
for (Int_t ih=0; ih < op->npmttdc; ih++){ |
1251 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmttdc).At(ih) ); |
1252 |
|
// if( (op->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_p++; |
1253 |
|
if ( (use_S1 && ( pl == 0 || pl == 1 )) || (use_S2 && ( pl == 2 || pl == 3 )) || (use_S3 && ( pl == 4 || pl == 5 )) ){ |
1254 |
|
if( (op->tdcflag).At(ih)==0 )nphit_p++; |
1255 |
|
}; |
1256 |
|
}; |
1257 |
|
|
1258 |
|
for (Int_t ih=0; ih < oi->npmttdc; ih++){ |
1259 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmttdc).At(ih) ); |
1260 |
|
// if( (oi->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_i++; |
1261 |
|
if ( (use_S1 && ( pl == 0 || pl == 1 )) || (use_S2 && ( pl == 2 || pl == 3 )) || (use_S3 && ( pl == 4 || pl == 5 )) ){ |
1262 |
|
if( (oi->tdcflag).At(ih)==0 )nphit_i++; |
1263 |
|
}; |
1264 |
|
}; |
1265 |
|
|
1266 |
|
if( |
1267 |
|
(nphit_p+nphit_i) !=0 && |
1268 |
|
true){ |
1269 |
|
|
1270 |
if( nphit_p >= nphit_i) tp_score++; |
if ( nphit_p != nphit_i ){ |
1271 |
else ti_score++; |
totp_score += nphit_p; |
1272 |
|
toti_score += nphit_i; |
1273 |
|
tp_score+=nphit_p; |
1274 |
|
ti_score+=nphit_i; |
1275 |
|
}; |
1276 |
|
// if ( nphit_p > nphit_i) tp_score+=nphit_p; |
1277 |
|
// else if( nphit_p < nphit_i) ti_score+=nphit_i; |
1278 |
|
// else ;//niente |
1279 |
|
}; |
1280 |
}; |
}; |
1281 |
// cout << "TOF "<<tp_score<<ti_score<<endl; |
// cout << "TOF "<<tp_score<<ti_score<<endl; |
1282 |
}; |
}; |
1283 |
if(tp_score == ti_score) use_TRK = true; |
|
1284 |
// ------------------------ |
|
1285 |
|
// if(tp_score == ti_score) use_TRK = true; |
1286 |
|
|
1287 |
|
|
1288 |
|
// ----------------------------------------------------------------------------------------- |
1289 |
|
// ***************************************************************************************** |
1290 |
|
// ----------------------------------------------------------------------------------------- |
1291 |
// tracker check |
// tracker check |
1292 |
// ------------------------ |
// ----------------------------------------------------------------------------------------- |
1293 |
// chi**2 difference is not always large enough to distinguish among |
// chi**2 difference is not always large enough to distinguish among |
1294 |
// the real track and its image. |
// the real track and its image. |
1295 |
// Tracker check will be applied always when calorimeter and tof information is ambiguous. |
// Tracker check will be applied always when calorimeter and tof information is ambiguous. |
1296 |
|
// *** MODIFIED ON AUGUST 2007 *** |
1297 |
if(use_TRK){ |
if(use_TRK){ |
1298 |
if( tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ; |
// if( tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ; |
1299 |
else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ; |
// else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ; |
1300 |
// cout << "TRK "<<tp_score<<ti_score<<endl; |
|
1301 |
|
// CHECK 1 : number of points along X |
1302 |
|
if ( tp->GetNX() >= ti->GetNX() ){ |
1303 |
|
tp_score++ ; |
1304 |
|
totp_score++ ; |
1305 |
|
}; |
1306 |
|
if ( tp->GetNX() <= ti->GetNX() ){ |
1307 |
|
ti_score++ ; |
1308 |
|
toti_score++ ; |
1309 |
|
}; |
1310 |
|
// CHECK 2 : number of points along Y |
1311 |
|
if ( tp->GetNY() >= ti->GetNY() ){ |
1312 |
|
tp_score++ ; |
1313 |
|
totp_score++ ; |
1314 |
|
}; |
1315 |
|
if ( tp->GetNY() <= ti->GetNY() ){ |
1316 |
|
ti_score++ ; |
1317 |
|
toti_score++ ; |
1318 |
|
}; |
1319 |
|
|
1320 |
|
// cout << "TRK "<<tp_score<<ti_score<<endl; |
1321 |
}; |
}; |
1322 |
|
|
1323 |
// ------------------------ |
|
1324 |
|
// ----------------------------------------------------------------------------------------- |
1325 |
|
// ***************************************************************************************** |
1326 |
|
// ----------------------------------------------------------------------------------------- |
1327 |
|
// GPamela check |
1328 |
|
// ----------------------------------------------------------------------------------------- |
1329 |
|
|
1330 |
|
//--------------------------------------------------- |
1331 |
|
// count the number of GP hits |
1332 |
|
//--------------------------------------------------- |
1333 |
|
if(use_GP){ |
1334 |
|
int ngphits_p=0; |
1335 |
|
int ngphits_i=0; |
1336 |
|
float toll = 0.02; //200 micron |
1337 |
|
for(int ih=0; ih<GetGPamela()->Nthspe; ih++){ |
1338 |
|
int ip = (Int_t) GetGPamela()->Itrpb[ih] - 1; |
1339 |
|
if( |
1340 |
|
tp && |
1341 |
|
tp->YGood(ip) && |
1342 |
|
fabs(tp->ym[ip]- GetGPamela()->Yavspe[ih])<toll && |
1343 |
|
true) ngphits_p++; |
1344 |
|
if( ti && |
1345 |
|
ti->YGood(ip) && |
1346 |
|
fabs(ti->ym[ip]- GetGPamela()->Yavspe[ih])<toll && |
1347 |
|
true) ngphits_i++; |
1348 |
|
} |
1349 |
|
if( |
1350 |
|
ngphits_p > ngphits_i && |
1351 |
|
true){ |
1352 |
|
tp_score++ ; |
1353 |
|
totp_score++ ; |
1354 |
|
} |
1355 |
|
if( |
1356 |
|
ngphits_p < ngphits_i && |
1357 |
|
true){ |
1358 |
|
ti_score++ ; |
1359 |
|
toti_score++ ; |
1360 |
|
} |
1361 |
|
} |
1362 |
|
|
1363 |
|
|
1364 |
|
// *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* |
1365 |
// the winner is.... |
// the winner is.... |
1366 |
// ------------------------ |
// *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* |
1367 |
if (tp_score > ti_score) { |
if (tp_score > ti_score) { |
1368 |
// ts = tp;//the track sorted by the tracker!! |
|
1369 |
// cs = cp; |
|
|
// os = op; |
|
1370 |
}else if (tp_score < ti_score) { |
}else if (tp_score < ti_score) { |
1371 |
|
|
1372 |
|
|
1373 |
ts = ti;//its image!! |
ts = ti;//its image!! |
1374 |
cs = ci; |
cs = ci; |
1375 |
os = oi; |
os = oi; |
1376 |
|
Int_t totis = toti_score; |
1377 |
|
|
1378 |
ti = tp;//its image!! |
ti = tp;//its image!! |
1379 |
ci = cp; |
ci = cp; |
1383 |
cp = cs; |
cp = cs; |
1384 |
op = os; |
op = os; |
1385 |
|
|
1386 |
|
toti_score = totp_score; |
1387 |
|
totp_score = totis; |
1388 |
|
|
1389 |
|
|
1390 |
}else { |
}else { |
1391 |
// ts = tp; |
|
1392 |
// cs = cp; |
// cout << "Warning - track image ambiguity not solved" << endl; |
1393 |
// os = op; |
|
|
// cout << "Warning - track image ambiguity not solved" << endl; |
|
|
// cout << ts->GetNtot() << " "<< ts->chi2 << " " << npcfit[1] << " "<< nphit_p << endl; |
|
1394 |
}; |
}; |
1395 |
|
|
1396 |
}else{ |
}else{ |
1397 |
// ts = tp; |
totp_score = 1; |
1398 |
// cs = cp; |
toti_score = 0; |
1399 |
// os = op; |
|
1400 |
|
// ts = tp; |
1401 |
|
// cs = cp; |
1402 |
|
// os = op; |
1403 |
}; |
}; |
1404 |
|
|
1405 |
// cout <<" SortTracks() "<<i<<" -- "<<ts<<endl; |
// cout <<" SortTracks() "<<i<<" -- "<<ts<<endl; |
1406 |
// sorted_tracks->Add(ts);//save the track in the sorted array |
// sorted_tracks->Add(ts);//save the track in the sorted array |
1407 |
// sorted_tracks.Add(ts);//save the track in the sorted array |
// sorted_tracks.Add(ts);//save the track in the sorted array |
1408 |
// sorted_tracks.Add(tp);//save the track in the sorted array |
// sorted_tracks.Add(tp);//save the track in the sorted array |
1409 |
// cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl; |
// cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl; |
1410 |
// cout<<"o "<<tp<<endl; |
// cout<<"o "<<tp<<endl; |
1411 |
// cout<<"o "<<cp<<endl; |
// cout<<"o "<<cp<<endl; |
1412 |
// cout<<"o "<<op<<endl; |
// cout<<"o "<<op<<endl; |
1413 |
|
|
1414 |
new(ttsorted[i]) PamTrack(tp,cp,op); |
new(ttsorted[i]) PamTrack(tp,cp,op); |
1415 |
new(ttimage[i]) PamTrack(ti,ci,oi); |
new(ttimage[i]) PamTrack(ti,ci,oi); |
1416 |
|
|
1417 |
|
((PamTrack*)(ttsorted[i]))->SetPScore(totp_score); |
1418 |
|
((PamTrack*)(ttsorted[i]))->SetIScore(toti_score); |
1419 |
|
((PamTrack*)(ttimage[i]))->SetPScore(totp_score); |
1420 |
|
((PamTrack*)(ttimage[i]))->SetIScore(toti_score); |
1421 |
}; |
}; |
1422 |
|
|
1423 |
if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){ |
if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){ |
1424 |
cout << "void PamLevel2::SortTracks(TString how): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl; |
cout << "void PamLevel2::SortTracks(): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl; |
1425 |
tsorted->Delete(); tsorted=0; |
tsorted->Delete(); tsorted=0; |
1426 |
timage->Delete(); timage=0; |
timage->Delete(); timage=0; |
1427 |
} |
} |
1453 |
TClonesArray *PamLevel2::GetTracks(){ |
TClonesArray *PamLevel2::GetTracks(){ |
1454 |
|
|
1455 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1456 |
SortTracks("+CAL+TOF"); |
SortTracks(); |
1457 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1458 |
|
|
1459 |
return tsorted; |
return tsorted; |
1460 |
|
|
1461 |
}; |
}; |
1462 |
//-------------------------------------- |
//-------------------------------------- |
1463 |
// |
// |
1464 |
// |
// |
1465 |
//-------------------------------------- |
//-------------------------------------- |
1466 |
/** |
/** |
1467 |
* Retrieves the it-th Pamela "physical" track. |
* Retrieves the it-th Pamela "physical" track. |
1472 |
|
|
1473 |
// if(!trk2_obj) return 0; |
// if(!trk2_obj) return 0; |
1474 |
|
|
1475 |
// // *-*-*-*-*-*-*-*-*-*-*-*-* |
// // *-*-*-*+-*-*-*-*-*-*-*-*-* |
1476 |
// SortTracks("+CAL+TOF"); |
// SortTracks("+CAL+TOF"); |
1477 |
// // *-*-*-*-*-*-*-*-*-*-*-*-* |
// // *-*-*-*-*-*-*-*-*-*-*-*-* |
1478 |
// // if(!sorted_tracks)return 0; |
// // if(!sorted_tracks)return 0; |
1491 |
|
|
1492 |
// cout << "PamLevel2::GetTrack(int it) "<<endl; |
// cout << "PamLevel2::GetTrack(int it) "<<endl; |
1493 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1494 |
SortTracks("+CAL+TOF"); |
SortTracks(); |
1495 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1496 |
if(!tsorted)return 0; |
if(!tsorted)return 0; |
1497 |
if(!tsorted->GetEntries())return 0; |
if(!tsorted->GetEntries())return 0; |
1548 |
|
|
1549 |
|
|
1550 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1551 |
SortTracks("+CAL+TOF"); |
SortTracks(); |
1552 |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
// *-*-*-*-*-*-*-*-*-*-*-*-* |
1553 |
if(!timage)return 0; |
if(!timage)return 0; |
1554 |
if(!timage->GetEntries())return 0; |
if(!timage->GetEntries())return 0; |
1583 |
*/ |
*/ |
1584 |
TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ){ |
TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ){ |
1585 |
|
|
1586 |
// if( !detlist.IsNull() ) SetWhichTrees(detlist); |
if( detlist.Contains("+AUTO", TString::kIgnoreCase) ) { |
1587 |
// else GetWhichTrees(f); |
cout << "+AUTO"<<endl; |
1588 |
|
GetWhichTrees(f); |
1589 |
|
}; |
1590 |
SetWhichTrees(detlist); |
SetWhichTrees(detlist); |
1591 |
|
|
1592 |
|
if ( pam_tree ){ |
1593 |
|
printf("WARNING: TTree *PamLevel2::GetPamTree(TFile *fl, TString detlist) -- pam_tree already exists!\n "); |
1594 |
|
return pam_tree; |
1595 |
|
}; |
1596 |
|
// |
1597 |
|
|
1598 |
|
cout << "TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ) -- obsolte "<<endl; |
1599 |
|
|
1600 |
|
// SetWhichTrees(detlist); |
1601 |
|
|
1602 |
TTree *Trout =0; |
TTree *Trout =0; |
1603 |
|
|
1604 |
TString fname = f->GetName(); |
TString fname = f->GetName(); |
1605 |
if(!CheckLevel2File(fname))return NULL; |
if(!CheckLevel2File(fname))return NULL; |
1606 |
|
|
1607 |
UInt_t *found=0; |
// UInt_t *found=0; |
1608 |
|
|
1609 |
cout<< "GetPamTree(TFile*,TString): detector list --> "; |
cout<< "GetPamTree(TFile*,TString): detector list --> "; |
1610 |
if(TRK1)cout<<"TRK1 "; |
if(TRK1)cout<<"TRK1 "; |
1618 |
if(ND)cout<<"ND "; |
if(ND)cout<<"ND "; |
1619 |
if(S4)cout<<"S4 "; |
if(S4)cout<<"S4 "; |
1620 |
if(ORB)cout<<"ORB "; |
if(ORB)cout<<"ORB "; |
1621 |
|
if(GP)cout<<"GP "; |
1622 |
cout << endl; |
cout << endl; |
1623 |
|
if(SELLI)cout<<">>> Found selection-list <<<"<<endl; |
1624 |
|
|
1625 |
f->cd(); |
f->cd(); |
1626 |
|
|
1628 |
TTree *T = (TTree*)f->Get("Tracker"); |
TTree *T = (TTree*)f->Get("Tracker"); |
1629 |
if(T && (TRK2||TRK1||TRKh)) { |
if(T && (TRK2||TRK1||TRKh)) { |
1630 |
if(TRK2)T->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
if(TRK2)T->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
1631 |
else T->SetBranchStatus("TrkLevel2",0,found); |
// else T->SetBranchStatus("TrkLevel2",0,found); |
1632 |
if(TRK2)cout << "Tracker : set branch address TrkLevel2"<<endl; |
if(TRK2)cout << "Tracker : set branch address TrkLevel2"<<endl; |
1633 |
if(TRK1)T->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
if(TRK1)T->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
1634 |
else T->SetBranchStatus("TrkLevel1",0,found); |
// else T->SetBranchStatus("TrkLevel1",0,found); |
1635 |
if(TRK1)cout << "Tracker : set branch address TrkLevel1"<<endl; |
if(TRK1)cout << "Tracker : set branch address TrkLevel1"<<endl; |
1636 |
if(TRKh)T->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
if(TRKh)T->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
1637 |
else T->SetBranchStatus("TrkHough",0,found); |
// else T->SetBranchStatus("TrkHough",0,found); |
1638 |
if(TRKh)cout << "Tracker : set branch address TrkHough"<<endl; |
if(TRKh)cout << "Tracker : set branch address TrkHough"<<endl; |
1639 |
if(!Trout)Trout=T; |
if(!Trout)Trout=T; |
1640 |
else Trout->AddFriend(T); |
else Trout->AddFriend(T); |
1645 |
TTree *C = (TTree*)f->Get("Calorimeter"); |
TTree *C = (TTree*)f->Get("Calorimeter"); |
1646 |
if(C && (CAL2||CAL1)) { |
if(C && (CAL2||CAL1)) { |
1647 |
if(CAL2)C->SetBranchAddress("CaloLevel2", GetPointerTo("CaloLevel2")); |
if(CAL2)C->SetBranchAddress("CaloLevel2", GetPointerTo("CaloLevel2")); |
1648 |
else C->SetBranchStatus("CaloLevel2",0,found); |
// else C->SetBranchStatus("CaloLevel2",0,found); |
1649 |
if(CAL2)cout << "Calorimeter : set branch address CaloLevel2"<<endl; |
if(CAL2)cout << "Calorimeter : set branch address CaloLevel2"<<endl; |
1650 |
if(CAL1)C->SetBranchAddress("CaloLevel1", GetPointerTo("CaloLevel1")); |
if(CAL1)C->SetBranchAddress("CaloLevel1", GetPointerTo("CaloLevel1")); |
1651 |
else C->SetBranchStatus("CaloLevel1",0,found); |
// else C->SetBranchStatus("CaloLevel1",0,found); |
1652 |
if(CAL1)cout << "Calorimeter : set branch address CaloLevel1"<<endl; |
if(CAL1)cout << "Calorimeter : set branch address CaloLevel1"<<endl; |
1653 |
if(!Trout)Trout=C; |
if(!Trout)Trout=C; |
1654 |
else Trout->AddFriend(C); |
else Trout->AddFriend(C); |
1671 |
if(R && TRG) { |
if(R && TRG) { |
1672 |
R->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2")); |
R->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2")); |
1673 |
cout << "Trigger : set branch address TrigLevel2"<<endl; |
cout << "Trigger : set branch address TrigLevel2"<<endl; |
1674 |
if(!Trout)Trout=O; |
if(!Trout)Trout=R; |
1675 |
else Trout->AddFriend(R); |
else Trout->AddFriend(R); |
1676 |
}else{ |
}else{ |
1677 |
cout << "Trigger : missing tree"<<endl; |
cout << "Trigger : missing tree"<<endl; |
1681 |
if(S && S4) { |
if(S && S4) { |
1682 |
S->SetBranchAddress("S4Level2", GetPointerTo("S4Level2")); |
S->SetBranchAddress("S4Level2", GetPointerTo("S4Level2")); |
1683 |
cout << "S4 : set branch address S4Level2"<<endl; |
cout << "S4 : set branch address S4Level2"<<endl; |
1684 |
if(!Trout)Trout=O; |
if(!Trout)Trout=S; |
1685 |
else Trout->AddFriend(S); |
else Trout->AddFriend(S); |
1686 |
}else{ |
}else{ |
1687 |
cout << "S4 : missing tree"<<endl; |
cout << "S4 : missing tree"<<endl; |
1691 |
if(N && ND) { |
if(N && ND) { |
1692 |
N->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2")); |
N->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2")); |
1693 |
cout << "NeutronD : set branch address NDLevel2"<<endl; |
cout << "NeutronD : set branch address NDLevel2"<<endl; |
1694 |
if(!Trout)Trout=O; |
if(!Trout)Trout=N; |
1695 |
else Trout->AddFriend(N); |
else Trout->AddFriend(N); |
1696 |
}else{ |
}else{ |
1697 |
cout << "NeutronD : missing tree"<<endl; |
cout << "NeutronD : missing tree"<<endl; |
1701 |
if(A && AC) { |
if(A && AC) { |
1702 |
A->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2")); |
A->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2")); |
1703 |
cout << "Anticounter : set branch address AcLevel2"<<endl; |
cout << "Anticounter : set branch address AcLevel2"<<endl; |
1704 |
if(!Trout)Trout=O; |
if(!Trout)Trout=A; |
1705 |
else Trout->AddFriend(A); |
else Trout->AddFriend(A); |
1706 |
}else{ |
}else{ |
1707 |
cout << "Anticounter : missing tree"<<endl; |
cout << "Anticounter : missing tree"<<endl; |
1711 |
if(B && ORB) { |
if(B && ORB) { |
1712 |
B->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
B->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
1713 |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
1714 |
if(!Trout)Trout=O; |
if(!Trout)Trout=B; |
1715 |
else Trout->AddFriend(B); |
else Trout->AddFriend(B); |
1716 |
}else{ |
}else{ |
1717 |
cout << "OrbitalInfo : missing tree"<<endl; |
cout << "OrbitalInfo : missing tree"<<endl; |
1718 |
}; |
}; |
1719 |
|
|
1720 |
|
// GPamela |
1721 |
|
TTree *G = (TTree*)f->Get("h20"); |
1722 |
|
if(G && GP) { |
1723 |
|
if(!gp_obj)gp_obj=new GPamela(); |
1724 |
|
// ------------------------------------ |
1725 |
|
// ATTENZIONE!!! |
1726 |
|
// non so per quale arcano motivo, |
1727 |
|
// per l'albero di gpamela il branch address lo devo settare |
1728 |
|
// DOPO aver fatto friend |
1729 |
|
// FGRRRVZZZZUTSALKJMSLKJ!!! |
1730 |
|
// ------------------------------------ |
1731 |
|
// gp_obj->SetBranchAddress(G); //ho dovuto fare in maniera diversa dagli altri |
1732 |
|
// cout << "h20 : set branch address GPamela "<<endl; |
1733 |
|
if(!Trout)Trout=G; |
1734 |
|
else Trout->AddFriend(G); |
1735 |
|
}else{ |
1736 |
|
// cout << "h20 : missing tree"<<endl; |
1737 |
|
}; |
1738 |
|
|
1739 |
|
|
1740 |
|
TTree *L = (TTree*)f->Get("SelectionList"); |
1741 |
|
if(L && SELLI==1) { |
1742 |
|
cout << " TTree *PamLevel2::GetPamTree(TFile, TString) >>> SelectionList not implemented!!!!"<<endl; |
1743 |
|
sel_tree = 0; |
1744 |
|
}else{ |
1745 |
|
cout << "SelectionList : missing tree"<<endl; |
1746 |
|
}; |
1747 |
|
|
1748 |
cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
1749 |
|
|
1750 |
|
// ------------------------------------ |
1751 |
|
// ATTENZIONE!!! |
1752 |
|
// non so per quale arcano motivo, |
1753 |
|
// per l'albero di gpamela il branch address lo devo settare |
1754 |
|
// DOPO aver fatto friend |
1755 |
|
// FGRRRVZZZZUTSALKJMSLKJ!!! |
1756 |
|
// ------------------------------------ |
1757 |
|
if(G && GP) { |
1758 |
|
gp_obj->SetBranchAddress(Trout); //ho dovuto fare in maniera diversa dagli altri |
1759 |
|
cout << "h20 : set branch address GPamela "<<endl; |
1760 |
|
}else{ |
1761 |
|
cout << "h20 : missing tree"<<endl; |
1762 |
|
}; |
1763 |
|
|
1764 |
|
pam_tree = (TChain*)Trout; |
1765 |
|
|
1766 |
return Trout; |
return Trout; |
1767 |
|
|
1781 |
|
|
1782 |
TString wdir = gSystem->WorkingDirectory(); |
TString wdir = gSystem->WorkingDirectory(); |
1783 |
|
|
1784 |
if(ddir=="")ddir = wdir; |
// if(ddir=="")ddir = wdir; |
1785 |
// TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
// TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
1786 |
cout << "Level2 data directory : "<< ddir << endl; |
if ( ddir != ""){ |
1787 |
|
cout << "Level2 data directory : "<< ddir << endl; |
1788 |
|
} else { |
1789 |
|
cout << "Level2 data directory not given as input: trying to evaluate from list or taking working directory " << endl; |
1790 |
|
}; |
1791 |
TList *contents = new TList; // create output list |
TList *contents = new TList; // create output list |
1792 |
contents->SetOwner(); |
contents->SetOwner(); |
1793 |
|
|
1803 |
// return 0; |
// return 0; |
1804 |
// } |
// } |
1805 |
// flisttxt = fullpath; |
// flisttxt = fullpath; |
1806 |
|
if ( !flisttxt.EndsWith(".root") ){ |
1807 |
|
|
1808 |
flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
1809 |
|
|
1810 |
if( !gSystem->ChangeDirectory(ddir) ){ |
if( !gSystem->ChangeDirectory(ddir) ){ |
1811 |
cout << "Cannot change directory : "<<ddir<<endl; |
cout << "Cannot change directory : "<<ddir<<endl; |
1812 |
return 0; |
return 0; |
|
} |
|
|
|
|
|
cout <<"Input file list : " << flisttxt <<endl; |
|
|
ifstream in; |
|
|
in.open(flisttxt, ios::in); //open input file list |
|
|
if(!in.good()){ |
|
|
cout <<" ERROR opening the file "<<endl; |
|
|
gSystem->ChangeDirectory(wdir); // back to the working directory |
|
|
return 0; |
|
|
} |
|
|
int line=0; |
|
|
while (1) { |
|
|
TString file; |
|
|
in >> file; |
|
|
if (!in.good()) break; |
|
|
line++; |
|
|
// cout <<"(1) " << file << endl; |
|
|
if(file.IsNull()){ |
|
|
cout << "-- list interrupted at line "<<line <<endl; |
|
|
break; |
|
1813 |
} |
} |
1814 |
if(file.Contains("#"))file = file(0,file.First("#")); |
|
1815 |
|
cout <<"Input file list : " << flisttxt <<endl; |
1816 |
|
ifstream in; |
1817 |
|
in.open(flisttxt, ios::in); //open input file list |
1818 |
|
if(!in.good()){ |
1819 |
|
cout <<" ERROR opening the file "<<endl; |
1820 |
|
gSystem->ChangeDirectory(wdir); // back to the working directory |
1821 |
|
return 0; |
1822 |
|
} |
1823 |
|
int line=0; |
1824 |
|
while (1) { |
1825 |
|
TString file; |
1826 |
|
in >> file; |
1827 |
|
if (!in.good()) break; |
1828 |
|
line++; |
1829 |
|
// cout <<"(1) " << file << endl; |
1830 |
|
if(file.IsNull()){ |
1831 |
|
cout << "-- list interrupted at line "<<line <<endl; |
1832 |
|
break; |
1833 |
|
} |
1834 |
|
if(file.Contains("#"))file = file(0,file.First("#")); |
1835 |
// cout <<"(2) " << file << endl; |
// cout <<"(2) " << file << endl; |
1836 |
// if( gSystem->IsFileInIncludePath(file,&fullpath) ){ |
// if( gSystem->IsFileInIncludePath(file,&fullpath) ){ |
1837 |
// if( (fullpath = gSystem->FindFile(ddir,file)) ){ |
// if( (fullpath = gSystem->FindFile(ddir,file)) ){ |
1838 |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(ddir),gSystem->BaseName(file)); |
if( file.EndsWith(".root") ){ |
1839 |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
TString filedir; |
1840 |
delete fullpath; |
if (ddir != ""){ |
1841 |
|
filedir = ddir; // take the input dir |
1842 |
|
} else { |
1843 |
|
gSystem->ChangeDirectory(wdir); // back to the working directory |
1844 |
|
filedir = gSystem->DirName(file); // this will take the path if exist in the list otherwise it will return automatically the working dir |
1845 |
|
}; |
1846 |
|
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(filedir),gSystem->BaseName(file)); |
1847 |
|
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
1848 |
|
delete fullpath; |
1849 |
|
} |
1850 |
// }else{ |
// }else{ |
1851 |
// if(file.Data()!="")cout << "File: "<<file<<" ---> missing "<< endl; |
// if(file.Data()!="")cout << "File: "<<file<<" ---> missing "<< endl; |
1852 |
// }; |
// }; |
1853 |
}; |
}; |
1854 |
in.close(); |
in.close(); |
1855 |
|
} else { |
1856 |
|
if(flisttxt.Contains("#"))flisttxt = flisttxt(0,flisttxt.First("#")); |
1857 |
|
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
1858 |
|
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
1859 |
|
delete fullpath; |
1860 |
|
}; |
1861 |
}else{ |
}else{ |
1862 |
|
|
1863 |
cout << "No input file list given."<<endl; |
cout << "No input file list given."<<endl; |
1864 |
cout << "Check for existing root files."<<endl; |
cout << "Check for existing root files."<<endl; |
1865 |
// cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl; |
// cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl; |
1866 |
|
if ( ddir == "" ){ |
1867 |
|
ddir = wdir; |
1868 |
|
cout << "Level2 data directory : "<< ddir << endl; |
1869 |
|
}; |
1870 |
|
|
1871 |
TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
1872 |
TList *temp = datadir->GetListOfFiles(); |
TList *temp = datadir->GetListOfFiles(); |
1873 |
// temp->Print(); |
// temp->Print(); |
1911 |
* @return Pointer to a TChain |
* @return Pointer to a TChain |
1912 |
*/ |
*/ |
1913 |
TChain *PamLevel2::GetPamTree(TList *fl, TString detlist ){ |
TChain *PamLevel2::GetPamTree(TList *fl, TString detlist ){ |
1914 |
|
// |
1915 |
|
// |
1916 |
|
// |
1917 |
|
if ( pam_tree ){ |
1918 |
|
printf("WARNING: TChain *PamLevel2::GetPamTree(TList *fl, TString detlist) -- pam_tree already exists!\n "); |
1919 |
|
return pam_tree; |
1920 |
|
}; |
1921 |
|
// |
1922 |
|
|
1923 |
TChain *Trout =0; |
TChain *Trout =0; |
1924 |
|
|
1925 |
// if( !detlist.IsNull() )SetWhichTrees(detlist); |
// ------------------------------------------- |
1926 |
SetWhichTrees(detlist); |
// set flags to include/exclude trees/branches |
1927 |
|
// ------------------------------------------- |
1928 |
cout<< "GetPamTree(TList*,TString): input detector list --> "; |
if( detlist.Contains("+AUTO", TString::kIgnoreCase) ) { |
1929 |
if(TRK1)cout<<"TRK1 "; |
if( fl->GetEntries()>0 ){ |
1930 |
if(TRK2)cout<<"TRK2 "; |
cout << "+AUTO"<<endl; |
1931 |
if(TRKh)cout<<"TRKH "; |
TFile *fprimo = new TFile( fl->At(0)->GetName() ); |
1932 |
if(CAL1)cout<<"CAL1 "; |
GetWhichTrees(fprimo); |
1933 |
if(CAL2)cout<<"CAL2 "; |
fprimo->Close();// AAAAARGGGGGHHHHH!!!!!!! non commentare questa riga, altrimenti si incasina il TChain |
1934 |
if(TOF)cout<<"TOF "; |
fprimo->Delete(); |
1935 |
if(TRG)cout<<"TRG "; |
} |
1936 |
if(AC)cout<<"AC "; |
}; |
1937 |
if(ND)cout<<"ND "; |
SetWhichTrees(detlist); |
|
if(S4)cout<<"S4 "; |
|
|
if(ORB)cout<<"ORB "; |
|
|
cout << endl; |
|
1938 |
|
|
1939 |
|
|
1940 |
|
// ------------------------------------------- |
1941 |
|
// build chains |
1942 |
|
// ------------------------------------------- |
1943 |
TChain *T = 0; |
TChain *T = 0; |
1944 |
TChain *C = 0; |
TChain *C = 0; |
1945 |
TChain *O = 0; |
TChain *O = 0; |
1948 |
TChain *N = 0; |
TChain *N = 0; |
1949 |
TChain *A = 0; |
TChain *A = 0; |
1950 |
TChain *B = 0; |
TChain *B = 0; |
1951 |
|
TChain *G = 0; |
1952 |
|
|
1953 |
|
TChain *L = 0; |
1954 |
|
|
1955 |
if(TRK2||TRK1||TRKh) T = new TChain("Tracker"); |
if(TRK2||TRK1||TRKh) T = new TChain("Tracker"); |
1956 |
if(CAL2||CAL1) C = new TChain("Calorimeter"); |
if(CAL2||CAL1) C = new TChain("Calorimeter"); |
1960 |
if(ND) N = new TChain("NeutronD"); |
if(ND) N = new TChain("NeutronD"); |
1961 |
if(AC) A = new TChain("Anticounter"); |
if(AC) A = new TChain("Anticounter"); |
1962 |
if(ORB) B = new TChain("OrbitalInfo"); |
if(ORB) B = new TChain("OrbitalInfo"); |
1963 |
|
if(GP) G = new TChain("h20"); |
1964 |
|
L = new TChain("SelectionList"); |
1965 |
|
|
1966 |
// loop over files and create chains |
// loop over files and create chains |
1967 |
TIter next(fl); |
TIter next(fl); |
1978 |
if(ND) N->Add(name); |
if(ND) N->Add(name); |
1979 |
if(AC) A->Add(name); |
if(AC) A->Add(name); |
1980 |
if(ORB) B->Add(name); |
if(ORB) B->Add(name); |
1981 |
|
if(GP) G->Add(name); |
1982 |
|
if(SELLI==1) L->Add(name); |
1983 |
}; |
}; |
1984 |
} |
}; |
1985 |
|
|
1986 |
cout << "done chain \n"; |
cout << "done chains\n"; |
1987 |
|
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
1988 |
|
|
1989 |
|
|
1990 |
|
// ------------------------------------------- |
1991 |
|
// make friends |
1992 |
|
// ------------------------------------------- |
1993 |
|
|
|
UInt_t *found=0; |
|
1994 |
// Tracker |
// Tracker |
1995 |
|
cout << "Friends: "<<endl; |
1996 |
if(T && (TRK2||TRK1||TRKh)) { |
if(T && (TRK2||TRK1||TRKh)) { |
|
if(TRK2)T->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
|
|
else T->SetBranchStatus("TrkLevel2",0,found); |
|
|
if(TRK2)cout << "Tracker : set branch address TrkLevel2"<<endl; |
|
|
if(TRK1)T->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
|
|
else T->SetBranchStatus("TrkLevel1",0,found); |
|
|
if(TRK1)cout << "Tracker : set branch address TrkLevel1"<<endl; |
|
|
if(TRKh)T->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
|
|
else T->SetBranchStatus("TrkHough",0,found); |
|
|
if(TRKh)cout << "Tracker : set branch address TrkHough"<<endl; |
|
1997 |
if(!Trout)Trout=T; |
if(!Trout)Trout=T; |
1998 |
else Trout->AddFriend("Tracker"); |
else Trout->AddFriend("Tracker"); |
1999 |
}else{ |
// cout << "+Tacker"<<endl; |
|
cout << "Tracker : missing tree"<<endl; |
|
2000 |
}; |
}; |
2001 |
// Calorimeter |
// Calorimeter |
2002 |
if(C && (CAL2||CAL1)) { |
if(C && (CAL2||CAL1)) { |
|
if(CAL2)C->SetBranchAddress("CaloLevel2", GetPointerTo("CaloLevel2")); |
|
|
else C->SetBranchStatus("CaloLevel2",0,found); |
|
|
if(CAL2)cout << "Calorimeter : set branch address CaloLevel2"<<endl; |
|
|
if(CAL1)C->SetBranchAddress("CaloLevel1", GetPointerTo("CaloLevel1")); |
|
|
else C->SetBranchStatus("CaloLevel1",0,found); |
|
|
if(CAL1)cout << "Calorimeter : set branch address CaloLevel1"<<endl; |
|
2003 |
if(!Trout)Trout=C; |
if(!Trout)Trout=C; |
2004 |
else Trout->AddFriend("Calorimeter"); |
else Trout->AddFriend("Calorimeter"); |
2005 |
}else{ |
// cout << "+Calorimeter"<<endl; |
|
cout << "Calorimeter : missing tree"<<endl; |
|
2006 |
}; |
}; |
2007 |
// ToF |
// ToF |
2008 |
if(O && TOF) { |
if(O && TOF) { |
|
O->SetBranchAddress("ToFLevel2", GetPointerTo("ToFLevel2")); |
|
|
cout << "ToF : set branch address ToFLevel2"<<endl; |
|
2009 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2010 |
else Trout->AddFriend("ToF"); |
else Trout->AddFriend("ToF"); |
2011 |
}else{ |
// cout << "+ToF"<<endl; |
|
cout << "ToF : missing tree"<<endl; |
|
2012 |
}; |
}; |
2013 |
// Trigger |
// Trigger |
2014 |
if(R && TRG) { |
if(R && TRG) { |
|
R->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2")); |
|
|
cout << "Trigger : set branch address TrigLevel2"<<endl; |
|
2015 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2016 |
else Trout->AddFriend("Trigger"); |
else Trout->AddFriend("Trigger"); |
2017 |
}else{ |
// cout << "+Trigger"<<endl; |
|
cout << "Trigger : missing tree"<<endl; |
|
2018 |
}; |
}; |
2019 |
// S4 |
// S4 |
2020 |
if(S && S4) { |
if(S && S4) { |
|
S->SetBranchAddress("S4Level2", GetPointerTo("S4Level2")); |
|
|
cout << "S4 : set branch address S4Level2"<<endl; |
|
2021 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2022 |
else Trout->AddFriend("S4"); |
else Trout->AddFriend("S4"); |
2023 |
}else{ |
// cout << "+S4"<<endl; |
|
cout << "S4 : missing tree"<<endl; |
|
2024 |
}; |
}; |
2025 |
// Neutron Detector |
// Neutron Detector |
2026 |
if(N && ND) { |
if(N && ND) { |
|
N->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2")); |
|
|
cout << "NeutronD : set branch address NDLevel2"<<endl; |
|
2027 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2028 |
else Trout->AddFriend("NeutronD"); |
else Trout->AddFriend("NeutronD"); |
2029 |
}else{ |
// cout << "+NeutronD"<<endl; |
|
cout << "NeutronD : missing tree"<<endl; |
|
2030 |
}; |
}; |
2031 |
// Anticounters |
// Anticounters |
2032 |
if(A && AC) { |
if(A && AC) { |
|
A->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2")); |
|
|
cout << "Anticounter : set branch address AcLevel2"<<endl; |
|
2033 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2034 |
else Trout->AddFriend("Anticounter"); |
else Trout->AddFriend("Anticounter"); |
2035 |
}else{ |
// cout << "+Anticounter"<<endl; |
|
cout << "Anticounter : missing tree"<<endl; |
|
2036 |
}; |
}; |
2037 |
// Orbital Info |
// Orbital Info |
2038 |
if(B && ORB) { |
if(B && ORB) { |
|
B->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
|
|
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
|
2039 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
2040 |
else Trout->AddFriend("OrbitalInfo"); |
else Trout->AddFriend("OrbitalInfo"); |
2041 |
}else{ |
// cout << "+OrbitalInfo"<<endl; |
2042 |
cout << "OrbitalInfo : missing tree"<<endl; |
}; |
2043 |
|
// GPamela |
2044 |
|
if(G && GP) { |
2045 |
|
if(!Trout)Trout=G; |
2046 |
|
else Trout->AddFriend("h20"); |
2047 |
|
// cout << "+h20"<<endl; |
2048 |
}; |
}; |
|
|
|
|
// cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
|
2049 |
|
|
2050 |
|
// ===================================== |
2051 |
// // Tracker |
// SET BRANCH-ADDRESS AFTER CHAIN+FRIEND |
2052 |
// if(TRK2||TRK1||TRKh){ |
// ===================================== |
2053 |
// if(!Tout)Tout=T; |
SetBranchAddress(Trout); |
2054 |
// else Tout->AddFriend("Tracker"); |
|
2055 |
// } |
|
2056 |
// // Calorimeter |
// ------------------------------------ |
2057 |
// if(CAL2||CAL1) { |
// finally handle selection trees... |
2058 |
// if(!Tout)Tout=C; |
// (it is not friend of pamela tree) |
2059 |
// else Tout->AddFriend("Calorimeter"); |
// ------------------------------------ |
2060 |
// }; |
|
2061 |
// // ToF |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
2062 |
// if(TOF) { |
|
2063 |
// if(!Tout)Tout=O; |
// Selection List |
2064 |
// else Tout->AddFriend("ToF"); |
if(L && SELLI==1) { |
2065 |
// }; |
cout<<">>> Found selection-list <<<"<<endl; |
2066 |
// // Trigger |
// L->SetBranchAddress("RunEntry",&irun); |
2067 |
// if(TRG) { |
L->SetBranchAddress("RunEntry",&irunt);//NEWNEW |
2068 |
// if(!Tout)Tout=R; |
cout << "SelectionList: set branch address RunEntry"<<endl; |
2069 |
// else Tout->AddFriend("Trigger"); |
L->SetBranchAddress("EventEntry",&irunentry); |
2070 |
// }; |
cout << "SelectionList: set branch address EventEntry"<<endl; |
2071 |
// // S4 |
sel_tree = L; |
2072 |
// if(S4) { |
// if(!Trout)Trout=O; |
2073 |
// if(!Tout)Tout=S; |
// else Trout->AddFriend("SelectionList"); |
2074 |
// else Tout->AddFriend("S4"); |
cout << "+SelectionList"<<endl; |
2075 |
// }; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
2076 |
// // Neutron Detector |
}else{ |
2077 |
// if(ND) { |
// cout << "SelectionList : missing tree"<<endl; |
2078 |
// if(!Tout)Tout=N; |
if(L)L->Delete(); |
2079 |
// else Tout->AddFriend("NeutronD"); |
}; |
2080 |
// }; |
|
2081 |
// // Anticounters |
// -------------------------------------------- |
2082 |
// if(AC) { |
// return the pamela chain with all the friends |
2083 |
// if(!Tout)Tout=A; |
// -------------------------------------------- |
2084 |
// else Tout->AddFriend("Anticounter"); |
|
2085 |
// }; |
pam_tree = Trout; |
|
// // OrbitalInfo |
|
|
// if(ORB) { |
|
|
// if(!Tout)Tout=B; |
|
|
// else Tout->AddFriend("OrbitalInfo"); |
|
|
// }; |
|
|
|
|
|
// cout<<endl<<" Number of entries: "<<Tout->GetEntries()<<endl<<endl; |
|
|
|
|
|
// if( Tout->GetEntries() )PamLevel2::SetBranchAddress( Tout ); |
|
2086 |
|
|
2087 |
return Trout; |
return Trout; |
2088 |
} |
} |
2109 |
ND = ND & t->GetBranchStatus("NDLevel2"); |
ND = ND & t->GetBranchStatus("NDLevel2"); |
2110 |
AC = AC & t->GetBranchStatus("AcLevel2"); |
AC = AC & t->GetBranchStatus("AcLevel2"); |
2111 |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
2112 |
|
GP = GP & t->GetBranchStatus("h20"); |
2113 |
|
|
2114 |
|
|
2115 |
// Tracker |
// Tracker |
2166 |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
2167 |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
2168 |
}; |
}; |
2169 |
|
// GPamela |
2170 |
|
if(GP) { |
2171 |
|
// GetPointerTo("GPamela"); |
2172 |
|
if(!gp_obj)gp_obj = new GPamela(); |
2173 |
|
gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2174 |
|
// t->SetBranchAddress("GPamela", GetPointerTo("GPamela")); |
2175 |
|
cout << "h20 : set branch address GPamela "<<endl; |
2176 |
|
}; |
2177 |
|
|
2178 |
} |
} |
2179 |
/** |
/** |
2181 |
*/ |
*/ |
2182 |
void PamLevel2::SetBranchAddress(TChain *t){ |
void PamLevel2::SetBranchAddress(TChain *t){ |
2183 |
|
|
2184 |
TRK2 = TRK2 & t->GetBranchStatus("TrkLevel2"); |
// TRK2 = TRK2 & t->GetBranchStatus("TrkLevel2"); |
2185 |
TRK1 = TRK1 & t->GetBranchStatus("TrkLevel1"); |
// TRK1 = TRK1 & t->GetBranchStatus("TrkLevel1"); |
2186 |
TRKh = TRKh & t->GetBranchStatus("TrkHough"); |
// TRKh = TRKh & t->GetBranchStatus("TrkHough"); |
2187 |
CAL1 = CAL1 & t->GetBranchStatus("CaloLevel1"); |
// CAL1 = CAL1 & t->GetBranchStatus("CaloLevel1"); |
2188 |
CAL2 = CAL2 & t->GetBranchStatus("CaloLevel2"); |
// CAL2 = CAL2 & t->GetBranchStatus("CaloLevel2"); |
2189 |
TOF = TOF & t->GetBranchStatus("ToFLevel2"); |
// TOF = TOF & t->GetBranchStatus("ToFLevel2"); |
2190 |
TRG = TRG & t->GetBranchStatus("TrigLevel2"); |
// TRG = TRG & t->GetBranchStatus("TrigLevel2"); |
2191 |
S4 = S4 & t->GetBranchStatus("S4Level2"); |
// S4 = S4 & t->GetBranchStatus("S4Level2"); |
2192 |
ND = ND & t->GetBranchStatus("NDLevel2"); |
// ND = ND & t->GetBranchStatus("NDLevel2"); |
2193 |
AC = AC & t->GetBranchStatus("AcLevel2"); |
// AC = AC & t->GetBranchStatus("AcLevel2"); |
2194 |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
// ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
2195 |
|
// GP = GP & t->GetBranchStatus("h20"); |
2196 |
|
|
2197 |
// Tracker |
// Tracker |
2198 |
if(TRK2) { |
if(TRK2) { |
2199 |
t->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
t->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
2200 |
cout << "Tracker : set branch address TrkLevel2"<<endl; |
cout << "Tracker : set branch address TrkLevel2"<<endl; |
2201 |
}; |
}; |
2203 |
t->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
t->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
2204 |
cout << "Tracker : set branch address TrkLevel1"<<endl; |
cout << "Tracker : set branch address TrkLevel1"<<endl; |
2205 |
}; |
}; |
2206 |
if(TRKh) { |
if(TRKh) { |
2207 |
t->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
t->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
2208 |
cout << "Tracker : set branch address TrkHough"<<endl; |
cout << "Tracker : set branch address TrkHough"<<endl; |
2209 |
}; |
}; |
2210 |
|
|
2211 |
// Calorimeter |
// Calorimeter |
2212 |
if(CAL2) { |
if(CAL2) { |
2248 |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
2249 |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
2250 |
}; |
}; |
2251 |
|
// GPamela |
2252 |
|
// cout <<"GP "<<GP<<endl; |
2253 |
|
if(GP) { |
2254 |
|
// GetPointerTo("GPamela"); |
2255 |
|
if(!gp_obj)gp_obj = new GPamela(); |
2256 |
|
gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
2257 |
|
cout << "h20 : set branch address GPamela "<<endl; |
2258 |
|
}; |
2259 |
|
// SelectionList |
2260 |
|
// if(SELLI==1){ |
2261 |
|
// t->SetBranchAddress("RunEntry",&irunt);//NEWNEW |
2262 |
|
// cout << "SelectionList: set branch address RunEntry"<<endl; |
2263 |
|
// t->SetBranchAddress("EventEntry",&irunentry); |
2264 |
|
// cout << "SelectionList: set branch address EventEntry"<<endl; |
2265 |
|
|
2266 |
|
// } |
2267 |
|
|
2268 |
} |
} |
2269 |
|
|
2270 |
|
|
2278 |
* @return Pointer to a TChain |
* @return Pointer to a TChain |
2279 |
*/ |
*/ |
2280 |
TChain *PamLevel2::GetRunTree(TList *fl){ |
TChain *PamLevel2::GetRunTree(TList *fl){ |
2281 |
|
// |
2282 |
|
// |
2283 |
|
// |
2284 |
|
if ( run_tree ){ |
2285 |
|
printf("WARNING: TChain *PamLevel2::GetRunTree(TList *fl) -- run_tree already exists!\n "); |
2286 |
|
return run_tree; |
2287 |
|
}; |
2288 |
|
// |
2289 |
|
|
2290 |
|
|
2291 |
TChain *R = new TChain("Run"); |
TChain *R = new TChain("Run"); |
2292 |
|
|
2293 |
// loop over files and create chains |
// loop over files and create chains |
2301 |
}; |
}; |
2302 |
} |
} |
2303 |
|
|
2304 |
R->SetBranchAddress("RunInfo", GetPointerTo("RunInfo")); |
|
2305 |
cout << "Run : set branch address RunInfo"<<endl; |
if(RUN && R->GetNtrees()){ |
|
R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
|
|
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
|
2306 |
|
|
2307 |
|
R->SetBranchAddress("RunInfo", GetPointerTo("RunInfo")); |
2308 |
|
cout << "Run : set branch address RunInfo"<<endl; |
2309 |
|
R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
2310 |
|
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
2311 |
|
|
2312 |
|
irunoffset = new int[R->GetNtrees()]; |
2313 |
|
if(DBG){ |
2314 |
|
cout << "----------------------------------------------------"<<endl; |
2315 |
|
cout << "irun\t | "; |
2316 |
|
cout << "tree\t |"; |
2317 |
|
// cout << "offset\t |"; |
2318 |
|
cout << "RUN\t"; |
2319 |
|
cout << "FRAG\t"; |
2320 |
|
cout << "NEVENTS\t"; |
2321 |
|
cout << "absolute time\t\t\t"; |
2322 |
|
cout << "on-board time"; |
2323 |
|
cout<<endl; |
2324 |
|
} |
2325 |
|
for (Int_t ii=0; ii<R->GetEntries(); ii++){ |
2326 |
|
R->GetEntry(ii); |
2327 |
|
if(DBG){ |
2328 |
|
cout << ii<< "\t | "; |
2329 |
|
cout << R->GetTreeNumber()<< "\t |"; |
2330 |
|
// cout << R->GetChainOffset()<< "\t |"; |
2331 |
|
cout <<GetRunInfo()->ID<<"\t"; |
2332 |
|
cout <<GetRunInfo()->ID_RUN_FRAG<<"\t"; |
2333 |
|
cout <<GetRunInfo()->NEVENTS<< "\t"; |
2334 |
|
cout <<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME <<"\t"; |
2335 |
|
cout <<GetRunInfo()->RUNHEADER_OBT<<" <---> "<<GetRunInfo()->RUNTRAILER_OBT<<"\t"; |
2336 |
|
cout <<endl; |
2337 |
|
} |
2338 |
|
irunoffset[R->GetTreeNumber()]=R->GetChainOffset(); |
2339 |
|
} |
2340 |
|
cout << "N.run = "<<R->GetEntries()<<endl; |
2341 |
|
cout << "----------------------------------------------------"<<endl; |
2342 |
|
|
2343 |
|
|
2344 |
|
}else{ |
2345 |
|
delete R; |
2346 |
|
R=0; |
2347 |
|
} |
2348 |
|
|
2349 |
|
|
2350 |
|
run_tree = R; |
2351 |
|
|
2352 |
return R; |
return R; |
2353 |
|
|
2354 |
} |
} |
2362 |
* @return Pointer to a TTree |
* @return Pointer to a TTree |
2363 |
*/ |
*/ |
2364 |
TTree *PamLevel2::GetRunTree(TFile *f){ |
TTree *PamLevel2::GetRunTree(TFile *f){ |
2365 |
|
if ( run_tree ){ |
2366 |
|
printf("WARNING: TTree *PamLevel2::GetRunTree(TFile *f) -- run_tree already exists!\n "); |
2367 |
|
return run_tree; |
2368 |
|
}; |
2369 |
|
|
2370 |
|
|
2371 |
|
cout << "TTree *PamLevel2::GetRunTree(TFile *f) -- obsolte "<<endl; |
2372 |
|
|
2373 |
TTree *R = (TTree*)f->Get("Run"); |
TTree *T = (TTree*)f->Get("Run"); |
|
|
|
|
R->SetBranchAddress("RunInfo", GetPointerTo("RunInfo")); |
|
|
cout << "Run : set branch address RunInfo"<<endl; |
|
|
R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
|
|
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
|
2374 |
|
|
2375 |
return R; |
if(T){ |
2376 |
|
T->SetBranchAddress("RunInfo", GetPointerTo("RunInfo")); |
2377 |
|
cout << "Run : set branch address RunInfo"<<endl; |
2378 |
|
T->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
2379 |
|
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
2380 |
|
|
2381 |
|
} |
2382 |
|
|
2383 |
|
run_tree = (TChain*)T; |
2384 |
|
|
2385 |
|
return T; |
2386 |
|
|
2387 |
} |
} |
2388 |
/** |
/** |
2390 |
* @param run Pointer to the chain/tree which contains run infos |
* @param run Pointer to the chain/tree which contains run infos |
2391 |
* @return true if a new run has been read, false if it is still the same run |
* @return true if a new run has been read, false if it is still the same run |
2392 |
*/ |
*/ |
2393 |
Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev){ |
Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev){ |
2394 |
// |
// |
2395 |
// check if we have already called once GetEntry, if not call it |
// check if we have already called once GetEntry, if not call it |
2396 |
// |
// |
2397 |
if ( run->GetEntries() <= 0 ) return(false); |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- ATTENZIONE --- NON E` MANTENUTA!!!!!!!.... "<<endl; |
2398 |
// |
if(!run){ |
2399 |
Int_t oldrun = irun; |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree "<<endl; |
2400 |
if ( irun < 0 ){ |
return(false); |
2401 |
irun = 0; |
} |
2402 |
run->GetEntry(0); |
if ( run->GetEntries() <= 0 ) return(false); |
2403 |
runfirstentry = 0ULL; |
// |
2404 |
runlastentry += (ULong64_t)(this->GetRunInfo()->NEVENTS) - 1ULL; |
|
2405 |
}; |
// Int_t oldrun = irun; |
2406 |
while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
Long64_t oldrun = irun; |
2407 |
// printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS))); |
|
2408 |
irun++; |
// -------------------------------------- |
2409 |
run->GetEntry(irun); |
// if it is a full file (not preselected) |
2410 |
runfirstentry = runlastentry+1ULL; |
// -------------------------------------- |
2411 |
runlastentry += (ULong64_t)(this->GetRunInfo()->NEVENTS); |
if(SELLI==0){ |
2412 |
}; |
|
2413 |
// |
// |
2414 |
if ( irun == oldrun || irun >= run->GetEntries() ) return(false); |
// the absolute time is necessary to relate the event with the run |
2415 |
// |
// |
2416 |
// printf(" iev %llu irun %i nevents %u 1st %llu last %llu \n",iev,irun,this->GetRunInfo()->NEVENTS,(ULong64_t)runfirstentry,(ULong64_t)runlastentry); |
if( !GetOrbitalInfo() && !ISGP){ |
2417 |
// |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
2418 |
return(true); |
return(false); |
2419 |
// |
} |
2420 |
|
|
2421 |
|
ULong64_t abstime = 0; |
2422 |
|
if( GetOrbitalInfo() )abstime=GetOrbitalInfo()->absTime; |
2423 |
|
|
2424 |
|
|
2425 |
|
// |
2426 |
|
// the first time the routine is called, set run search from the beginning |
2427 |
|
// |
2428 |
|
if ( irun < 0LL ){ |
2429 |
|
irun = 0LL; |
2430 |
|
run->GetEntry(irun); |
2431 |
|
runfirstentry = 0LL; |
2432 |
|
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2433 |
|
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
2434 |
|
|
2435 |
|
if( ISGP && run->GetEntries()!=1 ){ |
2436 |
|
cout << "** WARNING ** simulated files are assumed to have 1 single run, not "<< run->GetEntries() << endl; |
2437 |
|
cout << "** WARNING ** run will not be updated"<<endl; |
2438 |
|
} |
2439 |
|
|
2440 |
|
}; |
2441 |
|
// |
2442 |
|
if(ISGP)abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO |
2443 |
|
// |
2444 |
|
if ( irun == run->GetEntries()-1LL && |
2445 |
|
!(abstime >= GetRunInfo()->RUNHEADER_TIME && |
2446 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
2447 |
|
){ |
2448 |
|
irun = -1LL; |
2449 |
|
irunt = -1LL; |
2450 |
|
runfirstentry = 0LL; |
2451 |
|
runlastentry = -1LL; |
2452 |
|
}; |
2453 |
|
// modificato il controllo sull'aggiornamento del run, per evitare problemi |
2454 |
|
// dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!) |
2455 |
|
// |
2456 |
|
bool fromfirst = true; |
2457 |
|
// |
2458 |
|
while ( !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries()-1LL ){ |
2459 |
|
// while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
2460 |
|
irun++; |
2461 |
|
run->GetEntry(irun); |
2462 |
|
runfirstentry = runlastentry; |
2463 |
|
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runfirstentry += 1LL; |
2464 |
|
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2465 |
|
// cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2466 |
|
// cout << "runfirstentry "<<runfirstentry<<endl; |
2467 |
|
// printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS))); |
2468 |
|
// printf(" abstime %u trailertime %u \n",abstime,GetRunInfo()->RUNTRAILER_TIME); |
2469 |
|
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
2470 |
|
// |
2471 |
|
// prevshift = 0; |
2472 |
|
// |
2473 |
|
if ( irun == (Long64_t)(run->GetEntries()-1LL) && fromfirst && !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME)){ |
2474 |
|
printf(" resetting irun (it should NOT happen!!!)\n"); |
2475 |
|
fromfirst = false; |
2476 |
|
irun = 0; |
2477 |
|
run->GetEntry(irun); |
2478 |
|
runfirstentry = 0ULL; |
2479 |
|
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
2480 |
|
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
2481 |
|
}; |
2482 |
|
// |
2483 |
|
}; |
2484 |
|
// |
2485 |
|
if ( |
2486 |
|
!(abstime >= GetRunInfo()->RUNHEADER_TIME && |
2487 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
2488 |
|
) { |
2489 |
|
printf(" Something very wrong here: cannot find RUN containing absolute time %llu \n",abstime); |
2490 |
|
return false; |
2491 |
|
} |
2492 |
|
// |
2493 |
|
if ( irun == oldrun || irun >= run->GetEntries() ) return(false); |
2494 |
|
// |
2495 |
|
// printf(" iev %llu irun %i nevents %u 1st %llu last %llu \n",iev,irun,this->GetRunInfo()->NEVENTS,(ULong64_t)runfirstentry,(ULong64_t)runlastentry); |
2496 |
|
// |
2497 |
|
prevshift = 0; |
2498 |
|
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2499 |
|
// cout << "runfirstentry "<<runfirstentry<<endl; |
2500 |
|
return(true); |
2501 |
|
}; |
2502 |
|
// ---------------------------------------------------- |
2503 |
|
// if it is a preselected file (there is SelectionList) |
2504 |
|
// NBNB - the event tree MUST be read first |
2505 |
|
// ---------------------------------------------------- |
2506 |
|
if(SELLI==1){ |
2507 |
|
sel_tree->GetEntry(iev); |
2508 |
|
// cout << irun << " "<< irunentry << endl; |
2509 |
|
if(irun != oldrun){ |
2510 |
|
run->GetEntry(irun); |
2511 |
|
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2512 |
|
prevshift = 0; |
2513 |
|
return true; |
2514 |
|
} |
2515 |
|
return false; |
2516 |
|
} |
2517 |
|
|
2518 |
|
return false; |
2519 |
|
// |
2520 |
|
}; |
2521 |
|
|
2522 |
|
Bool_t PamLevel2::UpdateRunInfo(Long64_t iev){ |
2523 |
|
|
2524 |
|
if(!run_tree){ |
2525 |
|
cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree not loaded"<<endl; |
2526 |
|
return false; |
2527 |
|
} |
2528 |
|
if ( run_tree->GetEntries() <= 0 ) { |
2529 |
|
cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree is empty"<<endl; |
2530 |
|
return(false); |
2531 |
|
} |
2532 |
|
|
2533 |
|
Int_t oldrun = irun; // store current run index |
2534 |
|
|
2535 |
|
// ----------------------------------------------------------------------- |
2536 |
|
// the first time the routine is called, set run search from the beginning |
2537 |
|
// ----------------------------------------------------------------------- |
2538 |
|
|
2539 |
|
if ( irun < 0 ){ |
2540 |
|
irun = 0LL; |
2541 |
|
irunt = 0LL; |
2542 |
|
irunentry = 0; |
2543 |
|
prevshift = 0; |
2544 |
|
run_tree->GetEntry(irun); |
2545 |
|
if( !GetOrbitalInfo() )cout << "** WARNING ** missing OrbitalInfo ---> run info might be not correctly updated "<<endl; |
2546 |
|
}; |
2547 |
|
// --------------------------------------------------------------- |
2548 |
|
// retrieve OBT and absolute time of the event |
2549 |
|
// --------------------------------------------------------------- |
2550 |
|
ULong64_t abstime = 0LL; |
2551 |
|
ULong64_t obt = 0LL; |
2552 |
|
if( GetOrbitalInfo() ){ |
2553 |
|
abstime = GetOrbitalInfo()->absTime; |
2554 |
|
obt = GetOrbitalInfo()->OBT; |
2555 |
|
// cout << " ABS >>> "<<abstime<<" OBT >>> "<<obt<<" "<<endl; |
2556 |
|
}else{ |
2557 |
|
abstime = GetRunInfo()->RUNHEADER_TIME; |
2558 |
|
obt = GetRunInfo()->RUNHEADER_OBT; |
2559 |
|
} |
2560 |
|
// cout << ISGP << " "<<abstime<<endl; |
2561 |
|
// --------------------------------------------------------------- |
2562 |
|
// the absolute time is necessary to relate the event with the run |
2563 |
|
// --------------------------------------------------------------- |
2564 |
|
// if( !GetOrbitalInfo() && !ISGP ){ |
2565 |
|
// cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
2566 |
|
// return(false); |
2567 |
|
// } |
2568 |
|
// ----------------------------------------------------------------------- |
2569 |
|
// if it is simulation, assign abstime by hand (temporaneo!!!) |
2570 |
|
// ----------------------------------------------------------------------- |
2571 |
|
// if(ISGP){ |
2572 |
|
// abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO |
2573 |
|
// obt = GetRunInfo()->RUNHEADER_OBT; // BARBATRUCCO |
2574 |
|
// } |
2575 |
|
|
2576 |
|
|
2577 |
|
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2578 |
|
// if it is a full file (not preselected) |
2579 |
|
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2580 |
|
if(SELLI==0){ |
2581 |
|
|
2582 |
|
// --------------------------------------------------------------- |
2583 |
|
// increment dead and live-time counters |
2584 |
|
// (only when reading a file not preselected) |
2585 |
|
// --------------------------------------------------------------- |
2586 |
|
if(SELLI==0){ |
2587 |
|
if( GetTrigLevel2() ){ |
2588 |
|
totdltime[0]+=GetTrigLevel2()->dltime[0]; |
2589 |
|
totdltime[1]+=GetTrigLevel2()->dltime[1]; |
2590 |
|
} |
2591 |
|
totdltime[2]++; |
2592 |
|
} |
2593 |
|
// cout << setw(10)<<totdltime[0]<<setw(10)<<totdltime[1]<<setw(10)<<totdltime[2]<<endl; |
2594 |
|
|
2595 |
|
// // --------------------------------------------------------------- |
2596 |
|
// // retrieve OBT and absolute time of the event |
2597 |
|
// // --------------------------------------------------------------- |
2598 |
|
// ULong64_t abstime = 0; |
2599 |
|
// ULong64_t obt = 0; |
2600 |
|
// if( GetOrbitalInfo() ){ |
2601 |
|
// abstime = GetOrbitalInfo()->absTime; |
2602 |
|
// obt = GetOrbitalInfo()->OBT; |
2603 |
|
// } |
2604 |
|
// // --------------------------------------------------------------- |
2605 |
|
// // the absolute time is necessary to relate the event with the run |
2606 |
|
// // --------------------------------------------------------------- |
2607 |
|
// if( !GetOrbitalInfo() && !ISGP ){ |
2608 |
|
// cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
2609 |
|
// return(false); |
2610 |
|
// } |
2611 |
|
|
2612 |
|
// // ----------------------------------------------------------------------- |
2613 |
|
// // the first time the routine is called, set run search from the beginning |
2614 |
|
// // ----------------------------------------------------------------------- |
2615 |
|
// if ( irun < 0 ){ |
2616 |
|
// irun = 0LL; |
2617 |
|
// irunt = 0LL; |
2618 |
|
// irunentry = 0; |
2619 |
|
// prevshift = 0; |
2620 |
|
// run_tree->GetEntry(irun); |
2621 |
|
|
2622 |
|
// if( ISGP && run_tree->GetEntries()!=1 ){ |
2623 |
|
// cout << "** WARNING ** simulated files are assumed to have 1 single run, not "<< run_tree->GetEntries() << endl; |
2624 |
|
// cout << "** WARNING ** run will not be updated"<<endl; |
2625 |
|
// } |
2626 |
|
// }; |
2627 |
|
|
2628 |
|
// // ----------------------------------------------------------------------- |
2629 |
|
// // if it is simulation, assign abstime by hand (temporaneo!!!) |
2630 |
|
// // ----------------------------------------------------------------------- |
2631 |
|
// if(ISGP){ |
2632 |
|
// abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO |
2633 |
|
// obt = GetRunInfo()->RUNHEADER_OBT; // BARBATRUCCO |
2634 |
|
// } |
2635 |
|
// |
2636 |
|
bool fromfirst = true; // first loop over runs |
2637 |
|
|
2638 |
|
// Bool_t hasfrag = false; |
2639 |
|
// if( GetRunInfo()->ID_RUN_FRAG!=0 && GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID)hasfrag=true; |
2640 |
|
// ULong64_t fragid = GetRunInfo()->ID_RUN_FRAG; |
2641 |
|
|
2642 |
|
// ------------------------------------------------------ |
2643 |
|
// loop over runs to find the one that contains the event |
2644 |
|
// ------------------------------------------------------ |
2645 |
|
while ( |
2646 |
|
( |
2647 |
|
( |
2648 |
|
!(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
2649 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) && |
2650 |
|
!(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
2651 |
|
obt <= GetRunInfo()->RUNTRAILER_OBT) |
2652 |
|
) |
2653 |
|
|| GetRunInfo()->NEVENTS==0 |
2654 |
|
// || !(irunentry < GetRunInfo()->NEVENTS-1-prevshift) // ERRORE!!! fa saltare i run con 1 evento |
2655 |
|
|| !(irunentry <= GetRunInfo()->NEVENTS-1-prevshift) |
2656 |
|
) |
2657 |
|
&& irun < run_tree->GetEntries() ){ |
2658 |
|
|
2659 |
|
// - - - - - - - - - - - - - |
2660 |
|
// irunentry = position of current entry, relative to the run |
2661 |
|
// prevshift = shift needed to synchronize l0 and l2 data (nested events) |
2662 |
|
// - - - - - - - - - - - - - |
2663 |
|
|
2664 |
|
// ----------------------------------------- |
2665 |
|
// store dead and live-time of previous run |
2666 |
|
// ----------------------------------------- |
2667 |
|
// if(SELLI==0){ |
2668 |
|
if(fromfirst){ |
2669 |
|
if(oldrun==irun){ |
2670 |
|
/// decrement counters |
2671 |
|
if( GetTrigLevel2()){ |
2672 |
|
totdltime[0]-=GetTrigLevel2()->dltime[0];//live-time |
2673 |
|
totdltime[1]-=GetTrigLevel2()->dltime[1];//dead-time |
2674 |
|
} |
2675 |
|
totdltime[2]--; //event counter |
2676 |
|
cout << endl; |
2677 |
|
cout << "n.events : "<<totdltime[2]<<endl; |
2678 |
|
cout << "RUN LIVE-TIME: "<<totdltime[0]*0.16<<" ms"<<endl; |
2679 |
|
cout << "RUN DEAD-TIME: "<<totdltime[1]*0.01<<" ms"<<endl; |
2680 |
|
}else{ |
2681 |
|
totdltime[0]=0;//live-time |
2682 |
|
totdltime[1]=0;//dead-time |
2683 |
|
totdltime[2]=0; //event counter |
2684 |
|
cout << " *** JUMP RUN *** irun "<<irun<<endl; |
2685 |
|
} |
2686 |
|
/// add an entry |
2687 |
|
if(run_tree_clone) |
2688 |
|
if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries()) |
2689 |
|
run_tree_clone->GetBranch("DeadLiveTime")->Fill(); |
2690 |
|
/// reset counters |
2691 |
|
if( GetTrigLevel2() ){ |
2692 |
|
totdltime[0]=GetTrigLevel2()->dltime[0];//live-time |
2693 |
|
totdltime[1]=0; //dead-time |
2694 |
|
} |
2695 |
|
totdltime[2]=1; //event counter |
2696 |
|
} |
2697 |
|
// } |
2698 |
|
|
2699 |
|
irun++; |
2700 |
|
// ------------------------------------ |
2701 |
|
// if the end of run tree is reached... |
2702 |
|
// ------------------------------------ |
2703 |
|
if( irun == run_tree->GetEntries() ){ |
2704 |
|
if(!fromfirst){ |
2705 |
|
// ----------------------------------------------------- |
2706 |
|
// if it happened already once and the run was not found |
2707 |
|
// ---> exit with error |
2708 |
|
// ----------------------------------------------------- |
2709 |
|
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- event entry #"<<iev<<" does not belong to any run (should not happen)" <<endl; |
2710 |
|
return false; |
2711 |
|
} |
2712 |
|
// ----------------------------------------- |
2713 |
|
// ...otherwise repeat search from beginning |
2714 |
|
// ----------------------------------------- |
2715 |
|
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- reached end of run tree. searchin again from beginning " <<endl; |
2716 |
|
fromfirst = false; |
2717 |
|
irun = 0LL; |
2718 |
|
runfirstentry = 0LL; |
2719 |
|
} |
2720 |
|
// ------------------------------------------------------------------- |
2721 |
|
// save the index of the first entry of the run, relative to pam_tree, |
2722 |
|
// and read a new run |
2723 |
|
// ------------------------------------------------------------------- |
2724 |
|
if(irun>0)runfirstentry += (GetRunInfo()->NEVENTS)-prevshift; |
2725 |
|
irunentry = 0; |
2726 |
|
prevshift = 0; |
2727 |
|
run_tree->GetEntry(irun); |
2728 |
|
irunt = irun - irunoffset[run_tree->GetTreeNumber()]; |
2729 |
|
if(GetRunInfo()->RUNHEADER_OBT>GetRunInfo()->RUNTRAILER_OBT ){ |
2730 |
|
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun "<<irun<<" has RUNHEADER_OBT>=RUNTRAILER_OBT " <<endl; |
2731 |
|
cout << " (NB!! in this case some events are assigned to a wrong run)"<<endl; |
2732 |
|
} |
2733 |
|
// if(hasfrag && fragid != GetRunInfo()->ID){ |
2734 |
|
// cout << "... where is the next fragment ??"<<endl; |
2735 |
|
// } |
2736 |
|
}; |
2737 |
|
|
2738 |
|
|
2739 |
|
// -------------------------------------- |
2740 |
|
// if there was no need to update the run |
2741 |
|
// ---> exit with FALSE |
2742 |
|
// -------------------------------------- |
2743 |
|
if ( irun == oldrun ) return(false); |
2744 |
|
|
2745 |
|
// -------------------------------------- |
2746 |
|
// ... otherwise |
2747 |
|
// -------------------------------------- |
2748 |
|
|
2749 |
|
|
2750 |
|
|
2751 |
|
|
2752 |
|
// -------------------------------------- |
2753 |
|
// ---> exit with TRUE |
2754 |
|
// -------------------------------------- |
2755 |
|
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
2756 |
|
// ---------------------------------------------------- |
2757 |
|
// then check if the run has a fragment |
2758 |
|
// in this case we have to switch to the next fragment |
2759 |
|
// when the end of the first fragment is reached |
2760 |
|
// ---------------------------------------------------- |
2761 |
|
if( |
2762 |
|
GetRunInfo()->ID_RUN_FRAG != 0 && |
2763 |
|
// GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID && |
2764 |
|
true ){ |
2765 |
|
cout << "* fragment *"<<endl; |
2766 |
|
} |
2767 |
|
|
2768 |
|
return(true); |
2769 |
|
}; |
2770 |
|
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2771 |
|
// if it is a preselected file (there is SelectionList) |
2772 |
|
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
2773 |
|
// irun = run entry relative to the chain |
2774 |
|
// irunt = run entry relative to the tree |
2775 |
|
if(SELLI==1){ |
2776 |
|
sel_tree->GetEntry(iev);// read irunt from SelectionList |
2777 |
|
irun = irunt + irunoffset[sel_tree->GetTreeNumber()];//NEWNEW |
2778 |
|
if(irun != oldrun ){ |
2779 |
|
if( irun < run_tree->GetEntries() )run_tree->GetEntry(irun); |
2780 |
|
// check if the time is ok (with merged files it is not...) |
2781 |
|
// if not loop over run and look for the proper entry |
2782 |
|
bool SECONDO_GIRO=false; |
2783 |
|
Long64_t irun_start = irun; |
2784 |
|
int offset_start = irunoffset[sel_tree->GetTreeNumber()]; |
2785 |
|
while ( |
2786 |
|
( |
2787 |
|
( |
2788 |
|
!(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
2789 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
2790 |
|
// || |
2791 |
|
// !(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
2792 |
|
// obt <= GetRunInfo()->RUNTRAILER_OBT) |
2793 |
|
) |
2794 |
|
|| GetRunInfo()->NEVENTS==0 |
2795 |
|
) |
2796 |
|
// && irun < run_tree->GetEntries() |
2797 |
|
){ |
2798 |
|
|
2799 |
|
if(DBG){ |
2800 |
|
cout << " (test) "; |
2801 |
|
cout << " tree "<<sel_tree->GetTreeNumber(); |
2802 |
|
cout << " irunt "<<irunt; |
2803 |
|
cout << " offset "<<irunoffset[sel_tree->GetTreeNumber()]; |
2804 |
|
cout << " abs "<<abstime; |
2805 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_TIME<<" "<<GetRunInfo()->RUNTRAILER_TIME; |
2806 |
|
cout << " obt "<<obt; |
2807 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_OBT<<" "<<GetRunInfo()->RUNTRAILER_OBT; |
2808 |
|
cout << " *** JUMP RUN *** irun "<<irun; |
2809 |
|
// if(!SECONDO_GIRO)cout << " (don't worry)"; |
2810 |
|
// else cout << " (start worring...)"; |
2811 |
|
cout << endl; |
2812 |
|
} |
2813 |
|
// irun++; |
2814 |
|
irunoffset[sel_tree->GetTreeNumber()]++; |
2815 |
|
irun = irunt + irunoffset[sel_tree->GetTreeNumber()];//NEWNEW |
2816 |
|
if(irun == run_tree->GetEntries() && SECONDO_GIRO){ |
2817 |
|
// if(irun == irun_start ){ |
2818 |
|
cout << " ...grrrvzzkhhhajsdkj!!!! "<<endl; |
2819 |
|
irunoffset[sel_tree->GetTreeNumber()] = offset_start; |
2820 |
|
return false; |
2821 |
|
} |
2822 |
|
if( irun >= run_tree->GetEntries() || irun < 0){ |
2823 |
|
cout << "irun = "<<irun<<" >> search from the beginning... <<"<<endl; |
2824 |
|
SECONDO_GIRO=true; |
2825 |
|
irun=0; |
2826 |
|
irunoffset[sel_tree->GetTreeNumber()]=-irunt; |
2827 |
|
} |
2828 |
|
run_tree->GetEntry(irun); |
2829 |
|
} |
2830 |
|
|
2831 |
|
|
2832 |
|
if(DBG){ |
2833 |
|
cout << " (test) "; |
2834 |
|
cout << " tree "<<sel_tree->GetTreeNumber(); |
2835 |
|
cout << " irunt "<<irunt; |
2836 |
|
cout << " offset "<<irunoffset[sel_tree->GetTreeNumber()]; |
2837 |
|
cout << " abs "<<abstime; |
2838 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_TIME<<" "<<GetRunInfo()->RUNTRAILER_TIME; |
2839 |
|
cout << " obt "<<obt; |
2840 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_OBT<<" "<<GetRunInfo()->RUNTRAILER_OBT; |
2841 |
|
} |
2842 |
|
cout << endl; |
2843 |
|
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" (run-entry "<<irun<<")"<<endl; |
2844 |
|
// cout << endl; |
2845 |
|
prevshift = 0; |
2846 |
|
return true; |
2847 |
|
} |
2848 |
|
return false; |
2849 |
|
} |
2850 |
|
|
2851 |
|
return false; |
2852 |
|
// |
2853 |
}; |
}; |
2854 |
/** |
/** |
2855 |
* Update the runinfo informations (to be used to have Run infos event by event basis) |
* Update the runinfo informations (to be used to have Run infos event by event basis) |
2856 |
* @param run Pointer to the chain/tree which contains run infos |
* @param run Pointer to the chain/tree which contains run infos |
2857 |
* @return true if a new run has been read, false if it is still the same run |
* @return true if a new run has been read, false if it is still the same run |
2858 |
*/ |
*/ |
2859 |
Bool_t PamLevel2::UpdateRunInfo(TTree *run, ULong64_t iev){ |
Bool_t PamLevel2::UpdateRunInfo(TTree *run, Long64_t iev){ |
2860 |
return(UpdateRunInfo((TChain*)run,iev)); |
return(UpdateRunInfo((TChain*)run,iev)); |
2861 |
}; |
}; |
2862 |
|
|
2863 |
//-------------------------------------- |
//-------------------------------------- |
2867 |
/** |
/** |
2868 |
* Set which trees shoul be analysed |
* Set which trees shoul be analysed |
2869 |
* @param detlist TString containing the sequence of trees required |
* @param detlist TString containing the sequence of trees required |
2870 |
*/ |
*/ |
2871 |
void PamLevel2::SetWhichTrees(TString detlist){ |
void PamLevel2::SetWhichTrees(TString detlist){ |
2872 |
|
|
2873 |
if(detlist.IsNull() || detlist.Contains("+ALL", TString::kIgnoreCase)){ |
// if(detlist.IsNull() || detlist.Contains("+ALL", TString::kIgnoreCase)){ |
2874 |
|
if( detlist.Contains("+ALL", TString::kIgnoreCase)){ |
2875 |
|
|
2876 |
|
cout << " ======================================================== "<<endl; |
2877 |
|
cout << " (( WARNING )) "<<endl; |
2878 |
|
cout << " The meaning of the option +ALL has changed!! "<<endl; |
2879 |
|
cout << " Now it includes really all (level0+level1+level2+gpamela)"<<endl; |
2880 |
|
cout << " and the file is discarded if it does not contain "<<endl; |
2881 |
|
cout << " all trees or if level0 files are not available!! "<<endl; |
2882 |
|
cout << " ======================================================== "<<endl; |
2883 |
|
|
2884 |
|
CAL0 = true; |
2885 |
CAL1 = true; |
CAL1 = true; |
2886 |
CAL2 = true; |
CAL2 = true; |
2887 |
TRK2 = true; |
TRK2 = true; |
2888 |
TRK1 = false; |
TRK1 = true; |
2889 |
TRKh = false; |
TRKh = true; |
2890 |
|
TRK0 = true; |
2891 |
TRG = true; |
TRG = true; |
2892 |
TOF = true; |
TOF = true; |
2893 |
|
TOF0 = true; |
2894 |
S4 = true; |
S4 = true; |
2895 |
ND = true; |
ND = true; |
2896 |
AC = true; |
AC = true; |
2897 |
ORB = true; |
ORB = true; |
2898 |
|
GP = true; |
2899 |
}else if( detlist.Contains("-ALL", TString::kIgnoreCase) ){ |
}else if( detlist.Contains("-ALL", TString::kIgnoreCase) ){ |
2900 |
|
CAL0 = false; |
2901 |
CAL1 = false; |
CAL1 = false; |
2902 |
CAL2 = false; |
CAL2 = false; |
2903 |
TRK2 = false; |
TRK2 = false; |
2904 |
TRK1 = false; |
TRK1 = false; |
2905 |
TRKh = false; |
TRKh = false; |
2906 |
|
TRK0 = false; |
2907 |
TRG = false; |
TRG = false; |
2908 |
TOF = false; |
TOF = false; |
2909 |
|
TOF0 = false; |
2910 |
S4 = false; |
S4 = false; |
2911 |
ND = false; |
ND = false; |
2912 |
AC = false; |
AC = false; |
2913 |
ORB = false; |
ORB = false; |
2914 |
|
GP = false; |
2915 |
}; |
}; |
2916 |
|
|
2917 |
// ------------------------------------------------------------------------- |
// ------------------------------------------------------------------------- |
2919 |
if ( detlist.Contains("-CAL1", TString::kIgnoreCase) )CAL1=false; |
if ( detlist.Contains("-CAL1", TString::kIgnoreCase) )CAL1=false; |
2920 |
if ( detlist.Contains("+CAL1", TString::kIgnoreCase) )CAL1=true; |
if ( detlist.Contains("+CAL1", TString::kIgnoreCase) )CAL1=true; |
2921 |
}; |
}; |
2922 |
|
|
2923 |
|
if( detlist.Contains("CAL0", TString::kIgnoreCase) ){ |
2924 |
|
if ( detlist.Contains("-CAL0", TString::kIgnoreCase) )CAL0=false; |
2925 |
|
if ( detlist.Contains("+CAL0", TString::kIgnoreCase) )CAL0=true; |
2926 |
|
}; |
2927 |
|
|
2928 |
if( detlist.Contains("CAL2", TString::kIgnoreCase)){ |
if( detlist.Contains("CAL2", TString::kIgnoreCase)){ |
2929 |
if ( detlist.Contains("-CAL2", TString::kIgnoreCase) )CAL2=false; |
if ( detlist.Contains("-CAL2", TString::kIgnoreCase) )CAL2=false; |
2936 |
CAL1=false; |
CAL1=false; |
2937 |
} |
} |
2938 |
// ------------------------------------------------------------------------- |
// ------------------------------------------------------------------------- |
2939 |
|
if( detlist.Contains("TRK0", TString::kIgnoreCase) ){ |
2940 |
|
if ( detlist.Contains("-TRK0", TString::kIgnoreCase) )TRK0=false; |
2941 |
|
if ( detlist.Contains("+TRK0", TString::kIgnoreCase) )TRK0=true; |
2942 |
|
}; |
2943 |
|
|
2944 |
if( detlist.Contains("TRK1", TString::kIgnoreCase) ){ |
if( detlist.Contains("TRK1", TString::kIgnoreCase) ){ |
2945 |
if ( detlist.Contains("-TRK1", TString::kIgnoreCase) )TRK1=false; |
if ( detlist.Contains("-TRK1", TString::kIgnoreCase) )TRK1=false; |
2946 |
if ( detlist.Contains("+TRK1", TString::kIgnoreCase) )TRK1=true; |
if ( detlist.Contains("+TRK1", TString::kIgnoreCase) )TRK1=true; |
2969 |
|
|
2970 |
if( detlist.Contains("-TOF", TString::kIgnoreCase) )TOF = false; |
if( detlist.Contains("-TOF", TString::kIgnoreCase) )TOF = false; |
2971 |
else if( detlist.Contains("+TOF", TString::kIgnoreCase) )TOF = true; |
else if( detlist.Contains("+TOF", TString::kIgnoreCase) )TOF = true; |
2972 |
|
|
2973 |
|
if( detlist.Contains("-TOF0", TString::kIgnoreCase) )TOF0 = false; |
2974 |
|
else if( detlist.Contains("+TOF0", TString::kIgnoreCase) )TOF0 = true; |
2975 |
|
|
2976 |
if( detlist.Contains("-S4", TString::kIgnoreCase) )S4 = false; |
if( detlist.Contains("-S4", TString::kIgnoreCase) )S4 = false; |
2977 |
else if( detlist.Contains("+S4", TString::kIgnoreCase) )S4 = true; |
else if( detlist.Contains("+S4", TString::kIgnoreCase) )S4 = true; |
2985 |
if( detlist.Contains("-ORB", TString::kIgnoreCase) )ORB = false; |
if( detlist.Contains("-ORB", TString::kIgnoreCase) )ORB = false; |
2986 |
else if( detlist.Contains("+ORB", TString::kIgnoreCase) )ORB = true; |
else if( detlist.Contains("+ORB", TString::kIgnoreCase) )ORB = true; |
2987 |
|
|
2988 |
|
if( detlist.Contains("-GP", TString::kIgnoreCase) )GP = false; |
2989 |
|
else if( detlist.Contains("+GP", TString::kIgnoreCase) )GP = true; |
2990 |
|
|
2991 |
|
cout<< "tree/branch list from input --> "; |
2992 |
|
if(TRK0)cout<<"TRK0 "; |
2993 |
|
if(TRK1)cout<<"TRK1 "; |
2994 |
|
if(TRK2)cout<<"TRK2 "; |
2995 |
|
if(TRKh)cout<<"TRKH "; |
2996 |
|
if(CAL0)cout<<"CAL0 "; |
2997 |
|
if(CAL1)cout<<"CAL1 "; |
2998 |
|
if(CAL2)cout<<"CAL2 "; |
2999 |
|
if(TOF)cout<<"TOF "; |
3000 |
|
if(TRG)cout<<"TRG "; |
3001 |
|
if(AC)cout<<"AC "; |
3002 |
|
if(ND)cout<<"ND "; |
3003 |
|
if(S4)cout<<"S4 "; |
3004 |
|
if(ORB)cout<<"ORB "; |
3005 |
|
if(GP)cout<<"GP "; |
3006 |
|
cout << endl; |
3007 |
// cout<< "Set detector list --> "; |
// cout<< "Set detector list --> "; |
3008 |
// if(TRK1)cout<<"TRK1 "; |
// if(TRK1)cout<<"TRK1 "; |
3009 |
// if(TRK2)cout<<"TRK2 "; |
// if(TRK2)cout<<"TRK2 "; |
3010 |
// if(TRKh)cout<<"TRKH "; |
// if(TRKh)cout<<"TRKH "; |
3011 |
// if(CAL1)cout<<"CAL1 "; |
// if(CAL1)cout<<"CAL1 "; |
3012 |
// if(CAL2)cout<<"CAL2 "; |
// if(CAL2)cout<<"CAL2 "; |
3013 |
|
// if(TOF0)cout<<"TOF0 "; |
3014 |
// if(TOF)cout<<"TOF "; |
// if(TOF)cout<<"TOF "; |
3015 |
// if(TRG)cout<<"TRG "; |
// if(TRG)cout<<"TRG "; |
3016 |
// if(AC)cout<<"AC "; |
// if(AC)cout<<"AC "; |
3026 |
* Set tree/branch detector flags from the content of a tree |
* Set tree/branch detector flags from the content of a tree |
3027 |
*/ |
*/ |
3028 |
void PamLevel2::GetWhichTrees(TFile* f){ |
void PamLevel2::GetWhichTrees(TFile* f){ |
3029 |
|
|
3030 |
|
|
3031 |
|
|
3032 |
|
// cout << "void PamLevel2::GetWhichTrees(TFile* f) --- WARNING!! --- ...potrebbe non funzionare "<<endl; |
3033 |
// ----------- |
// ----------- |
3034 |
// reset flags |
// reset flags |
3035 |
// ----------- |
// ----------- |
3044 |
ND = false; |
ND = false; |
3045 |
AC = false; |
AC = false; |
3046 |
ORB = false; |
ORB = false; |
3047 |
|
GP = false; |
3048 |
|
|
3049 |
RUN = false; |
RUN = false; |
3050 |
|
|
3051 |
cout << "Checking file: "<<f->GetName()<<endl; |
// cout << "Checking file: "<<f->GetName()<<endl; |
3052 |
if( !f || f->IsZombie() ){ |
if( !f || f->IsZombie() ){ |
3053 |
cout << "File: "<< f->GetName() <<" Non valid root file"<< endl; |
cout << "File: "<< f->GetName() <<" Non valid root file"<< endl; |
3054 |
return; |
return; |
3135 |
TRK2 = false; |
TRK2 = false; |
3136 |
TRKh = false; |
TRKh = false; |
3137 |
}else nev=nevt; |
}else nev=nevt; |
3138 |
T->Delete(); |
// T->Delete(); |
3139 |
}; |
}; |
3140 |
//========================================================= |
//========================================================= |
3141 |
if( !strcmp(key->GetName(),"Calorimeter" ) ){ |
if( !strcmp(key->GetName(),"Calorimeter" ) ){ |
3151 |
CAL1 = false; |
CAL1 = false; |
3152 |
CAL2 = false; |
CAL2 = false; |
3153 |
}else nev=nevt; |
}else nev=nevt; |
3154 |
T->Delete(); |
// T->Delete(); |
3155 |
}; |
}; |
3156 |
|
//========================================================= |
3157 |
|
if( !strcmp(key->GetName(),"h20") ){ |
3158 |
|
GP = true; |
3159 |
|
Int_t nevt = ((TTree*)f->Get("h20"))->GetEntries(); |
3160 |
|
if( nev && nevt!=nev){ |
3161 |
|
cout << "File: "<< f->GetName() <<" h20 tree has "<<nevt<<" events instead of "<<nev<< endl; |
3162 |
|
GP = false; |
3163 |
|
}else nev=nevt; |
3164 |
|
} |
3165 |
|
|
3166 |
}; |
}; |
3167 |
|
|
3168 |
delete lk; |
// delete lk; |
3169 |
|
|
3170 |
// cout<< "Get detector list from input file --> "; |
cout<< "tree/branch list from file --> "; |
3171 |
// if(TRK1)cout<<"TRK1 "; |
if(TRK1)cout<<"TRK1 "; |
3172 |
// if(TRK2)cout<<"TRK2 "; |
if(TRK2)cout<<"TRK2 "; |
3173 |
// if(TRKh)cout<<"TRKH "; |
if(TRKh)cout<<"TRKH "; |
3174 |
// if(CAL1)cout<<"CAL1 "; |
if(CAL1)cout<<"CAL1 "; |
3175 |
// if(CAL2)cout<<"CAL2 "; |
if(CAL2)cout<<"CAL2 "; |
3176 |
// if(TOF)cout<<"TOF "; |
if(TOF)cout<<"TOF "; |
3177 |
// if(TRG)cout<<"TRG "; |
if(TRG)cout<<"TRG "; |
3178 |
// if(AC)cout<<"AC "; |
if(AC)cout<<"AC "; |
3179 |
// if(ND)cout<<"ND "; |
if(ND)cout<<"ND "; |
3180 |
// if(S4)cout<<"S4 "; |
if(S4)cout<<"S4 "; |
3181 |
// if(ORB)cout<<"ORB "; |
if(ORB)cout<<"ORB "; |
3182 |
// cout << endl; |
if(GP)cout<<"GP "; |
3183 |
|
cout << endl; |
3184 |
|
|
3185 |
return ; |
return ; |
3186 |
|
|
3209 |
Bool_t ND__ok = false; |
Bool_t ND__ok = false; |
3210 |
Bool_t AC__ok = false; |
Bool_t AC__ok = false; |
3211 |
Bool_t ORB__ok = false; |
Bool_t ORB__ok = false; |
3212 |
|
Bool_t GP__ok = false; |
3213 |
|
|
3214 |
Bool_t RUN__ok = false; |
Bool_t RUN__ok = false; |
3215 |
|
|
3216 |
|
Bool_t SELLI__ok = false; |
3217 |
|
|
3218 |
cout << "Checking file: "<<name<<endl; |
// cout << "Checking file: "<<name<<endl; |
3219 |
TFile *f = new TFile(name.Data()); |
TFile *f = new TFile(name.Data()); |
3220 |
if( !f || f->IsZombie() ){ |
if( !f || f->IsZombie() ){ |
3221 |
cout << "File: "<< f->GetName() <<" discarded ---- Non valid root file"<< endl; return false; |
cout << "File: "<< f->GetName() <<" discarded ---- Non valid root file"<< endl; return false; |
3230 |
|
|
3231 |
while( (key = (TKey*)next()) ){ |
while( (key = (TKey*)next()) ){ |
3232 |
|
|
3233 |
|
// cout << key->GetName() << endl; |
3234 |
// cout << key->GetName() << ""<<key->GetClassName()<<endl; |
// cout << key->GetName() << ""<<key->GetClassName()<<endl; |
3235 |
// cout << " Get tree: " << f->Get(key->GetName())<<endl; |
// cout << " Get tree: " << f->Get(key->GetName())<<endl; |
3236 |
// nev_previous = nev; |
// nev_previous = nev; |
3241 |
// return false; |
// return false; |
3242 |
// }; |
// }; |
3243 |
|
|
3244 |
|
//========================================================= |
3245 |
|
// check if the file |
3246 |
|
|
3247 |
|
|
3248 |
if( !strcmp(key->GetName(),"Run" ) )RUN__ok = true; |
if( !strcmp(key->GetName(),"Run" ) )RUN__ok = true; |
3249 |
|
|
3250 |
//========================================================= |
//========================================================= |
3251 |
|
if( !strcmp(key->GetName(),"SelectionList" ) ){ |
3252 |
|
SELLI__ok = true; |
3253 |
|
if(SELLI==1){ |
3254 |
|
Int_t nevt = ((TTree*)f->Get("SelectionList"))->GetEntries(); |
3255 |
|
if( nev && nevt!=nev){ |
3256 |
|
cout << "File: "<< f->GetName() <<" discarded ---- SelectionList tree has "<<nevt<<" events instead of "<<nev<< endl; |
3257 |
|
return false; |
3258 |
|
} |
3259 |
|
nev=nevt; |
3260 |
|
} |
3261 |
|
} |
3262 |
|
|
3263 |
|
//========================================================= |
3264 |
if( !strcmp(key->GetName(),"Trigger" ) ){ |
if( !strcmp(key->GetName(),"Trigger" ) ){ |
3265 |
TRG__ok = true; |
TRG__ok = true; |
3266 |
if(TRG){ |
if(TRG){ |
3370 |
}; |
}; |
3371 |
T->Delete(); |
T->Delete(); |
3372 |
}; |
}; |
3373 |
|
//========================================================= |
3374 |
|
if( !strcmp(key->GetName(),"h20") ){ |
3375 |
|
ISGP = true; |
3376 |
|
GP__ok = true; |
3377 |
|
if(GP){ |
3378 |
|
Int_t nevt = ((TTree*)f->Get("h20"))->GetEntries(); |
3379 |
|
if( nev && nevt!=nev){ |
3380 |
|
cout << "File: "<< f->GetName() <<" discarded ---- OrbitalInfo tree has "<<nevt<<" events instead of "<<nev<< endl; |
3381 |
|
return false; |
3382 |
|
} |
3383 |
|
nev=nevt; |
3384 |
|
} |
3385 |
|
} |
3386 |
|
|
3387 |
}; |
}; |
3388 |
|
|
3389 |
|
if( SELLI==-1 )SELLI = (Int_t)SELLI__ok; |
3390 |
|
if( SELLI==0 && SELLI__ok ){ |
3391 |
|
cout << "File: "<< f->GetName() <<" discarded ---- found SelectionList (it is not a full-event file)" << endl; |
3392 |
|
return false; |
3393 |
|
} |
3394 |
|
if( SELLI==1 && !SELLI__ok ){ |
3395 |
|
cout << "File: "<< f->GetName() <<" discarded ---- SelectionList missing" << endl; |
3396 |
|
return false; |
3397 |
|
} |
3398 |
|
|
3399 |
|
// cout << "SELLI "<<SELLI<<endl; |
3400 |
|
|
3401 |
// cout<< "CheckLevel2File(TString): detector list --> "; |
// cout<< "CheckLevel2File(TString): detector list --> "; |
3402 |
// if(TRK1__ok)cout<<"TRK1 "; |
// if(TRK1__ok)cout<<"TRK1 "; |
3403 |
// if(TRK2__ok)cout<<"TRK2 "; |
// if(TRK2__ok)cout<<"TRK2 "; |
3423 |
|
|
3424 |
|
|
3425 |
if(!RUN__ok) { |
if(!RUN__ok) { |
3426 |
cout << "File: "<< f->GetName() <<" *WARNING* ---- Missing RunInfo tree"<< endl; |
cout << "File: "<< f->GetName() <<" *WARNING* ---- Missing RunInfo tree (NB: RUN infos will not be updated)"<< endl; |
3427 |
// return false; |
RUN = false; |
3428 |
}; |
}; |
3429 |
|
|
3430 |
if(CAL1 && !CAL1__ok){ |
if(CAL1 && !CAL1__ok){ |
3472 |
cout << "File: "<< f->GetName() <<" discarded ---- Missing Trigger tree"<< endl; |
cout << "File: "<< f->GetName() <<" discarded ---- Missing Trigger tree"<< endl; |
3473 |
return false; |
return false; |
3474 |
}; |
}; |
3475 |
|
if(GP && !GP__ok){ |
3476 |
|
cout << "File: "<< f->GetName() <<" discarded ---- Missing h20 tree"<< endl; |
3477 |
|
return false; |
3478 |
|
}; |
3479 |
|
|
3480 |
|
|
3481 |
// lk->Delete(); |
// lk->Delete(); |
3494 |
// if(ND)cout<<"ND "; |
// if(ND)cout<<"ND "; |
3495 |
// if(S4)cout<<"S4 "; |
// if(S4)cout<<"S4 "; |
3496 |
// if(ORB)cout<<"ORB "; |
// if(ORB)cout<<"ORB "; |
3497 |
|
// if(GP)cout<<"GP "; |
3498 |
// cout << endl; |
// cout << endl; |
3499 |
|
|
3500 |
return true; |
return true; |
3511 |
cout << "Create clones of PAMELA trees "<<endl; |
cout << "Create clones of PAMELA trees "<<endl; |
3512 |
|
|
3513 |
Int_t i=0; |
Int_t i=0; |
3514 |
tree_clone[i] = fChain->GetTree()->CloneTree(0); |
pam_tree_clone[i] = fChain->GetTree()->CloneTree(0); |
3515 |
TString name = tree_clone[i]->GetName(); |
TString name = pam_tree_clone[i]->GetName(); |
3516 |
name.Append("_clone"); |
name.Append("_clone"); |
3517 |
// tree_clone[i]->SetName(name.Data()); |
// pam_tree_clone[i]->SetName(name.Data()); |
3518 |
cout << tree_clone[i]->GetName() <<endl; |
cout << pam_tree_clone[i]->GetName() <<endl; |
3519 |
i++; |
i++; |
3520 |
|
|
3521 |
TList *li = fChain->GetListOfFriends(); |
TList *li = fChain->GetListOfFriends(); |
3525 |
while( (T_friend = (TFriendElement*)next()) ){ |
while( (T_friend = (TFriendElement*)next()) ){ |
3526 |
// cout<<T_friend->IsA()->GetName()<<" "<<T_friend->GetName()<<hex << T_friend->GetTree() << dec<<endl; |
// cout<<T_friend->IsA()->GetName()<<" "<<T_friend->GetName()<<hex << T_friend->GetTree() << dec<<endl; |
3527 |
// cout<<T_friend->GetTree()->GetName()<< endl; |
// cout<<T_friend->GetTree()->GetName()<< endl; |
3528 |
tree_clone[i] = T_friend->GetTree()->CloneTree(0); |
pam_tree_clone[i] = T_friend->GetTree()->CloneTree(0); |
3529 |
tree_clone[i]->SetAutoSave(1000000); |
pam_tree_clone[i]->SetAutoSave(1000000); |
3530 |
name = tree_clone[i]->GetName(); |
name = pam_tree_clone[i]->GetName(); |
3531 |
name.Append("_clone"); |
name.Append("_clone"); |
3532 |
// tree_clone[i]->SetName(name.Data()); |
// pam_tree_clone[i]->SetName(name.Data()); |
3533 |
cout << tree_clone[i]->GetName() << endl; |
cout << pam_tree_clone[i]->GetName() << endl; |
3534 |
i++; |
i++; |
3535 |
} |
} |
3536 |
|
|
3545 |
*/ |
*/ |
3546 |
void PamLevel2::CreateCloneTrees(TFile *ofile){ |
void PamLevel2::CreateCloneTrees(TFile *ofile){ |
3547 |
|
|
3548 |
|
|
3549 |
|
// if the pointer is null, create a default file |
3550 |
|
if(!run_tree)return; |
3551 |
|
|
3552 |
|
if(!ofile){ |
3553 |
|
cout << "void PamLevel2::CreateCloneTrees(TFile*) -- WARNING -- Creating file: clone-tree.root "<<endl; |
3554 |
|
ofile = new TFile("clone-tree.root","recreate"); |
3555 |
|
} |
3556 |
|
|
3557 |
ofile->cd(); |
ofile->cd(); |
3558 |
|
|
3559 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
3560 |
cout << "Create new PAMELA trees "<<endl; |
cout << "Create new PAMELA trees "<<endl; |
3561 |
|
|
|
Int_t i=0; |
|
3562 |
|
|
3563 |
|
run_tree_clone = new TTree("Run","PAMELA Level2 data from the GL_RUN table "); |
3564 |
|
run_tree_clone->Branch("RunInfo","GL_RUN",GetPointerTo("RunInfo")); |
3565 |
|
cout << "Run : branch RunInfo"<<endl; |
3566 |
|
run_tree_clone->Branch("SoftInfo","SoftInfo",GetPointerTo("SoftInfo")); |
3567 |
|
cout << "Run : branch SoftInfo"<<endl; |
3568 |
|
// ------------------ |
3569 |
|
// replicate run tree |
3570 |
|
// ------------------ |
3571 |
|
// cout << "----------------------------------------------------"<<endl; |
3572 |
|
// cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl; |
3573 |
|
for (Int_t i=0; i<run_tree->GetEntries(); i++){ |
3574 |
|
run_tree->GetEntry(i); |
3575 |
|
// cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl; |
3576 |
|
run_tree_clone->Fill(); |
3577 |
|
} |
3578 |
|
cout << "----------------------------------------------------"<<endl; |
3579 |
|
|
3580 |
|
// ------------------------------------ |
3581 |
|
// add branch with dead and live times |
3582 |
|
// ------------------------------------ |
3583 |
|
run_tree_clone->Branch("DeadLiveTime",totdltime,"dltime[3]/l"); |
3584 |
|
cout << "Run : branch DeadLiveTime"<<endl; |
3585 |
|
|
3586 |
|
|
3587 |
|
sel_tree_clone = new TTree("SelectionList","List of selected events "); |
3588 |
|
// sel_tree_clone->Branch("RunEntry",&irun,"runentry/L"); |
3589 |
|
sel_tree_clone->Branch("RunEntry",&irunt,"runentry/L");//NEWNEW |
3590 |
|
sel_tree_clone->Branch("EventEntry",&irunentry,"eventry/L"); |
3591 |
|
|
3592 |
|
|
3593 |
|
Int_t i=0; |
3594 |
if(TRK1||TRK2||TRKh){ |
if(TRK1||TRK2||TRKh){ |
3595 |
tree_clone[i] = new TTree("Tracker","PAMELA tracker level2 data "); |
pam_tree_clone[i] = new TTree("Tracker","PAMELA tracker level2 data "); |
3596 |
if(TRK1) { |
if(TRK1) { |
3597 |
tree_clone[i]->Branch("TrkLevel1","TrkLevel1", GetPointerTo("TrkLevel1")); |
pam_tree_clone[i]->Branch("TrkLevel1","TrkLevel1", GetPointerTo("TrkLevel1")); |
3598 |
tree_clone[i]->BranchRef(); |
pam_tree_clone[i]->BranchRef(); |
3599 |
cout << "Tracker : branch TrkLevel1"<<endl; |
cout << "Tracker : branch TrkLevel1"<<endl; |
3600 |
|
// cout << "CreateCloneTrees " << GetTrkLevel1()<<endl; |
3601 |
}; |
}; |
3602 |
if(TRK2) { |
if(TRK2) { |
3603 |
tree_clone[i]->Branch("TrkLevel2", "TrkLevel2",GetPointerTo("TrkLevel2")); |
pam_tree_clone[i]->Branch("TrkLevel2", "TrkLevel2",GetPointerTo("TrkLevel2")); |
3604 |
cout << "Tracker : branch TrkLevel2"<<endl; |
cout << "Tracker : branch TrkLevel2"<<endl; |
3605 |
}; |
}; |
3606 |
if(TRKh) { |
if(TRKh) { |
3607 |
tree_clone[i]->Branch("TrkHough","TrkHough", GetPointerTo("TrkHough")); |
pam_tree_clone[i]->Branch("TrkHough","TrkHough", GetPointerTo("TrkHough")); |
3608 |
cout << "Tracker : branch TrkHough"<<endl; |
cout << "Tracker : branch TrkHough"<<endl; |
3609 |
}; |
}; |
3610 |
i++; |
i++; |
3612 |
|
|
3613 |
// Calorimeter |
// Calorimeter |
3614 |
if(CAL1||CAL2){ |
if(CAL1||CAL2){ |
3615 |
tree_clone[i] = new TTree("Calorimeter","PAMELA calorimeter level2 data "); |
pam_tree_clone[i] = new TTree("Calorimeter","PAMELA calorimeter level2 data "); |
3616 |
if(CAL1) { |
if(CAL1) { |
3617 |
tree_clone[i]->Branch("CaloLevel1", "CaloLevel1", GetPointerTo("CaloLevel1")); |
pam_tree_clone[i]->Branch("CaloLevel1", "CaloLevel1", GetPointerTo("CaloLevel1")); |
3618 |
cout << "Calorimeter : branch CaloLevel1"<<endl; |
cout << "Calorimeter : branch CaloLevel1"<<endl; |
3619 |
}; |
}; |
3620 |
if(CAL2) { |
if(CAL2) { |
3621 |
tree_clone[i]->Branch("CaloLevel2","CaloLevel2", GetPointerTo("CaloLevel2")); |
pam_tree_clone[i]->Branch("CaloLevel2","CaloLevel2", GetPointerTo("CaloLevel2")); |
3622 |
cout << "Calorimeter : branch CaloLevel2"<<endl; |
cout << "Calorimeter : branch CaloLevel2"<<endl; |
3623 |
}; |
}; |
3624 |
i++; |
i++; |
3626 |
|
|
3627 |
// ToF |
// ToF |
3628 |
if(TOF) { |
if(TOF) { |
3629 |
tree_clone[i] = new TTree("ToF","PAMELA ToF level2 data "); |
pam_tree_clone[i] = new TTree("ToF","PAMELA ToF level2 data "); |
3630 |
tree_clone[i]->Branch("ToFLevel2","ToFLevel2", GetPointerTo("ToFLevel2")); |
pam_tree_clone[i]->Branch("ToFLevel2","ToFLevel2", GetPointerTo("ToFLevel2")); |
3631 |
cout << "ToF : branch ToFLevel2"<<endl; |
cout << "ToF : branch ToFLevel2"<<endl; |
3632 |
i++; |
i++; |
3633 |
}; |
}; |
3634 |
// Trigger |
// Trigger |
3635 |
if(TRG) { |
if(TRG) { |
3636 |
tree_clone[i] = new TTree("Trigger","PAMELA trigger level2 data "); |
pam_tree_clone[i] = new TTree("Trigger","PAMELA trigger level2 data "); |
3637 |
tree_clone[i]->Branch("TrigLevel2","TrigLevel2", GetPointerTo("TrigLevel2")); |
pam_tree_clone[i]->Branch("TrigLevel2","TrigLevel2", GetPointerTo("TrigLevel2")); |
3638 |
cout << "Trigger : branch TrigLevel2"<<endl; |
cout << "Trigger : branch TrigLevel2"<<endl; |
3639 |
i++; |
i++; |
3640 |
}; |
}; |
3641 |
// S4 |
// S4 |
3642 |
if(S4) { |
if(S4) { |
3643 |
tree_clone[i] = new TTree("S4","PAMELA S4 level2 data "); |
pam_tree_clone[i] = new TTree("S4","PAMELA S4 level2 data "); |
3644 |
tree_clone[i]->Branch("S4Level2","S4Level2", GetPointerTo("S4Level2")); |
pam_tree_clone[i]->Branch("S4Level2","S4Level2", GetPointerTo("S4Level2")); |
3645 |
cout << "S4 : branch S4Level2"<<endl; |
cout << "S4 : branch S4Level2"<<endl; |
3646 |
i++; |
i++; |
3647 |
}; |
}; |
3648 |
// Neutron Detector |
// Neutron Detector |
3649 |
if(ND) { |
if(ND) { |
3650 |
tree_clone[i] = new TTree("NeutronD","PAMELA neutron detector level2 data "); |
pam_tree_clone[i] = new TTree("NeutronD","PAMELA neutron detector level2 data "); |
3651 |
tree_clone[i]->Branch("NDLevel2","NDLevel2", GetPointerTo("NDLevel2")); |
pam_tree_clone[i]->Branch("NDLevel2","NDLevel2", GetPointerTo("NDLevel2")); |
3652 |
cout << "NeutronD : branch NDLevel2"<<endl; |
cout << "NeutronD : branch NDLevel2"<<endl; |
3653 |
i++; |
i++; |
3654 |
}; |
}; |
3655 |
// Anticounters |
// Anticounters |
3656 |
if(AC) { |
if(AC) { |
3657 |
tree_clone[i] = new TTree("Anticounter","PAMELA anticounter detector level2 data "); |
pam_tree_clone[i] = new TTree("Anticounter","PAMELA anticounter detector level2 data "); |
3658 |
tree_clone[i]->Branch("AcLevel2","AcLevel2", GetPointerTo("AcLevel2")); |
pam_tree_clone[i]->Branch("AcLevel2","AcLevel2", GetPointerTo("AcLevel2")); |
3659 |
cout << "Anticounter : branch AcLevel2"<<endl; |
cout << "Anticounter : branch AcLevel2"<<endl; |
3660 |
i++; |
i++; |
3661 |
}; |
}; |
3662 |
// OrbitalInfo |
// OrbitalInfo |
3663 |
if(ORB) { |
if(ORB) { |
3664 |
tree_clone[i] = new TTree("OrbitalInfo","PAMELA oribital info "); |
pam_tree_clone[i] = new TTree("OrbitalInfo","PAMELA oribital info "); |
3665 |
tree_clone[i]->Branch("OrbitalInfo","OrbitalInfo", GetPointerTo("OrbitalInfo")); |
pam_tree_clone[i]->Branch("OrbitalInfo","OrbitalInfo", GetPointerTo("OrbitalInfo")); |
3666 |
|
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
3667 |
|
i++; |
3668 |
|
}; |
3669 |
|
// GPamela |
3670 |
|
if(GP) { |
3671 |
|
pam_tree_clone[i] = new TTree("h20","PAMELA oribital info "); |
3672 |
|
pam_tree_clone[i]->Branch("GPamela","GPamela", GetPointerTo("GPamela"),32000,1);//split |
3673 |
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
3674 |
i++; |
i++; |
3675 |
}; |
}; |
3684 |
*/ |
*/ |
3685 |
//void PamLevel2::FillNewPamTree(TTree *T){ |
//void PamLevel2::FillNewPamTree(TTree *T){ |
3686 |
void PamLevel2::FillCloneTrees(){ |
void PamLevel2::FillCloneTrees(){ |
3687 |
|
|
3688 |
for(Int_t i=0; i<8; i++){ |
// cout << "PamLevel2::FillCloneTrees()" << irunentry << endl; |
3689 |
if(tree_clone[i])tree_clone[i]->Fill(); |
|
3690 |
|
for(Int_t i=0; i<NCLONES; i++){ |
3691 |
|
if(pam_tree_clone[i])pam_tree_clone[i]->Fill(); |
3692 |
} |
} |
3693 |
|
if(sel_tree_clone)sel_tree_clone->Fill(); |
3694 |
|
|
3695 |
} |
} |
3696 |
|
|
3697 |
|
|
3698 |
TTree* PamLevel2::GetCloneTree(TString name){ |
TTree* PamLevel2::GetCloneTree(TString name){ |
3699 |
|
|
3700 |
for(Int_t i=0; i<8; i++){ |
for(Int_t i=0; i<NCLONES; i++){ |
3701 |
if(tree_clone[i]){ |
if(pam_tree_clone[i]){ |
3702 |
TString na = tree_clone[i]->GetName(); |
TString na = pam_tree_clone[i]->GetName(); |
3703 |
if(!name.CompareTo(na))return tree_clone[i]; |
if(!name.CompareTo(na))return pam_tree_clone[i]; |
3704 |
}; |
}; |
3705 |
} |
} |
3706 |
|
if(run_tree_clone){ |
3707 |
|
TString na = run_tree_clone->GetName(); |
3708 |
|
if(!name.CompareTo(na))return run_tree_clone; |
3709 |
|
} |
3710 |
|
if(sel_tree_clone){ |
3711 |
|
TString na = sel_tree_clone->GetName(); |
3712 |
|
if(!name.CompareTo(na))return sel_tree_clone; |
3713 |
|
} |
3714 |
return NULL; |
return NULL; |
3715 |
|
|
3716 |
} |
} |
3717 |
void PamLevel2::WriteCloneTrees(){ |
void PamLevel2::WriteCloneTrees(){ |
3718 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
3719 |
cout << "Write clones of PAMELA trees "<<endl; |
cout << "Write clones of PAMELA trees "<<endl; |
3720 |
for(Int_t i=0; i<8; i++){ |
cout << run_tree_clone->GetName()<<endl; |
3721 |
if(tree_clone[i]){ |
if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries()) |
3722 |
cout << tree_clone[i]->GetName()<<endl; |
run_tree_clone->GetBranch("DeadLiveTime")->Fill(); |
3723 |
tree_clone[i]->Write(); |
run_tree_clone->Write(); |
3724 |
|
cout << sel_tree_clone->GetName()<<endl; |
3725 |
|
sel_tree_clone->Write(); |
3726 |
|
for(Int_t i=0; i<NCLONES; i++){ |
3727 |
|
if(pam_tree_clone[i]){ |
3728 |
|
cout << pam_tree_clone[i]->GetName()<<endl; |
3729 |
|
pam_tree_clone[i]->Write(); |
3730 |
}; |
}; |
3731 |
} |
} |
3732 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
3734 |
} |
} |
3735 |
|
|
3736 |
/** |
/** |
3737 |
* Create a new (empty) Pamela trees |
* Method to get level2-trees entry, the corresponding run entry and (if required) the level0 entry. |
3738 |
*/ |
*/ |
3739 |
// TTree* PamLevel2::GetNewPamTree(){ |
//Int_t PamLevel2::GetEntry(Int_t iee){ |
3740 |
|
Int_t PamLevel2::GetEntry(Long64_t iee){ |
3741 |
|
|
3742 |
|
// cout << "-------------------------------------"<<endl; |
3743 |
|
// cout << "Int_t PamLevel2::GetEntry("<<iee<<")"<<endl; |
3744 |
|
|
3745 |
|
if(!pam_tree){ |
3746 |
|
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- level2 trees not loaded"<<endl; |
3747 |
|
return 0; |
3748 |
|
} |
3749 |
|
|
3750 |
|
|
3751 |
// if(tree_clone)return tree_clone; |
// |
3752 |
|
// 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... |
3753 |
|
// |
3754 |
|
// if(!run_tree ){ |
3755 |
|
// cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loeaded"<<endl; |
3756 |
|
// return 0; |
3757 |
|
// } |
3758 |
|
|
3759 |
|
Long64_t ii=0; |
3760 |
|
//------------------------------- |
3761 |
|
ii = iee; |
3762 |
|
if( !pam_tree->GetEntry(ii) ){ |
3763 |
|
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading pam tree"<<endl; |
3764 |
|
return 0; |
3765 |
|
} |
3766 |
|
|
3767 |
|
// |
3768 |
|
// ... 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. |
3769 |
|
// 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 |
3770 |
|
// a problem if you don't check the return code of getentry. |
3771 |
|
// |
3772 |
|
if(!RUN || !run_tree ){ |
3773 |
|
if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1? |
3774 |
|
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl; |
3775 |
|
return 0; |
3776 |
|
} else { |
3777 |
|
return 1; //cosi` se non c'e` run esce qua... |
3778 |
|
} |
3779 |
|
} |
3780 |
|
|
3781 |
|
//------------------------------- |
3782 |
|
ii = iee; |
3783 |
|
// Bool_t UPDATED = UpdateRunInfo(run_tree,ii); |
3784 |
|
// Bool_t UPDATED = UpdateRunInfo(ii); |
3785 |
|
UpdateRunInfo(ii); |
3786 |
|
if(SELLI==0)irunentry = iee-runfirstentry; |
3787 |
|
// if(UPDATED && run_tree_clone)run_tree_clone->Fill(); |
3788 |
|
|
3789 |
|
// cout << "PamLevel2::GetEntry("<<iee<<") "<<irun<<" "<<runfirstentry<<" "<<irunentry<<endl; |
3790 |
|
|
3791 |
|
// cout << "irunentry "<<irunentry << endl; |
3792 |
|
// cout << "runfirstentry "<<runfirstentry << endl; |
3793 |
|
// cout << "nevents "<<GetRunInfo()->NEVENTS<< endl; |
3794 |
|
|
3795 |
|
// if( TRK0 || CAL0 || TOF0 ){ |
3796 |
|
// if( !GetYodaEntry( ) ){ |
3797 |
|
// cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading level0 tree"<<endl; |
3798 |
|
// return 0; |
3799 |
|
// } |
3800 |
|
// } |
3801 |
|
|
3802 |
|
|
3803 |
|
return 1; |
3804 |
|
|
3805 |
|
} |
3806 |
|
|
3807 |
|
TrkLevel0 *PamLevel2::GetTrkLevel0(){ |
3808 |
|
if( !TRK0 )return NULL; |
3809 |
|
if( !GetYodaEntry( ) ){ |
3810 |
|
cout << " Int_t PamLevel2::GetTrkLevel0() -- ERROR -- error reading level0 tree"<<endl; |
3811 |
|
return 0; |
3812 |
|
} |
3813 |
|
return trk0_obj; |
3814 |
|
}; |
3815 |
|
CaloLevel0 *PamLevel2::GetCaloLevel0(){ |
3816 |
|
if( !CAL0 )return NULL; |
3817 |
|
if( !GetYodaEntry( ) ){ |
3818 |
|
cout << " Int_t PamLevel2::GetCaloLevel0() -- ERROR -- error reading level0 tree"<<endl; |
3819 |
|
return 0; |
3820 |
|
} |
3821 |
|
return calo0_obj; |
3822 |
|
}; |
3823 |
|
|
3824 |
// TTree *Tout = 0; |
|
3825 |
|
/** |
3826 |
|
* Method to retrieve the level0 tree (YODA tree) that contains the current event. |
3827 |
|
* Given the run ID (...), if needed it query the DB and load the proper file. |
3828 |
|
* @return Pointer to the tree |
3829 |
|
*/ |
3830 |
|
|
3831 |
|
|
3832 |
|
TTree* PamLevel2::GetYodaTree( ){ |
3833 |
|
|
3834 |
|
// cout << "TTree* PamLevel2::GetYodaTree( )"<<endl; |
3835 |
|
//=================================== |
3836 |
|
// check if iroot has changed |
3837 |
|
//=================================== |
3838 |
|
if( irun<0 ){ |
3839 |
|
cout << "PamLevel2::GetYodaTree() -- ERROR -- irun = "<<irun<<endl; |
3840 |
|
// cout << "In order to use this method you have to first load the RunInfo tree "<<endl; |
3841 |
|
return NULL; |
3842 |
|
} |
3843 |
|
Int_t irootnew = run_obj->ID_ROOT_L0; |
3844 |
|
// cout << "iroot "<<iroot<<endl; |
3845 |
|
// cout << "irootnew "<<irootnew<<endl; |
3846 |
|
|
3847 |
|
//=================================== |
3848 |
|
// load the level0 file |
3849 |
|
// (if not already loaded) |
3850 |
|
//=================================== |
3851 |
|
if( iroot != irootnew || !l0_tree){ |
3852 |
|
iroot = irootnew; |
3853 |
|
//=================================== |
3854 |
|
// open the DB connection |
3855 |
|
// (if not already opened) |
3856 |
|
//=================================== |
3857 |
|
if(!dbc || (dbc && !dbc->IsConnected()))SetDBConnection(); |
3858 |
|
GL_ROOT glroot = GL_ROOT(); |
3859 |
|
if( glroot.Query_GL_ROOT(iroot,dbc) ){ |
3860 |
|
cout << "TTree* PamLevel2::GetYodaTree( ) -- ERROR -- level0 file iroot = "<<iroot<< " does not exists"<<endl; |
3861 |
|
return NULL; |
3862 |
|
}; |
3863 |
|
TString filename = glroot.PATH + glroot.NAME; |
3864 |
|
if(l0_file){ |
3865 |
|
l0_file->Close(); |
3866 |
|
l0_file->Delete(); |
3867 |
|
} |
3868 |
|
cout << "Opening LEVEL0 file: "<< filename << endl; |
3869 |
|
FileStat_t t; |
3870 |
|
if( gSystem->GetPathInfo(filename.Data(),t) ){ |
3871 |
|
cout << " PamLevel2::GetYodaTree() -- ERROR opening file "<<endl; |
3872 |
|
return NULL; |
3873 |
|
} |
3874 |
|
l0_file = new TFile(filename); |
3875 |
|
if( !l0_file )return NULL; |
3876 |
|
l0_tree = (TTree*)l0_file->Get("Physics"); |
3877 |
|
if(!h0_obj)h0_obj = new EventHeader(); |
3878 |
|
l0_tree->SetBranchAddress("Header" ,&h0_obj); |
3879 |
|
prevshift = 0; |
3880 |
|
//--------------------------------------------------- |
3881 |
|
// TRACKER: |
3882 |
|
if(TRK0){ |
3883 |
|
if(!trk0_obj){ |
3884 |
|
trk0_obj = new TrkLevel0(); |
3885 |
|
trk0_obj->Set(); |
3886 |
|
}; |
3887 |
|
l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent()); |
3888 |
|
} |
3889 |
|
//-------------------------------------------------- |
3890 |
|
// CALORIMETER: |
3891 |
|
if(CAL0){ |
3892 |
|
if(!calo0_obj){ |
3893 |
|
calo0_obj = new CaloLevel0(); |
3894 |
|
calo0_obj->Set(); |
3895 |
|
}; |
3896 |
|
l0_tree->SetBranchAddress("Calorimeter" ,calo0_obj->GetPointerToCalorimeterEvent()); |
3897 |
|
// cout << "PamLevel2::GetYodaTree() --- level0 calorimeter not implemented "<<endl; |
3898 |
|
} |
3899 |
|
//--------------------------------------------------- |
3900 |
|
// TOF: |
3901 |
|
if(TOF0){ |
3902 |
|
cout << "PamLevel2::GetYodaTree() --- level0 TOF not implemented "<<endl; |
3903 |
|
} |
3904 |
|
|
3905 |
|
dbc->Close(); // EMILIANO, do not leave open connections, open only when needed |
3906 |
|
|
3907 |
|
|
3908 |
|
}; |
3909 |
|
|
3910 |
|
// if(!dbc || (dbc && !dbc->IsConnected())){ |
3911 |
|
// cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
3912 |
|
// } |
3913 |
|
|
3914 |
|
if ( TRK0 ){ |
3915 |
|
TrkParams::Load(6); |
3916 |
|
if( !TrkParams::IsLoaded(6) ){ |
3917 |
|
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- VK-mask not loaded"<<endl; |
3918 |
|
}; |
3919 |
|
if(!dbc || (dbc && !dbc->IsConnected()))SetDBConnection(); |
3920 |
|
TrkParams::SetCalib(run_obj,dbc); |
3921 |
|
TrkParams::LoadCalib( ); |
3922 |
|
if( !TrkParams::CalibIsLoaded() ){ |
3923 |
|
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- Calibration not loaded"<<endl; |
3924 |
|
}; |
3925 |
|
dbc->Close(); // EMILIANO, do not leave open connections, open only when needed |
3926 |
|
} |
3927 |
|
|
3928 |
|
|
3929 |
|
// cout << l0_tree << endl; |
3930 |
|
return l0_tree; |
3931 |
|
|
3932 |
|
} |
3933 |
|
|
3934 |
|
/** |
3935 |
|
* Method to retrieve the level0 tree (YODA tree) that contains the current event. |
3936 |
|
*/ |
3937 |
|
Int_t PamLevel2::GetYodaEntry(){ |
3938 |
|
|
3939 |
|
// cout << "Int_t PamLevel2::GetYodaEntry()"<<endl; |
3940 |
|
if(!GetYodaTree())return 0; |
3941 |
|
|
3942 |
// cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
// patch |
3943 |
// cout << "Create new PAMELA trees "<<endl; |
if( irunentry < 0){ |
3944 |
|
// cout << "Int_t PamLevel2::GetYodaEntry() -- ATTENZIONE -- irunentry negativo?!?! "<<(Int_t)irunentry<<endl; |
3945 |
|
irunentry=0LL; |
3946 |
|
} |
3947 |
|
// --------------------------------- |
3948 |
|
// if file is NOT a preselected file |
3949 |
|
// --------------------------------- |
3950 |
|
Long64_t quellagiusta = irunentry + (Long64_t)(run_obj->EV_FROM); |
3951 |
|
// cout << " irunentry "<<irunentry<<endl; |
3952 |
|
// cout << " EV_FROM "<<run_obj->EV_FROM<<endl; |
3953 |
|
// cout << " quellagiusta = irunentry + EV_FROM "<< quellagiusta << endl; |
3954 |
|
|
3955 |
|
// cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl; |
3956 |
|
// cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl; |
3957 |
|
// cout << " time "<< abstime << endl; |
3958 |
|
// cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl; |
3959 |
|
|
3960 |
|
ULong64_t obt = 0; |
3961 |
|
ULong64_t pktn = 0; |
3962 |
|
if( GetOrbitalInfo() ){ |
3963 |
|
obt = GetOrbitalInfo()->OBT; |
3964 |
|
pktn = GetOrbitalInfo()->pkt_num; |
3965 |
|
} |
3966 |
|
|
3967 |
|
if( !GetOrbitalInfo() && !ISGP){ |
3968 |
|
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl; |
3969 |
|
return 0; |
3970 |
|
} |
3971 |
|
if( obt==0 && pktn==0 && !ISGP ){ |
3972 |
|
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? "<<endl; |
3973 |
|
return 0; |
3974 |
|
} |
3975 |
|
|
3976 |
|
// --------------------------------------------------------------------- |
3977 |
|
// ATTENTION!!! |
3978 |
|
// If data are not pre-processed with cleaner, the level0 tree may contain |
3979 |
|
// spurious nested physics packets. |
3980 |
|
// The GL_RUN variables EV_FROM, EV_TO and NEVENTS counts also these entries |
3981 |
|
// while level2 tree DOES NOT!! |
3982 |
|
// This means that "quellagiusta" in these cases is not correct. |
3983 |
|
// In order to retrieve the correct level0 event, I implemented a check |
3984 |
|
// of the OBT and pkt-number. In case of mismatch, the level0 entry number |
3985 |
|
// is shift forward until when the packets match. |
3986 |
|
// --------------------------------------------------------------------- |
3987 |
|
Int_t answer = 0; |
3988 |
|
Int_t shift =0; |
3989 |
|
// printf(" siamo qui %i %i \n",shift,prevshift); |
3990 |
|
// Int_t maxshift = 50; // EMILIANO |
3991 |
|
do{ |
3992 |
|
if(shift>0){ |
3993 |
|
cout << " PKTNUM L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
3994 |
|
cout << " RUN: ID "<< GetRunInfo()->ID << " ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<" ID_RUN_FRAG "<<GetRunInfo()->ID_RUN_FRAG << " EV_FROM "<<GetRunInfo()->EV_FROM <<endl; |
3995 |
|
cout << " L2 <--> L0 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl; |
3996 |
|
} |
3997 |
|
answer = l0_tree->GetEntry(quellagiusta+(Long64_t)shift+(Long64_t)prevshift); |
3998 |
|
shift++; |
3999 |
|
if( !GetEventHeader() ){ |
4000 |
|
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl; |
4001 |
|
return 0; |
4002 |
|
} |
4003 |
|
|
4004 |
|
if(ISGP){ |
4005 |
|
obt = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()); //BARBATRUCCO |
4006 |
|
pktn = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter()); //BARBATRUCCO |
4007 |
|
} |
4008 |
|
|
4009 |
|
// cout << "PKTNUM "<<shift<<" == L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
4010 |
|
// cout << " L2 --- "<< obt << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl; |
4011 |
|
// if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl; |
4012 |
|
// cout << " obt "<< obt << endl; |
4013 |
|
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
4014 |
|
// cout << " pktn "<< pktn << endl; |
4015 |
|
// cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
4016 |
|
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
4017 |
|
// |
4018 |
|
if ( prevshift != 0 && (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() ){ |
4019 |
|
prevshift = 0; |
4020 |
|
shift = -1; |
4021 |
|
}; |
4022 |
|
|
4023 |
|
}while( ( obt != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || |
4024 |
|
pktn != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter()) ) |
4025 |
|
&& (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() && shift < maxshift); |
4026 |
|
|
4027 |
|
if ( (quellagiusta+(Long64_t)shift+(Long64_t)prevshift) > GetYodaTree()->GetEntries() || shift == maxshift ) { |
4028 |
|
cout << " Big trouble here, no such event in Level0 data! " <<endl; |
4029 |
|
return 0; |
4030 |
|
} |
4031 |
|
// cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl; |
4032 |
|
// return GetYodaTree()->GetEntry(quellagiusta); |
4033 |
|
if ( shift > 1 ) prevshift += (shift-1); |
4034 |
|
|
4035 |
|
return answer; |
4036 |
|
|
4037 |
// if(TRK1||TRK2||TRKh){ |
} |
4038 |
// TTree *T = new TTree("Tracker_clone","PAMELA tracker level2 data "); |
/** |
4039 |
// if(TRK1) { |
* \Brief Set DB connection |
4040 |
// trk1_clone = new TrkLevel1(); |
*/ |
4041 |
// T->Branch("TrkLevel1","TrkLevel1", &trk1_clone); |
Bool_t PamLevel2::SetDBConnection(){ |
|
// T->BranchRef(); |
|
|
// cout << "Tracker : branch TrkLevel1"<<endl; |
|
|
// }; |
|
|
// if(TRK2) { |
|
|
// trk2_clone = new TrkLevel2(); |
|
|
// T->Branch("TrkLevel2", "TrkLevel2",&trk2_clone); |
|
|
// cout << "Tracker : branch TrkLevel2"<<endl; |
|
|
// }; |
|
|
// if(TRKh) { |
|
|
// trkh_clone = new TrkHough(); |
|
|
// T->Branch("TrkHough","TrkHough", &trkh_clone); |
|
|
// cout << "Tracker : branch TrkHough"<<endl; |
|
|
// }; |
|
|
// if(!Tout)Tout=T; |
|
|
// else Tout->AddFriend("Tracker_clone"); |
|
|
// } |
|
4042 |
|
|
4043 |
// // Calorimeter |
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
4044 |
// if(CAL1||CAL2){ |
cout<<"Connecting to DB"<<endl; |
4045 |
// TTree *C = new TTree("Calorimeter_clone","PAMELA calorimeter level2 data "); |
cout<<"HOST "<<host<<endl; |
4046 |
// if(CAL1) { |
cout<<"USER "<<user<<endl; |
4047 |
// calo1_clone = new CaloLevel1(); |
cout<<"PSW "<<psw<<endl; |
4048 |
// C->Branch("CaloLevel1", "CaloLevel1", &calo1_clone); |
dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data()); |
4049 |
// cout << "Calorimeter : branch CaloLevel1"<<endl; |
if( !dbc )return false; |
4050 |
// }; |
if( !dbc->IsConnected() )return false; |
4051 |
// if(CAL2) { |
stringstream myquery; // EMILIANO |
4052 |
// calo2_clone = new CaloLevel2(); |
myquery.str(""); // EMILIANO |
4053 |
// C->Branch("CaloLevel2","CaloLevel2", &calo2_clone); |
myquery << "SET time_zone='+0:00'"; // EMILIANO |
4054 |
// cout << "Calorimeter : branch CaloLevel2"<<endl; |
dbc->Query(myquery.str().c_str()); // EMILIANO |
4055 |
// }; |
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
4056 |
// if(!Tout)Tout=C; |
return true; |
|
// else Tout->AddFriend("Calorimeter_clone"); |
|
|
// } |
|
|
|
|
|
// // ToF |
|
|
// if(TOF) { |
|
|
// TTree *O = new TTree("ToF_clone","PAMELA ToF level2 data "); |
|
|
// tof_clone = new ToFLevel2(); |
|
|
// O->Branch("ToFLevel2","ToFLevel2", &tof_clone); |
|
|
// cout << "ToF : branch ToFLevel2"<<endl; |
|
|
// if(!Tout)Tout=O; |
|
|
// else Tout->AddFriend("ToF_clone"); |
|
|
// }; |
|
|
// // Trigger |
|
|
// if(TRG) { |
|
|
// TTree *R = new TTree("Trigger_clone","PAMELA trigger level2 data "); |
|
|
// trig_clone = new TrigLevel2(); |
|
|
// R->Branch("TrigLevel2","TrigLevel2", &trig_clone); |
|
|
// cout << "Trigger : branch TrigLevel2"<<endl; |
|
|
// if(!Tout)Tout=R; |
|
|
// else Tout->AddFriend("Trigger_clone"); |
|
|
// }; |
|
|
// // S4 |
|
|
// if(S4) { |
|
|
// TTree *S = new TTree("S4_clone","PAMELA S4 level2 data "); |
|
|
// s4_clone = new S4Level2(); |
|
|
// S->Branch("S4Level2","S4Level2", &s4_clone); |
|
|
// cout << "S4 : branch S4Level2"<<endl; |
|
|
// if(!Tout)Tout=S; |
|
|
// else Tout->AddFriend("S4_clone"); |
|
|
// }; |
|
|
// // Neutron Detector |
|
|
// if(ND) { |
|
|
// TTree *N = new TTree("NeutronD_clone","PAMELA neutron detector level2 data "); |
|
|
// nd_clone = new NDLevel2(); |
|
|
// N->Branch("NDLevel2","NDLevel2", &nd_clone); |
|
|
// cout << "NeutronD : branch NDLevel2"<<endl; |
|
|
// if(!Tout)Tout=N; |
|
|
// else Tout->AddFriend("NeutronD_clone"); |
|
|
// }; |
|
|
// // Anticounters |
|
|
// if(AC) { |
|
|
// TTree *A = new TTree("Anticounter_clone","PAMELA anticounter detector level2 data "); |
|
|
// ac_clone = new AcLevel2(); |
|
|
// A->Branch("AcLevel2","AcLevel2", &ac_clone); |
|
|
// cout << "Anticounter : branch AcLevel2"<<endl; |
|
|
// if(!Tout)Tout=A; |
|
|
// else Tout->AddFriend("Anticounter_clone"); |
|
|
// }; |
|
|
// // OrbitalInfo |
|
|
// if(ORB) { |
|
|
// TTree *B = new TTree("OrbitalInfo_clone","PAMELA oribital info "); |
|
|
// orb_clone = new OrbitalInfo(); |
|
|
// B->Branch("OrbitalInfo","OrbitalInfo", &orb_clone); |
|
|
// cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
|
|
// if(!Tout)Tout=B; |
|
|
// else Tout->AddFriend("OrbitalInfo_clone"); |
|
|
// }; |
|
|
// cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
|
4057 |
|
|
4058 |
// tree_clone = Tout; |
} |
|
// tree_clone->SetDirectory(0); |
|
4059 |
|
|
4060 |
// return Tout; |
/** |
4061 |
// } |
* \Brief Add a friend to the pamela chain. |
4062 |
// /** |
* @param cname name of the chain to be added |
4063 |
// * Fill a tree (created with GetNewPamTree) |
*/ |
4064 |
// * |
|
4065 |
// */ |
TChain* PamLevel2::AddFriend(TString cname){ |
4066 |
// //void PamLevel2::FillNewPamTree(TTree *T){ |
|
4067 |
// void PamLevel2::FillNewPamTree(){ |
if(!GetPamTree()){ |
4068 |
|
cout << " TChain* PamLevel2::AddFriend(TString cname) --- a pamela tree must be created first"<<endl; |
4069 |
|
return NULL; |
4070 |
|
} |
4071 |
|
|
4072 |
|
|
4073 |
|
TChain *c = new TChain( cname.Data() ); |
4074 |
|
|
4075 |
|
TIter next( GetPamTree()->GetListOfFiles() ); |
4076 |
|
Int_t nf = 0; |
4077 |
|
TChainElement* element = 0; |
4078 |
|
while ((element = (TChainElement*) next())) { |
4079 |
|
c->Add(element->GetTitle()); |
4080 |
|
nf++; |
4081 |
|
} |
4082 |
|
|
4083 |
|
GetPamTree()->AddFriend(cname.Data()); |
4084 |
|
|
4085 |
|
cout << "external chain created and added to pamela friends :"<<cname<<endl; |
4086 |
|
cout << "n.files "<<nf<<endl; |
4087 |
|
|
4088 |
|
|
4089 |
|
return c; |
4090 |
|
|
4091 |
|
} |
4092 |
|
|
|
// if(trk1_clone) *trk1_clone = *trk1_obj; |
|
|
// if(trk2_clone){ |
|
|
// trk2_clone->Clear(); |
|
|
// trk2_obj->Copy(*trk2_clone); |
|
|
// // *trk2_clone = *trk2_obj; |
|
|
// } |
|
|
// if(trkh_clone) *trkh_clone = *trkh_obj; |
|
|
// if(calo1_clone){ |
|
|
// // *calo1_clone = *calo1_obj; |
|
|
// calo1_clone->Clear(); |
|
|
// calo1_obj->Copy(*calo1_clone); |
|
|
// } |
|
|
// if(calo2_clone){ |
|
|
// // *calo2_clone = *calo2_obj; |
|
|
// calo2_clone->Clear(); |
|
|
// calo2_obj->Copy(*calo2_clone); |
|
|
// } |
|
|
// if(tof_clone) *tof_clone = *tof_obj; |
|
|
// if(trig_clone) *trig_clone = *trig_obj; |
|
|
// if(s4_clone) *s4_clone = *s4_obj; |
|
|
// if(nd_clone) *nd_clone = *nd_obj; |
|
|
// if(ac_clone) *ac_clone = *ac_obj; |
|
|
// if(orb_clone) *orb_clone = *orb_obj; |
|
|
|
|
|
// TTree *T = tree_clone; |
|
|
|
|
|
// T->Fill(); //fill main tree |
|
|
// // cout<<T->IsA()->GetName()<<" "<<T->GetName()<<endl; |
|
|
// TList *li = T->GetListOfFriends(); |
|
|
// TIter next(li); |
|
|
// TFriendElement* T_friend=0; |
|
|
// while( (T_friend = (TFriendElement*)next()) ){ |
|
|
// // cout<<T_friend->IsA()->GetName()<<" "<<T_friend->GetName()<<hex << T_friend->GetTree() << dec<<endl; |
|
|
// T_friend->GetTree()->Fill();//fill friends |
|
|
// } |
|
4093 |
|
|
|
// } |
|