/[PAMELA software]/DarthVader/TrackerLevel2/src/TrkLevel1.cpp
ViewVC logotype

Diff of /DarthVader/TrackerLevel2/src/TrkLevel1.cpp

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

revision 1.10 by pam-fi, Sat Dec 2 10:42:53 2006 UTC revision 1.28 by pam-ts, Wed Jun 4 07:57:04 2014 UTC
# Line 11  using namespace std; Line 11  using namespace std;
11  extern "C" {  extern "C" {
12                    
13  //      int readetaparam_();  //      int readetaparam_();
14          float cog_(int*,int*);    float cog_(int*,int*);
15          float pfaeta_(int*,float*);    float pfaeta_(int*,float*);
16          float pfaeta2_(int*,float*);    float pfaeta2_(int*,float*);
17          float pfaeta3_(int*,float*);    float pfaeta3_(int*,float*);
18          float pfaeta4_(int*,float*);    float pfaeta4_(int*,float*);
19              float pfaetal_(int*,float*);
20      float digsat_(int*);
21      int   npfastrips_(int*,float*);
22      
23      float fbad_cog_(int*,int*);
24      float risx_cog_(float*);
25      float risy_cog_(float*);
26  }  }
27  //--------------------------------------  //--------------------------------------
28  //  //
# Line 24  extern "C" { Line 30  extern "C" {
30  //--------------------------------------  //--------------------------------------
31  TrkCluster::TrkCluster(){  TrkCluster::TrkCluster(){
32                    
33          view     = 0;  //    cout << "TrkCluster::TrkCluster()"<<endl;
34          maxs     = 0;      view     = -1;
35          indmax   = 0;      maxs     = -1;
36                indmax   = -1;
37          CLlength = 0;          
38          clsignal = 0;      CLlength = 0;
39          clsigma  = 0;      clsignal = 0;
40          cladc    = 0;      clsigma  = 0;
41          clbad    = 0;      cladc    = 0;
42        clbad    = 0;
43    
44  };  };
45  //--------------------------------------  //--------------------------------------
46  //  //
47  //  //
48  //--------------------------------------  //--------------------------------------
 TrkCluster::~TrkCluster(){  
   
     if(CLlength){  
         delete [] clsignal;  
         delete [] clsigma;  
         delete [] cladc;  
         delete [] clbad;  
     }  
 };  
 //--------------------------------------  
 //  
 //  
 //--------------------------------------  
