1 #ifndef ALIITSTRACKERU_H
2 #define ALIITSTRACKERU_H
3 /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * See cxx source for full Copyright notice */
6 //-------------------------------------------------------------------------
7 // ITS upgrade tracker base class
8 //-------------------------------------------------------------------------
9 #include "AliTracker.h"
10 #include "AliESDEvent.h"
11 #include "AliITSUSeed.h"
12 #include "AliITSUTrackCond.h"
13 #include "AliITSUTrackHyp.h"
14 #include "AliITSUAux.h"
15 #include "AliITSUMatLUT.h"
18 class AliITSUReconstructor;
20 class AliITSUClusterPix;
22 class AliITSURecoLayer;
25 //-------------------------------------------------------------------------
26 class AliITSUTrackerGlo : public AliTracker {
29 enum {kClus2Tracks,kPropBack,kRefitInw,kNTrackingPhases}; // tracking phases
30 enum { // info from track extrapolation to layer for cluster check
31 kTrXIn ,kTrYIn ,kTrZIn ,kTrPhiIn , // entrance (outer) point on the layer from above
32 kTrXOut,kTrYOut,kTrZOut,kTrPhiOut, // exit (inner) point on the layer
33 kTrPhi0, kTrDPhi, kTrZ0, kTrDZ, // mean phi,dPhi, mean z, dZ (don't change this order)
36 enum {kMissingCluster=0 // no cluster found on this layer
37 ,kTransportFailed=1 // seed did not reach target layer
38 ,kRWCheckFailed =2 // failed to rotate the seed to frame of the layer impact point
40 enum {kStopSearchOnSensor,kClusterNotMatching,kClusterMatching}; // flags for track-to-cluster checks
42 enum {kDummyLabel=-3141593};
44 AliITSUTrackerGlo(AliITSUReconstructor* rec);
45 virtual ~AliITSUTrackerGlo();
47 virtual Int_t Clusters2Tracks(AliESDEvent *event);
48 virtual Int_t PropagateBack(AliESDEvent *event);
49 virtual Int_t RefitInward(AliESDEvent *event);
50 virtual Int_t LoadClusters(TTree * treeRP=0);
51 virtual void UnloadClusters();
52 virtual AliCluster* GetCluster(Int_t index) const;
53 void PrintSeedClusters(const AliITSUSeed* seed, Option_t* option="");
55 Int_t GetCountPronlongationTrials() const {return fCountProlongationTrials;}
56 Int_t GetCountITSin() const {return fCountITSin;}
57 Int_t GetCountITSout() const {return fCountITSout;}
58 Int_t GetCountITSrefit() const {return fCountITSrefit;}
60 //------------------------------------
61 AliITSURecoDet* GetITSInterface() const {return fITS;}
63 //------------------------------------
64 Bool_t NeedToProlong(AliESDtrack* estTr, Int_t esdID);
65 void Init(AliITSUReconstructor* rec);
66 void FindTrack(AliESDtrack* esdTr, Int_t esdID);
67 void CreateDefaultTrackCond();
68 AliITSUTrackHyp* InitHypothesis(AliESDtrack *esdTr, Int_t esdID);
69 Bool_t TransportToLayer(AliITSUSeed* seed, Int_t lFrom, Int_t lTo, Double_t rLim=-1);
70 Bool_t TransportToLayer(AliExternalTrackParam* seed, Int_t lFrom, Int_t lTo, Double_t rLim=-1);
71 Bool_t TransportToLayerX(AliExternalTrackParam* seed, Int_t lFrom, Int_t lTo, Double_t xStop);
72 Bool_t GoToExitFromLayer(AliITSUSeed* seed, AliITSURecoLayer* lr, Int_t dir, Bool_t check=kTRUE);
73 Bool_t GoToExitFromLayer(AliExternalTrackParam* seed, AliITSURecoLayer* lr, Int_t dir, Bool_t check=kTRUE);
74 Bool_t GoToEntranceToLayer(AliITSUSeed* seed, AliITSURecoLayer* lr, Int_t dir, Bool_t check=kFALSE);
75 Bool_t GoToEntranceToLayer(AliExternalTrackParam* seed, AliITSURecoLayer* lr, Int_t dir, Bool_t check=kFALSE);
76 Bool_t PropagateSeed(AliITSUSeed *seed, Double_t xToGo, Double_t mass, Double_t maxStep=1.0, Bool_t matCorr=kTRUE);
77 Bool_t PropagateSeed(AliExternalTrackParam *seed, Double_t xToGo, Double_t mass, Double_t maxStep=1.0, Bool_t matCorr=kTRUE);
78 Double_t RefitTrack(AliITSUTrackHyp* trc, Double_t r, Int_t& nclFit, Int_t stopCond=0);
79 Double_t GetMaterialBudget(const double* pnt0, const double* pnt1, double& x2x0, double& rhol) const;
81 Int_t GetTrackingPhase() const {return fTrackPhaseID;}
84 void KillSeed(AliITSUSeed* seed, Bool_t branch=kFALSE);
85 Bool_t NeedToKill(AliITSUSeed* seed, Int_t flag);
86 Bool_t GetRoadWidth(AliITSUSeed* seed, int ilrA);
87 Bool_t CheckBackwardMatching(AliITSUSeed* seed);
88 Int_t CheckCluster(AliITSUSeed* seed, Int_t lr, Int_t clID);
89 void AddProlongationHypothesis(AliITSUSeed* seed, Int_t lr);
90 Bool_t AddSeedBranch(AliITSUSeed* seed);
91 void ValidateAllowedBranches(Int_t accMax);
92 void ValidateAllowedCandidates(Int_t ilr, Int_t accMax);
93 void FlagSeedClusters(const AliITSUSeed* seed, Bool_t flg, UShort_t hypRef);
95 AliITSUSeed* NewSeedFromPool(const AliITSUSeed* src=0);
96 void ResetSeedsPool();
97 void MarkSeedFree(AliITSUSeed* seed );
99 AliITSUTrackHyp* GetTrackHyp(Int_t id) const {return (AliITSUTrackHyp*)fHypStore.UncheckedAt(id);}
100 void SetTrackHyp(AliITSUTrackHyp* hyp,Int_t id) {fHypStore.AddAtAndExpand(hyp,id);}
101 void DeleteLastSeedFromPool() {fSeedsPool.RemoveLast();}
102 void CheckClusterSharingConflicts(AliITSUTrackHyp* hyp);
103 void SaveReducedHypothesesTree(AliITSUTrackHyp* dest);
104 void CleanHypothesis(AliITSUTrackHyp* hyp);
105 void FinalizeHypotheses();
106 Bool_t FinalizeHypothesis(AliITSUTrackHyp* hyp);
107 void UpdateESDTrack(AliITSUTrackHyp* hyp,Int_t flag);
108 void CookMCLabel(AliITSUTrackHyp* hyp);
109 void SetTrackingPhase(Int_t p) {fTrackPhaseID = p;}
112 void FlagSplitClusters();
113 Bool_t ContainsSplitCluster(const AliITSUSeed* seed, Int_t maxSize=99999);
114 void CheckClusterUsage();
117 TObject*& NextFreeSeed();
121 AliITSUTrackerGlo(const AliITSUTrackerGlo&);
122 AliITSUTrackerGlo &operator=(const AliITSUTrackerGlo &tr);
125 AliITSUReconstructor* fReconstructor; // ITS global reconstructor
126 AliITSURecoDet* fITS; // interface to ITS, borrowed from reconstructor
127 AliITSUMatLUT* fMatLUT; // material lookup table
128 AliESDtrack* fCurrESDtrack; // current esd track in processing
129 Int_t fCurrESDtrMClb; // its eventual mc label
130 Double_t fCurrMass; // current track mass
131 Double_t fTrImpData[kNTrImpData]; // data on track impact on the layer
133 Int_t fCountProlongationTrials; // number of TPC seeds
134 Int_t fCountITSin; // number of successful ITSin
135 Int_t fCountITSout; // number of successful ITSout
136 Int_t fCountITSrefit; // number of successful ITSrefit
137 Int_t fNTracksESD; // number of esd tracks
139 // the seeds management to be optimized
140 TObjArray fHypStore; // storage for tracks hypotheses
141 Int_t fLayerMaxCandidates; //! size of tmp candidates array
142 AliITSUSeed** fLayerCandidates;//! array for branches of current track prolongation
143 Int_t fNBranchesAdded; // number of branches created for current seed in prolongation
144 Int_t fNCandidatesAdded; // number of candidates added for current seed in prolongation
145 AliITSUTrackHyp* fCurrHyp; //! hypotheses container for current track
146 AliITSUTrackHyp* fWorkHyp; //! temporary hypothesis for track finding
147 TClonesArray fSeedsPool; //! pool for seeds
148 TArrayI fFreeSeedsID; //! array of ID's of freed seeds
149 TArrayI fESDIndex; //! array of ID's of freed seeds
150 Int_t fNFreeSeeds; //! number of seeds freed in the pool
151 Int_t fLastSeedID; //! id of the pool seed on which is returned by the NextFreeSeed method
152 Int_t fNLrActive; //! number of active layers
154 TObjArray fDefTrackConds; //! default tracking conditions
155 AliITSUTrackCond* fCurrTrackCond; //! current tracking condition
156 Int_t fCurrActLrID; //! current active layer ID being processed (set only when needed, not guaranteed)
157 AliITSURecoLayer* fCurrLayer; //! current layer being processed (set only when needed, not guaranteed)
158 Int_t fTrackPhaseID; //! tracking phase (clusters2tracks, backward, inward)
159 Int_t fCurrPassID; //! tracking pass (different tracking conditions)
160 Bool_t fUseMatLUT; //! use material lookup table rather than TGeo
162 static const Double_t fgkToler; // tracking tolerance
164 #ifdef _ITSU_TUNING_MODE_
165 // this code is only for special histos needed to extract some control parameters
166 Int_t GetHistoID(Int_t lr, Int_t hid, Int_t pass=0, Int_t phase=0);
167 TObjArray* BookControlHistos(const char* pref);
168 TObjArray* fCHistoArrCorr; // set of histos for each tracking pass/phase: correct
169 TObjArray* fCHistoArrFake; // set of histos for each tracking pass/phase: fakse
170 enum {kHResY,kHResYP,kHResZ,kHResZP,kHChi2Cl,kHChi2Nrm,kHBestInBranch,kHBestInCand,kMaxHID=10};
171 enum {kHChiMatch,kHChiITSSA}; // custom histos
172 enum {kHistosPhase=kMaxHID*(AliITSUAux::kMaxLayers+1),kHistosPass=kNTrackingPhases*kHistosPhase};
176 ClassDef(AliITSUTrackerGlo,1) //ITS upgrade tracker
180 //________________________________________
181 inline TObject *&AliITSUTrackerGlo::NextFreeSeed()
183 // return next free slot where the seed can be created
184 fLastSeedID = fNFreeSeeds ? fFreeSeedsID.GetArray()[--fNFreeSeeds] : fSeedsPool.GetEntriesFast();
185 // AliInfo(Form("%d",fLastSeedID));
186 return fSeedsPool[ fLastSeedID ];
190 //_________________________________________________________________________
191 inline AliITSUSeed* AliITSUTrackerGlo::NewSeedFromPool(const AliITSUSeed* src)
193 // create new seed, optionally copying from the source
194 AliITSUSeed* sd = src ? new( NextFreeSeed() ) AliITSUSeed(*src) : new( NextFreeSeed() ) AliITSUSeed();
195 sd->SetPoolID(fLastSeedID);
199 //_________________________________________________________________________
200 inline void AliITSUTrackerGlo::KillSeed(AliITSUSeed* seed, Bool_t branch)
202 // flag seed as killed, if requested, kill recursively its parents whose sole child is the seed being killed
204 seed = (AliITSUSeed*)seed->GetParent();
205 if (seed && !seed->DecChildren() && branch) KillSeed(seed,branch);
208 //_________________________________________________________________________
209 inline void AliITSUTrackerGlo::AddProlongationHypothesis(AliITSUSeed* seed, Int_t lr)
211 // add new seed prolongation hypothesis
212 #ifdef _ITSU_TUNING_MODE_
213 seed->SetOrdCand(fCurrHyp->GetNSeeds(lr));
215 fCurrHyp->AddSeed(seed,lr);
218 //_________________________________________________________________________
219 inline Double_t AliITSUTrackerGlo::GetMaterialBudget(const double* pnt0,const double* pnt1, double& x2x0, double& rhol) const
222 if (fUseMatLUT && fMatLUT) {
223 double d = fMatLUT->GetMatBudget(pnt0,pnt1,par);
224 x2x0 = par[AliITSUMatLUT::kParX2X0];
225 rhol = par[AliITSUMatLUT::kParRhoL];
229 MeanMaterialBudget(pnt0,pnt1,par);
231 rhol = par[0]*par[4];