| 103 |
|
|
| 104 |
h0_obj = 0; |
h0_obj = 0; |
| 105 |
trk0_obj = 0; |
trk0_obj = 0; |
| 106 |
|
calo0_obj = 0; |
| 107 |
|
|
| 108 |
trk2_obj = 0; |
trk2_obj = 0; |
| 109 |
trk1_obj = 0; |
trk1_obj = 0; |
| 127 |
l0_tree = NULL; |
l0_tree = NULL; |
| 128 |
iroot = -1; |
iroot = -1; |
| 129 |
dbc = 0; |
dbc = 0; |
| 130 |
|
|
| 131 |
|
prevshift = 0; |
| 132 |
|
|
| 133 |
irun = -1; |
irun = -1; |
| 134 |
run_tree = NULL; |
run_tree = NULL; |
| 191 |
// cout << "void PamLevel2::Clear()"<<endl; |
// cout << "void PamLevel2::Clear()"<<endl; |
| 192 |
if(h0_obj) delete h0_obj; |
if(h0_obj) delete h0_obj; |
| 193 |
if(trk0_obj) delete trk0_obj; |
if(trk0_obj) delete trk0_obj; |
| 194 |
|
if(calo0_obj) delete calo0_obj; |
| 195 |
if(trk1_obj) delete trk1_obj; |
if(trk1_obj) delete trk1_obj; |
| 196 |
if(trk2_obj) delete trk2_obj; |
if(trk2_obj) delete trk2_obj; |
| 197 |
if(trkh_obj) delete trkh_obj; |
if(trkh_obj) delete trkh_obj; |
| 246 |
|
|
| 247 |
if(h0_obj) h0_obj->Clear(); |
if(h0_obj) h0_obj->Clear(); |
| 248 |
if(trk0_obj) trk0_obj->Clear(); |
if(trk0_obj) trk0_obj->Clear(); |
| 249 |
|
if(calo0_obj) calo0_obj->Clear(); |
| 250 |
if(trk1_obj) trk1_obj->Clear(); |
if(trk1_obj) trk1_obj->Clear(); |
| 251 |
if(trk2_obj) trk2_obj->Clear(); |
if(trk2_obj) trk2_obj->Clear(); |
| 252 |
if(trkh_obj) trkh_obj->Clear(); |
if(trkh_obj) trkh_obj->Clear(); |
| 559 |
use_CAL && |
use_CAL && |
| 560 |
calo2_obj->npcfit[1] > 15 && //no. of fit planes on Y view |
calo2_obj->npcfit[1] > 15 && //no. of fit planes on Y view |
| 561 |
calo2_obj->varcfit[1] < 1000. && //fit variance on Y view |
calo2_obj->varcfit[1] < 1000. && //fit variance on Y view |
| 562 |
|
cp && ci && |
| 563 |
true){ |
true){ |
| 564 |
|
|
| 565 |
|
|
| 581 |
cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but ToFLevel2 not loaded !!!"; |
cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but ToFLevel2 not loaded !!!"; |
| 582 |
return; |
return; |
| 583 |
}; |
}; |
| 584 |
if( use_TOF ){ |
if( use_TOF && op && oi ){ |
| 585 |
|
|
| 586 |
Int_t nphit_p =0; |
Int_t nphit_p =0; |
| 587 |
Int_t nphit_i =0; |
Int_t nphit_i =0; |
| 974 |
}; |
}; |
| 975 |
|
|
| 976 |
cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl; |
|
|
|
|
pam_tree = (TChain*)Trout; |
|
| 977 |
|
|
| 978 |
|
pam_tree = (TChain*)Trout; |
| 979 |
|
|
| 980 |
return Trout; |
return Trout; |
| 981 |
|
|
| 982 |
} |
} |
| 1005 |
// char *fullpath; |
// char *fullpath; |
| 1006 |
// const char *fullpath; |
// const char *fullpath; |
| 1007 |
|
|
| 1008 |
// if input file list is given: |
// if no input file list is given: |
| 1009 |
if ( flisttxt != "" ){ |
if ( flisttxt != "" ){ |
| 1010 |
|
|
| 1011 |
// if( !gSystem->IsFileInIncludePath(flisttxt,&fullpath) ){ |
// if( !gSystem->IsFileInIncludePath(flisttxt,&fullpath) ){ |
| 1014 |
// return 0; |
// return 0; |
| 1015 |
// } |
// } |
| 1016 |
// flisttxt = fullpath; |
// flisttxt = fullpath; |
|
|
|
| 1017 |
if ( !flisttxt.EndsWith(".root") ){ |
if ( !flisttxt.EndsWith(".root") ){ |
| 1018 |
|
|
| 1019 |
flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
| 1020 |
|
|
| 1021 |
if( !gSystem->ChangeDirectory(ddir) ){ |
if( !gSystem->ChangeDirectory(ddir) ){ |
| 1060 |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt)); |
| 1061 |
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 |
| 1062 |
delete fullpath; |
delete fullpath; |
| 1063 |
}; |
}; |
| 1064 |
}else{ |
}else{ |
| 1065 |
|
|
| 1066 |
cout << "No input file list given."<<endl; |
cout << "No input file list given."<<endl; |
| 1535 |
if(SELLI==0){ |
if(SELLI==0){ |
| 1536 |
if ( irun < 0 ){ |
if ( irun < 0 ){ |
| 1537 |
irun = 0; |
irun = 0; |
| 1538 |
run->GetEntry(0); |
run->GetEntry(irun); |
| 1539 |
runfirstentry = 0ULL; |
runfirstentry = 0ULL; |
| 1540 |
runlastentry += (ULong64_t)(this->GetRunInfo()->NEVENTS) - 1ULL; |
runlastentry += (ULong64_t)(this->GetRunInfo()->NEVENTS); |
| 1541 |
|
if ( (ULong64_t)(this->GetRunInfo()->NEVENTS) > 0ULL ) runlastentry -= 1ULL; |
| 1542 |
|
return(true); |
| 1543 |
}; |
}; |
| 1544 |
|
|
| 1545 |
if( !GetOrbitalInfo() ){ |
if( !GetOrbitalInfo() ){ |
| 1550 |
// dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!) |
// dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!) |
| 1551 |
while ( GetOrbitalInfo()->absTime > GetRunInfo()->RUNTRAILER_TIME && irun < run->GetEntries() ){ |
while ( GetOrbitalInfo()->absTime > GetRunInfo()->RUNTRAILER_TIME && irun < run->GetEntries() ){ |
| 1552 |
// while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
// while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){ |
| 1553 |
// 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))); |
| 1554 |
irun++; |
irun++; |
| 1555 |
run->GetEntry(irun); |
run->GetEntry(irun); |
| 1556 |
runfirstentry = runlastentry+1ULL; |
runfirstentry = runlastentry; |
| 1557 |
|
if ( (ULong64_t)(this->GetRunInfo()->NEVENTS) > 0ULL ) runfirstentry += 1ULL; |
| 1558 |
runlastentry += (ULong64_t)(this->GetRunInfo()->NEVENTS); |
runlastentry += (ULong64_t)(this->GetRunInfo()->NEVENTS); |
| 1559 |
}; |
}; |
| 1560 |
|
|
| 2373 |
return 0; |
return 0; |
| 2374 |
} |
} |
| 2375 |
|
|
| 2376 |
|
|
| 2377 |
|
// |
| 2378 |
|
// This is a sort of bug: if you don't have the run tree you don't want to exit here you want to have loaded the event anyway... |
| 2379 |
|
// |
| 2380 |
|
// if(!run_tree ){ |
| 2381 |
|
// cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loeaded"<<endl; |
| 2382 |
|
// return 0; |
| 2383 |
|
// } |
| 2384 |
|
|
| 2385 |
Int_t ii=0; |
Int_t ii=0; |
| 2386 |
//------------------------------- |
//------------------------------- |
| 2387 |
ii = iee; |
ii = iee; |
| 2388 |
if( !pam_tree->GetEntry(ii) ) return 0; |
if( !pam_tree->GetEntry(ii) ) return 0; |
|
//------------------------------- |
|
| 2389 |
|
|
| 2390 |
|
// |
| 2391 |
|
// ... 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. |
| 2392 |
|
// 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 |
| 2393 |
|
// a problem if you don't check the return code of getentry. |
| 2394 |
|
// |
| 2395 |
if(!run_tree ){ |
if(!run_tree ){ |
| 2396 |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl; |
if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1? |
| 2397 |
return 0; |
cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl; |
| 2398 |
|
return 0; |
| 2399 |
|
} else { |
| 2400 |
|
return 1; //cosi` se non c'e` run esce qua... |
| 2401 |
|
} |
| 2402 |
} |
} |
| 2403 |
|
|
| 2404 |
|
//------------------------------- |
| 2405 |
ii = iee; |
ii = iee; |
| 2406 |
Bool_t UPDATED = UpdateRunInfo(run_tree,ii); |
Bool_t UPDATED = UpdateRunInfo(run_tree,ii); |
| 2407 |
if(SELLI==0)irunentry = iee-runfirstentry; |
if(SELLI==0)irunentry = iee-runfirstentry; |
| 2484 |
l0_tree = (TTree*)l0_file->Get("Physics"); |
l0_tree = (TTree*)l0_file->Get("Physics"); |
| 2485 |
if(!h0_obj)h0_obj = new EventHeader(); |
if(!h0_obj)h0_obj = new EventHeader(); |
| 2486 |
l0_tree->SetBranchAddress("Header" ,&h0_obj); |
l0_tree->SetBranchAddress("Header" ,&h0_obj); |
| 2487 |
|
prevshift = 0; |
| 2488 |
//--------------------------------------------------- |
//--------------------------------------------------- |
| 2489 |
// TRACKER: |
// TRACKER: |
| 2490 |
if(TRK0){ |
if(TRK0){ |
| 2493 |
trk0_obj->Set(); |
trk0_obj->Set(); |
| 2494 |
}; |
}; |
| 2495 |
l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent()); |
l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent()); |
|
TrkParams::SetCalib(run_obj,dbc); |
|
| 2496 |
} |
} |
| 2497 |
//--------------------------------------------------- |
//--------------------------------------------------- |
| 2498 |
// CALORIMETER: |
// CALORIMETER: |
| 2499 |
if(CAL0){ |
if(CAL0){ |
| 2500 |
cout << "PamLevel2::GetYodaTree() --- level0 calorimeter not implemented "<<endl; |
if(!calo0_obj){ |
| 2501 |
|
calo0_obj = new CaloLevel0(); |
| 2502 |
|
calo0_obj->Set(); |
| 2503 |
|
}; |
| 2504 |
|
l0_tree->SetBranchAddress("Calorimeter" ,calo0_obj->GetPointerToCalorimeterEvent()); |
| 2505 |
|
// cout << "PamLevel2::GetYodaTree() --- level0 calorimeter not implemented "<<endl; |
| 2506 |
} |
} |
| 2507 |
//--------------------------------------------------- |
//--------------------------------------------------- |
| 2508 |
// TOF: |
// TOF: |
| 2512 |
|
|
| 2513 |
}; |
}; |
| 2514 |
|
|
| 2515 |
|
if(!dbc || (dbc && !dbc->IsConnected())){ |
| 2516 |
|
cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
| 2517 |
|
} |
| 2518 |
|
|
| 2519 |
|
if ( TRK0 ) TrkParams::SetCalib(run_obj,dbc); |
| 2520 |
|
|
| 2521 |
|
|
| 2522 |
// cout << l0_tree << endl; |
// cout << l0_tree << endl; |
| 2523 |
|
|
| 2524 |
return l0_tree; |
return l0_tree; |
| 2533 |
// cout << "Int_t PamLevel2::GetYodaEntry()"<<endl; |
// cout << "Int_t PamLevel2::GetYodaEntry()"<<endl; |
| 2534 |
if(!GetYodaTree())return 0; |
if(!GetYodaTree())return 0; |
| 2535 |
|
|
| 2536 |
|
// patch |
| 2537 |
|
if( (Int_t)irunentry < 0){ |
| 2538 |
|
cout << "Int_t PamLevel2::GetYodaEntry() -- ATTENZIONE -- irunentry negativo?!?! "<<(Int_t)irunentry<<endl; |
| 2539 |
|
irunentry=0; |
| 2540 |
|
} |
| 2541 |
// --------------------------------- |
// --------------------------------- |
| 2542 |
// if file is NOT a preselected file |
// if file is NOT a preselected file |
| 2543 |
// --------------------------------- |
// --------------------------------- |
| 2544 |
Int_t quellagiusta = irunentry + run_obj->EV_FROM; |
UInt_t quellagiusta = irunentry + run_obj->EV_FROM; |
| 2545 |
|
|
| 2546 |
|
|
| 2547 |
|
// cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl; |
| 2548 |
|
// cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl; |
| 2549 |
|
// cout << " time "<< GetOrbitalInfo()->absTime << endl; |
| 2550 |
|
// cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl; |
| 2551 |
|
|
| 2552 |
if( !GetOrbitalInfo() ){ |
if( !GetOrbitalInfo() ){ |
| 2553 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl; |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl; |
| 2554 |
return 0; |
return 0; |
| 2568 |
Int_t answer = 0; |
Int_t answer = 0; |
| 2569 |
Int_t shift =0; |
Int_t shift =0; |
| 2570 |
do{ |
do{ |
| 2571 |
// if(shift>0){ |
if(shift>0){ |
| 2572 |
// cout << " level0 <--> level2 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" )"<<endl; |
cout << " level0 <--> level2 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" )"<<endl; |
| 2573 |
// } |
} |
| 2574 |
answer = GetYodaTree()->GetEntry(quellagiusta+shift); |
answer = l0_tree->GetEntry(quellagiusta+shift+prevshift); |
| 2575 |
shift++; |
shift++; |
| 2576 |
if( !GetEventHeader() ){ |
if( !GetEventHeader() ){ |
| 2577 |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl; |
cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl; |
| 2578 |
return 0; |
return 0; |
| 2579 |
} |
} |
| 2580 |
// if( (quellagiusta+shift) == GetYodaTree()->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl; |
// if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl; |
| 2581 |
}while( ( (UInt_t)(GetOrbitalInfo()->OBT) != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || GetOrbitalInfo()->pkt_num != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta+shift) < (UInt_t)(GetYodaTree()->GetEntries()) ); |
// cout << " GetOrbitalInfo()->OBT "<< GetOrbitalInfo()->OBT << endl; |
| 2582 |
|
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
| 2583 |
|
// cout << " GetOrbitalInfo()->pkt_num "<< GetOrbitalInfo()->pkt_num << endl; |
| 2584 |
|
// cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
| 2585 |
|
if ( prevshift != 0 && (quellagiusta+shift) == GetYodaTree()->GetEntries() ){ |
| 2586 |
|
prevshift = 0; |
| 2587 |
|
shift = -1; |
| 2588 |
|
}; |
| 2589 |
|
|
| 2590 |
|
}while( ( GetOrbitalInfo()->OBT != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || GetOrbitalInfo()->pkt_num != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta+shift) < GetYodaTree()->GetEntries() ); |
| 2591 |
|
|
| 2592 |
|
if ( (quellagiusta+shift) == GetYodaTree()->GetEntries() ) cout << " Big trouble here, no such event in Level0 data! " <<endl; |
| 2593 |
|
|
| 2594 |
// cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl; |
// cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl; |
| 2595 |
// return GetYodaTree()->GetEntry(quellagiusta); |
// return GetYodaTree()->GetEntry(quellagiusta); |
| 2596 |
|
if ( shift > 1 ) prevshift += (shift-1); |
| 2597 |
|
|
| 2598 |
return answer; |
return answer; |
| 2599 |
|
|
| 2600 |
} |
} |
| 2601 |
|
|
| 2602 |
|
|