| 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; |
| 367 |
* Default Constructor |
* Default Constructor |
| 368 |
*/ |
*/ |
| 369 |
PamLevel2::PamLevel2(){ |
PamLevel2::PamLevel2(){ |
| 370 |
Initialize(); |
Initialize(); |
| 371 |
}; |
}; |
| 372 |
|
|
| 373 |
/** |
/** |
| 374 |
* Constructor with given dir, list and detectors |
* 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){ |
PamLevel2::PamLevel2(TString ddir,TString list,TString detlist){ |
| 388 |
Initialize(); |
Initialize(); |
| 389 |
GetPamTree(GetListOfLevel2Files(ddir,list),detlist); |
TList* listf = GetListOfLevel2Files(ddir,list); |
| 390 |
GetRunTree(GetListOfLevel2Files(ddir,list)); |
GetPamTree(listf,detlist); |
| 391 |
|
GetRunTree(listf); |
| 392 |
}; |
}; |
| 393 |
|
|
| 394 |
/** |
/** |
| 395 |
* Constructor with given dir and list |
* 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){ |
PamLevel2::PamLevel2(TString ddir,TString list){ |
| 402 |
Initialize(); |
Initialize(); |
| 403 |
GetPamTree(GetListOfLevel2Files(ddir,list),""); |
TList* listf = GetListOfLevel2Files(ddir,list); |
| 404 |
GetRunTree(GetListOfLevel2Files(ddir,list)); |
GetPamTree(listf,""); |
| 405 |
|
GetRunTree(listf); |
| 406 |
}; |
}; |
| 407 |
|
|
| 408 |
|
|
| 409 |
void PamLevel2::Initialize(){ |
void PamLevel2::Initialize(){ |
| 410 |
|
|
|
// trk2_obj = TrkLevel2::GetTrkLevel2(); |
|
|
// trk1_obj = TrkLevel1::GetTrkLevel1(); |
|
|
// trkh_obj = TrkHough::GetTrkHough(); |
|
|
// calo1_obj = CaloLevel1::GetCaloLevel1(); |
|
|
// calo2_obj = CaloLevel2::GetCaloLevel2(); |
|
|
// tof_obj = ToFLevel2::GetToFLevel2(); |
|
|
// trig_obj = TrigLevel2::GetTrigLevel2(); |
|
|
// s4_obj = S4Level2::GetS4Level2(); |
|
|
// nd_obj = NDLevel2::GetNDLevel2(); |
|
|
// ac_obj = AcLevel2::GetAcLevel2(); |
|
|
// orb_obj = OrbitalInfo::GetOrbitalInfo(); |
|
|
|
|
| 411 |
h0_obj = 0; |
h0_obj = 0; |
| 412 |
trk0_obj = 0; |
trk0_obj = 0; |
| 413 |
calo0_obj = 0; |
calo0_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 = -1LL; |
irun = -1LL; |
| 431 |
|
irunt = -1LL; |
| 432 |
runfirstentry = 0LL; |
runfirstentry = 0LL; |
| 433 |
runlastentry = 0LL; |
runlastentry = 0LL; |
| 434 |
|
|
| 438 |
dbc = 0; |
dbc = 0; |
| 439 |
|
|
| 440 |
prevshift = 0; |
prevshift = 0; |
| 441 |
|
maxshift = 10; //EMILIANO |
| 442 |
|
|
| 443 |
run_tree = NULL; |
run_tree = NULL; |
| 444 |
run_tree_clone = NULL; |
run_tree_clone = NULL; |
| 449 |
pam_tree = NULL; |
pam_tree = NULL; |
| 450 |
for(Int_t i=0; i<NCLONES; i++ )pam_tree_clone[i]=NULL; |
for(Int_t i=0; i<NCLONES; i++ )pam_tree_clone[i]=NULL; |
| 451 |
|
|
| 452 |
|
totdltime[0] = 0LL; |
| 453 |
|
totdltime[1] = 0LL; |
| 454 |
|
totdltime[2] = 0LL; |
| 455 |
|
|
| 456 |
host = "mysql://localhost/pamelaprod"; |
host = "mysql://localhost/pamelaprod"; |
| 457 |
user = "anonymous"; |
user = "anonymous"; |
| 458 |
psw = ""; |
psw = ""; |
| 475 |
CAL2 = true; |
CAL2 = true; |
| 476 |
TRK2 = true; |
TRK2 = true; |
| 477 |
TRK1 = false; |
TRK1 = false; |
| 478 |
TRKh = false; |
TRK0 = false; |
| 479 |
TRKh = false; |
TRKh = false; |
| 480 |
TRG = true; |
TRG = true; |
| 481 |
TOF = true; |
TOF = true; |
| 483 |
S4 = true; |
S4 = true; |
| 484 |
ND = true; |
ND = true; |
| 485 |
AC = true; |
AC = true; |
| 486 |
ORB = true; |
ORB = true; |
| 487 |
|
GP = false; |
| 488 |
|
|
| 489 |
RUN = true; |
RUN = true; |
| 490 |
|
|
| 491 |
SELLI = -1; |
SELLI = -1; |
| 492 |
|
|
| 493 |
|
ISGP = false; |
| 494 |
|
|
| 495 |
tsorted=0; |
tsorted=0; |
| 496 |
timage=0; |
timage=0; |
| 497 |
|
|
| 523 |
if(nd_obj) delete nd_obj; |
if(nd_obj) delete nd_obj; |
| 524 |
if(ac_obj) delete ac_obj; |
if(ac_obj) delete ac_obj; |
| 525 |
if(orb_obj) delete orb_obj; |
if(orb_obj) delete orb_obj; |
| 526 |
|
if(gp_obj) delete gp_obj; |
| 527 |
|
|
| 528 |
if(tsorted){ |
if(tsorted){ |
| 529 |
tsorted->Delete(); |
tsorted->Delete(); |
| 542 |
if(l0_file)l0_file->Close(); |
if(l0_file)l0_file->Close(); |
| 543 |
// if(pam_tree)pam_tree->Delete();; |
// if(pam_tree)pam_tree->Delete();; |
| 544 |
|
|
| 545 |
if ( pam_tree ){ |
if ( pam_tree ){ |
| 546 |
// |
// |
| 547 |
// we have first to find which chains we have to delete, then delete the main chain and only after delete the friend chains. Any other order causes a segfault... |
// we have first to find which chains we have to delete, then delete the main chain and only after delete the friend chains. Any other order causes a segfault... |
| 548 |
// |
// |
| 549 |
TList *temp = pam_tree->GetListOfFriends(); |
TList *temp = pam_tree->GetListOfFriends(); |
| 550 |
TList *contents = new TList; // create chain friend list |
TList *contents = new TList; // create chain friend list |
| 551 |
contents->SetOwner(); |
contents->SetOwner(); |
| 552 |
TIter next(temp); |
TIter next(temp); |
| 553 |
TChain *questo = 0; |
TChain *questo = 0; |
| 554 |
while ( (questo = (TChain*) next()) ){ |
while ( (questo = (TChain*) next()) ){ |
| 555 |
TString name = questo->GetName(); |
TString name = questo->GetName(); |
| 556 |
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
| 557 |
}; |
}; |
| 558 |
// |
// |
| 559 |
// deleting the main chain |
// deleting the main chain |
| 560 |
// |
// |
| 561 |
pam_tree->Delete(); |
pam_tree->Delete(); |
| 562 |
// |
// |
| 563 |
// deleting the friends... |
// deleting the friends... |
| 564 |
// |
// |
| 565 |
TIter next2(contents); |
TIter next2(contents); |
| 566 |
TChain *questa = 0; |
TChain *questa = 0; |
| 567 |
while ( questa = (TChain*)next2() ){ |
while ( questa = (TChain*)next2() ){ |
| 568 |
TString name = questa->GetName(); |
TString name = questa->GetName(); |
| 569 |
questa->Delete(); |
questa->Delete(); |
| 570 |
questa=NULL; |
questa=NULL; |
| 571 |
|
}; |
| 572 |
|
// |
| 573 |
}; |
}; |
| 574 |
// |
pam_tree = NULL; |
|
}; |
|
|
pam_tree = NULL; |
|
| 575 |
|
|
| 576 |
if(run_tree)run_tree->Delete();; |
if(run_tree)run_tree->Delete();; |
| 577 |
if(sel_tree)sel_tree->Delete();; |
if(sel_tree)sel_tree->Delete();; |
| 579 |
if(run_tree_clone)run_tree_clone->Delete();; |
if(run_tree_clone)run_tree_clone->Delete();; |
| 580 |
if(sel_tree_clone)sel_tree_clone->Delete();; |
if(sel_tree_clone)sel_tree_clone->Delete();; |
| 581 |
|
|
| 582 |
|
if(irunoffset) delete [] irunoffset; |
| 583 |
|
|
| 584 |
}; |
}; |
| 585 |
|
|
| 612 |
if(nd_obj) nd_obj->Clear(); |
if(nd_obj) nd_obj->Clear(); |
| 613 |
if(ac_obj) ac_obj->Clear(); |
if(ac_obj) ac_obj->Clear(); |
| 614 |
if(orb_obj) orb_obj->Clear(); |
if(orb_obj) orb_obj->Clear(); |
| 615 |
|
if(gp_obj) gp_obj->Clear(); |
| 616 |
|
|
| 617 |
// if(sorted_tracks)sorted_tracks->Clear(); |
// if(sorted_tracks)sorted_tracks->Clear(); |
| 618 |
// sorted_tracks.Clear(); |
// sorted_tracks.Clear(); |
| 626 |
}; |
}; |
| 627 |
|
|
| 628 |
void PamLevel2::Reset(){ |
void PamLevel2::Reset(){ |
|
// |
|
|
// First of all clear everything |
|
|
// |
|
|
Clear(); |
|
|
// |
|
|
// close and reset chains and pointers |
|
|
// |
|
|
if ( pam_tree ){ |
|
| 629 |
// |
// |
| 630 |
// we have first to find which chains we have to delete, then delete the main chain and only after delete the friend chains. Any other order causes a segfault... |
// First of all clear everything |
| 631 |
|
// |
| 632 |
|
Clear(); |
| 633 |
|
// |
| 634 |
|
// close and reset chains and pointers |
| 635 |
|
// |
| 636 |
|
if ( pam_tree ){ |
| 637 |
|
// |
| 638 |
|
// 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... |
| 639 |
|
// |
| 640 |
|
TList *temp = pam_tree->GetListOfFriends(); |
| 641 |
|
TList *contents = new TList; // create chain friend list |
| 642 |
|
contents->SetOwner(); |
| 643 |
|
TIter next(temp); |
| 644 |
|
TChain *questo = 0; |
| 645 |
|
while ( (questo = (TChain*) next()) ){ |
| 646 |
|
TString name = questo->GetName(); |
| 647 |
|
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
| 648 |
|
}; |
| 649 |
|
// |
| 650 |
|
// deleting the main chain |
| 651 |
|
// |
| 652 |
|
pam_tree->Delete(); |
| 653 |
|
// |
| 654 |
|
// deleting the friends... |
| 655 |
|
// |
| 656 |
|
TIter next2(contents); |
| 657 |
|
TChain *questa = 0; |
| 658 |
|
while ( questa = (TChain*)next2() ){ |
| 659 |
|
TString name = questa->GetName(); |
| 660 |
|
questa->Delete(); |
| 661 |
|
questa=NULL; |
| 662 |
|
}; |
| 663 |
|
// |
| 664 |
|
}; |
| 665 |
|
pam_tree = NULL; |
| 666 |
|
// |
| 667 |
|
if(run_tree)run_tree->Delete();; |
| 668 |
|
run_tree = NULL; |
| 669 |
|
if(sel_tree)sel_tree->Delete();; |
| 670 |
|
sel_tree = NULL; |
| 671 |
|
// |
| 672 |
|
// Close file |
| 673 |
|
// |
| 674 |
|
if(l0_file)l0_file->Close("R"); |
| 675 |
|
l0_file = NULL; |
| 676 |
|
// |
| 677 |
|
h0_obj = 0; |
| 678 |
|
trk0_obj = 0; |
| 679 |
|
calo0_obj = 0; |
| 680 |
|
// |
| 681 |
|
trk2_obj = 0; |
| 682 |
|
trk1_obj = 0; |
| 683 |
|
trkh_obj = 0; |
| 684 |
|
calo1_obj = 0; |
| 685 |
|
calo2_obj = 0; |
| 686 |
|
tof_obj = 0; |
| 687 |
|
trig_obj = 0; |
| 688 |
|
s4_obj = 0; |
| 689 |
|
nd_obj = 0; |
| 690 |
|
ac_obj = 0; |
| 691 |
|
orb_obj = 0; |
| 692 |
|
gp_obj = 0; |
| 693 |
|
// |
| 694 |
|
// Reset run pointers |
| 695 |
|
// |
| 696 |
|
run_obj = 0;//new GL_RUN(); |
| 697 |
|
soft_obj = 0;// Emiliano |
| 698 |
|
irun = -1; |
| 699 |
|
irunt = -1; |
| 700 |
|
runfirstentry = 0ULL; |
| 701 |
|
runlastentry = 0ULL; |
| 702 |
|
// |
| 703 |
|
totdltime[0] = 0LL; |
| 704 |
|
totdltime[1] = 0LL; |
| 705 |
|
totdltime[2] = 0LL; |
| 706 |
// |
// |
|
TList *temp = pam_tree->GetListOfFriends(); |
|
|
TList *contents = new TList; // create chain friend list |
|
|
contents->SetOwner(); |
|
|
TIter next(temp); |
|
|
TChain *questo = 0; |
|
|
while ( (questo = (TChain*) next()) ){ |
|
|
TString name = questo->GetName(); |
|
|
contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list |
|
|
}; |
|
|
// |
|
|
// deleting the main chain |
|
|
// |
|
|
pam_tree->Delete(); |
|
|
// |
|
|
// deleting the friends... |
|
|
// |
|
|
TIter next2(contents); |
|
|
TChain *questa = 0; |
|
|
while ( questa = (TChain*)next2() ){ |
|
|
TString name = questa->GetName(); |
|
|
questa->Delete(); |
|
|
questa=NULL; |
|
|
}; |
|
|
// |
|
|
}; |
|
|
pam_tree = NULL; |
|
|
// |
|
|
if(run_tree)run_tree->Delete();; |
|
|
run_tree = NULL; |
|
|
if(sel_tree)sel_tree->Delete();; |
|
|
sel_tree = NULL; |
|
|
// |
|
|
// Close file |
|
|
// |
|
|
if(l0_file)l0_file->Close("R"); |
|
|
l0_file = NULL; |
|
|
// |
|
|
h0_obj = 0; |
|
|
trk0_obj = 0; |
|
|
calo0_obj = 0; |
|
|
// |
|
|
trk2_obj = 0; |
|
|
trk1_obj = 0; |
|
|
trkh_obj = 0; |
|
|
calo1_obj = 0; |
|
|
calo2_obj = 0; |
|
|
tof_obj = 0; |
|
|
trig_obj = 0; |
|
|
s4_obj = 0; |
|
|
nd_obj = 0; |
|
|
ac_obj = 0; |
|
|
orb_obj = 0; |
|
|
// |
|
|
// Reset run pointers |
|
|
// |
|
|
run_obj = 0;//new GL_RUN(); |
|
|
soft_obj = 0;// Emiliano |
|
|
irun = -1; |
|
|
runfirstentry = 0ULL; |
|
|
runlastentry = 0ULL; |
|
|
// |
|
| 707 |
}; |
}; |
| 708 |
|
|
| 709 |
Bool_t PamLevel2::IsGood(){ |
Bool_t PamLevel2::IsGood(){ |
| 710 |
Bool_t goodev=true; |
Bool_t goodev=true; |
| 711 |
// if(trk2_obj && trk2_obj->UnpackError() != 0 ) goodev = false; |
// if(trk2_obj && trk2_obj->UnpackError() != 0 ) goodev = false; |
| 712 |
if(calo2_obj && calo2_obj->good != 1) goodev = false; |
if(calo2_obj && calo2_obj->good != 1) goodev = false; |
| 713 |
if(tof_obj && tof_obj->unpackError != 0) goodev = false; |
if(tof_obj && tof_obj->unpackError != 0) goodev = false; |
| 714 |
if(trig_obj && trig_obj->unpackError != 0) goodev = false; |
if(trig_obj && trig_obj->unpackError != 0) goodev = false; |
| 715 |
if(s4_obj && s4_obj->unpackError != 0) goodev = false; |
if(s4_obj && s4_obj->unpackError != 0) goodev = false; |
| 716 |
if(nd_obj && nd_obj->unpackError != 0) goodev = false; |
if(nd_obj && nd_obj->unpackError != 0) goodev = false; |
| 717 |
if(ac_obj && ac_obj->unpackError != 255) goodev = false; |
if(ac_obj && ac_obj->unpackError != 255) goodev = false; |
| 718 |
// if(orb_obj) |
// if(orb_obj) |
| 719 |
return goodev; |
return goodev; |
| 720 |
}; |
}; |
| 721 |
|
|
| 722 |
//-------------------------------------- |
//-------------------------------------- |
| 783 |
if(!orb_obj) orb_obj = new OrbitalInfo(); |
if(!orb_obj) orb_obj = new OrbitalInfo(); |
| 784 |
return &orb_obj; |
return &orb_obj; |
| 785 |
}; |
}; |
| 786 |
|
if(!objname.CompareTo("GPamela")){ |
| 787 |
|
if(!gp_obj) gp_obj = new GPamela(); |
| 788 |
|
return &gp_obj; |
| 789 |
|
}; |
| 790 |
|
|
| 791 |
if(!objname.CompareTo("RunInfo"))return &run_obj; |
if(!objname.CompareTo("RunInfo"))return &run_obj; |
| 792 |
|
|
| 802 |
* Retrieves the calorimeter track matching the seqno-th tracker stored track. |
* Retrieves the calorimeter track matching the seqno-th tracker stored track. |
| 803 |
* (If seqno = -1 retrieves the self-trigger calorimeter track) |
* (If seqno = -1 retrieves the self-trigger calorimeter track) |
| 804 |
*/ |
*/ |
| 805 |
CaloTrkVar *PamLevel2::GetCaloStoredTrack(int seqno){ |
CaloTrkVar *PamLevel2::GetCaloStoredTrack(int seqno){ |
| 806 |
|
|
| 807 |
if( !calo2_obj )return 0; |
if( !calo2_obj )return 0; |
| 808 |
|
|
| 809 |
if( calo2_obj->CaloLevel2::ntrk()==0 ){ |
if( calo2_obj->CaloLevel2::ntrk()==0 ){ |
| 810 |
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; |
| 811 |
return NULL; |
return NULL; |
| 812 |
}; |
}; |
| 813 |
|
|
| 814 |
CaloTrkVar *c = 0; |
CaloTrkVar *c = 0; |
| 815 |
Int_t it_calo=0; |
Int_t it_calo=0; |
| 816 |
|
|
| 817 |
do{ |
do{ |
| 818 |
c = calo2_obj->CaloLevel2::GetCaloTrkVar(it_calo); |
c = calo2_obj->CaloLevel2::GetCaloTrkVar(it_calo); |
| 819 |
it_calo++; |
it_calo++; |
| 820 |
} while( c && seqno != c->trkseqno && it_calo < calo2_obj->CaloLevel2::ntrk()); |
} while( c && seqno != c->trkseqno && it_calo < calo2_obj->CaloLevel2::ntrk()); |
| 821 |
|
|
| 822 |
if(!c || seqno != c->trkseqno){ |
if(!c || seqno != c->trkseqno){ |
| 823 |
c = 0; |
c = 0; |
| 824 |
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; |
| 825 |
}; |
}; |
| 826 |
return c; |
return c; |
| 827 |
|
|
| 828 |
}; |
}; |
| 829 |
//-------------------------------------- |
//-------------------------------------- |
| 830 |
// |
// |
| 831 |
// |
// |
| 832 |
//-------------------------------------- |
//-------------------------------------- |
| 833 |
/** |
/** |
| 834 |
* Retrieves the ToF track matching the seqno-th tracker stored track. |
* Retrieves the ToF track matching the seqno-th tracker stored track. |
| 835 |
* (If seqno = -1 retrieves the tracker-independent tof track) |
* (If seqno = -1 retrieves the tracker-independent tof track) |
| 836 |
*/ |
*/ |
| 837 |
ToFTrkVar *PamLevel2::GetToFStoredTrack(int seqno){ |
ToFTrkVar *PamLevel2::GetToFStoredTrack(int seqno){ |
| 838 |
|
|
| 839 |
if( !tof_obj )return 0; |
if( !tof_obj )return 0; |
| 840 |
|
|
| 841 |
if( tof_obj->ToFLevel2::ntrk()==0 ){ |
if( tof_obj->ToFLevel2::ntrk()==0 ){ |
| 842 |
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; |
| 843 |
return NULL; |
return NULL; |
| 844 |
}; |
}; |
| 845 |
|
|
| 846 |
ToFTrkVar *c = 0; |
ToFTrkVar *c = 0; |
| 847 |
Int_t it_tof=0; |
Int_t it_tof=0; |
| 848 |
|
|
| 849 |
do{ |
do{ |
| 850 |
c = tof_obj->ToFLevel2::GetToFTrkVar(it_tof); |
c = tof_obj->ToFLevel2::GetToFTrkVar(it_tof); |
| 851 |
it_tof++; |
it_tof++; |
| 852 |
} while( c && seqno != c->trkseqno && it_tof < tof_obj->ToFLevel2::ntrk()); |
} while( c && seqno != c->trkseqno && it_tof < tof_obj->ToFLevel2::ntrk()); |
| 853 |
|
|
| 854 |
if(!c || seqno != c->trkseqno){ |
if(!c || seqno != c->trkseqno){ |
| 855 |
c = 0; |
c = 0; |
| 856 |
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; |
| 857 |
}; |
}; |
| 858 |
return c; |
return c; |
| 859 |
|
|
| 860 |
}; |
}; |
| 861 |
|
|
| 862 |
//-------------------------------------- |
//-------------------------------------- |
| 863 |
// |
// |
| 864 |
// |
// |
| 865 |
//-------------------------------------- |
//-------------------------------------- |
| 866 |
/** |
/** |
| 867 |
* 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. |
| 868 |
*/ |
*/ |
| 869 |
PamTrack* PamLevel2::GetPamTrackAlong(TrkTrack* t){ |
PamTrack* PamLevel2::GetPamTrackAlong(TrkTrack* t){ |
| 870 |
|
|
| 871 |
cout <<"PamLevel2::GetPamTrackAlong(TrkTrack* t) **obsolete** "<<endl; |
cout <<"PamLevel2::GetPamTrackAlong(TrkTrack* t) **obsolete** "<<endl; |
| 872 |
cout <<"(if you use it, remember to delete the PamTrack object)"<<endl; |
cout <<"(if you use it, remember to delete the PamTrack object)"<<endl; |
| 873 |
|
|
| 874 |
CaloTrkVar *c = 0; |
CaloTrkVar *c = 0; |
| 875 |
ToFTrkVar *o = 0; |
ToFTrkVar *o = 0; |
| 876 |
|
|
| 877 |
if(CAL2) c = GetCaloStoredTrack(t->GetSeqNo()); |
if(CAL2) c = GetCaloStoredTrack(t->GetSeqNo()); |
| 878 |
if(TOF) o = GetToFStoredTrack(t->GetSeqNo()); |
if(TOF) o = GetToFStoredTrack(t->GetSeqNo()); |
| 879 |
|
|
| 880 |
// if(t && c && o)track = new PamTrack(t,c,o); |
// if(t && c && o)track = new PamTrack(t,c,o); |
| 881 |
PamTrack *track = new PamTrack(t,c,o); |
PamTrack *track = new PamTrack(t,c,o); |
| 882 |
|
|
| 883 |
return track; |
return track; |
| 884 |
|
|
| 885 |
}; |
}; |
| 886 |
//-------------------------------------- |
//-------------------------------------- |
| 887 |
// |
// |
| 888 |
// |
// |
| 918 |
// |
// |
| 919 |
|
|
| 920 |
/** |
/** |
| 921 |
* Sort physical (tracker) tracks and stores them in the TRefArray (of TrkTrack objects) which pointer is PamLevel2::sorted_tracks. Left here as backward compatibility method. |
* Sort physical (tracker) tracks. Left here as backward compatibility method. |
| 922 |
**/ |
**/ |
| 923 |
void PamLevel2::SortTracks(TString how){ |
void PamLevel2::SortTracks(TString how){ |
| 924 |
printf(" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n",how.Data()); |
printf(" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n",how.Data()); |
| 925 |
howtosort = how; |
howtosort = how; |
| 926 |
SortTracks(); |
SortTracks(); |
| 927 |
}; |
}; |
| 928 |
|
|
| 929 |
// |
// |
| 930 |
//-------------------------------------- |
//-------------------------------------- |
| 931 |
/** |
/** |
| 932 |
* Sort physical (tracker) tracks and stores them in the TRefArray (of TrkTrack objects) which pointer is PamLevel2::sorted_tracks. |
* Sort physical (tracker) tracks. |
| 933 |
* @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...). |
| 934 |
* Sorting cryteria: |
* Sorting cryteria: |
| 935 |
* TRK: lower chi**2 |
* TRK: lower chi**2 |
| 936 |
* CAL: lower Y spatial residual on the first calorimeter plane |
* CAL: lower Y spatial residual on the first calorimeter plane |
| 937 |
* 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). |
| 938 |
|
* S1: (ask Emiliano) |
| 939 |
|
* S2: (ask Emiliano) |
| 940 |
|
* S3: (ask Emiliano) |
| 941 |
|
* GP: more GP hits |
| 942 |
* The default sorting cryterium is "TOF+CAL". |
* The default sorting cryterium is "TOF+CAL". |
| 943 |
* |
* |
| 944 |
* 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). |
| 945 |
*/ |
*/ |
| 946 |
void PamLevel2::SortTracks(){ |
void PamLevel2::SortTracks(){ |
| 947 |
TString how = howtosort; |
TString how = howtosort; |
|
|
|
|
// cout <<" PamLevel2::SortTracks(TString how) "<<endl; |
|
|
if( !trk2_obj ){ |
|
|
cout << "void PamLevel2::SortTracks(): TrkLevel2 not loaded !!!"; |
|
|
return; |
|
|
}; |
|
|
// cout << "call SortTracs() "<<endl; |
|
|
//Save current Object count |
|
|
Int_t ObjectNumber = TProcessID::GetObjectCount(); |
|
|
|
|
|
// cout << "ObjectNumber "<<ObjectNumber <<endl; |
|
|
|
|
|
// if(!sorted_tracks)sorted_tracks = new TRefArray(); |
|
|
// sorted_tracks->Clear(); |
|
|
// sorted_tracks.Clear(); |
|
|
|
|
|
if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
|
|
tsorted->Delete(); |
|
|
TClonesArray &ttsorted = *tsorted; |
|
|
if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
|
|
timage->Delete(); |
|
|
TClonesArray &ttimage = *timage; |
|
|
|
|
|
|
|
|
// loop over the tracks sorted by the tracker |
|
|
Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase); |
|
|
Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase); |
|
|
Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase); |
|
|
|
|
|
if( !CAL2 && use_CAL) use_CAL = false; |
|
|
if( !TOF && use_TOF) use_TOF = false; |
|
|
|
|
|
if( !TRK2 ){ |
|
|
// cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl; |
|
|
return; |
|
|
}; |
|
|
|
|
|
// cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl; |
|
|
|
|
|
for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){ |
|
|
|
|
|
TrkTrack *ts = 0; |
|
|
CaloTrkVar *cs = 0; |
|
|
ToFTrkVar *os = 0; |
|
|
|
|
|
// get tracker tracks |
|
|
TrkTrack *tp = trk2_obj->TrkLevel2::GetTrack(i); //tracker |
|
|
CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo()); |
|
|
ToFTrkVar *op = GetToFStoredTrack(tp->GetSeqNo()); |
|
|
|
|
|
TrkTrack *ti = 0; //tracker (image) |
|
|
CaloTrkVar *ci = 0; |
|
|
ToFTrkVar *oi = 0; |
|
|
// cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl; |
|
|
// if track has an image, check image selection |
|
|
if(tp->HasImage()){ |
|
|
|
|
|
ti = trk2_obj->TrkLevel2::GetTrackImage(i); //tracker (image) |
|
|
ci = GetCaloStoredTrack(ti->GetSeqNo()); |
|
|
oi = GetToFStoredTrack(ti->GetSeqNo()); |
|
|
|
|
|
// cout << "its image "<<i << " "<<hex<< ti <<dec<< endl; |
|
| 948 |
|
|
| 949 |
//assign starting scores |
// cout <<" PamLevel2::SortTracks(TString how) "<<endl; |
| 950 |
Int_t tp_score = 0; //main track sorted by the tracker |
if( !trk2_obj ){ |
| 951 |
Int_t ti_score = 0; //image track |
cout << "void PamLevel2::SortTracks(): TrkLevel2 not loaded !!!"; |
|
|
|
|
// ------------------------ |
|
|
// calorimeter check |
|
|
// ------------------------ |
|
|
// check the Y spatial residual on the first calorimeter plane |
|
|
// (cut on calorimeter variables from Emiliano) |
|
|
if( use_CAL && !calo2_obj ){ |
|
|
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but CaloLevel2 not loaded !!!"; |
|
| 952 |
return; |
return; |
| 953 |
}; |
}; |
| 954 |
if( |
//Save current Object count |
| 955 |
use_CAL && |
Int_t ObjectNumber = TProcessID::GetObjectCount(); |
| 956 |
calo2_obj->npcfit[1] > 5 && //no. of fit planes on Y view |
|
| 957 |
calo2_obj->varcfit[1] < 1000. && //fit variance on Y view |
// create TCloneArrays to store tracks and its images |
| 958 |
cp && ci && |
if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
| 959 |
true){ |
tsorted->Delete(); |
| 960 |
|
TClonesArray &ttsorted = *tsorted; |
| 961 |
|
|
| 962 |
|
if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks()); |
| 963 |
|
timage->Delete(); |
| 964 |
|
TClonesArray &ttimage = *timage; |
| 965 |
|
|
|
|
|
|
Float_t resy_p = cp->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_p < 0)resy_p= - resy_p; |
|
|
Float_t resy_i = ci->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_i < 0)resy_i= - resy_i; |
|
|
|
|
|
if(resy_p <= resy_i) tp_score++; |
|
|
else ti_score++; |
|
|
|
|
|
// cout << "CALO "<<tp_score<<ti_score<<endl; |
|
| 966 |
|
|
| 967 |
}; |
|
| 968 |
// ------------------------ |
//-------------------------------------------------- |
| 969 |
// TOF check |
// retrieve sorting method |
| 970 |
// ------------------------ |
//-------------------------------------------------- |
| 971 |
// check the number of hit pmts along the track |
Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase); |
| 972 |
// on S12 S21 and S32, where paddles are parallel to Y axis |
Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase); |
| 973 |
if( use_TOF && !tof_obj ){ |
Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase); |
| 974 |
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but ToFLevel2 not loaded !!!"; |
Bool_t use_S1 = how.Contains("S1", TString::kIgnoreCase); |
| 975 |
|
Bool_t use_S2 = how.Contains("S2", TString::kIgnoreCase); |
| 976 |
|
Bool_t use_S3 = how.Contains("S3", TString::kIgnoreCase); |
| 977 |
|
Bool_t use_GP = how.Contains("GP", TString::kIgnoreCase); |
| 978 |
|
|
| 979 |
|
if ( use_TOF ){ |
| 980 |
|
use_S1 = true; |
| 981 |
|
use_S2 = true; |
| 982 |
|
use_S3 = true; |
| 983 |
|
}; |
| 984 |
|
if( !CAL2 && use_CAL) use_CAL = false; |
| 985 |
|
if( !TOF ){ |
| 986 |
|
use_TOF = false; |
| 987 |
|
use_S1 = false; |
| 988 |
|
use_S2 = false; |
| 989 |
|
use_S3 = false; |
| 990 |
|
} |
| 991 |
|
if( !GP ){ |
| 992 |
|
use_GP = false; |
| 993 |
|
} |
| 994 |
|
|
| 995 |
|
if( !TRK2 ){ |
| 996 |
|
cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl; |
| 997 |
return; |
return; |
| 998 |
}; |
}; |
| 999 |
if( use_TOF && op && oi ){ |
|
| 1000 |
|
// cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl; |
| 1001 |
// |
|
| 1002 |
Float_t sen = 0.; |
|
| 1003 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
//-------------------------------------------------- |
| 1004 |
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
// loop over "physical" tracks sorted by the tracker |
| 1005 |
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (op->dedx).At(ih); |
//-------------------------------------------------- |
| 1006 |
}; |
for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){ |
| 1007 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
|
| 1008 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
TrkTrack *ts = 0; |
| 1009 |
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (oi->dedx).At(ih); |
CaloTrkVar *cs = 0; |
| 1010 |
}; |
ToFTrkVar *os = 0; |
| 1011 |
// |
|
| 1012 |
if ( sen >= sortthr ){ |
// get tracker tracks |
| 1013 |
//printf(" IS A NUCLEUS! en = %f \n",sen); |
TrkTrack *tp = trk2_obj->TrkLevel2::GetTrack(i); //tracker |
| 1014 |
// |
CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo()); |
| 1015 |
// is a nucleus use a different algorithm |
ToFTrkVar *op = GetToFStoredTrack(tp->GetSeqNo()); |
| 1016 |
// |
|
| 1017 |
Int_t nz = 6; Float_t zin[6]; // << define TOF z-coordinates |
TrkTrack *ti = 0; //tracker (image) |
| 1018 |
for(Int_t ip=0; ip<nz; ip++) |
CaloTrkVar *ci = 0; |
| 1019 |
zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip)); // << read ToF plane z-coordinates |
ToFTrkVar *oi = 0; |
| 1020 |
Trajectory *tr = new Trajectory(nz,zin); |
// cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl; |
| 1021 |
// |
// if track has an image, check image selection |
| 1022 |
Int_t nphit_p =0; |
|
| 1023 |
Int_t nphit_i =0; |
Int_t tp_score = 0; //main track sorted by the tracker |
| 1024 |
Float_t enhit_p = 0.; |
Int_t ti_score = 0; //image track |
| 1025 |
Float_t enhit_i = 0.; |
Int_t totp_score = 0; //main track sorted by the tracker |
| 1026 |
// |
Int_t toti_score = 0; //image track |
| 1027 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
|
| 1028 |
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
if(tp->HasImage()){ |
| 1029 |
if(pl == 1 || pl == 2 || pl == 5){ |
|
| 1030 |
nphit_p++; |
ti = trk2_obj->TrkLevel2::GetTrackImage(i); //tracker (image) |
| 1031 |
enhit_p += (op->dedx).At(ih); |
ci = GetCaloStoredTrack(ti->GetSeqNo()); |
| 1032 |
}; |
oi = GetToFStoredTrack(ti->GetSeqNo()); |
| 1033 |
}; |
|
| 1034 |
// |
// cout << "its image "<<i << " "<<hex<< ti <<dec<< endl; |
| 1035 |
tp->DoTrack2(tr); |
|
| 1036 |
// |
//assign starting scores |
| 1037 |
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
tp_score = 0; //main track sorted by the tracker |
| 1038 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
ti_score = 0; //image track |
| 1039 |
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
|
| 1040 |
if(pl == 0){ |
// ----------------------------------------------------------------------------------------- |
| 1041 |
nphit_p++; |
// ***************************************************************************************** |
| 1042 |
enhit_p += (op->dedx).At(ih); |
// ----------------------------------------------------------------------------------------- |
| 1043 |
}; |
// calorimeter check |
| 1044 |
|
// ----------------------------------------------------------------------------------------- |
| 1045 |
|
if( use_CAL && !calo2_obj ){ |
| 1046 |
|
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but CaloLevel2 not loaded !!!"; |
| 1047 |
|
return; |
| 1048 |
}; |
}; |
| 1049 |
}; |
if( use_CAL && !cp && ci ){ |
| 1050 |
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
ti_score++; |
| 1051 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
toti_score++; |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
|
|
if(pl == 3){ |
|
|
nphit_p++; |
|
|
enhit_p += (op->dedx).At(ih); |
|
|
}; |
|
| 1052 |
}; |
}; |
| 1053 |
}; |
if( use_CAL && cp && !ci ){ |
| 1054 |
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
tp_score++; |
| 1055 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
totp_score++; |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
|
|
if(pl == 4){ |
|
|
nphit_p++; |
|
|
enhit_p += (op->dedx).At(ih); |
|
|
}; |
|
| 1056 |
}; |
}; |
| 1057 |
}; |
if( |
| 1058 |
|
use_CAL && |
| 1059 |
|
cp && ci && |
| 1060 |
|
true){ |
| 1061 |
|
|
| 1062 |
|
|
| 1063 |
|
if( |
| 1064 |
|
cp->npresh > ci->npresh && |
| 1065 |
|
true){ |
| 1066 |
|
tp_score++; |
| 1067 |
|
totp_score++; |
| 1068 |
|
}; |
| 1069 |
|
if( |
| 1070 |
|
cp->npresh < ci->npresh && |
| 1071 |
|
true){ |
| 1072 |
|
ti_score++; |
| 1073 |
|
toti_score++; |
| 1074 |
|
}; |
| 1075 |
|
|
| 1076 |
|
// cout << "CALO "<<tp_score<<ti_score<<endl; |
| 1077 |
|
|
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
|
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
|
|
if(pl == 1 || pl == 2 || pl == 5){ |
|
|
nphit_i++; |
|
|
enhit_i += (op->dedx).At(ih); |
|
| 1078 |
}; |
}; |
| 1079 |
}; |
// ----------------------------------------------------------------------------------------- |
| 1080 |
// |
// ***************************************************************************************** |
| 1081 |
ti->DoTrack2(tr); |
// ----------------------------------------------------------------------------------------- |
| 1082 |
// |
// TOF check |
| 1083 |
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
// ----------------------------------------------------------------------------------------- |
| 1084 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
// check the number of hit pmts along the track |
| 1085 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
// on S12 S21 and S32, where paddles are parallel to Y axis |
| 1086 |
if(pl == 0){ |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && !tof_obj ){ |
| 1087 |
nphit_i++; |
cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but ToFLevel2 not loaded !!!"; |
| 1088 |
enhit_i += (op->dedx).At(ih); |
return; |
|
}; |
|
| 1089 |
}; |
}; |
| 1090 |
}; |
// |
| 1091 |
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && !op && oi ){ |
| 1092 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
ti_score++; |
| 1093 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
toti_score++; |
|
if(pl == 3){ |
|
|
nphit_i++; |
|
|
enhit_i += (op->dedx).At(ih); |
|
|
}; |
|
| 1094 |
}; |
}; |
| 1095 |
}; |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && op && !oi ){ |
| 1096 |
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
tp_score++; |
| 1097 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
totp_score++; |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
|
|
if(pl == 4){ |
|
|
nphit_i++; |
|
|
enhit_i += (op->dedx).At(ih); |
|
|
}; |
|
| 1098 |
}; |
}; |
| 1099 |
}; |
if( (use_TOF || use_S1 || use_S2 || use_S3 ) && op && oi ){ |
| 1100 |
|
// |
| 1101 |
|
Float_t sen = 0.; |
| 1102 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
| 1103 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
| 1104 |
|
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (op->dedx).At(ih); |
| 1105 |
|
}; |
| 1106 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
| 1107 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
| 1108 |
|
if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (oi->dedx).At(ih); |
| 1109 |
|
}; |
| 1110 |
|
// |
| 1111 |
|
if ( sen >= sortthr && false){ // temporary disabled NUCLEI special algorithm since the new one should work for every particle (to be checked!) |
| 1112 |
|
//printf(" IS A NUCLEUS! en = %f \n",sen); |
| 1113 |
|
// |
| 1114 |
|
// is a nucleus use a different algorithm |
| 1115 |
|
// |
| 1116 |
|
Int_t nz = 6; Float_t zin[6]; // << define TOF z-coordinates |
| 1117 |
|
for(Int_t ip=0; ip<nz; ip++) |
| 1118 |
|
zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip)); // << read ToF plane z-coordinates |
| 1119 |
|
Trajectory *tr = new Trajectory(nz,zin); |
| 1120 |
|
// |
| 1121 |
|
Int_t nphit_p =0; |
| 1122 |
|
Int_t nphit_i =0; |
| 1123 |
|
Float_t enhit_p = 0.; |
| 1124 |
|
Float_t enhit_i = 0.; |
| 1125 |
|
// |
| 1126 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
| 1127 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
| 1128 |
|
if(pl == 1 || pl == 2 || pl == 5){ |
| 1129 |
|
nphit_p++; |
| 1130 |
|
enhit_p += (op->dedx).At(ih); |
| 1131 |
|
}; |
| 1132 |
|
}; |
| 1133 |
|
// |
| 1134 |
|
tp->DoTrack2(tr); |
| 1135 |
|
// |
| 1136 |
|
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
| 1137 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
| 1138 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
| 1139 |
|
if(pl == 0){ |
| 1140 |
|
nphit_p++; |
| 1141 |
|
enhit_p += (op->dedx).At(ih); |
| 1142 |
|
}; |
| 1143 |
|
}; |
| 1144 |
|
}; |
| 1145 |
|
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
| 1146 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
| 1147 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
| 1148 |
|
if(pl == 3){ |
| 1149 |
|
nphit_p++; |
| 1150 |
|
enhit_p += (op->dedx).At(ih); |
| 1151 |
|
}; |
| 1152 |
|
}; |
| 1153 |
|
}; |
| 1154 |
|
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
| 1155 |
|
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
| 1156 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
| 1157 |
|
if(pl == 4){ |
| 1158 |
|
nphit_p++; |
| 1159 |
|
enhit_p += (op->dedx).At(ih); |
| 1160 |
|
}; |
| 1161 |
|
}; |
| 1162 |
|
}; |
| 1163 |
|
|
| 1164 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
| 1165 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
| 1166 |
|
if(pl == 1 || pl == 2 || pl == 5){ |
| 1167 |
|
nphit_i++; |
| 1168 |
|
enhit_i += (op->dedx).At(ih); |
| 1169 |
|
}; |
| 1170 |
|
}; |
| 1171 |
|
// |
| 1172 |
|
ti->DoTrack2(tr); |
| 1173 |
|
// |
| 1174 |
|
if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){ |
| 1175 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
| 1176 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
| 1177 |
|
if(pl == 0){ |
| 1178 |
|
nphit_i++; |
| 1179 |
|
enhit_i += (op->dedx).At(ih); |
| 1180 |
|
}; |
| 1181 |
|
}; |
| 1182 |
|
}; |
| 1183 |
|
if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){ |
| 1184 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
| 1185 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
| 1186 |
|
if(pl == 3){ |
| 1187 |
|
nphit_i++; |
| 1188 |
|
enhit_i += (op->dedx).At(ih); |
| 1189 |
|
}; |
| 1190 |
|
}; |
| 1191 |
|
}; |
| 1192 |
|
if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){ |
| 1193 |
|
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
| 1194 |
|
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
| 1195 |
|
if(pl == 4){ |
| 1196 |
|
nphit_i++; |
| 1197 |
|
enhit_i += (op->dedx).At(ih); |
| 1198 |
|
}; |
| 1199 |
|
}; |
| 1200 |
|
}; |
| 1201 |
|
|
| 1202 |
|
|
| 1203 |
if( |
if( |
| 1204 |
use_TOF && |
(use_TOF || use_S1 || use_S2 || use_S3) && |
| 1205 |
(nphit_p+nphit_i) !=0 && |
(nphit_p+nphit_i) !=0 && |
| 1206 |
true){ |
true){ |
| 1207 |
|
|
| 1208 |
// printf(" seqno %i nphit_p %i nphit_i %i enhit_p %f enhit_i %f \n",trk2_obj->TrkLevel2::GetSeqNo(i),nphit_p,nphit_i,enhit_p,enhit_i); |
// printf(" seqno %i nphit_p %i nphit_i %i enhit_p %f enhit_i %f \n",trk2_obj->TrkLevel2::GetSeqNo(i),nphit_p,nphit_i,enhit_p,enhit_i); |
| 1209 |
// printf(" score p %i score i %i \n",tp_score,ti_score); |
// printf(" score p %i score i %i \n",tp_score,ti_score); |
| 1210 |
// if( enhit_p > enhit_i ) tp_score++; |
// if( enhit_p > enhit_i ) tp_score++; |
| 1211 |
// if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++; |
// if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++; |
| 1212 |
if ( nphit_p > nphit_i ) tp_score++; |
if ( nphit_p > nphit_i ) tp_score++; |
| 1213 |
if ( nphit_p < nphit_i ) ti_score++; |
if ( nphit_p < nphit_i ) ti_score++; |
| 1214 |
if ( nphit_p == nphit_i ){ |
if ( nphit_p == nphit_i ){ |
| 1215 |
if ( enhit_p > enhit_i ) tp_score++; |
if ( enhit_p > enhit_i ) tp_score++; |
| 1216 |
else ti_score++; |
else ti_score++; |
| 1217 |
}; |
}; |
| 1218 |
// printf(" dopo score p %i score i %i \n",tp_score,ti_score); |
// printf(" dopo score p %i score i %i \n",tp_score,ti_score); |
| 1219 |
}; |
}; |
| 1220 |
delete tr; |
delete tr; |
| 1221 |
// |
// |
| 1222 |
} else { |
} else { |
| 1223 |
// |
// ------------- |
| 1224 |
// NOT a NUCLEUS |
// NOT a NUCLEUS |
| 1225 |
// |
// ------------- |
| 1226 |
//printf(" NOT a NUCLEUS! en = %f \n",sen); |
//printf(" NOT a NUCLEUS! en = %f \n",sen); |
| 1227 |
|
|
| 1228 |
Int_t nphit_p =0; |
Int_t nphit_p =0; |
| 1229 |
Int_t nphit_i =0; |
Int_t nphit_i =0; |
| 1230 |
|
|
| 1231 |
|
|
| 1232 |
|
/* cout << "track: npmtadc "<< op->npmtadc << endl; |
| 1233 |
|
cout << "track: npmttdc "<< op->npmttdc << endl; |
| 1234 |
|
cout << "image: npmtadc "<< oi->npmtadc << endl; |
| 1235 |
|
cout << "image: npmttdc "<< oi->npmttdc << endl;*/ |
| 1236 |
|
|
| 1237 |
/* cout << "track: npmtadc "<< op->npmtadc << endl; |
// for (Int_t ih=0; ih < op->npmtadc; ih++){ |
| 1238 |
cout << "track: npmttdc "<< op->npmttdc << endl; |
// Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
| 1239 |
cout << "image: npmtadc "<< oi->npmtadc << endl; |
// if(pl == 1 || pl == 2 || pl == 5)nphit_p++; |
| 1240 |
cout << "image: npmttdc "<< oi->npmttdc << endl;*/ |
// }; |
| 1241 |
|
|
| 1242 |
for (Int_t ih=0; ih < op->npmtadc; ih++){ |
// for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
| 1243 |
Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) ); |
// Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
| 1244 |
if(pl == 1 || pl == 2 || pl == 5)nphit_p++; |
// if(pl == 1 || pl == 2 || pl == 5)nphit_i++; |
| 1245 |
}; |
// }; |
| 1246 |
|
// --- modified to count tdc signals (more efficient?) |
| 1247 |
|
// --- and to implement check on tdcflag |
| 1248 |
|
for (Int_t ih=0; ih < op->npmttdc; ih++){ |
| 1249 |
|
Int_t pl = tof_obj->GetPlaneIndex( (op->pmttdc).At(ih) ); |
| 1250 |
|
// if( (op->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_p++; |
| 1251 |
|
if ( (use_S1 && ( pl == 0 || pl == 1 )) || (use_S2 && ( pl == 2 || pl == 3 )) || (use_S3 && ( pl == 4 || pl == 5 )) ){ |
| 1252 |
|
if( (op->tdcflag).At(ih)==0 )nphit_p++; |
| 1253 |
|
}; |
| 1254 |
|
}; |
| 1255 |
|
|
| 1256 |
for (Int_t ih=0; ih < oi->npmtadc; ih++){ |
for (Int_t ih=0; ih < oi->npmttdc; ih++){ |
| 1257 |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) ); |
Int_t pl = tof_obj->GetPlaneIndex( (oi->pmttdc).At(ih) ); |
| 1258 |
if(pl == 1 || pl == 2 || pl == 5)nphit_i++; |
// if( (oi->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_i++; |
| 1259 |
}; |
if ( (use_S1 && ( pl == 0 || pl == 1 )) || (use_S2 && ( pl == 2 || pl == 3 )) || (use_S3 && ( pl == 4 || pl == 5 )) ){ |
| 1260 |
|
if( (oi->tdcflag).At(ih)==0 )nphit_i++; |
| 1261 |
|
}; |
| 1262 |
|
}; |
| 1263 |
|
|
| 1264 |
if( |
if( |
| 1265 |
use_TOF && |
(nphit_p+nphit_i) !=0 && |
| 1266 |
(nphit_p+nphit_i) !=0 && |
true){ |
|
true){ |
|
| 1267 |
|
|
| 1268 |
if( nphit_p >= nphit_i) tp_score++; |
if ( nphit_p != nphit_i ){ |
| 1269 |
else ti_score++; |
totp_score += nphit_p; |
| 1270 |
}; |
toti_score += nphit_i; |
| 1271 |
}; |
tp_score+=nphit_p; |
| 1272 |
// cout << "TOF "<<tp_score<<ti_score<<endl; |
ti_score+=nphit_i; |
| 1273 |
}; |
}; |
| 1274 |
if(tp_score == ti_score) use_TRK = true; |
// if ( nphit_p > nphit_i) tp_score+=nphit_p; |
| 1275 |
// ------------------------ |
// else if( nphit_p < nphit_i) ti_score+=nphit_i; |
| 1276 |
// tracker check |
// else ;//niente |
| 1277 |
// ------------------------ |
}; |
| 1278 |
// chi**2 difference is not always large enough to distinguish among |
}; |
| 1279 |
// the real track and its image. |
// cout << "TOF "<<tp_score<<ti_score<<endl; |
| 1280 |
// Tracker check will be applied always when calorimeter and tof information is ambiguous. |
}; |
| 1281 |
if(use_TRK){ |
|
| 1282 |
if( tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ; |
|
| 1283 |
else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ; |
// if(tp_score == ti_score) use_TRK = true; |
| 1284 |
// cout << "TRK "<<tp_score<<ti_score<<endl; |
|
| 1285 |
}; |
|
| 1286 |
|
// ----------------------------------------------------------------------------------------- |
| 1287 |
|
// ***************************************************************************************** |
| 1288 |
|
// ----------------------------------------------------------------------------------------- |
| 1289 |
|
// tracker check |
| 1290 |
|
// ----------------------------------------------------------------------------------------- |
| 1291 |
|
// chi**2 difference is not always large enough to distinguish among |
| 1292 |
|
// the real track and its image. |
| 1293 |
|
// Tracker check will be applied always when calorimeter and tof information is ambiguous. |
| 1294 |
|
// *** MODIFIED ON AUGUST 2007 *** |
| 1295 |
|
if(use_TRK){ |
| 1296 |
|
// if( tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ; |
| 1297 |
|
// else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ; |
| 1298 |
|
|
| 1299 |
|
// CHECK 1 : number of points along X |
| 1300 |
|
if ( tp->GetNX() >= ti->GetNX() ){ |
| 1301 |
|
tp_score++ ; |
| 1302 |
|
totp_score++ ; |
| 1303 |
|
}; |
| 1304 |
|
if ( tp->GetNX() <= ti->GetNX() ){ |
| 1305 |
|
ti_score++ ; |
| 1306 |
|
toti_score++ ; |
| 1307 |
|
}; |
| 1308 |
|
// CHECK 2 : number of points along Y |
| 1309 |
|
if ( tp->GetNY() >= ti->GetNY() ){ |
| 1310 |
|
tp_score++ ; |
| 1311 |
|
totp_score++ ; |
| 1312 |
|
}; |
| 1313 |
|
if ( tp->GetNY() <= ti->GetNY() ){ |
| 1314 |
|
ti_score++ ; |
| 1315 |
|
toti_score++ ; |
| 1316 |
|
}; |
| 1317 |
|
|
| 1318 |
|
// cout << "TRK "<<tp_score<<ti_score<<endl; |
| 1319 |
|
}; |
| 1320 |
|
|
| 1321 |
|
|
| 1322 |
|
// ----------------------------------------------------------------------------------------- |
| 1323 |
|
// ***************************************************************************************** |
| 1324 |
|
// ----------------------------------------------------------------------------------------- |
| 1325 |
|
// GPamela check |
| 1326 |
|
// ----------------------------------------------------------------------------------------- |
| 1327 |
|
|
| 1328 |
// ------------------------ |
//--------------------------------------------------- |
| 1329 |
// the winner is.... |
// count the number of GP hits |
| 1330 |
// ------------------------ |
//--------------------------------------------------- |
| 1331 |
if (tp_score > ti_score) { |
if(use_GP){ |
| 1332 |
// ts = tp;//the track sorted by the tracker!! |
int ngphits_p=0; |
| 1333 |
// cs = cp; |
int ngphits_i=0; |
| 1334 |
// os = op; |
float toll = 0.02; //200 micron |
| 1335 |
// cout << "It's primary!" << endl; |
for(int ih=0; ih<GetGPamela()->Nthspe; ih++){ |
| 1336 |
|
int ip = (Int_t) GetGPamela()->Itrpb[ih] - 1; |
| 1337 |
}else if (tp_score < ti_score) { |
if( |
| 1338 |
|
tp && |
| 1339 |
// cout << "It's image!" << endl; |
tp->YGood(ip) && |
| 1340 |
|
fabs(tp->ym[ip]- GetGPamela()->Yavspe[ih])<toll && |
| 1341 |
ts = ti;//its image!! |
true) ngphits_p++; |
| 1342 |
cs = ci; |
if( ti && |
| 1343 |
os = oi; |
ti->YGood(ip) && |
| 1344 |
|
fabs(ti->ym[ip]- GetGPamela()->Yavspe[ih])<toll && |
| 1345 |
ti = tp;//its image!! |
true) ngphits_i++; |
| 1346 |
ci = cp; |
} |
| 1347 |
oi = op; |
if( |
| 1348 |
|
ngphits_p > ngphits_i && |
| 1349 |
tp = ts;//its image!! |
true){ |
| 1350 |
cp = cs; |
tp_score++ ; |
| 1351 |
op = os; |
totp_score++ ; |
| 1352 |
|
} |
| 1353 |
|
if( |
| 1354 |
|
ngphits_p < ngphits_i && |
| 1355 |
|
true){ |
| 1356 |
|
ti_score++ ; |
| 1357 |
|
toti_score++ ; |
| 1358 |
|
} |
| 1359 |
|
} |
| 1360 |
|
|
| 1361 |
|
|
| 1362 |
|
// *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* |
| 1363 |
|
// the winner is.... |
| 1364 |
|
// *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* |
| 1365 |
|
if (tp_score > ti_score) { |
| 1366 |
|
|
| 1367 |
|
|
| 1368 |
|
}else if (tp_score < ti_score) { |
| 1369 |
|
|
| 1370 |
|
|
| 1371 |
|
ts = ti;//its image!! |
| 1372 |
|
cs = ci; |
| 1373 |
|
os = oi; |
| 1374 |
|
Int_t totis = toti_score; |
| 1375 |
|
|
| 1376 |
|
ti = tp;//its image!! |
| 1377 |
|
ci = cp; |
| 1378 |
|
oi = op; |
| 1379 |
|
|
| 1380 |
|
tp = ts;//its image!! |
| 1381 |
|
cp = cs; |
| 1382 |
|
op = os; |
| 1383 |
|
|
| 1384 |
|
toti_score = totp_score; |
| 1385 |
|
totp_score = totis; |
| 1386 |
|
|
| 1387 |
|
|
| 1388 |
}else { |
}else { |
| 1389 |
// ts = tp; |
|
|
// cs = cp; |
|
|
// os = op; |
|
| 1390 |
// cout << "Warning - track image ambiguity not solved" << endl; |
// cout << "Warning - track image ambiguity not solved" << endl; |
| 1391 |
// cout << ts->GetNtot() << " "<< ts->chi2 << " " << npcfit[1] << " "<< nphit_p << endl; |
|
| 1392 |
}; |
}; |
| 1393 |
|
|
| 1394 |
}else{ |
}else{ |
| 1395 |
// ts = tp; |
totp_score = 1; |
| 1396 |
// cs = cp; |
toti_score = 0; |
| 1397 |
// os = op; |
|
| 1398 |
}; |
// ts = tp; |
| 1399 |
|
// cs = cp; |
| 1400 |
// cout <<" SortTracks() "<<i<<" -- "<<ts<<endl; |
// os = op; |
| 1401 |
// sorted_tracks->Add(ts);//save the track in the sorted array |
}; |
| 1402 |
// sorted_tracks.Add(ts);//save the track in the sorted array |
|
| 1403 |
// sorted_tracks.Add(tp);//save the track in the sorted array |
// cout <<" SortTracks() "<<i<<" -- "<<ts<<endl; |
| 1404 |
// cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl; |
// sorted_tracks->Add(ts);//save the track in the sorted array |
| 1405 |
// cout<<"o "<<tp<<endl; |
// sorted_tracks.Add(ts);//save the track in the sorted array |
| 1406 |
// cout<<"o "<<cp<<endl; |
// sorted_tracks.Add(tp);//save the track in the sorted array |
| 1407 |
// cout<<"o "<<op<<endl; |
// cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl; |
| 1408 |
new(ttsorted[i]) PamTrack(tp,cp,op); |
// cout<<"o "<<tp<<endl; |
| 1409 |
new(ttimage[i]) PamTrack(ti,ci,oi); |
// cout<<"o "<<cp<<endl; |
| 1410 |
}; |
// cout<<"o "<<op<<endl; |
| 1411 |
|
|
| 1412 |
if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){ |
new(ttsorted[i]) PamTrack(tp,cp,op); |
| 1413 |
cout << "void PamLevel2::SortTracks(): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl; |
new(ttimage[i]) PamTrack(ti,ci,oi); |
| 1414 |
tsorted->Delete(); tsorted=0; |
|
| 1415 |
timage->Delete(); timage=0; |
((PamTrack*)(ttsorted[i]))->SetPScore(totp_score); |
| 1416 |
} |
((PamTrack*)(ttsorted[i]))->SetIScore(toti_score); |
| 1417 |
|
((PamTrack*)(ttimage[i]))->SetPScore(totp_score); |
| 1418 |
//Restore Object count |
((PamTrack*)(ttimage[i]))->SetIScore(toti_score); |
| 1419 |
//To save space in the table keeping track of all referenced objects |
}; |
| 1420 |
//We reset the object count to what it was at the beginning of the event. |
|
| 1421 |
TProcessID::SetObjectCount(ObjectNumber); |
if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){ |
| 1422 |
|
cout << "void PamLevel2::SortTracks(): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl; |
| 1423 |
|
tsorted->Delete(); tsorted=0; |
| 1424 |
|
timage->Delete(); timage=0; |
| 1425 |
|
} |
| 1426 |
|
|
| 1427 |
|
//Restore Object count |
| 1428 |
|
//To save space in the table keeping track of all referenced objects |
| 1429 |
|
//We reset the object count to what it was at the beginning of the event. |
| 1430 |
|
TProcessID::SetObjectCount(ObjectNumber); |
| 1431 |
|
|
| 1432 |
}; |
}; |
| 1433 |
//-------------------------------------- |
//-------------------------------------- |
| 1456 |
|
|
| 1457 |
return tsorted; |
return tsorted; |
| 1458 |
|
|
| 1459 |
}; |
}; |
| 1460 |
//-------------------------------------- |
//-------------------------------------- |
| 1461 |
// |
// |
| 1462 |
// |
// |
| 1463 |
//-------------------------------------- |
//-------------------------------------- |
| 1464 |
/** |
/** |
| 1465 |
* Retrieves the it-th Pamela "physical" track. |
* Retrieves the it-th Pamela "physical" track. |
| 1581 |
*/ |
*/ |
| 1582 |
TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ){ |
TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ){ |
| 1583 |
|
|
| 1584 |
// if( !detlist.IsNull() ) SetWhichTrees(detlist); |
if( detlist.Contains("+AUTO", TString::kIgnoreCase) ) { |
| 1585 |
// else GetWhichTrees(f); |
cout << "+AUTO"<<endl; |
| 1586 |
if ( pam_tree ){ |
GetWhichTrees(f); |
| 1587 |
printf("WARNING: TTree *PamLevel2::GetPamTree(TFile *fl, TString detlist) -- pam_tree already exists!\n "); |
}; |
| 1588 |
return pam_tree; |
SetWhichTrees(detlist); |
| 1589 |
}; |
|
| 1590 |
// |
if ( pam_tree ){ |
| 1591 |
|
printf("WARNING: TTree *PamLevel2::GetPamTree(TFile *fl, TString detlist) -- pam_tree already exists!\n "); |
| 1592 |
|
return pam_tree; |
| 1593 |
|
}; |
| 1594 |
|
// |
| 1595 |
|
|
| 1596 |
cout << "TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ) -- obsolte "<<endl; |
cout << "TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ) -- obsolte "<<endl; |
| 1597 |
|
|
| 1598 |
SetWhichTrees(detlist); |
// SetWhichTrees(detlist); |
| 1599 |
|
|
| 1600 |
TTree *Trout =0; |
TTree *Trout =0; |
| 1601 |
|
|
| 1616 |
if(ND)cout<<"ND "; |
if(ND)cout<<"ND "; |
| 1617 |
if(S4)cout<<"S4 "; |
if(S4)cout<<"S4 "; |
| 1618 |
if(ORB)cout<<"ORB "; |
if(ORB)cout<<"ORB "; |
| 1619 |
|
if(GP)cout<<"GP "; |
| 1620 |
cout << endl; |
cout << endl; |
| 1621 |
if(SELLI)cout<<">>> Found selection-list <<<"<<endl; |
if(SELLI)cout<<">>> Found selection-list <<<"<<endl; |
| 1622 |
|
|
| 1715 |
cout << "OrbitalInfo : missing tree"<<endl; |
cout << "OrbitalInfo : missing tree"<<endl; |
| 1716 |
}; |
}; |
| 1717 |
|
|
| 1718 |
|
// GPamela |
| 1719 |
|
TTree *G = (TTree*)f->Get("h20"); |
| 1720 |
|
if(G && GP) { |
| 1721 |
|
if(!gp_obj)gp_obj=new GPamela(); |
| 1722 |
|
// ------------------------------------ |
| 1723 |
|
// ATTENZIONE!!! |
| 1724 |
|
// non so per quale arcano motivo, |
| 1725 |
|
// per l'albero di gpamela il branch address lo devo settare |
| 1726 |
|
// DOPO aver fatto friend |
| 1727 |
|
// FGRRRVZZZZUTSALKJMSLKJ!!! |
| 1728 |
|
// ------------------------------------ |
| 1729 |
|
// gp_obj->SetBranchAddress(G); //ho dovuto fare in maniera diversa dagli altri |
| 1730 |
|
// cout << "h20 : set branch address GPamela "<<endl; |
| 1731 |
|
if(!Trout)Trout=G; |
| 1732 |
|
else Trout->AddFriend(G); |
| 1733 |
|
}else{ |
| 1734 |
|
// cout << "h20 : missing tree"<<endl; |
| 1735 |
|
}; |
| 1736 |
|
|
| 1737 |
|
|
| 1738 |
TTree *L = (TTree*)f->Get("SelectionList"); |
TTree *L = (TTree*)f->Get("SelectionList"); |
| 1739 |
if(L && SELLI==1) { |
if(L && SELLI==1) { |
| 1740 |
// L->SetBranchAddress("RunEntry",&irun); |
cout << " TTree *PamLevel2::GetPamTree(TFile, TString) >>> SelectionList not implemented!!!!"<<endl; |
|
// cout << "SelectionList: set branch address RunEntry"<<endl; |
|
|
// L->SetBranchAddress("EventEntry",&irunentry); |
|
|
// cout << "SelectionList: set branch address EventEntry"<<endl; |
|
|
// if(!Trout)Trout=O; |
|
|
// else Trout->AddFriend("SelectionList"); |
|
|
cout << " TTree *PamLevel2::GetPamTree(TFile, TString) >>> SelectionList not implemente!!!!"<<endl; |
|
| 1741 |
sel_tree = 0; |
sel_tree = 0; |
| 1742 |
}else{ |
}else{ |
| 1743 |
cout << "SelectionList : missing tree"<<endl; |
cout << "SelectionList : missing tree"<<endl; |
| 1745 |
|
|
| 1746 |
cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
| 1747 |
|
|
| 1748 |
|
// ------------------------------------ |
| 1749 |
|
// ATTENZIONE!!! |
| 1750 |
|
// non so per quale arcano motivo, |
| 1751 |
|
// per l'albero di gpamela il branch address lo devo settare |
| 1752 |
|
// DOPO aver fatto friend |
| 1753 |
|
// FGRRRVZZZZUTSALKJMSLKJ!!! |
| 1754 |
|
// ------------------------------------ |
| 1755 |
|
if(G && GP) { |
| 1756 |
|
gp_obj->SetBranchAddress(Trout); //ho dovuto fare in maniera diversa dagli altri |
| 1757 |
|
cout << "h20 : set branch address GPamela "<<endl; |
| 1758 |
|
}else{ |
| 1759 |
|
cout << "h20 : missing tree"<<endl; |
| 1760 |
|
}; |
| 1761 |
|
|
| 1762 |
pam_tree = (TChain*)Trout; |
pam_tree = (TChain*)Trout; |
| 1763 |
|
|
| 1764 |
return Trout; |
return Trout; |
| 1782 |
// if(ddir=="")ddir = wdir; |
// if(ddir=="")ddir = wdir; |
| 1783 |
// TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
// TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
| 1784 |
if ( ddir != ""){ |
if ( ddir != ""){ |
| 1785 |
cout << "Level2 data directory : "<< ddir << endl; |
cout << "Level2 data directory : "<< ddir << endl; |
| 1786 |
} else { |
} else { |
| 1787 |
cout << "Level2 data directory not given as input: trying to evaluate from list or taking working directory " << endl; |
cout << "Level2 data directory not given as input: trying to evaluate from list or taking working directory " << endl; |
| 1788 |
}; |
}; |
| 1789 |
TList *contents = new TList; // create output list |
TList *contents = new TList; // create output list |
| 1790 |
contents->SetOwner(); |
contents->SetOwner(); |
| 1801 |
// return 0; |
// return 0; |
| 1802 |
// } |
// } |
| 1803 |
// flisttxt = fullpath; |
// flisttxt = fullpath; |
| 1804 |
if ( !flisttxt.EndsWith(".root") ){ |
if ( !flisttxt.EndsWith(".root") ){ |
| 1805 |
|
|
| 1806 |
flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
| 1807 |
|
|
| 1808 |
if( !gSystem->ChangeDirectory(ddir) ){ |
if( !gSystem->ChangeDirectory(ddir) ){ |
| 1809 |
cout << "Cannot change directory : "<<ddir<<endl; |
cout << "Cannot change directory : "<<ddir<<endl; |
| 1810 |
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; |
|
| 1811 |
} |
} |
| 1812 |
if(file.Contains("#"))file = file(0,file.First("#")); |
|
| 1813 |
|
cout <<"Input file list : " << flisttxt <<endl; |
| 1814 |
|
ifstream in; |
| 1815 |
|
in.open(flisttxt, ios::in); //open input file list |
| 1816 |
|
if(!in.good()){ |
| 1817 |
|
cout <<" ERROR opening the file "<<endl; |
| 1818 |
|
gSystem->ChangeDirectory(wdir); // back to the working directory |
| 1819 |
|
return 0; |
| 1820 |
|
} |
| 1821 |
|
int line=0; |
| 1822 |
|
while (1) { |
| 1823 |
|
TString file; |
| 1824 |
|
in >> file; |
| 1825 |
|
if (!in.good()) break; |
| 1826 |
|
line++; |
| 1827 |
|
// cout <<"(1) " << file << endl; |
| 1828 |
|
if(file.IsNull()){ |
| 1829 |
|
cout << "-- list interrupted at line "<<line <<endl; |
| 1830 |
|
break; |
| 1831 |
|
} |
| 1832 |
|
if(file.Contains("#"))file = file(0,file.First("#")); |
| 1833 |
// cout <<"(2) " << file << endl; |
// cout <<"(2) " << file << endl; |
| 1834 |
// if( gSystem->IsFileInIncludePath(file,&fullpath) ){ |
// if( gSystem->IsFileInIncludePath(file,&fullpath) ){ |
| 1835 |
// if( (fullpath = gSystem->FindFile(ddir,file)) ){ |
// if( (fullpath = gSystem->FindFile(ddir,file)) ){ |
| 1836 |
if( file.EndsWith(".root") ){ |
if( file.EndsWith(".root") ){ |
| 1837 |
TString filedir; |
TString filedir; |
| 1838 |
if (ddir != ""){ |
if (ddir != ""){ |
| 1839 |
filedir = ddir; // take the input dir |
filedir = ddir; // take the input dir |
| 1840 |
} else { |
} else { |
| 1841 |
gSystem->ChangeDirectory(wdir); // back to the working directory |
gSystem->ChangeDirectory(wdir); // back to the working directory |
| 1842 |
filedir = gSystem->DirName(file); // this will take the path if exist in the list otherwise it will return automatically the working dir |
filedir = gSystem->DirName(file); // this will take the path if exist in the list otherwise it will return automatically the working dir |
| 1843 |
}; |
}; |
| 1844 |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(filedir),gSystem->BaseName(file)); |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(filedir),gSystem->BaseName(file)); |
| 1845 |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
| 1846 |
delete fullpath; |
delete fullpath; |
| 1847 |
} |
} |
| 1848 |
// }else{ |
// }else{ |
| 1849 |
// if(file.Data()!="")cout << "File: "<<file<<" ---> missing "<< endl; |
// if(file.Data()!="")cout << "File: "<<file<<" ---> missing "<< endl; |
| 1850 |
// }; |
// }; |
| 1851 |
}; |
}; |
| 1852 |
in.close(); |
in.close(); |
| 1853 |
} else { |
} else { |
| 1854 |
if(flisttxt.Contains("#"))flisttxt = flisttxt(0,flisttxt.First("#")); |
if(flisttxt.Contains("#"))flisttxt = flisttxt(0,flisttxt.First("#")); |
| 1855 |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
| 1856 |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
contents->Add(new TSystemFile(fullpath,gSystem->DirName(fullpath)));// add file to the list |
| 1857 |
delete fullpath; |
delete fullpath; |
| 1858 |
}; |
}; |
| 1859 |
}else{ |
}else{ |
| 1860 |
|
|
| 1861 |
cout << "No input file list given."<<endl; |
cout << "No input file list given."<<endl; |
| 1862 |
cout << "Check for existing root files."<<endl; |
cout << "Check for existing root files."<<endl; |
| 1863 |
// cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl; |
// cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl; |
| 1864 |
if ( ddir == "" ){ |
if ( ddir == "" ){ |
| 1865 |
ddir = wdir; |
ddir = wdir; |
| 1866 |
cout << "Level2 data directory : "<< ddir << endl; |
cout << "Level2 data directory : "<< ddir << endl; |
| 1867 |
}; |
}; |
| 1868 |
|
|
| 1869 |
TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir); |
| 1909 |
* @return Pointer to a TChain |
* @return Pointer to a TChain |
| 1910 |
*/ |
*/ |
| 1911 |
TChain *PamLevel2::GetPamTree(TList *fl, TString detlist ){ |
TChain *PamLevel2::GetPamTree(TList *fl, TString detlist ){ |
| 1912 |
// |
// |
| 1913 |
// |
// |
| 1914 |
// |
// |
| 1915 |
if ( pam_tree ){ |
if ( pam_tree ){ |
| 1916 |
printf("WARNING: TChain *PamLevel2::GetPamTree(TList *fl, TString detlist) -- pam_tree already exists!\n "); |
printf("WARNING: TChain *PamLevel2::GetPamTree(TList *fl, TString detlist) -- pam_tree already exists!\n "); |
| 1917 |
return pam_tree; |
return pam_tree; |
| 1918 |
}; |
}; |
| 1919 |
// |
// |
| 1920 |
|
|
| 1921 |
TChain *Trout =0; |
TChain *Trout =0; |
| 1922 |
|
|
| 1923 |
// if( !detlist.IsNull() )SetWhichTrees(detlist); |
// ------------------------------------------- |
| 1924 |
SetWhichTrees(detlist); |
// set flags to include/exclude trees/branches |
| 1925 |
|
// ------------------------------------------- |
| 1926 |
cout<< "GetPamTree(TList*,TString): input detector list --> "; |
if( detlist.Contains("+AUTO", TString::kIgnoreCase) ) { |
| 1927 |
if(TRK1)cout<<"TRK1 "; |
if( fl->GetEntries()>0 ){ |
| 1928 |
if(TRK2)cout<<"TRK2 "; |
cout << "+AUTO"<<endl; |
| 1929 |
if(TRKh)cout<<"TRKH "; |
TFile *fprimo = new TFile( fl->At(0)->GetName() ); |
| 1930 |
if(CAL1)cout<<"CAL1 "; |
GetWhichTrees(fprimo); |
| 1931 |
if(CAL2)cout<<"CAL2 "; |
fprimo->Close();// AAAAARGGGGGHHHHH!!!!!!! non commentare questa riga, altrimenti si incasina il TChain |
| 1932 |
if(TOF)cout<<"TOF "; |
fprimo->Delete(); |
| 1933 |
if(TRG)cout<<"TRG "; |
} |
| 1934 |
if(AC)cout<<"AC "; |
}; |
| 1935 |
if(ND)cout<<"ND "; |
SetWhichTrees(detlist); |
| 1936 |
if(S4)cout<<"S4 "; |
|
| 1937 |
if(ORB)cout<<"ORB "; |
|
| 1938 |
cout << endl; |
// ------------------------------------------- |
| 1939 |
|
// build chains |
| 1940 |
TChain *T = 0; |
// ------------------------------------------- |
| 1941 |
TChain *C = 0; |
TChain *T = 0; |
| 1942 |
TChain *O = 0; |
TChain *C = 0; |
| 1943 |
TChain *R = 0; |
TChain *O = 0; |
| 1944 |
TChain *S = 0; |
TChain *R = 0; |
| 1945 |
TChain *N = 0; |
TChain *S = 0; |
| 1946 |
TChain *A = 0; |
TChain *N = 0; |
| 1947 |
TChain *B = 0; |
TChain *A = 0; |
| 1948 |
|
TChain *B = 0; |
| 1949 |
|
TChain *G = 0; |
| 1950 |
|
|
| 1951 |
TChain *L = 0; |
TChain *L = 0; |
| 1952 |
|
|
| 1953 |
if(TRK2||TRK1||TRKh) T = new TChain("Tracker"); |
if(TRK2||TRK1||TRKh) T = new TChain("Tracker"); |
| 1954 |
if(CAL2||CAL1) C = new TChain("Calorimeter"); |
if(CAL2||CAL1) C = new TChain("Calorimeter"); |
| 1958 |
if(ND) N = new TChain("NeutronD"); |
if(ND) N = new TChain("NeutronD"); |
| 1959 |
if(AC) A = new TChain("Anticounter"); |
if(AC) A = new TChain("Anticounter"); |
| 1960 |
if(ORB) B = new TChain("OrbitalInfo"); |
if(ORB) B = new TChain("OrbitalInfo"); |
| 1961 |
L = new TChain("SelectionList"); |
if(GP) G = new TChain("h20"); |
| 1962 |
|
L = new TChain("SelectionList"); |
| 1963 |
|
|
| 1964 |
// loop over files and create chains |
// loop over files and create chains |
| 1965 |
TIter next(fl); |
TIter next(fl); |
| 1976 |
if(ND) N->Add(name); |
if(ND) N->Add(name); |
| 1977 |
if(AC) A->Add(name); |
if(AC) A->Add(name); |
| 1978 |
if(ORB) B->Add(name); |
if(ORB) B->Add(name); |
| 1979 |
|
if(GP) G->Add(name); |
| 1980 |
if(SELLI==1) L->Add(name); |
if(SELLI==1) L->Add(name); |
| 1981 |
}; |
}; |
| 1982 |
}; |
}; |
| 1983 |
|
|
| 1984 |
cout << "done chain \n"; |
cout << "done chains\n"; |
| 1985 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
| 1986 |
|
|
| 1987 |
// UInt_t *found=0; |
|
| 1988 |
|
// ------------------------------------------- |
| 1989 |
|
// make friends |
| 1990 |
|
// ------------------------------------------- |
| 1991 |
|
|
| 1992 |
// Tracker |
// Tracker |
| 1993 |
|
cout << "Friends: "<<endl; |
| 1994 |
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; |
|
| 1995 |
if(!Trout)Trout=T; |
if(!Trout)Trout=T; |
| 1996 |
else Trout->AddFriend("Tracker"); |
else Trout->AddFriend("Tracker"); |
| 1997 |
}else{ |
// cout << "+Tacker"<<endl; |
|
cout << "Tracker : missing tree"<<endl; |
|
| 1998 |
}; |
}; |
| 1999 |
// Calorimeter |
// Calorimeter |
| 2000 |
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; |
|
| 2001 |
if(!Trout)Trout=C; |
if(!Trout)Trout=C; |
| 2002 |
else Trout->AddFriend("Calorimeter"); |
else Trout->AddFriend("Calorimeter"); |
| 2003 |
}else{ |
// cout << "+Calorimeter"<<endl; |
|
cout << "Calorimeter : missing tree"<<endl; |
|
| 2004 |
}; |
}; |
| 2005 |
// ToF |
// ToF |
| 2006 |
if(O && TOF) { |
if(O && TOF) { |
|
O->SetBranchAddress("ToFLevel2", GetPointerTo("ToFLevel2")); |
|
|
cout << "ToF : set branch address ToFLevel2"<<endl; |
|
| 2007 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
| 2008 |
else Trout->AddFriend("ToF"); |
else Trout->AddFriend("ToF"); |
| 2009 |
}else{ |
// cout << "+ToF"<<endl; |
|
cout << "ToF : missing tree"<<endl; |
|
| 2010 |
}; |
}; |
| 2011 |
// Trigger |
// Trigger |
| 2012 |
if(R && TRG) { |
if(R && TRG) { |
|
R->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2")); |
|
|
cout << "Trigger : set branch address TrigLevel2"<<endl; |
|
| 2013 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
| 2014 |
else Trout->AddFriend("Trigger"); |
else Trout->AddFriend("Trigger"); |
| 2015 |
}else{ |
// cout << "+Trigger"<<endl; |
|
cout << "Trigger : missing tree"<<endl; |
|
| 2016 |
}; |
}; |
| 2017 |
// S4 |
// S4 |
| 2018 |
if(S && S4) { |
if(S && S4) { |
|
S->SetBranchAddress("S4Level2", GetPointerTo("S4Level2")); |
|
|
cout << "S4 : set branch address S4Level2"<<endl; |
|
| 2019 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
| 2020 |
else Trout->AddFriend("S4"); |
else Trout->AddFriend("S4"); |
| 2021 |
}else{ |
// cout << "+S4"<<endl; |
|
cout << "S4 : missing tree"<<endl; |
|
| 2022 |
}; |
}; |
| 2023 |
// Neutron Detector |
// Neutron Detector |
| 2024 |
if(N && ND) { |
if(N && ND) { |
|
N->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2")); |
|
|
cout << "NeutronD : set branch address NDLevel2"<<endl; |
|
| 2025 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
| 2026 |
else Trout->AddFriend("NeutronD"); |
else Trout->AddFriend("NeutronD"); |
| 2027 |
}else{ |
// cout << "+NeutronD"<<endl; |
|
cout << "NeutronD : missing tree"<<endl; |
|
| 2028 |
}; |
}; |
| 2029 |
// Anticounters |
// Anticounters |
| 2030 |
if(A && AC) { |
if(A && AC) { |
|
A->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2")); |
|
|
cout << "Anticounter : set branch address AcLevel2"<<endl; |
|
| 2031 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
| 2032 |
else Trout->AddFriend("Anticounter"); |
else Trout->AddFriend("Anticounter"); |
| 2033 |
}else{ |
// cout << "+Anticounter"<<endl; |
|
cout << "Anticounter : missing tree"<<endl; |
|
| 2034 |
}; |
}; |
| 2035 |
// Orbital Info |
// Orbital Info |
| 2036 |
if(B && ORB) { |
if(B && ORB) { |
|
B->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
|
|
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
|
| 2037 |
if(!Trout)Trout=O; |
if(!Trout)Trout=O; |
| 2038 |
else Trout->AddFriend("OrbitalInfo"); |
else Trout->AddFriend("OrbitalInfo"); |
| 2039 |
}else{ |
// cout << "+OrbitalInfo"<<endl; |
| 2040 |
cout << "OrbitalInfo : missing tree"<<endl; |
}; |
| 2041 |
|
// GPamela |
| 2042 |
|
if(G && GP) { |
| 2043 |
|
if(!Trout)Trout=G; |
| 2044 |
|
else Trout->AddFriend("h20"); |
| 2045 |
|
// cout << "+h20"<<endl; |
| 2046 |
}; |
}; |
| 2047 |
|
|
| 2048 |
|
// ===================================== |
| 2049 |
|
// SET BRANCH-ADDRESS AFTER CHAIN+FRIEND |
| 2050 |
|
// ===================================== |
| 2051 |
|
SetBranchAddress(Trout); |
| 2052 |
|
|
| 2053 |
|
|
| 2054 |
|
// ------------------------------------ |
| 2055 |
|
// finally handle selection trees... |
| 2056 |
|
// (it is not friend of pamela tree) |
| 2057 |
|
// ------------------------------------ |
| 2058 |
|
|
| 2059 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
| 2060 |
|
|
| 2061 |
// Selection List |
// Selection List |
| 2062 |
if(L && SELLI==1) { |
if(L && SELLI==1) { |
| 2063 |
cout<<">>> Found selection-list <<<"<<endl; |
cout<<">>> Found selection-list <<<"<<endl; |
| 2064 |
L->SetBranchAddress("RunEntry",&irun); |
// L->SetBranchAddress("RunEntry",&irun); |
| 2065 |
|
L->SetBranchAddress("RunEntry",&irunt);//NEWNEW |
| 2066 |
cout << "SelectionList: set branch address RunEntry"<<endl; |
cout << "SelectionList: set branch address RunEntry"<<endl; |
| 2067 |
L->SetBranchAddress("EventEntry",&irunentry); |
L->SetBranchAddress("EventEntry",&irunentry); |
| 2068 |
cout << "SelectionList: set branch address EventEntry"<<endl; |
cout << "SelectionList: set branch address EventEntry"<<endl; |
| 2069 |
sel_tree = L; |
sel_tree = L; |
| 2070 |
// if(!Trout)Trout=O; |
// if(!Trout)Trout=O; |
| 2071 |
// else Trout->AddFriend("SelectionList"); |
// else Trout->AddFriend("SelectionList"); |
| 2072 |
cout << "----------------------------------------------------" <<endl; |
cout << "+SelectionList"<<endl; |
| 2073 |
|
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
| 2074 |
}else{ |
}else{ |
| 2075 |
// cout << "SelectionList : missing tree"<<endl; |
// cout << "SelectionList : missing tree"<<endl; |
| 2076 |
if(L)L->Delete(); |
if(L)L->Delete(); |
| 2077 |
}; |
}; |
|
|
|
|
// cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
|
| 2078 |
|
|
| 2079 |
pam_tree = Trout; |
// -------------------------------------------- |
| 2080 |
|
// return the pamela chain with all the friends |
| 2081 |
|
// -------------------------------------------- |
| 2082 |
|
|
| 2083 |
|
pam_tree = Trout; |
| 2084 |
|
|
| 2085 |
return Trout; |
return Trout; |
| 2086 |
} |
} |
| 2087 |
|
|
| 2107 |
ND = ND & t->GetBranchStatus("NDLevel2"); |
ND = ND & t->GetBranchStatus("NDLevel2"); |
| 2108 |
AC = AC & t->GetBranchStatus("AcLevel2"); |
AC = AC & t->GetBranchStatus("AcLevel2"); |
| 2109 |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
| 2110 |
|
GP = GP & t->GetBranchStatus("h20"); |
| 2111 |
|
|
| 2112 |
|
|
| 2113 |
// Tracker |
// Tracker |
| 2164 |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
| 2165 |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
| 2166 |
}; |
}; |
| 2167 |
// SelectionList |
// GPamela |
| 2168 |
if(SELLI==1) { |
if(GP) { |
| 2169 |
t->SetBranchAddress("RunEntry", &irun); |
// GetPointerTo("GPamela"); |
| 2170 |
cout << "SelectionList: set branch address RunEntry"<<endl; |
if(!gp_obj)gp_obj = new GPamela(); |
| 2171 |
t->SetBranchAddress("EventEntry", &irunentry); |
gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
| 2172 |
cout << "SelectionList: set branch address EventEntry"<<endl; |
cout << "h20 : set branch address GPamela "<<endl; |
| 2173 |
}; |
}; |
| 2174 |
|
|
| 2175 |
} |
} |
| 2178 |
*/ |
*/ |
| 2179 |
void PamLevel2::SetBranchAddress(TChain *t){ |
void PamLevel2::SetBranchAddress(TChain *t){ |
| 2180 |
|
|
| 2181 |
TRK2 = TRK2 & t->GetBranchStatus("TrkLevel2"); |
// TRK2 = TRK2 & t->GetBranchStatus("TrkLevel2"); |
| 2182 |
TRK1 = TRK1 & t->GetBranchStatus("TrkLevel1"); |
// TRK1 = TRK1 & t->GetBranchStatus("TrkLevel1"); |
| 2183 |
TRKh = TRKh & t->GetBranchStatus("TrkHough"); |
// TRKh = TRKh & t->GetBranchStatus("TrkHough"); |
| 2184 |
CAL1 = CAL1 & t->GetBranchStatus("CaloLevel1"); |
// CAL1 = CAL1 & t->GetBranchStatus("CaloLevel1"); |
| 2185 |
CAL2 = CAL2 & t->GetBranchStatus("CaloLevel2"); |
// CAL2 = CAL2 & t->GetBranchStatus("CaloLevel2"); |
| 2186 |
TOF = TOF & t->GetBranchStatus("ToFLevel2"); |
// TOF = TOF & t->GetBranchStatus("ToFLevel2"); |
| 2187 |
TRG = TRG & t->GetBranchStatus("TrigLevel2"); |
// TRG = TRG & t->GetBranchStatus("TrigLevel2"); |
| 2188 |
S4 = S4 & t->GetBranchStatus("S4Level2"); |
// S4 = S4 & t->GetBranchStatus("S4Level2"); |
| 2189 |
ND = ND & t->GetBranchStatus("NDLevel2"); |
// ND = ND & t->GetBranchStatus("NDLevel2"); |
| 2190 |
AC = AC & t->GetBranchStatus("AcLevel2"); |
// AC = AC & t->GetBranchStatus("AcLevel2"); |
| 2191 |
ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
// ORB = ORB & t->GetBranchStatus("OrbitalInfo"); |
| 2192 |
|
// GP = GP & t->GetBranchStatus("h20"); |
| 2193 |
|
|
| 2194 |
// Tracker |
// Tracker |
| 2195 |
if(TRK2) { |
if(TRK2) { |
| 2196 |
t->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
t->SetBranchAddress("TrkLevel2", GetPointerTo("TrkLevel2")); |
| 2197 |
cout << "Tracker : set branch address TrkLevel2"<<endl; |
cout << "Tracker : set branch address TrkLevel2"<<endl; |
| 2198 |
}; |
}; |
| 2200 |
t->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
t->SetBranchAddress("TrkLevel1", GetPointerTo("TrkLevel1")); |
| 2201 |
cout << "Tracker : set branch address TrkLevel1"<<endl; |
cout << "Tracker : set branch address TrkLevel1"<<endl; |
| 2202 |
}; |
}; |
| 2203 |
if(TRKh) { |
if(TRKh) { |
| 2204 |
t->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
t->SetBranchAddress("TrkHough", GetPointerTo("TrkHough")); |
| 2205 |
cout << "Tracker : set branch address TrkHough"<<endl; |
cout << "Tracker : set branch address TrkHough"<<endl; |
| 2206 |
}; |
}; |
| 2207 |
|
|
| 2208 |
// Calorimeter |
// Calorimeter |
| 2209 |
if(CAL2) { |
if(CAL2) { |
| 2245 |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
t->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo")); |
| 2246 |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
cout << "OrbitalInfo : set branch address OrbitalInfo"<<endl; |
| 2247 |
}; |
}; |
| 2248 |
// SelectionList |
// GPamela |
| 2249 |
if(SELLI==1) { |
// cout <<"GP "<<GP<<endl; |
| 2250 |
t->SetBranchAddress("RunEntry", &irun); |
if(GP) { |
| 2251 |
cout << "SelectionList: set branch address RunEntry"<<endl; |
// GetPointerTo("GPamela"); |
| 2252 |
t->SetBranchAddress("EventEntry", &irunentry); |
if(!gp_obj)gp_obj = new GPamela(); |
| 2253 |
cout << "SelectionList: set branch address EventEntry"<<endl; |
gp_obj->SetBranchAddress(t); //ho dovuto fare in maniera diversa dagli altri |
| 2254 |
|
cout << "h20 : set branch address GPamela "<<endl; |
| 2255 |
}; |
}; |
| 2256 |
|
// SelectionList |
| 2257 |
|
// if(SELLI==1){ |
| 2258 |
|
// t->SetBranchAddress("RunEntry",&irunt);//NEWNEW |
| 2259 |
|
// cout << "SelectionList: set branch address RunEntry"<<endl; |
| 2260 |
|
// t->SetBranchAddress("EventEntry",&irunentry); |
| 2261 |
|
// cout << "SelectionList: set branch address EventEntry"<<endl; |
| 2262 |
|
|
| 2263 |
|
// } |
| 2264 |
|
|
| 2265 |
} |
} |
| 2266 |
|
|
| 2267 |
|
|
| 2275 |
* @return Pointer to a TChain |
* @return Pointer to a TChain |
| 2276 |
*/ |
*/ |
| 2277 |
TChain *PamLevel2::GetRunTree(TList *fl){ |
TChain *PamLevel2::GetRunTree(TList *fl){ |
| 2278 |
// |
// |
| 2279 |
// |
// |
| 2280 |
// |
// |
| 2281 |
if ( run_tree ){ |
if ( run_tree ){ |
| 2282 |
printf("WARNING: TChain *PamLevel2::GetRunTree(TList *fl) -- run_tree already exists!\n "); |
printf("WARNING: TChain *PamLevel2::GetRunTree(TList *fl) -- run_tree already exists!\n "); |
| 2283 |
return run_tree; |
return run_tree; |
| 2284 |
}; |
}; |
| 2285 |
// |
// |
| 2286 |
TChain *R = new TChain("Run"); |
TChain *R = new TChain("Run"); |
| 2287 |
|
|
| 2288 |
// loop over files and create chains |
// loop over files and create chains |
| 2289 |
TIter next(fl); |
TIter next(fl); |
| 2302 |
cout << "Run : set branch address RunInfo"<<endl; |
cout << "Run : set branch address RunInfo"<<endl; |
| 2303 |
R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
| 2304 |
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
| 2305 |
|
|
| 2306 |
|
irunoffset = new int[R->GetNtrees()]; |
| 2307 |
|
cout << "----------------------------------------------------"<<endl; |
| 2308 |
|
cout << "irun\t | "; |
| 2309 |
|
cout << "tree\t |"; |
| 2310 |
|
// cout << "offset\t |"; |
| 2311 |
|
cout << "RUN\t"; |
| 2312 |
|
cout << "FRAG\t"; |
| 2313 |
|
cout << "NEVENTS\t"; |
| 2314 |
|
cout << "absolute time\t\t\t"; |
| 2315 |
|
cout << "on-board time"; |
| 2316 |
|
cout<<endl; |
| 2317 |
|
for (Int_t ii=0; ii<R->GetEntries(); ii++){ |
| 2318 |
|
R->GetEntry(ii); |
| 2319 |
|
cout << ii<< "\t | "; |
| 2320 |
|
cout << R->GetTreeNumber()<< "\t |"; |
| 2321 |
|
// cout << R->GetChainOffset()<< "\t |"; |
| 2322 |
|
cout <<GetRunInfo()->ID<<"\t"; |
| 2323 |
|
cout <<GetRunInfo()->ID_RUN_FRAG<<"\t"; |
| 2324 |
|
cout <<GetRunInfo()->NEVENTS<< "\t"; |
| 2325 |
|
cout <<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME <<"\t"; |
| 2326 |
|
cout <<GetRunInfo()->RUNHEADER_OBT<<" <---> "<<GetRunInfo()->RUNTRAILER_OBT<<"\t"; |
| 2327 |
|
cout <<endl; |
| 2328 |
|
irunoffset[R->GetTreeNumber()]=R->GetChainOffset(); |
| 2329 |
|
} |
| 2330 |
|
cout << "----------------------------------------------------"<<endl; |
| 2331 |
|
|
| 2332 |
|
|
| 2333 |
|
|
| 2334 |
}else{ |
}else{ |
| 2335 |
delete R; |
delete R; |
| 2336 |
R=0; |
R=0; |
| 2351 |
* @return Pointer to a TTree |
* @return Pointer to a TTree |
| 2352 |
*/ |
*/ |
| 2353 |
TTree *PamLevel2::GetRunTree(TFile *f){ |
TTree *PamLevel2::GetRunTree(TFile *f){ |
| 2354 |
if ( run_tree ){ |
if ( run_tree ){ |
| 2355 |
printf("WARNING: TTree *PamLevel2::GetRunTree(TFile *f) -- run_tree already exists!\n "); |
printf("WARNING: TTree *PamLevel2::GetRunTree(TFile *f) -- run_tree already exists!\n "); |
| 2356 |
return run_tree; |
return run_tree; |
| 2357 |
}; |
}; |
| 2358 |
|
|
| 2359 |
|
|
| 2360 |
cout << "TTree *PamLevel2::GetRunTree(TFile *f) -- obsolte "<<endl; |
cout << "TTree *PamLevel2::GetRunTree(TFile *f) -- obsolte "<<endl; |
| 2366 |
cout << "Run : set branch address RunInfo"<<endl; |
cout << "Run : set branch address RunInfo"<<endl; |
| 2367 |
T->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
T->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano |
| 2368 |
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
cout << "Software : set branch address SoftInfo"<<endl; // Emiliano |
| 2369 |
|
|
| 2370 |
} |
} |
| 2371 |
|
|
| 2372 |
run_tree = (TChain*)T; |
run_tree = (TChain*)T; |
| 2380 |
* @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 |
| 2381 |
*/ |
*/ |
| 2382 |
Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev){ |
Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev){ |
| 2383 |
// |
// |
| 2384 |
// check if we have already called once GetEntry, if not call it |
// check if we have already called once GetEntry, if not call it |
| 2385 |
// |
// |
| 2386 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- NON FUNZIONA BENISSIMO.... "<<endl; |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- ATTENZIONE --- NON E` MANTENUTA!!!!!!!.... "<<endl; |
| 2387 |
if(!run){ |
if(!run){ |
| 2388 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree "<<endl; |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree "<<endl; |
| 2389 |
return(false); |
return(false); |
| 2390 |
} |
} |
| 2391 |
if ( run->GetEntries() <= 0 ) return(false); |
if ( run->GetEntries() <= 0 ) return(false); |
| 2392 |
// |
// |
| 2393 |
|
|
| 2394 |
// Int_t oldrun = irun; |
// Int_t oldrun = irun; |
| 2395 |
Long64_t oldrun = irun; |
Long64_t oldrun = irun; |
| 2396 |
|
|
| 2397 |
// -------------------------------------- |
// -------------------------------------- |
| 2398 |
// if it is a full file (not preselected) |
// if it is a full file (not preselected) |
| 2399 |
// -------------------------------------- |
// -------------------------------------- |
| 2400 |
if(SELLI==0){ |
if(SELLI==0){ |
| 2401 |
|
|
| 2402 |
// |
// |
| 2403 |
// the absolute time is necessary to relate the event with the run |
// the absolute time is necessary to relate the event with the run |
| 2404 |
// |
// |
| 2405 |
if( !GetOrbitalInfo() ){ |
if( !GetOrbitalInfo() && !ISGP){ |
| 2406 |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
| 2407 |
return(false); |
return(false); |
| 2408 |
} |
} |
| 2409 |
|
|
| 2410 |
// |
ULong64_t abstime = 0; |
| 2411 |
// the first time the routine is called, set run search from the beginning |
if( GetOrbitalInfo() )abstime=GetOrbitalInfo()->absTime; |
| 2412 |
// |
|
| 2413 |
if ( irun < 0LL ){ |
|
| 2414 |
irun = 0LL; |
// |
| 2415 |
run->GetEntry(irun); |
// the first time the routine is called, set run search from the beginning |
| 2416 |
runfirstentry = 0LL; |
// |
| 2417 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
if ( irun < 0LL ){ |
| 2418 |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
irun = 0LL; |
| 2419 |
}; |
run->GetEntry(irun); |
| 2420 |
// |
runfirstentry = 0LL; |
| 2421 |
if ( irun == run->GetEntries()-1LL && |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
| 2422 |
!(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
| 2423 |
GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) |
|
| 2424 |
|
if( ISGP && run->GetEntries()!=1 ){ |
| 2425 |
|
cout << "** WARNING ** simulated files are assumed to have 1 single run, not "<< run->GetEntries() << endl; |
| 2426 |
|
cout << "** WARNING ** run will not be updated"<<endl; |
| 2427 |
|
} |
| 2428 |
|
|
| 2429 |
|
}; |
| 2430 |
|
// |
| 2431 |
|
if(ISGP)abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO |
| 2432 |
|
// |
| 2433 |
|
if ( irun == run->GetEntries()-1LL && |
| 2434 |
|
!(abstime >= GetRunInfo()->RUNHEADER_TIME && |
| 2435 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
| 2436 |
){ |
){ |
| 2437 |
irun = -1LL; |
irun = -1LL; |
| 2438 |
runfirstentry = 0LL; |
irunt = -1LL; |
| 2439 |
runlastentry = -1LL; |
runfirstentry = 0LL; |
| 2440 |
}; |
runlastentry = -1LL; |
| 2441 |
// modificato il controllo sull'aggiornamento del run, per evitare problemi |
}; |
| 2442 |
// dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!) |
// modificato il controllo sull'aggiornamento del run, per evitare problemi |
| 2443 |
// |
// dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!) |
| 2444 |
bool fromfirst = true; |
// |
| 2445 |
// |
bool fromfirst = true; |
| 2446 |
while ( !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries()-1LL ){ |
// |
| 2447 |
|
while ( !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries()-1LL ){ |
| 2448 |
// while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
// while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
| 2449 |
irun++; |
irun++; |
| 2450 |
run->GetEntry(irun); |
run->GetEntry(irun); |
| 2451 |
runfirstentry = runlastentry; |
runfirstentry = runlastentry; |
| 2452 |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runfirstentry += 1LL; |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runfirstentry += 1LL; |
| 2453 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
| 2454 |
// cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
// cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
| 2455 |
// cout << "runfirstentry "<<runfirstentry<<endl; |
// cout << "runfirstentry "<<runfirstentry<<endl; |
| 2456 |
// printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS))); |
// printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS))); |
| 2457 |
// printf(" abstime %u trailertime %u \n",GetOrbitalInfo()->absTime,GetRunInfo()->RUNTRAILER_TIME); |
// printf(" abstime %u trailertime %u \n",abstime,GetRunInfo()->RUNTRAILER_TIME); |
| 2458 |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
| 2459 |
// |
// |
| 2460 |
// prevshift = 0; |
// prevshift = 0; |
| 2461 |
// |
// |
| 2462 |
if ( irun == (Long64_t)(run->GetEntries()-1LL) && fromfirst && !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME)){ |
if ( irun == (Long64_t)(run->GetEntries()-1LL) && fromfirst && !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME)){ |
| 2463 |
printf(" resetting irun (it should NOT happen!!!)\n"); |
printf(" resetting irun (it should NOT happen!!!)\n"); |
| 2464 |
fromfirst = false; |
fromfirst = false; |
| 2465 |
irun = 0; |
irun = 0; |
| 2466 |
run->GetEntry(irun); |
run->GetEntry(irun); |
| 2467 |
runfirstentry = 0ULL; |
runfirstentry = 0ULL; |
| 2468 |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS); |
| 2469 |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL; |
| 2470 |
}; |
}; |
| 2471 |
// |
// |
| 2472 |
}; |
}; |
| 2473 |
// |
// |
| 2474 |
if ( |
if ( |
| 2475 |
!(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && |
!(abstime >= GetRunInfo()->RUNHEADER_TIME && |
| 2476 |
GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) |
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
| 2477 |
) { |
) { |
| 2478 |
printf(" Something very wrong here: cannot find RUN containing absolute time %u \n",GetOrbitalInfo()->absTime); |
printf(" Something very wrong here: cannot find RUN containing absolute time %llu \n",abstime); |
| 2479 |
return false; |
return false; |
| 2480 |
} |
} |
| 2481 |
// |
// |
| 2482 |
if ( irun == oldrun || irun >= run->GetEntries() ) return(false); |
if ( irun == oldrun || irun >= run->GetEntries() ) return(false); |
| 2483 |
// |
// |
| 2484 |
// printf(" iev %llu irun %i nevents %u 1st %llu last %llu \n",iev,irun,this->GetRunInfo()->NEVENTS,(ULong64_t)runfirstentry,(ULong64_t)runlastentry); |
// printf(" iev %llu irun %i nevents %u 1st %llu last %llu \n",iev,irun,this->GetRunInfo()->NEVENTS,(ULong64_t)runfirstentry,(ULong64_t)runlastentry); |
| 2485 |
// |
// |
| 2486 |
prevshift = 0; |
prevshift = 0; |
| 2487 |
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
| 2488 |
// cout << "runfirstentry "<<runfirstentry<<endl; |
// cout << "runfirstentry "<<runfirstentry<<endl; |
| 2489 |
return(true); |
return(true); |
| 2490 |
}; |
}; |
| 2491 |
// ---------------------------------------------------- |
// ---------------------------------------------------- |
| 2492 |
// if it is a preselected file (there is SelectionList) |
// if it is a preselected file (there is SelectionList) |
| 2493 |
// NBNB - the event tree MUST be read first |
// NBNB - the event tree MUST be read first |
| 2494 |
// ---------------------------------------------------- |
// ---------------------------------------------------- |
| 2495 |
if(SELLI==1){ |
if(SELLI==1){ |
| 2496 |
sel_tree->GetEntry(iev); |
sel_tree->GetEntry(iev); |
| 2497 |
// cout << irun << " "<< irunentry << endl; |
// cout << irun << " "<< irunentry << endl; |
| 2498 |
if(irun != oldrun){ |
if(irun != oldrun){ |
| 2499 |
run->GetEntry(irun); |
run->GetEntry(irun); |
| 2500 |
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
cout << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
| 2501 |
prevshift = 0; |
prevshift = 0; |
| 2502 |
return true; |
return true; |
| 2503 |
} |
} |
| 2504 |
return false; |
return false; |
| 2505 |
} |
} |
| 2506 |
|
|
| 2507 |
return false; |
return false; |
| 2508 |
// |
// |
| 2509 |
}; |
}; |
| 2510 |
|
|
| 2511 |
Bool_t PamLevel2::UpdateRunInfo(Long64_t iev){ |
Bool_t PamLevel2::UpdateRunInfo(Long64_t iev){ |
| 2521 |
|
|
| 2522 |
Int_t oldrun = irun; // store current run index |
Int_t oldrun = irun; // store current run index |
| 2523 |
|
|
| 2524 |
|
// ----------------------------------------------------------------------- |
| 2525 |
|
// the first time the routine is called, set run search from the beginning |
| 2526 |
|
// ----------------------------------------------------------------------- |
| 2527 |
|
|
| 2528 |
|
if ( irun < 0 ){ |
| 2529 |
|
irun = 0LL; |
| 2530 |
|
irunt = 0LL; |
| 2531 |
|
irunentry = 0; |
| 2532 |
|
prevshift = 0; |
| 2533 |
|
run_tree->GetEntry(irun); |
| 2534 |
|
if( !GetOrbitalInfo() )cout << "** WARNING ** missing OrbitalInfo ---> run info might be not correctly updated "<<endl; |
| 2535 |
|
}; |
| 2536 |
|
// --------------------------------------------------------------- |
| 2537 |
|
// retrieve OBT and absolute time of the event |
| 2538 |
|
// --------------------------------------------------------------- |
| 2539 |
|
ULong64_t abstime = 0LL; |
| 2540 |
|
ULong64_t obt = 0LL; |
| 2541 |
|
if( GetOrbitalInfo() ){ |
| 2542 |
|
abstime = GetOrbitalInfo()->absTime; |
| 2543 |
|
obt = GetOrbitalInfo()->OBT; |
| 2544 |
|
// cout << " ABS >>> "<<abstime<<" OBT >>> "<<obt<<" "<<endl; |
| 2545 |
|
}else{ |
| 2546 |
|
abstime = GetRunInfo()->RUNHEADER_TIME; |
| 2547 |
|
obt = GetRunInfo()->RUNHEADER_OBT; |
| 2548 |
|
} |
| 2549 |
|
// cout << ISGP << " "<<abstime<<endl; |
| 2550 |
|
// --------------------------------------------------------------- |
| 2551 |
|
// the absolute time is necessary to relate the event with the run |
| 2552 |
|
// --------------------------------------------------------------- |
| 2553 |
|
// if( !GetOrbitalInfo() && !ISGP ){ |
| 2554 |
|
// cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
| 2555 |
|
// return(false); |
| 2556 |
|
// } |
| 2557 |
|
// ----------------------------------------------------------------------- |
| 2558 |
|
// if it is simulation, assign abstime by hand (temporaneo!!!) |
| 2559 |
|
// ----------------------------------------------------------------------- |
| 2560 |
|
// if(ISGP){ |
| 2561 |
|
// abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO |
| 2562 |
|
// obt = GetRunInfo()->RUNHEADER_OBT; // BARBATRUCCO |
| 2563 |
|
// } |
| 2564 |
|
|
| 2565 |
|
|
| 2566 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
| 2567 |
// if it is a full file (not preselected) |
// if it is a full file (not preselected) |
| 2568 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
| 2569 |
if(SELLI==0){ |
if(SELLI==0){ |
| 2570 |
|
|
| 2571 |
// --------------------------------------------------------------- |
// --------------------------------------------------------------- |
| 2572 |
// the absolute time is necessary to relate the event with the run |
// increment dead and live-time counters |
| 2573 |
|
// (only when reading a file not preselected) |
| 2574 |
// --------------------------------------------------------------- |
// --------------------------------------------------------------- |
| 2575 |
if( !GetOrbitalInfo() ){ |
if(SELLI==0){ |
| 2576 |
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
if( GetTrigLevel2() ){ |
| 2577 |
return(false); |
totdltime[0]+=GetTrigLevel2()->dltime[0]; |
| 2578 |
|
totdltime[1]+=GetTrigLevel2()->dltime[1]; |
| 2579 |
|
} |
| 2580 |
|
totdltime[2]++; |
| 2581 |
} |
} |
| 2582 |
|
// cout << setw(10)<<totdltime[0]<<setw(10)<<totdltime[1]<<setw(10)<<totdltime[2]<<endl; |
| 2583 |
|
|
| 2584 |
|
// // --------------------------------------------------------------- |
| 2585 |
|
// // retrieve OBT and absolute time of the event |
| 2586 |
|
// // --------------------------------------------------------------- |
| 2587 |
|
// ULong64_t abstime = 0; |
| 2588 |
|
// ULong64_t obt = 0; |
| 2589 |
|
// if( GetOrbitalInfo() ){ |
| 2590 |
|
// abstime = GetOrbitalInfo()->absTime; |
| 2591 |
|
// obt = GetOrbitalInfo()->OBT; |
| 2592 |
|
// } |
| 2593 |
|
// // --------------------------------------------------------------- |
| 2594 |
|
// // the absolute time is necessary to relate the event with the run |
| 2595 |
|
// // --------------------------------------------------------------- |
| 2596 |
|
// if( !GetOrbitalInfo() && !ISGP ){ |
| 2597 |
|
// cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl; |
| 2598 |
|
// return(false); |
| 2599 |
|
// } |
| 2600 |
|
|
| 2601 |
// ----------------------------------------------------------------------- |
// // ----------------------------------------------------------------------- |
| 2602 |
// the first time the routine is called, set run search from the beginning |
// // the first time the routine is called, set run search from the beginning |
| 2603 |
// ----------------------------------------------------------------------- |
// // ----------------------------------------------------------------------- |
| 2604 |
if ( irun < 0 ){ |
// if ( irun < 0 ){ |
| 2605 |
irun = 0LL; |
// irun = 0LL; |
| 2606 |
irunentry = 0; |
// irunt = 0LL; |
| 2607 |
prevshift = 0; |
// irunentry = 0; |
| 2608 |
run_tree->GetEntry(irun); |
// prevshift = 0; |
| 2609 |
}; |
// run_tree->GetEntry(irun); |
| 2610 |
|
|
| 2611 |
|
// if( ISGP && run_tree->GetEntries()!=1 ){ |
| 2612 |
|
// cout << "** WARNING ** simulated files are assumed to have 1 single run, not "<< run_tree->GetEntries() << endl; |
| 2613 |
|
// cout << "** WARNING ** run will not be updated"<<endl; |
| 2614 |
|
// } |
| 2615 |
|
// }; |
| 2616 |
|
|
| 2617 |
|
// // ----------------------------------------------------------------------- |
| 2618 |
|
// // if it is simulation, assign abstime by hand (temporaneo!!!) |
| 2619 |
|
// // ----------------------------------------------------------------------- |
| 2620 |
|
// if(ISGP){ |
| 2621 |
|
// abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO |
| 2622 |
|
// obt = GetRunInfo()->RUNHEADER_OBT; // BARBATRUCCO |
| 2623 |
|
// } |
| 2624 |
// |
// |
| 2625 |
bool fromfirst = true; // first loop over runs |
bool fromfirst = true; // first loop over runs |
| 2626 |
|
|
| 2634 |
while ( |
while ( |
| 2635 |
( |
( |
| 2636 |
( |
( |
| 2637 |
!(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
!(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
| 2638 |
GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) && |
abstime <= GetRunInfo()->RUNTRAILER_TIME) && |
| 2639 |
!(GetOrbitalInfo()->OBT >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
!(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
| 2640 |
GetOrbitalInfo()->OBT <= GetRunInfo()->RUNTRAILER_OBT) |
obt <= GetRunInfo()->RUNTRAILER_OBT) |
| 2641 |
) |
) |
| 2642 |
|| GetRunInfo()->NEVENTS==0 |
|| GetRunInfo()->NEVENTS==0 |
| 2643 |
|| !(irunentry < GetRunInfo()->NEVENTS-1-prevshift) |
// || !(irunentry < GetRunInfo()->NEVENTS-1-prevshift) // ERRORE!!! fa saltare i run con 1 evento |
| 2644 |
|
|| !(irunentry <= GetRunInfo()->NEVENTS-1-prevshift) |
| 2645 |
) |
) |
| 2646 |
&& irun < run_tree->GetEntries() ){ |
&& irun < run_tree->GetEntries() ){ |
| 2647 |
|
|
| 2648 |
irun++; |
// - - - - - - - - - - - - - |
| 2649 |
|
// irunentry = position of current entry, relative to the run |
| 2650 |
|
// prevshift = shift needed to synchronize l0 and l2 data (nested events) |
| 2651 |
|
// - - - - - - - - - - - - - |
| 2652 |
|
|
| 2653 |
|
// ----------------------------------------- |
| 2654 |
|
// store dead and live-time of previous run |
| 2655 |
|
// ----------------------------------------- |
| 2656 |
|
// if(SELLI==0){ |
| 2657 |
|
if(fromfirst){ |
| 2658 |
|
if(oldrun==irun){ |
| 2659 |
|
/// decrement counters |
| 2660 |
|
if( GetTrigLevel2()){ |
| 2661 |
|
totdltime[0]-=GetTrigLevel2()->dltime[0];//live-time |
| 2662 |
|
totdltime[1]-=GetTrigLevel2()->dltime[1];//dead-time |
| 2663 |
|
} |
| 2664 |
|
totdltime[2]--; //event counter |
| 2665 |
|
cout << endl; |
| 2666 |
|
cout << "n.events : "<<totdltime[2]<<endl; |
| 2667 |
|
cout << "RUN LIVE-TIME: "<<totdltime[0]*0.16<<" ms"<<endl; |
| 2668 |
|
cout << "RUN DEAD-TIME: "<<totdltime[1]*0.01<<" ms"<<endl; |
| 2669 |
|
}else{ |
| 2670 |
|
totdltime[0]=0;//live-time |
| 2671 |
|
totdltime[1]=0;//dead-time |
| 2672 |
|
totdltime[2]=0; //event counter |
| 2673 |
|
cout << " *** JUMP RUN *** irun "<<irun<<endl; |
| 2674 |
|
} |
| 2675 |
|
/// add an entry |
| 2676 |
|
if(run_tree_clone) |
| 2677 |
|
if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries()) |
| 2678 |
|
run_tree_clone->GetBranch("DeadLiveTime")->Fill(); |
| 2679 |
|
/// reset counters |
| 2680 |
|
if( GetTrigLevel2() ){ |
| 2681 |
|
totdltime[0]=GetTrigLevel2()->dltime[0];//live-time |
| 2682 |
|
totdltime[1]=0; //dead-time |
| 2683 |
|
} |
| 2684 |
|
totdltime[2]=1; //event counter |
| 2685 |
|
} |
| 2686 |
|
// } |
| 2687 |
|
|
| 2688 |
|
irun++; |
| 2689 |
// ------------------------------------ |
// ------------------------------------ |
| 2690 |
// if the end of run tree is reached... |
// if the end of run tree is reached... |
| 2691 |
// ------------------------------------ |
// ------------------------------------ |
| 2712 |
// ------------------------------------------------------------------- |
// ------------------------------------------------------------------- |
| 2713 |
if(irun>0)runfirstentry += (GetRunInfo()->NEVENTS)-prevshift; |
if(irun>0)runfirstentry += (GetRunInfo()->NEVENTS)-prevshift; |
| 2714 |
irunentry = 0; |
irunentry = 0; |
| 2715 |
prevshift = 0; |
prevshift = 0; |
| 2716 |
run_tree->GetEntry(irun); |
run_tree->GetEntry(irun); |
| 2717 |
|
irunt = irun - irunoffset[run_tree->GetTreeNumber()]; |
| 2718 |
if(GetRunInfo()->RUNHEADER_OBT>GetRunInfo()->RUNTRAILER_OBT ){ |
if(GetRunInfo()->RUNHEADER_OBT>GetRunInfo()->RUNTRAILER_OBT ){ |
| 2719 |
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun "<<irun<<" has RUNHEADER_OBT>=RUNTRAILER_OBT " <<endl; |
cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun "<<irun<<" has RUNHEADER_OBT>=RUNTRAILER_OBT " <<endl; |
| 2720 |
cout << " (NB!! in this case some events are assigned to a wrong run)"<<endl; |
cout << " (NB!! in this case some events are assigned to a wrong run)"<<endl; |
| 2733 |
|
|
| 2734 |
// -------------------------------------- |
// -------------------------------------- |
| 2735 |
// ... otherwise |
// ... otherwise |
| 2736 |
|
// -------------------------------------- |
| 2737 |
|
|
| 2738 |
|
|
| 2739 |
|
|
| 2740 |
|
|
| 2741 |
|
// -------------------------------------- |
| 2742 |
// ---> exit with TRUE |
// ---> exit with TRUE |
| 2743 |
// -------------------------------------- |
// -------------------------------------- |
| 2744 |
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
| 2753 |
true ){ |
true ){ |
| 2754 |
cout << "* fragment *"<<endl; |
cout << "* fragment *"<<endl; |
| 2755 |
} |
} |
| 2756 |
|
|
| 2757 |
return(true); |
return(true); |
| 2758 |
}; |
}; |
| 2759 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
| 2760 |
// if it is a preselected file (there is SelectionList) |
// if it is a preselected file (there is SelectionList) |
| 2761 |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- |
| 2762 |
|
// irun = run entry relative to the chain |
| 2763 |
|
// irunt = run entry relative to the tree |
| 2764 |
if(SELLI==1){ |
if(SELLI==1){ |
| 2765 |
sel_tree->GetEntry(iev); |
sel_tree->GetEntry(iev);// read irunt from SelectionList |
| 2766 |
|
irun = irunt + irunoffset[sel_tree->GetTreeNumber()];//NEWNEW |
| 2767 |
if(irun != oldrun){ |
if(irun != oldrun){ |
| 2768 |
run_tree->GetEntry(irun); |
run_tree->GetEntry(irun); |
| 2769 |
|
// check if the time is ok (with merged files it is not...) |
| 2770 |
|
// if not loop over run and look for the proper entry |
| 2771 |
|
bool SECONDO_GIRO=false; |
| 2772 |
|
Long64_t irun_start = irun; |
| 2773 |
|
int offset_start = irunoffset[sel_tree->GetTreeNumber()]; |
| 2774 |
|
while ( |
| 2775 |
|
( |
| 2776 |
|
( |
| 2777 |
|
!(abstime >= GetRunInfo()->RUNHEADER_TIME && // check on absolute time (s) |
| 2778 |
|
abstime <= GetRunInfo()->RUNTRAILER_TIME) |
| 2779 |
|
|| |
| 2780 |
|
!(obt >= GetRunInfo()->RUNHEADER_OBT && // additional check on OBT (ms) |
| 2781 |
|
obt <= GetRunInfo()->RUNTRAILER_OBT) |
| 2782 |
|
) |
| 2783 |
|
|| GetRunInfo()->NEVENTS==0 |
| 2784 |
|
) |
| 2785 |
|
// && irun < run_tree->GetEntries() |
| 2786 |
|
){ |
| 2787 |
|
cout << " (test) "; |
| 2788 |
|
cout << " tree "<<sel_tree->GetTreeNumber(); |
| 2789 |
|
cout << " irunt "<<irunt; |
| 2790 |
|
cout << " offset "<<irunoffset[sel_tree->GetTreeNumber()]; |
| 2791 |
|
cout << " abs "<<abstime; |
| 2792 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_TIME<<" "<<GetRunInfo()->RUNTRAILER_TIME; |
| 2793 |
|
cout << " obt "<<obt; |
| 2794 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_OBT<<" "<<GetRunInfo()->RUNTRAILER_OBT; |
| 2795 |
|
cout << " *** JUMP RUN *** irun "<<irun; |
| 2796 |
|
// if(!SECONDO_GIRO)cout << " (don't worry)"; |
| 2797 |
|
// else cout << " (start worring...)"; |
| 2798 |
|
cout << endl; |
| 2799 |
|
// irun++; |
| 2800 |
|
irunoffset[sel_tree->GetTreeNumber()]++; |
| 2801 |
|
irun = irunt + irunoffset[sel_tree->GetTreeNumber()];//NEWNEW |
| 2802 |
|
// if(irun == run_tree->GetEntries() && SECONDO_GIRO){ |
| 2803 |
|
if(irun == irun_start){ |
| 2804 |
|
cout << " ...grrrvzzkhhhajsdkj!!!! "<<endl; |
| 2805 |
|
irunoffset[sel_tree->GetTreeNumber()] = offset_start; |
| 2806 |
|
return false; |
| 2807 |
|
} |
| 2808 |
|
if(irun == run_tree->GetEntries()){ |
| 2809 |
|
SECONDO_GIRO=true; |
| 2810 |
|
irun=0; |
| 2811 |
|
irunoffset[sel_tree->GetTreeNumber()]=-irunt; |
| 2812 |
|
} |
| 2813 |
|
run_tree->GetEntry(irun); |
| 2814 |
|
} |
| 2815 |
|
|
| 2816 |
|
cout << " (test) "; |
| 2817 |
|
cout << " tree "<<sel_tree->GetTreeNumber(); |
| 2818 |
|
cout << " irunt "<<irunt; |
| 2819 |
|
cout << " offset "<<irunoffset[sel_tree->GetTreeNumber()]; |
| 2820 |
|
cout << " abs "<<abstime; |
| 2821 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_TIME<<" "<<GetRunInfo()->RUNTRAILER_TIME; |
| 2822 |
|
cout << " obt "<<obt; |
| 2823 |
|
cout <<" >> "<<GetRunInfo()->RUNHEADER_OBT<<" "<<GetRunInfo()->RUNTRAILER_OBT; |
| 2824 |
|
cout << endl; |
| 2825 |
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
cout << endl << " ))))) UPDATE RUN INFO ((((( @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl; |
| 2826 |
|
cout << endl; |
| 2827 |
prevshift = 0; |
prevshift = 0; |
| 2828 |
return true; |
return true; |
| 2829 |
} |
} |
| 2839 |
* @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 |
| 2840 |
*/ |
*/ |
| 2841 |
Bool_t PamLevel2::UpdateRunInfo(TTree *run, Long64_t iev){ |
Bool_t PamLevel2::UpdateRunInfo(TTree *run, Long64_t iev){ |
| 2842 |
return(UpdateRunInfo((TChain*)run,iev)); |
return(UpdateRunInfo((TChain*)run,iev)); |
| 2843 |
}; |
}; |
| 2844 |
|
|
| 2845 |
//-------------------------------------- |
//-------------------------------------- |
| 2849 |
/** |
/** |
| 2850 |
* Set which trees shoul be analysed |
* Set which trees shoul be analysed |
| 2851 |
* @param detlist TString containing the sequence of trees required |
* @param detlist TString containing the sequence of trees required |
| 2852 |
*/ |
*/ |
| 2853 |
void PamLevel2::SetWhichTrees(TString detlist){ |
void PamLevel2::SetWhichTrees(TString detlist){ |
| 2854 |
|
|
| 2855 |
if(detlist.IsNull() || detlist.Contains("+ALL", TString::kIgnoreCase)){ |
// if(detlist.IsNull() || detlist.Contains("+ALL", TString::kIgnoreCase)){ |
| 2856 |
CAL0 = false; |
if( detlist.Contains("+ALL", TString::kIgnoreCase)){ |
| 2857 |
|
|
| 2858 |
|
cout << " ======================================================== "<<endl; |
| 2859 |
|
cout << " (( WARNING )) "<<endl; |
| 2860 |
|
cout << " The meaning of the option +ALL has changed!! "<<endl; |
| 2861 |
|
cout << " Now it includes really all (level0+level1+level2+gpamela)"<<endl; |
| 2862 |
|
cout << " and the file is discarded if it does not contain "<<endl; |
| 2863 |
|
cout << " all trees or if level0 files are not available!! "<<endl; |
| 2864 |
|
cout << " ======================================================== "<<endl; |
| 2865 |
|
|
| 2866 |
|
CAL0 = true; |
| 2867 |
CAL1 = true; |
CAL1 = true; |
| 2868 |
CAL2 = true; |
CAL2 = true; |
| 2869 |
TRK2 = true; |
TRK2 = true; |
| 2870 |
TRK1 = false; |
TRK1 = true; |
| 2871 |
TRKh = false; |
TRKh = true; |
| 2872 |
TRK0 = false; |
TRK0 = true; |
| 2873 |
TRG = true; |
TRG = true; |
| 2874 |
TOF = true; |
TOF = true; |
| 2875 |
TOF0 = false; |
TOF0 = true; |
| 2876 |
S4 = true; |
S4 = true; |
| 2877 |
ND = true; |
ND = true; |
| 2878 |
AC = true; |
AC = true; |
| 2879 |
ORB = true; |
ORB = true; |
| 2880 |
|
GP = true; |
| 2881 |
}else if( detlist.Contains("-ALL", TString::kIgnoreCase) ){ |
}else if( detlist.Contains("-ALL", TString::kIgnoreCase) ){ |
| 2882 |
CAL0 = false; |
CAL0 = false; |
| 2883 |
CAL1 = false; |
CAL1 = false; |
| 2893 |
ND = false; |
ND = false; |
| 2894 |
AC = false; |
AC = false; |
| 2895 |
ORB = false; |
ORB = false; |
| 2896 |
|
GP = false; |
| 2897 |
}; |
}; |
| 2898 |
|
|
| 2899 |
// ------------------------------------------------------------------------- |
// ------------------------------------------------------------------------- |
| 2967 |
if( detlist.Contains("-ORB", TString::kIgnoreCase) )ORB = false; |
if( detlist.Contains("-ORB", TString::kIgnoreCase) )ORB = false; |
| 2968 |
else if( detlist.Contains("+ORB", TString::kIgnoreCase) )ORB = true; |
else if( detlist.Contains("+ORB", TString::kIgnoreCase) )ORB = true; |
| 2969 |
|
|
| 2970 |
|
if( detlist.Contains("-GP", TString::kIgnoreCase) )GP = false; |
| 2971 |
|
else if( detlist.Contains("+GP", TString::kIgnoreCase) )GP = true; |
| 2972 |
|
|
| 2973 |
|
cout<< "tree/branch list from input --> "; |
| 2974 |
|
if(TRK0)cout<<"TRK0 "; |
| 2975 |
|
if(TRK1)cout<<"TRK1 "; |
| 2976 |
|
if(TRK2)cout<<"TRK2 "; |
| 2977 |
|
if(TRKh)cout<<"TRKH "; |
| 2978 |
|
if(CAL0)cout<<"CAL0 "; |
| 2979 |
|
if(CAL1)cout<<"CAL1 "; |
| 2980 |
|
if(CAL2)cout<<"CAL2 "; |
| 2981 |
|
if(TOF)cout<<"TOF "; |
| 2982 |
|
if(TRG)cout<<"TRG "; |
| 2983 |
|
if(AC)cout<<"AC "; |
| 2984 |
|
if(ND)cout<<"ND "; |
| 2985 |
|
if(S4)cout<<"S4 "; |
| 2986 |
|
if(ORB)cout<<"ORB "; |
| 2987 |
|
if(GP)cout<<"GP "; |
| 2988 |
|
cout << endl; |
| 2989 |
// cout<< "Set detector list --> "; |
// cout<< "Set detector list --> "; |
| 2990 |
// if(TRK1)cout<<"TRK1 "; |
// if(TRK1)cout<<"TRK1 "; |
| 2991 |
// if(TRK2)cout<<"TRK2 "; |
// if(TRK2)cout<<"TRK2 "; |
| 2992 |
// if(TRKh)cout<<"TRKH "; |
// if(TRKh)cout<<"TRKH "; |
| 2993 |
// if(CAL1)cout<<"CAL1 "; |
// if(CAL1)cout<<"CAL1 "; |
| 2994 |
// if(CAL2)cout<<"CAL2 "; |
// if(CAL2)cout<<"CAL2 "; |
| 2995 |
|
// if(TOF0)cout<<"TOF0 "; |
| 2996 |
// if(TOF)cout<<"TOF "; |
// if(TOF)cout<<"TOF "; |
| 2997 |
// if(TRG)cout<<"TRG "; |
// if(TRG)cout<<"TRG "; |
| 2998 |
// if(AC)cout<<"AC "; |
// if(AC)cout<<"AC "; |
| 3011 |
|
|
| 3012 |
|
|
| 3013 |
|
|
| 3014 |
cout << "void PamLevel2::GetWhichTrees(TFile* f) --- WARNING!! --- ...potrebbe non funzionare "<<endl; |
// cout << "void PamLevel2::GetWhichTrees(TFile* f) --- WARNING!! --- ...potrebbe non funzionare "<<endl; |
| 3015 |
// ----------- |
// ----------- |
| 3016 |
// reset flags |
// reset flags |
| 3017 |
// ----------- |
// ----------- |
| 3026 |
ND = false; |
ND = false; |
| 3027 |
AC = false; |
AC = false; |
| 3028 |
ORB = false; |
ORB = false; |
| 3029 |
|
GP = false; |
| 3030 |
|
|
| 3031 |
RUN = false; |
RUN = false; |
| 3032 |
|
|
| 3117 |
TRK2 = false; |
TRK2 = false; |
| 3118 |
TRKh = false; |
TRKh = false; |
| 3119 |
}else nev=nevt; |
}else nev=nevt; |
| 3120 |
T->Delete(); |
// T->Delete(); |
| 3121 |
}; |
}; |
| 3122 |
//========================================================= |
//========================================================= |
| 3123 |
if( !strcmp(key->GetName(),"Calorimeter" ) ){ |
if( !strcmp(key->GetName(),"Calorimeter" ) ){ |
| 3133 |
CAL1 = false; |
CAL1 = false; |
| 3134 |
CAL2 = false; |
CAL2 = false; |
| 3135 |
}else nev=nevt; |
}else nev=nevt; |
| 3136 |
T->Delete(); |
// T->Delete(); |
| 3137 |
}; |
}; |
| 3138 |
|
//========================================================= |
| 3139 |
|
if( !strcmp(key->GetName(),"h20") ){ |
| 3140 |
|
GP = true; |
| 3141 |
|
Int_t nevt = ((TTree*)f->Get("h20"))->GetEntries(); |
| 3142 |
|
if( nev && nevt!=nev){ |
| 3143 |
|
cout << "File: "<< f->GetName() <<" h20 tree has "<<nevt<<" events instead of "<<nev<< endl; |
| 3144 |
|
GP = false; |
| 3145 |
|
}else nev=nevt; |
| 3146 |
|
} |
| 3147 |
|
|
| 3148 |
}; |
}; |
| 3149 |
|
|
| 3150 |
delete lk; |
// delete lk; |
| 3151 |
|
|
| 3152 |
// cout<< "Get detector list from input file --> "; |
cout<< "tree/branch list from file --> "; |
| 3153 |
// if(TRK1)cout<<"TRK1 "; |
if(TRK1)cout<<"TRK1 "; |
| 3154 |
// if(TRK2)cout<<"TRK2 "; |
if(TRK2)cout<<"TRK2 "; |
| 3155 |
// if(TRKh)cout<<"TRKH "; |
if(TRKh)cout<<"TRKH "; |
| 3156 |
// if(CAL1)cout<<"CAL1 "; |
if(CAL1)cout<<"CAL1 "; |
| 3157 |
// if(CAL2)cout<<"CAL2 "; |
if(CAL2)cout<<"CAL2 "; |
| 3158 |
// if(TOF)cout<<"TOF "; |
if(TOF)cout<<"TOF "; |
| 3159 |
// if(TRG)cout<<"TRG "; |
if(TRG)cout<<"TRG "; |
| 3160 |
// if(AC)cout<<"AC "; |
if(AC)cout<<"AC "; |
| 3161 |
// if(ND)cout<<"ND "; |
if(ND)cout<<"ND "; |
| 3162 |
// if(S4)cout<<"S4 "; |
if(S4)cout<<"S4 "; |
| 3163 |
// if(ORB)cout<<"ORB "; |
if(ORB)cout<<"ORB "; |
| 3164 |
// cout << endl; |
if(GP)cout<<"GP "; |
| 3165 |
|
cout << endl; |
| 3166 |
|
|
| 3167 |
return ; |
return ; |
| 3168 |
|
|
| 3191 |
Bool_t ND__ok = false; |
Bool_t ND__ok = false; |
| 3192 |
Bool_t AC__ok = false; |
Bool_t AC__ok = false; |
| 3193 |
Bool_t ORB__ok = false; |
Bool_t ORB__ok = false; |
| 3194 |
|
Bool_t GP__ok = false; |
| 3195 |
|
|
| 3196 |
Bool_t RUN__ok = false; |
Bool_t RUN__ok = false; |
| 3197 |
|
|
| 3198 |
Bool_t SELLI__ok = false; |
Bool_t SELLI__ok = false; |
| 3199 |
|
|
| 3200 |
cout << "Checking file: "<<name<<endl; |
// cout << "Checking file: "<<name<<endl; |
| 3201 |
TFile *f = new TFile(name.Data()); |
TFile *f = new TFile(name.Data()); |
| 3202 |
if( !f || f->IsZombie() ){ |
if( !f || f->IsZombie() ){ |
| 3203 |
cout << "File: "<< f->GetName() <<" discarded ---- Non valid root file"<< endl; return false; |
cout << "File: "<< f->GetName() <<" discarded ---- Non valid root file"<< endl; return false; |
| 3223 |
// return false; |
// return false; |
| 3224 |
// }; |
// }; |
| 3225 |
|
|
| 3226 |
|
//========================================================= |
| 3227 |
|
// check if the file |
| 3228 |
|
|
| 3229 |
|
|
| 3230 |
if( !strcmp(key->GetName(),"Run" ) )RUN__ok = true; |
if( !strcmp(key->GetName(),"Run" ) )RUN__ok = true; |
| 3231 |
|
|
| 3352 |
}; |
}; |
| 3353 |
T->Delete(); |
T->Delete(); |
| 3354 |
}; |
}; |
| 3355 |
|
//========================================================= |
| 3356 |
|
if( !strcmp(key->GetName(),"h20") ){ |
| 3357 |
|
ISGP = true; |
| 3358 |
|
GP__ok = true; |
| 3359 |
|
if(GP){ |
| 3360 |
|
Int_t nevt = ((TTree*)f->Get("h20"))->GetEntries(); |
| 3361 |
|
if( nev && nevt!=nev){ |
| 3362 |
|
cout << "File: "<< f->GetName() <<" discarded ---- OrbitalInfo tree has "<<nevt<<" events instead of "<<nev<< endl; |
| 3363 |
|
return false; |
| 3364 |
|
} |
| 3365 |
|
nev=nevt; |
| 3366 |
|
} |
| 3367 |
|
} |
| 3368 |
|
|
| 3369 |
}; |
}; |
| 3370 |
|
|
| 3454 |
cout << "File: "<< f->GetName() <<" discarded ---- Missing Trigger tree"<< endl; |
cout << "File: "<< f->GetName() <<" discarded ---- Missing Trigger tree"<< endl; |
| 3455 |
return false; |
return false; |
| 3456 |
}; |
}; |
| 3457 |
|
if(GP && !GP__ok){ |
| 3458 |
|
cout << "File: "<< f->GetName() <<" discarded ---- Missing h20 tree"<< endl; |
| 3459 |
|
return false; |
| 3460 |
|
}; |
| 3461 |
|
|
| 3462 |
|
|
| 3463 |
// lk->Delete(); |
// lk->Delete(); |
| 3476 |
// if(ND)cout<<"ND "; |
// if(ND)cout<<"ND "; |
| 3477 |
// if(S4)cout<<"S4 "; |
// if(S4)cout<<"S4 "; |
| 3478 |
// if(ORB)cout<<"ORB "; |
// if(ORB)cout<<"ORB "; |
| 3479 |
|
// if(GP)cout<<"GP "; |
| 3480 |
// cout << endl; |
// cout << endl; |
| 3481 |
|
|
| 3482 |
return true; |
return true; |
| 3549 |
// ------------------ |
// ------------------ |
| 3550 |
// replicate run tree |
// replicate run tree |
| 3551 |
// ------------------ |
// ------------------ |
| 3552 |
cout << "----------------------------------------------------"<<endl; |
// cout << "----------------------------------------------------"<<endl; |
| 3553 |
cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl; |
// cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl; |
| 3554 |
for (Int_t i=0; i<run_tree->GetEntries(); i++){ |
for (Int_t i=0; i<run_tree->GetEntries(); i++){ |
| 3555 |
run_tree->GetEntry(i); |
run_tree->GetEntry(i); |
| 3556 |
cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl; |
// cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl; |
| 3557 |
run_tree_clone->Fill(); |
run_tree_clone->Fill(); |
| 3558 |
} |
} |
| 3559 |
cout << "----------------------------------------------------"<<endl; |
cout << "----------------------------------------------------"<<endl; |
| 3560 |
|
|
| 3561 |
|
// ------------------------------------ |
| 3562 |
|
// add branch with dead and live times |
| 3563 |
|
// ------------------------------------ |
| 3564 |
|
run_tree_clone->Branch("DeadLiveTime",totdltime,"dltime[3]/l"); |
| 3565 |
|
cout << "Run : branch DeadLiveTime"<<endl; |
| 3566 |
|
|
| 3567 |
|
|
| 3568 |
sel_tree_clone = new TTree("SelectionList","List of selected events "); |
sel_tree_clone = new TTree("SelectionList","List of selected events "); |
| 3569 |
sel_tree_clone->Branch("RunEntry",&irun,"runentry/L"); |
// sel_tree_clone->Branch("RunEntry",&irun,"runentry/L"); |
| 3570 |
|
sel_tree_clone->Branch("RunEntry",&irunt,"runentry/L");//NEWNEW |
| 3571 |
sel_tree_clone->Branch("EventEntry",&irunentry,"eventry/L"); |
sel_tree_clone->Branch("EventEntry",&irunentry,"eventry/L"); |
| 3572 |
|
|
| 3573 |
|
|
| 3647 |
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
| 3648 |
i++; |
i++; |
| 3649 |
}; |
}; |
| 3650 |
|
// GPamela |
| 3651 |
|
if(GP) { |
| 3652 |
|
pam_tree_clone[i] = new TTree("h20","PAMELA oribital info "); |
| 3653 |
|
pam_tree_clone[i]->Branch("GPamela","GPamela", GetPointerTo("GPamela"),32000,1);//split |
| 3654 |
|
cout << "OrbitalInfo : branch OrbitalInfo"<<endl; |
| 3655 |
|
i++; |
| 3656 |
|
}; |
| 3657 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
| 3658 |
|
|
| 3659 |
} |
} |
| 3698 |
void PamLevel2::WriteCloneTrees(){ |
void PamLevel2::WriteCloneTrees(){ |
| 3699 |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl; |
| 3700 |
cout << "Write clones of PAMELA trees "<<endl; |
cout << "Write clones of PAMELA trees "<<endl; |
| 3701 |
cout << run_tree_clone->GetName()<<endl; |
cout << run_tree_clone->GetName()<<endl; |
| 3702 |
|
if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries()) |
| 3703 |
|
run_tree_clone->GetBranch("DeadLiveTime")->Fill(); |
| 3704 |
run_tree_clone->Write(); |
run_tree_clone->Write(); |
| 3705 |
cout << sel_tree_clone->GetName()<<endl; |
cout << sel_tree_clone->GetName()<<endl; |
| 3706 |
sel_tree_clone->Write(); |
sel_tree_clone->Write(); |
| 3744 |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading pam tree"<<endl; |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading pam tree"<<endl; |
| 3745 |
return 0; |
return 0; |
| 3746 |
} |
} |
| 3747 |
|
|
| 3748 |
// |
// |
| 3749 |
// ... that's way I put it here. Notice that nothing change in the code (is backward compatible) since in any case you return with 0. |
// ... that's way I put it here. Notice that nothing change in the code (is backward compatible) since in any case you return with 0. |
| 3750 |
// in theory one would like to return 1 if run is not loaded but now I don't have the will to add that 2 lines of code and it is not |
// in theory one would like to return 1 if run is not loaded but now I don't have the will to add that 2 lines of code and it is not |
| 3835 |
// open the DB connection |
// open the DB connection |
| 3836 |
// (if not already opened) |
// (if not already opened) |
| 3837 |
//=================================== |
//=================================== |
| 3838 |
if(!dbc || (dbc && !dbc->IsConnected())){ |
if(!dbc || (dbc && !dbc->IsConnected()))SetDBConnection(); |
|
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
|
|
cout<<"Connecting to DB"<<endl; |
|
|
cout<<"HOST "<<host<<endl; |
|
|
cout<<"USER "<<user<<endl; |
|
|
cout<<"PSW "<<psw<<endl; |
|
|
dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data()); |
|
|
if( !dbc )return NULL; |
|
|
if( !dbc->IsConnected() )return NULL; |
|
|
// cout<<"...done"<<endl; |
|
|
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
|
|
}else{ |
|
|
// cout<<"DB already connected"<<endl; |
|
|
} |
|
| 3839 |
GL_ROOT glroot = GL_ROOT(); |
GL_ROOT glroot = GL_ROOT(); |
| 3840 |
if( glroot.Query_GL_ROOT(iroot,dbc) ){ |
if( glroot.Query_GL_ROOT(iroot,dbc) ){ |
| 3841 |
cout << "TTree* PamLevel2::GetYodaTree( ) -- ERROR -- level0 file iroot = "<<iroot<< " does not exists"<<endl; |
cout << "TTree* PamLevel2::GetYodaTree( ) -- ERROR -- level0 file iroot = "<<iroot<< " does not exists"<<endl; |
| 3883 |
cout << "PamLevel2::GetYodaTree() --- level0 TOF not implemented "<<endl; |
cout << "PamLevel2::GetYodaTree() --- level0 TOF not implemented "<<endl; |
| 3884 |
} |
} |
| 3885 |
|
|
| 3886 |
|
dbc->Close(); // EMILIANO, do not leave open connections, open only when needed |
| 3887 |
|
|
| 3888 |
|
|
| 3889 |
}; |
}; |
| 3890 |
|
|
| 3891 |
if(!dbc || (dbc && !dbc->IsConnected())){ |
// if(!dbc || (dbc && !dbc->IsConnected())){ |
| 3892 |
cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
// cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
| 3893 |
} |
// } |
| 3894 |
|
|
| 3895 |
if ( TRK0 ){ |
if ( TRK0 ){ |
| 3896 |
TrkParams::Load(6); |
TrkParams::Load(6); |
| 3897 |
if( !TrkParams::IsLoaded(6) ){ |
if( !TrkParams::IsLoaded(6) ){ |
| 3898 |
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- VK-mask not loaded"<<endl; |
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- VK-mask not loaded"<<endl; |
| 3899 |
}; |
}; |
| 3900 |
|
if(!dbc || (dbc && !dbc->IsConnected()))SetDBConnection(); |
| 3901 |
TrkParams::SetCalib(run_obj,dbc); |
TrkParams::SetCalib(run_obj,dbc); |
| 3902 |
TrkParams::LoadCalib( ); |
TrkParams::LoadCalib( ); |
| 3903 |
if( !TrkParams::CalibIsLoaded() ){ |
if( !TrkParams::CalibIsLoaded() ){ |
| 3904 |
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- Calibration not loaded"<<endl; |
cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- Calibration not loaded"<<endl; |
| 3905 |
}; |
}; |
| 3906 |
|
dbc->Close(); // EMILIANO, do not leave open connections, open only when needed |
| 3907 |
} |
} |
| 3908 |
|
|
| 3909 |
|
|
| 3910 |
// cout << l0_tree << endl; |
// cout << l0_tree << endl; |
|
|
|
| 3911 |
return l0_tree; |
return l0_tree; |
| 3912 |
|
|
| 3913 |
} |
} |
| 3935 |
|
|
| 3936 |
// cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl; |
// cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl; |
| 3937 |
// cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl; |
// cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl; |
| 3938 |
// cout << " time "<< GetOrbitalInfo()->absTime << endl; |
// cout << " time "<< abstime << endl; |
| 3939 |
// cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl; |
// cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl; |
| 3940 |
|
|
| 3941 |
if( !GetOrbitalInfo() ){ |
ULong64_t obt = 0; |
| 3942 |
|
ULong64_t pktn = 0; |
| 3943 |
|
if( GetOrbitalInfo() ){ |
| 3944 |
|
obt = GetOrbitalInfo()->OBT; |
| 3945 |
|
pktn = GetOrbitalInfo()->pkt_num; |
| 3946 |
|
} |
| 3947 |
|
|
| 3948 |
|
if( !GetOrbitalInfo() && !ISGP){ |
| 3949 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl; |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl; |
| 3950 |
return 0; |
return 0; |
| 3951 |
} |
} |
| 3952 |
if( GetOrbitalInfo()->OBT==0 && GetOrbitalInfo()->pkt_num==0 ){ |
if( obt==0 && pktn==0 && !ISGP ){ |
| 3953 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? "<<endl; |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? "<<endl; |
| 3954 |
return 0; |
return 0; |
| 3955 |
} |
} |
| 3968 |
Int_t answer = 0; |
Int_t answer = 0; |
| 3969 |
Int_t shift =0; |
Int_t shift =0; |
| 3970 |
// printf(" siamo qui %i %i \n",shift,prevshift); |
// printf(" siamo qui %i %i \n",shift,prevshift); |
| 3971 |
Int_t maxshift = 10; |
// Int_t maxshift = 50; // EMILIANO |
| 3972 |
do{ |
do{ |
| 3973 |
if(shift>0){ |
if(shift>0){ |
| 3974 |
cout << " PKTNUM L2 --- "<< GetOrbitalInfo()->pkt_num << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
cout << " PKTNUM L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
| 3975 |
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; |
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; |
| 3976 |
cout << " L2 <--> L0 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl; |
cout << " L2 <--> L0 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl; |
| 3977 |
} |
} |
| 3981 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl; |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl; |
| 3982 |
return 0; |
return 0; |
| 3983 |
} |
} |
| 3984 |
// cout << "PKTNUM "<<shift<<" == L2 --- "<< GetOrbitalInfo()->pkt_num << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
|
| 3985 |
// cout << " L2 --- "<< GetOrbitalInfo()->OBT << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl; |
if(ISGP){ |
| 3986 |
|
obt = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()); //BARBATRUCCO |
| 3987 |
|
pktn = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter()); //BARBATRUCCO |
| 3988 |
|
} |
| 3989 |
|
|
| 3990 |
|
// cout << "PKTNUM "<<shift<<" == L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl; |
| 3991 |
|
// cout << " L2 --- "<< obt << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl; |
| 3992 |
// if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl; |
// if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl; |
| 3993 |
// cout << " GetOrbitalInfo()->OBT "<< GetOrbitalInfo()->OBT << endl; |
// cout << " obt "<< obt << endl; |
| 3994 |
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
| 3995 |
// cout << " GetOrbitalInfo()->pkt_num "<< GetOrbitalInfo()->pkt_num << endl; |
// cout << " pktn "<< pktn << endl; |
| 3996 |
// cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
// cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
| 3997 |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
// printf(" IDRUN %u \n",GetRunInfo()->ID); |
| 3998 |
// |
// |
| 3999 |
if ( prevshift != 0 && (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() ){ |
if ( prevshift != 0 && (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() ){ |
| 4000 |
prevshift = 0; |
prevshift = 0; |
| 4001 |
shift = -1; |
shift = -1; |
| 4002 |
}; |
}; |
| 4003 |
|
|
| 4004 |
}while( ( GetOrbitalInfo()->OBT != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || GetOrbitalInfo()->pkt_num != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() && shift < maxshift); |
}while( ( obt != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || |
| 4005 |
|
pktn != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter()) ) |
| 4006 |
|
&& (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() && shift < maxshift); |
| 4007 |
|
|
| 4008 |
if ( (quellagiusta+(Long64_t)shift+(Long64_t)prevshift) > GetYodaTree()->GetEntries() || shift == maxshift ) { |
if ( (quellagiusta+(Long64_t)shift+(Long64_t)prevshift) > GetYodaTree()->GetEntries() || shift == maxshift ) { |
| 4009 |
cout << " Big trouble here, no such event in Level0 data! " <<endl; |
cout << " Big trouble here, no such event in Level0 data! " <<endl; |
| 4029 |
dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data()); |
dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data()); |
| 4030 |
if( !dbc )return false; |
if( !dbc )return false; |
| 4031 |
if( !dbc->IsConnected() )return false; |
if( !dbc->IsConnected() )return false; |
| 4032 |
|
stringstream myquery; // EMILIANO |
| 4033 |
|
myquery.str(""); // EMILIANO |
| 4034 |
|
myquery << "SET time_zone='+0:00'"; // EMILIANO |
| 4035 |
|
dbc->Query(myquery.str().c_str()); // EMILIANO |
| 4036 |
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl; |
| 4037 |
return true; |
return true; |
| 4038 |
|
|
| 4039 |
} |
} |
| 4040 |
|
|
| 4041 |
|
/** |
| 4042 |
|
* \Brief Add a friend to the pamela chain. |
| 4043 |
|
* @param cname name of the chain to be added |
| 4044 |
|
*/ |
| 4045 |
|
|
| 4046 |
|
TChain* PamLevel2::AddFriend(TString cname){ |
| 4047 |
|
|
| 4048 |
|
if(!GetPamTree()){ |
| 4049 |
|
cout << " TChain* PamLevel2::AddFriend(TString cname) --- a pamela tree must be created first"<<endl; |
| 4050 |
|
return NULL; |
| 4051 |
|
} |
| 4052 |
|
|
| 4053 |
|
|
| 4054 |
|
TChain *c = new TChain( cname.Data() ); |
| 4055 |
|
|
| 4056 |
|
TIter next( GetPamTree()->GetListOfFiles() ); |
| 4057 |
|
Int_t nf = 0; |
| 4058 |
|
TChainElement* element = 0; |
| 4059 |
|
while ((element = (TChainElement*) next())) { |
| 4060 |
|
c->Add(element->GetTitle()); |
| 4061 |
|
nf++; |
| 4062 |
|
} |
| 4063 |
|
|
| 4064 |
|
GetPamTree()->AddFriend(cname.Data()); |
| 4065 |
|
|
| 4066 |
|
cout << "external chain created and added to pamela friends :"<<cname<<endl; |
| 4067 |
|
cout << "n.files "<<nf<<endl; |
| 4068 |
|
|
| 4069 |
|
|
| 4070 |
|
return c; |
| 4071 |
|
|
| 4072 |
|
} |
| 4073 |
|
|
| 4074 |
|
|