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 |
|
int npfastrips_(int*,float*); |
21 |
|
|
22 |
} |
} |
23 |
//-------------------------------------- |
//-------------------------------------- |
96 |
* strips, around maxs, having a significant signal. |
* strips, around maxs, having a significant signal. |
97 |
* @param nstrip Maximum number of strips. |
* @param nstrip Maximum number of strips. |
98 |
* @param cut Inclusion cut ( s > cut*sigma ). |
* @param cut Inclusion cut ( s > cut*sigma ). |
99 |
|
* @param force Falg to force the PFA strip-inclusion pattern (nstrip>0) |
100 |
* 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. |
101 |
*/ |
*/ |
102 |
Float_t TrkCluster::GetSignal(Int_t nstrip, Float_t cut){ |
Float_t TrkCluster::GetSignal(Int_t nstrip, Float_t cut, Bool_t force){ |
103 |
|
|
104 |
if(CLlength<=0)return 0; |
if(CLlength<=0)return 0; |
105 |
|
|
106 |
Float_t s = 0; |
Float_t s = 0; |
107 |
|
|
108 |
|
//----------------------------------- |
109 |
|
// inlcude strips with s > cut*sigma |
110 |
|
//----------------------------------- |
111 |
|
|
112 |
if( nstrip<=0 ){ |
if( nstrip<=0 ){ |
113 |
// for(Int_t is = 0; is < CLlength; is++){ |
// for(Int_t is = 0; is < CLlength; is++){ |
114 |
// Float_t scut = cut*clsigma[is]; |
// Float_t scut = cut*clsigma[is]; |
127 |
return s; |
return s; |
128 |
}; |
}; |
129 |
|
|
130 |
|
//--------------------------------------------------- |
131 |
|
// inlcude strips with s > cut*sigma, up to nstrip. |
132 |
|
// strips are included in order of decreasing signal |
133 |
|
//--------------------------------------------------- |
134 |
|
if( !force ){ |
135 |
|
|
136 |
|
Int_t il = indmax; |
137 |
|
Int_t ir = indmax; |
138 |
|
Int_t inc = 0; |
139 |
|
|
140 |
|
if( clsignal[indmax] < cut*clsigma[indmax] ) return 0; |
141 |
|
|
142 |
|
while ( inc < nstrip ){ |
143 |
|
Float_t sl = -100000; |
144 |
|
Float_t sr = -100000; |
145 |
|
if( il >= 0 ) sl = clsignal[il]; |
146 |
|
if( ir < CLlength ) sr = clsignal[ir]; |
147 |
|
if( sl == sr && inc == 0 ){ |
148 |
|
s += clsignal[il]; //cout << inc<<" - "<< clsignal[il]<<" "<<s<<endl; |
149 |
|
il--; |
150 |
|
ir++; |
151 |
|
}else if ( sl >= sr && sl > cut*clsigma[il] && inc !=0 ){ |
152 |
|
s += sl;//cout << inc<<" - "<< clsignal[il]<<" "<<s<<endl; |
153 |
|
il--; |
154 |
|
}else if ( sl < sr && sr > cut*clsigma[ir] ){ |
155 |
|
s += sr;//cout << inc<<" - " << clsignal[ir]<<" "<<s<<endl; |
156 |
|
ir++; |
157 |
|
}else break; |
158 |
|
|
159 |
|
inc++; |
160 |
|
} |
161 |
|
return s; |
162 |
|
|
163 |
|
}else{ |
164 |
|
//--------------------------------------------------- |
165 |
|
// evaluate signal using a fixed number of strips, |
166 |
|
// following the PFA inclusion patters |
167 |
|
//--------------------------------------------------- |
168 |
|
// --> signal of the central strip |
169 |
|
Float_t sc = clsignal[indmax]; |
170 |
|
// signal of adjacent strips |
171 |
|
Float_t sl1 = -9999.; |
172 |
|
Float_t sl2 = -9999.; |
173 |
|
Float_t sr1 = -9999.; |
174 |
|
Float_t sr2 = -9999.; |
175 |
|
if(indmax-1>=0) sl1 = clsignal[indmax-1]; |
176 |
|
if(indmax-2>=0) sl2 = clsignal[indmax-2]; |
177 |
|
if(indmax+1<CLlength) sr1 = clsignal[indmax+1]; |
178 |
|
if(indmax+2<CLlength) sr2 = clsignal[indmax+2]; |
179 |
|
|
180 |
|
if(nstrip==1){ |
181 |
|
s = sc; |
182 |
|
}else if(nstrip==2){ |
183 |
|
if( sl1>sr1 && sl1+sc!=0 )s = (sl1+sc); |
184 |
|
if( sl1<sr1 && sr1+sc!=0 )s = (sc+sr1); |
185 |
|
if( sl1==sr1 && sl1 != -9999.){ |
186 |
|
if( clsigma[indmax-1] < clsigma[indmax+1] && sl1+sc!=0 )s = (sl1+sc); |
187 |
|
if( clsigma[indmax-1] > clsigma[indmax+1] && sc+sr1!=0 )s = (sc+sr1); |
188 |
|
} |
189 |
|
}else if(nstrip==3){ |
190 |
|
s = (sl1+sc+sr1); |
191 |
|
}else if(nstrip==4){ |
192 |
|
if( sl2>sr2 && sl2+sl1+sc+sr1!=0 )s = (sl2+sl1+sc+sr1); |
193 |
|
if( sl2<sr2 && sl1+sc+sr1+sr2!=0 )s = (sl1+sc+sr1+sr2); |
194 |
|
if( sl2==sr2 && sl2 != -9999.){ |
195 |
|
if( clsigma[indmax-2] < clsigma[indmax+2] && sl2+sl1+sc+sr1!=0 )s = (sl2+sl1+sc+sr1); |
196 |
|
if( clsigma[indmax-2] > clsigma[indmax+2] && sl1+sc+sr1+sr2!=0 )s = (sl1+sc+sr1+sr2); |
197 |
|
} |
198 |
|
}else if(nstrip==5){ |
199 |
|
s = (sl1+sc+sr1); |
200 |
|
if(sl2 != -9999.)s += sl2; |
201 |
|
if(sr2 != -9999.)s += sr2; |
202 |
|
}else{ |
203 |
|
cout << "Float_t TrkCluster::GetSignal("<<nstrip<<","<<cut<<","<<force<<")- not implemented"<<endl; |
204 |
|
} |
205 |
|
|
206 |
Int_t il = indmax; |
} |
|
Int_t ir = indmax; |
|
|
Int_t inc = 0; |
|
207 |
|
|
208 |
if( clsignal[indmax] < cut*clsigma[indmax] ) return 0; |
return 0.; |
209 |
|
|
|
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; |
|
210 |
}; |
}; |
211 |
|
|
212 |
|
|
299 |
il = indmax; |
il = indmax; |
300 |
ir = indmax; |
ir = indmax; |
301 |
for(Int_t i=1; i<nbad; i++){ |
for(Int_t i=1; i<nbad; i++){ |
302 |
if (ir == CLlength && il == 0)break; |
if (ir == CLlength-1 && il == 0)break; |
303 |
else if (ir == CLlength && il != 0)il--; |
else if (ir == CLlength-1 && il != 0)il--; |
304 |
else if (ir != CLlength && il == 0)ir++; |
else if (ir != CLlength-1 && il == 0)ir++; |
305 |
else{ |
else{ |
306 |
if(clsignal[il-1] > clsignal[ir+1])il--; |
if(clsignal[il-1] > clsignal[ir+1])il--; |
307 |
else ir++; |
else ir++; |
324 |
il = indmax; |
il = indmax; |
325 |
ir = indmax; |
ir = indmax; |
326 |
for(Int_t i=1; i<nbad; i++){ |
for(Int_t i=1; i<nbad; i++){ |
327 |
if (ir == CLlength && il == 0)break; |
if (ir == CLlength-1 && il == 0)break; |
328 |
else if (ir == CLlength && il != 0)il--; |
else if (ir == CLlength-1 && il != 0)il--; |
329 |
else if (ir != CLlength && il == 0)ir++; |
else if (ir != CLlength-1 && il == 0)ir++; |
330 |
else{ |
else{ |
331 |
if(clsignal[il-1] > clsignal[ir+1])il--; |
if(clsignal[il-1] > clsignal[ir+1])il--; |
332 |
else ir++; |
else ir++; |
351 |
cout << "Position of maximun "<< maxs <<endl; |
cout << "Position of maximun "<< maxs <<endl; |
352 |
cout << "Multiplicity "<< GetMultiplicity() <<endl; |
cout << "Multiplicity "<< GetMultiplicity() <<endl; |
353 |
cout << "Tot signal "<< GetSignal() << " (ADC channels)"<<endl ; |
cout << "Tot signal "<< GetSignal() << " (ADC channels)"<<endl ; |
354 |
cout << "Signal/Noise "<< GetSignalToNoise(); |
cout << "Signal/Noise "<< GetSignalToNoise()<<endl; |
355 |
cout <<endl<< "Strip signals "; |
cout << "COG "<< GetCOG(0)<<endl;; |
356 |
|
cout << "Strip signals "; |
357 |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clsignal[i]; |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clsignal[i]; |
358 |
cout <<endl<< "Strip sigmas "; |
cout <<endl<< "Strip sigmas "; |
359 |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clsigma[i]; |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clsigma[i]; |
448 |
// |
// |
449 |
//-------------------------------------- |
//-------------------------------------- |
450 |
/** |
/** |
451 |
* 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 |
452 |
|
* with the maximum signal (TrkCluster::maxs), by applying the non-linear |
453 |
|
* ETA-algorythm. |
454 |
* @param neta Number of strips to evaluate ETA. |
* @param neta Number of strips to evaluate ETA. |
455 |
* @param angle Projected angle between particle track and detector plane. |
* @param angle Projected (effective) angle between particle track and detector plane. |
456 |
|
* @landi flag to apply Landi correction |
457 |
* 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. |
458 |
*/ |
*/ |
459 |
Float_t TrkCluster::GetETA(Int_t neta, float angle){ |
Float_t TrkCluster::GetETA(Int_t neta, float angle, bool landi){ |
460 |
|
|
461 |
// cout << "GetETA(neta,angle) "<< neta << " "<< angle; |
// cout << "GetETA(neta,angle) "<< neta << " "<< angle; |
462 |
// LoadPfaParam(); |
// LoadPfaParam(); |
463 |
|
|
464 |
TrkParams::Load(4); |
TrkParams::Load(4); |
465 |
if( !TrkParams::IsLoaded(4) ){ |
if( !TrkParams::IsLoaded(4) ){ |
466 |
cout << "int Trajectory::DoTrack2(float* al) --- ERROR --- p.f.a. parameters not loaded"<<endl; |
cout << "Float_t TrkCluster::GetETA(Int_t neta, float angle, bool landi) --- ERROR --- p.f.a. parameters not loaded"<<endl; |
467 |
return 0; |
return 0; |
468 |
} |
} |
469 |
|
|
470 |
float ax = angle; |
float ax = angle; |
471 |
int ic = 1; |
int ic = 1; |
472 |
GetLevel1Struct(); |
GetLevel1Struct(); |
473 |
if(neta == 0) return pfaeta_(&ic,&ax); |
if( neta == 0 && !landi) return pfaeta_(&ic,&ax); |
474 |
else if(neta == 2) return pfaeta2_(&ic,&ax); |
else if(neta == 0 && landi ) return pfaetal_(&ic,&ax); |
475 |
else if(neta == 3) return pfaeta3_(&ic,&ax); |
else if(neta == 2 ) return pfaeta2_(&ic,&ax); |
476 |
else if(neta == 4) return pfaeta4_(&ic,&ax); |
else if(neta == 3 ) return pfaeta3_(&ic,&ax); |
477 |
else cout << "ETA"<<neta<<" not implemented\n"; |
else if(neta == 4 ) return pfaeta4_(&ic,&ax); |
478 |
|
else cout << "TrkCluster::GetETA("<<neta<<","<<angle<<","<<landi<<") not implemented\n"; |
479 |
return 0; |
return 0; |
480 |
|
|
481 |
}; |
}; |
482 |
|
|
483 |
|
/** |
484 |
|
* Evaluates the cluster position, in pitch unit, relative to the strip with |
485 |
|
* the maximum signal (TrkCluster::maxs), by applying the PFA set as default (see TrkParams). |
486 |
|
* @param angle Projected (effective) angle between particle track and detector plane. |
487 |
|
*/ |
488 |
|
Float_t TrkCluster::GetPositionPU(float angle){ |
489 |
|
|
490 |
|
if ( TrkParams::GetPFA() == 0 )return GetETA(0,angle,false); |
491 |
|
else if( TrkParams::GetPFA() == 2 )return GetETA(2,angle,false); |
492 |
|
else if( TrkParams::GetPFA() == 3 )return GetETA(3,angle,false); |
493 |
|
else if( TrkParams::GetPFA() == 4 )return GetETA(4,angle,false); |
494 |
|
else if( TrkParams::GetPFA() == 5 )return GetETA(0,angle,true); |
495 |
|
else if( TrkParams::GetPFA() == 10 )return GetCOG(0); |
496 |
|
else if( TrkParams::GetPFA() == 11 )return GetCOG(1); |
497 |
|
else if( TrkParams::GetPFA() == 12 )return GetCOG(2); |
498 |
|
else if( TrkParams::GetPFA() == 13 )return GetCOG(3); |
499 |
|
else if( TrkParams::GetPFA() == 14 )return GetCOG(4); |
500 |
|
else cout << " TrkCluster::GetPositionPU(float "<<angle<<") -- WARNING -- PFA="<<TrkParams::GetPFA()<<" not implemented"<<endl; |
501 |
|
|
502 |
|
return 0.; |
503 |
|
|
504 |
|
} |
505 |
|
|
506 |
|
/** |
507 |
|
* Give the number of strip used to evaluate the cluster coordinate |
508 |
|
* according to the p.f.a. |
509 |
|
* It returns 0 when the COG is used (in this case the number of strip used |
510 |
|
* equals the multiplicity). |
511 |
|
*/ |
512 |
|
Int_t TrkCluster::GetPFAstrips(float angle){ |
513 |
|
|
514 |
|
float ax = angle; |
515 |
|
int ic = 1; |
516 |
|
GetLevel1Struct(); |
517 |
|
return npfastrips_(&ic,&ax); |
518 |
|
|
519 |
|
} |
520 |
|
|
521 |
//-------------------------------------- |
//-------------------------------------- |
522 |
// |
// |
523 |
// |
// |
534 |
cnn[j][i]=0; |
cnn[j][i]=0; |
535 |
}; |
}; |
536 |
}; |
}; |
537 |
|
TrkParams::SetTrackingMode(); |
538 |
|
TrkParams::SetPrecisionFactor(); |
539 |
|
TrkParams::SetStepMin(); |
540 |
|
TrkParams::SetPFA(); |
541 |
} |
} |
542 |
//-------------------------------------- |
//-------------------------------------- |
543 |
// |
// |
570 |
for(int i=0; i<this->nclstr(); i++) ((TrkCluster *)t[i])->Dump(); |
for(int i=0; i<this->nclstr(); i++) ((TrkCluster *)t[i])->Dump(); |
571 |
|
|
572 |
} |
} |
573 |
|
/** |
574 |
|
* \brief Dump processing status |
575 |
|
*/ |
576 |
|
void TrkLevel1::StatusDump(int view){ |
577 |
|
cout << "DSP n. "<<view+1<<" (level1-)status: "<<hex<<showbase<<good[view]<<dec<<endl; |
578 |
|
}; |
579 |
|
/** |
580 |
|
* \brief Check event status |
581 |
|
* |
582 |
|
* Check the event status, according to a flag-mask given as input. |
583 |
|
* Return true if the view passes the check. |
584 |
|
* |
585 |
|
* @param view View number (0-11) |
586 |
|
* @param flagmask Mask of flags to check (eg. flagmask=0x111 no missing packet, |
587 |
|
* no crc error, no software alarm) |
588 |
|
* |
589 |
|
* @see TrkLevel2 class definition to know how the status flag is defined |
590 |
|
* |
591 |
|
*/ |
592 |
|
Bool_t TrkLevel1::StatusCheck(int view, int flagmask){ |
593 |
|
|
594 |
|
if( view<0 || view >= 12)return false; |
595 |
|
return !(good[view]&flagmask); |
596 |
|
|
597 |
|
}; |
598 |
|
|
599 |
|
|
600 |
//-------------------------------------- |
//-------------------------------------- |
601 |
// |
// |
602 |
// |
// |
634 |
t_cl->clsigma = new Float_t[t_cl->CLlength]; |
t_cl->clsigma = new Float_t[t_cl->CLlength]; |
635 |
t_cl->cladc = new Int_t[t_cl->CLlength]; |
t_cl->cladc = new Int_t[t_cl->CLlength]; |
636 |
t_cl->clbad = new Bool_t[t_cl->CLlength]; |
t_cl->clbad = new Bool_t[t_cl->CLlength]; |
637 |
|
|
638 |
Int_t index = 0; |
Int_t index = 0; |
639 |
for(Int_t is = from; is < to; is++ ){ |
for(Int_t is = from; is < to; is++ ){ |
640 |
t_cl->clsignal[index] = (Float_t) l1->clsignal[is]; |
t_cl->clsignal[index] = (Float_t) l1->clsignal[is]; |
1008 |
* Method to call the F77 routine that performs level1->level2 processing. |
* Method to call the F77 routine that performs level1->level2 processing. |
1009 |
* The level2 output is stored in a common block, which can be retrieved |
* The level2 output is stored in a common block, which can be retrieved |
1010 |
* by mean of the method TrkLevel2::SetFromLevel2Struct(). |
* by mean of the method TrkLevel2::SetFromLevel2Struct(). |
|
* @param pfa Position finding algorythm used to reconstruct the track |
|
|
* Implemented algorythms: |
|
|
* 0 ETA (default) |
|
|
* 1 --- |
|
|
* 2 ETA2 |
|
|
* 3 ETA3 |
|
|
* 4 ETA4 |
|
|
* 10 COG |
|
|
* 11 COG1 |
|
|
* 12 COG2 |
|
|
* 13 COG3 |
|
|
* 14 COG4 |
|
1011 |
* NB If the TrkLevel1 object is readout from a tree, and the |
* NB If the TrkLevel1 object is readout from a tree, and the |
1012 |
* TrkLevel1::ProcessEvent(int pfa) is used to reprocess the event, attention |
* TrkLevel1::ProcessEvent(int pfa) is used to reprocess the event, attention |
1013 |
* should be payed to the fact that single clusters (clusters not associated |
* should be payed to the fact that single clusters (clusters not associated |
1014 |
* with any track) might not be stored. Full reprocessing should be done from |
* with any track) might not be stored. Full reprocessing should be done starting |
1015 |
* level0 data. |
* from level0 data. |
1016 |
*/ |
*/ |
1017 |
int TrkLevel1::ProcessEvent(int pfa){ |
//int TrkLevel1::ProcessEvent(int pfa){ |
1018 |
|
int TrkLevel1::ProcessEvent(){ |
1019 |
|
|
1020 |
// cout << "int TrkLevel1::ProcessEvent()" << endl; |
// cout << "int TrkLevel1::ProcessEvent()" << endl; |
1021 |
TrkParams::Load( ); |
TrkParams::Load( ); |
1023 |
|
|
1024 |
GetLevel1Struct(); |
GetLevel1Struct(); |
1025 |
|
|
1026 |
analysisflight_(&pfa); |
// analysisflight_(&pfa); |
1027 |
|
// TrkParams::SetPFA(pfa); |
1028 |
|
analysisflight_(); |
1029 |
|
|
1030 |
return 1; |
return 1; |
1031 |
|
|