/[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.35 by mocchiut, Wed Mar 21 13:52:15 2007 UTC revision 1.49 by pam-fi, Wed Oct 24 08:41:25 2007 UTC
# Line 11  PamTrack::PamTrack(){ Line 11  PamTrack::PamTrack(){
11      calo_track = 0;      calo_track = 0;
12      tof_track  = 0;      tof_track  = 0;
13      candeleteobj = 0;      candeleteobj = 0;
14        pscore = 0;
15        iscore = 0;
16  };  };
17  //--------------------------------------  //--------------------------------------
18  //  //
# Line 60  void PamTrack::Clear(){ Line 62  void PamTrack::Clear(){
62          calo_track = 0;          calo_track = 0;
63          tof_track  = 0;          tof_track  = 0;
64      }      }
65        pscore = 0;
66        iscore = 0;
67    
68  }  }
69  void PamTrack::Delete(){  void PamTrack::Delete(){
70  //    cout << "PamTrack::Delete() "<<candeleteobj<<endl;  //    cout << "PamTrack::Delete() "<<candeleteobj<<endl;
# Line 112  PamLevel2::PamLevel2(TString ddir,TStrin Line 117  PamLevel2::PamLevel2(TString ddir,TStrin
117    
118  void PamLevel2::Initialize(){  void PamLevel2::Initialize(){
119                    
 //     trk2_obj  = TrkLevel2::GetTrkLevel2();  
 //     trk1_obj  = TrkLevel1::GetTrkLevel1();  
 //     trkh_obj  = TrkHough::GetTrkHough();  
 //     calo1_obj = CaloLevel1::GetCaloLevel1();  
 //     calo2_obj = CaloLevel2::GetCaloLevel2();  
 //     tof_obj   = ToFLevel2::GetToFLevel2();  
 //     trig_obj  = TrigLevel2::GetTrigLevel2();  
 //     s4_obj    = S4Level2::GetS4Level2();  
 //     nd_obj    = NDLevel2::GetNDLevel2();  
 //     ac_obj    = AcLevel2::GetAcLevel2();  
 //     orb_obj   = OrbitalInfo::GetOrbitalInfo();  
       
120      h0_obj    = 0;      h0_obj    = 0;
121      trk0_obj  = 0;      trk0_obj  = 0;
122      calo0_obj  = 0;      calo0_obj  = 0;
# Line 162  void PamLevel2::Initialize(){ Line 155  void PamLevel2::Initialize(){
155      pam_tree = NULL;      pam_tree = NULL;
156      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;
157    
158        totdltime[0] = 0LL;
159        totdltime[1] = 0LL;
160    
161      host = "mysql://localhost/pamelaprod";      host = "mysql://localhost/pamelaprod";
162      user = "anonymous";      user = "anonymous";
163      psw = "";      psw = "";
# Line 198  void PamLevel2::Initialize(){ Line 194  void PamLevel2::Initialize(){
194    
195      SELLI = -1;      SELLI = -1;
196    
197        ISGP = false;
198    
199      tsorted=0;      tsorted=0;
200      timage=0;      timage=0;
201        
202        howtosort = "+CAL+TOF";
203        //howtosort = "+TOF";
204        sortthr = 100.;
205    
206  };  };
207  /**  /**
# Line 300  void PamLevel2::Clear(){ Line 302  void PamLevel2::Clear(){
302    
303      if(h0_obj)   h0_obj->Clear();            if(h0_obj)   h0_obj->Clear();      
304  //    if(trk0_obj) trk0_obj->Clear();    //    if(trk0_obj) trk0_obj->Clear();  
     if(calo0_obj) calo0_obj->Clear();    
305      if(trk1_obj) trk1_obj->Clear();          if(trk1_obj) trk1_obj->Clear();    
306      if(trk2_obj) trk2_obj->Clear();      if(trk2_obj) trk2_obj->Clear();
307      if(trkh_obj) trkh_obj->Clear();      if(trkh_obj) trkh_obj->Clear();
308        if(calo0_obj) calo0_obj->Clear();  
309      if(calo1_obj)calo1_obj->Clear();      if(calo1_obj)calo1_obj->Clear();
310      if(calo2_obj)calo2_obj->Clear();      if(calo2_obj)calo2_obj->Clear();
311      if(tof_obj)  tof_obj->Clear();      if(tof_obj)  tof_obj->Clear();
# Line 397  void PamLevel2::Reset(){ Line 399  void PamLevel2::Reset(){
399    runfirstentry = 0ULL;    runfirstentry = 0ULL;
400    runlastentry = 0ULL;        runlastentry = 0ULL;    
401    //    //
402      totdltime[0] = 0LL;
403      totdltime[1] = 0LL;
404      //
405  };  };
406    
407    Bool_t PamLevel2::IsGood(){
408      Bool_t goodev=true;
409      //  if(trk2_obj && trk2_obj->UnpackError() != 0 ) goodev = false;
410      if(calo2_obj && calo2_obj->good != 1) goodev = false;
411      if(tof_obj && tof_obj->unpackError != 0) goodev = false;  
412      if(trig_obj && trig_obj->unpackError != 0) goodev = false;
413      if(s4_obj && s4_obj->unpackError != 0) goodev = false;  
414      if(nd_obj && nd_obj->unpackError != 0) goodev = false;  
415      if(ac_obj && ac_obj->unpackError != 255) goodev = false;  
416        //  if(orb_obj)  
417      return goodev;
418    };
419    
420  //--------------------------------------  //--------------------------------------
421  //  //
# Line 593  PamTrack* PamLevel2::GetStoredTrack(Int_ Line 610  PamTrack* PamLevel2::GetStoredTrack(Int_
610  }  }
611  //--------------------------------------  //--------------------------------------
612  //  //
613    
614    /**
615     * 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.
616     **/
617    void PamLevel2::SortTracks(TString how){
618      printf(" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n",how.Data());
619      howtosort = how;  
620      SortTracks();
621    };
622    
623  //  //
624  //--------------------------------------  //--------------------------------------
625  /**  /**
# Line 606  PamTrack* PamLevel2::GetStoredTrack(Int_ Line 633  PamTrack* PamLevel2::GetStoredTrack(Int_
633   *   *
634   * 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).
635   */   */
636  void PamLevel2::SortTracks(TString how){  void PamLevel2::SortTracks(){
637      TString how = howtosort;
638    
639  //    cout <<" PamLevel2::SortTracks(TString how) "<<endl;    //  cout <<" PamLevel2::SortTracks(TString how) "<<endl;
640      if( !trk2_obj ){    if( !trk2_obj ){
641          cout << "void PamLevel2::SortTracks(TString how):  TrkLevel2 not loaded !!!";      cout << "void PamLevel2::SortTracks():  TrkLevel2 not loaded !!!";
642          return;      return;
643      };    };
644  //    cout << "call SortTracs() "<<endl;    //    cout << "call SortTracs() "<<endl;
645    //Save current Object count    //Save current Object count
646      Int_t ObjectNumber = TProcessID::GetObjectCount();    Int_t ObjectNumber = TProcessID::GetObjectCount();
647    
648  //    cout << "ObjectNumber  "<<ObjectNumber <<endl;    //    cout << "ObjectNumber  "<<ObjectNumber <<endl;
649    
650  //     if(!sorted_tracks)sorted_tracks = new TRefArray();    //     if(!sorted_tracks)sorted_tracks = new TRefArray();
651  //     sorted_tracks->Clear();    //     sorted_tracks->Clear();
652  //    sorted_tracks.Clear();    //    sorted_tracks.Clear();
653    
654      if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks());
655      tsorted->Delete();
656      TClonesArray &ttsorted = *tsorted;
657      if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks());
658      timage->Delete();
659      TClonesArray &ttimage = *timage;
660    
     if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks());  
     tsorted->Delete();  
     TClonesArray &ttsorted = *tsorted;  
     if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks());  
     timage->Delete();  
     TClonesArray &ttimage = *timage;  