49  TrkCluster::TrkCluster(const TrkCluster& t){  TrkCluster::TrkCluster(const TrkCluster& t){
50                    
51          view     = t.view;      view     = t.view;
52          maxs     = t.maxs;      maxs     = t.maxs;
53          indmax   = t.indmax;      indmax   = t.indmax;
54                    
55          CLlength = t.CLlength;        CLlength = t.CLlength;      
56          if(CLlength){      if(CLlength){
57              clsignal = new Float_t[CLlength];          clsignal = new Float_t[CLlength];
58              clsigma  = new Float_t[CLlength];          clsigma  = new Float_t[CLlength];
59              cladc    = new Int_t[CLlength];          cladc    = new Int_t[CLlength];
60              clbad    = new Bool_t[CLlength];          clbad    = new Bool_t[CLlength];
61              for(Int_t i=0; i<CLlength;i++){          for(Int_t i=0; i<CLlength;i++){
62                  clsignal[i] = t.clsignal[i];              clsignal[i] = t.clsignal[i];
63                  clsigma[i]  = t.clsigma[i];              clsigma[i]  = t.clsigma[i];
64                  cladc[i]    = t.cladc[i];              cladc[i]    = t.cladc[i];
65                  clbad[i]    = t.clbad[i];              clbad[i]    = t.clbad[i];
             };  
66          };          };
67        };
68  };  };
69  //--------------------------------------  //--------------------------------------
70  //  //
71  //  //
72  //--------------------------------------  //--------------------------------------
73  void TrkCluster::Clear(){  void TrkCluster::Clear(){
74                
75          view     = 0;  //    cout << "void TrkCluster::Clear()"<<endl;
76          maxs     = 0;      if(CLlength){
77          indmax   = 0;          delete [] clsignal;
78                    delete [] clsigma;
79          CLlength = 0;          delete [] cladc;
80          clsignal = 0;          delete [] clbad;
81          clsigma  = 0;      }
82          cladc    = 0;  
83          clbad    = 0;      view     = 0;
84        maxs     = 0;
85        indmax   = 0;
86            
87        CLlength = 0;
88        clsignal = 0;
89        clsigma  = 0;
90        cladc    = 0;
91        clbad    = 0;
92    
93  };  };
94  //--------------------------------------  //--------------------------------------
# Line 98  void TrkCluster::Clear(){ Line 100  void TrkCluster::Clear(){
100   * strips, around maxs, having a significant signal.   * strips, around maxs, having a significant signal.
101   * @param nstrip   Maximum number of strips.   * @param nstrip   Maximum number of strips.
102   * @param cut      Inclusion cut ( s > cut*sigma ).   * @param cut      Inclusion cut ( s > cut*sigma ).
103     * @param force    Falg to force the PFA strip-inclusion pattern (nstrip>0)
104   * If nstrip<=0 only the inclusion cut is used to determine the cluster size.   * If nstrip<=0 only the inclusion cut is used to determine the cluster size.
105   */   */
106  Float_t TrkCluster::GetSignal(Int_t nstrip, Float_t cut){  Float_t TrkCluster::GetSignal(Int_t nstrip, Float_t cut, Bool_t force){
107                
108        if(CLlength<=0)return 0;
109    
110      Float_t s = 0;      Float_t s = 0;
111            
112        //-----------------------------------
113        // inlcude strips with s > cut*sigma
114        //-----------------------------------
115    
116      if( nstrip<=0 ){      if( nstrip<=0 ){
117  //          for(Int_t is = 0; is < CLlength; is++){  //          for(Int_t is = 0; is < CLlength; is++){
118  //              Float_t scut = cut*clsigma[is];  //              Float_t scut = cut*clsigma[is];
# Line 122  Float_t TrkCluster::GetSignal(Int_t nstr Line 131  Float_t TrkCluster::GetSignal(Int_t nstr
131          return s;          return s;
132      };      };
133            
134        //---------------------------------------------------
135        // inlcude strips with s > cut*sigma, up to nstrip.
136        // strips are included in order of decreasing signal
137        //---------------------------------------------------
138        if( !force ){
139    
140            Int_t il = indmax;
141            Int_t ir = indmax;
142            Int_t inc = 0;
143            
144            if( clsignal[indmax] < cut*clsigma[indmax] ) return 0;
145            
146            while ( inc < nstrip ){
147                Float_t sl = -100000;
148                Float_t sr = -100000;
149                if( il >= 0       ) sl = clsignal[il];
150                if( ir < CLlength ) sr = clsignal[ir];
151                if( sl == sr && inc == 0 ){
152                    s += clsignal[il]; //cout << inc<<" - "<< clsignal[il]<<" "<<s<<endl;
153                    il--;
154                    ir++;
155                }else if ( sl >= sr && sl > cut*clsigma[il] && inc !=0 ){
156                    s += sl;//cout << inc<<" - "<< clsignal[il]<<" "<<s<<endl;
157                    il--;
158                }else if ( sl < sr && sr > cut*clsigma[ir] ){
159                    s += sr;//cout << inc<<" - " << clsignal[ir]<<" "<<s<<endl;
160                    ir++;
161                }else break;
162                
163                inc++;
164            }
165            return s;
166    
167        }else{
168        //---------------------------------------------------
169        // evaluate signal using a fixed number of strips,
170        // following the PFA inclusion patters
171        //---------------------------------------------------
172    //     --> signal of the central strip
173            Float_t sc = clsignal[indmax];
174    //     signal of adjacent strips
175            Float_t sl1 = -9999.;
176            Float_t sl2 = -9999.;
177            Float_t sr1 = -9999.;
178            Float_t sr2 = -9999.;
179            if(indmax-1>=0) sl1 = clsignal[indmax-1];
180            if(indmax-2>=0) sl2 = clsignal[indmax-2];
181            if(indmax+1<CLlength) sr1 = clsignal[indmax+1];
182            if(indmax+2<CLlength) sr2 = clsignal[indmax+2];
183    
184            if(nstrip==1){
185                s = sc;
186            }else if(nstrip==2){
187                if( sl1>sr1 && sl1+sc!=0 )s = (sl1+sc);
188                if( sl1<sr1 && sr1+sc!=0 )s = (sc+sr1);
189                if( sl1==sr1 && sl1 != -9999.){
190                    if( clsigma[indmax-1] < clsigma[indmax+1] &&  sl1+sc!=0 )s = (sl1+sc);
191                    if( clsigma[indmax-1] > clsigma[indmax+1] &&  sc+sr1!=0 )s = (sc+sr1);
192                }
193            }else if(nstrip==3){
194                s = (sl1+sc+sr1);
195            }else if(nstrip==4){
196                if( sl2>sr2 && sl2+sl1+sc+sr1!=0 )s = (sl2+sl1+sc+sr1);
197                if( sl2<sr2 && sl1+sc+sr1+sr2!=0 )s = (sl1+sc+sr1+sr2);
198                if( sl2==sr2 && sl2 != -9999.){
199                    if( clsigma[indmax-2] < clsigma[indmax+2] &&  sl2+sl1+sc+sr1!=0 )s = (sl2+sl1+sc+sr1);
200                    if( clsigma[indmax-2] > clsigma[indmax+2] &&  sl1+sc+sr1+sr2!=0 )s = (sl1+sc+sr1+sr2);
201                }
202            }else if(nstrip==5){
203                s = (sl1+sc+sr1);
204                if(sl2 != -9999.)s += sl2;
205                if(sr2 != -9999.)s += sr2;
206            }else{
207                cout << "Float_t TrkCluster::GetSignal("<<nstrip<<","<<cut<<","<<force<<")- not implemented"<<endl;  
208            }
209            
210      Int_t il = indmax;      }
     Int_t ir = indmax;  
     Int_t inc = 0;  
211    
212      if( clsignal[indmax] < cut*clsigma[indmax] ) return 0;      return 0.;
213    
     while ( inc < nstrip ){  
         Float_t sl = -100000;  
         Float_t sr = -100000;  
         if( il >= 0       ) sl = clsignal[il];  
         if( ir < CLlength ) sr = clsignal[ir];  
         if( sl == sr && inc == 0 ){  
             s += clsignal[il]; //cout << inc<<" - "<< clsignal[il]<<" "<<s<<endl;  
             il--;  
             ir++;  
         }else if ( sl >= sr && sl > cut*clsigma[il] && inc !=0 ){  
             s += sl;//cout << inc<<" - "<< clsignal[il]<<" "<<s<<endl;  
             il--;  
         }else if ( sl < sr && sr > cut*clsigma[ir] ){  
             s += sr;//cout << inc<<" - " << clsignal[ir]<<" "<<s<<endl;  
             ir++;  
         }else break;  
           
         inc++;  
     }  
     return s;  
214  };  };
215    
216    
217  /**  /**
218   including a ( maximum ) fixed number of adjacent strips (with s>0) around the maxs.   * Evaluate the cluster signal-to-noise, as defined by Turchetta, including a
219   * @param nstrip Number of strips.   * maximum number of adjacent strips, around maxs, having a significant signal.
  */  
 /**  
  * Evaluate the cluster signal-to-noise, as defined by Turchetta, including a maximum number of adjacent strips, around maxs, having a significant signal.  
220   * @param nstrip   Maximum number of strips.   * @param nstrip   Maximum number of strips.
221   * @param cut      Inclusion cut ( s > cut*sigma ).   * @param cut      Inclusion cut ( s > cut*sigma ).
222   * If nstrip<=0 only the inclusion cut is used to determine the cluster size.   * If nstrip<=0 only the inclusion cut is used to determine the cluster size.
223   */   */
224  Float_t TrkCluster::GetSignalToNoise(Int_t nstrip, Float_t cut){  Float_t TrkCluster::GetSignalToNoise(Int_t nstrip, Float_t cut){
225                    
226        if(CLlength<=0)return 0;
227    
228      Float_t sn = 0;      Float_t sn = 0;
229            
230      if( nstrip<=0 ){      if( nstrip<=0 ){
# Line 212  Float_t TrkCluster::GetSignalToNoise(Int Line 274  Float_t TrkCluster::GetSignalToNoise(Int
274   * @param cut Inclusion cut.   * @param cut Inclusion cut.
275   */   */
276  Int_t TrkCluster::GetMultiplicity(Float_t cut){  Int_t TrkCluster::GetMultiplicity(Float_t cut){
277          Int_t m = 0;  
278          for(Int_t is = 0; is < CLlength; is++){      if(CLlength<=0)return 0;
279                  Float_t scut = cut*clsigma[is];  
280                  if(clsignal[is] > scut) m++;      Int_t m = 0;
281          };  
282          return m;      for(Int_t is = indmax+1; is < CLlength; is++){
283            Float_t scut = cut*clsigma[is];
284            if(clsignal[is] > scut) m++;
285            else break;
286        };
287        for(Int_t is = indmax; is >=0; is--){
288            Float_t scut = cut*clsigma[is];
289            if(clsignal[is] > scut) m++;
290            else break;
291        };
292        return m;
293  };  };
294  /**  /**
295   * True if the cluster contains bad strips.   * True if the cluster contains bad strips.
296   * @param nbad Number of strips around the maximum.   * @param nbad Number of strips around the maximum.
297   */   */
298  Bool_t TrkCluster::IsBad(Int_t nbad){  Bool_t TrkCluster::IsBad(Int_t nbad){
299                            
300  /*      Float_t max = 0;              if(CLlength<=0)return 0;
301          Int_t  imax = 0;          
302          for(Int_t is = 0; is < CLlength; is++){      Int_t il,ir;
303                  if(clsignal[is] > max){      il = indmax;
304                          max = clsignal[is];      ir = indmax;
305                          imax = is;      for(Int_t i=1; i<nbad; i++){
306                  };          if (ir == CLlength-1 && il == 0)break;
307          };          else if (ir == CLlength-1 && il != 0)il--;
308                    else if (ir != CLlength-1 && il == 0)ir++;
309          Int_t il,ir;          else{
310          il = imax;              if(clsignal[il-1] > clsignal[ir+1])il--;
311          ir = imax;*/              else ir++;
           
         Int_t il,ir;  
         il = indmax;  
         ir = indmax;  
         for(Int_t i=1; i<nbad; i++){  
                      if (ir == CLlength && il == 0)break;  
                 else if (ir == CLlength && il != 0)il--;  
                 else if (ir != CLlength && il == 0)ir++;  
                 else{  
                         if(clsignal[il-1] > clsignal[ir+1])il--;  
                         else ir++;  
                 }  
312          }          }
313          Int_t isbad = 0;      }
314          for(Int_t i=il; i<=ir; i++)isbad += clbad[i];      Int_t isbad = 0;
315                for(Int_t i=il; i<=ir; i++)isbad += clbad[i];
316          return ( isbad != nbad );      
317        return ( isbad != nbad );
318  };  };
319    /**
320     * True if the cluster contains saturated strips.
321     * @param nbad Number of strips around the maximum.
322     */
323    Bool_t TrkCluster::IsSaturated(Int_t nbad){
324    
325        if(CLlength<=0)return 0;
326    
327        Int_t il,ir;
328        il = indmax;
329        ir = indmax;
330        for(Int_t i=1; i<nbad; i++){
331            if (ir == CLlength-1 && il == 0)break;
332            else if (ir == CLlength-1 && il != 0)il--;
333            else if (ir != CLlength-1 && il == 0)ir++;
334            else{
335                if(clsignal[il-1] > clsignal[ir+1])il--;
336                else ir++;
337            }
338        }
339        Int_t isbad = 0;
340        for(Int_t i=il; i<=ir; i++){
341            if( IsX() && cladc[i] > 2980 )isbad++;
342            if( IsY() && cladc[i] <   80 )isbad++;
343        }
344        return ( isbad != 0 );
345        
346    }
347  //--------------------------------------  //--------------------------------------
348  //  //
349  //  //
350  //--------------------------------------  //--------------------------------------
351  void TrkCluster::Dump(){  void TrkCluster::Dump(){
352    
353          cout << "----- Cluster" << endl;      cout << "----- Cluster" << endl;
354          cout << "View "<<view << " - Ladder "<<GetLadder()<<endl;      cout << "View "<<view << " - Ladder "<<GetLadder()<<endl;
355          cout << "Position of maximun "<< maxs <<endl;      cout << "Position of maximun "<< maxs <<endl;
356          cout << "Multiplicity        "<< GetMultiplicity() <<endl;      cout << "Multiplicity        "<< GetMultiplicity() <<endl;
357          cout << "Tot signal          "<< GetSignal() << " (ADC channels)"<<endl ;      cout << "Tot signal          "<< GetSignal() << " (ADC channels)"<<endl ;
358          cout << "Signal/Noise        "<< GetSignalToNoise();      cout << "Signal/Noise        "<< GetSignalToNoise()<<endl;
359          cout <<endl<< "Strip signals       ";      cout << "COG                 "<< GetCOG(0)<<endl;;
360          for(Int_t i =0; i<CLlength; i++)cout << " " <<clsignal[i];      cout << "Strip signals       ";
361          cout <<endl<< "Strip sigmas        ";      for(Int_t i =0; i<CLlength; i++)cout << " " <<clsignal[i];
362          for(Int_t i =0; i<CLlength; i++)cout << " " <<clsigma[i];      cout <<endl<< "Strip sigmas        ";
363          cout <<endl<< "Strip ADC           ";      for(Int_t i =0; i<CLlength; i++)cout << " " <<clsigma[i];
364          for(Int_t i =0; i<CLlength; i++)cout << " " <<cladc[i];      cout <<endl<< "Strip ADC           ";
365          cout <<endl<< "Strip BAD           ";      for(Int_t i =0; i<CLlength; i++)cout << " " <<cladc[i];
366          for(Int_t i =0; i<CLlength; i++){      cout <<endl<< "Strip BAD           ";
367                  if(i==indmax)cout << "  *" <<clbad[i]<<"*";      for(Int_t i =0; i<CLlength; i++){
368                  else cout << " " <<clbad[i];          if(i==indmax)cout << "  *" <<clbad[i]<<"*";
369          }          else cout << " " <<clbad[i];
370          cout << endl;      }
371        cout << endl;
372                    
373  }  }
374  //--------------------------------------  //--------------------------------------
# Line 288  void TrkCluster::Dump(){ Line 378  void TrkCluster::Dump(){
378  /**  /**
379   * Method to fill a level1 struct with only one cluster (done to use F77 p.f.a. routines on a cluster basis).   * Method to fill a level1 struct with only one cluster (done to use F77 p.f.a. routines on a cluster basis).
380   */   */
381  cTrkLevel1* TrkCluster::GetLevel1Struct(){  void TrkCluster::GetLevel1Struct(cTrkLevel1* l1){
382                                    
383  //    cTrkLevel1* l1 = new cTrkLevel1;  //    cTrkLevel1* l1 = new cTrkLevel1;
384    
385      cTrkLevel1* l1 = &level1event_ ;  //    cTrkLevel1* l1 = &level1event_ ;
386                    
387      l1->nclstr1 = 1;      l1->nclstr1 = 1;
388      l1->view[0] = view;      l1->view[0] = view;
# Line 310  cTrkLevel1* TrkCluster::GetLevel1Struct( Line 400  cTrkLevel1* TrkCluster::GetLevel1Struct(
400          l1->clbad[i] = clbad[i];          l1->clbad[i] = clbad[i];
401      };      };
402            
403      return l1;  //    return l1;
404  };  };
405  //--------------------------------------  //--------------------------------------
406  //  //
# Line 321  cTrkLevel1* TrkCluster::GetLevel1Struct( Line 411  cTrkLevel1* TrkCluster::GetLevel1Struct(
411   *      @param ncog Number of strips to evaluate COG.     *      @param ncog Number of strips to evaluate COG.  
412   * If ncog=0, the COG of the cluster is evaluated according to the cluster multiplicity (defined by the inclusion cut).   * If ncog=0, the COG of the cluster is evaluated according to the cluster multiplicity (defined by the inclusion cut).
413   * If ncog>0, the COG is evaluated using ncog strips, even if they have a negative signal (according to G.Landi)   * If ncog>0, the COG is evaluated using ncog strips, even if they have a negative signal (according to G.Landi)
414     *
415     * (NB TrkCluster::GetLevel1Struct() showld be called first, in order to fill the F77 level1 common with this single cluster)
416   */   */
417  Float_t TrkCluster::GetCOG(Int_t ncog){  Float_t TrkCluster::GetCOG(Int_t ncog){
418                    
419      int ic = 1;      int ic = 1;
420      GetLevel1Struct();      //    GetLevel1Struct(); //Elena: dangerous...
421      return cog_(&ncog,&ic);      return cog_(&ncog,&ic);
422                    
423  };  };
# Line 362  Float_t TrkCluster::GetCOG(Float_t angle Line 454  Float_t TrkCluster::GetCOG(Float_t angle
454  //  //
455  //--------------------------------------  //--------------------------------------
456  /**  /**
457   * Evaluates the cluster position, in strips, relative to the strip with the maximum signal (TrkCluster::maxs), by applying the non-linear ETA-algorythm.   * Evaluates the cluster position, in pitch units, relative to the strip
458     *  with the maximum signal (TrkCluster::maxs), by applying the non-linear
459     *  ETA-algorythm.
460   *  @param neta  Number of strips to evaluate ETA.   *  @param neta  Number of strips to evaluate ETA.
461   *  @param angle Projected angle between particle track and detector plane.   *  @param angle Projected (effective) angle between particle track and detector plane.
462     *  @landi flag to apply Landi correction
463   * Implemented values of neta are 2,3,4. If neta=0, ETA2, ETA3 and ETA4 are applied according to the angle.   * Implemented values of neta are 2,3,4. If neta=0, ETA2, ETA3 and ETA4 are applied according to the angle.
464     * (NB TrkCluster::GetLevel1Struct() showld be called first, in order to fill the F77 level1 common with this single cluster)
465   */   */
466  Float_t TrkCluster::GetETA(Int_t neta, float angle){  Float_t TrkCluster::GetETA(Int_t neta, float angle, bool landi){
467                    
468  //    cout << "GetETA(neta,angle) "<< neta << " "<< angle;  //    cout << "GetETA(neta,angle) "<< neta << " "<< angle;
469  //      LoadPfaParam();  //      LoadPfaParam();
470    
471        TrkParams::Load(4);
472        if( !TrkParams::IsLoaded(4) ){
473            cout << "Float_t TrkCluster::GetETA(Int_t neta, float angle, bool landi) --- ERROR --- p.f.a. parameters  not loaded"<<endl;
474            return 0;
475        }
476    
477      float ax = angle;      float ax = angle;
478      int ic = 1;      int ic = 1;
479      GetLevel1Struct();      //GetLevel1Struct(); //Elena: dangerous...
480      if(neta == 0)      return pfaeta_(&ic,&ax);      if(     neta == 0 && !landi) return pfaeta_(&ic,&ax);
481      else if(neta == 2) return pfaeta2_(&ic,&ax);      else if(neta == 0 && landi ) return pfaetal_(&ic,&ax);
482      else if(neta == 3) return pfaeta3_(&ic,&ax);      else if(neta == 2          ) return pfaeta2_(&ic,&ax);
483      else if(neta == 4) return pfaeta4_(&ic,&ax);      else if(neta == 3          ) return pfaeta3_(&ic,&ax);
484      else cout << "ETA"<<neta<<" not implemented\n";      else if(neta == 4          ) return pfaeta4_(&ic,&ax);
485        else cout << "TrkCluster::GetETA("<<neta<<","<<angle<<","<<landi<<") not implemented\n";
486      return 0;      return 0;
487            
488  };  };
489    
490    /**
491     * Evaluates the cluster position, in pitch units, relative to the strip
492     *  with the maximum signal (TrkCluster::maxs), by applying the digital
493     *  algorithm for saturated clusters.
494     *
495     *  @return The cluster position (0 also if if no saturated strip is found).
496     *
497     * (NB TrkCluster::GetLevel1Struct() showld be called first, in order to fill the F77 level1 common with this single cluster)
498     */
499    Float_t TrkCluster::GetDigSat() {
500    
501      //  GetLevel1Struct(); //Elena: dangerous...
502      int ic = 1;
503      return digsat_(&ic);
504    
505    }
506    
507    /**
508     * Evaluates the cluster position, in pitch unit, relative to the strip with
509     * the maximum signal (TrkCluster::maxs), by applying the PFA set as default (see TrkParams).
510     *  @param angle Projected (effective) angle between particle track and detector plane.
511     */
512    Float_t TrkCluster::GetPositionPU(float angle){
513    
514        if     ( TrkParams::GetPFA() == 0  )return GetETA(0,angle,false);
515        else if( TrkParams::GetPFA() == 2  )return GetETA(2,angle,false);
516        else if( TrkParams::GetPFA() == 3  )return GetETA(3,angle,false);
517        else if( TrkParams::GetPFA() == 4  )return GetETA(4,angle,false);
518        else if( TrkParams::GetPFA() == 5  )return GetETA(0,angle,true);
519        else if( TrkParams::GetPFA() == 10 )return GetCOG(0);
520        else if( TrkParams::GetPFA() == 11 )return GetCOG(1);
521        else if( TrkParams::GetPFA() == 12 )return GetCOG(2);
522        else if( TrkParams::GetPFA() == 13 )return GetCOG(3);
523        else if( TrkParams::GetPFA() == 14 )return GetCOG(4);
524        else cout << "  TrkCluster::GetPositionPU(float "<<angle<<") -- WARNING -- PFA="<<TrkParams::GetPFA()<<" not implemented"<<endl;
525        
526        return 0.;
527        
528    }
529    
530    /**
531     * Give the number of strip used to evaluate the cluster coordinate
532     * according to the p.f.a.
533     * It returns 0 when the COG is used (in this case the number of strip used
534     * equals the multiplicity).
535     * (NB TrkCluster::GetLevel1Struct() showld be called first, in order to fill the F77 level1 common with this single cluster)
536     */
537    Int_t TrkCluster::GetPFAstrips(float angle){
538    
539        float ax = angle;
540        int ic = 1;
541        //    GetLevel1Struct(); //Elena: dangerous...
542        return npfastrips_(&ic,&ax);
543    
544    }
545    
546  //--------------------------------------  //--------------------------------------
547  //  //
548  //  //
549  //--------------------------------------  //--------------------------------------
550  TrkLevel1::TrkLevel1(){  TrkLevel1::TrkLevel1(){
551                    
552      Cluster = new TClonesArray("TrkCluster");  //    cout << "TrkLevel1::TrkLevel1()"<<endl;
553        //    Cluster = new TClonesArray("TrkCluster");
554        Cluster = 0;
555      for(Int_t i=0; i<12 ; i++){      for(Int_t i=0; i<12 ; i++){
556          good[i] = -1;          good[i] = -1;
557          for(Int_t j=0; j<24 ; j++){          for(Int_t j=0; j<24 ; j++){
558              cn[j][i]=0;              cn[j][i]=0;
 //          cnrms[j][i]=0;  
559              cnn[j][i]=0;              cnn[j][i]=0;
560          };          };
561      };      };
562    //     TrkParams::SetTrackingMode();
563    //     TrkParams::SetPrecisionFactor();
564    //     TrkParams::SetStepMin();
565        TrkParams::SetMiniDefault();
566        TrkParams::SetPFA();
567    }
568    //--------------------------------------
569    //
570    //
571    //--------------------------------------
572    void TrkLevel1::Set(){
573        if(!Cluster)Cluster = new TClonesArray("TrkCluster");
574  }  }
575  //--------------------------------------  //--------------------------------------
576  //  //
# Line 420  void TrkLevel1::Dump(){ Line 591  void TrkLevel1::Dump(){
591          cout <<endl;          cout <<endl;
592      }      }
593            
594        if(!Cluster)return;
595      TClonesArray &t  = *Cluster;      TClonesArray &t  = *Cluster;
596      for(int i=0; i<this->nclstr(); i++)     ((TrkCluster *)t[i])->Dump();      for(int i=0; i<this->nclstr(); i++)     ((TrkCluster *)t[i])->Dump();
597            
598  }  }
599    /**
600     * \brief Dump processing status
601     */
602    void TrkLevel1::StatusDump(int view){
603        cout << "DSP n. "<<view+1<<" (level1-)status: "<<hex<<showbase<<good[view]<<dec<<endl;    
604    };
605    /**
606     * \brief Check event status
607     *
608     * Check the event status, according to a flag-mask given as input.
609     * Return true if the view passes the check.
610     *
611     * @param view View number (0-11)
612     * @param flagmask Mask of flags to check (eg. flagmask=0x111 no missing packet,
613     *  no crc error, no software alarm)
614     *
615     * @see TrkLevel2 class definition to know how the status flag is defined
616     *
617     */
618    Bool_t TrkLevel1::StatusCheck(int view, int flagmask){
619    
620        if( view<0 || view >= 12)return false;
621        return !(good[view]&flagmask);
622    
623    };
624    
625    
626  //--------------------------------------  //--------------------------------------
627  //  //
628  //  //
# Line 433  void TrkLevel1::Dump(){ Line 632  void TrkLevel1::Dump(){
632   */   */
633  void TrkLevel1::SetFromLevel1Struct(cTrkLevel1 *l1, Bool_t full){  void TrkLevel1::SetFromLevel1Struct(cTrkLevel1 *l1, Bool_t full){
634    
635    //    cout << "void TrkLevel1::SetFromLevel1Struct(cTrkLevel1 *l1, Bool_t full)"<<endl;
636        
637        Clear();
638      //  ---------------      //  ---------------
639      //  *** CLUSTER ***      //  *** CLUSTER ***
640      //  ---------------      //  ---------------
641      TrkCluster* t_cl = new TrkCluster();      TrkCluster* t_cl = new TrkCluster();
642        if(!Cluster)Cluster = new TClonesArray("TrkCluster");
643      TClonesArray &t = *Cluster;      TClonesArray &t = *Cluster;
644      for(int i=0; i<l1->nclstr1; i++){      for(int i=0; i<l1->nclstr1; i++){
645    
646          t_cl->Clear();          t_cl->Clear();
647          if( full || (!full && l1->whichtrack[i]) ){  //      if( full || (!full && l1->whichtrack[i]) ){
648                    
649              t_cl->view     = l1->view[i];          t_cl->view     = l1->view[i];
650              t_cl->maxs     = l1->maxs[i];          t_cl->maxs     = l1->maxs[i];
651              t_cl->indmax   = l1->indmax[i] - l1->indstart[i];  
652                        if( full || (!full && l1->whichtrack[i]) ){
653                t_cl->indmax   = l1->indmax[i] - l1->indstart[i];      
654              Int_t from = l1->indstart[i] -1;              Int_t from = l1->indstart[i] -1;
655              Int_t to   = l1->totCLlength ;              Int_t to   = l1->totCLlength ;
656              if(i != l1->nclstr1-1)to   = l1->indstart[i+1] -1 ;              if(i != l1->nclstr1-1)to   = l1->indstart[i+1] -1 ;
# Line 456  void TrkLevel1::SetFromLevel1Struct(cTrk Line 660  void TrkLevel1::SetFromLevel1Struct(cTrk
660              t_cl->clsigma  = new Float_t[t_cl->CLlength];              t_cl->clsigma  = new Float_t[t_cl->CLlength];
661              t_cl->cladc    = new Int_t[t_cl->CLlength];              t_cl->cladc    = new Int_t[t_cl->CLlength];
662              t_cl->clbad    = new Bool_t[t_cl->CLlength];              t_cl->clbad    = new Bool_t[t_cl->CLlength];
663    
664              Int_t index = 0;              Int_t index = 0;
665              for(Int_t is = from; is < to; is++ ){              for(Int_t is = from; is < to; is++ ){
666                  t_cl->clsignal[index] = (Float_t) l1->clsignal[is];                  t_cl->clsignal[index] = (Float_t) l1->clsignal[is];
# Line 487  void TrkLevel1::SetFromLevel1Struct(cTrk Line 692  void TrkLevel1::SetFromLevel1Struct(cTrk
692   * Fills a struct cTrkLevel1 with values from a TrkLevel1 object (to put data into a F77 common).   * Fills a struct cTrkLevel1 with values from a TrkLevel1 object (to put data into a F77 common).
693   */   */
694    
695  cTrkLevel1* TrkLevel1::GetLevel1Struct() {  void TrkLevel1::GetLevel1Struct(cTrkLevel1* l1) {
696            
697      cTrkLevel1 *l1=0;  //    cTrkLevel1* l1 = &level1event_ ;
698          //      
699      for(Int_t i=0; i<12 ; i++){      for(Int_t i=0; i<12 ; i++){
700          l1->good[i] = good[i];          l1->good[i] = good[i];
701          for(Int_t j=0; j<24 ; j++){          for(Int_t j=0; j<24 ; j++){
702              l1->cnev[j][i]    = cn[j][i];              l1->cnev[j][i]    = cn[j][i]  ;
703  //          l1->cnrmsev[j][i] = cnrms[j][i];              l1->cnnev[j][i]   = cnn[j][i] ;
704              l1->cnnev[j][i]   = cnn[j][i];              l1->cnrmsev[j][i] = 0. ;
705          };          };
706            l1->fshower[i] = 0;
707      };      };
708        
709  //  *** CLUSTERS ***      l1->nclstr1=0;
710      l1->nclstr1 =  Cluster->GetEntries();      l1->totCLlength=0;
711      for(Int_t i=0;i<l1->nclstr1;i++){      Int_t index=0;
712                if(Cluster){
713          l1->view[i]     = ((TrkCluster *)Cluster->At(i))->view;          Int_t i=0;
714          l1->maxs[i]     = ((TrkCluster *)Cluster->At(i))->maxs;          for(Int_t ii=0;ii<Cluster->GetEntries();ii++){
715          // COMPLETARE //              TrkCluster *clu = GetCluster(ii);
716          // COMPLETARE //              // ----------------------------------------
717          // COMPLETARE //              // attenzione!!
718          // COMPLETARE //              // se il cluster non e` salvato (view = 0)
719          // COMPLETARE //              // DEVE essere escluso dal common F77
720          // COMPLETARE //              // ----------------------------------------
721                        if(clu->view != 0 ){
722      }                  l1->view[i]     = clu->view;
723      // COMPLETARE //                  l1->ladder[i]   = clu->GetLadder();
724      // COMPLETARE //                  l1->maxs[i]     = clu->maxs;
725      // COMPLETARE //                  l1->mult[i]     = clu->GetMultiplicity();
726      // COMPLETARE //                  l1->dedx[i]     = clu->GetSignal();
727      // COMPLETARE //                  l1->indstart[i] = index+1;
728      // COMPLETARE //                  l1->indmax[i]   = l1->indstart[i] + clu->indmax;
729      return l1;                  l1->totCLlength += clu->CLlength;
730                    for(Int_t iw=0; iw < clu->CLlength; iw++){
731                        l1->clsignal[index] = clu->clsignal[iw];
732                        l1->clsigma[index]  = clu->clsigma[iw];
733                        l1->cladc[index]    = clu->cladc[iw];
734                        l1->clbad[index]    = clu->clbad[iw];
735                        index++;
736                    }
737                    i++;
738                }
739            }
740            l1->nclstr1 =  i;      
741        }
742    
743    //    return l1;
744  }  }
745  //--------------------------------------  //--------------------------------------
746  //  //
# Line 532  void TrkLevel1::Clear(){ Line 752  void TrkLevel1::Clear(){
752          good[i] = -1;          good[i] = -1;
753          for(Int_t j=0; j<24 ; j++){          for(Int_t j=0; j<24 ; j++){
754              cn[j][i]    = 0;              cn[j][i]    = 0;
 //          cnrms[j][i] = 0;  
755              cnn[j][i]   = 0;              cnn[j][i]   = 0;
756          };          };
757      };      };
758      //  //    if(Cluster)Cluster->Clear("C");
759      Cluster->Clear();      if(Cluster)Cluster->Delete();
760            
761  }  }
762  //--------------------------------------  //--------------------------------------
# Line 545  void TrkLevel1::Clear(){ Line 764  void TrkLevel1::Clear(){
764  //  //
765  //--------------------------------------  //--------------------------------------
766  void TrkLevel1::Delete(){  void TrkLevel1::Delete(){
767                
768      for(Int_t i=0; i<12 ; i++){  //    Clear();
769          good[i] = -1;      if(Cluster)Cluster->Delete();
770          for(Int_t j=0; j<24 ; j++){      if(Cluster)delete Cluster;
             cn[j][i]    = 0;  
 //          cnrms[j][i] = 0;  
             cnn[j][i]   = 0;  
         };  
     };  
     //  
     Cluster->Delete();  
771            
772  }  }
   
773  //--------------------------------------  //--------------------------------------
774  //  //
775  //  //
776  //--------------------------------------  //--------------------------------------
777  TrkCluster *TrkLevel1::GetCluster(int is){  TrkCluster *TrkLevel1::GetCluster(int is){
778    
779  //      if(is >= this->nclstr()){      if(!Cluster)return 0;
780  //              cout << "** TrkLevel1::GetCluster(int) ** Cluster "<< is << " does not exits! " << endl;      if(is >= nclstr()){
781  //              cout << "( Stored clusters nclstr() = "<< this->nclstr()<<" )" << endl;          cout << "** TrkLevel1::GetCluster(int) ** Cluster "<< is << " does not exits! " << endl;
782  //              return 0;          cout << "( Stored clusters nclstr() = "<< this->nclstr()<<" )" << endl;
783            return 0;
784        }
785        
786        TClonesArray &t = *(Cluster);
787        TrkCluster *cluster = (TrkCluster*)t[is];
788        return cluster;
789    }
790    
791    
792    // int TrkLevel1::GetPfaNbinsAngle(){
793    //     TrkParams::Load(4);
794    //     if( !TrkParams::IsLoaded(4) ){
795    //      cout << "int TrkLevel1::GetPfaNbinsAngle() --- ERROR --- p.f.a. parameters  not loaded"<<endl;
796    //      return 0;
797    //     }
798    //     return pfa_.nangbin;
799    // };
800    
801    // int TrkLevel1::GetPfaNbinsETA(){
802    //     TrkParams::Load(4);
803    //     if( !TrkParams::IsLoaded(4) ){
804    //      cout << "int TrkLevel1::GetPfaNbinsETA() --- ERROR --- p.f.a. parameters  not loaded"<<endl;
805    //      return 0;
806    //     }
807    //     return pfa_.netaval;
808    // };
809    
810    // /**
811    //  *
812    //  *
813    //  */
814    // float* TrkLevel1::GetPfaCoord(TString pfa, int nview, int nladder, int nang){
815    
816    //     TrkParams::Load(4);
817    //     if( !TrkParams::IsLoaded(4) ){
818    //      cout << "float* TrkLevel1::GetPfaCoord(TString pfa, int nview, int nladder, int nang) --- ERROR --- p.f.a. parameters  not loaded"<<endl;
819    //      return 0;
820    //     }
821      
822    //     int nbins = GetPfaNbinsETA();
823    //     if(!nbins)return 0;
824    
825    //     float *fcorr = new float [nbins];
826    
827    //     if(!pfa.CompareTo("ETA2",TString::kIgnoreCase)){
828    //      for(int ib=0; ib<nbins; ib++){
829    //          fcorr[ib] = pfa_.feta2[nang][nladder][nview][ib];
830    //          cout << pfa_.eta2[nang][ib] << " - " <<  pfa_.feta2[nang][nladder][nview][ib]<<endl;;
831  //      }  //      }
832          TClonesArray &t = *(Cluster);  //     }else if (!pfa.CompareTo("ETA3",TString::kIgnoreCase)){
833          TrkCluster *cluster = (TrkCluster*)t[is];  //      for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.feta3[nang][nladder][nview][ib];
834          return cluster;  //     }else if (!pfa.CompareTo("ETA4",TString::kIgnoreCase)){
835    //      for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.feta4[nang][nladder][nview][ib];
836    //     }else{
837    //      cout << pfa<<" pfa parameters not implemented "<<endl;
838    //      return 0;
839    //     }    
840    
841    //     return fcorr;
842    
843    // };
844    
845    // float* TrkLevel1::GetPfaAbs(TString pfa, int nang){
846      
847    //     TrkParams::Load(4);
848    //     if( !TrkParams::IsLoaded(4) ){
849    //      cout << "float* TrkLevel1::GetPfaAbs(TString pfa, int nang) --- ERROR --- p.f.a. parameters  not loaded"<<endl;
850    //      return 0;
851    //     }
852    
853    //     int nbins = GetPfaNbinsETA();
854    //     if(!nbins)return 0;
855    
856    //     float *fcorr = new float [nbins];
857    
858    //     if(!pfa.CompareTo("ETA2",TString::kIgnoreCase)){
859    //      for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.eta2[nang][ib];
860    //     }else if (!pfa.CompareTo("ETA3",TString::kIgnoreCase)){
861    //      for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.eta3[nang][ib];
862    //     }else if (!pfa.CompareTo("ETA4",TString::kIgnoreCase)){
863    //      for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.eta4[nang][ib];
864    //     }else{
865    //      cout << pfa<<" pfa parameters not implemented "<<endl;
866    //      return 0;
867    //     }    
868    
869    //     return fcorr;
870    
871    // };
872    
873    /**
874     * Method to call the F77 routine that performs level1->level2 processing.
875     * The level2 output is stored in a common block, which can be retrieved
876     * by mean of the method TrkLevel2::SetFromLevel2Struct().
877     * NB If the TrkLevel1 object is readout from a tree, and the
878     * TrkLevel1::ProcessEvent(int pfa) is used to reprocess the event, attention
879     * should be payed to the fact that single clusters (clusters not associated
880     * with any track) might not be stored. Full reprocessing should be done starting
881     * from level0 data.
882     */
883    //int TrkLevel1::ProcessEvent(int pfa){
884    int TrkLevel1::ProcessEvent(){
885    
886    //    cout << "int TrkLevel1::ProcessEvent()" << endl;
887        TrkParams::Load( );
888        if( !TrkParams::IsLoaded() )return 0;
889    
890        GetLevel1Struct();
891    
892    //    analysisflight_(&pfa);
893    //    TrkParams::SetPFA(pfa);
894        analysisflight_();
895    
896        return 1;
897    
898  }  }
899    
900  //--------------------------------------  //--------------------------------------
901  //  //
902  //  //
903  //--------------------------------------  //--------------------------------------
904  /**  /**
905   * Load Position-Finding-Algorythm parameters (call the F77 routine).   * Method to fill a TrkLevel1 object from an existing one, by cleaning low-signal clusters.
906   *   *
907   */   */
908  int TrkLevel1::LoadPfaParam(TString path){  void TrkLevel1::Set(TrkLevel1 *trkl1, float mipCut, float fCut){
909    
910    
911    
912        
913        if(!trkl1)return;
914    
915        //  -------------------------
916        //  ****general variables****
917        //  -------------------------    
918        for(Int_t i=0; i<12 ; i++){
919            good[i] = trkl1->good[i];
920            for(Int_t j=0; j<24 ; j++){
921                cn[j][i]     = trkl1->cn[j][i];
922                cnn[j][i]    = trkl1->cnn[j][i];
923            };
924        };
925        //  -------------------------
926        //  ****cluster array****
927        //  -------------------------    
928    
929        if(Cluster)Cluster->Clear("C");
930        Cluster = new TClonesArray("TrkCluster");
931        TClonesArray &t = *Cluster;
932    
933        int isel=0;
934        for(int icl=0 ; icl< trkl1->GetClusters()->GetEntries(); icl++){
935            TrkCluster *cl = trkl1->GetCluster(icl);
936    
937            float mip = TrkParams::GetMIP(cl->GetLadder()-1,cl->view-1);
938            float smip = cl->GetSignal()/(mip>0.?mip:1.);
939            float smax =  cl->clsignal[cl->indmax]/(mip>0.?mip:1.);
940            if(smax/smip<fCut)continue;
941            if(smip<mipCut)continue;
942            if(smax<0.5*mipCut)continue;
943                    
         if( strcmp(path_.path,path.Data()) ){  
             cout <<"Loading p.f.a. parameters\n";  
             strcpy(path_.path,path.Data());  
             path_.pathlen = path.Length();  
             path_.error   = 0;  
             return readetaparam_();  
         }        
         return 0;  
 }  
944    
945    
946            new(t[isel]) TrkCluster(*cl); // <<< store cluster
947            isel++;
948        }
949    
950    
951    
952    }
953    
954  ClassImp(TrkLevel1);  ClassImp(TrkLevel1);
955  ClassImp(TrkCluster);  ClassImp(TrkCluster);
Legend:
Removed from v.1.10  
changed lines
  Added in v.1.28
  ViewVC Help
Powered by ViewVC 1.1.23