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(); |
1537 |
irun = 0; |
irun = 0; |
1538 |
run->GetEntry(irun); |
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); |
return(true); |
1543 |
}; |
}; |
1544 |
|
|
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 |
|
|
1561 |
// |
// |
1562 |
if |
if ( irun == oldrun || irun >= run->GetEntries() ) return(false); |
|
( irun == oldrun || irun >= run->GetEntries() ) return(false); |
|
1563 |
// |
// |
1564 |
// 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); |
1565 |
// |
// |
2393 |
// a problem if you don't check the return code of getentry. |
// 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 |
//------------------------------- |
//------------------------------- |
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){ |
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: |
2516 |
cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl; |
2517 |
} |
} |
2518 |
|
|
2519 |
TrkParams::SetCalib(run_obj,dbc); |
if ( TRK0 ) TrkParams::SetCalib(run_obj,dbc); |
2520 |
|
|
2521 |
|
|
2522 |
// cout << l0_tree << endl; |
// cout << l0_tree << endl; |
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 = l0_tree->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; |
2582 |
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
// cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl; |
2583 |
// cout << " GetOrbitalInfo()->pkt_num "<< GetOrbitalInfo()->pkt_num << endl; |
// cout << " GetOrbitalInfo()->pkt_num "<< GetOrbitalInfo()->pkt_num << endl; |
2584 |
// cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl; |
// 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() ); |
}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 |
|
|