661    
662    
663      // loop over the tracks sorted by the tracker    //--------------------------------------------------
664      Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase);    // retrieve sorting method
665      Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase);    //--------------------------------------------------
666      Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase);    Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase);
667          Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase);
668      if( !CAL2 &&  use_CAL) use_CAL = false;    Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase);
669      if( !TOF &&  use_TOF) use_TOF = false;    Bool_t use_S1 = how.Contains("S1", TString::kIgnoreCase);
670          Bool_t use_S2 = how.Contains("S2", TString::kIgnoreCase);
671      if( !TRK2 ){    Bool_t use_S3 = how.Contains("S3", TString::kIgnoreCase);
672  //      cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl;    
673          return;    if ( use_TOF ){
674      };      use_S1 = true;
675        use_S2 = true;
676        use_S3 = true;
677      };
678      if( !CAL2 &&  use_CAL) use_CAL = false;
679      if( !TOF ){
680        use_TOF = false;
681        use_S1  = false;
682        use_S2  = false;
683        use_S3  = false;
684      }
685    
686      //   cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl;    if( !TRK2 ){
687            //  cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl;
688      for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){      return;
689              };
690          TrkTrack   *ts = 0;  
691          CaloTrkVar *cs = 0;    //   cout << "use_CAL "<<use_CAL<<" use_TOF "<<use_TOF<<" use_TRK "<<use_TRK <<endl;
692          ToFTrkVar  *os = 0;    
693            
694          // get tracker tracks    //--------------------------------------------------
695          TrkTrack   *tp = trk2_obj->TrkLevel2::GetTrack(i);                    //tracker    // loop over "physical" tracks sorted by the tracker
696          CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo());    //--------------------------------------------------
697          ToFTrkVar  *op = GetToFStoredTrack(tp->GetSeqNo());    for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){
698            
699          TrkTrack   *ti = 0;              //tracker (image)      TrkTrack   *ts = 0;
700          CaloTrkVar *ci = 0;      CaloTrkVar *cs = 0;
701          ToFTrkVar  *oi = 0;      ToFTrkVar  *os = 0;
702  //      cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl;          
703          // if track has an image, check image selection      // get tracker tracks
704          if(tp->HasImage()){      TrkTrack   *tp = trk2_obj->TrkLevel2::GetTrack(i); //tracker
705        CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo());
706        ToFTrkVar  *op = GetToFStoredTrack(tp->GetSeqNo());
707    
708        TrkTrack   *ti = 0; //tracker (image)
709        CaloTrkVar *ci = 0;
710        ToFTrkVar  *oi = 0;
711        //  cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl;
712        // if track has an image, check image selection
713    
714        Int_t tp_score = 0;  //main track sorted by the tracker
715        Int_t ti_score = 0;  //image track
716        Int_t totp_score = 0;  //main track sorted by the tracker
717        Int_t toti_score = 0;  //image track
718    
719        if(tp->HasImage()){
720                            
721              ti = trk2_obj->TrkLevel2::GetTrackImage(i);              //tracker (image)        ti = trk2_obj->TrkLevel2::GetTrackImage(i);              //tracker (image)
722              ci = GetCaloStoredTrack(ti->GetSeqNo());        ci = GetCaloStoredTrack(ti->GetSeqNo());
723              oi = GetToFStoredTrack(ti->GetSeqNo());        oi = GetToFStoredTrack(ti->GetSeqNo());
724                            
725  //          cout << "its image "<<i << " "<<hex<< ti <<dec<< endl;        //            cout << "its image "<<i << " "<<hex<< ti <<dec<< endl;
726    
727              //assign starting scores        //assign starting scores
728              Int_t tp_score = 0;  //main track sorted by the tracker        tp_score = 0;  //main track sorted by the tracker
729              Int_t ti_score = 0;  //image track        ti_score = 0;  //image track
730                            
731              // ------------------------        // -----------------------------------------------------------------------------------------
732              // calorimeter check        // calorimeter check
733              // ------------------------        // -----------------------------------------------------------------------------------------
734              // check the Y spatial residual on the first calorimeter plane        // check the Y spatial residual on the first calorimeter plane
735              // (cut on calorimeter variables from Emiliano)        // (cut on calorimeter variables from Emiliano)
736              if( use_CAL && !calo2_obj ){        if( use_CAL && !calo2_obj ){
737                  cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but CaloLevel2 not loaded !!!";          cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but CaloLevel2 not loaded !!!";
738                  return;          return;
739              };        };
740              if(        if( use_CAL && !cp &&  ci ){
741                  use_CAL            &&          ti_score++;
742                  calo2_obj->npcfit[1] > 15     &&   //no. of fit planes on Y view          toti_score++;
743                  calo2_obj->varcfit[1] < 1000. &&  //fit variance on Y view        };
744                  cp && ci &&        if( use_CAL &&  cp && !ci ){
745                  true){          tp_score++;
746            totp_score++;
747          };
748          if(
749             use_CAL            &&
750    //       calo2_obj->npcfit[1] > 5     &&   //no. of fit planes on Y view
751    //       calo2_obj->varcfit[1] < 1000. &&  //fit variance on Y view
752             cp && ci &&
753             true){
754    
755                                    
756                  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;
757                  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;
758                                    
759                  if(resy_p <= resy_i) tp_score++;  //      if(resy_p <= resy_i) tp_score++;
760                  else                 ti_score++;  //      else                 ti_score++;
761            
762    
763            if( cp->npresh > ci->npresh){
764              tp_score++;
765              totp_score++;
766            };
767            if( cp->npresh < ci->npresh){
768              ti_score++;
769              toti_score++;
770            };
771    
772  //              cout << "CALO "<<tp_score<<ti_score<<endl;          //      cout << "CALO "<<tp_score<<ti_score<<endl;
773    
774          };
775          // -----------------------------------------------------------------------------------------
776          // TOF check
777          // -----------------------------------------------------------------------------------------
778          // check the number of hit pmts along the track
779          // on S12 S21 and S32, where paddles are parallel to Y axis
780          if( (use_TOF || use_S1 || use_S2 || use_S3 ) && !tof_obj ){
781            cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but ToFLevel2 not loaded !!!";
782            return;
783          };
784          //
785          if( (use_TOF || use_S1 || use_S2 || use_S3 ) && !op && oi ){
786            ti_score++;
787            toti_score++;
788          };
789          if( (use_TOF || use_S1 || use_S2 || use_S3 ) && op && !oi ){
790            tp_score++;
791            totp_score++;
792          };
793          if( (use_TOF || use_S1 || use_S2 || use_S3 ) && op && oi ){
794            //
795            Float_t sen = 0.;
796            for (Int_t ih=0; ih < op->npmtadc; ih++){
797              Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
798              if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (op->dedx).At(ih);
799            };
800            for (Int_t ih=0; ih < oi->npmtadc; ih++){
801              Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
802              if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (oi->dedx).At(ih);
803            };
804            //
805            if (  sen >= sortthr && false){ // temporary disabled NUCLEI special algorithm since the new one should work for every particle (to be checked!)
806              //printf(" IS A NUCLEUS! en = %f \n",sen);
807              //
808              // is a nucleus use a different algorithm
809              //
810              Int_t nz = 6; Float_t zin[6];                                          // << define TOF z-coordinates
811              for(Int_t ip=0; ip<nz; ip++)
812                zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip));     // << read ToF plane z-coordinates
813              Trajectory *tr = new Trajectory(nz,zin);
814              //
815              Int_t nphit_p =0;
816              Int_t nphit_i =0;
817              Float_t enhit_p = 0.;
818              Float_t enhit_i = 0.;
819              //
820              for (Int_t ih=0; ih < op->npmtadc; ih++){
821                Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
822                if(pl == 1 || pl == 2 || pl == 5){
823                  nphit_p++;
824                  enhit_p += (op->dedx).At(ih);
825                };
826              };
827              //
828              tp->DoTrack2(tr);
829              //
830              if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){
831                for (Int_t ih=0; ih < op->npmtadc; ih++){
832                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
833                  if(pl == 0){
834                    nphit_p++;
835                    enhit_p += (op->dedx).At(ih);
836                  };
837                };
838              };
839              if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){
840                for (Int_t ih=0; ih < op->npmtadc; ih++){
841                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
842                  if(pl == 3){
843                    nphit_p++;
844                    enhit_p += (op->dedx).At(ih);
845                  };
846                };
847              };
848              if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){
849                for (Int_t ih=0; ih < op->npmtadc; ih++){
850                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
851                  if(pl == 4){
852                    nphit_p++;
853                    enhit_p += (op->dedx).At(ih);
854                  };
855                };
856              };
857    
858              for (Int_t ih=0; ih < oi->npmtadc; ih++){
859                Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
860                if(pl == 1 || pl == 2 || pl == 5){
861                  nphit_i++;        
862                  enhit_i += (op->dedx).At(ih);
863              };              };
864              // ------------------------            };
865              // TOF check            //
866              // ------------------------                ti->DoTrack2(tr);
867              // check the number of hit pmts along the track            //
868              // on S12 S21 and S32, where paddles are parallel to Y axis            if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){
869              if( use_TOF && !tof_obj ){              for (Int_t ih=0; ih < oi->npmtadc; ih++){
870                  cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but ToFLevel2 not loaded !!!";                Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
871                  return;                if(pl == 0){
872                    nphit_i++;
873                    enhit_i += (op->dedx).At(ih);
874                  };
875                };
876              };
877              if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){
878                for (Int_t ih=0; ih < oi->npmtadc; ih++){
879                  Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
880                  if(pl == 3){
881                    nphit_i++;
882                    enhit_i += (op->dedx).At(ih);
883                  };
884                };
885              };
886              if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){
887                for (Int_t ih=0; ih < oi->npmtadc; ih++){
888                  Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
889                  if(pl == 4){
890                    nphit_i++;
891                    enhit_i += (op->dedx).At(ih);
892                  };
893                };
894              };            
895    
896                    
897              if(
898                 (use_TOF || use_S1 || use_S2 || use_S3)            &&
899                 (nphit_p+nphit_i) !=0 &&  
900                 true){
901                        
902                //      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);
903                //      printf(" score p %i score i %i \n",tp_score,ti_score);
904                //            if( enhit_p > enhit_i ) tp_score++;
905                //            if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++;
906                if ( nphit_p > nphit_i ) tp_score++;
907                if ( nphit_p < nphit_i ) ti_score++;
908                if ( nphit_p == nphit_i ){
909                  if ( enhit_p > enhit_i ) tp_score++;
910                  else ti_score++;
911              };              };
912              if( use_TOF && op && oi ){              //      printf(" dopo score p %i score i %i \n",tp_score,ti_score);
913              };
914              delete tr;
915              //
916            } else {
917              //
918              // NOT a NUCLEUS
919              //
920              //printf(" NOT a NUCLEUS! en = %f \n",sen);
921    
922              Int_t nphit_p =0;
923              Int_t nphit_i =0;
924                                    
                 Int_t nphit_p =0;  
                 Int_t nphit_i =0;  
925                                    
926              /*                            cout << "track: npmtadc "<< op->npmtadc << endl;
927                cout << "track: npmttdc "<< op->npmttdc << endl;
928                cout << "image: npmtadc "<< oi->npmtadc << endl;
929                cout << "image: npmttdc "<< oi->npmttdc << endl;*/
930                                    
931  /*                              cout << "track: npmtadc "<< op->npmtadc << endl;  //        for (Int_t ih=0; ih < op->npmtadc; ih++){
932                                  cout << "track: npmttdc "<< op->npmttdc << endl;  //          Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
933                                  cout << "image: npmtadc "<< oi->npmtadc << endl;  //          if(pl == 1 || pl == 2 || pl == 5)nphit_p++;
934                                  cout << "image: npmttdc "<< oi->npmttdc << endl;*/  //        };
935                                    
936                  for (Int_t ih=0; ih < op->npmtadc; ih++){  //        for (Int_t ih=0; ih < oi->npmtadc; ih++){
937                      Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );  //          Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
938                      if(pl == 1 || pl == 2 || pl == 5)nphit_p++;  //          if(pl == 1 || pl == 2 || pl == 5)nphit_i++;
939                  };  //        };
940              // --- modified to count tdc signals (more efficient?)
941              // --- and to implement check on tdcflag
942              for (Int_t ih=0; ih < op->npmttdc; ih++){
943                Int_t pl = tof_obj->GetPlaneIndex( (op->pmttdc).At(ih) );
944    //          if( (op->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_p++;
945                if ( (use_S1 && ( pl == 0 || pl == 1 )) || (use_S2 && ( pl == 2 || pl == 3 )) || (use_S3 && ( pl == 4 || pl == 5 )) ){
946                  if( (op->tdcflag).At(ih)==0 )nphit_p++;
947                };
948              };
949                                    
950                  for (Int_t ih=0; ih < oi->npmtadc; ih++){            for (Int_t ih=0; ih < oi->npmttdc; ih++){
951                      Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );              Int_t pl = tof_obj->GetPlaneIndex( (oi->pmttdc).At(ih) );
952                      if(pl == 1 || pl == 2 || pl == 5)nphit_i++;  //          if( (oi->tdcflag).At(ih)==0 && (pl == 1 || pl == 2 || pl == 5) )nphit_i++;  
953                  };              if ( (use_S1 && ( pl == 0 || pl == 1 )) || (use_S2 && ( pl == 2 || pl == 3 )) || (use_S3 && ( pl == 4 || pl == 5 )) ){
954                  if( (oi->tdcflag).At(ih)==0 )nphit_i++;  
955                };
956              };
957                                    
958                  if(            if(
959                      use_TOF            &&               (nphit_p+nphit_i) !=0 &&  
960                      (nphit_p+nphit_i) !=0 &&                   true){
                     true){  
961                                            
962                      if( nphit_p >= nphit_i) tp_score++;              if ( nphit_p != nphit_i ){
963                      else ti_score++;                totp_score += nphit_p;
964                  };                toti_score += nphit_i;
965  //              cout << "TOF "<<tp_score<<ti_score<<endl;                tp_score+=nphit_p;
966              };                ti_score+=nphit_i;
             if(tp_score == ti_score) use_TRK = true;  
             // ------------------------  
             // tracker check  
             // ------------------------  
             // chi**2 difference is not always large enough to distinguish among  
             // the real track and its image.  
             // Tracker check will be applied always when calorimeter and tof information is ambiguous.  
             if(use_TRK){  
                 if(      tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ;  
                 else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ;  
 //              cout << "TRK "<<tp_score<<ti_score<<endl;  
967              };              };
968                //      if     ( nphit_p > nphit_i) tp_score+=nphit_p;
969                //      else if( nphit_p < nphit_i) ti_score+=nphit_i;
970                //      else ;//niente
971              };
972            };
973            //      cout << "TOF "<<tp_score<<ti_score<<endl;
974          };
975    
976    
977    //      if(tp_score == ti_score) use_TRK = true;
978    
979    
980          // -----------------------------------------------------------------------------------------
981          // tracker check
982          // -----------------------------------------------------------------------------------------
983          // chi**2 difference is not always large enough to distinguish among
984          // the real track and its image.
985          // Tracker check will be applied always when calorimeter and tof information is ambiguous.
986          // *** MODIFIED ON AUGUST 2007 ***
987          if(use_TRK){
988    //      if(      tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ;
989    //      else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ;
990    
991              // CHECK 1 : number of points along X  
992            if ( tp->GetNX() >= ti->GetNX() ){
993              tp_score++ ;
994              totp_score++ ;
995            };
996            if ( tp->GetNX() <= ti->GetNX() ){
997              ti_score++ ;
998              toti_score++ ;
999            };
1000              // CHECK 2 : number of points along Y  
1001            if ( tp->GetNY() >= ti->GetNY() ){
1002              tp_score++ ;
1003              totp_score++ ;
1004            };
1005            if ( tp->GetNY() <= ti->GetNY() ){
1006              ti_score++ ;
1007              toti_score++ ;
1008            };
1009              // CHECK 3 : chi**2 along X  
1010    //        if(      tp->GetChi2X() > 0 && (tp->GetChi2X() < ti->GetChi2X() || ti->GetChi2X() <=0) ) tp_score++ ;
1011    //        if(      ti->GetChi2X() > 0 && (ti->GetChi2X() < tp->GetChi2X() || tp->GetChi2X() <=0) ) ti_score++ ;
1012              // CHECK 4 : chi**2 along Y  
1013    //        if(      tp->GetChi2Y() > 0 && (tp->GetChi2Y() < ti->GetChi2Y() || ti->GetChi2Y() <=0) ) tp_score++ ;
1014    //        if(      ti->GetChi2Y() > 0 && (ti->GetChi2Y() < tp->GetChi2Y() || tp->GetChi2Y() <=0) ) ti_score++ ;
1015              // CHECK 5 : total chi**2  
1016    //        if(      tp->chi2 > 0 && (tp->chi2 < ti->chi2 || ti->chi2 <=0) ) tp_score++ ;
1017    //        if(      ti->chi2 > 0 && (ti->chi2 < tp->chi2 || tp->chi2 <=0) ) ti_score++ ;
1018    
1019            //      cout << "TRK "<<tp_score<<ti_score<<endl;
1020          };
1021                            
1022              // ------------------------  
1023              // the winner is....  
1024              // ------------------------            // *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
1025              if      (tp_score > ti_score) {        // the winner is....
1026  //              ts = tp;//the track sorted by the tracker!!        // *-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
1027  //              cs = cp;        if      (tp_score > ti_score) {
1028  //              os = op;          
1029              }else if (tp_score < ti_score) {  
1030                  ts = ti;//its image!!        }else if (tp_score < ti_score) {
1031                  cs = ci;  
1032                  os = oi;  
1033            ts = ti;//its image!!
1034                  ti = tp;//its image!!          cs = ci;
1035                  ci = cp;          os = oi;
1036                  oi = op;          Int_t totis = toti_score;
1037    
1038                  tp = ts;//its image!!          ti = tp;//its image!!
1039                  cp = cs;          ci = cp;
1040                  op = os;          oi = op;
1041    
1042            tp = ts;//its image!!
1043            cp = cs;
1044            op = os;
1045    
1046            toti_score = totp_score;
1047            totp_score = totis;
1048    
1049                                    
1050              }else {        }else {
1051  //              ts = tp;  
1052  //              cs = cp;  //      cout << "Warning - track image ambiguity not solved" << endl;
1053  //              os = op;  
1054  //                              cout << "Warning - track image ambiguity not solved" << endl;        };
 //                              cout << ts->GetNtot() << " "<< ts->chi2 << " " << npcfit[1] << " "<< nphit_p << endl;  
             };  
