/[PAMELA software]/PamelaLevel2/src/PamLevel2.cpp
ViewVC logotype

Diff of /PamelaLevel2/src/PamLevel2.cpp

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.25 by mocchiut, Thu Mar 15 13:42:36 2007 UTC revision 1.37 by mocchiut, Wed Mar 28 15:29:14 2007 UTC
# Line 85  void PamTrack::Delete(){ Line 85  void PamTrack::Delete(){
85  //  //
86  //--------------------------------------  //--------------------------------------
87  /**  /**
88   * Constructor   * Default Constructor
89   */   */
90  PamLevel2::PamLevel2(){  PamLevel2::PamLevel2(){
91      Initialize();
92    };
93    
94    /**
95     * Constructor with given dir, list and detectors
96     */
97    PamLevel2::PamLevel2(TString ddir,TString list,TString detlist){
98      Initialize();
99      GetPamTree(GetListOfLevel2Files(ddir,list),detlist);
100      GetRunTree(GetListOfLevel2Files(ddir,list));
101    };
102    
103    /**
104     * Constructor with given dir and list
105     */
106    PamLevel2::PamLevel2(TString ddir,TString list){
107      Initialize();
108      GetPamTree(GetListOfLevel2Files(ddir,list),"");
109      GetRunTree(GetListOfLevel2Files(ddir,list));
110    };
111    
112    
113    void PamLevel2::Initialize(){
114                    
115  //     trk2_obj  = TrkLevel2::GetTrkLevel2();  //     trk2_obj  = TrkLevel2::GetTrkLevel2();
116  //     trk1_obj  = TrkLevel1::GetTrkLevel1();  //     trk1_obj  = TrkLevel1::GetTrkLevel1();
# Line 103  PamLevel2::PamLevel2(){ Line 126  PamLevel2::PamLevel2(){
126            
127      h0_obj    = 0;      h0_obj    = 0;
128      trk0_obj  = 0;      trk0_obj  = 0;
129        calo0_obj  = 0;
130    
131      trk2_obj  = 0;      trk2_obj  = 0;
132      trk1_obj  = 0;      trk1_obj  = 0;
# Line 118  PamLevel2::PamLevel2(){ Line 142  PamLevel2::PamLevel2(){
142    
143      run_obj   = 0;//new GL_RUN();      run_obj   = 0;//new GL_RUN();
144      soft_obj   = 0;// Emiliano      soft_obj   = 0;// Emiliano
145      irun = -1;      irun = -1LL;
146      runfirstentry = 0ULL;      runfirstentry = 0LL;
147      runlastentry = 0ULL;      runlastentry = 0LL;
148    
149      l0_file = NULL;      l0_file = NULL;
150      l0_tree = NULL;      l0_tree = NULL;
151      iroot   = -1;      iroot   = -1;
152      dbc     = 0;      dbc     = 0;
153    
154        prevshift = 0;
155            
     irun = -1;  
156      run_tree = NULL;      run_tree = NULL;
157      run_tree_clone = NULL;      run_tree_clone = NULL;
158      sel_tree = NULL;      sel_tree = NULL;
159      sel_tree_clone = NULL;      sel_tree_clone = NULL;
160            
161      irunentry = -1;      irunentry = -1LL;
162      pam_tree = NULL;      pam_tree = NULL;
163      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;
164    
# Line 175  PamLevel2::PamLevel2(){ Line 200  PamLevel2::PamLevel2(){
200    
201      tsorted=0;      tsorted=0;
202      timage=0;      timage=0;
203        
204        howtosort = "+CAL+TOF";
205        //howtosort = "+TOF";
206        sortthr = 100.;
207    
208  };  };
209  /**  /**
# Line 188  void PamLevel2::Delete(){ Line 217  void PamLevel2::Delete(){
217  //    cout << "void PamLevel2::Clear()"<<endl;  //    cout << "void PamLevel2::Clear()"<<endl;
218      if(h0_obj)   delete h0_obj;      if(h0_obj)   delete h0_obj;
219      if(trk0_obj) delete trk0_obj;            if(trk0_obj) delete trk0_obj;      
220        if(calo0_obj) delete calo0_obj;    
221      if(trk1_obj) delete trk1_obj;            if(trk1_obj) delete trk1_obj;      
222      if(trk2_obj) delete trk2_obj;      if(trk2_obj) delete trk2_obj;
223      if(trkh_obj) delete trkh_obj;      if(trkh_obj) delete trkh_obj;
# Line 215  void PamLevel2::Delete(){ Line 245  void PamLevel2::Delete(){
245      }      }
246            
247      if(l0_file)l0_file->Close();      if(l0_file)l0_file->Close();
248      if(pam_tree)pam_tree->Delete();;      //    if(pam_tree)pam_tree->Delete();;
249    
250      if ( pam_tree ){
251        //
252        // 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...
253        //
254        TList *temp = pam_tree->GetListOfFriends();
255        TList *contents  = new TList; // create chain friend list
256        contents->SetOwner();
257        TIter next(temp);
258        TChain *questo = 0;
259        while ( (questo = (TChain*) next()) ){
260          TString name =  questo->GetName();
261          contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list
262        };
263        //
264        // deleting the main chain
265        //
266        pam_tree->Delete();
267        //
268        // deleting the friends...
269        //
270        TIter next2(contents);
271        TChain *questa = 0;
272        while ( questa = (TChain*)next2() ){
273          TString name =  questa->GetName();
274          questa->Delete();      
275          questa=NULL;
276        };
277        //
278      };
279      pam_tree = NULL;
280    
281      if(run_tree)run_tree->Delete();;      if(run_tree)run_tree->Delete();;
282      if(sel_tree)sel_tree->Delete();;      if(sel_tree)sel_tree->Delete();;
283      for(Int_t i=0; i<NCLONES; i++ )if(pam_tree_clone[i])pam_tree_clone[i]->Delete();;      for(Int_t i=0; i<NCLONES; i++ )if(pam_tree_clone[i])pam_tree_clone[i]->Delete();;
# Line 241  void PamLevel2::Clear(){ Line 303  void PamLevel2::Clear(){
303  //    if(soft_obj) soft_obj->Clear();  //    if(soft_obj) soft_obj->Clear();
304    
305      if(h0_obj)   h0_obj->Clear();            if(h0_obj)   h0_obj->Clear();      
306      if(trk0_obj) trk0_obj->Clear();      //    if(trk0_obj) trk0_obj->Clear();  
307        if(calo0_obj) calo0_obj->Clear();  
308      if(trk1_obj) trk1_obj->Clear();          if(trk1_obj) trk1_obj->Clear();    
309      if(trk2_obj) trk2_obj->Clear();      if(trk2_obj) trk2_obj->Clear();
310      if(trkh_obj) trkh_obj->Clear();      if(trkh_obj) trkh_obj->Clear();
311      if(calo1_obj)calo1_obj->Clear();      if(calo1_obj)calo1_obj->Clear();
312      if(calo2_obj)calo2_obj->Clear();      if(calo2_obj)calo2_obj->Clear();
# Line 263  void PamLevel2::Clear(){ Line 326  void PamLevel2::Clear(){
326      if(timage){      if(timage){
327          timage->Delete();          timage->Delete();
328      }      }
329        };
330    
331    void PamLevel2::Reset(){
332      //
333      // First of all clear everything
334      //
335      Clear();
336      //
337      // close and reset chains and pointers
338      //    
339      if ( pam_tree ){
340        //
341        // 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...
342        //
343        TList *temp = pam_tree->GetListOfFriends();
344        TList *contents  = new TList; // create chain friend list
345        contents->SetOwner();
346        TIter next(temp);
347        TChain *questo = 0;
348        while ( (questo = (TChain*) next()) ){
349          TString name =  questo->GetName();
350          contents->Add((TChain*)gROOT->FindObject(name.Data()));// add object to the list
351        };
352        //
353        // deleting the main chain
354        //
355        pam_tree->Delete();
356        //
357        // deleting the friends...
358        //
359        TIter next2(contents);
360        TChain *questa = 0;
361        while ( questa = (TChain*)next2() ){
362          TString name =  questa->GetName();
363          questa->Delete();      
364          questa=NULL;
365        };
366        //
367      };
368      pam_tree = NULL;
369      //
370      if(run_tree)run_tree->Delete();;
371      run_tree = NULL;
372      if(sel_tree)sel_tree->Delete();;
373      sel_tree = NULL;
374      //
375      // Close file
376      //
377      if(l0_file)l0_file->Close("R");
378      l0_file = NULL;
379      //
380      h0_obj    = 0;
381      trk0_obj  = 0;
382      calo0_obj  = 0;
383      //
384      trk2_obj  = 0;
385      trk1_obj  = 0;
386      trkh_obj  = 0;
387      calo1_obj = 0;
388      calo2_obj = 0;
389      tof_obj   = 0;
390      trig_obj  = 0;
391      s4_obj    = 0;
392      nd_obj    = 0;
393      ac_obj    = 0;
394      orb_obj   = 0;
395      //
396      // Reset run pointers
397      //
398      run_obj   = 0;//new GL_RUN();
399      soft_obj   = 0;// Emiliano
400      irun = -1;
401      runfirstentry = 0ULL;
402      runlastentry = 0ULL;    
403      //
404  };  };
405    
406    
# Line 460  PamTrack* PamLevel2::GetStoredTrack(Int_ Line 597  PamTrack* PamLevel2::GetStoredTrack(Int_
597  }  }
598  //--------------------------------------  //--------------------------------------
599  //  //
600    
601    /**
602     * 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.
603     **/
604    void PamLevel2::SortTracks(TString how){
605      printf(" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n",how.Data());
606      howtosort = how;  
607      SortTracks();
608    };
609    
610  //  //
611  //--------------------------------------  //--------------------------------------
612  /**  /**
# Line 473  PamTrack* PamLevel2::GetStoredTrack(Int_ Line 620  PamTrack* PamLevel2::GetStoredTrack(Int_
620   *   *
621   * 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).
622   */   */
623  void PamLevel2::SortTracks(TString how){  void PamLevel2::SortTracks(){
624      TString how = howtosort;
625    
626  //    cout <<" PamLevel2::SortTracks(TString how) "<<endl;    //    cout <<" PamLevel2::SortTracks(TString how) "<<endl;
627      if( !trk2_obj ){    if( !trk2_obj ){
628          cout << "void PamLevel2::SortTracks(TString how):  TrkLevel2 not loaded !!!";      cout << "void PamLevel2::SortTracks():  TrkLevel2 not loaded !!!";
629          return;      return;
630      };    };
631  //    cout << "call SortTracs() "<<endl;    //    cout << "call SortTracs() "<<endl;
632    //Save current Object count    //Save current Object count
633      Int_t ObjectNumber = TProcessID::GetObjectCount();    Int_t ObjectNumber = TProcessID::GetObjectCount();
634    
635  //    cout << "ObjectNumber  "<<ObjectNumber <<endl;    //    cout << "ObjectNumber  "<<ObjectNumber <<endl;
636    
637  //     if(!sorted_tracks)sorted_tracks = new TRefArray();    //     if(!sorted_tracks)sorted_tracks = new TRefArray();
638  //     sorted_tracks->Clear();    //     sorted_tracks->Clear();
639  //    sorted_tracks.Clear();    //    sorted_tracks.Clear();
640    
641      if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks());    if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks());
642      tsorted->Delete();    tsorted->Delete();
643      TClonesArray &ttsorted = *tsorted;    TClonesArray &ttsorted = *tsorted;
644      if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks());    if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks());
645      timage->Delete();    timage->Delete();
646      TClonesArray &ttimage = *timage;    TClonesArray &ttimage = *timage;
647    
648    
649      // loop over the tracks sorted by the tracker    // loop over the tracks sorted by the tracker
650      Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase);    Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase);
651      Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase);    Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase);
652      Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase);    Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase);
653            
654      if( !CAL2 &&  use_CAL) use_CAL = false;    if( !CAL2 &&  use_CAL) use_CAL = false;
655      if( !TOF &&  use_TOF) use_TOF = false;    if( !TOF &&  use_TOF) use_TOF = false;
656            
657      if( !TRK2 ){    if( !TRK2 ){
658  //      cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl;      //  cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl;
659          return;      return;
660      };    };
661    
662      //   cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl;    //   cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl;
663            
664      for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){    for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){
665                    
666          TrkTrack   *ts = 0;      TrkTrack   *ts = 0;
667          CaloTrkVar *cs = 0;      CaloTrkVar *cs = 0;
668          ToFTrkVar  *os = 0;      ToFTrkVar  *os = 0;
669                    
670          // get tracker tracks      // get tracker tracks
671          TrkTrack   *tp = trk2_obj->TrkLevel2::GetTrack(i);                    //tracker      TrkTrack   *tp = trk2_obj->TrkLevel2::GetTrack(i);                    //tracker
672          CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo());      CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo());
673          ToFTrkVar  *op = GetToFStoredTrack(tp->GetSeqNo());      ToFTrkVar  *op = GetToFStoredTrack(tp->GetSeqNo());
674    
675          TrkTrack   *ti = 0;              //tracker (image)      TrkTrack   *ti = 0;              //tracker (image)
676          CaloTrkVar *ci = 0;      CaloTrkVar *ci = 0;
677          ToFTrkVar  *oi = 0;      ToFTrkVar  *oi = 0;
678  //      cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl;      //  cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl;
679          // if track has an image, check image selection      // if track has an image, check image selection
680          if(tp->HasImage()){      if(tp->HasImage()){
681                            
682              ti = trk2_obj->TrkLevel2::GetTrackImage(i);              //tracker (image)        ti = trk2_obj->TrkLevel2::GetTrackImage(i);              //tracker (image)
683              ci = GetCaloStoredTrack(ti->GetSeqNo());        ci = GetCaloStoredTrack(ti->GetSeqNo());
684              oi = GetToFStoredTrack(ti->GetSeqNo());        oi = GetToFStoredTrack(ti->GetSeqNo());
685                            
686  //          cout << "its image "<<i << " "<<hex<< ti <<dec<< endl;        //            cout << "its image "<<i << " "<<hex<< ti <<dec<< endl;
687    
688              //assign starting scores        //assign starting scores
689              Int_t tp_score = 0;  //main track sorted by the tracker        Int_t tp_score = 0;  //main track sorted by the tracker
690              Int_t ti_score = 0;  //image track        Int_t ti_score = 0;  //image track
691                            
692              // ------------------------        // ------------------------
693              // calorimeter check        // calorimeter check
694              // ------------------------        // ------------------------
695              // check the Y spatial residual on the first calorimeter plane        // check the Y spatial residual on the first calorimeter plane
696              // (cut on calorimeter variables from Emiliano)        // (cut on calorimeter variables from Emiliano)
697              if( use_CAL && !calo2_obj ){        if( use_CAL && !calo2_obj ){
698                  cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but CaloLevel2 not loaded !!!";          cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but CaloLevel2 not loaded !!!";
699                  return;          return;
700              };        };
701              if(        if(
702                  use_CAL            &&           use_CAL            &&
703                  calo2_obj->npcfit[1] > 15     &&   //no. of fit planes on Y view           calo2_obj->npcfit[1] > 5     &&   //no. of fit planes on Y view
704                  calo2_obj->varcfit[1] < 1000. &&  //fit variance on Y view           calo2_obj->varcfit[1] < 1000. &&  //fit variance on Y view
705                  true){           cp && ci &&
706             true){
707    
708                                    
709                  Float_t resy_p = cp->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_p < 0)resy_p= - resy_p;          Float_t resy_p = cp->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_p < 0)resy_p= - resy_p;
710                  Float_t resy_i = ci->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_i < 0)resy_i= - resy_i;          Float_t resy_i = ci->tbar[0][1] - calo2_obj->cbar[0][1]; if(resy_i < 0)resy_i= - resy_i;
711                                    
712                  if(resy_p <= resy_i) tp_score++;          if(resy_p <= resy_i) tp_score++;
713                  else                 ti_score++;          else                 ti_score++;
714            
715            //      cout << "CALO "<<tp_score<<ti_score<<endl;
716    
717  //              cout << "CALO "<<tp_score<<ti_score<<endl;        };
718          // ------------------------
719          // TOF check
720          // ------------------------          
721          // check the number of hit pmts along the track
722          // on S12 S21 and S32, where paddles are parallel to Y axis
723          if( use_TOF && !tof_obj ){
724            cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but ToFLevel2 not loaded !!!";
725            return;
726          };
727          if( use_TOF && op && oi ){
728                    
729            //
730            Float_t sen = 0.;
731            for (Int_t ih=0; ih < op->npmtadc; ih++){
732              Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
733              if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (op->dedx).At(ih);
734            };
735            for (Int_t ih=0; ih < oi->npmtadc; ih++){
736              Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
737              if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (oi->dedx).At(ih);
738            };
739            //
740            if (  sen >= sortthr ){
741              //printf(" IS A NUCLEUS! en = %f \n",sen);
742              //
743              // is a nucleus use a different algorithm
744              //
745              Int_t nz = 6; Float_t zin[6];                                          // << define TOF z-coordinates
746              for(Int_t ip=0; ip<nz; ip++)
747                zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip));     // << read ToF plane z-coordinates
748              Trajectory *tr = new Trajectory(nz,zin);
749              //
750              Int_t nphit_p =0;
751              Int_t nphit_i =0;
752              Float_t enhit_p = 0.;
753              Float_t enhit_i = 0.;
754              //
755              for (Int_t ih=0; ih < op->npmtadc; ih++){
756                Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
757                if(pl == 1 || pl == 2 || pl == 5){
758                  nphit_p++;
759                  enhit_p += (op->dedx).At(ih);
760                };
761              };
762              //
763              tp->DoTrack2(tr);
764              //
765              if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){
766                for (Int_t ih=0; ih < op->npmtadc; ih++){
767                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
768                  if(pl == 0){
769                    nphit_p++;
770                    enhit_p += (op->dedx).At(ih);
771                  };
772                };
773              };
774              if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){
775                for (Int_t ih=0; ih < op->npmtadc; ih++){
776                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
777                  if(pl == 3){
778                    nphit_p++;
779                    enhit_p += (op->dedx).At(ih);
780                  };
781                };
782              };
783              if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){
784                for (Int_t ih=0; ih < op->npmtadc; ih++){
785                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
786                  if(pl == 4){
787                    nphit_p++;
788                    enhit_p += (op->dedx).At(ih);
789                  };
790                };
791              };
792    
793              for (Int_t ih=0; ih < oi->npmtadc; ih++){
794                Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
795                if(pl == 1 || pl == 2 || pl == 5){
796                  nphit_i++;        
797                  enhit_i += (op->dedx).At(ih);
798              };              };
799              // ------------------------            };
800              // TOF check            //
801              // ------------------------                ti->DoTrack2(tr);
802              // check the number of hit pmts along the track            //
803              // on S12 S21 and S32, where paddles are parallel to Y axis            if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){
804              if( use_TOF && !tof_obj ){              for (Int_t ih=0; ih < oi->npmtadc; ih++){
805                  cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but ToFLevel2 not loaded !!!";                Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
806                  return;                if(pl == 0){
807                    nphit_i++;
808                    enhit_i += (op->dedx).At(ih);
809                  };
810              };              };
811              if( use_TOF ){            };
812              if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){
813                for (Int_t ih=0; ih < oi->npmtadc; ih++){
814                  Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
815                  if(pl == 3){
816                    nphit_i++;
817                    enhit_i += (op->dedx).At(ih);
818                  };
819                };
820              };
821              if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){
822                for (Int_t ih=0; ih < oi->npmtadc; ih++){
823                  Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
824                  if(pl == 4){
825                    nphit_i++;
826                    enhit_i += (op->dedx).At(ih);
827                  };
828                };
829              };            
830    
831                                    
832                  Int_t nphit_p =0;            if(
833                  Int_t nphit_i =0;               use_TOF            &&
834                 (nphit_p+nphit_i) !=0 &&  
835                 true){
836                        
837                //      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);
838                //      printf(" score p %i score i %i \n",tp_score,ti_score);
839                //            if( enhit_p > enhit_i ) tp_score++;
840                //            if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++;
841                if ( nphit_p > nphit_i ) tp_score++;
842                if ( nphit_p < nphit_i ) ti_score++;
843                if ( nphit_p == nphit_i ){
844                  if ( enhit_p > enhit_i ) tp_score++;
845                  else ti_score++;
846                };
847                //      printf(" dopo score p %i score i %i \n",tp_score,ti_score);
848              };
849              delete tr;
850              //
851            } else {
852              //
853              // NOT a NUCLEUS
854              //
855              //printf(" NOT a NUCLEUS! en = %f \n",sen);
856    
857              Int_t nphit_p =0;
858              Int_t nphit_i =0;
859                                    
860                                    
861  /*                              cout << "track: npmtadc "<< op->npmtadc << endl;            /*                            cout << "track: npmtadc "<< op->npmtadc << endl;
862                                  cout << "track: npmttdc "<< op->npmttdc << endl;              cout << "track: npmttdc "<< op->npmttdc << endl;
863                                  cout << "image: npmtadc "<< oi->npmtadc << endl;              cout << "image: npmtadc "<< oi->npmtadc << endl;
864                                  cout << "image: npmttdc "<< oi->npmttdc << endl;*/              cout << "image: npmttdc "<< oi->npmttdc << endl;*/
865                                    
866                  for (Int_t ih=0; ih < op->npmtadc; ih++){            for (Int_t ih=0; ih < op->npmtadc; ih++){
867                      Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );              Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
868                      if(pl == 1 || pl == 2 || pl == 5)nphit_p++;              if(pl == 1 || pl == 2 || pl == 5)nphit_p++;
869                  };            };
870                                    
871                  for (Int_t ih=0; ih < oi->npmtadc; ih++){            for (Int_t ih=0; ih < oi->npmtadc; ih++){
872                      Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );              Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
873                      if(pl == 1 || pl == 2 || pl == 5)nphit_i++;              if(pl == 1 || pl == 2 || pl == 5)nphit_i++;
874                  };            };
875                                    
876                  if(            if(
877                      use_TOF            &&               use_TOF            &&
878                      (nphit_p+nphit_i) !=0 &&                   (nphit_p+nphit_i) !=0 &&  
879                      true){               true){
880                                            
881                      if( nphit_p >= nphit_i) tp_score++;              if( nphit_p >= nphit_i) tp_score++;
882                      else ti_score++;              else ti_score++;
883                  };            };
884  //              cout << "TOF "<<tp_score<<ti_score<<endl;          };
885              };          //      cout << "TOF "<<tp_score<<ti_score<<endl;
886              if(tp_score == ti_score) use_TRK = true;        };
887              // ------------------------        if(tp_score == ti_score) use_TRK = true;
888              // tracker check        // ------------------------
889              // ------------------------        // tracker check
890              // chi**2 difference is not always large enough to distinguish among        // ------------------------
891              // the real track and its image.        // chi**2 difference is not always large enough to distinguish among
892              // Tracker check will be applied always when calorimeter and tof information is ambiguous.        // the real track and its image.
893              if(use_TRK){        // Tracker check will be applied always when calorimeter and tof information is ambiguous.
894                  if(      tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ;        if(use_TRK){
895                  else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ;          if(      tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ;
896  //              cout << "TRK "<<tp_score<<ti_score<<endl;          else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ;
897              };          //      cout << "TRK "<<tp_score<<ti_score<<endl;
898          };
899                            
900              // ------------------------        // ------------------------
901              // the winner is....        // the winner is....
902              // ------------------------            // ------------------------          
903              if      (tp_score > ti_score) {        if      (tp_score > ti_score) {
904  //              ts = tp;//the track sorted by the tracker!!          //              ts = tp;//the track sorted by the tracker!!
905  //              cs = cp;          //              cs = cp;
906  //              os = op;          //              os = op;
907              }else if (tp_score < ti_score) {          //      cout << "It's primary!" << endl;
908                  ts = ti;//its image!!  
909                  cs = ci;        }else if (tp_score < ti_score) {
910                  os = oi;  
911            //      cout << "It's image!" << endl;
912                  ti = tp;//its image!!  
913                  ci = cp;          ts = ti;//its image!!
914                  oi = op;          cs = ci;
915            os = oi;
916                  tp = ts;//its image!!  
917                  cp = cs;          ti = tp;//its image!!
918                  op = os;          ci = cp;
919            oi = op;
920    
921            tp = ts;//its image!!
922            cp = cs;
923            op = os;
924    
925                                    
926              }else {        }else {
927  //              ts = tp;          //              ts = tp;
928  //              cs = cp;          //              cs = cp;
929  //              os = op;          //              os = op;
930  //                              cout << "Warning - track image ambiguity not solved" << endl;          cout << "Warning - track image ambiguity not solved" << endl;
931  //                              cout << ts->GetNtot() << " "<< ts->chi2 << " " << npcfit[1] << " "<< nphit_p << endl;          //                              cout << ts->GetNtot() << " "<< ts->chi2 << " " << npcfit[1] << " "<< nphit_p << endl;
932              };        };
933                            
934          }else{      }else{
935  //          ts = tp;        //            ts = tp;
936  //          cs = cp;        //            cs = cp;
937  //          os = op;        //            os = op;
938          };      };
939                    
940  //      cout <<" SortTracks() "<<i<<" -- "<<ts<<endl;      //  cout <<" SortTracks() "<<i<<" -- "<<ts<<endl;
941  //      sorted_tracks->Add(ts);//save the track in the sorted array      //  sorted_tracks->Add(ts);//save the track in the sorted array
942  //      sorted_tracks.Add(ts);//save the track in the sorted array      //  sorted_tracks.Add(ts);//save the track in the sorted array
943  //      sorted_tracks.Add(tp);//save the track in the sorted array      //  sorted_tracks.Add(tp);//save the track in the sorted array
944  //      cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl;      //  cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl;
945  //      cout<<"o "<<tp<<endl;      //  cout<<"o "<<tp<<endl;
946  //      cout<<"o "<<cp<<endl;      //  cout<<"o "<<cp<<endl;
947  //      cout<<"o "<<op<<endl;      //  cout<<"o "<<op<<endl;
948          new(ttsorted[i]) PamTrack(tp,cp,op);      new(ttsorted[i]) PamTrack(tp,cp,op);
949          new(ttimage[i])  PamTrack(ti,ci,oi);      new(ttimage[i])  PamTrack(ti,ci,oi);
950      };    };
951    
952      if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){    if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){
953          cout << "void PamLevel2::SortTracks(TString how): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl;      cout << "void PamLevel2::SortTracks(): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl;
954          tsorted->Delete(); tsorted=0;      tsorted->Delete(); tsorted=0;
955          timage->Delete(); timage=0;          timage->Delete(); timage=0;
956      }    }
957    
958      //Restore Object count    //Restore Object count
959      //To save space in the table keeping track of all referenced objects    //To save space in the table keeping track of all referenced objects
960      //We reset the object count to what it was at the beginning of the event.    //We reset the object count to what it was at the beginning of the event.
961      TProcessID::SetObjectCount(ObjectNumber);    TProcessID::SetObjectCount(ObjectNumber);
962            
963  };  };
964  //--------------------------------------  //--------------------------------------
# Line 699  void PamLevel2::SortTracks(TString how){ Line 982  void PamLevel2::SortTracks(TString how){
982  TClonesArray *PamLevel2::GetTracks(){  TClonesArray *PamLevel2::GetTracks(){
983    
984  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
985      SortTracks("+CAL+TOF");      SortTracks();
986  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
987    
988      return tsorted;      return tsorted;
# Line 718  PamTrack *PamLevel2::GetTrack(int it){ Line 1001  PamTrack *PamLevel2::GetTrack(int it){
1001    
1002  //    if(!trk2_obj) return 0;  //    if(!trk2_obj) return 0;
1003                    
1004  // //  *-*-*-*-*-*-*-*-*-*-*-*-*  // //  *-*-*-*+-*-*-*-*-*-*-*-*-*
1005  //     SortTracks("+CAL+TOF");  //     SortTracks("+CAL+TOF");
1006  // //  *-*-*-*-*-*-*-*-*-*-*-*-*  // //  *-*-*-*-*-*-*-*-*-*-*-*-*
1007  // //    if(!sorted_tracks)return 0;  // //    if(!sorted_tracks)return 0;
# Line 737  PamTrack *PamLevel2::GetTrack(int it){ Line 1020  PamTrack *PamLevel2::GetTrack(int it){
1020    
1021  //    cout << "PamLevel2::GetTrack(int it) "<<endl;  //    cout << "PamLevel2::GetTrack(int it) "<<endl;
1022  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1023      SortTracks("+CAL+TOF");      SortTracks();
1024  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1025      if(!tsorted)return 0;      if(!tsorted)return 0;
1026      if(!tsorted->GetEntries())return 0;      if(!tsorted->GetEntries())return 0;
# Line 794  PamTrack *PamLevel2::GetTrackImage(int i Line 1077  PamTrack *PamLevel2::GetTrackImage(int i
1077    
1078    
1079  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1080      SortTracks("+CAL+TOF");      SortTracks();
1081  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1082      if(!timage)return 0;      if(!timage)return 0;
1083      if(!timage->GetEntries())return 0;      if(!timage->GetEntries())return 0;
# Line 831  TTree *PamLevel2::GetPamTree(TFile *f, T Line 1114  TTree *PamLevel2::GetPamTree(TFile *f, T
1114    
1115  //     if( !detlist.IsNull() ) SetWhichTrees(detlist);  //     if( !detlist.IsNull() ) SetWhichTrees(detlist);
1116  //     else                    GetWhichTrees(f);  //     else                    GetWhichTrees(f);
1117          if ( pam_tree ){
1118        printf("WARNING: TTree *PamLevel2::GetPamTree(TFile *fl, TString detlist) -- pam_tree already exists!\n ");
1119        return pam_tree;
1120      };
1121      //
1122    
1123      cout << "TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ) -- obsolte "<<endl;      cout << "TTree *PamLevel2::GetPamTree(TFile *f, TString detlist ) -- obsolte "<<endl;
1124    
1125      SetWhichTrees(detlist);      SetWhichTrees(detlist);
# Line 907  TTree *PamLevel2::GetPamTree(TFile *f, T Line 1195  TTree *PamLevel2::GetPamTree(TFile *f, T
1195      if(R && TRG) {      if(R && TRG) {
1196          R->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2"));          R->SetBranchAddress("TrigLevel2", GetPointerTo("TrigLevel2"));
1197          cout << "Trigger      : set branch address TrigLevel2"<<endl;          cout << "Trigger      : set branch address TrigLevel2"<<endl;
1198          if(!Trout)Trout=O;          if(!Trout)Trout=R;
1199          else Trout->AddFriend(R);          else Trout->AddFriend(R);
1200      }else{      }else{
1201          cout << "Trigger      : missing tree"<<endl;          cout << "Trigger      : missing tree"<<endl;
# Line 917  TTree *PamLevel2::GetPamTree(TFile *f, T Line 1205  TTree *PamLevel2::GetPamTree(TFile *f, T
1205      if(S && S4) {      if(S && S4) {
1206          S->SetBranchAddress("S4Level2", GetPointerTo("S4Level2"));          S->SetBranchAddress("S4Level2", GetPointerTo("S4Level2"));
1207          cout << "S4           : set branch address S4Level2"<<endl;          cout << "S4           : set branch address S4Level2"<<endl;
1208          if(!Trout)Trout=O;          if(!Trout)Trout=S;
1209          else Trout->AddFriend(S);          else Trout->AddFriend(S);
1210      }else{      }else{
1211          cout << "S4           : missing tree"<<endl;          cout << "S4           : missing tree"<<endl;
# Line 927  TTree *PamLevel2::GetPamTree(TFile *f, T Line 1215  TTree *PamLevel2::GetPamTree(TFile *f, T
1215      if(N && ND) {      if(N && ND) {
1216          N->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2"));          N->SetBranchAddress("NDLevel2", GetPointerTo("NDLevel2"));
1217          cout << "NeutronD     : set branch address NDLevel2"<<endl;          cout << "NeutronD     : set branch address NDLevel2"<<endl;
1218          if(!Trout)Trout=O;          if(!Trout)Trout=N;
1219          else Trout->AddFriend(N);          else Trout->AddFriend(N);
1220      }else{      }else{
1221          cout << "NeutronD     : missing tree"<<endl;          cout << "NeutronD     : missing tree"<<endl;
# Line 937  TTree *PamLevel2::GetPamTree(TFile *f, T Line 1225  TTree *PamLevel2::GetPamTree(TFile *f, T
1225      if(A && AC) {      if(A && AC) {
1226          A->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2"));          A->SetBranchAddress("AcLevel2", GetPointerTo("AcLevel2"));
1227          cout << "Anticounter  : set branch address AcLevel2"<<endl;          cout << "Anticounter  : set branch address AcLevel2"<<endl;
1228          if(!Trout)Trout=O;          if(!Trout)Trout=A;
1229          else Trout->AddFriend(A);          else Trout->AddFriend(A);
1230      }else{      }else{
1231          cout << "Anticounter  : missing tree"<<endl;          cout << "Anticounter  : missing tree"<<endl;
# Line 947  TTree *PamLevel2::GetPamTree(TFile *f, T Line 1235  TTree *PamLevel2::GetPamTree(TFile *f, T
1235      if(B && ORB) {      if(B && ORB) {
1236          B->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo"));          B->SetBranchAddress("OrbitalInfo", GetPointerTo("OrbitalInfo"));
1237          cout << "OrbitalInfo  : set branch address OrbitalInfo"<<endl;          cout << "OrbitalInfo  : set branch address OrbitalInfo"<<endl;
1238          if(!Trout)Trout=O;          if(!Trout)Trout=B;
1239          else Trout->AddFriend(B);          else Trout->AddFriend(B);
1240      }else{      }else{
1241          cout << "OrbitalInfo  : missing tree"<<endl;          cout << "OrbitalInfo  : missing tree"<<endl;
# Line 968  TTree *PamLevel2::GetPamTree(TFile *f, T Line 1256  TTree *PamLevel2::GetPamTree(TFile *f, T
1256      };      };
1257            
1258      cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl;      cout<<endl<<" Number of entries: "<<Trout->GetEntries()<<endl<<endl;
       
     pam_tree = (TChain*)Trout;  
1259    
1260        pam_tree = (TChain*)Trout;
1261        
1262      return Trout;      return Trout;
1263            
1264  }  }
# Line 989  TList*  PamLevel2::GetListOfLevel2Files( Line 1277  TList*  PamLevel2::GetListOfLevel2Files(
1277                    
1278      TString wdir = gSystem->WorkingDirectory();      TString wdir = gSystem->WorkingDirectory();
1279            
1280      if(ddir=="")ddir = wdir;      //    if(ddir=="")ddir = wdir;
1281  //      TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir);  //      TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir);
1282      cout << "Level2 data directory : "<<  ddir << endl;      if ( ddir != ""){
1283              cout << "Level2 data directory : "<<  ddir << endl;
1284        } else {
1285          cout << "Level2 data directory not given as input: trying to evaluate from list or taking working directory " << endl;
1286        };
1287      TList *contents  = new TList; // create output list      TList *contents  = new TList; // create output list
1288      contents->SetOwner();      contents->SetOwner();
1289            
1290  //    char *fullpath;  //    char *fullpath;
1291  //    const char *fullpath;  //    const char *fullpath;
1292            
1293      // if input file list is given:          // if no input file list is given:  
1294      if ( flisttxt != "" ){      if ( flisttxt != "" ){
1295                    
1296  //      if( !gSystem->IsFileInIncludePath(flisttxt,&fullpath) ){          //      if( !gSystem->IsFileInIncludePath(flisttxt,&fullpath) ){        
# Line 1008  TList*  PamLevel2::GetListOfLevel2Files( Line 1299  TList*  PamLevel2::GetListOfLevel2Files(
1299  //          return 0;  //          return 0;
1300  //      }        //      }      
1301  //      flisttxt = fullpath;  //      flisttxt = fullpath;
   
1302        if ( !flisttxt.EndsWith(".root") ){        if ( !flisttxt.EndsWith(".root") ){
1303    
1304          flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt));          flisttxt = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt));
1305    
1306          if( !gSystem->ChangeDirectory(ddir) ){          if( !gSystem->ChangeDirectory(ddir) ){
# Line 1041  TList*  PamLevel2::GetListOfLevel2Files( Line 1332  TList*  PamLevel2::GetListOfLevel2Files(
1332  //          if( gSystem->IsFileInIncludePath(file,&fullpath) ){  //          if( gSystem->IsFileInIncludePath(file,&fullpath) ){
1333  //          if( (fullpath = gSystem->FindFile(ddir,file)) ){  //          if( (fullpath = gSystem->FindFile(ddir,file)) ){
1334              if( file.EndsWith(".root") ){              if( file.EndsWith(".root") ){
1335                  char *fullpath = gSystem->ConcatFileName(gSystem->DirName(ddir),gSystem->BaseName(file));                TString filedir;
1336                  if (ddir != ""){
1337                    filedir = ddir; // take the input dir
1338                  } else {
1339                    gSystem->ChangeDirectory(wdir); // back to the working directory
1340                    filedir = gSystem->DirName(file); // this will take the path if exist in the list otherwise it will return automatically the working dir
1341                  };
1342                    char *fullpath = gSystem->ConcatFileName(gSystem->DirName(filedir),gSystem->BaseName(file));
1343                  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
1344                  delete fullpath;                  delete fullpath;
1345              }              }
# Line 1051  TList*  PamLevel2::GetListOfLevel2Files( Line 1349  TList*  PamLevel2::GetListOfLevel2Files(
1349          };          };
1350          in.close();          in.close();
1351        } else {        } else {
1352              if(flisttxt.Contains("#"))flisttxt = flisttxt(0,flisttxt.First("#"));
1353            char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt));            char *fullpath = gSystem->ConcatFileName(gSystem->DirName(flisttxt),gSystem->BaseName(flisttxt));
1354            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
1355            delete fullpath;            delete fullpath;
1356        };              };        
1357      }else{      }else{
1358                    
1359          cout << "No input file list given."<<endl;          cout << "No input file list given."<<endl;
1360          cout << "Check for existing root files."<<endl;          cout << "Check for existing root files."<<endl;
1361  //              cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl;  //              cout << "Warking directory: "<< gSystem->WorkingDirectory()<< endl;
1362                    if ( ddir == "" ){
1363              ddir = wdir;
1364              cout << "Level2 data directory : "<<  ddir << endl;
1365            };
1366    
1367          TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir);          TSystemDirectory *datadir = new TSystemDirectory(gSystem->BaseName(ddir),ddir);
1368          TList *temp = datadir->GetListOfFiles();          TList *temp = datadir->GetListOfFiles();
1369  //              temp->Print();  //              temp->Print();
# Line 1104  TList*  PamLevel2::GetListOfLevel2Files( Line 1407  TList*  PamLevel2::GetListOfLevel2Files(
1407   * @return Pointer to a TChain   * @return Pointer to a TChain
1408   */   */
1409  TChain *PamLevel2::GetPamTree(TList *fl, TString detlist ){  TChain *PamLevel2::GetPamTree(TList *fl, TString detlist ){
1410      //
1411      //
1412      //
1413      if ( pam_tree ){
1414        printf("WARNING: TChain *PamLevel2::GetPamTree(TList *fl, TString detlist) -- pam_tree already exists!\n ");
1415        return pam_tree;
1416      };
1417      //
1418            
1419      TChain *Trout =0;      TChain *Trout =0;
1420    
# Line 1124  TChain *PamLevel2::GetPamTree(TList *fl, Line 1435  TChain *PamLevel2::GetPamTree(TList *fl,
1435      if(ORB)cout<<"ORB ";      if(ORB)cout<<"ORB ";
1436      cout << endl;      cout << endl;
1437    
1438      TChain *T = 0;             TChain *T = 0;    
1439      TChain *C = 0;       TChain *C = 0;
1440      TChain *O = 0;       TChain *O = 0;
1441      TChain *R = 0;       TChain *R = 0;
1442      TChain *S = 0;       TChain *S = 0;
1443      TChain *N = 0;       TChain *N = 0;
1444      TChain *A = 0;       TChain *A = 0;
1445      TChain *B = 0;       TChain *B = 0;
1446    
1447      TChain *L = 0;       TChain *L = 0;
1448            
1449      if(TRK2||TRK1||TRKh) T = new TChain("Tracker");          if(TRK2||TRK1||TRKh) T = new TChain("Tracker");    
1450      if(CAL2||CAL1)       C = new TChain("Calorimeter");      if(CAL2||CAL1)       C = new TChain("Calorimeter");
# Line 1143  TChain *PamLevel2::GetPamTree(TList *fl, Line 1454  TChain *PamLevel2::GetPamTree(TList *fl,
1454      if(ND)               N = new TChain("NeutronD");      if(ND)               N = new TChain("NeutronD");
1455      if(AC)               A = new TChain("Anticounter");      if(AC)               A = new TChain("Anticounter");
1456      if(ORB)              B = new TChain("OrbitalInfo");      if(ORB)              B = new TChain("OrbitalInfo");
   
1457       L = new TChain("SelectionList");       L = new TChain("SelectionList");
1458            
1459      // loop over files and create chains              // loop over files and create chains        
# Line 1163  TChain *PamLevel2::GetPamTree(TList *fl, Line 1473  TChain *PamLevel2::GetPamTree(TList *fl,
1473              if(ORB)              B->Add(name);              if(ORB)              B->Add(name);
1474              if(SELLI==1)         L->Add(name);              if(SELLI==1)         L->Add(name);
1475          };          };
1476      }      };
1477            
1478      cout << "done chain \n";      cout << "done chain \n";
1479        cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
1480    
1481  //    UInt_t *found=0;  //    UInt_t *found=0;
1482  // Tracker  // Tracker
# Line 1180  TChain *PamLevel2::GetPamTree(TList *fl, Line 1491  TChain *PamLevel2::GetPamTree(TList *fl,
1491  //      else    T->SetBranchStatus("TrkHough",0,found);  //      else    T->SetBranchStatus("TrkHough",0,found);
1492          if(TRKh)cout << "Tracker      : set branch address TrkHough"<<endl;          if(TRKh)cout << "Tracker      : set branch address TrkHough"<<endl;
1493          if(!Trout)Trout=T;          if(!Trout)Trout=T;
1494          else Trout->AddFriend("Tracker");          else Trout->AddFriend("Tracker");
1495      }else{      }else{
1496          cout << "Tracker      : missing tree"<<endl;          cout << "Tracker      : missing tree"<<endl;
1497      };      };
# Line 1251  TChain *PamLevel2::GetPamTree(TList *fl, Line 1562  TChain *PamLevel2::GetPamTree(TList *fl,
1562      }else{      }else{
1563          cout << "OrbitalInfo  : missing tree"<<endl;          cout << "OrbitalInfo  : missing tree"<<endl;
1564      };      };
1565        cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
1566    
1567      // Selection List      // Selection List
1568      if(L && SELLI==1) {      if(L && SELLI==1) {
# Line 1262  TChain *PamLevel2::GetPamTree(TList *fl, Line 1574  TChain *PamLevel2::GetPamTree(TList *fl,
1574          sel_tree = L;          sel_tree = L;
1575  //      if(!Trout)Trout=O;  //      if(!Trout)Trout=O;
1576  //      else Trout->AddFriend("SelectionList");  //      else Trout->AddFriend("SelectionList");
1577            cout << "----------------------------------------------------" <<endl;
1578      }else{      }else{
1579  //      cout << "SelectionList  : missing tree"<<endl;  //      cout << "SelectionList  : missing tree"<<endl;
1580          if(L)L->Delete();          if(L)L->Delete();
# Line 1453  void PamLevel2::SetBranchAddress(TChain Line 1766  void PamLevel2::SetBranchAddress(TChain
1766   * @return Pointer to a TChain   * @return Pointer to a TChain
1767   */   */
1768  TChain *PamLevel2::GetRunTree(TList *fl){  TChain *PamLevel2::GetRunTree(TList *fl){
1769              //
1770      TChain *R = new TChain("Run");    //
1771      //
1772      if ( run_tree ){
1773        printf("WARNING: TChain *PamLevel2::GetRunTree(TList *fl) -- run_tree already exists!\n ");
1774        return run_tree;
1775      };    
1776      //
1777      TChain *R = new TChain("Run");
1778            
1779      // loop over files and create chains              // loop over files and create chains        
1780      TIter next(fl);      TIter next(fl);
# Line 1493  TChain *PamLevel2::GetRunTree(TList *fl) Line 1813  TChain *PamLevel2::GetRunTree(TList *fl)
1813   * @return Pointer to a TTree   * @return Pointer to a TTree
1814   */   */
1815  TTree *PamLevel2::GetRunTree(TFile *f){  TTree *PamLevel2::GetRunTree(TFile *f){
1816      if ( run_tree ){
1817        printf("WARNING: TTree *PamLevel2::GetRunTree(TFile *f) -- run_tree already exists!\n ");
1818        return run_tree;
1819      };
1820            
1821    
1822      cout << "TTree *PamLevel2::GetRunTree(TFile *f) -- obsolte "<<endl;      cout << "TTree *PamLevel2::GetRunTree(TFile *f) -- obsolte "<<endl;
1823    
1824      TTree *R = (TTree*)f->Get("Run");      TTree *T = (TTree*)f->Get("Run");
1825            
1826      if(R){      if(T){
1827          R->SetBranchAddress("RunInfo", GetPointerTo("RunInfo"));          T->SetBranchAddress("RunInfo", GetPointerTo("RunInfo"));
1828          cout << "Run         : set branch address RunInfo"<<endl;          cout << "Run         : set branch address RunInfo"<<endl;
1829          R->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano          T->SetBranchAddress("SoftInfo", GetPointerTo("SoftInfo")); // Emiliano
1830          cout << "Software    : set branch address SoftInfo"<<endl; // Emiliano          cout << "Software    : set branch address SoftInfo"<<endl; // Emiliano
1831      }      }
1832    
1833      run_tree = (TChain*)R;      run_tree = (TChain*)T;
1834    
1835      return R;      return T;
1836            
1837  }  }
1838  /**  /**
# Line 1515  TTree *PamLevel2::GetRunTree(TFile *f){ Line 1840  TTree *PamLevel2::GetRunTree(TFile *f){
1840   * @param run Pointer to the chain/tree which contains run infos   * @param run Pointer to the chain/tree which contains run infos
1841   * @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
1842   */   */
1843  Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev){  Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev){
1844    //    //
1845    // check if we have already called once GetEntry, if not call it    // check if we have already called once GetEntry, if not call it
1846    //    //
1847    if ( run->GetEntries() <= 0 ) return(false);      cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- NON FUNZIONA BENISSIMO.... "<<endl;
1848        if(!run){
1849              cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree "<<endl;
1850              return(false);        
1851        }
1852        if ( run->GetEntries() <= 0 ) return(false);
1853    //    //
1854        
1855    Int_t oldrun = irun;    //  Int_t oldrun = irun;
1856      Long64_t oldrun = irun;
1857    
1858    // --------------------------------------    // --------------------------------------
1859    // if it is a full file (not preselected)    // if it is a full file (not preselected)
1860    // --------------------------------------    // --------------------------------------
1861    if(SELLI==0){    if(SELLI==0){
       if ( irun < 0 ){  
           irun = 0;  
           run->GetEntry(0);  
           runfirstentry = 0ULL;  
           runlastentry += (ULong64_t)(this->GetRunInfo()->NEVENTS) - 1ULL;  
       };        
1862    
1863          //
1864          // the absolute time is necessary to relate the event with the run
1865          //
1866        if( !GetOrbitalInfo() ){        if( !GetOrbitalInfo() ){
1867            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;
1868            return(false);            return(false);
1869        }        }
1870    
1871          //
1872          // the first time the routine is called, set run search from the beginning
1873          //
1874          if ( irun < 0LL ){
1875              irun = 0LL;
1876              run->GetEntry(irun);
1877              runfirstentry = 0LL;
1878              runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS);
1879              if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL;
1880          };      
1881          //
1882           if ( irun == run->GetEntries()-1LL &&
1883               !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME &&
1884                 GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME)
1885                ){
1886             irun = -1LL;
1887             runfirstentry = 0LL;
1888             runlastentry = -1LL;
1889           };
1890        // modificato il controllo sull'aggiornamento del run, per evitare problemi        // modificato il controllo sull'aggiornamento del run, per evitare problemi
1891        // dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!)        // dovuti agli eventi annidati (NB! NEVENTS conta anche questi!!)
1892        while ( GetOrbitalInfo()->absTime > GetRunInfo()->RUNTRAILER_TIME && irun < run->GetEntries() ){        //
1893          bool fromfirst = true;
1894          //
1895          while ( !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries()-1LL ){
1896  //      while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){  //      while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){
           //    printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS)));  
1897            irun++;            irun++;
1898            run->GetEntry(irun);            run->GetEntry(irun);
1899            runfirstentry = runlastentry+1ULL;            runfirstentry = runlastentry;
1900            runlastentry += (ULong64_t)(this->GetRunInfo()->NEVENTS);            if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runfirstentry += 1LL;
1901              runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS);
1902    //        cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
1903    //        cout << "runfirstentry "<<runfirstentry<<endl;
1904              //      printf(" iev %llu %u %llu \n",iev,this->GetRunInfo()->NEVENTS,(ULong64_t)(runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS)));
1905              //      printf(" abstime %u trailertime %u \n",GetOrbitalInfo()->absTime,GetRunInfo()->RUNTRAILER_TIME);
1906              //      printf(" IDRUN %u \n",GetRunInfo()->ID);
1907              //
1908    //        prevshift = 0;
1909              //
1910              if ( irun == (Long64_t)(run->GetEntries()-1LL) && fromfirst && !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME)){
1911                  printf(" resetting irun  (it should NOT happen!!!)\n");
1912                  fromfirst = false;
1913                  irun = 0;
1914                  run->GetEntry(irun);
1915                  runfirstentry = 0ULL;
1916                  runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS);
1917                  if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL;
1918              };
1919              //
1920        };        };
1921                //
1922          if (
1923               !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME &&
1924                 GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME)
1925              ) {
1926              printf(" Something very wrong here: cannot find RUN containing absolute time %u \n",GetOrbitalInfo()->absTime);
1927              return false;
1928          }
1929        //        //
1930        if ( irun == oldrun || irun >= run->GetEntries() ) return(false);        if ( irun == oldrun || irun >= run->GetEntries() ) return(false);
1931        //        //
1932        //  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);
1933        //        //
1934          prevshift = 0;
1935          cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
1936    //      cout << "runfirstentry "<<runfirstentry<<endl;
1937        return(true);            return(true);    
1938    };    };
1939    // ----------------------------------------------------    // ----------------------------------------------------
# Line 1562  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 1942  Bool_t PamLevel2::UpdateRunInfo(TChain *
1942    // ----------------------------------------------------    // ----------------------------------------------------
1943    if(SELLI==1){          if(SELLI==1){      
1944        sel_tree->GetEntry(iev);        sel_tree->GetEntry(iev);
1945    //      cout << irun << " "<< irunentry << endl;
1946        if(irun != oldrun){        if(irun != oldrun){
1947            run->GetEntry(irun);            run->GetEntry(irun);
1948              cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
1949              prevshift = 0;
1950            return true;            return true;
1951        }        }
1952        return false;        return false;
# Line 1572  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 1955  Bool_t PamLevel2::UpdateRunInfo(TChain *
1955    return false;    return false;
1956    //    //
1957  };  };
1958    
1959    Bool_t PamLevel2::UpdateRunInfo(Long64_t iev){
1960    
1961        if(!run_tree){
1962            cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree not loaded"<<endl;
1963            return false;
1964        }
1965        if ( run_tree->GetEntries() <= 0 ) {
1966            cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree is empty"<<endl;
1967            return(false);
1968        }
1969      
1970        Int_t oldrun = irun; // store current run index
1971    
1972        // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
1973        // if it is a full file (not preselected)
1974        // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
1975        if(SELLI==0){
1976    
1977            // ---------------------------------------------------------------
1978            // the absolute time is necessary to relate the event with the run
1979            // ---------------------------------------------------------------
1980            if( !GetOrbitalInfo() ){
1981                cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl;
1982                return(false);
1983            }
1984          
1985            // -----------------------------------------------------------------------
1986            // the first time the routine is called, set run search from the beginning
1987            // -----------------------------------------------------------------------
1988            if ( irun < 0 ){
1989                irun = 0LL;
1990                run_tree->GetEntry(irun);
1991            };      
1992            //
1993            bool fromfirst = true; // first loop over runs
1994            // ------------------------------------------------------
1995            // loop over runs to find the one that contains the event
1996            // ------------------------------------------------------
1997            while ( !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME &&    // check on absolute time (s)
1998                      GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) &&
1999                    !(GetOrbitalInfo()->OBT >= GetRunInfo()->RUNHEADER_OBT &&         // additional check on OBT (ms)
2000                      GetOrbitalInfo()->OBT <= GetRunInfo()->RUNTRAILER_OBT) &&
2001                    irun < run_tree->GetEntries() ){
2002                irun++;
2003                // ------------------------------------
2004                // if the end of run tree is reached...
2005                // ------------------------------------
2006                if( irun == run_tree->GetEntries() ){
2007                    if(!fromfirst){
2008                        // -----------------------------------------------------
2009                        // if it happened already once and the run was not found
2010                        // ---> exit with error
2011                        // -----------------------------------------------------
2012                        cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- event entry #"<<iev<<" does not belong to any run (should not happen)" <<endl;
2013                        return false;
2014                    }
2015                    // -----------------------------------------
2016                    // ...otherwise repeat search from beginning
2017                    // -----------------------------------------
2018                    cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- reached end of run tree. searchin again from beginning " <<endl;
2019                    fromfirst = false;
2020                    irun = 0LL;
2021                    runfirstentry = 0LL;
2022                }
2023                // -------------------------------------------------------------------
2024                // save the index of the first entry of the run, relative to pam_tree,
2025                // and read a new run
2026                // -------------------------------------------------------------------
2027                if(irun>0)runfirstentry += (GetRunInfo()->NEVENTS);
2028                run_tree->GetEntry(irun);      
2029                if(GetRunInfo()->RUNHEADER_OBT>=GetRunInfo()->RUNTRAILER_OBT ){
2030                    cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun "<<irun<<"  has RUNHEADER_OBT>=RUNTRAILER_OBT " <<endl;
2031                    cout << "                                                            (NB!! in this case some events are assigned to a wrong run)"<<endl;
2032                }
2033            };
2034            // --------------------------------------
2035            // if there was no need to update the run
2036            // ---> exit with FALSE
2037            // --------------------------------------
2038            if ( irun == oldrun ) return(false);
2039    
2040            // --------------------------------------
2041            // ... otherwise
2042            // ---> exit with TRUE
2043            // --------------------------------------
2044            cout << endl << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
2045            prevshift = 0;
2046            return(true);    
2047        };
2048        // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
2049        // if it is a preselected file (there is SelectionList)
2050        // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
2051        if(SELLI==1){      
2052            sel_tree->GetEntry(iev);
2053            if(irun != oldrun){
2054                run_tree->GetEntry(irun);
2055                cout << endl << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
2056                prevshift = 0;
2057                return true;
2058            }
2059            return false;
2060        }
2061    
2062        return false;
2063        //
2064    };
2065  /**  /**
2066   * Update the runinfo informations (to be used to have Run infos event by event basis)   * Update the runinfo informations (to be used to have Run infos event by event basis)
2067   * @param run Pointer to the chain/tree which contains run infos   * @param run Pointer to the chain/tree which contains run infos
2068   * @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
2069   */   */
2070  Bool_t PamLevel2::UpdateRunInfo(TTree *run, ULong64_t iev){  Bool_t PamLevel2::UpdateRunInfo(TTree *run, Long64_t iev){
2071    return(UpdateRunInfo((TChain*)run,iev));    return(UpdateRunInfo((TChain*)run,iev));
2072  };  };
2073    
# Line 2212  void PamLevel2::CreateCloneTrees(TFile * Line 2702  void PamLevel2::CreateCloneTrees(TFile *
2702      cout << "Run          : branch RunInfo"<<endl;      cout << "Run          : branch RunInfo"<<endl;
2703      run_tree_clone->Branch("SoftInfo","SoftInfo",GetPointerTo("SoftInfo"));      run_tree_clone->Branch("SoftInfo","SoftInfo",GetPointerTo("SoftInfo"));
2704      cout << "Run          : branch SoftInfo"<<endl;      cout << "Run          : branch SoftInfo"<<endl;
2705                    // ------------------
2706        // replicate run tree
2707        // ------------------
2708        cout << "----------------------------------------------------"<<endl;
2709        cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl;
2710        for (Int_t i=0; i<run_tree->GetEntries(); i++){
2711            run_tree->GetEntry(i);
2712            cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl;
2713            run_tree_clone->Fill();
2714        }
2715        cout << "----------------------------------------------------"<<endl;
2716    
2717    
2718      sel_tree_clone = new TTree("SelectionList","List of selected events ");      sel_tree_clone = new TTree("SelectionList","List of selected events ");
2719      sel_tree_clone->Branch("RunEntry",&irun,"runentry/I");      sel_tree_clone->Branch("RunEntry",&irun,"runentry/L");
2720      sel_tree_clone->Branch("EventEntry",&irunentry,"eventry/I");      sel_tree_clone->Branch("EventEntry",&irunentry,"eventry/L");
2721            
2722    
2723      Int_t i=0;      Int_t i=0;
# Line 2227  void PamLevel2::CreateCloneTrees(TFile * Line 2727  void PamLevel2::CreateCloneTrees(TFile *
2727              pam_tree_clone[i]->Branch("TrkLevel1","TrkLevel1", GetPointerTo("TrkLevel1"));              pam_tree_clone[i]->Branch("TrkLevel1","TrkLevel1", GetPointerTo("TrkLevel1"));
2728              pam_tree_clone[i]->BranchRef();              pam_tree_clone[i]->BranchRef();
2729              cout << "Tracker      : branch TrkLevel1"<<endl;              cout << "Tracker      : branch TrkLevel1"<<endl;
2730              cout << "CreateCloneTrees " << GetTrkLevel1()<<endl;  //          cout << "CreateCloneTrees " << GetTrkLevel1()<<endl;
2731          };          };
2732          if(TRK2) {          if(TRK2) {
2733              pam_tree_clone[i]->Branch("TrkLevel2", "TrkLevel2",GetPointerTo("TrkLevel2"));              pam_tree_clone[i]->Branch("TrkLevel2", "TrkLevel2",GetPointerTo("TrkLevel2"));
# Line 2357  void PamLevel2::WriteCloneTrees(){ Line 2857  void PamLevel2::WriteCloneTrees(){
2857  /**  /**
2858   * Method to get level2-trees entry, the corresponding run entry and (if required) the level0 entry.   * Method to get level2-trees entry, the corresponding run entry and (if required) the level0 entry.
2859   */   */
2860  Int_t PamLevel2::GetEntry(Int_t iee){  //Int_t PamLevel2::GetEntry(Int_t iee){
2861    Int_t PamLevel2::GetEntry(Long64_t iee){
2862            
2863      if(!pam_tree){      if(!pam_tree){
2864          cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- level2 trees not loaded"<<endl;          cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- level2 trees not loaded"<<endl;
2865          return 0;          return 0;
2866      }      }
2867    
2868      Int_t ii=0;  
2869        //
2870        // 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...
2871        //
2872        //    if(!run_tree ){
2873        //  cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loeaded"<<endl;
2874        //  return 0;
2875        //    }
2876    
2877        Long64_t ii=0;
2878      //-------------------------------      //-------------------------------
2879      ii = iee;      ii = iee;
2880      if( !pam_tree->GetEntry(ii) ) return 0;      if( !pam_tree->GetEntry(ii) ){      
2881      //-------------------------------          cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading pam tree"<<endl;
   
     if(!run_tree ){  
         cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl;  
2882          return 0;          return 0;
2883      }      }
2884        //
2885        // ... 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.
2886        // 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
2887        // a problem if you don't check the return code of getentry.
2888        //
2889        if(!run_tree ){
2890            if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1?
2891                cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl;
2892                return 0;
2893            }  else {
2894                return 1; //cosi` se non c'e` run esce qua...
2895            }
2896        }
2897    
2898        //-------------------------------
2899      ii = iee;      ii = iee;
2900      Bool_t UPDATED = UpdateRunInfo(run_tree,ii);  //    Bool_t UPDATED = UpdateRunInfo(run_tree,ii);
2901    //    Bool_t UPDATED = UpdateRunInfo(ii);
2902        UpdateRunInfo(ii);
2903      if(SELLI==0)irunentry = iee-runfirstentry;      if(SELLI==0)irunentry = iee-runfirstentry;
2904      if(UPDATED && run_tree_clone)run_tree_clone->Fill();  //    if(UPDATED && run_tree_clone)run_tree_clone->Fill();
2905      
2906  //    cout << "PamLevel2::GetEntry("<<iee<<") "<<irun<<" "<<runfirstentry<<" "<<irunentry<<endl;  //    cout << "PamLevel2::GetEntry("<<iee<<") "<<irun<<" "<<runfirstentry<<" "<<irunentry<<endl;
2907    
2908      if( TRK0 || CAL0 || TOF0 )GetYodaEntry( );  //    cout << " irunentry "<<irunentry << endl;
2909    
2910        if( TRK0 || CAL0 || TOF0 ){
2911            if( !GetYodaEntry( ) ){
2912                cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading level0 tree"<<endl;
2913                return 0;
2914            }
2915        }
2916      return 1;      return 1;
2917    
2918  }  }
# Line 2402  TTree* PamLevel2::GetYodaTree( ){ Line 2931  TTree* PamLevel2::GetYodaTree( ){
2931      // check if iroot has changed      // check if iroot has changed
2932      //===================================      //===================================
2933      if( irun<0 ){      if( irun<0 ){
2934          cout << "PamLevel2::GetYodaTree() -- ERROR "<<endl;          cout << "PamLevel2::GetYodaTree() -- ERROR -- irun = "<<irun<<endl;
2935          cout << "In order to use this method you have to load the RunInfo tree "<<endl;  //      cout << "In order to use this method you have to first load the RunInfo tree "<<endl;
         cout << "with the method TChain* PamLevel2::GetRunTree(TString, TString)"<<endl;  
 //      cout << " - read the event with PamLevel2::GetEntry(Int_t)"<<endl;  
2936          return NULL;          return NULL;
2937      }          }    
2938      Int_t irootnew = run_obj->ID_ROOT_L0;      Int_t irootnew = run_obj->ID_ROOT_L0;
# Line 2457  TTree* PamLevel2::GetYodaTree( ){ Line 2984  TTree* PamLevel2::GetYodaTree( ){
2984          l0_tree = (TTree*)l0_file->Get("Physics");          l0_tree = (TTree*)l0_file->Get("Physics");
2985          if(!h0_obj)h0_obj = new EventHeader();          if(!h0_obj)h0_obj = new EventHeader();
2986          l0_tree->SetBranchAddress("Header" ,&h0_obj);          l0_tree->SetBranchAddress("Header" ,&h0_obj);
2987            prevshift = 0;
2988          //---------------------------------------------------          //---------------------------------------------------
2989          // TRACKER:          // TRACKER:
2990          if(TRK0){          if(TRK0){
# Line 2465  TTree* PamLevel2::GetYodaTree( ){ Line 2993  TTree* PamLevel2::GetYodaTree( ){
2993                  trk0_obj->Set();                  trk0_obj->Set();
2994              };              };
2995              l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent());              l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent());
             TrkParams::SetCalib(run_obj,dbc);  
