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 //-------------------------------------------------------------------------
10 #include "AliTracker.h"
11 #include "AliESDEvent.h"
12 #include "AliITSUSeed.h"
13 #include "AliITSUTrackCond.h"
14 #include "AliITSUTrackHyp.h"
16 class AliITSUReconstructor;
18 class AliITSUClusterPix;
20 class AliITSURecoLayer;
24 //-------------------------------------------------------------------------
25 class AliITSUTrackerGlo : public AliTracker {
28 enum {kClus2Tracks,kPropBack,kRefitInw}; // tracking phases
29 enum { // info from track extrapolation to layer for cluster check
30 kTrXIn ,kTrYIn ,kTrZIn ,kTrPhiIn , // entrance (outer) point on the layer from above
31 kTrXOut,kTrYOut,kTrZOut,kTrPhiOut, // exit (inner) point on the layer
32 kTrPhi0, kTrDPhi, kTrZ0, kTrDZ, // mean phi,dPhi, mean z, dZ (don't change this order)
35 enum {kMissingCluster=0 // no cluster found on this layer
36 ,kTransportFailed=1 // seed did not reach target layer
37 ,kRWCheckFailed =2 // failed to rotate the seed to frame of the layer impact point
39 enum {kStopSearchOnSensor,kClusterNotMatching,kClusterMatching}; // flags for track-to-cluster checks
41 AliITSUTrackerGlo(AliITSUReconstructor* rec);
42 virtual ~AliITSUTrackerGlo();
44 virtual Int_t Clusters2Tracks(AliESDEvent *event);
45 virtual Int_t PropagateBack(AliESDEvent *event);
46 virtual Int_t RefitInward(AliESDEvent *event);
47 virtual Int_t LoadClusters(TTree * treeRP=0);
48 virtual void UnloadClusters();
49 virtual AliCluster* GetCluster(Int_t index) const;
50 //------------------------------------
51 AliITSURecoDet* GetITSInterface() const {return fITS;}
53 //------------------------------------
54 Bool_t NeedToProlong(AliESDtrack* estTr);
55 void Init(AliITSUReconstructor* rec);
56 void FindTrack(AliESDtrack* esdTr, Int_t esdID);
57 Bool_t InitHypothesis(AliESDtrack *esdTr, Int_t esdID);
58 Bool_t TransportToLayer(AliITSUSeed* seed, Int_t lFrom, Int_t lTo);
59 Bool_t TransportToLayer(AliExternalTrackParam* seed, Int_t lFrom, Int_t lTo);
60 Bool_t GoToExitFromLayer(AliITSUSeed* seed, AliITSURecoLayer* lr, Int_t dir, Bool_t check=kFALSE);
61 Bool_t GoToExitFromLayer(AliExternalTrackParam* seed, AliITSURecoLayer* lr, Int_t dir, Bool_t check=kFALSE);
62 Bool_t GoToEntranceToLayer(AliITSUSeed* seed, AliITSURecoLayer* lr, Int_t dir, Bool_t check=kFALSE);
63 Bool_t GoToEntranceToLayer(AliExternalTrackParam* seed, AliITSURecoLayer* lr, Int_t dir, Bool_t check=kFALSE);
64 Bool_t PropagateSeed(AliITSUSeed *seed, Double_t xToGo, Double_t mass, Double_t maxStep=1.0, Bool_t matCorr=kTRUE);
65 Bool_t PropagateSeed(AliExternalTrackParam *seed, Double_t xToGo, Double_t mass, Double_t maxStep=1.0, Bool_t matCorr=kTRUE);
66 Bool_t RefitTrack(AliITSUTrackHyp* trc, Double_t r);
68 void KillSeed(AliITSUSeed* seed, Bool_t branch=kFALSE);
69 Bool_t NeedToKill(AliITSUSeed* seed, Int_t flag);
70 Bool_t GetRoadWidth(AliITSUSeed* seed, int ilrA);
71 Int_t CheckCluster(AliITSUSeed* seed, Int_t lr, Int_t clID);
72 void AddProlongationHypothesis(AliITSUSeed* seed, Int_t lr);
74 AliITSUSeed* NewSeedFromPool(const AliITSUSeed* src=0);
75 void ResetSeedsPool();
76 void MarkSeedFree(AliITSUSeed* seed );
78 AliITSUTrackHyp* GetTrackHyp(Int_t id) const {return (AliITSUTrackHyp*)fHypStore.UncheckedAt(id);}
79 void SetTrackHyp(AliITSUTrackHyp* hyp,Int_t id) {fHypStore.AddAtAndExpand(hyp,id);}
80 void DeleteLastSeedFromPool() {fSeedsPool.RemoveLast();}
81 void SaveCurrentTrackHypotheses();
82 void FinalizeHypotheses();
83 void UpdateESDTrack(AliITSUTrackHyp* hyp);
86 TObject*& NextFreeSeed();
90 AliITSUTrackerGlo(const AliITSUTrackerGlo&);
91 AliITSUTrackerGlo &operator=(const AliITSUTrackerGlo &tr);
94 AliITSUReconstructor* fReconstructor; // ITS global reconstructor
95 AliITSURecoDet* fITS; // interface to ITS
96 AliESDtrack* fCurrESDtrack; // current esd track in processing
97 Double_t fCurrMass; // current track mass
98 Double_t fTrImpData[kNTrImpData]; // data on track impact on the layer
100 // the seeds management to be optimized
101 TObjArray fHypStore; // storage for tracks hypotheses
102 AliITSUTrackHyp* fCurrHyp; // hypotheses container for current track
103 TClonesArray fSeedsPool; //! pool for seeds
104 TArrayI fFreeSeedsID; //! array of ID's of freed seeds
105 Int_t fNFreeSeeds; //! number of seeds freed in the pool
106 Int_t fLastSeedID; //! id of the pool seed on which is returned by the NextFreeSeed method
108 AliITSUTrackCond fTrCond; // tmp, to be moved to recoparam
109 Int_t fTrackPhase; // tracking phase
110 Int_t* fClInfo; //! auxiliary track cluster info
112 static const Double_t fgkToler; // tracking tolerance
114 ClassDef(AliITSUTrackerGlo,1) //ITS upgrade tracker
118 //_________________________________________________________________________
119 inline void AliITSUTrackerGlo::AddProlongationHypothesis(AliITSUSeed* seed, Int_t lr)
121 // add new seed prolongation hypothesis
122 fCurrHyp->AddSeed(seed,lr);
123 printf("*** Adding: "); seed->Print();
126 //________________________________________
127 inline TObject *&AliITSUTrackerGlo::NextFreeSeed()
129 // return next free slot where the seed can be created
130 fLastSeedID = fNFreeSeeds ? fFreeSeedsID.GetArray()[--fNFreeSeeds] : fSeedsPool.GetEntriesFast();
131 // AliInfo(Form("%d",fLastSeedID));
132 return fSeedsPool[ fLastSeedID ];
136 //_________________________________________________________________________
137 inline AliITSUSeed* AliITSUTrackerGlo::NewSeedFromPool(const AliITSUSeed* src)
139 // create new seed, optionally copying from the source
140 AliITSUSeed* sd = src ? new( NextFreeSeed() ) AliITSUSeed(*src) : new( NextFreeSeed() ) AliITSUSeed();
141 sd->SetPoolID(fLastSeedID);
145 //_________________________________________________________________________
146 inline void AliITSUTrackerGlo::KillSeed(AliITSUSeed* seed, Bool_t branch)
148 // flag seed as killed, if requested, kill recursively its parents whose sole child is the seed being killed
150 seed = (AliITSUSeed*)seed->GetParent();
151 if (seed && !seed->DecChildren() && branch) KillSeed(seed,branch);