1055                            
1056          }else{      }else{
1057  //          ts = tp;        totp_score = 1;
1058  //          cs = cp;        toti_score = 0;
1059  //          os = op;        
1060          };        //            ts = tp;
1061                  //            cs = cp;
1062  //      cout <<" SortTracks() "<<i<<" -- "<<ts<<endl;        //            os = op;
1063  //      sorted_tracks->Add(ts);//save the track in the sorted array      };
1064  //      sorted_tracks.Add(ts);//save the track in the sorted array          
1065  //      sorted_tracks.Add(tp);//save the track in the sorted array      //  cout <<" SortTracks() "<<i<<" -- "<<ts<<endl;
1066  //      cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl;      //  sorted_tracks->Add(ts);//save the track in the sorted array
1067  //      cout<<"o "<<tp<<endl;      //  sorted_tracks.Add(ts);//save the track in the sorted array
1068  //      cout<<"o "<<cp<<endl;      //  sorted_tracks.Add(tp);//save the track in the sorted array
1069  //      cout<<"o "<<op<<endl;      //  cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl;
1070          new(ttsorted[i]) PamTrack(tp,cp,op);      //  cout<<"o "<<tp<<endl;
1071          new(ttimage[i])  PamTrack(ti,ci,oi);      //  cout<<"o "<<cp<<endl;
1072      };      //  cout<<"o "<<op<<endl;
1073    
1074      if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){      new(ttsorted[i]) PamTrack(tp,cp,op);
1075          cout << "void PamLevel2::SortTracks(TString how): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl;      new(ttimage[i])  PamTrack(ti,ci,oi);
1076          tsorted->Delete(); tsorted=0;  
1077          timage->Delete(); timage=0;          ((PamTrack*)(ttsorted[i]))->SetPScore(totp_score);
1078      }      ((PamTrack*)(ttsorted[i]))->SetIScore(toti_score);
1079        ((PamTrack*)(ttimage[i]))->SetPScore(totp_score);
1080      //Restore Object count      ((PamTrack*)(ttimage[i]))->SetIScore(toti_score);
1081      //To save space in the table keeping track of all referenced objects    };
1082      //We reset the object count to what it was at the beginning of the event.  
1083      TProcessID::SetObjectCount(ObjectNumber);    if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){
1084        cout << "void PamLevel2::SortTracks(): tsorted->GetEntries() "<<tsorted->GetEntries()<<" != trk2_obj->GetNTracks() = "<<trk2_obj->GetNTracks() <<endl;
1085        tsorted->Delete(); tsorted=0;
1086        timage->Delete(); timage=0;
1087      }
1088    
1089      //Restore Object count
1090      //To save space in the table keeping track of all referenced objects
1091      //We reset the object count to what it was at the beginning of the event.
1092      TProcessID::SetObjectCount(ObjectNumber);
1093            
1094  };  };
1095  //--------------------------------------  //--------------------------------------
# Line 833  void PamLevel2::SortTracks(TString how){ Line 1113  void PamLevel2::SortTracks(TString how){
1113  TClonesArray *PamLevel2::GetTracks(){  TClonesArray *PamLevel2::GetTracks(){
1114    
1115  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1116      SortTracks("+CAL+TOF");      SortTracks();
1117  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1118    
1119      return tsorted;      return tsorted;
# Line 852  PamTrack *PamLevel2::GetTrack(int it){ Line 1132  PamTrack *PamLevel2::GetTrack(int it){
1132    
1133  //    if(!trk2_obj) return 0;  //    if(!trk2_obj) return 0;
1134                    
1135  // //  *-*-*-*-*-*-*-*-*-*-*-*-*  // //  *-*-*-*+-*-*-*-*-*-*-*-*-*
1136  //     SortTracks("+CAL+TOF");  //     SortTracks("+CAL+TOF");
1137  // //  *-*-*-*-*-*-*-*-*-*-*-*-*  // //  *-*-*-*-*-*-*-*-*-*-*-*-*
1138  // //    if(!sorted_tracks)return 0;  // //    if(!sorted_tracks)return 0;
# Line 871  PamTrack *PamLevel2::GetTrack(int it){ Line 1151  PamTrack *PamLevel2::GetTrack(int it){
1151    
1152  //    cout << "PamLevel2::GetTrack(int it) "<<endl;  //    cout << "PamLevel2::GetTrack(int it) "<<endl;
1153  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1154      SortTracks("+CAL+TOF");      SortTracks();
1155  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1156      if(!tsorted)return 0;      if(!tsorted)return 0;
1157      if(!tsorted->GetEntries())return 0;      if(!tsorted->GetEntries())return 0;
# Line 928  PamTrack *PamLevel2::GetTrackImage(int i Line 1208  PamTrack *PamLevel2::GetTrackImage(int i
1208    
1209    
1210  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1211      SortTracks("+CAL+TOF");      SortTracks();
1212  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1213      if(!timage)return 0;      if(!timage)return 0;
1214      if(!timage->GetEntries())return 0;      if(!timage->GetEntries())return 0;
# Line 1327  TChain *PamLevel2::GetPamTree(TList *fl, Line 1607  TChain *PamLevel2::GetPamTree(TList *fl,
1607      };      };
1608            
1609      cout << "done chain \n";      cout << "done chain \n";
1610        cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
1611    
1612  //    UInt_t *found=0;  //    UInt_t *found=0;
1613  // Tracker  // Tracker
# Line 1412  TChain *PamLevel2::GetPamTree(TList *fl, Line 1693  TChain *PamLevel2::GetPamTree(TList *fl,
1693      }else{      }else{
1694          cout << "OrbitalInfo  : missing tree"<<endl;          cout << "OrbitalInfo  : missing tree"<<endl;
1695      };      };
1696        cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
1697    
1698      // Selection List      // Selection List
1699      if(L && SELLI==1) {      if(L && SELLI==1) {
# Line 1423  TChain *PamLevel2::GetPamTree(TList *fl, Line 1705  TChain *PamLevel2::GetPamTree(TList *fl,
1705          sel_tree = L;          sel_tree = L;
1706  //      if(!Trout)Trout=O;  //      if(!Trout)Trout=O;
1707  //      else Trout->AddFriend("SelectionList");  //      else Trout->AddFriend("SelectionList");
1708            cout << "----------------------------------------------------" <<endl;
1709      }else{      }else{
1710  //      cout << "SelectionList  : missing tree"<<endl;  //      cout << "SelectionList  : missing tree"<<endl;
1711          if(L)L->Delete();          if(L)L->Delete();
# Line 1692  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 1975  Bool_t PamLevel2::UpdateRunInfo(TChain *
1975    //    //
1976    // check if we have already called once GetEntry, if not call it    // check if we have already called once GetEntry, if not call it
1977    //    //
1978        cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- ATTENZIONE --- NON E` MANTENUTA!!!!!!!.... "<<endl;
1979      if(!run){      if(!run){
1980            cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree "<<endl;            cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing RunInfo tree "<<endl;
1981            return(false);                    return(false);        
# Line 1707  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 1991  Bool_t PamLevel2::UpdateRunInfo(TChain *
1991    // --------------------------------------    // --------------------------------------
1992    if(SELLI==0){    if(SELLI==0){
1993    
1994        if( !GetOrbitalInfo() ){        //
1995          // the absolute time is necessary to relate the event with the run
1996          //
1997          if( !GetOrbitalInfo() && !ISGP){
1998            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;
1999            return(false);            return(false);
2000        }        }
2001    
2002          ULong64_t abstime = 0;
2003          if( GetOrbitalInfo() )abstime=GetOrbitalInfo()->absTime;
2004    
2005    
2006          //
2007          // the first time the routine is called, set run search from the beginning
2008          //
2009        if ( irun < 0LL ){        if ( irun < 0LL ){
2010            irun = 0LL;            irun = 0LL;
2011            run->GetEntry(irun);            run->GetEntry(irun);
2012            runfirstentry = 0LL;            runfirstentry = 0LL;
2013            runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS);            runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS);
2014            if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL;            if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL;
2015  //        cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;            
2016  //        cout << "runfirstentry "<<runfirstentry<<endl;            if( ISGP && run->GetEntries()!=1 ){
2017  //        return(true);                cout << "** WARNING ** simulated files are assumed to have 1 single run, not "<< run->GetEntries() << endl;
2018                  cout << "** WARNING ** run will not be updated"<<endl;
2019              }
2020    
2021        };              };      
2022        //        //
2023         if ( irun == run->GetEntries()-1LL &&        if(ISGP)abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO
2024             !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME &&        //
2025               GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME)        if ( irun == run->GetEntries()-1LL &&
2026               !(abstime >= GetRunInfo()->RUNHEADER_TIME &&
2027                 abstime <= GetRunInfo()->RUNTRAILER_TIME)
2028              ){              ){
2029           irun = -1LL;           irun = -1LL;
2030           runfirstentry = 0LL;           runfirstentry = 0LL;
# Line 1736  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 2035  Bool_t PamLevel2::UpdateRunInfo(TChain *
2035        //        //
2036        bool fromfirst = true;        bool fromfirst = true;
2037        //        //
2038        while ( !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries()-1LL ){        while ( !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries()-1LL ){
2039  //      while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){  //      while ( iev > (runfirstentry+(ULong64_t)(this->GetRunInfo()->NEVENTS-1)) && irun < run->GetEntries() ){
2040            irun++;            irun++;
2041            run->GetEntry(irun);            run->GetEntry(irun);
# Line 1746  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 2045  Bool_t PamLevel2::UpdateRunInfo(TChain *
2045  //        cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;  //        cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
2046  //        cout << "runfirstentry "<<runfirstentry<<endl;  //        cout << "runfirstentry "<<runfirstentry<<endl;
2047            //      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)));
2048            //      printf(" abstime %u trailertime %u \n",GetOrbitalInfo()->absTime,GetRunInfo()->RUNTRAILER_TIME);            //      printf(" abstime %u trailertime %u \n",abstime,GetRunInfo()->RUNTRAILER_TIME);
2049            //      printf(" IDRUN %u \n",GetRunInfo()->ID);            //      printf(" IDRUN %u \n",GetRunInfo()->ID);
2050            //            //
2051  //        prevshift = 0;  //        prevshift = 0;
2052            //            //
2053            if ( irun == (Long64_t)(run->GetEntries()-1LL) && fromfirst && !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME)){            if ( irun == (Long64_t)(run->GetEntries()-1LL) && fromfirst && !(abstime >= GetRunInfo()->RUNHEADER_TIME && abstime <= GetRunInfo()->RUNTRAILER_TIME)){
2054                printf(" resetting irun  (it should NOT happen!!!)\n");                printf(" resetting irun  (it should NOT happen!!!)\n");
2055                fromfirst = false;                fromfirst = false;
2056                irun = 0;                irun = 0;
# Line 1764  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 2063  Bool_t PamLevel2::UpdateRunInfo(TChain *
2063        };        };
2064        //        //
2065        if (        if (
2066             !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME &&             !(abstime >= GetRunInfo()->RUNHEADER_TIME &&
2067               GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME)               abstime <= GetRunInfo()->RUNTRAILER_TIME)
2068            ) {            ) {
2069            printf(" Something very wrong here: cannot find RUN containing absolute time %u \n",GetOrbitalInfo()->absTime);          printf(" Something very wrong here: cannot find RUN containing absolute time %llu \n",abstime);
2070            return false;            return false;
2071        }        }
2072        //        //
# Line 1800  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 2099  Bool_t PamLevel2::UpdateRunInfo(TChain *
2099    //    //
2100  };  };
2101    
2102  // Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev){  Bool_t PamLevel2::UpdateRunInfo(Long64_t iev){
2103  //   //  
2104  //   // check if we have already called once GetEntry, if not call it      if(!run_tree){
2105  //   //          cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree not loaded"<<endl;
2106  //     if(!run_tree){          return false;
2107  //      cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree not loaded"<<endl;      }
2108  //      return false;      if ( run_tree->GetEntries() <= 0 ) {
2109  //     }          cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree is empty"<<endl;
2110  //     if ( run_tree->GetEntries() <= 0 ) {          return(false);
2111  //      cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree is empty"<<endl;      }
 //      return(false);  
 //     }  
 //   //  
2112        
2113  //   Int_t oldrun = irun;      Int_t oldrun = irun; // store current run index
2114  //   // --------------------------------------  
2115  //   // if it is a full file (not preselected)      // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
2116  //   // --------------------------------------      // if it is a full file (not preselected)
2117  //   if(SELLI==0){      // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
2118        if(SELLI==0){
2119  //       if( !GetOrbitalInfo() ){  
2120  //        cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing OrbitalInfo "<<endl;          // ---------------------------------------------------------------
2121  //        return(false);          // increment dead and live-time counters
2122  //       }          // ---------------------------------------------------------------
2123            if( GetTrigLevel2() ){
2124  //       if ( irun < 0 ){              totdltime[0]+=GetTrigLevel2()->dltime[0];
2125  //        irun = 0;              totdltime[1]+=GetTrigLevel2()->dltime[1];
2126  //        run_tree->GetEntry(irun);          }
2127  //        runfirstentry = iev;          totdltime[2]++;
2128  //        if( iev != 0){  
2129  //            cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- WARNING -- "<<endl;  //      cout << setw(10)<<totdltime[0]<<setw(10)<<totdltime[1]<<setw(10)<<totdltime[2]<<endl;
2130  //        }  
2131  //       };                // ---------------------------------------------------------------
2132            // retrieve OBT and absolute time of the event
2133  //       bool fromfirst = true;          // ---------------------------------------------------------------
2134            ULong64_t abstime = 0;
2135  //       while ( !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries() ){          ULong64_t obt     = 0;
2136  //        irun++;          if( GetOrbitalInfo() ){
2137  //        if( irun == run->GetEntries() ){              abstime = GetOrbitalInfo()->absTime;
2138  //            if(!fromfirst){              obt     = GetOrbitalInfo()->OBT;
2139  //                cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- event entry #"<<iev<<" does not belong to any run (should not happen)" <<endl;          }
2140  //                return false;          // ---------------------------------------------------------------
2141  //            }          // the absolute time is necessary to relate the event with the run
2142  //            cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- reached end of run tree. searchin again from beginning (should not happen)" <<endl;          // ---------------------------------------------------------------
2143  //            fromfirst = false;          if( !GetOrbitalInfo() && !ISGP ){
2144  //            irun =0;              cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl;
2145  //        }              return(false);
2146  //        run_tree->GetEntry(irun);          }
2147  //        runfirstentry = iev;        
2148  //       };          // -----------------------------------------------------------------------
2149  //       //          // the first time the routine is called, set run search from the beginning
2150  //       if ( irun == oldrun ) return(false);          // -----------------------------------------------------------------------
2151  //       //          if ( irun < 0 ){
2152  //       cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;              irun = 0LL;
2153  //       cout << "runfirstentry "<<runfirstentry<<endl;              irunentry = 0;
2154  //       prevshift = 0;              prevshift = 0;
2155  //       return(true);                  run_tree->GetEntry(irun);
2156  //   };  
2157  //   // ----------------------------------------------------              if( ISGP && run_tree->GetEntries()!=1 ){
2158  //   // if it is a preselected file (there is SelectionList)                  cout << "** WARNING ** simulated files are assumed to have 1 single run, not "<< run_tree->GetEntries() << endl;
2159  //   // NBNB - the event tree MUST be read first                  cout << "** WARNING ** run will not be updated"<<endl;
2160  //   // ----------------------------------------------------              }
2161  //   if(SELLI==1){                };      
2162  //       sel_tree->GetEntry(iev);  
2163  //       if(irun != oldrun){          // -----------------------------------------------------------------------
2164  //        run->GetEntry(irun);          // if it is simulation, assign abstime by hand (temporaneo!!!)
2165  //        cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;          // -----------------------------------------------------------------------
2166  //        prevshift = 0;          if(ISGP){
2167  //        return true;              abstime = GetRunInfo()->RUNHEADER_TIME; // BARBATRUCCO
2168  //       }              obt     = GetRunInfo()->RUNHEADER_OBT; // BARBATRUCCO
2169  //       return false;          }
2170  //   }          //
2171            bool fromfirst = true; // first loop over runs
2172  //   return false;  
2173  //   //  //      Bool_t hasfrag = false;
2174  // };  //      if( GetRunInfo()->ID_RUN_FRAG!=0 && GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID)hasfrag=true;
2175    //      ULong64_t fragid = GetRunInfo()->ID_RUN_FRAG;
2176    
2177            // ------------------------------------------------------
2178            // loop over runs to find the one that contains the event
2179            // ------------------------------------------------------
2180            while (
2181                (
2182                    (
2183                        !(abstime >= GetRunInfo()->RUNHEADER_TIME &&    // check on absolute time (s)
2184                          abstime <= GetRunInfo()->RUNTRAILER_TIME) &&
2185                        !(obt >= GetRunInfo()->RUNHEADER_OBT &&         // additional check on OBT (ms)
2186                          obt <= GetRunInfo()->RUNTRAILER_OBT)
2187                        )
2188                    || GetRunInfo()->NEVENTS==0
2189    //              || !(irunentry < GetRunInfo()->NEVENTS-1-prevshift) // ERRORE!!! fa saltare i run con 1 evento
2190                    || !(irunentry <= GetRunInfo()->NEVENTS-1-prevshift)
2191                    )
2192                    && irun < run_tree->GetEntries() ){
2193    
2194                // - - - - - - - - - - - - -
2195                // irunentry = position of current entry, relative to the run
2196                // prevshift = shift needed to synchronize l0 and l2 data (nested events)
2197                // - - - - - - - - - - - - -
2198    
2199                // -----------------------------------------
2200                // store dead and live-time of previous run
2201                // -----------------------------------------
2202                if(fromfirst){
2203                    if(oldrun==irun){
2204                        /// decrement counters
2205                        if( GetTrigLevel2()){
2206                            totdltime[0]-=GetTrigLevel2()->dltime[0];//live-time
2207                            totdltime[1]-=GetTrigLevel2()->dltime[1];//dead-time
2208                        }
2209                        totdltime[2]--;                              //event counter
2210                        cout << endl;
2211                        cout << "n.events     : "<<totdltime[2]<<endl;
2212                        cout << "RUN LIVE-TIME: "<<totdltime[0]*0.16<<" ms"<<endl;
2213                        cout << "RUN DEAD-TIME: "<<totdltime[1]*0.01<<" ms"<<endl;      
2214                    }else{
2215                        totdltime[0]=0;//live-time
2216                        totdltime[1]=0;//dead-time
2217                        totdltime[2]=0;                             //event counter
2218                        cout << " *** JUMP RUN *** irun "<<irun<<endl;
2219                    }
2220                    /// add an entry
2221                    if(run_tree_clone)
2222                        if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries())
2223                            run_tree_clone->GetBranch("DeadLiveTime")->Fill();
2224                    /// reset counters
2225                    if( GetTrigLevel2() ){
2226                        totdltime[0]=GetTrigLevel2()->dltime[0];//live-time
2227                        totdltime[1]=0;                         //dead-time
2228                    }
2229                    totdltime[2]=1;                             //event counter
2230                }
2231    
2232    
2233                irun++;
2234                // ------------------------------------
2235                // if the end of run tree is reached...
2236                // ------------------------------------
2237                if( irun == run_tree->GetEntries() ){
2238                    if(!fromfirst){
2239                        // -----------------------------------------------------
2240                        // if it happened already once and the run was not found
2241                        // ---> exit with error
2242                        // -----------------------------------------------------
2243                        cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- event entry #"<<iev<<" does not belong to any run (should not happen)" <<endl;
2244                        return false;
2245                    }
2246                    // -----------------------------------------
2247                    // ...otherwise repeat search from beginning
2248                    // -----------------------------------------
2249                    cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- reached end of run tree. searchin again from beginning " <<endl;
2250                    fromfirst = false;
2251                    irun = 0LL;
2252                    runfirstentry = 0LL;
2253                }
2254                // -------------------------------------------------------------------
2255                // save the index of the first entry of the run, relative to pam_tree,
2256                // and read a new run
2257                // -------------------------------------------------------------------
2258                if(irun>0)runfirstentry += (GetRunInfo()->NEVENTS)-prevshift;
2259                irunentry = 0;
2260                prevshift = 0;          
2261                run_tree->GetEntry(irun);      
2262                if(GetRunInfo()->RUNHEADER_OBT>GetRunInfo()->RUNTRAILER_OBT ){
2263                    cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun "<<irun<<"  has RUNHEADER_OBT>=RUNTRAILER_OBT " <<endl;
2264                    cout << "                                                            (NB!! in this case some events are assigned to a wrong run)"<<endl;
2265                }
2266    //          if(hasfrag &&  fragid != GetRunInfo()->ID){
2267    //              cout << "... where is the next fragment ??"<<endl;
2268    //          }
2269            };
2270    
2271    
2272            // --------------------------------------
2273            // if there was no need to update the run
2274            // ---> exit with FALSE
2275            // --------------------------------------
2276            if ( irun == oldrun ) return(false);
2277    
2278            // --------------------------------------
2279            // ... otherwise
2280            // --------------------------------------
2281    
2282    
2283    
2284    //      // -----------------------------------------
2285    //      // store dead and live-time of previous run
2286    //      // -----------------------------------------
2287    //      // --------------------------------------------------------------
2288    //      // if the run is empty, fill the dead-live time branch with zeros
2289    //      // --------------------------------------------------------------
2290    //      /// if some runs have been jumped, fill with zeros
2291    //      if(irun-oldrun>1){
2292    //          ULong64_t  temp[3];
2293    //          temp[0]=totdltime[0];
2294    //          temp[1]=totdltime[1];
2295    //          temp[2]=totdltime[2];
2296    //          for(int i=oldrun+1; i<irun; irun++){
2297    //              totdltime[0]=0;
2298    //              totdltime[1]=0;
2299    //              totdltime[2]=0;
2300    //              cout << " ** JUMPED RUN **"<<endl;
2301    //              if(run_tree_clone)
2302    //                  if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries())
2303    //                      run_tree_clone->GetBranch("DeadLiveTime")->Fill();
2304    //          }
2305    //          totdltime[0]=temp[0];
2306    //          totdltime[1]=temp[1];
2307    //          totdltime[2]=temp[2];
2308    //      }
2309    //      /// decrement counters
2310    //      if( GetTrigLevel2() ){
2311    //          totdltime[0]-=GetTrigLevel2()->dltime[0];//live-time
2312    //          totdltime[1]-=GetTrigLevel2()->dltime[1];//dead-time
2313    //      }
2314    //      totdltime[2]--;                              //event counter
2315    //      /// add an entry
2316    //      if(irun>0 ){
2317    //          cout << endl;
2318    //          cout << "n.events     : "<<totdltime[2]<<endl;
2319    //          cout << "RUN LIVE-TIME: "<<totdltime[0]*0.16<<" ms"<<endl;
2320    //          cout << "RUN DEAD-TIME: "<<totdltime[1]*0.01<<" ms"<<endl;      
2321    //          if(run_tree_clone)
2322    //              if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries())
2323    //                  run_tree_clone->GetBranch("DeadLiveTime")->Fill();
2324    //      }
2325    //      /// reset counters
2326    //      if( GetTrigLevel2() ){
2327    //          totdltime[0]=GetTrigLevel2()->dltime[0];//live-time
2328    //          totdltime[1]=0;                         //dead-time
2329    //      }
2330    //      totdltime[2]=1;                             //event counter
2331            
2332    
2333            // --------------------------------------
2334            // ---> exit with TRUE
2335            // --------------------------------------
2336            cout << endl << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
2337            // ----------------------------------------------------
2338            // then check if the run has a fragment
2339            // in this case we have to switch to the next fragment
2340            // when the end of the first fragment is reached
2341            // ----------------------------------------------------
2342            if(
2343                GetRunInfo()->ID_RUN_FRAG != 0 &&
2344    //          GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID &&
2345                true ){
2346                cout << "* fragment *"<<endl;              
2347            }
2348    
2349            return(true);    
2350        };
2351        // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
2352        // if it is a preselected file (there is SelectionList)
2353        // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
2354        if(SELLI==1){      
2355            sel_tree->GetEntry(iev);
2356            if(irun != oldrun){
2357                run_tree->GetEntry(irun);
2358                cout << endl << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
2359                prevshift = 0;
2360                return true;
2361            }
2362            return false;
2363        }
2364    
2365        return false;
2366        //
2367    };
2368  /**  /**
2369   * 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)
2370   * @param run Pointer to the chain/tree which contains run infos   * @param run Pointer to the chain/tree which contains run infos
# Line 2505  void PamLevel2::CreateCloneTrees0( TChai Line 2994  void PamLevel2::CreateCloneTrees0( TChai
2994   */   */
2995  void PamLevel2::CreateCloneTrees(TFile *ofile){  void PamLevel2::CreateCloneTrees(TFile *ofile){
2996    
2997    
2998    //  if the pointer is null, create a default file
2999    
3000        if(!ofile){
3001            cout << "void PamLevel2::CreateCloneTrees(TFile*) -- WARNING -- Creating file: clone-tree.root "<<endl;
3002            ofile = new TFile("clone-tree.root","recreate");
3003        }
3004    
3005      ofile->cd();      ofile->cd();
3006    
3007      cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;      cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
# Line 2516  void PamLevel2::CreateCloneTrees(TFile * Line 3013  void PamLevel2::CreateCloneTrees(TFile *
3013      cout << "Run          : branch RunInfo"<<endl;      cout << "Run          : branch RunInfo"<<endl;
3014      run_tree_clone->Branch("SoftInfo","SoftInfo",GetPointerTo("SoftInfo"));      run_tree_clone->Branch("SoftInfo","SoftInfo",GetPointerTo("SoftInfo"));
3015      cout << "Run          : branch SoftInfo"<<endl;      cout << "Run          : branch SoftInfo"<<endl;
3016                    // ------------------
3017        // replicate run tree
3018        // ------------------
3019        cout << "----------------------------------------------------"<<endl;
3020        cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl;
3021        for (Int_t i=0; i<run_tree->GetEntries(); i++){
3022            run_tree->GetEntry(i);
3023            cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl;
3024            run_tree_clone->Fill();
3025        }
3026        cout << "----------------------------------------------------"<<endl;
3027    
3028        // ------------------------------------
3029        // add branch with dead and live times
3030        // ------------------------------------
3031        run_tree_clone->Branch("DeadLiveTime",totdltime,"dltime[3]/l");
3032        cout << "Run          : branch DeadLiveTime"<<endl;
3033    
3034    
3035      sel_tree_clone = new TTree("SelectionList","List of selected events ");      sel_tree_clone = new TTree("SelectionList","List of selected events ");
# Line 2531  void PamLevel2::CreateCloneTrees(TFile * Line 3044  void PamLevel2::CreateCloneTrees(TFile *
3044              pam_tree_clone[i]->Branch("TrkLevel1","TrkLevel1", GetPointerTo("TrkLevel1"));              pam_tree_clone[i]->Branch("TrkLevel1","TrkLevel1", GetPointerTo("TrkLevel1"));
3045              pam_tree_clone[i]->BranchRef();              pam_tree_clone[i]->BranchRef();
3046              cout << "Tracker      : branch TrkLevel1"<<endl;              cout << "Tracker      : branch TrkLevel1"<<endl;
3047              cout << "CreateCloneTrees " << GetTrkLevel1()<<endl;  //          cout << "CreateCloneTrees " << GetTrkLevel1()<<endl;
3048          };          };
3049          if(TRK2) {          if(TRK2) {
3050              pam_tree_clone[i]->Branch("TrkLevel2", "TrkLevel2",GetPointerTo("TrkLevel2"));              pam_tree_clone[i]->Branch("TrkLevel2", "TrkLevel2",GetPointerTo("TrkLevel2"));
# Line 2644  TTree* PamLevel2::GetCloneTree(TString n Line 3157  TTree* PamLevel2::GetCloneTree(TString n
3157  void PamLevel2::WriteCloneTrees(){  void PamLevel2::WriteCloneTrees(){
3158      cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;      cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
3159      cout << "Write clones of PAMELA trees "<<endl;      cout << "Write clones of PAMELA trees "<<endl;
3160      cout << run_tree_clone->GetName()<<endl;          cout << run_tree_clone->GetName()<<endl;  
3161        if(run_tree_clone->GetBranch("DeadLiveTime")->GetEntries() < run_tree->GetEntries())
3162            run_tree_clone->GetBranch("DeadLiveTime")->Fill();
3163      run_tree_clone->Write();      run_tree_clone->Write();
3164      cout << sel_tree_clone->GetName()<<endl;          cout << sel_tree_clone->GetName()<<endl;    
3165      sel_tree_clone->Write();      sel_tree_clone->Write();
# Line 2664  void PamLevel2::WriteCloneTrees(){ Line 3179  void PamLevel2::WriteCloneTrees(){
3179  //Int_t PamLevel2::GetEntry(Int_t iee){  //Int_t PamLevel2::GetEntry(Int_t iee){
3180  Int_t PamLevel2::GetEntry(Long64_t iee){  Int_t PamLevel2::GetEntry(Long64_t iee){
3181            
3182    //     cout << "-------------------------------------"<<endl;
3183    //     cout << "Int_t PamLevel2::GetEntry("<<iee<<")"<<endl;
3184    
3185      if(!pam_tree){      if(!pam_tree){
3186          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;
3187          return 0;          return 0;
# Line 2692  Int_t PamLevel2::GetEntry(Long64_t iee){ Line 3210  Int_t PamLevel2::GetEntry(Long64_t iee){
3210      //      //
3211      if(!run_tree ){      if(!run_tree ){
3212          if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1?          if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1?
3213                  cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl;              cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- run tree not loaded"<<endl;
3214                  return 0;              return 0;
3215          }  else {          }  else {
3216                  return 1; //cosi` se non c'e` run esce qua...              return 1; //cosi` se non c'e` run esce qua...
3217          }          }
3218      }      }
3219    
3220      //-------------------------------      //-------------------------------
3221      ii = iee;      ii = iee;
3222  //    Bool_t UPDATED = UpdateRunInfo(run_tree,ii);  //    Bool_t UPDATED = UpdateRunInfo(run_tree,ii);
3223      Bool_t UPDATED = UpdateRunInfo(ii);  //    Bool_t UPDATED = UpdateRunInfo(ii);
3224        UpdateRunInfo(ii);
3225      if(SELLI==0)irunentry = iee-runfirstentry;      if(SELLI==0)irunentry = iee-runfirstentry;
3226      if(UPDATED && run_tree_clone)run_tree_clone->Fill();  //    if(UPDATED && run_tree_clone)run_tree_clone->Fill();
3227      
3228  //    cout << "PamLevel2::GetEntry("<<iee<<") "<<irun<<" "<<runfirstentry<<" "<<irunentry<<endl;  //    cout << "PamLevel2::GetEntry("<<iee<<") "<<irun<<" "<<runfirstentry<<" "<<irunentry<<endl;
3229    
3230      if( TRK0 || CAL0 || TOF0 )GetYodaEntry( );  //     cout << "irunentry     "<<irunentry << endl;
3231    //     cout << "runfirstentry "<<runfirstentry << endl;
3232    //     cout << "nevents       "<<GetRunInfo()->NEVENTS<< endl;
3233    
3234    //     if( TRK0 || CAL0 || TOF0 ){
3235    //      if( !GetYodaEntry( ) ){
3236    //          cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading level0 tree"<<endl;
3237    //          return 0;
3238    //      }
3239    //     }
3240    
3241    
3242      return 1;      return 1;
3243    
3244  }  }
3245    
3246    TrkLevel0    *PamLevel2::GetTrkLevel0(){
3247        if( !TRK0 )return NULL;
3248        if( !GetYodaEntry( ) ){
3249            cout << " Int_t PamLevel2::GetTrkLevel0() -- ERROR -- error reading level0 tree"<<endl;
3250            return 0;
3251        }
3252        return trk0_obj;
3253    };
3254    CaloLevel0    *PamLevel2::GetCaloLevel0(){
3255        if( !CAL0 )return NULL;
3256        if( !GetYodaEntry( ) ){
3257            cout << " Int_t PamLevel2::GetCaloLevel0() -- ERROR -- error reading level0 tree"<<endl;
3258            return 0;
3259        }
3260        return calo0_obj;
3261    };
3262    
3263    
3264  /**  /**
3265   * Method to retrieve the level0 tree (YODA tree) that contains the current event.   * Method to retrieve the level0 tree (YODA tree) that contains the current event.
3266   * Given the run ID (...), if needed it query the DB and load the proper file.   * Given the run ID (...), if needed it query the DB and load the proper file.
# Line 2733  TTree* PamLevel2::GetYodaTree( ){ Line 3280  TTree* PamLevel2::GetYodaTree( ){
3280          return NULL;          return NULL;
3281      }          }    
3282      Int_t irootnew = run_obj->ID_ROOT_L0;      Int_t irootnew = run_obj->ID_ROOT_L0;
3283  //     cout << "iroot    "<<iroot<<endl;  //      cout << "iroot    "<<iroot<<endl;
3284  //     cout << "irootnew "<<irootnew<<endl;  //      cout << "irootnew "<<irootnew<<endl;
3285    
3286      //===================================      //===================================
3287      // load the level0 file      // load the level0 file
# Line 2791  TTree* PamLevel2::GetYodaTree( ){ Line 3338  TTree* PamLevel2::GetYodaTree( ){
3338              };              };
3339              l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent());              l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent());
3340          }          }
3341          //---------------------------------------------------          //--------------------------------------------------
3342          // CALORIMETER:          // CALORIMETER:
3343          if(CAL0){          if(CAL0){
3344              if(!calo0_obj){              if(!calo0_obj){
# Line 2841  Int_t PamLevel2::GetYodaEntry(){ Line 3388  Int_t PamLevel2::GetYodaEntry(){
3388            
3389      // patch      // patch
3390      if( irunentry < 0){      if( irunentry < 0){
3391          cout << "Int_t PamLevel2::GetYodaEntry() -- ATTENZIONE -- irunentry negativo?!?! "<<(Int_t)irunentry<<endl;  //      cout << "Int_t PamLevel2::GetYodaEntry() -- ATTENZIONE -- irunentry negativo?!?! "<<(Int_t)irunentry<<endl;
3392          irunentry=0LL;          irunentry=0LL;
3393      }      }
3394      //  ---------------------------------      //  ---------------------------------
3395      //  if file is NOT a preselected file      //  if file is NOT a preselected file
3396      //  ---------------------------------      //  ---------------------------------
3397      Long64_t quellagiusta = irunentry + (Long64_t)(run_obj->EV_FROM);      Long64_t quellagiusta = irunentry + (Long64_t)(run_obj->EV_FROM);
3398        //     cout << " irunentry "<<irunentry<<endl;
3399    //     cout << " EV_FROM "<<run_obj->EV_FROM<<endl;
3400    //     cout << " quellagiusta = irunentry + EV_FROM "<< quellagiusta << endl;
3401    
3402  //     cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl;  //     cout << " irun "<< irun << " irunentry "<< irunentry<<" run_obj->EV_FROM "<<run_obj->EV_FROM <<" quella giusta "<<quellagiusta << endl;
3403  //     cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl;  //     cout << " iroot "<<iroot<<" run_obj->ID_ROOT_L0 "<<run_obj->ID_ROOT_L0<<endl;
3404  //     cout << " time "<< GetOrbitalInfo()->absTime << endl;  //     cout << " time "<< abstime << endl;
3405  //     cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl;  //     cout << " trk_calib_used "<<run_obj->TRK_CALIB_USED<< endl;
3406            
3407      if( !GetOrbitalInfo() ){      ULong64_t obt     = 0;
3408        ULong64_t pktn    = 0;
3409        if( GetOrbitalInfo() ){
3410            obt     = GetOrbitalInfo()->OBT;
3411            pktn    = GetOrbitalInfo()->pkt_num;
3412        }
3413    
3414        if( !GetOrbitalInfo() && !ISGP){
3415          cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl;          cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing OrbitalInfo "<<endl;
3416          return 0;          return 0;
3417      }      }
3418      if( GetOrbitalInfo()->OBT==0 && GetOrbitalInfo()->pkt_num==0 ){      if( obt==0 && pktn==0 && !ISGP ){
3419          cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? "<<endl;          cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- level2 event corrupted ?? "<<endl;
3420          return 0;          return 0;
3421      }      }
# Line 2878  Int_t PamLevel2::GetYodaEntry(){ Line 3434  Int_t PamLevel2::GetYodaEntry(){
3434      Int_t answer = 0;      Int_t answer = 0;
3435      Int_t shift =0;      Int_t shift =0;
3436      //    printf(" siamo qui %i %i \n",shift,prevshift);      //    printf(" siamo qui %i %i \n",shift,prevshift);
3437        Int_t maxshift = 10;
3438      do{      do{
3439          if(shift>0){              if(shift>0){    
3440              cout << " level0 <--> level2 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl;              cout << " PKTNUM  L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl;
3441                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;
3442                cout << "         L2 <--> L0 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl;
3443          }          }
3444          answer = l0_tree->GetEntry(quellagiusta+(Long64_t)shift+(Long64_t)prevshift);          answer = l0_tree->GetEntry(quellagiusta+(Long64_t)shift+(Long64_t)prevshift);
3445          shift++;          shift++;
# Line 2888  Int_t PamLevel2::GetYodaEntry(){ Line 3447  Int_t PamLevel2::GetYodaEntry(){
3447              cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl;              cout << "Int_t PamLevel2::GetYodaEntry() -- ERROR -- missing EventHeader "<<endl;
3448              return 0;              return 0;
3449          }          }
3450  //      cout << "PKTNUM "<<shift<<" ==  L2 --- "<< GetOrbitalInfo()->pkt_num << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl;  
3451  //      cout << " L2 --- "<< GetOrbitalInfo()->OBT << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl;          if(ISGP){
3452                obt = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()); //BARBATRUCCO
3453                pktn = (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter()); //BARBATRUCCO
3454            }
3455    
3456    //      cout << "PKTNUM "<<shift<<" ==  L2 --- "<< pktn << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl;
3457    //      cout << " L2 --- "<< obt << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime()<<endl;
3458  //      if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl;  //      if( (quellagiusta+shift) == l0_tree->GetEntries()+1 )cout << ">>> end of level0 tree <<<"<<endl;
3459  //      cout << " GetOrbitalInfo()->OBT "<< GetOrbitalInfo()->OBT << endl;  //      cout << " obt "<< obt << endl;
3460  //      cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl;  //      cout << " GetEventHeader()->GetPscuHeader()->GetOrbitalTime() "<< GetEventHeader()->GetPscuHeader()->GetOrbitalTime() << endl;
3461  //      cout << " GetOrbitalInfo()->pkt_num "<< GetOrbitalInfo()->pkt_num << endl;  //      cout << " pktn "<< pktn << endl;
3462  //      cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl;  //      cout << " GetEventHeader()->GetPscuHeader()->GetCounter() "<< GetEventHeader()->GetPscuHeader()->GetCounter() << endl;
3463  //      printf(" IDRUN %u \n",GetRunInfo()->ID);  //      printf(" IDRUN %u \n",GetRunInfo()->ID);
3464  //  //
# Line 2902  Int_t PamLevel2::GetYodaEntry(){ Line 3467  Int_t PamLevel2::GetYodaEntry(){
3467            shift = -1;            shift = -1;
3468          };          };
3469    
3470      }while( ( GetOrbitalInfo()->OBT != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || GetOrbitalInfo()->pkt_num != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() );      }while( ( obt != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) ||
3471                  pktn != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())       )
3472      if ( (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() ) cout << " Big trouble here, no such event in Level0 data! " <<endl;              && (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() && shift < maxshift);
3473    
3474        if ( (quellagiusta+(Long64_t)shift+(Long64_t)prevshift) > GetYodaTree()->GetEntries() || shift == maxshift ) {
3475            cout << " Big trouble here, no such event in Level0 data! " <<endl;
3476            return 0;
3477        }
3478  //    cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl;  //    cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl;
3479  //    return GetYodaTree()->GetEntry(quellagiusta);  //    return GetYodaTree()->GetEntry(quellagiusta);
3480      if ( shift > 1 ) prevshift += (shift-1);      if ( shift > 1 ) prevshift += (shift-1);
# Line 2913  Int_t PamLevel2::GetYodaEntry(){ Line 3482  Int_t PamLevel2::GetYodaEntry(){
3482      return answer;      return answer;
3483            
3484  }  }
3485    /**
3486     * \Brief Set DB connection
3487     */
3488    Bool_t PamLevel2::SetDBConnection(){
3489    
3490        cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl;
3491        cout<<"Connecting to DB"<<endl;
3492        cout<<"HOST "<<host<<endl;
3493        cout<<"USER "<<user<<endl;
3494        cout<<"PSW  "<<psw<<endl;
3495        dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data());
3496        if( !dbc )return false;
3497        if( !dbc->IsConnected() )return false;    
3498        cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl;
3499        return true;
3500    
3501    }
3502    
3503    /**
3504     * \Brief Add a friend to the pamela chain.
3505     * @param cname name of the chain to be added
3506     */
3507    
3508    TChain* PamLevel2::AddFriend(TString cname){
3509    
3510        if(!GetPamTree()){
3511            cout << " TChain* PamLevel2::AddFriend(TString cname) --- a pamela tree must be created first"<<endl;
3512            return NULL;
3513        }
3514    
3515    
3516        TChain *c = new TChain( cname.Data() );
3517    
3518        TIter next( GetPamTree()->GetListOfFiles() );
3519        Int_t nf = 0;
3520        TChainElement* element = 0;    
3521        while ((element = (TChainElement*) next())) {      
3522            c->Add(element->GetTitle());
3523            nf++;
3524        }
3525    
3526        GetPamTree()->AddFriend(cname.Data());
3527    
3528        cout << "external chain created and added to pamela friends :"<<cname<<endl;
3529        cout << "n.files "<<nf<<endl;
3530        
3531    
3532        return c;    
3533    
3534    }
Legend:
Removed from v.1.35  
changed lines
  Added in v.1.49
  ViewVC Help
Powered by ViewVC 1.1.23