Coverty from Megan
[u/mrichter/AliRoot.git] / ITS / UPGRADE / AliITSUTrackerGlo.h
CommitLineData
32d38de2 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 */
5
6//-------------------------------------------------------------------------
7// ITS upgrade tracker base class
8//-------------------------------------------------------------------------
9
10#include "AliTracker.h"
11#include "AliESDEvent.h"
f8832015 12#include "AliITSUSeed.h"
c8d1f258 13#include "AliITSUTrackCond.h"
716ccba7 14#include "AliITSUTrackHyp.h"
32d38de2 15
16class AliITSUReconstructor;
17class AliITSURecoDet;
c61e50c3 18class AliITSUClusterPix;
0091e9f0 19class AliESDtrack;
e2d2481c 20class AliITSURecoLayer;
32d38de2 21class TTree;
22
c61e50c3 23
32d38de2 24//-------------------------------------------------------------------------
25class AliITSUTrackerGlo : public AliTracker {
26
27 public:
c51c3124 28 enum {kClus2Tracks,kPropBack,kRefitInw}; // tracking phases
32d38de2 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)
c61e50c3 33 kNTrImpData};
32d38de2 34 //
f8832015 35 enum {kMissingCluster=0 // no cluster found on this layer
36 ,kTransportFailed=1 // seed did not reach target layer
32d38de2 37 ,kRWCheckFailed =2 // failed to rotate the seed to frame of the layer impact point
38 };
f8832015 39 enum {kStopSearchOnSensor,kClusterNotMatching,kClusterMatching}; // flags for track-to-cluster checks
32d38de2 40
41 AliITSUTrackerGlo(AliITSUReconstructor* rec);
42 virtual ~AliITSUTrackerGlo();
43
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;
0091e9f0 50 //------------------------------------
51 AliITSURecoDet* GetITSInterface() const {return fITS;}
52 //
32d38de2 53 //------------------------------------
54 Bool_t NeedToProlong(AliESDtrack* estTr);
55 void Init(AliITSUReconstructor* rec);
716ccba7 56 void FindTrack(AliESDtrack* esdTr, Int_t esdID);
3e4e3c23 57 Bool_t InitHypothesis(AliESDtrack *esdTr, Int_t esdID);
32d38de2 58 Bool_t TransportToLayer(AliITSUSeed* seed, Int_t lFrom, Int_t lTo);
3e4e3c23 59 Bool_t TransportToLayer(AliExternalTrackParam* seed, Int_t lFrom, Int_t lTo);
e2d2481c 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);
44785f3e 64 Bool_t PropagateSeed(AliITSUSeed *seed, Double_t xToGo, Double_t mass, Double_t maxStep=1.0, Bool_t matCorr=kTRUE);
3e4e3c23 65 Bool_t PropagateSeed(AliExternalTrackParam *seed, Double_t xToGo, Double_t mass, Double_t maxStep=1.0, Bool_t matCorr=kTRUE);
c51c3124 66 Bool_t RefitTrack(AliITSUTrackHyp* trc, Double_t r);
44785f3e 67 //
b8b59e05 68 void KillSeed(AliITSUSeed* seed, Bool_t branch=kFALSE);
c8d1f258 69 Bool_t NeedToKill(AliITSUSeed* seed, Int_t flag);
c61e50c3 70 Bool_t GetRoadWidth(AliITSUSeed* seed, int ilrA);
f8832015 71 Int_t CheckCluster(AliITSUSeed* seed, Int_t lr, Int_t clID);
72 void AddProlongationHypothesis(AliITSUSeed* seed, Int_t lr);
c61e50c3 73 //
74 AliITSUSeed* NewSeedFromPool(const AliITSUSeed* src=0);
b8b59e05 75 void ResetSeedsPool();
76 void MarkSeedFree(AliITSUSeed* seed );
77
716ccba7 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();
3e4e3c23 82 void FinalizeHypotheses();
c51c3124 83 void UpdateESDTrack(AliITSUTrackHyp* hyp);
716ccba7 84 //
b8b59e05 85 protected:
86 TObject*& NextFreeSeed();
87 //
32d38de2 88 private:
b8b59e05 89 //
32d38de2 90 AliITSUTrackerGlo(const AliITSUTrackerGlo&);
91 AliITSUTrackerGlo &operator=(const AliITSUTrackerGlo &tr);
92 //
93 protected:
94 AliITSUReconstructor* fReconstructor; // ITS global reconstructor
95 AliITSURecoDet* fITS; // interface to ITS
0091e9f0 96 AliESDtrack* fCurrESDtrack; // current esd track in processing
32d38de2 97 Double_t fCurrMass; // current track mass
c61e50c3 98 Double_t fTrImpData[kNTrImpData]; // data on track impact on the layer
32d38de2 99 //
c61e50c3 100 // the seeds management to be optimized
716ccba7 101 TObjArray fHypStore; // storage for tracks hypotheses
102 AliITSUTrackHyp* fCurrHyp; // hypotheses container for current track
b8b59e05 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
c8d1f258 107 //
108 AliITSUTrackCond fTrCond; // tmp, to be moved to recoparam
c51c3124 109 Int_t fTrackPhase; // tracking phase
8b16dbae 110 Int_t* fClInfo; //! auxiliary track cluster info
c8d1f258 111 //
e2d2481c 112 static const Double_t fgkToler; // tracking tolerance
113 //
32d38de2 114 ClassDef(AliITSUTrackerGlo,1) //ITS upgrade tracker
115
116};
f8832015 117
118//_________________________________________________________________________
119inline void AliITSUTrackerGlo::AddProlongationHypothesis(AliITSUSeed* seed, Int_t lr)
120{
121 // add new seed prolongation hypothesis
716ccba7 122 fCurrHyp->AddSeed(seed,lr);
c8d1f258 123 printf("*** Adding: "); seed->Print();
f8832015 124}
125
b8b59e05 126//________________________________________
127inline TObject *&AliITSUTrackerGlo::NextFreeSeed()
128{
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 ];
133 //
134}
135
136//_________________________________________________________________________
137inline AliITSUSeed* AliITSUTrackerGlo::NewSeedFromPool(const AliITSUSeed* src)
138{
139 // create new seed, optionally copying from the source
140 AliITSUSeed* sd = src ? new( NextFreeSeed() ) AliITSUSeed(*src) : new( NextFreeSeed() ) AliITSUSeed();
141 sd->SetPoolID(fLastSeedID);
142 return sd;
143}
144
145//_________________________________________________________________________
146inline void AliITSUTrackerGlo::KillSeed(AliITSUSeed* seed, Bool_t branch)
147{
148 // flag seed as killed, if requested, kill recursively its parents whose sole child is the seed being killed
149 seed->Kill();
150 seed = (AliITSUSeed*)seed->GetParent();
151 if (seed && !seed->DecChildren() && branch) KillSeed(seed,branch);
152}
f8832015 153
32d38de2 154#endif
155