2996          }          }
2997          //---------------------------------------------------          //---------------------------------------------------
2998          // CALORIMETER:          // CALORIMETER:
2999          if(CAL0){          if(CAL0){
3000              cout << "PamLevel2::GetYodaTree() --- level0 calorimeter not implemented "<<endl;              if(!calo0_obj){
3001                    calo0_obj = new CaloLevel0();
3002                    calo0_obj->Set();
3003                };
3004                l0_tree->SetBranchAddress("Calorimeter" ,calo0_obj->GetPointerToCalorimeterEvent());
3005                //      cout << "PamLevel2::GetYodaTree() --- level0 calorimeter not implemented "<<endl;
3006          }          }
3007          //---------------------------------------------------          //---------------------------------------------------
3008          // TOF:          // TOF:
# Line 2480  TTree* PamLevel2::GetYodaTree( ){ Line 3012  TTree* PamLevel2::GetYodaTree( ){
3012    
3013      };      };
3014    
3015        if(!dbc || (dbc && !dbc->IsConnected())){
3016            cout << " TTree* PamLevel2::GetYodaTree( ) -- no DB connected... hai fatto qualche cazzata "<<endl;
3017        }
3018    
3019        if ( TRK0 ){
3020            TrkParams::Load(6);
3021            if( !TrkParams::IsLoaded(6) ){
3022                cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- VK-mask not loaded"<<endl;
3023            };
3024            TrkParams::SetCalib(run_obj,dbc);
3025            TrkParams::LoadCalib( );
3026            if( !TrkParams::CalibIsLoaded() ){
3027                cout << " TTree* PamLevel2::GetYodaTree( ) -- WARNING -- Calibration not loaded"<<endl;
3028            };
3029        }
3030    
3031  //    cout << l0_tree << endl;  //    cout << l0_tree << endl;
3032            
3033      return l0_tree;      return l0_tree;
# Line 2494  Int_t PamLevel2::GetYodaEntry(){ Line 3042  Int_t PamLevel2::GetYodaEntry(){
3042  //    cout << "Int_t PamLevel2::GetYodaEntry()"<<endl;  //    cout << "Int_t PamLevel2::GetYodaEntry()"<<endl;
3043      if(!GetYodaTree())return 0;      if(!GetYodaTree())return 0;
3044            
3045        // patch
3046        if( irunentry < 0){
3047    //      cout << "Int_t PamLevel2::GetYodaEntry() -- ATTENZIONE -- irunentry negativo?!?! "<<(Int_t)irunentry<<endl;
3048            irunentry=0LL;
3049        }
3050      //  ---------------------------------      //  ---------------------------------
3051      //  if file is NOT a preselected file      //  if file is NOT a preselected file
3052      //  ---------------------------------      //  ---------------------------------
3053      Int_t quellagiusta = irunentry + run_obj->EV_FROM;      Long64_t quellagiusta = irunentry + (Long64_t)(run_obj->EV_FROM);
3054    //     cout << " irunentry "<<irunentry<<endl;
3055    //     cout << " EV_FROM "<<run_obj->EV_FROM<<endl;
3056    //     cout << " quellagiusta = irunentry + EV_FROM "<< quellagiusta << endl;
3057    
3058    //     cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl;
3059    //     cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl;
3060    //     cout << " time "<< GetOrbitalInfo()->absTime << endl;
3061    //     cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl;
3062        
3063      if( !GetOrbitalInfo() ){      if( !GetOrbitalInfo() ){
3064          cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl;          cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl;
3065          return 0;          return 0;
3066      }      }
3067        if( GetOrbitalInfo()->OBT==0 && GetOrbitalInfo()->pkt_num==0 ){
3068            cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? "<<endl;
3069            return 0;
3070        }
3071    
3072      // ---------------------------------------------------------------------      // ---------------------------------------------------------------------
3073      // ATTENTION!!!      // ATTENTION!!!
# Line 2517  Int_t PamLevel2::GetYodaEntry(){ Line 3082  Int_t PamLevel2::GetYodaEntry(){
3082      // ---------------------------------------------------------------------      // ---------------------------------------------------------------------
3083      Int_t answer = 0;      Int_t answer = 0;
3084      Int_t shift =0;      Int_t shift =0;
3085        //    printf(" siamo qui %i %i \n",shift,prevshift);
3086        Int_t maxshift = 100;
3087      do{      do{
3088  //      if(shift>0){          if(shift>0){    
3089  //          cout << " level0 <--> level2 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" )"<<endl;              cout << " PKTNUM  L2 --- "<< GetOrbitalInfo()->pkt_num << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl;
3090  //      }              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;
3091          answer = GetYodaTree()->GetEntry(quellagiusta+shift);              cout << "         L2 <--> L0 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl;
3092            }
3093            answer = l0_tree->GetEntry(quellagiusta+(Long64_t)shift+(Long64_t)prevshift);
3094          shift++;          shift++;
3095          if( !GetEventHeader() ){          if( !GetEventHeader() ){
3096              cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl;              cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl;
3097              return 0;              return 0;
3098          }          }
3099  //      if( (quellagiusta+shift) == GetYodaTree()->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl;  //      cout << "PKTNUM "<<shift<<" ==  L2 --- "<< GetOrbitalInfo()->pkt_num << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl;
3100      }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 << " L2 --- "<< GetOrbitalInfo()->OBT << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl;
3101    //      if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl;
3102    //      cout << " GetOrbitalInfo()->OBT "<< GetOrbitalInfo()->OBT << endl;
3103    //      cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl;
3104    //      cout << " GetOrbitalInfo()->pkt_num "<< GetOrbitalInfo()->pkt_num << endl;
3105    //      cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl;
3106    //      printf(" IDRUN %u \n",GetRunInfo()->ID);
3107    //
3108            if ( prevshift != 0 && (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() ){
3109              prevshift = 0;
3110              shift = -1;
3111            };
3112    
3113        }while( ( GetOrbitalInfo()->OBT != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || GetOrbitalInfo()->pkt_num != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() && shift < maxshift);
3114    
3115        if ( (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() || shift == maxshift ) {
3116            cout << " Big trouble here, no such event in Level0 data! " <<endl;
3117            return 0;
3118        }
3119  //    cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl;  //    cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl;
3120  //    return GetYodaTree()->GetEntry(quellagiusta);  //    return GetYodaTree()->GetEntry(quellagiusta);
3121        if ( shift > 1 ) prevshift += (shift-1);
3122            
3123      return answer;      return answer;
3124            
3125  }  }
3126    
3127    
Legend:
Removed from v.1.25  
changed lines
  Added in v.1.37
  ViewVC Help
Powered by ViewVC 1.1.23