30 |
#define XMAGNLOW -8.07 |
#define XMAGNLOW -8.07 |
31 |
#define YMAGNHIGH 6.57 |
#define YMAGNHIGH 6.57 |
32 |
#define YMAGNLOW -6.57 |
#define YMAGNLOW -6.57 |
33 |
|
// tof planes |
34 |
|
#define ZS11 53.74 |
35 |
|
#define ZS12 53.04 |
36 |
|
#define ZS21 23.94 |
37 |
|
#define ZS22 23.44 |
38 |
|
#define ZS31 -23.49 |
39 |
|
#define ZS32 -24.34 |
40 |
|
|
41 |
// (mechanical) x/y-coordinates of magnet cavity |
// (mechanical) x/y-coordinates of magnet cavity |
42 |
/* #define XTRKL -8.1 */ |
/* #define XTRKL -8.1 */ |
43 |
/* #define XTRKR 8.1 */ |
/* #define XTRKR 8.1 */ |
57 |
public: |
public: |
58 |
|
|
59 |
int npoint; ///< number of evaluated points along the trajectory |
int npoint; ///< number of evaluated points along the trajectory |
60 |
float* x; ///< x coordinates |
float* x; //[npoint] |
61 |
float* y; ///< y coordinates |
float* y; //[npoint] |
62 |
float* z; ///< z coordinates |
float* z; //[npoint] |
63 |
float* thx; ///< x projected angle |
float* thx; //[npoint] |
64 |
float* thy; ///< y projected angle |
float* thy; //[npoint] |
65 |
float* tl; ///< track length |
float* tl; //[npoint] |
66 |
|
|
67 |
Trajectory(); |
Trajectory(); |
68 |
Trajectory(int n); |
Trajectory(int n); |
71 |
void Dump(); |
void Dump(); |
72 |
void Delete(); |
void Delete(); |
73 |
|
|
74 |
int DoTrack2(float* al); |
int DoTrack(float* al, float zini); |
75 |
|
int DoTrack(float* al){ return DoTrack(al,23.5); }; |
76 |
|
|
77 |
|
int DoTrack2(float* al, float zini); |
78 |
|
int DoTrack2(float* al){ return DoTrack2(al,23.5); }; |
79 |
|
|
80 |
float GetLength(){float l=0; for(int i=0; i<npoint;i++)l=l+tl[i]; return l;}; |
float GetLength(){float l=0; for(int i=0; i<npoint;i++)l=l+tl[i]; return l;}; |
81 |
float GetLength(int,int); |
float GetLength(int,int); |
82 |
|
|
83 |
ClassDef(Trajectory,2); |
ClassDef(Trajectory,3); |
84 |
|
|
85 |
}; |
}; |
86 |
/** |
/** |
93 |
* Cluster flags: xgood[6], ygood[6] |
* Cluster flags: xgood[6], ygood[6] |
94 |
* |
* |
95 |
* xgood/ygood = +/- 0lsccccccc |
* xgood/ygood = +/- 0lsccccccc |
96 |
* | |||------- ID (1-7483647) of the included cluster |
* ccccccc ID (1-7483647) of the included cluster |
97 |
* | ||-------- sensor number (1,2 - increasing y) |
* s sensor number (1,2 - increasing y) |
98 |
* | |--------- ladder number (1,2,3 - increasing x) |
* l ladder number (1,2,3 - increasing x) |
99 |
* |------------- does-not/does include bad strips |
* +/- does-not/does include bad strips |
100 |
|
* |
101 |
*/ |
*/ |
102 |
// ================================================================== |
// ================================================================== |
103 |
class TrkTrack : public TObject { |
class TrkTrack : public TObject { |
136 |
float xpu[6]; ///< x coordinate in pitch units |
float xpu[6]; ///< x coordinate in pitch units |
137 |
float ypu[6]; ///< y coordinate in pitch units |
float ypu[6]; ///< y coordinate in pitch units |
138 |
|
|
139 |
|
float xGF[14]; ///<calculated x coordinates on GF reference planes |
140 |
|
float yGF[14]; ///<calculated y coordinates on GF reference planes |
141 |
|
|
142 |
TrkTrack(); |
TrkTrack(); |
143 |
TrkTrack(const TrkTrack&); |
TrkTrack(const TrkTrack&); |
144 |
|
|
154 |
Int_t GetSeqNo(){return seqno;} ///< Returns the track sequential number |
Int_t GetSeqNo(){return seqno;} ///< Returns the track sequential number |
155 |
Int_t GetImageSeqNo(){return image;} ///< Returns the track image sequential number |
Int_t GetImageSeqNo(){return image;} ///< Returns the track image sequential number |
156 |
Bool_t HasImage(){return !(image==-1);} ///< Returns true if the track has an image |
Bool_t HasImage(){return !(image==-1);} ///< Returns true if the track has an image |
157 |
int DoTrack(Trajectory* t); ///< Evaluates the trajectory in the apparatus. |
int DoTrack(Trajectory* t); ///< Evaluates the trajectory in the apparatus. |
158 |
int DoTrack2(Trajectory* t); ///< Evaluates the trajectory in the apparatus. |
int DoTrack2(Trajectory* t); ///< Evaluates the trajectory in the apparatus. |
159 |
float BdL(){return 0;}; ///< Evaluates the integral of B*dL along the track. |
float BdL(){return 0;}; ///< Evaluates the integral of B*dL along the track. |
160 |
Int_t GetNX(){Int_t n=0; for(Int_t i=0; i<6; i++)n+=(Int_t)XGood(i); return n;}; |
Int_t GetNX(){Int_t n=0; for(Int_t i=0; i<6; i++)n+=(Int_t)XGood(i); return n;}; |
161 |
Int_t GetNY(){Int_t n=0; for(Int_t i=0; i<6; i++)n+=(Int_t)YGood(i); return n;}; |
Int_t GetNY(){Int_t n=0; for(Int_t i=0; i<6; i++)n+=(Int_t)YGood(i); return n;}; |
162 |
|
Int_t GetNXY(){Int_t n=0; for(Int_t i=0; i<6; i++)n+=(Int_t)YGood(i)*XGood(i); return n;}; |
163 |
Int_t GetNtot(){return GetNX()+GetNY();}; |
Int_t GetNtot(){return GetNX()+GetNY();}; |
164 |
Float_t GetRigidity(); |
Float_t GetRigidity(); |
165 |
Float_t GetDeflection(); |
Float_t GetDeflection(); |
170 |
Float_t GetDEDX(); |
Float_t GetDEDX(); |
171 |
Float_t GetDEDX(int ip); |
Float_t GetDEDX(int ip); |
172 |
Float_t GetDEDX(int ip,int iv); |
Float_t GetDEDX(int ip,int iv); |
173 |
|
Int_t GetLeverArmXY(); |
174 |
Int_t GetLeverArmX(); |
Int_t GetLeverArmX(); |
175 |
Int_t GetLeverArmY(); |
Int_t GetLeverArmY(); |
176 |
Float_t GetChi2X(); |
Float_t GetChi2X(); |
194 |
void SetStepMin(int istepmin); |
void SetStepMin(int istepmin); |
195 |
void SetDeltaB(int id, double db); |
void SetDeltaB(int id, double db); |
196 |
|
|
197 |
Bool_t IsInsideCavity(); |
Bool_t IsInsideCavity(float); |
198 |
|
Bool_t IsInsideCavity(){ return IsInsideCavity(0.); }; |
199 |
|
Bool_t IsInsideAcceptance(); |
200 |
|
|
201 |
Bool_t EvaluateClusterPositions(); |
Bool_t EvaluateClusterPositions(); |
202 |
|
|
211 |
Bool_t YGood(int ip){ return GetClusterY_ID(ip)!=-1; }; |
Bool_t YGood(int ip){ return GetClusterY_ID(ip)!=-1; }; |
212 |
void ResetXGood(int ip){ xgood[ip]=0; }; |
void ResetXGood(int ip){ xgood[ip]=0; }; |
213 |
void ResetYGood(int ip){ ygood[ip]=0; }; |
void ResetYGood(int ip){ ygood[ip]=0; }; |
214 |
void SetXGood(int ip, int clid, int is); |
/* void SetXGood(int ip, int clid, int is); */ |
215 |
void SetYGood(int ip, int clid, int is); |
/* void SetYGood(int ip, int clid, int is); */ |
216 |
|
void SetXGood(int ip, int clid, int il, int is, bool bad); |
217 |
|
void SetYGood(int ip, int clid, int il, int is, bool bad); |
218 |
|
void SetXGood(int ip, int clid, int il, int is){ SetXGood(ip,clid,il,is,false); }; |
219 |
|
void SetYGood(int ip, int clid, int il, int is){ SetYGood(ip,clid,il,is,false); }; |
220 |
|
|
221 |
|
|
222 |
Bool_t BadClusterX(int ip){ return IsBad(ip,0); }; |
Bool_t BadClusterX(int ip){ return IsBad(ip,0); }; |
223 |
Bool_t BadClusterY(int ip){ return IsBad(ip,1); }; |
Bool_t BadClusterY(int ip){ return IsBad(ip,1); }; |
231 |
Int_t GetClusterY_MaxStrip(int ip){ return (Int_t)(multmaxy[ip]%10000); }; |
Int_t GetClusterY_MaxStrip(int ip){ return (Int_t)(multmaxy[ip]%10000); }; |
232 |
Float_t GetClusterX_Seed(int ip){ return seedx[ip]; }; |
Float_t GetClusterX_Seed(int ip){ return seedx[ip]; }; |
233 |
Float_t GetClusterY_Seed(int ip){ return seedy[ip]; }; |
Float_t GetClusterY_Seed(int ip){ return seedy[ip]; }; |
234 |
/* Float_t GetClusterX_CoordinatePU(int ip); */ |
/* Float_t GetClusterX_oordinatePU(int ip); */ |
235 |
/* Float_t GetClusterY_CoordinatePU(int ip); */ |
/* Float_t GetClusterY_CoordinatePU(int ip); */ |
236 |
|
|
237 |
Float_t GetYav(); |
Float_t GetYav(); |
250 |
Float_t GetResidual_max(int ip, int iv); |
Float_t GetResidual_max(int ip, int iv); |
251 |
Float_t GetResidual_max(int iv){ return GetResidual_max(-1,iv); }; |
Float_t GetResidual_max(int iv){ return GetResidual_max(-1,iv); }; |
252 |
Float_t GetResidual_max(){ return GetResidual_max(-1,-1); }; |
Float_t GetResidual_max(){ return GetResidual_max(-1,-1); }; |
253 |
|
Float_t GetResidual_av(int ip, int iv); |
254 |
|
Float_t GetResidual_av(int iv){ return GetResidual_av(-1,iv); }; |
255 |
|
Float_t GetResidual_av(){ return GetResidual_av(-1,-1); }; |
256 |
|
|
257 |
Int_t GetClusterX_Multiplicity_max(); |
Int_t GetClusterX_Multiplicity_max(); |
258 |
Int_t GetClusterX_Multiplicity_min(); |
Int_t GetClusterX_Multiplicity_min(); |
266 |
|
|
267 |
friend class TrkLevel2; |
friend class TrkLevel2; |
268 |
|
|
269 |
ClassDef(TrkTrack,4); |
ClassDef(TrkTrack,5); |
270 |
|
|
271 |
}; |
}; |
272 |
/** |
/** |
284 |
int plane; ///<plane |
int plane; ///<plane |
285 |
float coord[2]; ///<coordinate (on sensor 1 and 2) |
float coord[2]; ///<coordinate (on sensor 1 and 2) |
286 |
float sgnl; ///<cluster signal in MIP (<0 if saturated) |
float sgnl; ///<cluster signal in MIP (<0 if saturated) |
287 |
|
int multmax; ///<cluster multiplicity and strip of maximum |
288 |
|
|
289 |
TrkSinglet(); |
TrkSinglet(); |
290 |
TrkSinglet(const TrkSinglet&); |
TrkSinglet(const TrkSinglet&); |
296 |
void Delete(){Clear();}; |
void Delete(){Clear();}; |
297 |
Float_t GetSignal(){return fabs(sgnl);} |
Float_t GetSignal(){return fabs(sgnl);} |
298 |
Bool_t IsSaturated(){return (sgnl<0); }; |
Bool_t IsSaturated(){return (sgnl<0); }; |
299 |
|
|
300 |
|
Bool_t IsBad() { return multmax<=0; }; |
301 |
|
Int_t GetCluster_Multiplicity(){ return (Int_t)(abs(multmax)/10000); }; |
302 |
|
Int_t GetCluster_MaxStrip() { return (Int_t)(abs(multmax)%10000); }; |
303 |
|
|
304 |
|
|
305 |
friend class TrkLevel2; |
friend class TrkLevel2; |
306 |
|
|
307 |
ClassDef(TrkSinglet,3); |
ClassDef(TrkSinglet,4); |
308 |
|
|
309 |
}; |
}; |
310 |
|
|
322 |
* The event status indicates the processing status of data from each DSP, according to the following |
* The event status indicates the processing status of data from each DSP, according to the following |
323 |
* notation: |
* notation: |
324 |
* |
* |
325 |
* xxxx xxxx xxxx xxxx xxxx xxxx |
* LSB --> 0 missing packet |
326 |
* |||| |||| |||| |||| |||| ||||_ 0 missing packet |
* 1 CRC error |
327 |
* |||| |||| |||| |||| |||| |||__ 1 CRC error |
* 2 on-line software alarm (latch-up, timeout ecc...) |
328 |
* |||| |||| |||| |||| |||| ||___ 2 on-line software alarm (latch-up, timeout ecc...) |
* 3 jump in the trigger counter |
329 |
* |||| |||| |||| |||| |||| |____ 3 jump in the trigger counter |
* 4 decode error |
330 |
* |||| |||| |||| |||| ||||______ 4 decode error |
* 5 n.clusters > maximum number (level1 processing) |
331 |
* |||| |||| |||| |||| |||_______ 5 n.clusters > maximum number (level1 processing) |
* 6 |
332 |
* |||| |||| |||| |||| ||________ 6 |
* 7 |
333 |
* |||| |||| |||| |||| |_________ 7 |
* 8 n.clusters > maximum value (level2 processing) |
334 |
* |||| |||| |||| ||||___________ 8 n.clusters > maximum value (level2 processing) |
* 9 n.couples per plane > maximum values (vector dimention) |
335 |
* |||| |||| |||| |||____________ 9 n.couples per plane > maximum values (vector dimention) |
* 10 n.doublets > maximum values |
336 |
* |||| |||| |||| ||_____________ 10 n.doublets > maximum values |
* 11 n.triplets > maximum values |
337 |
* |||| |||| |||| |______________ 11 n.triplets > maximum values |
* 12 n.yz-clouds > maximum values |
338 |
* |||| |||| ||||________________ 12 n.yz-clouds > maximum values |
* 13 n.xz-clouds > maximum values |
339 |
* |||| |||| |||_________________ 13 n.xz-clouds > maximum values |
* 14 n.candidate-tracks > maximum values |
340 |
* |||| |||| ||__________________ 14 n.candidate-tracks > maximum values |
* 15 n.couples per plane > maximum values (for Hough transform) |
341 |
* |||| |||| |___________________ 15 n.couples per plane > maximum values (for Hough transform) |
* MSB --> 16 |
|
* |||| ||||_____________________ 16 |
|
342 |
* |
* |
343 |
* |
* |
344 |
* For all data processed before June 2007 the event status was coded according to |
* For all data processed before June 2007 the event status was coded according to |
386 |
void Clear(Option_t *option){Clear();}; |
void Clear(Option_t *option){Clear();}; |
387 |
void Delete(); |
void Delete(); |
388 |
void Set(); |
void Set(); |
389 |
|
int UnpackError(){ for(int i=0; i<12; i++)if(!StatusCheck(i,0x12))return 1; return 0;}; |
390 |
|
|
391 |
int ntrk() {return Track->GetEntries();} ///< number of stored track |
int ntrk() {return Track->GetEntries();} ///< number of stored track |
392 |
int nclsx(){return SingletX->GetEntries();} ///< number of x singlets |
int nclsx(){return SingletX->GetEntries();} ///< number of x singlets |