/[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.40 by pam-fi, Fri May 25 13:38:51 2007 UTC
# Line 200  void PamLevel2::Initialize(){ Line 200  void PamLevel2::Initialize(){
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 300  void PamLevel2::Clear(){ Line 304  void PamLevel2::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();  
     if(calo0_obj) calo0_obj->Clear();    
307      if(trk1_obj) trk1_obj->Clear();          if(trk1_obj) trk1_obj->Clear();    
308      if(trk2_obj) trk2_obj->Clear();      if(trk2_obj) trk2_obj->Clear();
309      if(trkh_obj) trkh_obj->Clear();      if(trkh_obj) trkh_obj->Clear();
310        if(calo0_obj) calo0_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();
313      if(tof_obj)  tof_obj->Clear();      if(tof_obj)  tof_obj->Clear();
# Line 399  void PamLevel2::Reset(){ Line 403  void PamLevel2::Reset(){
403    //    //
404  };  };
405    
406    Bool_t PamLevel2::IsGood(){
407      Bool_t goodev=true;
408      //  if(trk2_obj && trk2_obj->UnpackError() != 0 ) goodev = false;
409      if(calo2_obj && calo2_obj->good != 1) goodev = false;
410      if(tof_obj && tof_obj->unpackError != 0) goodev = false;  
411      if(trig_obj && trig_obj->unpackError != 0) goodev = false;
412      if(s4_obj && s4_obj->unpackError != 0) goodev = false;  
413      if(nd_obj && nd_obj->unpackError != 0) goodev = false;  
414      if(ac_obj && ac_obj->unpackError != 255) goodev = false;  
415        //  if(orb_obj)  
416      return goodev;
417    };
418    
419  //--------------------------------------  //--------------------------------------
420  //  //
# Line 593  PamTrack* PamLevel2::GetStoredTrack(Int_ Line 609  PamTrack* PamLevel2::GetStoredTrack(Int_
609  }  }
610  //--------------------------------------  //--------------------------------------
611  //  //
612    
613    /**
614     * 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.
615     **/
616    void PamLevel2::SortTracks(TString how){
617      printf(" WARNING! obsolete, use SortTracks() and SetSortingMethod(TString) instead! \n Setting sorting method to %s \n",how.Data());
618      howtosort = how;  
619      SortTracks();
620    };
621    
622  //  //
623  //--------------------------------------  //--------------------------------------
624  /**  /**
# Line 606  PamTrack* PamLevel2::GetStoredTrack(Int_ Line 632  PamTrack* PamLevel2::GetStoredTrack(Int_
632   *   *
633   * 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).
634   */   */
635  void PamLevel2::SortTracks(TString how){  void PamLevel2::SortTracks(){
636      TString how = howtosort;
637    
638  //    cout <<" PamLevel2::SortTracks(TString how) "<<endl;    //    cout <<" PamLevel2::SortTracks(TString how) "<<endl;
639      if( !trk2_obj ){    if( !trk2_obj ){
640          cout << "void PamLevel2::SortTracks(TString how):  TrkLevel2 not loaded !!!";      cout << "void PamLevel2::SortTracks():  TrkLevel2 not loaded !!!";
641          return;      return;
642      };    };
643  //    cout << "call SortTracs() "<<endl;    //    cout << "call SortTracs() "<<endl;
644    //Save current Object count    //Save current Object count
645      Int_t ObjectNumber = TProcessID::GetObjectCount();    Int_t ObjectNumber = TProcessID::GetObjectCount();
646    
647  //    cout << "ObjectNumber  "<<ObjectNumber <<endl;    //    cout << "ObjectNumber  "<<ObjectNumber <<endl;
648    
649  //     if(!sorted_tracks)sorted_tracks = new TRefArray();    //     if(!sorted_tracks)sorted_tracks = new TRefArray();
650  //     sorted_tracks->Clear();    //     sorted_tracks->Clear();
651  //    sorted_tracks.Clear();    //    sorted_tracks.Clear();
652    
653      if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks());    if(!tsorted)tsorted = new TClonesArray("PamTrack",trk2_obj->GetNTracks());
654      tsorted->Delete();    tsorted->Delete();
655      TClonesArray &ttsorted = *tsorted;    TClonesArray &ttsorted = *tsorted;
656      if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks());    if(!timage)timage = new TClonesArray("PamTrack",trk2_obj->GetNTracks());
657      timage->Delete();    timage->Delete();
658      TClonesArray &ttimage = *timage;    TClonesArray &ttimage = *timage;
659    
660    
661      // loop over the tracks sorted by the tracker    // loop over the tracks sorted by the tracker
662      Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase);    Bool_t use_TRK = how.Contains("TRK", TString::kIgnoreCase);
663      Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase);    Bool_t use_CAL = how.Contains("CAL", TString::kIgnoreCase);
664      Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase);    Bool_t use_TOF = how.Contains("TOF", TString::kIgnoreCase);
665            
666      if( !CAL2 &&  use_CAL) use_CAL = false;    if( !CAL2 &&  use_CAL) use_CAL = false;
667      if( !TOF &&  use_TOF) use_TOF = false;    if( !TOF &&  use_TOF) use_TOF = false;
668            
669      if( !TRK2 ){    if( !TRK2 ){
670  //      cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl;      //  cout << "SortTracks() : without tracker does not work!!! (not yet)" << endl;
671          return;      return;
672      };    };
673    
674      //   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;
675            
676      for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){    for(Int_t i=0; i < trk2_obj->TrkLevel2::GetNTracks(); i++){
677                    
678          TrkTrack   *ts = 0;      TrkTrack   *ts = 0;
679          CaloTrkVar *cs = 0;      CaloTrkVar *cs = 0;
680          ToFTrkVar  *os = 0;      ToFTrkVar  *os = 0;
681                    
682          // get tracker tracks      // get tracker tracks
683          TrkTrack   *tp = trk2_obj->TrkLevel2::GetTrack(i);                    //tracker      TrkTrack   *tp = trk2_obj->TrkLevel2::GetTrack(i);                    //tracker
684          CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo());      CaloTrkVar *cp = GetCaloStoredTrack(tp->GetSeqNo());
685          ToFTrkVar  *op = GetToFStoredTrack(tp->GetSeqNo());      ToFTrkVar  *op = GetToFStoredTrack(tp->GetSeqNo());
686    
687          TrkTrack   *ti = 0;              //tracker (image)      TrkTrack   *ti = 0;              //tracker (image)
688          CaloTrkVar *ci = 0;      CaloTrkVar *ci = 0;
689          ToFTrkVar  *oi = 0;      ToFTrkVar  *oi = 0;
690  //      cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl;      //  cout << "trk track n. "<<i << " "<<hex<< tp <<dec<< endl;
691          // if track has an image, check image selection      // if track has an image, check image selection
692          if(tp->HasImage()){      if(tp->HasImage()){
693                            
694              ti = trk2_obj->TrkLevel2::GetTrackImage(i);              //tracker (image)        ti = trk2_obj->TrkLevel2::GetTrackImage(i);              //tracker (image)
695              ci = GetCaloStoredTrack(ti->GetSeqNo());        ci = GetCaloStoredTrack(ti->GetSeqNo());
696              oi = GetToFStoredTrack(ti->GetSeqNo());        oi = GetToFStoredTrack(ti->GetSeqNo());
697                            
698  //          cout << "its image "<<i << " "<<hex<< ti <<dec<< endl;        //            cout << "its image "<<i << " "<<hex<< ti <<dec<< endl;
699    
700              //assign starting scores        //assign starting scores
701              Int_t tp_score = 0;  //main track sorted by the tracker        Int_t tp_score = 0;  //main track sorted by the tracker
702              Int_t ti_score = 0;  //image track        Int_t ti_score = 0;  //image track
703                            
704              // ------------------------        // ------------------------
705              // calorimeter check        // calorimeter check
706              // ------------------------        // ------------------------
707              // check the Y spatial residual on the first calorimeter plane        // check the Y spatial residual on the first calorimeter plane
708              // (cut on calorimeter variables from Emiliano)        // (cut on calorimeter variables from Emiliano)
709              if( use_CAL && !calo2_obj ){        if( use_CAL && !calo2_obj ){
710                  cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but CaloLevel2 not loaded !!!";          cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but CaloLevel2 not loaded !!!";
711                  return;          return;
712              };        };
713              if(        if(
714                  use_CAL            &&           use_CAL            &&
715                  calo2_obj->npcfit[1] > 15     &&   //no. of fit planes on Y view           calo2_obj->npcfit[1] > 5     &&   //no. of fit planes on Y view
716                  calo2_obj->varcfit[1] < 1000. &&  //fit variance on Y view           calo2_obj->varcfit[1] < 1000. &&  //fit variance on Y view
717                  cp && ci &&           cp && ci &&
718                  true){           true){
719    
720                                    
721                  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;
722                  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;
723                                    
724                  if(resy_p <= resy_i) tp_score++;          if(resy_p <= resy_i) tp_score++;
725                  else                 ti_score++;          else                 ti_score++;
726            
727            //      cout << "CALO "<<tp_score<<ti_score<<endl;
728    
729  //              cout << "CALO "<<tp_score<<ti_score<<endl;        };
730          // ------------------------
731          // TOF check
732          // ------------------------          
733          // check the number of hit pmts along the track
734          // on S12 S21 and S32, where paddles are parallel to Y axis
735          if( use_TOF && !tof_obj ){
736            cout << "void PamLevel2::SortTracks(): howtosort= "<<how<<" but ToFLevel2 not loaded !!!";
737            return;
738          };
739          if( use_TOF && op && oi ){
740                    
741            //
742            Float_t sen = 0.;
743            for (Int_t ih=0; ih < op->npmtadc; ih++){
744              Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
745              if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (op->dedx).At(ih);
746            };
747            for (Int_t ih=0; ih < oi->npmtadc; ih++){
748              Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
749              if ( pl == 2 || pl == 3 || pl == 4 || pl == 5 ) sen += (oi->dedx).At(ih);
750            };
751            //
752            if (  sen >= sortthr ){
753              //printf(" IS A NUCLEUS! en = %f \n",sen);
754              //
755              // is a nucleus use a different algorithm
756              //
757              Int_t nz = 6; Float_t zin[6];                                          // << define TOF z-coordinates
758              for(Int_t ip=0; ip<nz; ip++)
759                zin[ip] = tof_obj->ToFLevel2::GetZTOF(tof_obj->ToFLevel2::GetToFPlaneID(ip));     // << read ToF plane z-coordinates
760              Trajectory *tr = new Trajectory(nz,zin);
761              //
762              Int_t nphit_p =0;
763              Int_t nphit_i =0;
764              Float_t enhit_p = 0.;
765              Float_t enhit_i = 0.;
766              //
767              for (Int_t ih=0; ih < op->npmtadc; ih++){
768                Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
769                if(pl == 1 || pl == 2 || pl == 5){
770                  nphit_p++;
771                  enhit_p += (op->dedx).At(ih);
772                };
773              };
774              //
775              tp->DoTrack2(tr);
776              //
777              if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){
778                for (Int_t ih=0; ih < op->npmtadc; ih++){
779                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
780                  if(pl == 0){
781                    nphit_p++;
782                    enhit_p += (op->dedx).At(ih);
783                  };
784                };
785              };
786              if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){
787                for (Int_t ih=0; ih < op->npmtadc; ih++){
788                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
789                  if(pl == 3){
790                    nphit_p++;
791                    enhit_p += (op->dedx).At(ih);
792                  };
793                };
794              };
795              if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){
796                for (Int_t ih=0; ih < op->npmtadc; ih++){
797                  Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
798                  if(pl == 4){
799                    nphit_p++;
800                    enhit_p += (op->dedx).At(ih);
801                  };
802                };
803              };
804    
805              for (Int_t ih=0; ih < oi->npmtadc; ih++){
806                Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
807                if(pl == 1 || pl == 2 || pl == 5){
808                  nphit_i++;        
809                  enhit_i += (op->dedx).At(ih);
810                };
811              };
812              //
813              ti->DoTrack2(tr);
814              //
815              if ( fabs(tr->y[0]-oi->ytofpos[0]) < 2. ){
816                for (Int_t ih=0; ih < oi->npmtadc; ih++){
817                  Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
818                  if(pl == 0){
819                    nphit_i++;
820                    enhit_i += (op->dedx).At(ih);
821                  };
822              };              };
823              // ------------------------            };
824              // TOF check            if ( fabs(tr->y[3]-oi->ytofpos[1]) < 2. ){
825              // ------------------------                  for (Int_t ih=0; ih < oi->npmtadc; ih++){
826              // check the number of hit pmts along the track                Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
827              // on S12 S21 and S32, where paddles are parallel to Y axis                if(pl == 3){
828              if( use_TOF && !tof_obj ){                  nphit_i++;
829                  cout << "void PamLevel2::SortTracks(TString how): how= "<<how<<" but ToFLevel2 not loaded !!!";                  enhit_i += (op->dedx).At(ih);
830                  return;                };
831                };
832              };
833              if ( fabs(tr->y[4]-oi->ytofpos[2]) < 2. ){
834                for (Int_t ih=0; ih < oi->npmtadc; ih++){
835                  Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
836                  if(pl == 4){
837                    nphit_i++;
838                    enhit_i += (op->dedx).At(ih);
839                  };
840              };              };
841              if( use_TOF && op && oi ){            };            
842    
843                                    
844                  Int_t nphit_p =0;            if(
845                  Int_t nphit_i =0;               use_TOF            &&
846                 (nphit_p+nphit_i) !=0 &&  
847                 true){
848                        
849                //      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);
850                //      printf(" score p %i score i %i \n",tp_score,ti_score);
851                //            if( enhit_p > enhit_i ) tp_score++;
852                //            if( nphit_p >= nphit_i && enhit_p > enhit_i ) tp_score++;
853                if ( nphit_p > nphit_i ) tp_score++;
854                if ( nphit_p < nphit_i ) ti_score++;
855                if ( nphit_p == nphit_i ){
856                  if ( enhit_p > enhit_i ) tp_score++;
857                  else ti_score++;
858                };
859                //      printf(" dopo score p %i score i %i \n",tp_score,ti_score);
860              };
861              delete tr;
862              //
863            } else {
864              //
865              // NOT a NUCLEUS
866              //
867              //printf(" NOT a NUCLEUS! en = %f \n",sen);
868    
869              Int_t nphit_p =0;
870              Int_t nphit_i =0;
871                                    
872                                    
873  /*                              cout << "track: npmtadc "<< op->npmtadc << endl;            /*                            cout << "track: npmtadc "<< op->npmtadc << endl;
874                                  cout << "track: npmttdc "<< op->npmttdc << endl;              cout << "track: npmttdc "<< op->npmttdc << endl;
875                                  cout << "image: npmtadc "<< oi->npmtadc << endl;              cout << "image: npmtadc "<< oi->npmtadc << endl;
876                                  cout << "image: npmttdc "<< oi->npmttdc << endl;*/              cout << "image: npmttdc "<< oi->npmttdc << endl;*/
877                                    
878                  for (Int_t ih=0; ih < op->npmtadc; ih++){            for (Int_t ih=0; ih < op->npmtadc; ih++){
879                      Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );              Int_t pl = tof_obj->GetPlaneIndex( (op->pmtadc).At(ih) );
880                      if(pl == 1 || pl == 2 || pl == 5)nphit_p++;              if(pl == 1 || pl == 2 || pl == 5)nphit_p++;
881                  };            };
882                                    
883                  for (Int_t ih=0; ih < oi->npmtadc; ih++){            for (Int_t ih=0; ih < oi->npmtadc; ih++){
884                      Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );              Int_t pl = tof_obj->GetPlaneIndex( (oi->pmtadc).At(ih) );
885                      if(pl == 1 || pl == 2 || pl == 5)nphit_i++;              if(pl == 1 || pl == 2 || pl == 5)nphit_i++;
886                  };            };
887                                    
888                  if(            if(
889                      use_TOF            &&               use_TOF            &&
890                      (nphit_p+nphit_i) !=0 &&                   (nphit_p+nphit_i) !=0 &&  
891                      true){               true){
892                                            
893                      if( nphit_p >= nphit_i) tp_score++;              if( nphit_p >= nphit_i) tp_score++;
894                      else ti_score++;              else ti_score++;
895                  };            };
896  //              cout << "TOF "<<tp_score<<ti_score<<endl;          };
897              };          //      cout << "TOF "<<tp_score<<ti_score<<endl;
898              if(tp_score == ti_score) use_TRK = true;        };
899              // ------------------------        if(tp_score == ti_score) use_TRK = true;
900              // tracker check        // ------------------------
901              // ------------------------        // tracker check
902              // chi**2 difference is not always large enough to distinguish among        // ------------------------
903              // the real track and its image.        // chi**2 difference is not always large enough to distinguish among
904              // Tracker check will be applied always when calorimeter and tof information is ambiguous.        // the real track and its image.
905              if(use_TRK){        // Tracker check will be applied always when calorimeter and tof information is ambiguous.
906                  if(      tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ;        if(use_TRK){
907                  else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ;          if(      tp->chi2 > 0 && tp->chi2 < ti->chi2 ) tp_score++ ;
908  //              cout << "TRK "<<tp_score<<ti_score<<endl;          else if( ti->chi2 > 0 && ti->chi2 < tp->chi2 ) ti_score++ ;
909              };          //      cout << "TRK "<<tp_score<<ti_score<<endl;
910          };
911                            
912              // ------------------------        // ------------------------
913              // the winner is....        // the winner is....
914              // ------------------------            // ------------------------          
915              if      (tp_score > ti_score) {        if      (tp_score > ti_score) {
916  //              ts = tp;//the track sorted by the tracker!!          //              ts = tp;//the track sorted by the tracker!!
917  //              cs = cp;          //              cs = cp;
918  //              os = op;          //              os = op;
919              }else if (tp_score < ti_score) {          //      cout << "It's primary!" << endl;
920                  ts = ti;//its image!!  
921                  cs = ci;        }else if (tp_score < ti_score) {
922                  os = oi;  
923            //      cout << "It's image!" << endl;
924                  ti = tp;//its image!!  
925                  ci = cp;          ts = ti;//its image!!
926                  oi = op;          cs = ci;
927            os = oi;
928                  tp = ts;//its image!!  
929                  cp = cs;          ti = tp;//its image!!
930                  op = os;          ci = cp;
931            oi = op;
932    
933            tp = ts;//its image!!
934            cp = cs;
935            op = os;
936    
937                                    
938              }else {        }else {
939  //              ts = tp;          //              ts = tp;
940  //              cs = cp;          //              cs = cp;
941  //              os = op;          //              os = op;
942  //                              cout << "Warning - track image ambiguity not solved" << endl;  //      cout << "Warning - track image ambiguity not solved" << endl;
943  //                              cout << ts->GetNtot() << " "<< ts->chi2 << " " << npcfit[1] << " "<< nphit_p << endl;          //                              cout << ts->GetNtot() << " "<< ts->chi2 << " " << npcfit[1] << " "<< nphit_p << endl;
944              };        };
945                            
946          }else{      }else{
947  //          ts = tp;        //            ts = tp;
948  //          cs = cp;        //            cs = cp;
949  //          os = op;        //            os = op;
950          };      };
951                    
952  //      cout <<" SortTracks() "<<i<<" -- "<<ts<<endl;      //  cout <<" SortTracks() "<<i<<" -- "<<ts<<endl;
953  //      sorted_tracks->Add(ts);//save the track in the sorted array      //  sorted_tracks->Add(ts);//save the track in the sorted array
954  //      sorted_tracks.Add(ts);//save the track in the sorted array      //  sorted_tracks.Add(ts);//save the track in the sorted array
955  //      sorted_tracks.Add(tp);//save the track in the sorted array      //  sorted_tracks.Add(tp);//save the track in the sorted array
956  //      cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl;      //  cout << "SortTracks:: sorted_tracks->Add(it) "<<i<<" "<<ts<<endl;
957  //      cout<<"o "<<tp<<endl;      //  cout<<"o "<<tp<<endl;
958  //      cout<<"o "<<cp<<endl;      //  cout<<"o "<<cp<<endl;
959  //      cout<<"o "<<op<<endl;      //  cout<<"o "<<op<<endl;
960          new(ttsorted[i]) PamTrack(tp,cp,op);      new(ttsorted[i]) PamTrack(tp,cp,op);
961          new(ttimage[i])  PamTrack(ti,ci,oi);      new(ttimage[i])  PamTrack(ti,ci,oi);
962      };    };
963    
964      if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){    if( tsorted->GetEntries() != trk2_obj->GetNTracks() ){
965          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;
966          tsorted->Delete(); tsorted=0;      tsorted->Delete(); tsorted=0;
967          timage->Delete(); timage=0;          timage->Delete(); timage=0;
968      }    }
969    
970      //Restore Object count    //Restore Object count
971      //To save space in the table keeping track of all referenced objects    //To save space in the table keeping track of all referenced objects
972      //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.
973      TProcessID::SetObjectCount(ObjectNumber);    TProcessID::SetObjectCount(ObjectNumber);
974            
975  };  };
976  //--------------------------------------  //--------------------------------------
# Line 833  void PamLevel2::SortTracks(TString how){ Line 994  void PamLevel2::SortTracks(TString how){
994  TClonesArray *PamLevel2::GetTracks(){  TClonesArray *PamLevel2::GetTracks(){
995    
996  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
997      SortTracks("+CAL+TOF");      SortTracks();
998  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
999    
1000      return tsorted;      return tsorted;
# Line 852  PamTrack *PamLevel2::GetTrack(int it){ Line 1013  PamTrack *PamLevel2::GetTrack(int it){
1013    
1014  //    if(!trk2_obj) return 0;  //    if(!trk2_obj) return 0;
1015                    
1016  // //  *-*-*-*-*-*-*-*-*-*-*-*-*  // //  *-*-*-*+-*-*-*-*-*-*-*-*-*
1017  //     SortTracks("+CAL+TOF");  //     SortTracks("+CAL+TOF");
1018  // //  *-*-*-*-*-*-*-*-*-*-*-*-*  // //  *-*-*-*-*-*-*-*-*-*-*-*-*
1019  // //    if(!sorted_tracks)return 0;  // //    if(!sorted_tracks)return 0;
# Line 871  PamTrack *PamLevel2::GetTrack(int it){ Line 1032  PamTrack *PamLevel2::GetTrack(int it){
1032    
1033  //    cout << "PamLevel2::GetTrack(int it) "<<endl;  //    cout << "PamLevel2::GetTrack(int it) "<<endl;
1034  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1035      SortTracks("+CAL+TOF");      SortTracks();
1036  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1037      if(!tsorted)return 0;      if(!tsorted)return 0;
1038      if(!tsorted->GetEntries())return 0;      if(!tsorted->GetEntries())return 0;
# Line 928  PamTrack *PamLevel2::GetTrackImage(int i Line 1089  PamTrack *PamLevel2::GetTrackImage(int i
1089    
1090    
1091  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1092      SortTracks("+CAL+TOF");      SortTracks();
1093  //  *-*-*-*-*-*-*-*-*-*-*-*-*  //  *-*-*-*-*-*-*-*-*-*-*-*-*
1094      if(!timage)return 0;      if(!timage)return 0;
1095      if(!timage->GetEntries())return 0;      if(!timage->GetEntries())return 0;
# Line 1327  TChain *PamLevel2::GetPamTree(TList *fl, Line 1488  TChain *PamLevel2::GetPamTree(TList *fl,
1488      };      };
1489            
1490      cout << "done chain \n";      cout << "done chain \n";
1491        cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
1492    
1493  //    UInt_t *found=0;  //    UInt_t *found=0;
1494  // Tracker  // Tracker
# Line 1412  TChain *PamLevel2::GetPamTree(TList *fl, Line 1574  TChain *PamLevel2::GetPamTree(TList *fl,
1574      }else{      }else{
1575          cout << "OrbitalInfo  : missing tree"<<endl;          cout << "OrbitalInfo  : missing tree"<<endl;
1576      };      };
1577        cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
1578    
1579      // Selection List      // Selection List
1580      if(L && SELLI==1) {      if(L && SELLI==1) {
# Line 1423  TChain *PamLevel2::GetPamTree(TList *fl, Line 1586  TChain *PamLevel2::GetPamTree(TList *fl,
1586          sel_tree = L;          sel_tree = L;
1587  //      if(!Trout)Trout=O;  //      if(!Trout)Trout=O;
1588  //      else Trout->AddFriend("SelectionList");  //      else Trout->AddFriend("SelectionList");
1589            cout << "----------------------------------------------------" <<endl;
1590      }else{      }else{
1591  //      cout << "SelectionList  : missing tree"<<endl;  //      cout << "SelectionList  : missing tree"<<endl;
1592          if(L)L->Delete();          if(L)L->Delete();
# Line 1692  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 1856  Bool_t PamLevel2::UpdateRunInfo(TChain *
1856    //    //
1857    // check if we have already called once GetEntry, if not call it    // check if we have already called once GetEntry, if not call it
1858    //    //
1859        cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, Long64_t iev) --- NON FUNZIONA BENISSIMO.... "<<endl;
1860      if(!run){      if(!run){
1861            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;
1862            return(false);                    return(false);        
# Line 1707  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 1872  Bool_t PamLevel2::UpdateRunInfo(TChain *
1872    // --------------------------------------    // --------------------------------------
1873    if(SELLI==0){    if(SELLI==0){
1874    
1875          //
1876          // the absolute time is necessary to relate the event with the run
1877          //
1878        if( !GetOrbitalInfo() ){        if( !GetOrbitalInfo() ){
1879            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;
1880            return(false);            return(false);
1881        }        }
1882    
1883          //
1884          // the first time the routine is called, set run search from the beginning
1885          //
1886        if ( irun < 0LL ){        if ( irun < 0LL ){
1887            irun = 0LL;            irun = 0LL;
1888            run->GetEntry(irun);            run->GetEntry(irun);
1889            runfirstentry = 0LL;            runfirstentry = 0LL;
1890            runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS);            runlastentry += (Long64_t)(this->GetRunInfo()->NEVENTS);
1891            if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL;            if ( (Long64_t)(this->GetRunInfo()->NEVENTS) > 0LL ) runlastentry -= 1LL;
 //        cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;  
 //        cout << "runfirstentry "<<runfirstentry<<endl;  
 //        return(true);  
1892        };              };      
1893        //        //
1894         if ( irun == run->GetEntries()-1LL &&         if ( irun == run->GetEntries()-1LL &&
# Line 1800  Bool_t PamLevel2::UpdateRunInfo(TChain * Line 1968  Bool_t PamLevel2::UpdateRunInfo(TChain *
1968    //    //
1969  };  };
1970    
1971  // Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev){  Bool_t PamLevel2::UpdateRunInfo(Long64_t iev){
1972  //   //  
1973  //   // check if we have already called once GetEntry, if not call it      if(!run_tree){
1974  //   //          cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree not loaded"<<endl;
1975  //     if(!run_tree){          return false;
1976  //      cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree not loaded"<<endl;      }
1977  //      return false;      if ( run_tree->GetEntries() <= 0 ) {
1978  //     }          cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree is empty"<<endl;
1979  //     if ( run_tree->GetEntries() <= 0 ) {          return(false);
1980  //      cout << " Bool_t PamLevel2::UpdateRunInfo(ULong64_t iev) -- ERROR -- run tree is empty"<<endl;      }
 //      return(false);  
 //     }  
 //   //  
1981        
1982  //   Int_t oldrun = irun;      Int_t oldrun = irun; // store current run index
1983  //   // --------------------------------------  
1984  //   // if it is a full file (not preselected)      // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
1985  //   // --------------------------------------      // if it is a full file (not preselected)
1986  //   if(SELLI==0){      // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
1987        if(SELLI==0){
1988  //       if( !GetOrbitalInfo() ){  
1989  //        cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- missing OrbitalInfo "<<endl;          // ---------------------------------------------------------------
1990  //        return(false);          // the absolute time is necessary to relate the event with the run
1991  //       }          // ---------------------------------------------------------------
1992            if( !GetOrbitalInfo() ){
1993  //       if ( irun < 0 ){              cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- missing OrbitalInfo "<<endl;
1994  //        irun = 0;              return(false);
1995  //        run_tree->GetEntry(irun);          }
1996  //        runfirstentry = iev;        
1997  //        if( iev != 0){          // -----------------------------------------------------------------------
1998  //            cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- WARNING -- "<<endl;          // the first time the routine is called, set run search from the beginning
1999  //        }          // -----------------------------------------------------------------------
2000  //       };                if ( irun < 0 ){
2001                irun = 0LL;
2002  //       bool fromfirst = true;              irunentry = 0;
2003                prevshift = 0;
2004  //       while ( !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME && GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) && irun < run->GetEntries() ){              run_tree->GetEntry(irun);
2005  //        irun++;          };      
2006  //        if( irun == run->GetEntries() ){          //
2007  //            if(!fromfirst){          bool fromfirst = true; // first loop over runs
2008  //                cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- event entry #"<<iev<<" does not belong to any run (should not happen)" <<endl;  
2009  //                return false;  //      Bool_t hasfrag = false;
2010  //            }  //      if( GetRunInfo()->ID_RUN_FRAG!=0 && GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID)hasfrag=true;
2011  //            cout << "Bool_t PamLevel2::UpdateRunInfo(TChain *run, ULong64_t iev) -- ERROR -- reached end of run tree. searchin again from beginning (should not happen)" <<endl;  //      ULong64_t fragid = GetRunInfo()->ID_RUN_FRAG;
2012  //            fromfirst = false;  
2013  //            irun =0;          // ------------------------------------------------------
2014  //        }          // loop over runs to find the one that contains the event
2015  //        run_tree->GetEntry(irun);          // ------------------------------------------------------
2016  //        runfirstentry = iev;          while (
2017  //       };              (
2018  //       //                  (
2019  //       if ( irun == oldrun ) return(false);                      !(GetOrbitalInfo()->absTime >= GetRunInfo()->RUNHEADER_TIME &&    // check on absolute time (s)
2020  //       //                        GetOrbitalInfo()->absTime <= GetRunInfo()->RUNTRAILER_TIME) &&
2021  //       cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;                      !(GetOrbitalInfo()->OBT >= GetRunInfo()->RUNHEADER_OBT &&         // additional check on OBT (ms)
2022  //       cout << "runfirstentry "<<runfirstentry<<endl;                        GetOrbitalInfo()->OBT <= GetRunInfo()->RUNTRAILER_OBT)
2023  //       prevshift = 0;                      )
2024  //       return(true);                      || GetRunInfo()->NEVENTS==0
2025  //   };                  || !(irunentry < GetRunInfo()->NEVENTS-1-prevshift)
2026  //   // ----------------------------------------------------                  )
2027  //   // if it is a preselected file (there is SelectionList)                  && irun < run_tree->GetEntries() ){
2028  //   // NBNB - the event tree MUST be read first  
2029  //   // ----------------------------------------------------              irun++;
2030  //   if(SELLI==1){                    // ------------------------------------
2031  //       sel_tree->GetEntry(iev);              // if the end of run tree is reached...
2032  //       if(irun != oldrun){              // ------------------------------------
2033  //        run->GetEntry(irun);              if( irun == run_tree->GetEntries() ){
2034  //        cout << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;                  if(!fromfirst){
2035  //        prevshift = 0;                      // -----------------------------------------------------
2036  //        return true;                      // if it happened already once and the run was not found
2037  //       }                      // ---> exit with error
2038  //       return false;                      // -----------------------------------------------------
2039  //   }                      cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- ERROR -- event entry #"<<iev<<" does not belong to any run (should not happen)" <<endl;
2040                        return false;
2041  //   return false;                  }
2042  //   //                  // -----------------------------------------
2043  // };                  // ...otherwise repeat search from beginning
2044                    // -----------------------------------------
2045                    cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- reached end of run tree. searchin again from beginning " <<endl;
2046                    fromfirst = false;
2047                    irun = 0LL;
2048                    runfirstentry = 0LL;
2049                }
2050                // -------------------------------------------------------------------
2051                // save the index of the first entry of the run, relative to pam_tree,
2052                // and read a new run
2053                // -------------------------------------------------------------------
2054                if(irun>0)runfirstentry += (GetRunInfo()->NEVENTS)-prevshift;
2055                irunentry = 0;
2056                prevshift = 0;
2057                run_tree->GetEntry(irun);      
2058                if(GetRunInfo()->RUNHEADER_OBT>GetRunInfo()->RUNTRAILER_OBT ){
2059                    cout << "Bool_t PamLevel2::UpdateRunInfo(Long64_t iev) -- WARNING -- irun "<<irun<<"  has RUNHEADER_OBT>=RUNTRAILER_OBT " <<endl;
2060                    cout << "                                                            (NB!! in this case some events are assigned to a wrong run)"<<endl;
2061                }
2062    //          if(hasfrag &&  fragid != GetRunInfo()->ID){
2063    //              cout << "... where is the next fragment ??"<<endl;
2064    //          }
2065            };
2066    
2067    
2068            // --------------------------------------
2069            // if there was no need to update the run
2070            // ---> exit with FALSE
2071            // --------------------------------------
2072            if ( irun == oldrun ) return(false);
2073    
2074            // --------------------------------------
2075            // ... otherwise
2076            // ---> exit with TRUE
2077            // --------------------------------------
2078            cout << endl << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
2079            // ----------------------------------------------------
2080            // then check if the run has a fragment
2081            // in this case we have to switch to the next fragment
2082            // when the end of the first fragment is reached
2083            // ----------------------------------------------------
2084            if(
2085                GetRunInfo()->ID_RUN_FRAG != 0 &&
2086    //          GetRunInfo()->ID_RUN_FRAG != GetRunInfo()->ID &&
2087                true ){
2088                cout << "* fragment *"<<endl;              
2089            }
2090            
2091            return(true);    
2092        };
2093        // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
2094        // if it is a preselected file (there is SelectionList)
2095        // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
2096        if(SELLI==1){      
2097            sel_tree->GetEntry(iev);
2098            if(irun != oldrun){
2099                run_tree->GetEntry(irun);
2100                cout << endl << " ))))) UPDATE RUN INFO (((((  @iev "<<iev<<" run "<<GetRunInfo()->ID<<" irun "<<irun<<endl;
2101                prevshift = 0;
2102                return true;
2103            }
2104            return false;
2105        }
2106    
2107        return false;
2108        //
2109    };
2110  /**  /**
2111   * 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)
2112   * @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 2736  void PamLevel2::CreateCloneTrees0( TChai
2736   */   */
2737  void PamLevel2::CreateCloneTrees(TFile *ofile){  void PamLevel2::CreateCloneTrees(TFile *ofile){
2738    
2739    
2740    //  if the pointer is null, create a default file
2741    
2742        if(!ofile){
2743            cout << "void PamLevel2::CreateCloneTrees(TFile*) -- WARNING -- Creating file: clone-tree.root "<<endl;
2744            ofile = new TFile("clone-tree.root","recreate");
2745        }
2746    
2747      ofile->cd();      ofile->cd();
2748    
2749      cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;      cout << "+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+" <<endl;
# Line 2516  void PamLevel2::CreateCloneTrees(TFile * Line 2755  void PamLevel2::CreateCloneTrees(TFile *
2755      cout << "Run          : branch RunInfo"<<endl;      cout << "Run          : branch RunInfo"<<endl;
2756      run_tree_clone->Branch("SoftInfo","SoftInfo",GetPointerTo("SoftInfo"));      run_tree_clone->Branch("SoftInfo","SoftInfo",GetPointerTo("SoftInfo"));
2757      cout << "Run          : branch SoftInfo"<<endl;      cout << "Run          : branch SoftInfo"<<endl;
2758                    // ------------------
2759        // replicate run tree
2760        // ------------------
2761        cout << "----------------------------------------------------"<<endl;
2762        cout << "irun\t | RUN\t NEVENTS\t absolute time"<<endl;
2763        for (Int_t i=0; i<run_tree->GetEntries(); i++){
2764            run_tree->GetEntry(i);
2765            cout << i<< "\t | "<<GetRunInfo()->ID<<"\t "<<GetRunInfo()->NEVENTS<< "\t "<<GetRunInfo()->RUNHEADER_TIME<<" <---> "<<GetRunInfo()->RUNTRAILER_TIME<<endl;
2766            run_tree_clone->Fill();
2767        }
2768        cout << "----------------------------------------------------"<<endl;
2769    
2770    
2771      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 2780  void PamLevel2::CreateCloneTrees(TFile *
2780              pam_tree_clone[i]->Branch("TrkLevel1","TrkLevel1", GetPointerTo("TrkLevel1"));              pam_tree_clone[i]->Branch("TrkLevel1","TrkLevel1", GetPointerTo("TrkLevel1"));
2781              pam_tree_clone[i]->BranchRef();              pam_tree_clone[i]->BranchRef();
2782              cout << "Tracker      : branch TrkLevel1"<<endl;              cout << "Tracker      : branch TrkLevel1"<<endl;
2783              cout << "CreateCloneTrees " << GetTrkLevel1()<<endl;  //          cout << "CreateCloneTrees " << GetTrkLevel1()<<endl;
2784          };          };
2785          if(TRK2) {          if(TRK2) {
2786              pam_tree_clone[i]->Branch("TrkLevel2", "TrkLevel2",GetPointerTo("TrkLevel2"));              pam_tree_clone[i]->Branch("TrkLevel2", "TrkLevel2",GetPointerTo("TrkLevel2"));
# Line 2664  void PamLevel2::WriteCloneTrees(){ Line 2913  void PamLevel2::WriteCloneTrees(){
2913  //Int_t PamLevel2::GetEntry(Int_t iee){  //Int_t PamLevel2::GetEntry(Int_t iee){
2914  Int_t PamLevel2::GetEntry(Long64_t iee){  Int_t PamLevel2::GetEntry(Long64_t iee){
2915            
2916    //     cout << "-------------------------------------"<<endl;
2917    //     cout << "Int_t PamLevel2::GetEntry("<<iee<<")"<<endl;
2918    
2919      if(!pam_tree){      if(!pam_tree){
2920          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;
2921          return 0;          return 0;
# Line 2692  Int_t PamLevel2::GetEntry(Long64_t iee){ Line 2944  Int_t PamLevel2::GetEntry(Long64_t iee){
2944      //      //
2945      if(!run_tree ){      if(!run_tree ){
2946          if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1?          if ( TRK0 || CAL0 || TOF0 || RUN ) { //forse cosi` va bene per tornare 1?
2947                  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;
2948                  return 0;              return 0;
2949          }  else {          }  else {
2950                  return 1; //cosi` se non c'e` run esce qua...              return 1; //cosi` se non c'e` run esce qua...
2951          }          }
2952      }      }
2953    
2954      //-------------------------------      //-------------------------------
2955      ii = iee;      ii = iee;
2956  //    Bool_t UPDATED = UpdateRunInfo(run_tree,ii);  //    Bool_t UPDATED = UpdateRunInfo(run_tree,ii);
2957      Bool_t UPDATED = UpdateRunInfo(ii);  //    Bool_t UPDATED = UpdateRunInfo(ii);
2958        UpdateRunInfo(ii);
2959      if(SELLI==0)irunentry = iee-runfirstentry;      if(SELLI==0)irunentry = iee-runfirstentry;
2960      if(UPDATED && run_tree_clone)run_tree_clone->Fill();  //    if(UPDATED && run_tree_clone)run_tree_clone->Fill();
2961      
2962  //    cout << "PamLevel2::GetEntry("<<iee<<") "<<irun<<" "<<runfirstentry<<" "<<irunentry<<endl;  //    cout << "PamLevel2::GetEntry("<<iee<<") "<<irun<<" "<<runfirstentry<<" "<<irunentry<<endl;
2963    
2964      if( TRK0 || CAL0 || TOF0 )GetYodaEntry( );  //     cout << "irunentry     "<<irunentry << endl;
2965    //     cout << "runfirstentry "<<runfirstentry << endl;
2966    //     cout << "nevents       "<<GetRunInfo()->NEVENTS<< endl;
2967    
2968    //     if( TRK0 || CAL0 || TOF0 ){
2969    //      if( !GetYodaEntry( ) ){
2970    //          cout << " Int_t PamLevel2::GetEntry(Int_t) -- ERROR -- error reading level0 tree"<<endl;
2971    //          return 0;
2972    //      }
2973    //     }
2974    
2975    
2976      return 1;      return 1;
2977    
2978  }  }
2979    
2980    TrkLevel0    *PamLevel2::GetTrkLevel0(){
2981        if( !TRK0 )return NULL;
2982        if( !GetYodaEntry( ) ){
2983            cout << " Int_t PamLevel2::GetTrkLevel0() -- ERROR -- error reading level0 tree"<<endl;
2984            return 0;
2985        }
2986        return trk0_obj;
2987    };
2988    CaloLevel0    *PamLevel2::GetCaloLevel0(){
2989        if( !CAL0 )return NULL;
2990        if( !GetYodaEntry( ) ){
2991            cout << " Int_t PamLevel2::GetCaloLevel0() -- ERROR -- error reading level0 tree"<<endl;
2992            return 0;
2993        }
2994        return calo0_obj;
2995    };
2996    
2997    
2998  /**  /**
2999   * 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.
3000   * 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 3014  TTree* PamLevel2::GetYodaTree( ){
3014          return NULL;          return NULL;
3015      }          }    
3016      Int_t irootnew = run_obj->ID_ROOT_L0;      Int_t irootnew = run_obj->ID_ROOT_L0;
3017  //     cout << "iroot    "<<iroot<<endl;  //      cout << "iroot    "<<iroot<<endl;
3018  //     cout << "irootnew "<<irootnew<<endl;  //      cout << "irootnew "<<irootnew<<endl;
3019    
3020      //===================================      //===================================
3021      // load the level0 file      // load the level0 file
# Line 2791  TTree* PamLevel2::GetYodaTree( ){ Line 3072  TTree* PamLevel2::GetYodaTree( ){
3072              };              };
3073              l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent());              l0_tree->SetBranchAddress("Tracker" ,trk0_obj->GetPointerToTrackerEvent());
3074          }          }
3075          //---------------------------------------------------          //--------------------------------------------------
3076          // CALORIMETER:          // CALORIMETER:
3077          if(CAL0){          if(CAL0){
3078              if(!calo0_obj){              if(!calo0_obj){
# Line 2841  Int_t PamLevel2::GetYodaEntry(){ Line 3122  Int_t PamLevel2::GetYodaEntry(){
3122            
3123      // patch      // patch
3124      if( irunentry < 0){      if( irunentry < 0){
3125          cout << "Int_t PamLevel2::GetYodaEntry() -- ATTENZIONE -- irunentry negativo?!?! "<<(Int_t)irunentry<<endl;  //      cout << "Int_t PamLevel2::GetYodaEntry() -- ATTENZIONE -- irunentry negativo?!?! "<<(Int_t)irunentry<<endl;
3126          irunentry=0LL;          irunentry=0LL;
3127      }      }
3128      //  ---------------------------------      //  ---------------------------------
3129      //  if file is NOT a preselected file      //  if file is NOT a preselected file
3130      //  ---------------------------------      //  ---------------------------------
3131      Long64_t quellagiusta = irunentry + (Long64_t)(run_obj->EV_FROM);      Long64_t quellagiusta = irunentry + (Long64_t)(run_obj->EV_FROM);
3132        //     cout << " irunentry "<<irunentry<<endl;
3133    //     cout << " EV_FROM "<<run_obj->EV_FROM<<endl;
3134    //     cout << " quellagiusta = irunentry + EV_FROM "<< quellagiusta << endl;
3135    
3136  //     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;
3137  //     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;
# Line 2878  Int_t PamLevel2::GetYodaEntry(){ Line 3161  Int_t PamLevel2::GetYodaEntry(){
3161      Int_t answer = 0;      Int_t answer = 0;
3162      Int_t shift =0;      Int_t shift =0;
3163      //    printf(" siamo qui %i %i \n",shift,prevshift);      //    printf(" siamo qui %i %i \n",shift,prevshift);
3164        Int_t maxshift = 10;
3165      do{      do{
3166          if(shift>0){              if(shift>0){    
3167              cout << " level0 <--> level2 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl;              cout << " PKTNUM  L2 --- "<< GetOrbitalInfo()->pkt_num << " --- L0 --- "<< GetEventHeader()->GetPscuHeader()->GetCounter()<<endl;
3168                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;
3169                cout << "         L2 <--> L0 mismatch ( irun "<<irun<<" irunentry "<<irunentry<<" shift "<<shift<<" prevshift "<<prevshift<<" )"<<endl;
3170          }          }
3171          answer = l0_tree->GetEntry(quellagiusta+(Long64_t)shift+(Long64_t)prevshift);          answer = l0_tree->GetEntry(quellagiusta+(Long64_t)shift+(Long64_t)prevshift);
3172          shift++;          shift++;
# Line 2902  Int_t PamLevel2::GetYodaEntry(){ Line 3188  Int_t PamLevel2::GetYodaEntry(){
3188            shift = -1;            shift = -1;
3189          };          };
3190    
3191      }while( ( GetOrbitalInfo()->OBT != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || GetOrbitalInfo()->pkt_num != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() );      }while( ( GetOrbitalInfo()->OBT != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetOrbitalTime()) || GetOrbitalInfo()->pkt_num != (UInt_t)(GetEventHeader()->GetPscuHeader()->GetCounter())) && (quellagiusta+(Long64_t)shift) < GetYodaTree()->GetEntries() && shift < maxshift);
   
     if ( (quellagiusta+(Long64_t)shift) == GetYodaTree()->GetEntries() ) cout << " Big trouble here, no such event in Level0 data! " <<endl;  
3192    
3193        if ( (quellagiusta+(Long64_t)shift+(Long64_t)prevshift) > GetYodaTree()->GetEntries() || shift == maxshift ) {
3194            cout << " Big trouble here, no such event in Level0 data! " <<endl;
3195            return 0;
3196        }
3197  //    cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl;  //    cout << "LA ENTRY GIUSTA E`: "<<quellagiusta<<" (spero...)"<<endl;
3198  //    return GetYodaTree()->GetEntry(quellagiusta);  //    return GetYodaTree()->GetEntry(quellagiusta);
3199      if ( shift > 1 ) prevshift += (shift-1);      if ( shift > 1 ) prevshift += (shift-1);
# Line 2913  Int_t PamLevel2::GetYodaEntry(){ Line 3201  Int_t PamLevel2::GetYodaEntry(){
3201      return answer;      return answer;
3202            
3203  }  }
3204    /**
3205     * \Brief Set DB connection
3206     */
3207    Bool_t PamLevel2::SetDBConnection(){
3208    
3209        cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl;
3210        cout<<"Connecting to DB"<<endl;
3211        cout<<"HOST "<<host<<endl;
3212        cout<<"USER "<<user<<endl;
3213        cout<<"PSW  "<<psw<<endl;
3214        dbc = TSQLServer::Connect(host.Data(),user.Data(),psw.Data());
3215        if( !dbc )return false;
3216        if( !dbc->IsConnected() )return false;    
3217        cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl;
3218        return true;
3219    
3220    }
Legend:
Removed from v.1.35  
changed lines
  Added in v.1.40
  ViewVC Help
Powered by ViewVC 1.1.23